International Journal of Computer Networks & Communications (IJCNC)



Swarm Optimization based Gravitational Search Approach for Channel Assignment in MCMR Wireless Mesh Network

Nandini Balusu1 , Suresh Pabboju2 and Narsimha G 3

 1Assistant Professor, Department of Computer Science, Telangana University, Nizamabad, Telangana, India.

 2Professor, Chaitanya Bharathi Institute of Technology, Hyderabad, Telangana State, India.

3Professor, Department of Computer Science, JNTUH College of Engineering, Hyderabad, Telangana, India.


Wireless Mesh Networks offers cost-efficient and higher network efficiency by utilizing multiple channels multiple radio(MCMR) nodes. Also addition, the amalgamation of multiple radio nodes and multiple hops mesh framework tends to overcome the limitation of single radio networks like the ability to achieve the rising accessible system bandwidth. In spite of these benefits, certain MCMR wireless mesh networks still suffer from performance issues like network connectivity, network throughput degradation whenever network size increases. Thus, an effective channel assignment (CA) approach could minimize the number of interference cochannels and enhance the throughput of the network. Thus, a hybridized form of gravitational search approach and particle swarm optimization is presented in this paper to resolve the issue of CA. The velocity and position updates of PSO are merged with the GSA operations to obtain the best channel with good connectivity. This approach maximizes the capability of exploration and exploitation for global and local searches using PSO and GSA operations. The goal of this methodology is the minimization of a number of interfering links and the maximization of network connectivity and throughput. The experimental results for this approach are carried out using NS2 and compared with previously suggested heuristic optimization algorithms such as Learning Automated and Genetic Algorithm Approach, Improved Gravitational Search Approach and Dynamic particle swarm optimization Approach. The simulation outcome showed a better performance of the suggested methodology compared to existing methodologies.


Wireless Mesh Network, Channel Assignment, Multi-Channel Multi-Radio, Particle Swarm Optimization,
Gravitational Search Algorithm.


Wireless Mesh Networks (WMNs) is being evolved the significant technique in the wireless networks over the previous few decades. The causes behind these evolutions are certain eminent features of WMNs like self-organizing, spatial reusability, and fault tolerance. The WMN attains these features through nodes with bi-functionalities which spontaneously create and control the associations amongst themselves. The multi-hop strategy of WMNs and the quick progress in throughput ends to multiple channels and multiple radios architectures in the mesh networks; however, the interfering of associated channels is the vital issue that minimizes the complete throughput specifically in multi-hop networks. In MCMR nodes, every node is armed with two or more radio and communicating channels are chosen depending on channel assignment approaches.

The channel assignment approaches in MCMR WMN require allotting numerous channels to its radios at a node and simultaneously must select a single channel for every connection in the path using a routing algorithm. Thus, the procedures in MCMRWMNs require much superiority to monitor the space requirement and optimize the efficiency of the network. Else, WMNs might process poorly because of the incompetent usage of several accessible channels and the numerous radios at its disposal [1, 2].

The significant goal in any MCMR wireless mesh network is minimization of network interference and a maximization of network throughput and connectivity. This is achieved by constructing an efficient channel assignment algorithm. Extensive research has also been done using metaheuristic algorithms such as Genetic Algorithm, Particles Swarm Optimization, Ant Bee Colony, and Gravitational Search Algorithm to develop an optimum channel assignment algorithm.

In [3], an enhanced type of gravitational search approach (IGSA) is suggested to resolve the channel assignment issue for WMNs by merging the velocity and particle updating operation of PSO for global and local search. However, IGSA still suffers from the exploitation i.e. from slow search speed, particularly in the last iteration. Therefore, to maximize exploitation and exploration property, in this paper particle swarm optimization is employed along with the GSA approach to maximize the capabilities of exploration and exploitation. GSA is motivated with by Newtonian laws of gravity and motion [4].

In population aided approaches having social actions such as PSO and GSA should take into consideration two internal features i.e. capability to explore the compete for a portion of the search region and capability to exploit the finest outcomes. Probing in the entire problem domain is known as exploration while moving toward the finest outcome to obtain a better solution is known as exploitation. In PSO, exploration capability is achieved through evaluating Pbest and exploitation capability is achieved through evaluating. Whereas, in GSA, by means of selecting appropriate values for arbitrary constraints (𝐺0 and 𝑎), the exploration is assured however slower movement of denser agents could not always assure exploitation capability.

Gravitational Search Algorithm

GSA is one of the heuristic approaches that are attaining attention amongst the scientific communities currently. This is a natured motivated approach that depends on Newton’s law of gravity and motion [4]. This algorithm is gathered beneath the population aided methodology and is stated to be much instinctive [5]. This approach is aimed to enhance the efficiency of exploration and exploitation of any population aided methods, depending on the rules of the gravity. Nevertheless, in current days GSA is being complained of not honestly depending law of gravity [6]. This is stated to ignore distance amongst masses, while mass and distance are in combined the fundamental portion of law of gravity. In spite of the complaints, the approach is further been investigated and recognized by scientific communities.

GSA was initially introduced in [4] and is aimed to resolve the issues of optimization. The population-aided heuristic approach depends on the law of gravity and mass communication. This methodology consists of a group of searching elements that communicate with one another by means of gravity force [4]. The agents are termed to be elements and their efficiency is measured through its masses. The gravitational force performs a globalized movement such that the entire elements travel in the direction of other elements having huge mass. The gentle movement of huge masses assures the exploitation phase and in turn, results in the best outcomes. The masses are essentially following the gravitational law as given in (1) and the law of motion as in (2).

Depending on Equation (1), F refers to the magnitude of gravitational force, G is the constant, M1 and M2 refer to a mass of initial and subsequent elements and R refers to the distance amongst the two elements. Equation (1) exhibits that in Newton law of gravity, the gravity force amongst two elements is directly proportionate to the product of its masses and inversely proportionate to the square of distance amongst the elements. Whereas in Equation (2), Newton’s second law exhibit that whenever a force, F, is employed on an element, its acceleration,𝑎, hinges on force and its mass, M. In GSA, an agent has four constraints such as location, a mass of inertia, active and passive gravity mass [4]. The location of the mass signifies the outcome of the issue, where the gravity and mass of inertial mass are defined employing the fitness evaluation. The approach is directed through tuning these gravity and inertia masses, while every mass signifies an outcome. Masses are fascinated with the heavier mass. Therefore, the higher mass gives an optimal outcome in the searching domain.

Organization of the Paper

A brief description of MCMR Wireless Mesh Network, Traditional Gravitational Search Approach, and motivation for the suggested methodology is given in this section. A brief review of previously suggested channel assignment techniques both heuristics and non-heuristics is given in section 2. The suggested Swarm Optimization based Gravitational Search Algorithm for Channel Assignment is explained in detail in the section 3. The experimental results and its brief analysis are illustrated in section 4. The conclusion for the paper and reference is addressed in section 5 and section 6.


Numerous investigations that suggest numerous channel assignment approaches to mine the finest solutions. Several research studies [7, 8, 9, 10, 11, 12 and 13] tried to examine the priori suggested approaches from dissimilar perceptions. CLICK [14] is a DFS dependent channel assignment approach that employs the greedy technique to determine the linked lower interference network in a multiple channel WMN. CLICK allows channels to the connections depending on a greedy technique with identical spirit of graph colouring. It employs an adaptive prior approach that modifies the node’s importance in course of implementation to assure the association. Lastly, it combines unallotted radios in the a similar greedy way or depending on the load of the traffic. The other approach, Interference Survival Topology Control (INSTC) [15] reduces the maximal connected co- channel interference using a basic fitness evaluation function that is similar to the diminishing of maximal connected conflict load in CLICA.

Genetic Algorithm (GA) is a stochastic exploration technique. GA aided channel assignment [16] is the integrated and stationary approach for allotting the channels to WMN. This approach endeavours to diminish the whole interfering traffic weight on the network. This methodology uses a distinctive illustration of individuals for the assignment of the channel. In this approach, each gene signifies an assigned channel for the network as to denote an individual. This approach tries to reduce the complete interference by evading of localized optimum employing a mutation operation. Nevertheless, this approach does not have any fitness evaluation function to regulate the connectivity of the network. Hence, the consequent channel assignment strategy might lose the connections. Furthermore, it does not take into account the exterior interference, traffic weights, and environmental effect.

NSGA-II-dependent channel assignment [17] is of one the integrated and semi-static approaches for allotting channels to network links. This approach tries to obtain two optimized evaluation functions those subjects to two parameters. The fitness functions optimization comprises maximizing the connectivity of the network and minimizing the interference. The other NSGA-II based strategy [18] employs identical operations and constraint values as given in [17] and tries to enhance a joint channel assignment and multicasting routing issues in multi radio WMNs. NSGA-II-dependent channel assignment approach guarantees connectivity along with demonstrating a quick convergence frequency having a definite escape from the local minimum. Nevertheless, these procedures disregard the presence of non-overlapping channels, exterior interferences, and traffic weight and environment influences.

DPSO-CA [19] is a PSO aided assignment strategy that refers to the distinct searching domain and intends to obtain the minimal interference channel assignment with the network conservation [20]. DPSO-CA exploits collaboration amongst the searching techniques of the fundamental PSO approach and genetic operations like crossover and mutation to guarantee the optimization. The other assignment strategy depends on Improved Gravitational Search Algorithm (IGSA) [3] that enhances the notion of the DPSO-CA approach. GSA is an alternative for PSO, where elements are defined to be a group of masses that communicates with one another depending on the Newtonian gravity and laws of motion. This approach proposed a localized searching aided operation to enhance the efficiency of fundamental GSA through improving the exploration abilities. IGSA aided channel assignment is identical to DPSOCA that intends to minimize the entire channel interference along with guaranteeing the network conservation.

GTS aided channel assignment [21] is an integrated and static approach that possibly allot channels to the Maximal Independent Set (MIS) of Mesh Network. This approach initiates certain arbitrarily picked channel assignments for any conflict graph. GTS enhances allotment using numerous generations. An enhanced adjoining outcome is deposited in a restricted dimension centralized memory in addition to the older ones. Moreover, identical to this step, the other approach in [22] similarly employs Tabu search for channel assignment. Furthermore, an enhanced a tabu search aided approach in [23] amalgamates handoff and traffic load disparity constraints in the fitness evaluation function. This enhanced optimization prototype enables attaining much-optimized channel assignment resolutions.


The channel assignment approach conserves network connections in a way that both the nodes in the transmitting range could connect if a common link is associated to them. In this section, a modified Gravitational Search Approach is presented by incorporating the abilities of PSO for optimum channel assignment strategy for MCMR WMN. The preliminary notion of proposed approach is to amalgamate the capability for societal intellectual obtained through 𝐺𝑏𝑒𝑠𝑡 in PSO along with localized exploitation competence of GSA. The “No Free Lunch Theorem” in [24] defines that no unique approach could resolve the entire issues in an optimum manner. For certain heuristic optimization approaches, the hybridization has been a significant device for enhancing the efficiency of the network connectivity.

Network Model

A WMN having static wireless nodes are considered where every node comprises of radios having antennas in Omni direction. This is a homogenous network having similar specifications in terms of radios and transmission range. The network topology is defined using the graph𝐺(𝑉, 𝐸), here 𝑉 refers to the group of mesh nodes and 𝐸 refers to the link amongst the nodes. For any two nodes in transmitting ranges of one another, there is a link (𝑥, 𝑦)amongst 𝑥 and 𝑦. The nodes must always be within in the interference range of one another.

The Conflict graph is extensively employed to model the interference that specifies the communication links that interfere with one another. This transforms the channel assignment issues to the Max K-cut and Min K-cut partitioning issue. The conflicting graph 𝐺𝑐 (𝑉𝑐 ,𝐸𝑐 ) is given where 𝑉𝑐 refers to the vertices and 𝐼𝑥𝑦 represents the communication link amongst(𝑥, 𝑦). There is a conflict edge between (Ixy, Iab) if and only if (𝑥, 𝑦) and (𝑎, 𝑏) interfere with one another where these links are on similar channel and in the interfering range of one another. If 𝐺(𝑉, 𝐸) exhibits the standard network, then 𝐺𝑐 (𝑉𝑐 , 𝐸𝑐 ) is a conflicting graph such that 𝑉𝑐 ∈ 𝐸.The complete network interference is the summation of entire connections that are intervening with one another.

In the proposed approach, initially all the agents are arbitrarily initialized considering every agent as a candidate solution nothing but the channel assignment in this paper. The location of every agent is given as:

Here 𝑝𝑖 𝑑 is the location of 𝑥 𝑡ℎ element in 𝑑 𝑡ℎ dimension and N is agent count or swarm dimension. In course of the generation, the gravitational force from element𝑦 on to the element 𝑥 at a defined time is given as:

Here 𝑀𝑎𝑥 refers to the active gravitational mass associated to element 𝑦, 𝑀𝑝𝑥 refers to the passive gravitational mass associated to the agent 𝑥, 𝐺(𝑡) refers to gravity constant at time 𝑡, 𝜀 is a constant value and 𝑅𝑥𝑦(𝑡) refers to Euclidean distance amongst the two agents 𝑥and 𝑦. The gravitational constant and Euclidean distance amongst the two agents 𝑥and 𝑦 is estimated as:

Here, 𝛼 is descent coefficient, 𝐺0 refers to original gravitational constant, 𝑖𝑡𝑒𝑟 is the present iteration value and 𝑚𝑎𝑥𝑖𝑚𝑢𝑚𝑖𝑡𝑒𝑟 is the iterations dimension. Once the gravitational force, gravitational constant and consequent forces are evaluated, the accelerations of elements are given as:

Here, d is the dimension t defines the definite time and 𝑀𝑥 is mass of the agent 𝑥. In every generation, the finest solution is updated. Once the acceleration ,and updated best solution, velocities and position of entire agents are evaluated using the PSO Velocity and position as given below:


Here, 𝑉𝑥 (𝑡) refers to the velocity agent 𝑥 at iteration t, 𝑐𝑦 ′ is the acceleration coefficient, 𝑤 refers to the weight function, 𝑟𝑎𝑛𝑑𝑜𝑚 is the randomized number amongst 0 and 1, 𝑎𝑐𝑥 (𝑡) is the acceleration agent 𝑥 at iteration 𝑡, 𝑔𝑏𝑒𝑠𝑡 refers to the finest solution. The location of the agent is given as:


The velocity and position update of PSO selects few nodes having the best solutions and enhances it through selecting the best nodes for channel assignment. For this purpose, every chosen node, PSO arbitrarily alters few channel that allocated with nodes amongst the available channel. The Fitness function 𝐹𝑖𝑡(𝑓) is sum of the interferences amongst the link x and y i.e (x,y) which is given as:


In the initialization phase, a common channel is employed to neighbor nodes. Every agent is channel assignment outcome and fitness evaluation function is estimation of interference in the complete network. In this evaluation entire network is considered with radio constraints. In the proposed approach, the quality of a solution is obtained from the fitness evaluation and good solutions attempt to fascinate another agent through searching from diverse portions of the search domain. Guest assists in providing global value. This approach employs the memory to save the best solution. Through adjusting and, 𝑐1 ′ and 𝑐2 ′ , the capability of global and local searching could be stabilized.

Pseudocode for the Proposed Methodology
   1. Randomly initialize the agents P_x (t) as given equation (3)
   2. Estimate the Fitness function for the complete population using equation (10).
   3. Update the values 〖F_x〗^d (t), gbest for all x=1,2,……N using equation (4).
   4. Evaluate the passive and active gravitational forces, constants and accelerations using the
   equation (5), (6) and (7).
   5. Update the Agents subsequent position and Velocity using the equation (8) and (9).
   6. Check for the Termination Criterion.
  7. Repeat the steps 2 to 5 till the termination conditioned is attained.


Figure 1 .Flow Chart of SOGSA based Channel Assignment Algorithm


The Performance evaluation of the suggested channel assignment algorithm is given in this section and is carried out using Network Simulator – 2 (NS2). An MCMR WMN is randomly generated using 105 nodes among which 97 are client nodes, 4 are mesh routers and 4 are mesh gateways. The experiment is carried out in a coverage area 1000*1000 with a simulation period of 150 milliseconds. The Table represents the parameter values employed for the proposed assignment algorithm.

Table 1 .Simulation Parameters

The channel assignment algorithm is evaluated using seven different performance metrics namely Network end-to-end delay, Average Cost Ratio, Packet Delivery Ratio, Packet Data Loss, Energy Efficiency, Energy Consumption, and network throughput. Some of the performance metrics are defined as:

  • Average packet delivery ratio: This is defined as packets obtained for all multicast receivers above the packets sent by the source averaged on entire multicast receivers. This criterion specifies the packets count delivered to the multicast receivers over the packets expected to be received by multicast receivers.
  • Average end-to-end delay: This is given as average time elapsed amongst packets send usingØ multicast source and receiving the packets to the entire multicast receivers. This criterion is averaged on entire receivers.
  • Average throughput: This is given as the size of packets obtained through the receiver over theØ needed time to provide the number of packets averaged on entire multicast receivers.

Where 𝑁𝑅𝑃(𝑀𝑅𝑖 ) refers to the number of received packets at 𝑖 𝑡ℎ multicast receiver. |𝑀𝑅𝑆| specifies cardinality of Multicast Receiver Set and RT is the required time to deliver the number of packets.

  • Total cost: This is given as a number of links forming a multicast routing tree.

Figure 2 . Comparison of Network End-to End Delay Evaluation

The efficiency of the proposed channel assignment algorithm is compared with existing assignment algorithms such as Learning Automata and Genetic Algorithm Based Channel Assignment Approach [25], Improved Gravitational Search Algorithm based Channel Assignment [3] and DPSO based Channel Assignment [19]. As exhibited in Fig 2, Fig 3, Fig 4, Fig 5, Fig 6, Fig 7 and Fig 8, the comparison of Network End to End Delay evaluation, Packet Drop, Energy Consumption, Network Energy Efficiency, Packet Delivery Ratio, Network Throughput and Network Cost Evaluation against the no of nodes are illustrated.

Figure 3 . Comparison of Network Packet Drop

From Fig 2, Fig 3 and Fig 4, it can be inferred that the network End-to-End Delay, packet drop and energy consumption of the proposed Swarm Optimization based Gravitational Search Algorithm for Channel Assignment (SOGSA) is less when matched with the existing approaches such as LAGA, IGSA ,and DPSO-CA. From Fig 2 and Fig 3, it is also inferred that the end to end delay and packet drop of very less compared to the existing algorithm which depicts a better network efficiency from other approaches.

Figure 4 . Comparison of Energy Consumption Vs Simulation time

Figure 5 . Comparison of Network Energy Efficiency


Figure 6 . Comparison of Network Packet Delivery Ratio

From Fig 5, Fig 6 and Fig 7, it can be inferred that the Network energy efficiency, Packet delivery ratio and network through evaluation of the proposed SOGSA based Channel Assignment approach is more when matched with existing techniques like LAGA, IGSA, DPSO-CA algorithms. From Fig 7, it can also be depicted that network throughput is far higher compared to the previously suggested algorithms. Fig 8 depicts the network cost evaluation comparison of the suggested algorithms. From Fig 8, it is exhibited that the cost of the suggested SOGSA methodology is comparatively in similar lines with the Learning Automata and Genetic Algorithm based Channel Assignment approach and lesser than the other suggested methodologies such as IGSA and DPSO-CA methodologies.

Figure 7 .Comparison of Network Throughput Calculation


Figure 8 .Comparison of Network Cost Evaluation

In the literature numerous approaches employed for efficient channel selection in Multi-Channel Multi-Radio Wireless Mesh Networks. In this paper, a novel methodology is presented for the assignment of minimum interference channels to maximize network connectivity and network throughput. The operations of the Gravitational Search Approach are merged with the operation of Particle Swarm Optimization such that the capabilities of exploration and exploitation are maximized for obtaining optimum channel assignment. The best solutions are obtained by evaluating the gravitational force from the GSA algorithm and 𝐺𝑏𝑒𝑠𝑡 from the PSO approach along with fitness function for optimum channels in WMN. The Performance of the suggested Swarm optimization Gravitational Search Algorithm based channel assignment methodology is compared with the previously suggested heuristics-based algorithms. The experimental results exhibited that the suggested technique has better performance when compared with previously suggested methodology in terms of Network end-to-end delay, packet delivery ratio, network throughput, energy consumption, energy efficiency ,and packet drop.


[1] Gong,D.,Zhao,M.,Yang,Y.,2013.Channelassignmentinmulti-rate802.11nWLANS. In: Proceedings of IEEEWCNC,pp.392–397.


[3] M. Doraghinejad, H. Nezamabadi-pour, and A. Mahani, Channel assignment in multi-radio wireless mesh networks using an improved gravitational search algorithm, Journal of Network and Computer Applications, vol. 38, pp. 163-171, 2014, Elsevier.

[4] E. Rashedi, S. Nezamabadi, S. Saryazdi, GSA: a gravitational search algorithm, Information Sciences 179 (13) (2009) 2232–2248.

[5] R. K. Khadanga and S. Panda, “Gravitational search algorithm for Unified Power Flow Controller based damping controller design,” 2011International Conference on Energy, Automation and Signal, (2011), pp.1–6.

[6] M. Gauci, T. J. Dodd, and R. Groß, “Why ‘GSA: a gravitational search algorithm’ is not genuinely based on the law of gravity,” Natural Computing, (2012), pp. 1–2.

[7] W. Si, S. Selvakennedya and A.Y. Zomaya, An overview of Channel Assignment methods for multiradio multi-channel wireless mesh networks, Article in Press, Journal of Parallel and Distributed Computing, 2009.

[8] A. Alzubir and K. A. Bakar and A. Yousif and A. Abuobieda, Stateof The Art, Channel Assignment Multi- Radio Multi-Channel in WirelessMesh Network, International Journal of Computer Applications,Foundation of Computer Science (FCS), vol. 37, no. 4, pp. 14-20, 2012.

[9] Y. Chen and N. Xie and G. Qian and H. Wang, Channel assignment schemes in Wireless Mesh Networks, Proceedings of the IEEE GlobalMobile Congress (GMC), pp. 1-5, 2010.

[10] M.A. Hoque and X. Hong, Channel Assignment Algorithms for MRMC Wireless Mesh Networks, International Journal of Wireless & MobileNetworks (IJWMN), vol. 3, no. 5, 2011.

[11] Y. Feng and K.L.E. Law and D.J. He, Comparisons of channel assignment algorithms for wireless mesh networks, International Journal of Internet Protocol Technology, Inderscience Enterprises Ltd, vol. 5, no.3, pp. 132-141, 2010.

[12] J. Crichigno and M.Y. Wu and W. Shu, Protocols and architectures for channel assignment in wireless mesh networks, Ad Hoc Networks, Elsevier, vol. 6, no. 7, 2008.

[13] D. Benyamina and A. Hafid and M. Gendreau, Wireless Mesh Networks DesignA Survey, Communications Surveys & Tutorials, IEEE, no. 99,pp. 1-12, 2011.

[14] M.K. Marina and S.R. Das and A.P. Subramanian, A topology control approach for utilizing multiple channels in multi-radio wireless mesh networks, Computer Networks, Elsevier, vol. 54, no. 2, pp. 241- 256,2010.

[15] J. Tang, G. Xue, and W. Zhang, Interference-aware topology control and QoS routing in multi-hannel wireless mesh networks, Proceeding sof the 6th ACM international symposium on Mobile ad hoc networking and computing, pp. 68-77, 2005.

[16] S. Sridhar, J. Guo, and S. Jha, Channel Assignment in Multi-Radio Wireless Mesh Networks: A GraphTheoretic Approach, First International Conference on Communication Systems and Networks, COMSNETS ,January 2009.

[17] J. Chen, J. Jia, Y. Wen, D. zhao, and J. Liu, A genetic approach to channel assignment for multi-radio multi-channel wireless mesh networks, Proceedings of the first ACM/SIGEVO Summit on Genetic and EvolutionaryComputation, pp. 39-46, 2009.

[18] E. Vaezpour, and M. Dehghan, A Multi-Objective Optimization Approach for Joint Channel Assignment and Multicast Routing in Multi-Radio Multi-Channel Wireless Mesh Networks, Wireless personal communications ,vol. 77, no. 2, pp. 1055-1076, 2014, Springer.

[19] H. Cheng, N. Xiong, A. V. Vasilakos, L. T. Yang, G. Chen, andX. Zhuang, Nodes organization for channelassignment with topology preservation in multi-radio wireless mesh networks, Ad Hoc Networks,vol. 10, no. 5, pp. 760-773, 2012, Elsevier.

[20] H. Cheng, N. Xiong, G. Chen, and X. Zhuang, Channel Assignment with Topology Preservation for Multi-radio Wireless Mesh Networks, Journal of Communications, vol. 5, no. 1, pp. 63-70, 2010.

[21] L. Zhang, X. Wang, and C. Liu, Channel Assignment in Multi-radioMulti-channel Wireless Mesh Network by Topology Approach, WRI International Conference on Communications and Mobile Computing, vol. 2, pp. 358-362, January 2009.

[22] A.P. Subramanian, H. Gupta, and S.R. Das, Minimum Interference Channel Assignment in Multi-Radio Wireless Mesh Networks, 4th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks, SECON, pp. 481-490, June 2007.

[23] J. Rezguia, A. Hafida, R. B. Alia, and M. Gendreaub, Optimization model for handoff-aware channel assignment problem for multi-radio wireless mesh networks, Computer Networks, vol. 56, no. 6, pp. 1826-1846, 2012, Elsevier.

[24] D. H. Wolpert, W. G. Macready, “No free lunch theorems for optimization”, IEEE Trans. Evol. Comput., vol. 1, no. 1, pp. 67-82, Apr. 1997.

[25] Balusu, N., Pabboju, S. & Narasimha, G. An Intelligent Channel Assignment Approach for Minimum Interference in Wireless Mesh Networks Using Learning Automata and Genetic Algorithms. Wireless Personal Communications, 2019, DOI:


Mrs Nandini Balusu, Assistant Professor in the department of Computer Science and Engineering at Telangana University (TU), Nizamabad, Telangana State, India. Received B.Tech in Information Technology from Jatipita College of Engineering affiliated to JNTUH in 2002. Received M.Tech in Computer Science and Engineering from Acharya Nagarjuna University in 2010. Currently pursuing Ph.D from JNTUH in the area of Wireless Mesh Networks. Organized and participated in various national and International level conferences/seminars/workshops. Published papers in various SCI, Scopus and UGC listed journals. Member of Board of Studies of various universities. Areas of Research interests include Networks, Design And Analysis of Algorithms, Data Structures, Data Mining and Machine Learning

Dr. Suresh Pabboju has been working as Professor & Head of Information Technology, Chaitanya Bharathi Institute of Technology, Hyderabad, Telangana State, INDIA. He has 32 years of teaching experience. Dr. Pabboju, born on August 15, 1965, graduated from CBIT, Osmania Univ ersity, and post graduated from JNT University, Hyderabad. He was awarded PhD degree in CSE for his research work in the area of image processing and computer vision by the Osmania University. In the last 10 years he has organized 14 national level technical symposiums / seminars/workshops and one National Conference. He has more than 50 research publications in various National and International Conferences to his credit. His research interest includes Digital Image Processing &Computer Vision, Artificial Intelligence, Artificial Neural Networks, Data Mining, Big Data, Cloud Computing, Information Security, Software Engineering, etc.. PhD Scholars from JNTUH and OU have been working under his supervision. He has been instrumental in over all development of IT department, CBIT, since its inception. Under his dynamic and charismatic leadership the department has been accredited TWICE by NBA-AICTE. As IQAC Coordinator, he was responsible in achieving NAAC-UGC Accreditation to CBIT, with Grade-‘A’.

Dr. G. Narsimha Professor & Head of Computer Science &Engineering at JNTUH College of Engineering, HYderabad, Telangana, India, Received Ph.D. (Computer Science & Engineering) from University College of Engineering, Osmania University Hyderabad, Telangana, India(2009) and M. Tech. (Computer Science and Engineering) from University College of Engineering, Osmania University Hyderabad, Telangana, India (1999), held several higher responsible academic/ administrative positions, Guided 9 Ph.Ds(awarded) and currently supervising 11 research scholars, Recipie nt of several awards & honors – Best Lecturer award by Bharath Arts Academy and ABC Foundation at Ravindra Bharathi, Hyderabad, TS, Telugu VignanaParithoshikam (SSC) (1990), Best Teacher reward at SR Engineering College (2003), VisistaSevaPuraskar award at JNTUH College Engineering Jagtial Karimnagar Dist. (2011), Siksha Ratana Puraskar award (2011) from Indian International Friendship Society, Best Citizen of India award (2011), Delivered 20 keynotes in national and International conferences, Delivered Key note and acted as session chair for International conference on Innovations in Computing and Communication (ICICC 2015), held at BVRIT, Narsapur, Medak, Telangana State, Session chair for CSI-2014 Annual Convention and International Conference on Emerging ICT for Bridging Future hosted by CSI Hyderabad Chapter in association with JNTU Hyderabad & DRDO (2014), held at JNTU Hyderabad, Session chair for “A two day national Conference on Recent Trends in Science and Technology” organized by JNTUH College of Engineering, Nachupally (Kondagattu), Karimnagar (2015), Life Member of Indian Society for Technical Education (MISTE), Areas of research interests include Computer Networks, Data warehousing and Data Mining, Algorithm, Network Security, Cloud Computing, Big Data and Mobile Computing.


Leave a Reply

Fill in your details below or click an icon to log in: Logo

You are commenting using your account. Log Out /  Change )

Twitter picture

You are commenting using your Twitter account. Log Out /  Change )

Facebook photo

You are commenting using your Facebook account. Log Out /  Change )

Connecting to %s


This entry was posted on June 15, 2020 by .
%d bloggers like this: