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.
- Broch, J., Maltz, D., Johnson, D., Hu, Y., and Jetcheva, J. 1998. A performance comparison of multi-hop wireless ad hoc network routing protocols. In ACM/IEEE International Conference On Mobile computing and networking (MobiCom). 85--97. Google Scholar
Digital Library
- Cerpa, A. and Estrin, D. 2002. Ascent: Adaptive self-configuring sensor networks topologies. In IEEE Infocom. vol. 3. 1278--1287.Google Scholar
- Cerpa, A., Wong, J., Kuang, L., Potkonjak, M., and Estrin, D. 2005a. Statistical model of lossy links in wireless sensor networks. In Information Processing in Sensor Networks (IPSN). 81--88. Google Scholar
Digital Library
- Cerpa, A., Wong, J., Potkonjak, M., and Estrin, D. 2005b. Temporal properties of low-power wireless links: Modeling and implications on multi-hop routing. In ACM International Symposium on Mobile Ad Hoc networking & Computing (MobiHoc). 414--425. Google Scholar
Digital Library
- Chandrakasan, A., Sheng, S., and Brodersen, R. 1992. Low-power cmos digital design. IEEE Journal of Solid-State Circuits (JSSC) 27, 4, 473--484.Google Scholar
Cross Ref
- Chandrakasan, A., Potkonjak, M., Mehra, R., Rabaey, J., and Brodersen, R. 1995. Optimizing power using transformations. IEEE Transactions on CAD 14, 1, 12--31. Google Scholar
Digital Library
- Chen, B., Jamieson, K., Balakrishnan, H., and Morris, R. 2002. Span: An energy-efficient coordination algorithm for topology maintenance in ad hoc wireless networks. Wireless Networks 8, 5, 481--494. Google Scholar
Digital Library
- Dai, F. and Wu, J. 2005. On constructing k-connected k-dominating set in wireless networks. In IEEE International Parallel and Distributed Processing Symposium (IPDPS). Google Scholar
Digital Library
- Dijkstra, E. 1968. The structure of the ‘t.h.e.’ multiprogramming system. Communications of the ACM 18, 8, 453--457. Google Scholar
Digital Library
- Garey, M. and Johnson, D. 1979. Computer And Intractability: A Guide To The Theory Of NP-Completeness. W. H. Freeman, San Francisco, CA. Google Scholar
Digital Library
- Ghosh, A., Devadas, S., Keutzer, K., and White, J. 1992. Estimation of average switching activity in combinational and sequential circuits. In ACM/IEEE Design Automation Conference (DAC). 253--259. Google Scholar
Digital Library
- Haber, S. 1970. Numerical evaluation of multiple integrals. SIAM Review 12, 481--526.Google Scholar
Digital Library
- 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.Google Scholar
- 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. Google Scholar
Digital Library
- 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.Google Scholar
- Koushanfar, F., Davare, A., Nguyen, D., Potkonjak, M., and Sangiovanni-Vincentelli, A. 2003. Low power coordination in wireless ad-hoc networks. In International Symposium on Low Power Electronics and Design (ISLPED). 475--480. Google Scholar
Digital Library
- Leighton, F. 1979. A graph coloring algorithm for large scheduling problems. Journal of Research of the National Bureau of Standards 84, 489--506.Google Scholar
- Macii, E., Pedram, M., and Somenzi, F. 1997. High-level power modeling, estimation, and optimization. In ACM/IEEE Design Automation Conference (DAC). 504--511. Google Scholar
Digital Library
- Mosteller, F. 1965. Fifty Challenging Problems in Probability With Solutions. Addison-Wesley, Reading, MA.Google Scholar
- Rubinstein, R. 1981. Simulation and the Monte Carlo Method. Wiley, New York. Google Scholar
Digital Library
- Schurgers, C., Tsiatsis, V., Ganeriwal, S., and Srivastava, M. 2002. Topology management for sensor networks: Exploiting latency and density. In ACM International Symposium on Mobile Ad Hoc Networking & Computing (MobiHoc). 135--145. Google Scholar
Digital Library
- Silberschatz, A., Galvin, P., and Gagne, G. 2003. Operating system concepts: Windows xp update.Google Scholar
- Simunic, T., L., B., Acquaviva, A., Glynn, P., and DeMicheli, G. 2001. Dynamic voltage scaling and power management for portable systems. In ACM/IEEE Design Automation Conference (DAC). 524--529. Google Scholar
Digital Library
- Stojmenovic, I., Seddigh, M., and Zunic, J. 2002. Dominating sets and neighbor elimination-based broadcasting algorithms in wireless networks. IEEE Transactions on Parallel and Distributed Systems 13, 1, 14--25. Google Scholar
Digital Library
- WolframResearch. 2001. Mathematica 4.1, symbolic programming. http://www.wolfram.com/products/mathematica/index.html.Google Scholar
- Wu, J. and Li, H. 1999. On calculating connected dominating set for efficient routing in ad hoc wireless networks. In Workshop on Discrete Algorithms and Methods for MOBILE Computing and Communications. 7--14. Google Scholar
Digital Library
- Xu, Y., Heidemann, J., and Estrin, D. 2001. Geography-informed energy conservation for ad hoc routing. In ACM/IEEE International Conference on Mobile Computing and Networking (Mobicom). 70--84. Google Scholar
Digital Library
- Yao, F., Demers, A., and Shenker, S. 1995. A scheduling model for reduced cpu energy. In Symposium on Foundations of Computer Science (FOCS). 374--382. Google Scholar
Digital Library
- Zheng, R. and Kravets, R. 2005. On-demand power management for ad hoc networks. Ad Hoc Networks 3, 1, 51--68.Google Scholar
Cross Ref
Index Terms
Techniques for maintaining connectivity in wireless ad-hoc networks under energy constraints
Recommendations
Conception and simulation of energy-efficient AODV protocol in ad hoc networks
Mobility '06: Proceedings of the 3rd international conference on Mobile technology, applications & systemsAd Hoc wireless networks are power constrained since nodes operate with limited battery energy. To maximize the lifetime of these networks the residual energy in each mobile node must be very well managed and its use must be controlled such that the ...
An ant swarm-inspired energy-aware routing protocol for wireless ad-hoc networks
Primitive routing protocols for ad-hoc networks are ''power hungry'' and can therefore consume considerable amount of the limited amount of battery power resident in the nodes. Thus, routing in ad-hoc networks is very much energy-constrained. Continuous ...
Energy conservation in wireless sensor networks and connectivity of graphs
In wireless sensor networks (WSNs), the energy source is usually a battery cell, which is impossible to recharge while WSNs are working. Therefore, one of the main issues in wireless sensor networks is how to prolong the network lifetime of WSNs with ...






Comments