Sciweavers

19 search results - page 1 / 4
» On the Longest RNG Edge of Wireless Ad Hoc Networks
Sort
View
ICDCS
2008
IEEE
14 years 1 months ago
On the Longest RNG Edge of Wireless Ad Hoc Networks
— Relative neighborhood graph (RNG) has been widely used in topology control and geographic routing in wireless ad hoc networks. Its maximum edge length is the minimum requiremen...
Peng-Jun Wan, Lixin Wang, F. Frances Yao, Chih-Wei...
TWC
2010
13 years 1 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
DIALM
2003
ACM
133views Algorithms» more  DIALM 2003»
14 years 9 days ago
Ad-hoc networks beyond unit disk graphs
In this paper, we study an algorithmic model for wireless ad hoc and sensor networks that aims to be sufficiently close to reality as to represent practical realworld networks whi...
Fabian Kuhn, Aaron Zollinger
EWSN
2006
Springer
14 years 6 months ago
Constraint-Based Distance Estimation in Ad-Hoc Wireless Sensor Networks
Abstract. We propose a lightweight localisation approach for supporting distance and range queries in ad hoc wireless sensor networks. In contrast to most previous localisation app...
Urs Bischoff, Martin Strohbach, Mike Hazas, Gerd K...
ICC
2011
IEEE
257views Communications» more  ICC 2011»
12 years 6 months ago
Increasing the Lifetime of Roadside Sensor Networks Using Edge-Betweenness Clustering
Abstract—Wireless Sensor Networks are proven highly successful in many areas, including military and security monitoring. In this paper, we propose a method to use the edge–bet...
Joakim Flathagen, Ovidiu Valentin Drugan, Paal E. ...