Abstract
Sensors typically have limited power of transmission. Thus desired connectivity probability (CP) between the sensors is critical in the given deployment area. This paper presents a novel approach for analyzing the lower bound of CP for sensor networks under uniformly distribution of the sensors in a given area.
This work is fully sponsored by grants from Research Grant Council RGC Hong Kong, SAR China (projects Nos. CityU 1039/02E, CityU 1055/01E).
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Royer, E.M.: A Review of Current Routing Protocols for Ad Hoc Mobile Wireless Networks. IEEE Personal Communication 4(2), 46–55 (1999)
Chakrabarti, S., Mishra, A.: QoS issues in Ad hoc wireless networks. IEEE Communication Magazine 39(2), 142–148 (2001)
Basagni, S., Turgut, D., Das, S.K.: Mobility-adaptive protocols for managing large ad hoc networks. In: IEEE International Conference on Communications (ICC 2001), vol. 5, pp. 1539–1543 (2001)
Sanchez, M., Manzoni, P., Haas, Z.J.: Determination of Critical transmission Range in Ad-Hoc Networks. In: Proceedings of Multiaccess Mobility and Teletraffic for Wireless Communications 1999 Workshop (MMT 1999), Venice, Italy (1999)
Li, L., Halpern, J.: Minimum Energy Mobile Wireless Networks Revisited. In: IEEE International Conference on Communications (ICC), vol. 1, pp. 278–283 (2001)
Kirousis, L.M., Kranakis, E., Krizanc, D., Pelc, A.: Power consumption in packet radio networks. Theoretical Computer Science 243, 289–305 (2000)
Santi, P., Blough, D.M., Vainstein, F.: A Probabilistic Analysis for the Range Assignment Problem in Ad Hoc Networks. In: Proc. ACM Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc), Long Beach, pp. 212–220 (2001)
Xue, F., Kumar, P.R.: The number of neighbors needed for connectivity of wireless networks. Wireless Network (2002) (submitted to)
Gupta, P., Kumar, P.R.: Critical Power for Asymptotic Connectivity in Wireless Networks. In: McEneany, W.M., et al. (eds.) Stochastic Analysis, Control, Optimization and Applications, pp. 547–566. Birkhauser, Boston (1998)
Li, J., Jannotti, J., De Couto, D.S.J., Karger, D.R., Morris, R.: A scalable Location service for geographic ad hoc routing. In: Proceedings of the 6th ACM International Conference on Mobile Computing and Networking (MobiCom 2000), Boston, Massachusetts, pp. 120–130 (2000)
Boleng, J., Camp, T., Tolety, V.: Mesh-based geocast routing protocols in an ad hoc network. In: Proceedings of the International Workshop on Parallel and Distributed Computing Issues in Wireless Networks and Mobile Computing (IPDPS 2001), pp. 184–193 (2001)
Mathai, M.: An introduction to geometrical probability: Distributional aspects with applications. Gordon and Breach Science Publishers (1999)
Warneke, B., Last, M., Liebowitz, B., Pister, K.S.J.: Smart Dust: communicating with a cubic-millimeter computer. IEEE Computer 34(1), 44–51 (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jia, W., Fu, Y., Wang, J. (2004). Analysis of Connectivity for Sensor Networks Using Geometrical Probability. In: Yang, L.T., Guo, M., Gao, G.R., Jha, N.K. (eds) Embedded and Ubiquitous Computing. EUC 2004. Lecture Notes in Computer Science, vol 3207. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30121-9_57
Download citation
DOI: https://doi.org/10.1007/978-3-540-30121-9_57
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22906-3
Online ISBN: 978-3-540-30121-9
eBook Packages: Springer Book Archive