Sciweavers

139 search results - page 27 / 28
» A beacon-less location discovery scheme for wireless sensor ...
Sort
View
INFOCOM
2007
IEEE
13 years 11 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...
ADHOCNOW
2009
Springer
13 years 6 months ago
On Minimizing the Maximum Sensor Movement for Barrier Coverage of a Line Segment
We consider n mobile sensors located on a line containing a barrier represented by a finite line segment. Sensors form a wireless sensor network and are able to move within the lin...
Jurek Czyzowicz, Evangelos Kranakis, Danny Krizanc...
INFOCOM
2009
IEEE
14 years 21 hour ago
Spatial Distribution in Routing Table Design for Sensor Networks
—We propose a generic routing table design principle for scalable routing on networks with bounded geometric growth. Given an inaccurate distance oracle that estimates the graph ...
Rik Sarkar, Xianjin Zhu, Jie Gao
BROADNETS
2006
IEEE
13 years 7 months ago
On the Broadcast Storm Problem in Ad hoc Wireless Networks
Routing protocols developed for ad hoc wireless networks use broadcast transmission to either discover a route or disseminate information. More specifically, reactive routing proto...
Ozan K. Tonguz, Nawaporn Wisitpongphan, Jayendra S...
MOBICOM
2005
ACM
13 years 11 months ago
MAP: medial axis based geometric routing in sensor networks
One of the challenging tasks in the deployment of dense wireless networks (like sensor networks) is in devising a routing scheme for node to node communication. Important consider...
Jehoshua Bruck, Jie Gao, Anxiao Jiang