Constrained shortest paths in wireless networks

Proceedings - IEEE Military Communications Conference MILCOM

Volumn 2, Issue , 2001, Pages 884-893

  Li, Xiang Yang ^a   Wan, Peng Jun ^a   Wang, Yu ^a   Frieder, Ophir ^a  

^a Illinois Institute of Technology   (United States)

Author keywords

Constrained shortest path; Delay; Network optimization; Power consumption; Wireless ad hoc networks

Indexed keywords

ALGORITHMS; COSTS; OPTIMIZATION; QUALITY OF SERVICE; TELECOMMUNICATION LINKS; TELECOMMUNICATION NETWORKS;

CONSTRAINED SHORTEST PATHS;

WIRELESS TELECOMMUNICATION SYSTEMS;

EID: 0035727115     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (22)

1. An efficient routing protocol for wireless networks
2. A highly adaptive distributed routing algorithm for mobile wireless networks
3. Ad-hoc on-demand distance vector routing
4. Highly dynamic destination-sequenced distance-vector routing
5. Cedar: Core extraction distributed ad hoc routing
6. A review of current routing protocols for ad-hoc mobile wireless networks
7. A survey of routing techniques for mobile communication networks
8. Minimum energy mobile wireless networks
9. Mobility prediction and routing in ad hoc wireless networks
10. Mobility prediction in wireless networks
11. Power-aware localized routing in wireless networks
12. Energy conserving routing in wireless ad-hoc networks
13. Bandwidth-delay routing algorithm
14. Quality-of-service routing for supporting multimedia applications
15. A randomized algorithm for finding a path subject to multiple qos constraints
16. Approximation schemes for the restricted shortest path problem
17. The network inhibition problem
18. On "strongly" and fully polynomial approximation schemes for restricted shortest path problem