GPSR: greedy perimeter stateless routing for wireless networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Dominating Sets and Neighbor Elimination-Based Broadcasting Algorithms in Wireless Networks
IEEE Transactions on Parallel and Distributed Systems
Wireless sensor networks: a survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
An Extended Localized Algorithm for Connected Dominating Set Formation in Ad Hoc Wireless Networks
IEEE Transactions on Parallel and Distributed Systems
Localized topology control for heterogeneous wireless sensor networks
ACM Transactions on Sensor Networks (TOSN)
| Hi-index | 0.00 |
Self-organization appears as a new paradigm for providing efficient, self-adaptive, scalable, fault-tolerant and robust communication protocols in dynamic and distributed wireless multi-hop networks such as Wireless Sensor Networks (WSNs). Thus, it allows high level applications or protocols to operate efficiently above an underlying logical topology without neither waste of resources nor centralized point of control. A variety of distributed algorithms for forming virtual network topologies are being considered as basic mechanisms to achieve these goals. This paper presents performance evaluation and analysis work of two kinds of self-organization algorithms for data gathering applications under realistic radio assumptions for WSN using network simulation tool. In this paper, we investigate the characteristics of self-organization algorithms such as connected dominating set and link pruning strategies during the WSN life. We study the latency, the dissipated energy during the chaotic network deployment, the robustness and the cardinality of virtual topologies. Then, we study the throughput and the communication overhead of these self-organization algorithms while data gathering application are proposed with one or several sinks.