Sciweavers

980 search results - page 93 / 196
» Hierarchical routing over dynamic wireless networks
Sort
View
PERCOM
2006
ACM
16 years 1 months ago
A Dynamic Graph Algorithm for the Highly Dynamic Network Problem
A recent flooding algorithm [1] guaranteed correctness for networks with dynamic edges and fixed nodes. The algorithm provided a partial answer to the highly dynamic network (HDN)...
Edwin Soedarmadji, Robert J. McEliece
CN
2006
145views more  CN 2006»
15 years 1 months ago
Understanding optimal data gathering in the energy and latency domains of a wireless sensor network
The problem of optimal data gathering in wireless sensor networks (WSNs) is addressed by means of optimization techniques. The goal of this work is to lay the foundations to devel...
Ugo Monaco, Francesca Cuomo, Tommaso Melodia, Fabi...
ICNP
2005
IEEE
15 years 7 months ago
Landmark Guided Forwarding
In this paper we focus on the problems of maintaining Ad Hoc network connectivity in the presence of node mobility whilst providing globally efficient and robust routing. The com...
Menghow Lim, Adam Chesterfield, Jon Crowcroft, Jul...
SIGCOMM
2006
ACM
15 years 7 months ago
XORs in the air: practical wireless network coding
— This paper proposes COPE, a new architecture for wireless mesh networks. In addition to forwarding packets, routers mix (i.e., code) packets from different sources to increase ...
Sachin Katti, Hariharan Rahul, Wenjun Hu, Dina Kat...
BROADNETS
2005
IEEE
15 years 7 months ago
Performance analysis and enhancement for backbone based wireless mobile ad hoc networks
—In this paper, we present an extended Mobile Backbone Network (MBN) topology synthesis algorithm (ETSA) for constructing and maintaining a dynamic backbone structure in mobile w...
Laura Huei-jiun Ju, Izhak Rubin