Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
research-article

Optimal Radius for Connectivity in Duty-Cycled Wireless Sensor Networks

Published: 12 December 2014 Publication History

Abstract

We investigate the condition on transmission radius needed to achieve connectivity in duty-cycled wireless sensor networks (briefly, DC-WSNs). First, we settle a conjecture of Das et al. [2012] and prove that the connectivity condition on random geometric graphs (RGGs), given by Gupta and Kumar [1989], can be used to derive a weakly sufficient condition to achieve connectivity in DC-WSNs. To find a stronger result, we define a new vertex-based random connection model that is of independent interest. Following a proof technique of Penrose [1991], we prove that when the density of the nodes approaches infinity, then a finite component of size greater than 1 exists with probability 0 in this model. We use this result to obtain an optimal condition on node transmission radius that is both necessary and sufficient to achieve connectivity and is hence optimal. The optimality of such a radius is also tested via simulation for two specific duty-cycle schemes, called the contiguous and the random selection duty-cycle schemes. Finally, we design a minimum-radius duty-cycling scheme that achieves connectivity with a transmission radius arbitrarily close to the one required in random geometric graphs. The overhead in this case is that we have to spend some time computing the schedule.

Supplementary Material

a36-bagchi-apndx.pdf (bagchi.zip)
Supplemental movie, appendix, image and software files for, Optimal Radius for Connectivity in Duty-Cycled Wireless Sensor Networks

References

[1]
N. Alon and J. H. Spencer. 2000. The Probabilistic Method (2nd ed.). Wiley.
[2]
G. Anastasi, M. Conti, M. Di Francesco, and A. Passarella. 2009. Energy conservation in wireless sensor networks: A survey. Ad Hoc Networks 7, 3 (2009), 537--568.
[3]
A. Bagchi, C. M. Pinotti, S. Galhotra, and T. Mangla. 2013. Optimal radius for connectivity in duty-cycled wireless sensor networks. In Proceedings of the 16th ACM International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems (MSWIM’13). ACM, 125--128.
[4]
F. Barsi, A. A. Bertossi, C. Lavault, A. Navarra, S. Olariu, M. Cristina Pinotti, and V. Ravelomanana. 2011. Efficient location training protocols for heterogeneous sensor and actor networks. IEEE Trans. Mob. Comput. 10, 3 (2011), 377--391.
[5]
F. Barsi, A. A. Bertossi, F. B. Sorbelli, R. Ciotti, S. Olariu, and M. C. Pinotti. 2009. Asynchronous corona training protocols in wireless sensor and actor networks. IEEE Trans. Parallel Distrib. Syst. 20, 8 (2009), 1216--1230.
[6]
A. A. Bertossi, S. Olariu, and C. M. Pinotti. 2008. Efficient corona training protocols for sensor networks. Theor. Comput. Sci. 402, 1 (2008), 2--15.
[7]
S. K. Das, A. Di Saverio, G. Ghidini, A. Navarra, and C. M. Pinotti. 2012. Broadcast analysis in dense duty-cycle sensor networks. In Proceedings of the 6th International Conference on Ubiquitous Information Management and Communication (ICUIMC’12). ACM, New York, Article No. 16.
[8]
P. Dutta, S. Dawson-Haggerty, Y. Chen, C.-J. M. Liang, and A. Terzis. 2010. Design and evaluation of a versatile and efficient receiver-initiated link layer for low-power wireless. In Proceedings of the 8th ACM Conference on Embedded Networked Sensor Systems (SenSys’10). ACM, 1--14.
[9]
L. Eschenauer and V. D. Gligor. 2002. A key-management scheme for distributed sensor networks. In Proceedings of the 9th Conference on Computer and Communications Security (CCS’02). ACM, New York, 41--47.
[10]
G. Ghidini and S. K. Das. 2012. Energy-efficient Markov chain-based duty cycling schemes for greener wireless sensor networks. J. Emerg. Technol. Comput. Syst. 8, 4 (2012), 29:1--29:32.
[11]
S. Guo, Y. Gu, B. Jiang, and T. He. 2009. Opportunistic flooding in low-duty-cycle wireless sensor networks with unreliable links. In Proceedings of the 15th Annual International Conference on Mobile Computing and Networking. ACM, 133--144.
[12]
P. Gupta and P. R. Kumar. 1998. Critical power for asymptotic connectivity. In Proceedings of the 37th IEEE Conference on Decision and Control. IEEE, 1106--1110.
[13]
P. Gupta and R. Kumar. 1999. Stochastic Analysis, Control, Optimization, and Applications: A Volume in Honor of W.H. Fleming. Springer, 547--566.
[14]
K. Han, Y. Liu, and J. Luo. 2013. Duty-cycle-aware minimum-energy multicasting in wireless sensor networks. IEEE/ACM Trans.Networking 21, 3 (2013), 910--923.
[15]
J. Hao, B. Zhang, and H. T. Mouftah. 2012. Routing protocols for duty cycled wireless sensor networks: A survey. IEEE Commun. Mag. 50, 12 (2012), 116--123.
[16]
X. Jiao, W. Lou, J. Ma, J. Cao, X. Wang, and X. Zhou. 2010. Duty-cycle-aware minimum latency broadcast scheduling in multi-hop wireless networks. In Proceedings of the 30th IEEE International Conference on Distributed Computing Systems (ICDCS’10). IEEE, 754--763.
[17]
K. Krzywdziński and K. Rybarczyk. 2011. Geometric graphs with randomly deleted edges—connectivity and routing protocols. In Proceedings of the 36th International Symposium on Mathematical Foundations of Computer Science (MFCS’11). Lecture Notes in Computer Science, Vol. 6907. Springer, 544--555.
[18]
S. Lai and B. Ravindran. 2013. Least-latency routing over time-dependent wireless sensor networks. IEEE Trans. Comput. 62, 5 (2013), 969--983.
[19]
G. Mao and B. Anderson. 2013. Connectivity of large wireless networks under a general connection model. IEEE Trans. Inf. Theory 59, 3 (2013), 1761--1772.
[20]
R. Meester and R. Roy. 1996. Continuum Percolation. Number 119 in Cambridge Tracts in Mathematics. Cambridge University dss, Cambridge.
[21]
N. A. Pantazis and D. D. Vergados. 2007. A survey on power control issues in wireless sensor networks. IEEE Communications Surveys Tutorials 9, 4 (2007), 86--107.
[22]
M. D. Penrose. 1991. On a continuum percolation model. Adv. Appl. Probab. 23, 3 (Sept. 1991), 546--556.
[23]
J. Polastre, J. L. Hill, and D. E. Culler. 2004. Versatile low power media access for wireless sensor networks. In SenSys. ACM, 95--107.
[24]
S. Shakkottai, R. Srikant, and N. Shroff. 2003. Unreliable sensor grids: Coverage, connectivity and diameter. In Proc. IEEE INFOCOM 2003, Vol. 2. IEEE, 1073--1083.
[25]
P. J. Shin, J. Park, and A. C. Kak. 2014. A predictive duty cycle adaptation framework using augmented sensing for wireless camera networks. ACM Trans. Sen. Netw. 10, 2 (Jan. 2014), 22:1--22:31.
[26]
S. Sudevalayam and P. Kulkarni. 2011. Energy harvesting sensor nodes: Survey and implications. IEEE Communications Surveys Tutorials 13, 3 (2011), 443--461.
[27]
F. Wang and J. Liu. 2012. On reliable broadcast in low duty-cycle wireless sensor networks. IEEE Trans. Mobile Comput. 11, 5 (2012), 767--779.
[28]
O. Yağan. 2012. Performance of the Eschenauer-Gligor key distribution scheme under an ON/OFF channel. IEEE Trans. Inf. Theory 58, 6 (June 2012), 3821--3835.
[29]
O. Yağan and A. M. Makowski. 2012. Zero-one laws for connectivity in random key graphs. IEEE Trans. Inf. Theory 58, 5 (May 2012), 2983--2999.
[30]
W. Ye, J. S. Heidemann, and D. Estrin. 2002. An energy-efficient mac protocol for wireless sensor networks. In Proceedings of the 21st Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings (INFOCOM’02). IEEE, 1567--1576.
[31]
W. Ye, F. Silva, and J. Heidemann. 2006. Ultra-low duty cycle MAC with scheduled channel polling. In Proceedings of the 4th ACM SenSys Conference. ACM, 321--333.
[32]
C.-W. Yi, P.-J. Wang, X.-Y. Li, and O. Frieder. 2006. Asymptotic distribution of the number of isolated nodes in wireless ad hoc networks with Bernuolli nodes. IEEE Trans. Commun. 54, 3 (March 2006), 510--517.
[33]
C.-W. Yi, P.-J. Wang, C.-M. Su, K.-W. Lin, and S. C.-H. Huang. 2010. Asymptotic distribution of the number of isolated nodes in wireless ad hoc networks with unreliable nodes and links. Discrete Math. Algorithm. Appl. 2, 1 (March 2010), 107--124.
[34]
J. Yick, B. Mukherjee, and D. Ghosal. 2008. Wireless sensor network survey. Comput. Networks 52, 12 (2008), 2292--2330.
[35]
Z. Zhou, S. R. Das, and H. Gupta. 2009. Variable radii connected sensor cover in sensor networks. ACM Trans. Sens. Netw. 5, 1, Article 8 (Feb. 2009), 36 pages.

Cited By

View all
  • (2019)Multi-Hub Location Heuristic for Alert RoutingIEEE Access10.1109/ACCESS.2019.29071617(40369-40379)Online publication date: 2019
  • (2018)Border effects on connectivity for randomly oriented directional antenna networks2018 17th Annual Mediterranean Ad Hoc Networking Workshop (Med-Hoc-Net)10.23919/MedHocNet.2018.8407090(1-8)Online publication date: Jun-2018
  • (2018)On a Class of Stochastic Multilayer NetworksProceedings of the ACM on Measurement and Analysis of Computing Systems10.1145/31794212:1(1-25)Online publication date: 3-Apr-2018
  • Show More Cited By

Index Terms

  1. Optimal Radius for Connectivity in Duty-Cycled Wireless Sensor Networks

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image ACM Transactions on Sensor Networks
    ACM Transactions on Sensor Networks  Volume 11, Issue 2
    February 2015
    563 pages
    ISSN:1550-4859
    EISSN:1550-4867
    DOI:10.1145/2656931
    • Editor:
    • Chenyang Lu
    Issue’s Table of Contents
    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

    Publication History

    Published: 12 December 2014
    Accepted: 01 August 2014
    Revised: 01 August 2014
    Received: 01 September 2013
    Published in TOSN Volume 11, Issue 2

    Permissions

    Request permissions for this article.

    Check for updates

    Author Tags

    1. Wireless sensor networks
    2. connectivity radius
    3. duty cycled

    Qualifiers

    • Research-article
    • Research
    • Refereed

    Funding Sources

    • Sapienza Università di Roma
    • “PRIN 2010” ARS TechnoMedia (Algoritmica per le Reti Sociali Tecno-mediate) from the Italian Ministry of University and Research

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)4
    • Downloads (Last 6 weeks)1
    Reflects downloads up to 12 Sep 2024

    Other Metrics

    Citations

    Cited By

    View all
    • (2019)Multi-Hub Location Heuristic for Alert RoutingIEEE Access10.1109/ACCESS.2019.29071617(40369-40379)Online publication date: 2019
    • (2018)Border effects on connectivity for randomly oriented directional antenna networks2018 17th Annual Mediterranean Ad Hoc Networking Workshop (Med-Hoc-Net)10.23919/MedHocNet.2018.8407090(1-8)Online publication date: Jun-2018
    • (2018)On a Class of Stochastic Multilayer NetworksProceedings of the ACM on Measurement and Analysis of Computing Systems10.1145/31794212:1(1-25)Online publication date: 3-Apr-2018
    • (2016)Improved WSN Life Time Duration through Adaptive Clustering, Duty Cycling and Sink MobilityProceedings of the 2016 8th International Conference on Information Management and Engineering10.1145/3012258.3012269(36-40)Online publication date: 2-Nov-2016
    • (2016)The impact of interaction radius on soft control performance based on the Vicsek Model2016 35th Chinese Control Conference (CCC)10.1109/ChiCC.2016.7553245(1175-1180)Online publication date: Jul-2016
    • (2015)A Novel Two-Tier Cooperative Caching Mechanism for the Optimization of Multi-Attribute Periodic Queries in Wireless Sensor NetworksSensors10.3390/s15071503315:7(15033-15066)Online publication date: 26-Jun-2015
    • (2015)Connectivity of a Dense Mesh of Randomly Oriented Directional Antennas Under a Realistic Fading ModelRevised Selected Papers of the 11th International Symposium on Algorithms for Sensor Systems - Volume 953610.1007/978-3-319-28472-9_2(13-26)Online publication date: 17-Sep-2015

    View Options

    Get Access

    Login options

    Full Access

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Media

    Figures

    Other

    Tables

    Share

    Share

    Share this Publication link

    Share on social media