Research Article | OPEN ACCESS
Fairness Based Dynamic Routing Technique (FsBDRT) in Wireless Mesh Network
Malik Mehroze, Khalid Usmani, Faraz Ahsan and Sohail Asghar
University Institute of Information Technology, PMAS-ARID Agriculture University, Rawalpindi, Pakistan
Research Journal of Information Technology 2013 4:97-103
Received: January 02, 2013 | Accepted: October 02, 2013 | Published: December 01, 2013
Abstract
This study aims to present a joint solution of routing and fair resource allocation which in terms of OSI layered architecture belongs to two different layers but both cannot be considered as individual problems. The routing problem in WMNs is concerned with finding “good and optimum path” from source to destination. The objective of this research is to provide a new dynamic technique for efficient and reliable self-path utilization and provision of better and efficient way of handling issues of load balancing and congestion control in WMN. For fairness of resource allocation, this study presents the method of load balancing, where multiple paths to destination are used to distribute the traffic. These multiple paths are ultimately figured out using dynamic routing, which not only improves performance but also provides reliability, especially in presence of lossy channels. In this study we propose a Fairness Based Dynamic Routing Technique (FsBDRT) a dynamic routing mechanism to adapt an optimal path, as well as identification of lossy channel becomes due to congestion.
Keywords:
Congestion control, dynamic routing, fairness, quality of service,
Competing interests
The authors have no competing interests.
Open Access Policy
This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.
Copyright
The authors have no competing interests.
|
|
|
ISSN (Online): 2041-3114
ISSN (Print): 2041-3106 |
|
Information |
|
|
|
Sales & Services |
|
|
|