Sciweavers

Share
IPPS
2003
IEEE

Performance of Distributed Algorithms for Topology Control in Wireless Networks

10 years 5 months ago
Performance of Distributed Algorithms for Topology Control in Wireless Networks
We try to close the gap between theoretical investigations of wireless network topologies and realistic wireless environments. For point-to-point communication, we examine theoretically well-analyzed sparse graphs, i.e. the Yaograph, the SparsY-graph, and the SymmY-graph. We present distributed algorithms that can be used to build up these graphs in time £¥¤§¦©¨ per node without the use of any geographical positioning system. Our algorithms are based only on local knowledge and local decisions and make use of power control to establish communication links with low energy-cost. We compare these algorithms with respect to congestion, dilation, and energy. For congestion we introduce different measures that allow us to investigate the difference between real-world wireless networks and models less communication at a high level of abstraction. For more realistic simulations we extend our simulation environment SAHNE. We use a realistic transmission model for directed communic...
Stefan Rührup, Christian Schindelhauer, Klaus
Added 04 Jul 2010
Updated 04 Jul 2010
Type Conference
Year 2003
Where IPPS
Authors Stefan Rührup, Christian Schindelhauer, Klaus Volbert, Matthias Grünewald
Comments (0)
books