Efficient algorithms to solve Broadcast Scheduling problem in WiMAX mesh networks

Authors:
R. Gunasekaran;S. Siddharth;P. Krishnaraj;M. Kalaiarasan;V. Rhymend Uthariaraj
Affiliations:
Department of Information Technology, Anna University, Chennai, India;Department of Information Technology, Anna University, Chennai, India;Department of Information Technology, Anna University, Chennai, India;Department of Information Technology, Anna University, Chennai, India;Department of Information Technology, Anna University, Chennai, India
Venue:
Computer Communications
Year:
2010

Citing 4
Cited 3

Co-evolving parasites improve simulated evolution as an optimization procedure

CNLS '89 Proceedings of the ninth annual international conference of the Center for Nonlinear Studies on Self-organizing, Collective, and Cooperative Phenomena in Natural and Artificial Computing Networks on Emergent computation
An efficient algorithm to find broadcast schedule in ad hoc TDMA networks

Journal of Computer Systems, Networks, and Communications
A mixed neural-genetic algorithm for the broadcast scheduling problem

IEEE Transactions on Wireless Communications
Optimal broadcast scheduling in packet radio networks using mean field annealing

IEEE Journal on Selected Areas in Communications

Novel hysteretic noisy chaotic neural network for broadcast scheduling problems in packet radio networks

IEEE Transactions on Neural Networks
Efficient group multicast node scheduling schemes in multi-hop wireless networks

Computer Communications
An evolutionary algorithm for broadcast scheduling in wireless multihop networks

Wireless Networks

Quantified Score

Hi-index	0.24

Visualization

Abstract

WiMAX is a last mile technology which provides efficient broadband access and coverage like MAN networks. The WiMAX standard IEEE 802.16d also called as WiMAX Mesh network can operate in multihop mode, in which the subscriber stations can communicate with the base station without having direct link between them. In such type of networks, the allocation of channel for the Subscriber Stations is an open issue. Also, if spatial reuse is enabled in such networks then many links can be activated simultaneously, thus increasing the effective usage of the available resources and providing better service to the available nodes. This paper deals with providing an efficient algorithm for spatial reuse. First, a dynamic programming (DP) algorithm to find the conflict-free set of nodes that can be activated to achieve optimality in throughput is proposed. Next, a genetic algorithm is provided, which is more scalable than the DP approach, but does not guarantee optimality. The results indicate that the algorithms proposed give better performance than the existing algorithms that address the same issue.