Browse > Article

Minimum Energy Cooperative Path Routing in All-Wireless Networks: NP-Completeness and Heuristic Algorithms  

Li, Fulu (Media Lab., MIT)
Wu, Kui (Department of Computer Science, University of Victoria)
Lippman, Andrew (Media Lab., MIT)
Publication Information
Journal of Communications and Networks / v.10, no.2, 2008 , pp. 204-212 More about this Journal
Abstract
We study the routing problem in all-wireless networks based on cooperative transmissions. We model the minimum-energy cooperative path (MECP) problem and prove that this problem is NP-complete. We hence design an approximation algorithm called cooperative shortest path (CSP) algorithm that uses Dijkstra's algorithm as the basic building block and utilizes cooperative transmissions in the relaxation procedure. Compared with traditional non-cooperative shortest path algorithms, the CSP algorithm can achieve a higher energy saving and better balanced energy consumption among network nodes, especially when the network is in large scale. The nice features lead to a unique, scalable routing scheme that changes the high network density from the curse of congestion to the blessing of cooperative transmissions.
Keywords
Cooperative transmissions; distributed algorithms; energy efficiency; wireless networks;
Citations & Related Records

Times Cited By Web Of Science : 1  (Related Records In Web of Science)
Times Cited By SCOPUS : 1
연도 인용수 순위
1 A. Catovic, S. Tekinay, and T. Otsu, "Reducing transmit power and extending network lifetime via user cooperation in the next generation wireless multihop networks," J. Commun. Netw., vol. 4, no. 4, Dec. 2002
2 W. Liang, "Constructing minimum-energy broadcast trees in wireless ad hoc networks," in Proc. ACM Mobihoc 2002
3 M. Garey and D. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Company, 1979
4 F. Li, A. Lippman, and K.Wu, "Minimum energy cooperative path routing in wireless networks: An integer programming formulation," in IEEE VTC 2006-spring, 2006, pp. 1-6
5 Y. Tu and G. Pottie, "Coherent cooperative transmission from multiple adjacent antennas to a distant stationary antenna through AWGN channels," in Proc. IEEE VTC 2002-spring, 2002, pp. 130-134
6 R. Min and A. Chandrakasan, "Top five myths about the energy consumption of wireless communication," in Proc. ACM Mobicom 2002, 2002
7 F. Li, K. Wu, and A. Lippman, "Energy-efficient cooperative routing in multi-hop wireless ad hoc networks," in Proc. IEEE IPCCC 2006, 2006
8 A. Khandani, J. Abounadi, E. Modiano, and L. Zheng, "Cooperative routing in wireless networks," in Proc. Allerton Conf. 2003, 2003
9 M. Cagalj, J. Hubaux, and C. Enz, "Minimum-energy broadcast in allwireless networks: NP-completeness and distribution issues," in Proc. ACM Mobicom 2003, 2003
10 J. Wieselthier, G. Nguyen, and A. Ephremides, "On the construction of energy-efficient broadcast and multicast trees in wireless networks," in Proc. IEEE INFOCOM 2000, 2000, pp. 585-594
11 V. Rodoplu and T. Meng, "Minimum energy mobile wireless networks," IEEE J. Sel. Areas Commun., vol. 17, no. 8, pp. 1333-1344, Aug. 1999   DOI   ScienceOn
12 L. Feeney andM. Nilson, "Investigating the energy consumption of a wireless network interface in an ad hoc networking environment," in Proc. IEEE INFOCOM 2001, 2001
13 H. Cormen, C. Leiserson, R. Rivest, and C. Stein, Introduction to Algorithms. 2nd Ed. MIT Press 2001
14 A. Srinivas and E. Modiano, "Minimum energy disjoint path routing in wireless ad-hoc networks," in Proc. ACM Mobicom 2003, 2003
15 R.Wattenhofer, L. Li, P. Bahl, and Y.Wang, "Distributed topology control for power efficient operation in multihop wireless ad-hoc networks," in Proc. IEEE INFOCOM 2001, 2001