Loading...
A new sufficient condition for 1-coverage to imply connectivity
Khasteh, H ; Sharif University of Technology | 2008
276
Viewed
- Type of Document: Article
- DOI: 10.1109/ICDIM.2008.4746770
- Publisher: 2008
- Abstract:
- An effective approach for energy conservation in wireless sensor networks is scheduling sleep intervals for extraneous nodes while the remaining nodes stay active to provide continuous service. For the sensor network to operate successfully the active nodes must maintain both sensing coverage and network connectivity, It proved before if the communication range of nodes is at least twice the sensing range, complete coverage of a convex area implies connectivity among the working set of nodes. In this paper we consider a rectangular region A =a *b , such that Rs ≤ a, Rs ≤ b where Rs is the sensing range of nodes. and put a constraint on minimum allowed distance between nodes( Rs ). according to this constraint we present a new lower bound for communication range relative to sensing range of sensors (√2+√3*Rs) that complete coverage of considered area implies connectivity among the working set of nodes; also we present a new distribution method , that satisfy our constraint. ©2008 IEEE
- Keywords:
- Communication ; Control theory ; Energy conservation ; Energy management ; Information management ; Sensor networks ; Sensor nodes ; Communication range ; Connectivity ; Coverage ; Distribution method ; Sensing range ; Wireless sensor networks
- Source: 3rd International Conference on Digital Information Management, ICDIM 2008, London, 13 November 2008 through 16 November 2008 ; January , 2008 , Pages 495-499 ; 9781424429172 (ISBN)
- URL: https://ieeexplore.ieee.org/document/4746770
