Sciweavers

35 search results - page 6 / 7
» Greedy Hop Distance Routing Using Tree Recovery on Wireless ...
Sort
View
ADHOC
2007
122views more  ADHOC 2007»
13 years 5 months ago
Modeling and analyzing the correctness of geographic face routing under realistic conditions
Geographic protocols are very promising for wireless ad hoc and sensor networks due to the low state storage and low message overhead. Under certain idealized conditions, geograph...
Karim Seada, Ahmed Helmy, Ramesh Govindan
DIALM
2005
ACM
125views Algorithms» more  DIALM 2005»
13 years 7 months ago
Minimizing interference in ad hoc and sensor networks
Reducing interference is one of the main challenges in wireless communication, and particularly in ad hoc networks. The amount of interference experienced by a node v corresponds ...
Thomas Moscibroda, Roger Wattenhofer
ALGOSENSORS
2004
Springer
13 years 11 months ago
On a Conjecture Related to Geometric Routing
We conjecture that any planar 3-connected graph can be embedded in the plane in such a way that for any nodes s and t, there is a path from s to t such that the Euclidean distance ...
Christos H. Papadimitriou, David Ratajczak
COMCOM
2007
136views more  COMCOM 2007»
13 years 5 months ago
Demand-scalable geographic multicasting in wireless sensor networks
In this paper, we focus on the challenge of demand-scalable multicast routing in wireless sensor networks. Due to the ad-hoc nature of the placement of the sensor nodes as well as...
Shibo Wu, K. Selçuk Candan
INFOCOM
2008
IEEE
14 years 1 days ago
Select-and-Protest-Based Beaconless Georouting with Guaranteed Delivery in Wireless Sensor Networks
—Recently proposed beaconless georouting algorithms are fully reactive, with nodes forwarding packets without prior knowledge of their neighbors. However, existing approaches for...
Hanna Kalosha, Amiya Nayak, Stefan Rührup, Iv...