Sciweavers

246 search results - page 8 / 50
» Spatial Distribution in Routing Table Design for Sensor Netw...
Sort
View
126
Voted
GLOBECOM
2006
IEEE
15 years 8 months ago
Coverage-Preserving Routing Protocols for Randomly Distributed Wireless Sensor Networks
— Sensing coverage is an important issue for sensor networks, since it is viewed as one of the critical measures of performance offered by a sensor network. The design of a routi...
Yuh-Ren Tsai
PODC
2003
ACM
15 years 7 months ago
Compact roundtrip routing with topology-independent node names
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...
Marta Arias, Lenore Cowen, Kofi A. Laing
133
Voted
SIGMETRICS
2003
ACM
119views Hardware» more  SIGMETRICS 2003»
15 years 7 months ago
Incrementally improving lookup latency in distributed hash table systems
Distributed hash table (DHT) systems are an important class of peer-to-peer routing infrastructures. They enable scalable wide-area storage and retrieval of information, and will ...
Hui Zhang 0002, Ashish Goel, Ramesh Govindan
124
Voted
INFOCOM
2006
IEEE
15 years 8 months ago
Design Guidelines for Maximizing Lifetime and Avoiding Energy Holes in Sensor Networks with Uniform Distribution and Uniform Rep
— This paper investigates theoretical aspects of the uneven energy depletion phenomenon recently noticed in sink-based wireless sensor networks. We consider uniformly distributed...
Stephan Olariu, Ivan Stojmenovic
93
Voted
INFOCOM
2006
IEEE
15 years 8 months ago
Tunnel Vector: A New Routing Algorithm with Scalability
—Routing algorithms such as Distance Vector and Link States have the routing table size as ΩΩΩΩ (n), where n is the number of destination identifiers, thus providing only...
Cheng-Jia Lai, Richard R. Muntz