Welcome to the InfoSci Platform
Placement of Relay Stations in WiMAX Network Using Glowworm Swarm Optimization

Placement of Relay Stations in WiMAX Network Using Glowworm Swarm Optimization

Sangeetha J, Keerthiraj Nagaraj, Ram Prakash Rustagi, Balasubramanya Murthy K N
Copyright: © 2019 |Volume: 10 |Issue: 3 |Pages: 29
ISSN: 1947-8283|EISSN: 1947-8291|EISBN13: 9781522566083|DOI: 10.4018/IJAMC.2019070103
Cite Article Cite Article

MLA

Sangeetha J, et al. "Placement of Relay Stations in WiMAX Network Using Glowworm Swarm Optimization." IJAMC vol.10, no.3 2019: pp.39-67. http://doi.org/10.4018/IJAMC.2019070103

APA

Sangeetha J, Nagaraj, K., Rustagi, R. P., & Balasubramanya Murthy K N. (2019). Placement of Relay Stations in WiMAX Network Using Glowworm Swarm Optimization. International Journal of Applied Metaheuristic Computing (IJAMC), 10(3), 39-67. http://doi.org/10.4018/IJAMC.2019070103

Chicago

Sangeetha J, et al. "Placement of Relay Stations in WiMAX Network Using Glowworm Swarm Optimization," International Journal of Applied Metaheuristic Computing (IJAMC) 10, no.3: 39-67. http://doi.org/10.4018/IJAMC.2019070103

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

The Relay Station (RS) deployment problem for WiMAX networks is studied. Unlike Base Station (BS), RS does not need a wire-line backhaul and has much lower hardware complexity. Hence, usage of RSs can significantly minimize the deployment cost and maximize the network coverage of the system. To solve the RS deployment problem, the authors have used a nature inspired technique known as Glowworm Swarm Optimization (GSO). Different cases have been considered for a single fixed BS, to find the feasible number of RSs and its optimal placement in WiMAX networks. Computational experiments are conducted to show the effect of RS deployments in different distribution scenarios. This article also shows the impact of placing RSs at optimal locations to serve given Mobile Stations (MSs) that are distributed arbitrarily in a given geographic region such that the cost is minimized, and the network coverage is maximized. The results obtained from the GSO algorithm are compared with k-means algorithm and it is observed that GSO performs better than k-means algorithm.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.