Zero-Degree algorithm for Internet GateWay placement in backbone wireless mesh networks

27Citations
Citations of this article
25Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Internet GateWays (IGWs) are responsible for connecting the backbone wireless mesh networks (BWMNs) to the Internet/wired backbone. An IGW has more capabilities than a simple wireless mesh router (WMR) but is more expensive. Strategically placing the IGWs in a BWMN is critical to the Wireless Mesh Network (WMN) architecture. In order to solve the problem of IGWs placement in BWMNs, a novel algorithm is proposed in this paper. The new algorithm is involved in placing a minimum number of IGWs so that the Quality of Service (QoS) requirements are satisfied. Different from existing algorithms, this new algorithm incrementally identifies IGWs and prioritively assigns wireless mesh routers (WMRs) based on the computed degree of WMRs to identified IGWs. Performance evaluation results show that proposed algorithm outperforms other alternative algorithms by comparing the number of gateways placed in different scenarios. Furthermore, having control of the distribution of IGWs in order to locate them closest to available Internet/wired network connection points is an added advantage of this algorithm. © 2013 Elsevier Ltd. All rights reserved.

Cite

CITATION STYLE

APA

Seyedzadegan, M., Othman, M., Ali, B. M., & Subramaniam, S. (2013). Zero-Degree algorithm for Internet GateWay placement in backbone wireless mesh networks. Journal of Network and Computer Applications, 36(6), 1705–1723. https://doi.org/10.1016/j.jnca.2013.02.031

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free