Sciweavers

2808 search results - page 195 / 562
» Routing betweenness centrality
Sort
View
211
Voted
ACSC
2007
IEEE
16 years 1 months ago
Hybrid Mesh Ad-Hoc On-Demand Distance Vector Routing Protocol
Wireless Mesh Networks (WMNs) have recently gained increasing attention and have emerged as a technology with great potential for a wide range of applications. WMNs can be conside...
Asad Amir Pirzada, Marius Portmann, Jadwiga Induls...
ADHOCNOW
2007
Springer
16 years 1 months ago
Topology Control and Geographic Routing in Realistic Wireless Networks
We present a distributed topology control protocol that runs on a d-QUDG for d ≥ 1/ √ 2, and computes a sparse, constant-spanner, both in Euclidean distance and in hop distance...
Kevin M. Lillis, Sriram V. Pemmaraju, Imran A. Pir...
MOBICOM
2006
ACM
16 years 1 months ago
Routing algorithms for delay-insensitive and delay-sensitive applications in underwater sensor networks
Underwater sensor networks consist of sensors and vehicles deployed to perform collaborative monitoring tasks over a given region. Underwater sensor networks will find applicatio...
Dario Pompili, Tommaso Melodia, Ian F. Akyildiz
MOBICOM
2004
ACM
16 years 15 days ago
Routing in multi-radio, multi-hop wireless mesh networks
We present a new protocol for routing in multi-radio, multi-hop wireless networks. Our protocol, Multi-Radio Link-Quality Source Routing, is designed for wireless networks with st...
Richard Draves, Jitendra Padhye, Brian Zill
CORR
2012
Springer
228views Education» more  CORR 2012»
14 years 2 months ago
Faster Approximate Distance Queries and Compact Routing in Sparse Graphs
A distance oracle is a compact representation of the shortest distance matrix of a graph. It can be queried to retrieve approximate distances and corresponding paths between any p...
Rachit Agarwal, Brighten Godfrey, Sariel Har-Peled