Sciweavers

132 search results - page 3 / 27
» Visibility-Graph-Based Shortest-Path Geographic Routing in S...
Sort
View
TMC
2012
11 years 8 months ago
The Boomerang Protocol: Tying Data to Geographic Locations in Mobile Disconnected Networks
—We present the boomerang protocol to efficiently retain information at a particular geographic location in a sparse network of highly mobile nodes without using infrastructure ...
Tingting Sun, Bin Zan, Yanyong Zhang, Marco Grutes...
INFOCOM
2007
IEEE
14 years 1 days 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...
ALGOSENSORS
2009
Springer
13 years 9 months ago
Routing on Delay Tolerant Sensor Networks
Abstract. Delay (or disruption) tolerant sensor networks may be modeled as Markovian evolving graphs [1]. We present experimental evidence showing that considering multiple (possib...
Michael Keane, Evangelos Kranakis, Danny Krizanc, ...
ICNP
2005
IEEE
13 years 11 months ago
Efficient Hop ID based Routing for Sparse Ad Hoc Networks
Routing in mobile ad hoc networks remains as a challenging problem given the limited wireless bandwidth, users’ mobility and potentially large scale. Recently, there has been a ...
Yao Zhao, Bo Li, Qian Zhang, Yan Chen, Wenwu Zhu
CDC
2009
IEEE
210views Control Systems» more  CDC 2009»
13 years 3 months ago
On maximum lifetime routing in Wireless Sensor Networks
Abstract-- Lifetime maximization is an important optimization problem specific to Wireless Sensor Networks (WSNs) since they operate with limited energy resources which are therefo...
Xu Ning, Christos G. Cassandras