OSERENA, an Optimized Coloring Algorithm for Dense or Large Scale Wireless Networks

Theme: NetworksandTelecommunicationsNetworks,SystemsandServices,DistributedComputingEquipe-ProjetHipercomRapportderecherche n° 7785—November2011—26pagesAbstract: The goal of this research report is to present OSERENA "Opti-mizedSchEdulingRoutErNodeActivity",adistributedcoloringalgorithmop-timizedfordensewirelessnetworks. Networkdensityhasanextremelyreducedimpact on the size of the messages exchanged to color the network. Further-more, the number of colors used to color the network is not impacted by thisoptimization. We describe in this research report the properties of the algo-rithm and prove its correctness and termination. Simulation results point outtheconsiderablegainsinbandwidth.Key-words: OSERENA, distributed coloring, optimization, dense wirelessnetworks, large scale networks, reduced overhead, number of colors, messagesize,convergencetime...

[1]  Pascale Minet,et al.  Node Coloring and Color Conflict Detection in Wireless Sensor Networks , 2010, Future Internet.

[2]  P. Minet,et al.  SERENA: SchEduling RoutEr Nodes Activity in Wireless Ad Hoc and Sensor Networks , 2008, 2008 International Wireless Communications and Mobile Computing Conference.

[3]  Daniel Mossé,et al.  TDMA-ASAP: Sensor Network TDMA Scheduling with Adaptive Slot-Stealing and Parallelism , 2009, 2009 29th IEEE International Conference on Distributed Computing Systems.

[4]  Katia Obraczka,et al.  Energy-Efficient, Collision-Free Medium Access Control for Wireless Sensor Networks , 2006 .

[5]  Rolf Drechsler,et al.  Fast heuristics for the edge coloring of large graphs , 2003, Euromicro Symposium on Digital System Design, 2003. Proceedings..

[6]  Pascale Minet,et al.  Node coloring for dense wireless sensor networks , 2011, ArXiv.

[7]  Katia Obraczka,et al.  Energy-efficient, application-aware medium access for sensor networks , 2005, IEEE International Conference on Mobile Adhoc and Sensor Systems Conference, 2005..

[8]  Charles J. Colbourn,et al.  Unit disk graphs , 1991, Discret. Math..

[9]  Ioannis Caragiannis,et al.  A tight bound for online colouring of disk graphs , 2007, Theor. Comput. Sci..

[10]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[11]  Ioannis Caragiannis,et al.  A Tight Bound for Online Coloring of Disk Graphs , 2005, SIROCCO.

[12]  Jean-Claude Bermond,et al.  Improper Coloring of Weighted Grid and Hexagonal Graphs , 2010, Discret. Math. Algorithms Appl..

[13]  Injong Rhee,et al.  Z-MAC: a hybrid MAC for wireless sensor networks , 2005, SenSys '05.

[14]  Rachel Cardell-Oliver,et al.  FlexiTP: A Flexible-Schedule-Based TDMA Protocol for Fault-Tolerant and Energy-Efficient Wireless Sensor Networks , 2008, IEEE Transactions on Parallel and Distributed Systems.

[15]  Jin-Kao Hao,et al.  Coloring large graphs based on independent set extraction , 2012, Comput. Oper. Res..

[16]  Alain Hertz,et al.  A survey of local search methods for graph coloring , 2004, Comput. Oper. Res..

[17]  Maaly Awad Hassan,et al.  A Review of Interference Reduction in Wireless Networks Using Graph Coloring Methods , 2011, ArXiv.

[18]  S. Thomas McCormick,et al.  Optimal approximation of sparse hessians and its equivalence to a graph coloring problem , 1983, Math. Program..