1247 search results - page 201 / 250 » Dynamic Routing for Flying Ad Hoc Networks |
156
click to vote
INFOCOM
2008
IEEE
16 years 24 days ago
2008
IEEE
—We reconsider the problem of geographic routing in wireless ad hoc networks. We are interested in local, memoryless routing algorithms, i.e. each network node bases its routing ...
142
click to vote
ICW
2005
IEEE
15 years 12 months ago
2005
IEEE
- To alleviate the problem of high priority traffic hogging of all the available network capacity and to optimize the network traffic in the DiffServ network, we introduce the mult...
159
click to vote
COMCOM
2007
15 years 6 months ago
2007
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...
205
click to vote
ITRUST
2004
Springer
15 years 11 months ago
2004
Springer
Abstract The Internet provides a ubiquitous, standards-based substrate for global communications of all kinds. Rapid advances are now being made in agreeing protocols and machine-p...
184
click to vote
MOBIHOC
2001
ACM
16 years 6 months ago
2001
ACM
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...