Sciweavers

247 search results - page 9 / 50
» Topology Reconstruction and Characterisation of Wireless Ad ...
Sort
View
GLOBECOM
2006
IEEE
16 years 3 days ago
Efficient Construction of Weakly-Connected Dominating Set for Clustering Wireless Ad Hoc Networks
In most of the proposed clustering algorithms for wireless ad hoc networks, the cluster-heads form a dominating set in the network topology. A variant of dominating set which is mo...
Bo Han, Weijia Jia
CNSR
2007
IEEE
101views Communications» more  CNSR 2007»
16 years 12 days ago
The Theory of Natural Movement and its Application to the Simulation of Mobile Ad Hoc Networks (MANET)
The theory of natural movement is fundamental to space syntax: a set of theories and methods developed in the late 1970s that seeks, at a general level, to reveal the mutual effec...
Nick Sheep Dalton, Ruth Conroy Dalton
ALGOSENSORS
2006
Springer
15 years 9 months ago
Self-stabilizing Weight-Based Clustering Algorithm for Ad Hoc Sensor Networks
Ad hoc sensor networks consist of large number of wireless sensors that communicate with each other in the absence of a xed infrastructure. Fast self-recon guration and power eci...
Colette Johnen, Le Huy Nguyen
TDSC
2010
157views more  TDSC 2010»
15 years 23 days ago
On the Survivability of Wireless Ad Hoc Networks with Node Misbehaviors and Failures
Network survivability is the ability of a network keeping connected under failures and attacks, which is a fundamental issue to the design and performance evaluation of wireless ad...
Fei Xing, Wenye Wang
TIT
2010
173views Education» more  TIT 2010»
15 years 23 days ago
Asymptotic critical transmission radius for k-connectivity in wireless ad hoc networks
A range assignment to the nodes in a wireless ad hoc network induces a topology in which there is an edge between two nodes if and only if both of them are within each other's...
Peng-Jun Wan, Chih-Wei Yi, Lixin Wang