460 search results - page 56 / 92 » Bounding the locality of distributed routing algorithms |
103
click to vote
TMC
2010
14 years 10 months ago
2010
—Localization is a fundamental problem in wireless sensor networks and its accuracy impacts the efficiency of location-aware protocols and applications, such as routing and stora...
JSAC
2006
14 years 11 months ago
2006
Wireless local area network (WLAN) systems are widely implemented today to provide hot-spot coverage. Operated typically in an infrastructure mode, each WLAN is managed by an acces...
SPAA
2003
ACM
15 years 5 months ago
2003
ACM
In the minimum path coloring problem, we are given a graph and a set of pairs of vertices of the graph and we are asked to connect the pairs by colored paths in such a way that pa...
IH
2009
Springer
15 years 6 months ago
2009
Springer
This paper is concerned with the estimation of steganographic capacity in digital images, using information theoretic bounds and very large-scale experiments to approximate the dis...
SSS
2005
Springer
15 years 5 months ago
2005
Springer
We present simple algorithms for achieving self-stabilizing location management and routing in mobile ad-hoc networks. While mobile clients may be susceptible to corruption and sto...