Sciweavers

13 search results - page 1 / 3
» Landmark Selection and Greedy Landmark-Descent Routing for S...
Sort
View
INFOCOM
2007
IEEE
13 years 10 months ago
Landmark Selection and Greedy Landmark-Descent Routing for Sensor Networks
—We study the problem of landmark selection for landmark-based routing in a network of fixed wireless communication nodes. We present a distributed landmark selection algorithm ...
An Nguyen, Nikola Milosavljevic, Qing Fang, Jie Ga...
CORR
2010
Springer
153views Education» more  CORR 2010»
13 years 3 months ago
Secured Greedy Perimeter Stateless Routing for Wireless Sensor Networks
Wireless sensor networks are collections of large number of sensor nodes. The sensor nodes are featured with limited energy, computation and transmission power. Each node in the n...
P. Samundiswary, D. Sathian, P. Dananjayan
ITIIS
2010
140views more  ITIIS 2010»
12 years 10 months ago
RGF: Receiver-based Greedy Forwarding for Energy Efficiency in Lossy Wireless Sensor Networks
Greedy forwarding is the key mechanism of geographic routing and is one of the protocols used most commonly in wireless sensor networks. Greedy forwarding uses 1-hop local informa...
In Hur, Moonseong Kim, Jaewan Seo, Hyunseung Choo
ICCNMC
2005
Springer
13 years 9 months ago
Curve-Based Greedy Routing Algorithm for Sensor Networks
Routing packets along a specified curve is a new approach to forwarding packets in large-scale dense sensor networks. Forwarding packets along trajectories can be very effective in...
Jin Zhang, Yaping Lin, Mu Lin, Ping Li, Si-wang Zh...
INFOCOM
2008
IEEE
13 years 10 months ago
Reducing Maximum Stretch in Compact Routing
—It is important in communication networks to use routes that are as short as possible (i.e have low stretch) while keeping routing tables small. Recent advances in compact routi...
Mihaela Enachescu, Mei Wang, Ashish Goel