Constrained shortest paths in wireless networks

We address several QoS routing problems in wireless ad hoc networks. Due to mobility or limited battery power, a link between two nodes can last for a certain period, which is represented by a life parameter. On the other hand, each link has cost parameters which can represent the delay of this link, the transmission power needed to support this link and so on. The life of a path is the shortest life of all links in this path; the cost of a path is the sum of the costs of all links. We first consider the problem of finding a path between a given pair of nodes with the maximum life while the cost of the path does not exceed a pre-specified bound. This problem can be solved in O((n log n + m) log n) time. Here n is the number of nodes and m is the number of links. A distributed version of the algorithm that is suitable for wireless ad hoc networks is also presented. In addition, we study the problem of finding a path between a given pair of nodes with the maximum battery energy level while the cost of the path does not exceed a pre-specified bound. We also developed both centralized and distributed polynomial-time algorithms for this problem. Specifically, when the cost represents the transmission power needed to support the link, we give a distributed algorithm with time complexity O(n log n) using O(n/sup 2/ log n) total messages.

[1]  Charles E. Perkins,et al.  Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers , 1994, SIGCOMM.

[2]  Refael Hassin,et al.  Approximation Schemes for the Restricted Shortest Path Problem , 1992, Math. Oper. Res..

[3]  Vaduvur Bharghavan,et al.  CEDAR: a core-extraction distributed ad hoc routing algorithm , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[4]  Sung-Ju Lee,et al.  Mobility prediction in wireless networks , 2000, MILCOM 2000 Proceedings. 21st Century Military Communications. Architectures and Technologies for Information Superiority (Cat. No.00CH37155).

[5]  Xiangyang Li,et al.  Constructing minimum energy mobile wireless networks , 2001, MobiHoc '01.

[6]  Charles E. Perkins,et al.  Ad-hoc on-demand distance vector routing , 1999, Proceedings WMCSA'99. Second IEEE Workshop on Mobile Computing Systems and Applications.

[7]  J. Broach,et al.  The dynamic source routing protocol for mobile ad-hoc networks , 1998 .

[8]  Jon Crowcroft,et al.  Bandwidth-delay based routing algorithms , 1995, Proceedings of GLOBECOM '95.

[9]  Spyros Tragoudas,et al.  An efficient algorithm for finding a path subject to two additive constraints , 2000, SIGMETRICS '00.

[10]  Cynthia A. Phillips,et al.  The network inhibition problem , 1993, STOC.

[11]  Sung-Ju Lee,et al.  Mobility prediction and routing in ad hoc wireless networks , 2001, Int. J. Netw. Manag..

[12]  S. Ramanathan,et al.  A survey of routing techniques for mobile communications networks , 1996, Mob. Networks Appl..

[13]  R. Stephenson.  A and V , 1962, The British journal of ophthalmology.

[14]  Teresa H. Meng,et al.  Minimum energy mobile wireless networks , 1998, ICC '98. 1998 IEEE International Conference on Communications. Conference Record. Affiliated with SUPERCOMM'98 (Cat. No.98CH36220).

[15]  David S. Johnson,et al.  Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran , 1979 .

[16]  Marwan Krunz,et al.  A randomized algorithm for finding a path subject to multiple QoS constraints , 1999, Seamless Interconnection for Universal Services. Global Telecommunications Conference. GLOBECOM'99. (Cat. No.99CH37042).

[17]  Jon Crowcroft,et al.  Quality-of-Service Routing for Supporting Multimedia Applications , 1996, IEEE J. Sel. Areas Commun..

[18]  Elizabeth M. Belding-Royer,et al.  A review of current routing protocols for ad hoc mobile wireless networks , 1999, IEEE Wirel. Commun..

[19]  Ivan Stojmenovic,et al.  Power-aware localized routing in wireless networks , 2000, Proceedings 14th International Parallel and Distributed Processing Symposium. IPDPS 2000.

[20]  J. J. Garcia-Luna-Aceves,et al.  An efficient routing protocol for wireless networks , 1996, Mob. Networks Appl..

[21]  Charles E. Perkins,et al.  Highly Dynamic Destination-Sequenced Distance-Vector Routing (DSDV) for mobile computers , 1994, SIGCOMM.

[22]  Ivan Stojmenovic,et al.  Power-Aware Localized Routing in Wireless Networks , 2001, IEEE Trans. Parallel Distributed Syst..

[23]  M. S. Corson,et al.  A highly adaptive distributed routing algorithm for mobile wireless networks , 1997, Proceedings of INFOCOM '97.

[24]  Spyros Tragoudas,et al.  An efficient algorithm for finding a path subject to two additive constraints , 2002, Comput. Commun..

[25]  Leandros Tassiulas,et al.  Energy conserving routing in wireless ad-hoc networks , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).