research-article

Results on finite wireless sensor networks: Connectivity and coverage

Authors:

Mohammad Nekoui,

Hossein Pishro-Nik,

Faramarz FekriAuthors Info & Claims

ACM Transactions on Sensor Networks (TOSN), Volume 9, Issue 4

Article No.: 51, Pages 1 - 22

https://doi.org/10.1145/2489253.2489268

Published: 23 July 2013 Publication History

Abstract

Many analytic results for the connectivity, coverage, and capacity of wireless networks have been reported for the case where the number of nodes, n, tends to infinity (large-scale networks). The majority of these results have not been extended for small or moderate values of n; whereas in many practical networks, n is not very large. In this article, we consider finite (small-scale) wireless sensor networks. We first show that previous asymptotic results provide poor approximations for such networks. We provide a set of differences between small-scale and large-scale analysis and propose a methodology for analysis of finite sensor networks. Furthermore, we consider two models for such networks: unreliable sensor grids and sensor networks with random node deployment. We provide easily computable expressions for bounds on the coverage and connectivity of these networks. With validation from simulations, we show that the derived analytic expressions give very good estimates of such quantities for finite sensor networks. Our investigation confirms the fact that small-scale networks possess unique characteristics different from their large-scale counterparts, necessitating the development of a new framework for their analysis and design.

References

[1]

Akyildiz, I. F., Su, W., Sankarasubramaniam, Y., and Cayirci, E. 2002. A survey on sensor networks. IEEE Communi. Mag. 102--114.

Digital Library

[2]

Bai, X., Kumar, S., Xuan, D., Yun, Z., and Lai, T. H. 2006. Deploying wireless sensors to achieve both coverage and connectivity. In Proceedings of the ACM International Symposium Mobile Ad Hoc Networking and Computing (MobiHoc). 131--142.

Digital Library

[3]

Balakrishan, H., Barrett, C. L., Kumar, V. S. A., Marathe, M. V., and Thite, S. 2004. The distance-2 matching problem and its relationship to MAC-layer capacity of ad hoc wireless networks. IEEE J. Select. Areas Commun. 22, 1069--1079.

Digital Library

[4]

Balister, P., Bollobas, B., Sarkar, A., and Kumar, S. 2007. Reliable density estimates for coverage and connectivity in thin strips of finite length. In Proceedings of the 13th Annual ACM International Conference on Mobile Computing and Networking (MobiCom'07). 75--86.

Digital Library

[5]

Balister, P. and Kumar, S. 2009. Random vs. deterministic deployment of sensors in the presence of failures and placement errorss. In Proceedings of the Annual Joint Conference of the IEEE Computer and Communications Societies. 2896--2900.

[6]

Balister, P., Zheng, Z., Kumar, S., and Sinha, P. 2009. trap coverage: Allowing coverage holes of bounded diameter in wireless sensor networks. In Proceedings of the Annual Joint Conference of the IEEE Computer and Communications Societies (InfoCom). 136--144.

[7]

Bollobás, B. 2001. Random Graphs 2nd Ed. Cambridge University Press, Cambridge, U.K.

[8]

Booth, L., Bruck, J., Franceschetti, M., and Meester, R. 2003. Covering algorithms, continuum percolation and the geometry of wireless networks. Ann. Appl. Probab. 13, 2.

[9]

Booth, L., Bruck, J., Cook, M., Franceschetti, M., and Meester, R. 2005. Continuum percolation with unreliable and spread out connections. J. Stat. Physics 118, 3--4, 721--734.

[10]

Desai, M. and Manjunath, D. 2002. On the connectivity in finite ad hoc networks. IEEE Communi. Lett. 6, 10, 437--439.

[11]

Dousse, O., Franceschetti, M., and Thiran, P. 2006. On the throughput scaling of wireless relay networks. IEEE Trans. Inform. Theory 52, 6, 2756--2761.

Digital Library

[12]

Dousse, O. and Thiran, P. 2004. Connectivity vs capacity in dense ad hoc networks. In Proceedings of the Annual Joint Conference of the IEEE Computer and Communications Societies (InfoCom).

[13]

Dousse, O., Thiran, P., and Hasler, M. 2002. Connectivity in ad-hoc and hybrid networks. In Proceedings of the Annual Joint Conference of the IEEE Computer and Communications Societies (InfoCom).

[14]

Dubhashi, D., Häggström, O., and Panconesi, A. 2003. Connectivity properties of bluetooth wireless networks. http://www.math.chalmers.se/&sim;olleh/papers.html.

[15]

Eslami, A., Nekoui, M., and Pishro-Nik, H. 2010. Results on finite wireless networks on a line. IEEE Trans. Communi. 58, 8, 2204--2211.

Digital Library

[16]

Fortuin, C. M., Kasteleyn, P. W., and Ginibre, J. 1971. Correlation inequalities on some partially ordered sets. Commun. Math. Physics 22, 2, 89--103.

[17]

Franceschetti, M. and Meester, R. 2008. Random Networks for Communication: From Statistical Physics to Information Systems. Cambridge University Press, Cambridge, U.K.

[18]

Freanceschetti, M. and Meester, R. 2006. Critical node lifetimes in random networks via the Chen-Stein method. IEEE Trans. Inform. Theory 52, 2, 2831--2837.

[19]

Ghasemi, A. and Nader-Esfahani, S. 2006. Exact probability of connectivity in one-dimensional ad hoc wireless networks. IEEE Commun. Lett. 10, 251--253.

[20]

Gore, A. 2006. Comments on the connectivity in finite ad hoc networks. IEEE Communi. Lett. 10, 2, 88--90.

[21]

Grossglauser, M. and Tse, D. 2001. Mobility increases the capacity of ad-hoc wireless networks. In Proceedings of the Annual Joint Conference of the IEEE Computer and Communications Societies (InfoCom).

[22]

Gupta, P. and Kumar, P. 1998. Critical power for asymptotic connectivity in wireless networks. Stochastic Analysis, Control, Optimization and Applications: A Volume in Honor of W.H. Fleming, W. M. McEneaney, G. Yin, and Q. Zhang, Eds. Birkhäuser, Berlin.

[23]

Gupta, P. and Kumar, P. R. 2000. The capacity of wireless networks. IEEE Trans. Inform. Theory 46, 2, 388--404.

Digital Library

[24]

Gupta, P. and Kumar, P. R. 2003. Towards an information theory of large networks: an achievable rate region. IEEE Trans. Inform. Theory 49, 1877--1894.

Digital Library

[25]

Janson, S. 1986. Random coverings in several dimensions. Acta Mathematica 156.

[26]

Karmachandani, N., Manjunath, D., Yogeshwaran, D., and Iyer, S. K. 2006. Evolving random geometric graph models for mobile wireless networks. In Proceedings of the 4th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WIOPT'06).

[27]

Kumar, S., Lai, T. H., and Balogh, J. 2004. On k-coverage in mostly sleeping sensor network. In Proceedings of the ACM International Conference on Mobile Computing and Networking (MobiCom).

Digital Library

[28]

Kumar, S., Lai, T. H., and Balogh, J. 2008. On k-coverage in mostly sleeping sensor network. Wireless Netw. 277--294.

Digital Library

[29]

Li, J., Blake, C., De Couto, D. S. J., Lee, H. I., and Morris, R. 2001. Capacity of ad hoc wireless netw. In Proceedings of the 7th ACM International Conference on Mobile Computing and Networking. 61--69.

Digital Library

[30]

Li, X. Y., Wan, P., Wang, Y., and Yi, C. W. 2003. Fault tolerant deployment and topology control in wireless networks. In Proceedings of the ACM Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc'03).

Digital Library

[31]

Liu, B., Liu, Z., and Towsley, D. 2003. On the capacity of hybrid wireless networks. In Proceedings of the Annual Joint Conference of the IEEE Computer and Communications Societies (InfoCom).

[32]

Meester, R. and Roy, R. 1996. Continuum Percolation. Cambridge University Press, Cambridge U.K.

[33]

Penrose, M. 2003. Random Geometric Graphs. Oxford University Press, Oxford, U.K.

[34]

Penrose, M. D. 1997. The longest edge of the random minimal spanning tree. Ann. Appl. Probab. 7, 2, 340--361.

[35]

Perevalov, E. and Blum, R. 2003. Delay limited capacity of ad hoc networks: Asymptotically optimal transmission and relaying strategy. In Proceedings of the Annual Joint Conference of the IEEE Computer and Communications Societies (InfoCom).

[36]

Pishro-Nik, H., Chan, K. S., and Fekri, F. 2004. On connectivity properties of large-scale sensor networks. In Proceedings of the 1st Annual IEEE International Conference on Sensor and Ad Hoc Communications and Networks. 467--472.

[37]

Shakkottai, S., Srikant, R., and Shroff, N. 2003. Unreliable sensor grids: Coverage, connectivity and diameter. In Proceedings of the Annual Joint Conference of the IEEE Computer and Communications Societies (InfoCom'03).

[38]

Wan, P. and Yi, C. W. 2004. Asymptotic critical transmission radius and critical neighbor number for k-connectivity in wireless ad hoc networks. In Proceedings of the ACM Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc'04).

Digital Library

[39]

Xue, F. and Kumar, P. R. 2004. The number of neighbors needed for connectivity of wireless networks. Wireless Netw. 10, 2, 169--181.

Digital Library

[40]

Yen, L.-H. and Yu, C. W. 2004. Link probability, network coverage, and related properties of wireless ad hoc networks. In Proceedings of the 1st International Conference on Mobile Ad-Hoc and Sensor Systems (MASS'04).

Cited By

Das SKapelko R(2021)On the Range Assignment in Wireless Sensor Networks for Minimizing the Coverage-Connectivity CostACM Transactions on Sensor Networks10.1145/345740817:4(1-48)Online publication date: 10-Aug-2021
https://dl.acm.org/doi/10.1145/3457408
Yue YCao LLuo Z(2019)Hybrid Artificial Bee Colony Algorithm for Improving the Coverage and Connectivity of Wireless Sensor NetworksWireless Personal Communications10.1007/s11277-019-06492-xOnline publication date: 2-May-2019
https://doi.org/10.1007/s11277-019-06492-x
Xu YZeng ZDing O(2017)An energy efficient hole repair node scheduling algorithm for WSNWireless Networks10.1007/s11276-015-1132-823:1(103-116)Online publication date: 1-Jan-2017
https://dl.acm.org/doi/10.1007/s11276-015-1132-8
Show More Cited By

Index Terms

Results on finite wireless sensor networks: Connectivity and coverage
1. Hardware
  1. Communication hardware, interfaces and storage
2. Networks

Recommendations

Connectivity preserving localized coverage algorithm for area monitoring using wireless sensor networks

Efficient network coverage and connectivity are the requisites for most Wireless Sensor Network (WSN) deployments, particularly those concerned with area monitoring. Due to the resource constraints of the sensor nodes, redundancy of coverage area must ...
Centralized and Clustered k-Coverage Protocols for Wireless Sensor Networks

Sensing coverage is an essential functionality of wireless sensor networks (WSNs). However, it is also well known that coverage alone in WSNs is not sufficient, and hence network connectivity should also be considered for the correct operation of WSNs. ...
Limited mobility coverage and connectivity maintenance protocols for wireless sensor networks

Coverage and connectivity maintenance is an important research issue in wireless sensor networks, as sensors are deployed randomly over the monitoring region in large numbers. In the post deployment scenario, existing coverage or connectivity of the ...

Comments

Information & Contributors

Information

Published In

cover image ACM Transactions on Sensor Networks

ACM Transactions on Sensor Networks Volume 9, Issue 4

July 2013

523 pages

ISSN:1550-4859

EISSN:1550-4867

DOI:10.1145/2489253

Issue’s Table of Contents

Copyright © 2013 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Journal Family

ACM Journals for the Design of Smart and Connected Systems

Publication History

Published: 23 July 2013

Accepted: 01 June 2012

Revised: 01 February 2012

Received: 01 February 2011

Published in TOSN Volume 9, Issue 4

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article
Research
Refereed

Funding Sources

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

6
Total Citations
View Citations
321
Total Downloads

Downloads (Last 12 months)2
Downloads (Last 6 weeks)1

Reflects downloads up to 14 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Das SKapelko R(2021)On the Range Assignment in Wireless Sensor Networks for Minimizing the Coverage-Connectivity CostACM Transactions on Sensor Networks10.1145/345740817:4(1-48)Online publication date: 10-Aug-2021
https://dl.acm.org/doi/10.1145/3457408
Yue YCao LLuo Z(2019)Hybrid Artificial Bee Colony Algorithm for Improving the Coverage and Connectivity of Wireless Sensor NetworksWireless Personal Communications10.1007/s11277-019-06492-xOnline publication date: 2-May-2019
https://doi.org/10.1007/s11277-019-06492-x
Xu YZeng ZDing O(2017)An energy efficient hole repair node scheduling algorithm for WSNWireless Networks10.1007/s11276-015-1132-823:1(103-116)Online publication date: 1-Jan-2017
https://dl.acm.org/doi/10.1007/s11276-015-1132-8
(2016)BibliographyDeploying Wireless Sensor Networks10.1016/B978-1-78548-099-7.50011-8(121-137)Online publication date: 2016
https://doi.org/10.1016/B978-1-78548-099-7.50011-8
Laranjeira LRodrigues G(2014)Border Effect Analysis for Reliability Assurance and Continuous Connectivity of Wireless Sensor Networks in the Presence of Sensor FailuresIEEE Transactions on Wireless Communications10.1109/TWC.2014.231410213:8(4232-4246)Online publication date: Aug-2014
https://doi.org/10.1109/TWC.2014.2314102
Khalid ZDurrani SGuo J(2014)A Tractable Framework for Exact Probability of Node Isolation and Minimum Node Degree Distribution in Finite Multihop NetworksIEEE Transactions on Vehicular Technology10.1109/TVT.2013.229358063:6(2836-2847)Online publication date: Jul-2014
https://doi.org/10.1109/TVT.2013.2293580

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Article

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Issue’s Table of Contents