Sciweavers

170 search results - page 13 / 34
» Demand-scalable geographic multicasting in wireless sensor n...
Sort
View
DIALM
2005
ACM
203views Algorithms» more  DIALM 2005»
14 years 11 months ago
Topological hole detection in wireless sensor networks and its applications
The identification of holes in a wireless sensor network is of primary interest since the breakdown of sensor nodes in a larger area often indicates one of the special events to ...
Stefan Funke
APNOMS
2009
Springer
15 years 4 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...
ICA3PP
2009
Springer
15 years 2 months ago
Reliable Greedy Forwarding in Obstacle-Aware Wireless Sensor Networks
We present Obstacle-aware Virtual Circuit geographic Routing (OVCR), a novel routing mechanism for obstacle-aware wireless sensor networks that uses the obstacle-free path computed...
Ming-Tsung Hsu, Frank Yeong-Sung Lin, Yue-Shan Cha...
ICANNGA
2007
Springer
133views Algorithms» more  ICANNGA 2007»
15 years 3 months ago
Finding the Optimal Path in 3D Spaces Using EDAs - The Wireless Sensor Networks Scenario
Abstract. In wireless sensor networks where sensors are geographically deployed in 3D spaces, a mobile robot is required to travel to each sensor in order to download the data. The...
Bo Yuan, Maria E. Orlowska, Shazia Wasim Sadiq
DCOSS
2007
Springer
15 years 3 months ago
Mobile Anchor-Free Localization for Wireless Sensor Networks
Localization is a fundamental problem in wireless sensor networks. In this paper, we consider how to localize individual nodes in a wireless sensor network when some subset of the...
Yurong Xu, Yi Ouyang, Zhengyi Le, James Ford, Fill...