Sciweavers

49 search results - page 2 / 10
» Reliable Greedy Forwarding in Obstacle-Aware Wireless Sensor...
Sort
View
ICC
2008
IEEE
141views Communications» more  ICC 2008»
14 years 2 months ago
Greedy Hop Distance Routing Using Tree Recovery on Wireless Ad Hoc and Sensor Networks
—Connectivity-based routing protocols use the hop count vector to a group of anchors for packet forwarding. Due to the discrete nature of hop count based coordinates, without an ...
Shao Tao, Akkihebbal L. Ananda, Mun Choon Chan
APNOMS
2009
Springer
14 years 2 months ago
Bypassing Routing Holes in WSNs with a Predictive Geographic Greedy Forwarding
Applications in wireless sensor networks (WSNs) experience the routing hole problem. That is, the current node cannot forward to the destination, although it is the closest node, b...
Minh Thiep Ha, Priyadharshini Sakthivel, Hyunseung...
INFOCOM
2007
IEEE
14 years 1 months ago
Cluster-Based Forwarding for Reliable End-to-End Delivery in Wireless Sensor Networks
—Providing efficient and reliable communication in wireless sensor networks is a challenging problem. To recover from corrupted packets, previous approaches have tried to use re...
Qing Cao, Tarek F. Abdelzaher, Tian He, Robin Krav...
PERCOM
2009
ACM
14 years 2 months ago
Look-ahead Geographic Routing for Sensor Networks
— As sensor networks are deployed over various terrains, the complexity of their topology continues to grow. Voids in networks often cause existing geographic routing algorithms ...
Jiaxi You, Dominik Lieckfeldt, Qi Han, Jakob Salzm...
JCO
2006
103views more  JCO 2006»
13 years 7 months ago
On optimal placement of relay nodes for reliable connectivity in wireless sensor networks
The paper addresses the relay node placement problem in two-tiered wireless sensor networks. Given a set of sensor nodes in Euclidean plane, our objective is to place minimum numbe...
Hai Liu, Peng-Jun Wan, Xiaohua Jia