Sciweavers

247 search results - page 15 / 50
» Topology Reconstruction and Characterisation of Wireless Ad ...
Sort
View
DIALM
2003
ACM
175views Algorithms» more  DIALM 2003»
15 years 6 months ago
Localized construction of bounded degree and planar spanner for wireless ad hoc networks
We propose a novel localized algorithm that constructs a bounded degree and planar spanner for wireless ad hoc networks modeled by unit disk graph (UDG). Every node only has to kn...
Yu Wang 0003, Xiang-Yang Li
IPPS
2002
IEEE
15 years 6 months ago
Distributed Spanner with Bounded Degree for Wireless Ad Hoc Networks
In this paper, we propose a new distributed algorithm that constructs a sparse spanner subgraph of the unit disk graph efficiently for wireless ad hoc networks. It maintains a li...
Yu Wang 0003, Xiang-Yang Li
TWC
2010
14 years 8 months ago
Sharp thresholds for relative neighborhood graphs in wireless Ad Hoc networks
In wireless ad hoc networks, relative neighborhood graphs (RNGs) are widely used for topology control. If every node has the same transmission radius, then an RNG can be locally co...
Chih-Wei Yi, Peng-Jun Wan, Lixin Wang, Chao-Min Su
113
Voted
QSHINE
2005
IEEE
15 years 6 months ago
On Increasing End-to-End Throughput in Wireless Ad Hoc Networks
One of the main characteristics of wireless ad hoc networks is their node-centric broadcast nature of communication, leading to interferences and spatial contention between adjace...
Zongpeng Li, Baochun Li
ICPPW
1999
IEEE
15 years 5 months ago
An On-Demand Shared Tree with Hybrid State for Multicast Routing in Ad Hoc Mobile Wireless Networks
This paper describes the Multicast Shared Tree Protocol MSTP that has been designed to support the delivery of multicast packets in a mobile ad hoc network. MSTP uses a shared tre...
Elena Pagani, Gian Paolo Rossi