Randomized multi-stage clustering-based geocast algorithms in anonymous wireless sensor networks
Résumé
Geocasting or Multi-Geocasting in wireless sensor network is the delivery of packets from a source (or sink) to all the nodes located in one or several geographic areas. The objectives of a geocasting (multi-geocasting) protocol are the guarantee of message delivery and low transmission cost. The existing protocols which guarantee delivery run on network in which each node has an ID beforehand. They are valid either only in dense networks or must derive a planar graph from the network topology. Hence the nodes may be adapted in order to carry out huge operations to make the network planar. In this paper we consider anonymous networks. To avoid this drawback, we adopt another strategy. Firstly each node acquires a unique identifier in random ranging from 1 to n3 with high probability. Next we partition the network in multi-stage distributed clusters using Gerla & Tsai method. And finally we derive geocast and multi-geocast algorithms that guarantee delivery and that need less overhead with respect to the existing protocols. They are also suitable for networks with irregular distributions with gaps or obstacles.