Premium
Stochastic sleeping with sink‐oriented connectivity and coverage in large‐scale sensor networks
Author(s) -
Shi Gaotao,
Liao Minghong
Publication year - 2007
Publication title -
international journal of communication systems
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.344
H-Index - 49
eISSN - 1099-1131
pISSN - 1074-5351
DOI - 10.1002/dac.846
Subject(s) - computer science , wireless sensor network , probabilistic logic , scheduling (production processes) , energy consumption , topology control , distributed computing , computer network , sink (geography) , topology (electrical circuits) , key distribution in wireless sensor networks , wireless network , wireless , mathematical optimization , mathematics , cartography , biology , geography , ecology , telecommunications , combinatorics , artificial intelligence
Maintaining a long network lifetime with stringent energy constraints on tiny sensor nodes presents a big challenge for the design of wireless sensor networks. A widely used energy consumption strategy is to turn off a node when it is transmitting or receiving. However, most existing scheduling algorithms depend on location or directional information. As a result, the energy cost and system complexity involved in obtaining such geometric information may compromise the effectiveness as a whole. In this paper, we analyse the shortcomings of geographic scheduling schemes maintaining a complete coverage and prove that the network lifetime is determined by the boundary nodes. We propose a probabilistic cellular automaton scheduling scheme, which does not need any node location or directional information and also provide a topology control protocol (S3C2), which schedules a node to sleep based on probabilistic cellular automaton and maintains a sink‐oriented connectivity and coverage. Extensive simulations are conducted to evaluate the performance of our proposed scheduling scheme and topology control protocol. Copyright © 2006 John Wiley & Sons, Ltd.