177 search results - page 12 / 36 » Stackelberg Routing in Arbitrary Networks |
167
click to vote
ICASSP
2010
IEEE
15 years 4 months ago
2010
IEEE
We design lifting-based wavelet transforms for any arbitrary communication graph in a wireless sensor network (WSN). Since transmitting raw data bits along the routing trees in WS...
138
click to vote
SPAA
2004
ACM
15 years 11 months ago
2004
ACM
The tremendous growth of public interest in peer-to-peer systems in recent years has initiated a lot of research work on how to design efficient and robust overlay networks for t...
115
click to vote
PODC
2003
ACM
15 years 10 months ago
2003
ACM
This paper presents compact roundtrip routing schemes with local tables of size ˜O( √ n) and stretch 6 for any directed network with arbitrary edge weights; and with local tabl...
130
click to vote
SPAA
2003
ACM
15 years 10 months ago
2003
ACM
This paper is concerned with compact routing schemes for arbitrary undirected networks in the name-independent model first introduced by Awerbuch, Bar-Noy, Linial and Peleg. A co...
182
click to vote
ADHOC
2007
15 years 5 months ago
2007
Abstract— This paper investigates optimal routing and adaptive scheduling in a wireless mesh network composed of mesh clients and mesh routers. The mesh clients are power constra...