TY - GEN
T1 - Collision-free routing protocol in multi-hop wireless sensor networks
AU - Lakhlef, Hicham
AU - Harous, Saad
AU - Bourgeois, Julien
AU - Myoupo, Jean Frédéric
N1 - Funding Information:
This work is funded by the Labex ACTION program (contract ANR-11-LABX-01-01), ANR/RGC (contracts ANR-12-IS02-0004-01 and 3-ZG1F) and ANR (contract ANR-2011-BS03-005).
Publisher Copyright:
© 2015 European Union.
PY - 2015/12/22
Y1 - 2015/12/22
N2 - 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.
AB - 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.
KW - Collision-free
KW - Energy-efficiency
KW - Permutation routing
KW - Sensor networks
KW - Tree
UR - http://www.scopus.com/inward/record.url?scp=84964294659&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84964294659&partnerID=8YFLogxK
U2 - 10.1109/CIT/IUCC/DASC/PICOM.2015.16
DO - 10.1109/CIT/IUCC/DASC/PICOM.2015.16
M3 - Conference contribution
AN - SCOPUS:84964294659
T3 - Proceedings - 15th IEEE International Conference on Computer and Information Technology, CIT 2015, 14th IEEE International Conference on Ubiquitous Computing and Communications, IUCC 2015, 13th IEEE International Conference on Dependable, Autonomic and Secure Computing, DASC 2015 and 13th IEEE International Conference on Pervasive Intelligence and Computing, PICom 2015
SP - 92
EP - 99
BT - Proceedings - 15th IEEE International Conference on Computer and Information Technology, CIT 2015, 14th IEEE International Conference on Ubiquitous Computing and Communications, IUCC 2015, 13th IEEE International Conference on Dependable, Autonomic and Secure Computing, DASC 2015 and 13th IEEE International Conference on Pervasive Intelligence and Computing, PICom 2015
A2 - Atzori, Luigi
A2 - Jin, Xiaolong
A2 - Jarvis, Stephen
A2 - Liu, Lei
A2 - Calvo, Ramon Aguero
A2 - Hu, Jia
A2 - Min, Geyong
A2 - Georgalas, Nektarios
A2 - Wu, Yulei
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 15th IEEE International Conference on Computer and Information Technology, CIT 2015, 14th IEEE International Conference on Ubiquitous Computing and Communications, IUCC 2015, 13th IEEE International Conference on Dependable, Autonomic and Secure Computing, DASC 2015 and 13th IEEE International Conference on Pervasive Intelligence and Computing, PICom 2015
Y2 - 26 October 2015 through 28 October 2015
ER -