Abstract
Sensor networks are deployed in numerous military and civil applications, such as remote target detection, weather monitoring, weather forecast, natural resource exploration and disaster management. Despite having many potential applications, wireless sensor networks still face a number of challenges due to their particular characteristics that other wireless networks, like cellular networks or mobile ad hoc networks do not have. The most difficult challenge of the design of wireless sensor networks is the limited energy resource of the battery of the sensors. This limited resource restricts the operational time that wireless sensor networks can function in their applications. Routing protocols play a major part in the energy efficiency of wireless sensor networks because data communication dissipates most of the energy resource of the networks. This paper studies the importance of considering neighboring nodes in the energy efficiency routing problem. After showing that the routing problem that considers the remaining energy of all sensor nodes is NP-complete, heuristics are proposed for the problem. Simulation results show that the routing algorithm that considers the remaining energy of all sensor nodes improves the system lifetime significantly compared to that of minimum transmission energy algorithms.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ilyas, M., Mahgoub, I.: Mobile Computing Handbook. CRC Press (2005)
Feeney, L., Nilsson, M.: Investigating the energy consumption of a wireless network interface in an ad hoc networking environment. In: IEEE INFOCOM (2001)
Dijkstra algorithm (September 23, 2011), http://en.wikipedia.org/wiki/Dijkstra's_algorithm
Stemm, M., Katz, R.H.: Measuring and reducing energy consumption of network interfaces in handheld devices. IEICE Transactions on Fundamentals of Electronics, Communications, and Computer Science, Special Issue on Mobile Computing 80(8), 1125–1131 (1997)
Garey, M., Johnson, D.S.: Computers and Intractability. A Guide to the Theory of NP-completeness. Freeman (1979)
Liu, B.H., et al.: An energy efficient select optimal neighbor protocol for wireless ad hoc networks. In: Proceedings of the 29th Annual IEEE International Conference on Local Computer Networks (LCN 2004), pp. 626–633. IEEE Computer Society, Washington, DC, USA (2004)
Shrestha, N., Mans, B.: Reception-Aware Power Control in Ad Hoc Mobile Networks. In: The Third International Conference on Innovative Applications of Information Technology for Developing World (Asian Applied Computing Conference (AACC 2005)), Kathmandu, Nepal, December 10-12 (2005)
Chen, Y., et al.: On selection of optimal transmission power for ad hoc networks. In: 36th Annual Hawaii International Conference on System Sciences (HICSS 2003) - Track 9, Washington, DC, USA (2003)
Tung, N.T.: Energy-Efficient Routing Algorithms in Wireless Sensor Networks: PhD thesis, Monash University, Australia (July 2009)
Dhawan, A., Vu, C.T.: Maximum Lifetime of Sensor Networks with Adjustable Sensing Range. In: Seventh ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing, SNPD 2006 (2006)
Badrinath, G.S., Gupta, P.: Maximum Lifetime Tree Construction for Wireless Sensor Networks. In: Janowski, T., Mohanty, H. (eds.) ICDCIT 2007. LNCS, vol. 4882, pp. 158–165. Springer, Heidelberg (2007)
Heinzelman, W.B., Chandrakasan, A.P.: An Application Specific Protocol Architecture for Wireless Microsensor Networks. IEEE Transaction on Wireless Communications 1(4), 660–670 (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tung, N.T. (2012). Heuristic Energy-Efficient Routing Solutions to Extend the Lifetime of Wireless Ad-Hoc Sensor Networks. In: Pan, JS., Chen, SM., Nguyen, N.T. (eds) Intelligent Information and Database Systems. ACIIDS 2012. Lecture Notes in Computer Science(), vol 7197. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-28490-8_51
Download citation
DOI: https://doi.org/10.1007/978-3-642-28490-8_51
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-28489-2
Online ISBN: 978-3-642-28490-8
eBook Packages: Computer ScienceComputer Science (R0)