Finding minimum energy disjoint paths in wireless ad-hoc networks

Wireless Networks

Volumn 11, Issue 4, 2005, Pages 401-417

  Srinivas, Anand ^a   Modiano, Eytan ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Disjoint paths; Distributed algorithmsa; Energy efficiency; Graph theory; Multipath routing; Wireless ad hoc networks

Indexed keywords

DISJOINT PATHS; DISTRIBUTED ALGORITHMS; MULTIPATH ROUTING; WIRELESS AD-HOC NETWORKS;

ALGORITHMS; BROADCASTING; ENERGY EFFICIENCY; GRAPH THEORY; HEURISTIC METHODS; POLYNOMIALS; TELECOMMUNICATION LINKS; TELECOMMUNICATION NETWORKS;

WIRELESS TELECOMMUNICATION SYSTEMS;

EID: 23044468851     PISSN: 10220038     EISSN: None     Source Type: Journal    
DOI: 10.1007/s11276-005-1765-0     Document Type: Conference Paper

References (30)

1. A. Ahluwalia, E. Modiano and L. Shu, On the complexity and distributed construction of energy-efficient broadcast trees in static ad hoc wireless networks, in: Proc. 36th Annual Conference on Information Sciences and Systems (CISS) (March 2002).
2. S. Banerjee and A. Misra, Minimum energy paths for reliable communication in multi-hop wireless networks, in: Proc. 3rd ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc) (June 2002) pp. 146-156.
3. D. Bertsekas and R. Gallager, Data Networks (Prentice-Hall Upper Saddle River, NJ, 1992).
4. R. Bhandari, Optimal physical diversity algorithms and survivable networks, in: Proc. Second IEEE Symposium on Computers and Communications (July 1997) pp. 433-441.
5. M. Cagali, J.P. Hubaux and C. Enz, Minimum energy broadcast in allwireless networks: NP-completeness and distribution issues, in: Proc. Ninth ACM International Conference on Mobile Networking and Computing (MOBICOM) (September 2002) pp. 172-182.
6. G. Calinescu, I.I. Mandoiu and A. Zelikovsky, Symmetric connectivity with minimum power consumption in radio networks, in: Proc. 2nd IFIP International Conference on Theoretical Computer Science (August 2002) pp. 119-130.
7. J.H. Chang and L. Tassiulas, Energy conserving routing in wireless ad-hoc networks, in: Proc. IEEE INFOCOM (March 2000) pp. 22-31.
8. W.T. Chen and N.F. Huang, The strongly connecting problem on multihop packet radio networks, IEEE Transactions on Communications 37 (1989) 293-295.
9. C. Cheng, S. Kumar and J.J. Garcia-Luna-Aceves, An efficient distributed algorithm for routing over k-disjoint paths of minimum total length, in: Proc. 28th Annual Allerton Conference on Communication, Control, and Computing (October 1990).
10. A.E.F. Clementi, P. Crescenzi, P. Penna and P.V.G. Rossi, On the complexity of computing minimum energy consumption broadcast subgraphs, in: Proc. 18th Annual Symposium on Theoretical Aspects of Computer Science (February 2001) pp. 121-131.
11. A. Ephremides, Energy concerns in wireless networks, IEEE Wireless Communications 9 (August 2002) 48-59.
12. L.M. Feeney and M. Nilson, Investigating the energy consumption of a wireless network interface in an ad hoc networking environment, in: Proc. IEEE INFOCOM (April 2001) pp. 1548-1557.
13. S.J. Lee and M. Gerla, split multipath routing with maximally disjoint paths in ad hoc networks, in: Proc. IEEE ICC (June 2001) pp. 3201-3205.
14. W. Liang, Constructing minimum energy broadcast trees in wireless ad hoc networks, in: Proc. 3rd ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc) (June 2002) pp. 112-122.
15. E. Lloyd, R. Liu, M. Marathe, R. Ramanathan and S.S. Ravi, Algorithmic aspects of topology control problems for ad hoc networks, in: Proc. 3rd ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc) (June 2002) pp. 123-134.
16. A. Nasipuri and S.R. Das, On-demand multi-path routing for mobile ad hoc networks, in: Proc. IEEE ICCCN (October 1999) pp. 64-70.
17. R.G. Ogier, V. Rutenburg and N. Shacham, Distributed algorithms for computing shortest pairs of disjoint paths, IEEE Transaction on Information Theory 39 (May 1993) 173-182.
18. Richard G. Ogier and Nachum Shacham, A distributed algorithm for finding shortest pairs of disjoint paths, in: Proc. IEEE INFOCOM (April 1989) pp. 173-182.
19. R. Ramanathan and R. Rosales-Hain, Topology control of multihop wireless networks using transmit power adjustment, in: Proc. IEEE INFOCOM (March 2000) pp. 404-413.
20. T.S. Rappaport, Wireless Communications: Principles and Practices (Prentice-Hall Upper Saddle River, NJ, 1996).
21. D. Sidhu, R. Nair and S. Abdallah, Finding disjoint paths in networks, in: Proc. ACM SIGCOMM (September 1991) pp. 43-51.
22. S. Singh, M. Woo and C.S. Raghavendra, Power-aware routing in mobile ad hoc networks, in: Proc. Fifth ACM International Conference on Mobile Networking and Computing (MOBICOM) (Oct. 1998) pp. 181-190.
23. A. Srinivas and E. Modiano, Minimum energy disjoint path routing in wireless adhoc networks, in: Proc. Ninth ACM International Conference on Mobile Networking and Computing (MOBICOM) (September 2003) pp. 122-133.
24. J.W. Suurballe, Disjoint paths in a network, Networks 4 (1974) 125-145.
25. J.W. Suurballe, The single-source, all terminals problem for disjoint paths, Unpublished technical memorandum, Bell Laboratories (1982).
26. J.W. Suurballe and R.E. Tarjan, A quick method for finding shortest pairs of disjoint paths, Networks 14 (1984) 325-336.
27. S. Vutukury and J.J. Garcia-Luna-Aceves, MDVA: A distance-vector multipath routing protocol, in: Proc. IEEE INFOCOM (April 2001) pp. 557-564.
28. 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 (April 2001) pp. 1388-1397.
29. J.E. Wieselthier, G.D. Nguyen and A. Ephremides, On the construction of energy-efficient broadcast and multicast trees in wireless networks, in: Proc. IEEE INFOCOM (March 2000) pp. 585-594.
30. J.E. Wieselthier, G.D. Nguyen and A. Ephremides, The energy efficiency of distributed algorithms for broadcasting in ad hoc networks, in: Proc. The 5th International Symposium on Wireless Personal Multimedia Communications (Oct. 2002) pp. 499-503.