Premium
Randomized broadcasting in wireless mobile sensor networks
Author(s) -
Abdallah Nesrine Ouled,
Kacem Hatem Hadj,
Mosbah Mohamed,
Zemmari Akka
Publication year - 2013
Publication title -
concurrency and computation: practice and experience
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.309
H-Index - 67
eISSN - 1532-0634
pISSN - 1532-0626
DOI - 10.1002/cpe.2804
Subject(s) - computer science , rendezvous , asynchronous communication , wireless sensor network , pairwise comparison , broadcasting (networking) , computer network , distributed computing , population , wireless network , wireless , atomic broadcast , distributed algorithm , artificial intelligence , telecommunications , engineering , demography , sociology , spacecraft , aerospace engineering
SUMMARY Wireless sensor networks are a new generation of networks that need specific models and algorithms. We are interested specifically in mobile wireless sensor networks that are considered as anonymous asynchronous distributed mobile systems. As broadcast is one of the most important applications for such networks, and as it depends on the communication model, we tried to find the most suitable one to make a distributed broadcast algorithm. We adopted the population protocols, the Angluin's model of pairwise interactions of anonymous finite‐state agents, to broadcast an information. We tried to modify this model to avoid the information duplication and then calculated the complexity of the algorithm. Then, we extended the model with the rendezvous one that made the stabilization of the algorithm faster. The implementation, the simulation, and the validation of these algorithms and results have been done with Visidia. Copyright © 2012 John Wiley & Sons, Ltd.