Sciweavers

103 search results - page 13 / 21
» Oblivious routing on geometric networks
Sort
View
94
Voted
INFOCOM
2009
IEEE
15 years 6 months ago
Greedy Routing with Bounded Stretch
—Greedy routing is a novel routing paradigm where messages are always forwarded to the neighbor that is closest to the destination. Our main result is a polynomial-time algorithm...
Roland Flury, Sriram V. Pemmaraju, Roger Wattenhof...
INFOCOM
2005
IEEE
15 years 5 months ago
Spatial energy balancing in large-scale wireless multihop networks
— In this paper we investigate the use of proactive multipath routing to achieve energy efficient operation of ad hoc wireless networks. The focus is on optimizing trade-offs be...
Seung Jun Baek, Gustavo de Veciana
83
Voted
RTCSA
2007
IEEE
15 years 6 months ago
A Dynamic Medial Axis Model for Sensor Networks
An important property in a sensor network is the monitoring of temporal changes of hazardous situations such as forest fires. Rescue groups need to be aware of dynamic changes th...
Lan Lin, Hyunyoung Lee
P2P
2005
IEEE
189views Communications» more  P2P 2005»
15 years 5 months ago
Proximity Neighbor Selection for a DHT in Wireless Multi-Hop Networks
A mobile ad hoc network (MANET) is a multi-hop wireless network having no infrastructure. Thus, the mobile nodes have to perform basic control tasks, such as routing, and higher-l...
Curt Cramer, Thomas Fuhrmann
IPSN
2011
Springer
14 years 3 months ago
Exploration of path space using sensor network geometry
In a sensor network there are many paths between a source and a destination. An efficient method to explore and navigate in the ‘path space’ can help many important routing p...
Ruirui Jiang, Xiaomeng Ban, Mayank Goswami, Wei Ze...