Randomized multi-stage clustering-based geocast algorithms in anonymous wireless sensor networks

Authors:
Alain Bertrand Bomgni;Jean Frédéric Myoupo;Aboubecrine Ould Cheikhna
Affiliations:
University of Yaounde, Yaounde, Cameroon;University of Picardie-Jules Verne, Amiens, France;University of Picardie-Jules Verne, Amiens, France
Venue:
Proceedings of the 2009 International Conference on Wireless Communications and Mobile Computing: Connecting the World Wirelessly
Year:
2009

Citing 9
Cited 0

Multicluster, mobile, multimedia radio network

Wireless Networks
Flooding-based geocasting protocols for mobile ad hoc networks

Mobile Networks and Applications
Obstacle-free geocasting protocols for single/multi-destination short message services in ad hoc networks

Wireless Networks
Distributed Clustering for Ad Hoc Networks

ISPAN '99 Proceedings of the 1999 International Symposium on Parallel Architectures, Algorithms and Networks
Optimal Initialization and Gossiping Algorithms for Random Radio Networks

IEEE Transactions on Parallel and Distributed Systems
Virtual Surrounding Face Geocasting with Guaranteed Message Delivery for Ad Hoc and Sensor Networks

ICNP '06 Proceedings of the Proceedings of the 2006 IEEE International Conference on Network Protocols
Multi-geocast Algorithms for Wireless Sparse or Dense Ad Hoc Sensor Networks

ICNS '08 Proceedings of the Fourth International Conference on Networking and Services
FERMA: an efficient geocasting protocol for wireless sensor networks with multiple target regions

EUC'05 Proceedings of the 2005 international conference on Embedded and Ubiquitous Computing
Geocasting with guaranteed delivery in sensor networks

IEEE Wireless Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.