Sciweavers

266 search results - page 26 / 54
» Distributed Routing in Tree Networks with Few Landmarks
Sort
View
IPPS
2003
IEEE
14 years 24 days ago
An Extended Link Reversal Protocol in Dynamic Networks
— We consider the problem of maintaining routing paths between nodes in a dynamic network. Gafni and Bertsekas proposed a link reversal approach called the BG method that maintai...
Jie Wu, Fei Dai
ADHOC
2004
100views more  ADHOC 2004»
13 years 7 months ago
Position and orientation in ad hoc networks
Position and orientation information of individual nodes in ad hoc networks is useful for both service and application implementation. Services that can be enabled by availability...
Dragos Niculescu, Badri Nath
APCHI
2008
IEEE
14 years 2 months ago
On Generating Backbone Trees through Robust Multi-hop Clusters in Wireless Sensor Networks
Routing through a backbone, which is responsible for performing and managing multipoint communication, reduces the communication overhead and overall energy consumption in wireless...
Inyoung Shin, Moonseong Kim, Hyunseung Choo
MDM
2009
Springer
149views Communications» more  MDM 2009»
14 years 2 months ago
ETC: Energy-Driven Tree Construction in Wireless Sensor Networks
Continuous queries in Wireless Sensor Networks (WSNs) are founded on the premise of Query Routing Tree structures (denoted as T), which provide sensors with a path to the querying...
Panayiotis Andreou, A. Pamboris, Demetrios Zeinali...
SENSYS
2003
ACM
14 years 23 days ago
GEM: graph eMbedding for routing and data-centric storage in sensor networks without geographic information
The widespread deployment of sensor networks is on the horizon. One of the main challenges in sensor networks is to process and aggregate data in the network rather than wasting e...
James Newsome, Dawn Xiaodong Song