ACM Home Page
Please provide us with feedback. Feedback
Techniques for maintaining connectivity in wireless ad-hoc networks under energy constraints
Full text PdfPdf (404 KB)
Source
ACM Transactions on Embedded Computing Systems (TECS) archive
Volume 6 ,  Issue 3  (July 2007) table of contents
Article No. 16  
Year of Publication: 2007
ISSN:1539-9087
Authors
Farinaz Koushanfar  Rice University, Houston, Texas
Abhijit Davare  University of California Berkeley, Berkeley, California
David T. Nguyen  University of California Berkeley, Berkeley, California
Alberto Sangiovanni-Vincentelli  University of California Berkeley, Berkeley, California
Miodrag Potkonjak  University of California Los Angeles, Los Angeles, California
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 17,   Downloads (12 Months): 246,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

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

ABSTRACT

Distributed wireless systems (DWSs) are emerging as the enabler for next-generation wireless applications. There is a consensus that DWS-based applications, such as pervasive computing, sensor networks, wireless information networks, and speech and data communication networks, will form the backbone of the next technological revolution. Simultaneously, with great economic, industrial, consumer, and scientific potential, DWSs pose numerous technical challenges. Among them, two are widely considered as crucial: autonomous localized operation and minimization of energy consumption. We address the fundamental problem of how to maximize the lifetime of the network using only local information, while preserving network connectivity. We start by introducing the care-free sleep (CS) Theorem that provides provably optimal conditions for a node to go into sleep mode while ensuring that global connectivity is not affected. The CS theorem is the basis for an efficient localized algorithm that decides which nodes will go to into sleep mode and for how long. We have also developed mechanisms for collecting neighborhood information and for the coordination of distributed energy minimization protocols. The effectiveness of the approach is demonstrated using a comprehensive study of the performance of the algorithm over a wide range of network parameters. Another important highlight is the first mathematical and Monte Carlo analysis that establishes the importance of considering nodes within a small number of hops in order to preserve energy.


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
Cerpa, A. and Estrin, D. 2002. Ascent: Adaptive self-configuring sensor networks topologies. In IEEE Infocom. vol. 3. 1278--1287.
 
3
4
 
5
Chandrakasan, A., Sheng, S., and Brodersen, R. 1992. Low-power cmos digital design. IEEE Journal of Solid-State Circuits (JSSC) 27, 4, 473--484.
 
6
Chandrakasan, A., Potkonjak, M., Mehra, R., Rabaey, J., and Brodersen, R. 1995. Optimizing power using transformations. IEEE Transactions on CAD 14, 1, 12--31.
 
7
 
8
9
 
10
 
11
 
12
Haber, S. 1970. Numerical evaluation of multiple integrals. SIAM Review 12, 481--526.
 
13
Han, B., Fu, H., Lin, L., and Jia, W. 2004. Efficient construction of connected dominating set in wireless ad hoc networks. In IEEE International Conference on Mobile Ad-hoc and Sensor Systems. 570--572.
 
14
Hong, I., Kirovski, D., Qu, G., Potkonjak, M., and Srivastava, M. 1999. Power optimization of variable voltage core-based systems. IEEE Transaction on CAD 18, 12, 1702--1714.
 
15
Kasten, O. 2001. Measurements of energy consumption for digitan 2 mbps wireless lan module (ieee 802.11/2mbps). http://www.inf.ethz.ch/~kasten/research.
16
 
17
Leighton, F. 1979. A graph coloring algorithm for large scheduling problems. Journal of Research of the National Bureau of Standards 84, 489--506.
18
 
19
Mosteller, F. 1965. Fifty Challenging Problems in Probability With Solutions. Addison-Wesley, Reading, MA.
 
20
21
 
22
Silberschatz, A., Galvin, P., and Gagne, G. 2003. Operating system concepts: Windows xp update.
23
 
24
 
25
WolframResearch. 2001. Mathematica 4.1, symbolic programming. http://www.wolfram.com/products/mathematica/index.html.
26
27
 
28
 
29
Zheng, R. and Kravets, R. 2005. On-demand power management for ad hoc networks. Ad Hoc Networks 3, 1, 51--68.

Collaborative Colleagues:
Farinaz Koushanfar: colleagues
Abhijit Davare: colleagues
David T. Nguyen: colleagues
Alberto Sangiovanni-Vincentelli: colleagues
Miodrag Potkonjak: colleagues