460 search results - page 18 / 92 » Bounding the locality of distributed routing algorithms |
MOBICOM
2006
ACM
14 years 1 months ago
2006
ACM
For data-collection applications in sensor networks, it is important to ensure all data sources have equal (or weighted) access to network bandwidth so that the base stations rece...
AINA
2006
IEEE
14 years 1 months ago
2006
IEEE
Abstract— We design a scalable and expressive naming system called SENS, which can retrieve information of computing and content resources distributed widely on the Internet by e...
DIALM
2003
ACM
14 years 29 days ago
2003
ACM
We propose a novel localized algorithm that constructs a bounded degree and planar spanner for wireless ad hoc networks modeled by unit disk graph (UDG). Every node only has to kn...
JUCS
2006
13 years 7 months ago
2006
Abstract: Multiple hop routing in mobile ad hoc networks can minimize energy consumption and increase data throughput. Yet, the problem of radio interferences remain. However if th...
GLOBECOM
2008
IEEE
14 years 2 months ago
2008
IEEE
—In many wireless ad-hoc networks it is important to find a route that delivers a message to the destination within a certain deadline (delay constraint). We propose to identify...