Sciweavers

1101 search results - page 168 / 221
» Ad hoc routing based on the stability of routes
Sort
View
FSTTCS
2004
Springer
15 years 5 months ago
Distributed Algorithms for Coloring and Domination in Wireless Ad Hoc Networks
Abstract. We present fast distributed algorithms for coloring and (connected) dominating set construction in wireless ad hoc networks. We present our algorithms in the context of U...
Srinivasan Parthasarathy 0002, Rajiv Gandhi
MOBIHOC
2001
ACM
15 years 11 months ago
Geometric spanner for routing in mobile networks
We propose a new routing graph, the Restricted Delaunay Graph (RDG), for ad hoc networks. Combined with a node clustering algorithm, RDG can be used as an underlying graph for geo...
Jie Gao, Leonidas J. Guibas, John Hershberger, Li ...
COMCOM
2007
94views more  COMCOM 2007»
14 years 12 months ago
Adaptive backup routing for ad-hoc networks
The network topology changes frequently in ad-hoc networks. Some on-demand protocols with multi-paths or backup routes have been proposed to improve the performance in ad-hoc netw...
Wei Kuang Lai, Sheng-Yu Hsiao, Yuh-Chung Lin
ICC
2009
IEEE
190views Communications» more  ICC 2009»
14 years 9 months ago
Low Bound of Energy-Latency Trade-Off of Opportunistic Routing in Multi-Hop Networks
During the last decade, many works were devoted to improving the performance of relaying techniques in ad hoc networks. One promising approach consists in allowing the relay nodes ...
Ruifeng Zhang, Jean-Marie Gorce, Katia Jaffr&egrav...
WMCSA
1999
IEEE
15 years 4 months ago
Ad-hoc On-Demand Distance Vector Routing
An ad-hoc network is the cooperative engagement of a collection of mobile nodes without the required intervention of any centralized access point or existing infrastructure. In th...
Charles E. Perkins, Elizabeth M. Belding-Royer