Node-disjoint path routing in wireless networks: Tradeoff between path lifetime and total energy

Jian Tang, Guoliang Xue

Research output: Chapter in Book/Report/Conference proceedingConference contribution

15 Scopus citations

Abstract

Survivability and lifetime are two important issues related to routing in wireless ad-hoc networks. Routing using node-disjoint paths enhances both survivability and data confidentiality. An elegant polynomial time algorithm has been reported recently that can compute node-disjoint paths connecting a source node to a destination node with minimum total energy. However, the problem of computing a pair of node-disjoint paths connecting a source node to a destination node with a lifetime no smaller than a given threshold has not been studied before. In this paper, we present efficient algorithms for computing a pair of node-disjoint paths connecting a source node to a destination node which either minimizes energy under lifetime constraint or maximizes lifetime under energy consumption constraint. We study the tradeoffs between path lifetime and total energy consumption in node-disjoint path routing and their effects on network throughput and network lifetime. Our preliminary simulation results show that routing with both path lifetime and total energy consumption considerations leads to significantly better network throughput and network lifetime.

Original languageEnglish (US)
Title of host publicationIEEE International Conference on Communications
Pages3812-3816
Number of pages5
Volume7
StatePublished - 2004
Event2004 IEEE International Conference on Communications - Paris, France
Duration: Jun 20 2004Jun 24 2004

Other

Other2004 IEEE International Conference on Communications
CountryFrance
CityParis
Period6/20/046/24/04

Keywords

  • Minimum energy consumption
  • Node-disjoint path routing
  • Prolonged network lifetime
  • Wireless ad-hoc networks

ASJC Scopus subject areas

  • Media Technology

Fingerprint Dive into the research topics of 'Node-disjoint path routing in wireless networks: Tradeoff between path lifetime and total energy'. Together they form a unique fingerprint.

  • Cite this

    Tang, J., & Xue, G. (2004). Node-disjoint path routing in wireless networks: Tradeoff between path lifetime and total energy. In IEEE International Conference on Communications (Vol. 7, pp. 3812-3816)