ArticlePDF Available

Development of a Routing Framework for a Cluster-Based Congestion Avoidance and Load Balancing Algorithm for IEEE802.11s Mesh Network

Authors:
Adekiigbe Adebanjo at Federal Polytechnic Ede, Osun State, Nigeria
Adekiigbe Adebanjo
  • Federal Polytechnic Ede, Osun State, Nigeria
Kamalrulnizam Abu Bakar at Universiti Teknologi Malaysia
Kamalrulnizam Abu Bakar
Download full-text PDF
Read full-text
Download citation

Abstract

This study is focused on the design and development of efficient congestion avoidance and routing algorithm framework in Wireless Mesh Networks (WMNs). The framework will employ the use of clustering algorithm to booster the routing protocol with particular attention being paid to the aggregated data packets at the intermediate nodes toward the gateway in wireless mesh network. The design uses the enhanced weighted clustering algorithm as base algorithm because of the advantages identified in this protocol from previous research. Efforts are made to integrate congestion avoidance, load balancing routing and the clustering algorithm with the greater hope of achieving low routing overheads, end to end delay while throughout and data delivery ratio expected to witness high increase.
Content uploaded by Adekiigbe Adebanjo
Author content
All content in this area was uploaded by Adekiigbe Adebanjo on Mar 20, 2017
Content may be subject to copyright.
Traff
ic
Traff
ic
Poor link
quality
Packets
to relay
Packets
t
o
send
Implementing Congestion Avoidance Mechanism in Cluster Based Routing Protocol for Wireless Mesh Client Networks
Article
  • Mar 2014
The wireless mesh network is a promising technology to help shape the world of pervasive communication for more comfortable, efficient and cheap wireless network platform. One of the challenges before this technology is congestion that causes packet loss. However, the challenge can be efficiently reduced if congestion avoidance mechanism is improvised into the routing protocols. In this paper, we proposed an improved congestion avoidance cluster based routing protocol (i-CBRPCA) for wireless clients in the mesh networks. In the mechanism, the traffic rate of source clusterhead is compared with the traffic rate of the receiving intermediate clusterhead and Arbitration Interframe Space Number of the sending clusterhead is increased or decreased depending on whether the traffic rate is decreased or increased. This congestion metric helps control the rate in order to have maximum allowable traffic traversing the intermediate clusterheads. Based on the simulation results, the proposed approach delivers high packets, reduced delay, delivers high throughput and lower packet loss when compared with CBRP.
View
DHT-based cluster routing protocol for IEEE802.11s mesh networks
Conference Paper
Full-text available
  • Jul 2009
The IEEE 802.11s draft standard defines a mesh network in which frame delivery is done by forwarding the frame through nodes, called Mesh Points (MPs). To make this possible, it specifies two routing protocols: HWMP and RA-OLSR. Both protocols suffer from scalability issues caused by the use of broadcast messages for discovery and update of routes. In this work, we propose a new routing protocol, the DHT-based Cluster Routing Protocol (DCRP), that improves the scalability of 802.11s networks. Our approach is based on two mechanisms: clustering of nodes and DHT-based searching. Clustering allows to reduce the number of broadcast messages required for routing as well as the amount of routing information broadcasted. DHT-based searching is used to make up for the required routing information that is not diffused by the DCRP itself. Some back-of-the-envelope calculations indicate that our approach increases the scalability of the routing protocol.
View
Architecture and algorithms for an IEEE 802.11-based multi-channel wireless mesh network
Conference Paper
Full-text available
  • Apr 2005
Even though multiple non-overlapped channels exist in the 2.4 GHz and 5 GHz spectrum, most IEEE 802.11-based multi-hop ad hoc networks today use only a single channel. As a result, these networks rarely can fully exploit the aggregate bandwidth available in the radio spectrum provisioned by the standards. This prevents them from being used as an ISP's wireless last-mile access network or as a wireless enterprise backbone network. In this paper, we propose a multi-channel wireless mesh network (WMN) architecture (called Hyacinth) that equips each mesh network node with multiple 802.11 network interface cards (NICs). The central design issues of this multi-channel WMN architecture are channel assignment and routing. We show that intelligent channel assignment is critical to Hyacinth's performance, present distributed algorithms that utilize only local traffic load information to dynamically assign channels and to route packets, and compare their performance against a centralized algorithm that performs the same functions. Through an extensive simulation study, we show that even with just 2 NICs on each node, it is possible to improve the network throughput by a factor of 6 to 7 when compared with the conventional single-channel ad hoc network architecture. We also describe and evaluate a 9-node Hyacinth prototype that Is built using commodity PCs each equipped with two 802.11a NICs.
View
IEEE 802.11 e contention-based channel access (EDCF) performance evaluation
Conference Paper
Full-text available
  • Jun 2003
IEEE 802.11 e medium access control (MAC) is an emerging supplement to the IEEE 802.11 wireless local area network (WLAN) standard to support quality-of-service (QoS). The 802.11e MAC is based on both centrally-controlled and contention-based channel accesses. In this paper, we evaluate the contention-based channel access mechanism, called enhanced distributed coordination function (EDCF), in comparison with the 802.11 legacy MAC. The ECDF provides differentiated channel access to frames with different priorities. We also consider an optional feature of the EDCF, called contention-free burst (CFB), which allows multiple MAC frame transmissions during a single transmission opportunity (TXOP). Through our simulation study, we conclude that the EDCF can provide differentiated channel access for different traffic types. Furthermore, the CFB is found to enhance the EDCF performance by increasing the overall system throughput and achieving more acceptable streaming quality in terms of frame losses and delays.
View
The Nominal Capacity of Wireless Mesh Networks
Article
Full-text available
  • Nov 2003
Wireless mesh networks are an alternative technology for last-mile broadband Internet access. In WMNs, similar to ad hoc networks, each user node operates not only as a host but also as a router; user packets are forwarded to and from an Internet-connected gateway in multihop fashion. The meshed topology provides good reliability, market coverage, and scalability, as well as low upfront investments. Despite the recent startup surge in WMNs, much research remains to be done before WMNs realize their full potential. This article tackles the problem of determining the exact capacity of a WMN. The key concept we introduce to enable this calculation is the bottleneck collision domain, defined as the geographical area of the network that bounds from above the amount of data that can be transmitted in the network. We show that for WMNs the throughput of each node decreases as O(1/n), where n is the total number of nodes in the network. In contrast with most existing work on ad hoc network capacity, we do not limit our study to the asymptotic case. In particular, for a given topology and the set of active nodes, we provide exact upper bounds on the throughput of any node. The calculation can be used to provision the network, to ensure quality of service and fairness. The theoretical results are validated by detailed simulations.
View
Truly seamless wireless and mobile host networking. Protocols for adaptive wireless and mobile networking
Article
Full-text available
  • Mar 1996
Describes work in routing packets to mobile hosts in a large internetwork, such as the Internet, and gives an overview of implementation work in this area. The authors discuss the problem of routing in an ad hoc network of wireless mobile hosts, as might be needed in an area without established wireless networking infrastructure; they describe a new protocol developed for routing in such a network and summarize the results from a simulation of the protocol. They then describe work in providing support for adaptive operation of higher-layer protocols and applications; they have developed an inexpensive protocol and application programming interface (API) for notifying higher layers when the quality of a mobile host's network connection changes as it moves between different locations, possibly including changes in the type of network in use at each location. Finally, they compare their work to related mobile networking research elsewhere and present conclusions
View
Network Congestion Control: Managing Internet Traffic
Article
  • May 2006
As the Internet becomes increasingly heterogeneous, the issue of congestion control becomes ever more important. In order to maintain good network performance, mechanisms must be provided to prevent the network from being congested for any significant period of time. Michael Welzl describes the background and concepts of Internet congestion control, in an accessible and easily comprehensible format. Throughout the book, not just the how, but the why of complex technologies including the Transmission Control Protocol (TCP) and Active Queue Management are explained. The text also gives an overview of the state-of-the-art in congestion control research and an insight into the future. Network Congestion Control: Presents comprehensive, easy-to-read documentation on the advanced topic of congestion control without heavy maths. Aims to give a thorough understanding of the evolution of Internet congestion control: how TCP works, why it works the way it does, and why some congestion control concepts failed for the Internet. Explains the Chiu/Jain vector diagrams and introduces a new method of using these diagrams for analysis, teaching & design. Elaborates on how the theory of congestion control impacts on the practicalities of service delivery. Includes an appendix with examples/problems to assist learning. Provides an accompanying website with Java tools for teaching congestion control, as well as examples, links to code and projects/bibliography. This invaluable text will provide academics and researchers in computer science, electrical engineering and communications networking, as well as students on advanced networking and Internet courses, with a thorough understanding of the current state and future evolution of Internet congestion control. Network administrators and Internet service and applications providers will also find Network Congestion Control a comprehensive, accessible self-teach tool.
View
Review of Routing Protocols and It's Metrics for Wireless Mesh Networks
Conference Paper
  • May 2009
WMNs are low-cost Internet access networks built on cooperative routing over a backbone composed of stationary wireless routers. In hybrid mesh WMNs both client mesh and backbone has ability to forward the data to destination. Many ad hoc routing protocols have been adapted to work in WMN without considering the differences between both technologies. Due to the differences between ad hoc network and WMN network, many Researchers started to revisit the routing protocol design of existing wireless mesh networks (WMNs), especially of IEEE 802.11 networks, and ad hoc networks from the perspectives of WMNs which provide Internet for large distances area and consist of two tiers where the heterogeneity exists between them, the heterogeneity between backbone nodes and client nodes are many, for example, the backbone nodes are immobile with a fixed location and high capacity while the client nodes are mobile devices with low capacity and must take care of power consumption and mobility. However, these perspectives should be taken care of in designing the routing protocol to enhance the routing algorithm in order to work well in WMN. There are two ways to enhance the performance of routing protocol in WMN. One way is to improve the metric used in the selection path, the second way is to modify the routing algorithms by considering new characteristics of WMN or integrating the routing protocols with other technologies. In this paper, we present a detailed review of current state-of-the-art routing protocol and its metric for wireless mesh networks in order to provide a better understanding of the research challenges in WMN routing protocol.
View
A review of cluster formation mechanism for clustering routing protocols
Conference Paper
  • Dec 2008
Clustering routing protocols have prominent advantages over flat routing protocols in terms of scalability, which is very useful for wireless mesh network with dense nodes distribution. However, clustering schemes will add large extra overhead in order to select cluster-heads and collect neighbor nodes information during the phase of cluster construction. At present, there exist a lot of excellent clustering schemes, and in this paper, we propose different classification criteria according to clustering charateristics. Then, we present a comprehensive review of several representatives, and especially focus on cluster formation mechanism. At last, we sum up with three typical problems we have to seriously consider when analyzing or design a clustering routing protocol.
View
View
Clustering and Cluster-Based Routing Protocol for Delay-Tolerant Mobile Networks
Article
  • Jun 2010
This research investigates distributed clustering scheme and proposes a cluster-based routing protocol for Delay-Tolerant Mobile Networks (DTMNs). The basic idea is to distributively group mobile nodes with similar mobility pattern into a cluster, which can then interchangeably share their resources (such as buffer space) for overhead reduction and load balancing, aiming to achieve efficient and scalable routing in DTMN. Due to the lack of continuous communications among mobile nodes and possible errors in the estimation of nodal contact probability, convergence and stability become major challenges in distributed clustering in DTMN. To this end, an exponentially weighted moving average (EWMA) scheme is employed for on-line updating nodal contact probability, with its mean proven to converge to the true contact probability. Based on nodal contact probabilities, a set of functions including Sync(), Leave(), and Join() are devised for cluster formation and gateway selection. Finally, the gateway nodes exchange network information and perform routing. Extensive simulations are carried out to evaluate the effectiveness and efficiency of the proposed cluster-based routing protocol. The simulation results show that it achieves higher delivery ratio and significantly lower overhead and end-to-end delay compared with its non-clustering counterpart.
View