674 search results - page 9 / 135 » Finding Stable Routes in Mobile Ad Hoc Networks |
121
click to vote
INFOCOM
1999
IEEE
15 years 6 months ago
1999
IEEE
Abstract--CEDAR is an algorithm for QoS routing in ad hoc network environments. It has three key components: (a) the establishment and maintenance of a self-organizing routing infr...
144
Voted
MOBIHOC
2002
ACM
16 years 1 months ago
2002
ACM
We present a series of approximation algorithms for finding a small weakly-connected dominating set (WCDS) in a given graph to be used in clustering mobile ad hoc networks. The st...
137
click to vote
JNW
2008
15 years 1 months ago
2008
Position based routing algorithms use the knowledge of the position of nodes for routing of packets in mobile ad-hoc networks. Previously proposed position based routing algorithms...
142
click to vote
TMC
2008
15 years 1 months ago
2008
A k-hop dominating set is a subset of nodes such that each node not in the set can be reached within k hops from at least one node in the set. A connected k-hop dominating set can ...
152
Voted
CN
2002
15 years 1 months ago
2002
An ad hoc network is a multi-hop wireless network of mobile nodes without the intervention of fixed infrastructure. Limited bandwidth and mobility require that ad hoc routing prot...