Optimal radius for connectivity in duty-cycled wireless sensor networks

Authors:
Amitabha Bagchi;Cristina M. Pinotti;Sainyam Galhotra;Tarun Mangla
Affiliations:
Indian Institute of Technology, Delhi, New Delhi, India;University of Perugia, Perugia, Italy;Indian Institute of Technology, Delhi, New Delhi, India;Indian Institute of Technology, Delhi, New Delhi, India
Venue:
Proceedings of the 16th ACM international conference on Modeling, analysis & simulation of wireless and mobile systems
Year:
2013

Citing 2
Cited 0

Broadcast analysis in dense duty-cycle sensor networks

Proceedings of the 6th International Conference on Ubiquitous Information Management and Communication
A survey on power control issues in wireless sensor networks

IEEE Communications Surveys & Tutorials

Quantified Score

Hi-index	0.00

Visualization

Abstract

We investigate the condition on transmission radius needed to achieve connectivity in duty-cycled wireless sensor networks (briefly, DC-WSN). First, we settle a conjecture of Das et. al. (2012) and prove that the connectivity condition on Random Geometric Graphs (RGG), given by Gupta and Kumar (1989), can be used to derive a weak sufficient condition to achieve connectivity in DC-WSN. We also present a stronger result which gives a necessary and sufficient condition for 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 scheme.