{"citation":{"ama":"Rührup S, Schindelhauer C, Volbert K, Grünewald M. Performance of distributed algorithms for topology control in wireless networks. In: Proceedings of the International Parallel and Distributed Processing Symposium (IPDPS). ; 2003. doi:10.1109/ipdps.2003.1213107","bibtex":"@inproceedings{Rührup_Schindelhauer_Volbert_Grünewald_2003, title={Performance of distributed algorithms for topology control in wireless networks}, DOI={10.1109/ipdps.2003.1213107}, booktitle={Proceedings of the International Parallel and Distributed Processing Symposium (IPDPS)}, author={Rührup, Stefan and Schindelhauer, Christian and Volbert, Klaus and Grünewald, M.}, year={2003} }","ieee":"S. Rührup, C. Schindelhauer, K. Volbert, and M. Grünewald, “Performance of distributed algorithms for topology control in wireless networks,” 2003, doi: 10.1109/ipdps.2003.1213107.","chicago":"Rührup, Stefan, Christian Schindelhauer, Klaus Volbert, and M. Grünewald. “Performance of Distributed Algorithms for Topology Control in Wireless Networks.” In Proceedings of the International Parallel and Distributed Processing Symposium (IPDPS), 2003. https://doi.org/10.1109/ipdps.2003.1213107.","apa":"Rührup, S., Schindelhauer, C., Volbert, K., & Grünewald, M. (2003). Performance of distributed algorithms for topology control in wireless networks. Proceedings of the International Parallel and Distributed Processing Symposium (IPDPS). https://doi.org/10.1109/ipdps.2003.1213107","short":"S. Rührup, C. Schindelhauer, K. Volbert, M. Grünewald, in: Proceedings of the International Parallel and Distributed Processing Symposium (IPDPS), 2003.","mla":"Rührup, Stefan, et al. “Performance of Distributed Algorithms for Topology Control in Wireless Networks.” Proceedings of the International Parallel and Distributed Processing Symposium (IPDPS), 2003, doi:10.1109/ipdps.2003.1213107."},"user_id":"15415","department":[{"_id":"63"},{"_id":"58"}],"abstract":[{"text":"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 Yao-graph, the SparsY-graph, and the SymmY-graph. We present distributed algorithms that can be used to build up these graphs in time $O(log n)$ per node without the use of any geo-graphical 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 for wireless 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 communication that uses sector subdivision. Finally, our experimental results show that our topologies and algorithms work well in a distributed environment and we give some recommendations for the topology control based on our simulations.","lang":"eng"}],"doi":"10.1109/ipdps.2003.1213107","_id":"19806","language":[{"iso":"eng"}],"publication_identifier":{"isbn":["0769519261"]},"year":"2003","publication_status":"published","status":"public","author":[{"first_name":"Stefan","last_name":"Rührup","full_name":"Rührup, Stefan"},{"full_name":"Schindelhauer, Christian ","last_name":"Schindelhauer","first_name":"Christian "},{"first_name":"Klaus","last_name":"Volbert","full_name":"Volbert, Klaus"},{"first_name":"M.","last_name":"Grünewald","full_name":"Grünewald, M."}],"date_updated":"2022-01-06T06:54:13Z","publication":"Proceedings of the International Parallel and Distributed Processing Symposium (IPDPS)","title":"Performance of distributed algorithms for topology control in wireless networks","date_created":"2020-09-30T12:51:22Z","type":"conference"}