980 search results - page 81 / 196 » Hierarchical routing over dynamic wireless networks |
106
click to vote
PADS
2004
ACM
15 years 6 months ago
2004
ACM
Computer simulation is the most common approach to studying wireless ad-hoc routing algorithms. The results, however, are only as good as the models the simulation uses. One shoul...
107
click to vote
ACSC
2005
IEEE
15 years 7 months ago
2005
IEEE
The mobility characteristic brings new challenges for research of P2P computing over the wireless mobile networking environment. Peers’ movements in wireless mobile network chan...
126
click to vote
INFOCOM
2000
IEEE
15 years 5 months ago
2000
IEEE
Ad hoc networks are characterized by multihop wireless connectivity, frequently changing network topology and the need for efficient dynamic routing protocols. We compare the perf...
103
click to vote
GLOBECOM
2009
IEEE
15 years 5 months ago
2009
IEEE
In this paper, we consider the energy-efficient resource allocation that minimizes a general cost function of average user powers in wireless networks. A class of so-called -fair c...
121
click to vote
MOBIHOC
2006
ACM
16 years 1 months ago
2006
ACM
Geographic ad hoc networks use position information for routing. They often utilize stateless greedy forwarding and require the use of recovery algorithms when the greedy approach...