Channel Assignment of Triangular and Rhombic Honeycomb Networks Using Radio Labeling Techniques

Authors

DOI:

https://doi.org/10.26713/cma.v12i3.1621

Keywords:

Channel assignment, radio number, bandwidth, trian- gular honeycomb network, rhombic honeycomb network

Abstract

A radio labeling of a graph \(G=(V,E)\) is a function \({f} :{V}(G)\rightarrow {N}\) such that \(d(u,v)+| f(u)-f(v)| \geq 1+ \diam(G)\), where \(d(u,v)\) represents the shortest distance between the vertices \(u\) and \(v\) and \(\diam(G)\) is the diameter of \(G\). The span of a radio labeling \(f\) is defined as \({sp}(f)=\max\{| f(u)-f(v)|:u,v\in V(G)\}\). A radio number of \(G\) is the minimum span of all the radio labelings of $G$ and is denoted by \(rn(G)\). The radio number is used to optimize the assignment of frequency bands to channels in wireless communication networks. The honeycomb network is considered to be one of the most important network for placement of base stations in wireless communications networks. In this paper, the upper and lower bounds for the radio number of two well-known topologies of honeycomb network namely triangular and rhombic honeycomb networks are obtained. These bounds were graphically represented for easy understanding of the minimum and maximum spectrum needed for effective communication in a network.

Downloads

Download data is not yet available.

References

Ahmad Ali, Ruxandra Marinescu-Ghemeci, Radio labeling of some ladder related graphs, Mathematical Report (Bucuresti) 19 (2017), 107-119.

Ahmad Ali, and Azeem Haider. Computing the radio labeling associated with zero divisor graph of a commutative ring, UPB Sci. Bull. Ser. A 81 (2019), 65-72.

Alan A Bertossi, Cristina M Pinotti, Romeo Rizzi and Anil M Shende, Channel assignment for interference avoidance in honeycomb wireless networks, Journal of Parallel and Distributed Computing 64 (2004), 1329-1344.

Alan A Bertossi, Cristina M Pinotti, Romeo Rizzi and Anil M Shende, Channel assignment in honeycomb networks,, In Italian Conference on Theoretical Computer Science, Springer, Berlin, Heidelberg (2003), 150-162.

Bertossi, Alan A., Cristina M. Pinotti, and Richard B. Tan, Channel assignment with separation for interference avoidance in wireless networks, IEEE Transactions on Parallel and Distributed Systems 14 (2003), 222-235.

Bantva Devsi. A lower bound for the radio number of graphs, In Conference on Algorithms and Discrete Applied Mathematics, Springer, Cham, (2019) 161-173.

B. D. Acharya, K. A. Germina, K. L. Princy, and S. B. Rao, Graph labellings, embedding and NP-completeness theorems, J. Combin. Math. Combin. Comput 67 (2008), 163-180.

Bharathi Rajan, Kins Yenoke, Radio number of uniform theta graphs, Journal of Computer and Mathematical Sciences 2 (2011), 874-881.

B. Parhami, D.-M. Kwai, A unied formulation of honeycomb and diamond networks, IEEE Transactions on Parallel and Distributed Systems 12 (2001), 74{79.

Cada, Roman, Jan Ekstein, Premysl Holub, and Olivier Togni, Radio labelings of distance graphs, Discrete Applied Mathematics 161 (2013), 2876|2884.

F.G. Nocetti, I. Stojmenovic and J. Zhang, Addressing and routing in hexagonal networks with applications for tracking mobile users and connection rerouting in cellular networks, IEEE Transactions on Parallel and Distributed Systems 13 (2002), 963{971.

Gary Chartrand, David Erwin, Phing Zhang, and Frank Harary, Radio labelings of graphs, Bull. Inst. Combin. Appl 33 (2011), 77-85.

Havet F, Channel assignment and multicolouring of the induced subgraphs of the triangular lattice, Discrete Mathematics 233 (2001), 219-231.

Havet, F., Klazar, M., Kratochvl, J., Kratsch, D. and Liedlo, M. , Exact algorithms for L(2; 1)-labeling of graphs, Algorithmica 59 (2011), 169-194.

Ivan Stojmenovic, Honeycomb networks: Topological properties and communication algorithms, IEEE Transactions on parallel and distributed systems 8 (1997), 1036-1042.

Jerrold R. Griggs, Roger K. Yeh, Labelling graphs with a condition at distance 2, SIAM Journal on Discrete Mathematics 5 (1992), 586-595.

Joseph A. Gallian, A dynamic survey of graph labeling, Electronic Journal of Combinatorics 1 (2018), DynamicSurveys DS6.

Katzela, Irene, and Mahmoud Naghshineh, Channel assignment schemes for cellular mobile telecommunication systems: A comprehensive survey, IEEE Personal Communications 3 (1996), 10-31.

Kins Yenoke, On the Radio number of extended mesh, Journal of Computer and Mathematical Sciences 5 (2014), 358-366.

L.N. Lester, J. Sandor, Computer graphics on hexagonal grid, Computer Graphics 8 (1984), 401-409.

M Kchikech, R Khennoufa, O Togni, Linear and cyclic radio k-labelings of trees, Discussiones Mathematicae Graph Theory 130 (2007), 105-123.

Manuel, Paul, Rajan Bharati, and Indra Rajasingh, On minimum metric dimension of honeycomb networks, Journal of Discrete algorithms 6 (2008), 20-27.

P K, Niranjan and Kola, Srinivasa Rao, On the radio number for corona of paths and cycles, AKCE International Journal of Graphs and Combinatorics 102 (2020), 1-7.

S. K. Vaidya, P. L. Vihol, Radio labeling for some cycle related graphs, International Journal of Mathematics and Soft Computing 2 (2012), 11-24.

Santhakumaran A, Median of a graph with respect to edges, Discussiones Mathematicae Graph Theory , 32 (2012), 19-29.

Shin Min Kang, Saima Nazeer, Waqas Nazeer, Imrana Kousar, Chahn Yong Jung, Radio Labeling and Radio Number of Caterpillar Related Graphs, Mitteilungen Klosterneuburg 65 (2015), 149-159.

Sen, A., Roxborough, T. and Medidi, S., Upper and lower bounds of a class of channel assignment problems in cellular networks, Proceedings of IEEE INFOCOM 1998, San Francisco CA, 29 March{2 April, IEEE Computer Society Press (1998), 1273-1283.

Sooryanarayana .B, Narayani R. Shankar, and S. Yogalakshmi. Radio number of kth-transformation graphs of a Path, International Journal of Applied Graph Theory, 3(2) (2019), 39-62.

William K. Hale, Frequency assignment: theory and applications, Proceedings of IEEE 68 (1980).

Xiangwen Li, Vicky Mak, Sanming Zhou, Optimal radio labellings of complete m-ary trees, Discrete Applied Mathematics 158 (2010), 507-515.

Downloads

Published

30-09-2021
CITATION

How to Cite

Gomathi, S., & Venugopal, P. (2021). Channel Assignment of Triangular and Rhombic Honeycomb Networks Using Radio Labeling Techniques. Communications in Mathematics and Applications, 12(3), 665–676. https://doi.org/10.26713/cma.v12i3.1621

Issue

Section

Research Article