Wireless sensor network (WSN) consists of a large number of low-power, limited-processing capability, MEMS (Micro-Electromechanically Systems) capable of measuring and reporting physical variables related to their environment. WSN (p,n) is a wireless sensor network of p sensors with n items (information) distributed on it. The aim of the permutation routing is to route to each sensor, its n/p items (packets), so it can accomplish its task. In this paper, we are interested in the permutation routing problem on WSN (p,n) when the network is multi-hop. We propose new protocols that perform efficiently with respect to the number of broadcast rounds and run without conflict and collision on the communication channels. The main idea to have a collision-free protocol is to use distributed algorithms to give colors for sensor nodes. Using these colors nodes route the information in parallel until each node receives all its items. Simulation results are presented to give a comparison and show the performances and the effectiveness of our protocols.
['Hicham Lakhlef', 'Julien Bourgeois', 'Saad Harous', 'Jean Frédéric Myoupo']
Collision-Free Routing Protocol in Multi-hop Wireless Sensor Networks