Distance edge coloring and collision-free communication in wireless sensor networks

Networks

Volumn 62, Issue 1, 2013, Pages 35-47

  Drira, Kaouther ^a   Seba, Hamida ^a   Effantin, Brice ^a   Kheddouci, Hamamache ^a  

^a UNIVERSITÉ LYON 1   (France)

Author keywords

distance edge coloring; grids; hypercubes; link scheduling; power graphs; sensor networks

Indexed keywords

DISTANCE EDGE COLORINGS; GRIDS; HYPER-CUBES; LINK SCHEDULING; POWER GRAPHS;

COLOR; SCHEDULING; SENSOR NETWORKS; TOPOLOGY; WIRELESS SENSOR NETWORKS;

COLORING;

EID: 84879878914     PISSN: 00283045     EISSN: 10970037     Source Type: Journal    
DOI: 10.1002/net.21491     Document Type: Article

References (35)

1. E. Arikan, Some complexity results about packet radio networks, IEEE Trans Inf Theory 30 (1984), 910-918.
2. B. Balasundaram, and, S. Butenko, Graph domination, coloring and cliques in telecommunications, Handbook of Optimization in Telecommunications, M. Resende, and, P. Pardalos, editors, Springer, USA, 2006, pp. 865-890.
3. C.L. Barrett, V.S.A. Kumar, M.V. Marathe, S. Thite, G. Istrate, and, S. Thulasidasan, Strong edge coloring for channel assignment in wireless radio networks, Proc 4th Ann IEEE Int Conference Pervasive Comput Commun, IEEE, Pisa, Italy, Unknown Month March 13, pp. 106-110.
4. C. Berge, Theorie des graphes et ses applications, Dunod, Paris, 1958.
5. V. Bharghavan, A.J. Demers, S. Shenker, and, L. Zhang, MACAW: A media access protocol for wireless LAN's, Proc ACM SIGCOMM Conference, ACM, London, UK, 1994, pp. 212-225.
6. J.A. Bondy, and, U.S.R. Murty, Graph theory, Graduate texts in mathematics, Vol. 244, S. Axler, and, K.A. Ribet, editors, Springer, US, 2008.
7. M. Cerioli, and, D. Posner, On L(2, 1) -coloring split, chordal bipartite, and weakly chordal graphs, Discr Appl Math 160 (2012), 2655-2661.
8. G. Chartrand, D. Erwin, F. Harary, and, P. Zhang, Radio labelings of graphs, Bull Inst Combin Appl 33 (2001), 77-85.
9. G. Chartrand, and, P. Zhang, Chromatic graph theory, CRC Press, US, 2009.
10. M. Cheng, and, L. Yin, Transmission scheduling in sensor networks via directed edge coloring, Proc IEEE Int Conference Commun (ICC'07), IEEE, Glasgow, Scotland, Unknown Month June 24, pp. 3710-3715.
11. K. Chudá, and, M. Skoviera, L(2,1)-labelling of generalized prisms, Discr Appl Math 160 (2012), 755-763.
12. K. Drira, H. Seba, and, H. Kheddouci, Distance edge coloring of trees, Int Network Optim Conference (INOC'09), Pisa, Italy, 2009.
13. B. Effantin, H. Kheddouci, and, H. Seba, Distance edge coloring of the Kronecker product of some graphs, Ars Combin. in press.
14. S. Gandham, M. Dawande, and, R. Prakash, Link scheduling in sensor networks: Distributed edge coloring revisited, J Parallel Distrib Comput 68 (2008), 1122-1134.
15. D.A. Grable, and, A. Panconesi, Nearly optimal distributed edge colouring in O(log log n) rounds, Random Struct Algorithms 10 (1997), 385-405.
16. J.R. Griggs, and, R.K. Yeh, Labelling graphs with a condition at distance 2, SIAM J Discr Math 5 (1992), 586-595.
17. B.E. Hajek, and, G.H. Sasaki, Link scheduling in polynomial time, IEEE Trans Informat Theory 34 (1988), 910-917.
18. T. Herman, and, S. Tixeuil, A distributed TDMA slot assignment algorithm for wireless sensor networks, Proc 1st Int Workshop Algorithmic Aspects Wireless Sensor Networks (ALGOSENSORS'04), Lecture Notes in Computer Science, Vol. 3121, Springer, Berlin, 2004, pp. 45-58.
19. T. Ito, A. Kato, X. Zhou, and, T. Nishizeki, Algorithms for finding distance-edge-colorings of graphs, J Discr Algorithms 5 (2007), 304-322.
20. S. Jendrol, and, Z. Skupien, Local structures in plane maps and distance colourings, Discr Math 236 (2001), 167-177.
21. T. Kaiser, and, R. Kang, The distance- tchromatic index of graphs, Technical report, arXiv:1205.4171 [math.CO], 2012.
22. R. Kang, and, P. Manggala, On distance edge-colourings and matchings, Electron Notes Discr Math 34 (2009), 301-306.
23. D. König, Uber graphen and ihre anwendung auf determinantentheorie und mengenlehre, Math Ann 77 (1916), 453-465.
24. S. Kulkarni, and, U. Arumugam, Collision-free communication in sensor networks, Proc 6th Symp Self-Stabilizing Syst (SSS'03), Lecture Notes in Computer Science, Vol. 2704, Springer, Berlin, 2003, pp. 17-31.
25. D. Liu, Radio number for trees, Discr Math 308 (2008), 1153-1164.
26. J. Ma, W. Lou, Y. Wu, X.Y. Li, and, G. Chen, Energy efficient TDMA sleep scheduling in wireless sensor networks, Proc IEEE INFOCOM, IEEE, Rio De Janeiro, Brazil, Unknown Month April 19, pp. 630-638.
27. A. Panconesi, and, A. Srinivasan, The local nature of delta-coloring and its algorithmic applications, Combinatorica 15 (1995), 255-280.
28. A.C. Pinho, A.A. Santos, D.R. Figueiredo, and, F.M. França, Two ID-free distributed distance- 2 edge coloring algorithms for WSNs, Proc 8th Int Conference Networking, Lecture Notes in Computer Science, Vol. 5550, Springer, Berlin, 2009, pp. 919-930.
29. S. Ramanathan, A unified framework and algorithm for channel assignment in wireless networks, Wireless Netw 5 (1999), 81-94.
30. S. Ramanathan, and, E.L. Lloyd, Scheduling algorithms for multihop radio networks, IEEE/ACM Trans Networking 1 (1993), 166-177.
31. 1,n-free graphs and its applications, Appl Math Lett 21 (2008), 1188-1193.
32. Z. Skupien, Some maximum multigraphs and edge/vertex distance colourings, Discuss Math Graph Theory 15 (1995), 89-106.
33. V.G. Vizing, On an estimate of the chromatic class of a p-graph, Diskret Analiz 3 (1964), 25-30.
34. R. Wilson, Edge-colorings of graphs-A survey, Theory and applications of graphs, Y. Alavi, and, D. Lick, editors, Lecture Notes in Mathematics, Vol. 642, Springer, Berlin/Heidelberg, 1978, pp. 608-619.
35. P. Zhang, Radio labellings of cycles, Ars Combin 65 (2002), 21-32.