ACM Home Page
Please provide us with feedback. Feedback
Network coverage using low duty-cycled sensors: random & coordinated sleep algorithms
Full text PdfPdf (302 KB)
Source Information Processing In Sensor Networks archive
Proceedings of the 3rd international symposium on Information processing in sensor networks table of contents
Berkeley, California, USA
SESSION: Oral presentation session VI: coverage and connectivity table of contents
Pages: 433 - 442  
Year of Publication: 2004
ISBN:1-58113-846-6
Authors
Chih-fan Hsin  University of Michigan, Ann Arbor, MI
Mingyan Liu  University of Michigan, Ann Arbor, MI
Sponsor
SIGBED: ACM Special Interest Group on Embedded Systems
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 8,   Downloads (12 Months): 64,   Citation Count: 30
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/984622.984685
What is a DOI?

ABSTRACT

This paper investigates the problem of providing network coverage using wireless sensors that operate on low duty cycles (measured by the percentage time a sensor is on or active), i.e., each sensor alternates between active and sleep states to conserve energy with an average sleep period (much) longer than the active period. The dynamic change in topology as a result of such duty-cycling has potentially disruptive effect on the operation and performance of the network. This is compensated by adding redundancy in the sensor deployment. In this paper we examine the fundamental relationship between the reduction in sensor duty cycle and the required level of redundancy for a fixed performance measure, and explore the design of good sensor sleep schedules. In particular, we consider two types of mechanisms, the random sleep type where each sensor keeps an active-sleep schedule independent of another, and the coordinated sleep type where sensors coordinate with each other in reaching an active-sleep schedule. Both types are studied within the context of providing network coverage. We present specific scheduling algorithms within each type, and illustrate their coverage and duty cycle properties via both analysis and simulation. We show with either type of sleep schedule the benefit of added redundancy saturates at some point in that the reduction in duty cycles starts to diminish beyond a certain threshold in deployment redundancy. We also show that at the expense of extra control overhead, a coordinated sleep schedule is more robust and can achieve higher duty cycle reduction with the same amount of redundancy compared to a random sleep schedule.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
2
 
3
Elson, J., Romer, K.: Wireless sensor networks: A new regime for time synchronization. In: The First Workshop on Hot Topics In Networks (HotNets-I). (2002).
 
4
 
5
Cox, D.: Renewal Theory. Methuen and Co. LTD Science Paperbacks (1970).
 
6
 
7
Stoyan, D., Kendall, W.S., Mecke, J.: Stochastic Geometry and Its Applications, Second Edition. Wiley Series in Probability and Statistics (1995).
 
8
 
9
10
 
11
Slijepcevic, S., Potkonjak, M.: Power efficient organization of wireless sensor networks. In: IEEE INternational Conference on Communications (ICC). (2001).
12
 
13
 
14
Bhardwaj, M., Chandrakasan, A.P.: Bounding the lifetime of sensor networks via optimal role assignments. In: Joint Conference of the IEEE Computer and Communications Societies (INFOCOM). (2002).
 
15
 
16
Liu, B., Towsley, D.: On the coverage and detectability of large-scale wireless sensor networks. In: In Proc. of the Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks Conference (WiOpt). (2003).
 
17
Shakkottai, S., Srikant, R., Shroff, N.: Unreliable sensor grids: Coverage, connectivity and diameter. In: Joint Conference of the IEEE Computer and Communications Societies (INFOCOM). (2003).
18
19
 
20
Mequerdichian, S., Koushanfar, F., Potkonjak, M., Srivastava, M.B.: Coverage problems in wireless ad-hoc sensor networks. In: Joint Conference of the IEEE Computer and Communications Societies (INFOCOM). (2001).
 
21
Li, X.Y., Wan, P.J., Frieder, O.: Coverage in wireless ad hoc sensor networks. IEEE Transactions on Cumputers 52 (2003).
22
 
23
Ye, W., Heidemann, J., Estrin, D.: An energy-efficient mac protocol for wireless sensor networks. In: Joint Conference of the IEEE Computer and Communications Societies (INFOCOM). (2002).
 
24
Nagpal, R., Shrobe, H., Bachrach, J.: Organizing a global coordinate system from local information on an ad hoc sensor network. In: The 2nd International Workshop on Information Processing in Sensor Networks (IPSN). (2003).
25
 
26
Niculescu, D., Nath, B.: Ad hoc positioning system (aps) using aoa. In: Joint Conference of the IEEE Computer and Communications Societies (INFOCOM). (2003).
27

CITED BY  30

Collaborative Colleagues:
Chih-fan Hsin: colleagues
Mingyan Liu: colleagues