Minimum Energy Disjoint Path Routing in Wireless Ad-hoc Networks

Proceedings of the Annual International Conference on Mobile Computing and Networking, MOBICOM

Volumn , Issue , 2003, Pages 122-133

  Srinivas, Anand ^a   Modiano, Eytan ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Disjoint paths; Distributed algorithms; Energy efficiency; Minimum energy; Multipath routing; Wireless ad hoc networks

Indexed keywords

ALGORITHMS; COMPUTER NETWORKS; DATA TRANSFER; ENERGY EFFICIENCY; POLYNOMIALS; REAL TIME SYSTEMS; ROUTERS; TELECOMMUNICATION NETWORKS;

DISJOINT PATHS; MULTIPATH ROUTING; WIRELESS AD HOC NETWORKS;

WIRELESS TELECOMMUNICATION SYSTEMS;

EID: 1542269184     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/938985.938999     Document Type: Conference Paper

References (29)

1. L. M. Feeney, M. Nilson, "Investigating the Energy Consumption of a Wireless Network Interface in an Ad Hoc Networking Environment," Proc. 20th IEEE INFOCOM, pp. 1548-1557, 2001
2. J. E. Wieselthier, G. D.Nguyen, and A. Ephremides, "On the Construction of Energy-Efficient Broadcast and Multicast Trees in Wireless Networks," Proc. IEEE INFOCOM 2000, Tel Aviv, Isreal, Mar. 2000, pp. 585-94.
3. A. E. F. Clementi, P. Crescenzi, P. Penna, and P. V. G. Rossi, "On the Complexity of Computing Minimum Energy Consumption Broadcast Subgraphs," Proc. 18th Annual Symposium on Theoretical Aspects of Computer Science, volume 2010 of LNCS, pp. 121-131, 2001.
4. M. Cagali, J.P. Hubaux, C. Enz, "Minimum Energy Broadcast in All-Wireless Networks: NP-Completeness and Distribution Issues," In The Eighth ACM International Conference on Mobile Networking and Computing (MOBICOM), Atlanta, September 2002.
5. W. Liang, "Constructing minimum energy broadcast trees in wireless ad hoc networks," Proc. 3rd ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc), Lausanne, Switzerland, June 2002.
6. A. Ahluwalia, E. Modiano, and L. Shu, "On the Complexity and Distributed Construction of Energy-Efficient Broadcast Trees in Static Ad Hoc Wireless Networks," Proc. 36th Annual Conference on Information Sciences and Systems (CISS 2002), Princeton University, March 2002.
7. W. T. Chen and N. F. Huang, "The Strongly Connecting Problem on Multihop Packet Radio Networks," IEEE Transactions on Communications, vol. 37, no. 3, pp. 293-295.
8. E. Lloyd, R. Liu, M. Marathe, R. Ramanathan, and S.S. Ravi, "Algorithmic Aspects of Topology Control Problems for Ad hoc Networks," Proc. 3rd ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc), Lausanne, Switzerland, June 2002.
9. R. Ramanathan and R. Rosales-Hain. "Topology Control of Multihop Wireless Networks Using Transmit Power Adjustment," Proc. IEEE INFOCOM 2000, Tel Aviv, Israel, March 2000, pp. 404-413.
10. J. W. Suurballe, "Disjoint Paths in a Network," Networks, 4 (1974) pp. 125-145
11. J. W. Suurballe and R.E. Tarjan, "A Quick Method for Finding Shortest Pairs of Disjoint Paths," Networks, 14 (1984) pp. 325-336.
12. R. Bhandari, "Optimal physical diversity algorithms and survivable networks," Proc. Second IEEE Symposium on Computers and Communications 1997, Alexandria, Egypt, July 1997, pp. 433-441.
13. S. J. Lee and M. Gerla, "Split Multipath Routing with Maximally Disjoint Paths in Ad Hoc Networks," Proc. IEEE ICC 2001, pp. 3201-3205, 2001.
14. A. Nasipuri and S.R. Das, "On-demand multi-path routing for mobile ad hoc networks," Proc. IEEE ICCCN 1999, pp. 64-70, 1999.
15. S. Vutukury and J. J. Garcia-Luna-Aceves, "MDVA: A Distance-Vector Multipath Routing Protocol," Proc. IEEE INFOCOM 2001, pp. 557-564, 2001.
16. T.S. Rappaport, Wireless Communications: Principles and Practices, Prentice Hall, 1996.
17. S. Singh, M. Woo and C.S. Raghavendra, "Power-Aware Routing in Mobile Ad Hoc Networks," Proc. ACM MOBICOM 1998, Oct. 1998, pp. 181-190.
18. J. E. Wieselthier, G. D.Nguyen, and A. Ephremides, "The Energy Efficiency of Distributed Algorithms for Broadcasting in Ad Hoc Networks," Proc. The 5th International Symposium on Wireless Personal Multimedia Communications, Oct. 2002, pp. 499-503.
19. Anand Srinivas, "Reliability and Energy Efficiency in Wireless Ad-Hoc Networks," Master's Thesis, Massachusetts Institute of Technology, 2003.
20. G. Calinescu, I.I. Mandoiu, and A. Zelikovsky, "Symmetric Connectivity with Minimum Power Consumption in Radio Networks", Proc. 2nd IFIP International Conference on Theoretical Computer Science, Montreal, Canada, August 2002.
21. A. Ephremides, "Energy Concerns in Wireless Networks," IEEE Wireless Communications, Vol. 9, no. 4, 48-59, August 2002.
22. S. Banerjee and A. Misra, "Minimum energy Paths for Reliable Communication in Multi-Hop Wireless Networks," Proc. 3rd ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc), Lausanne, Switzerland, June 2002.
23. Richard G. Ogier and Nachum Shacham, "A Distributed Algorithm for Finding Shortest Pairs of Disjoint Paths," Proc. IEEE INFOCOM 1989, pp. 173-182
24. D. Sidhu, R. Nair, and S. Abdallah, "Finding Disjoint Paths in Networks," Proc. ACM SIGCOMM 1991, pp. 43-51, 1991.
25. R. G. Ogier, V. Rutenburg, and N. Shacham, "Distributed algorithms for computing shortest pairs of disjoint paths," IEEE Transaction on Information Theory, vol. 39, no. 2, pp. 443-455, 1993.
26. D. Bertsekas and R. Gallager, Data Networks, Prentice Hall, 1992.
27. C. Cheng, S. Kumar, and J.J. Garcia-Luna-Aceves, "An Efficient Distributed Algorithm for Routing over K-Disjoint Paths of Minimum Total Length," Proc. 28th Annual Allerton Conference on Communication, Control, and Computing, Urbana, Illinois, October 1990.
28. J.H. Chang and L. Tassiulas, "Energy Conserving Routing in Wireless Ad-hoc Networks", Proc. IEEE INFOCOM 2000, Tel Aviv, Isreal, Mar. 2000.
29. R. Wattenhofer, L. Li, P. Bahl and Y. Wang, "Distributed Topology Control for Power Efficient Operation in Multihop Wireless Ad-Hoc Networks," Proc. IEEE INFOCOM 2001.