Implementation of routing protocols for Testbeds

Networks are being used in various areas and the demand of users nowadays has motivated the emergence of the Mobile Ad Hoc Network (MANET). MANET is a dynamic network without fixed infrastructure due to their wireless nature and can be deployed as multi-hop packet networks. It is a wireless network and has dynamic topology due to its node mobility. There are two types of MANET, homogeneous and heterogeneous MANET. An architecture has been designed in previous work to model these two types of MANET. Three scenarios have been defined from this architecture: scenario I (communication entirely within MANET, homogeneous MANET), scenario II (communication between MANET and wireless LAN, heterogeneous MANET) and scenario III (communication between MANET with wireless LAN and wired LAN, heterogeneous MANET). MANET has its own routing protocols which can compromised with frequent route exchange, dynamic topology, bandwidth constraint and multi-hop routing. Ad hoc On Demand Distance Vector (AODV) is one of the routing protocols in MANET. The aim of this research is to assess the effects of different packet size with the implementation of AODV routing protocols in homogeneous and heterogeneous MANET through the simulation method. The three scenarios above have been developed in the OMNeT++ network simulator. The results achieved from the test have been evaluated using the metrics assigned, throughput and packet delivery ratio (PDR). The tests show that the increase of throughput and PDR performance was parallel with the increase of packet size. From the test also, we can conclude that the performance due to the packet size effect in homogeneous MANET is better than in heterogeneous MANET.

Wireless mesh networks (WMNs) are gaining significant momentum as a promising technology for the next-coming state-of-the-art wireless networking. Among many factors, the performance of WMNs would be largely affected by the properness of the deployed routing protocols and the efficient usage of wireless resources. Routing protocols are required to well capture WMNs' features while wireless channels should be used efficiently in order to accommodate high amount of traffics over the mesh backbone. Recently, a Tree-based Routing (TBR) protocol become a popular state-of-the-art proactive routing protocol and its tree-based broadcasting become an often used technique. Though TBR protocol is well-suited for WMNs' architecture and the skewed nature of traffic toward the root, the protocol in its current form faces issues which has to be addressed. Specifically, when some or all nodes are equipped with multiple radios, to reduce collision and co-channel interference, not only the parent-child relationship but also the sibling relationship need to be constructed by the TBR protocol in the multi-channel WMNs. In this paper, we propose a hybrid tree-based protocol for concurrent routing and channel assignment over WMNs. The protocol makes use of sibling links to mitigate the aforementioned shortcomings of TBR protocol. Moreover, in order to address high backbone traffic, the protocol integrates a receiver-based channel assignment scheme. The protocol efficiently deploys the parent-child topological relationships of nodes to enhance efficiency of broadcast transmissions over receiver-based multi-channel WMNs. Simulation results over NS-2 network simulator reveal that our proposed hybrid tree-based protocol achieves much higher performance than the utilization of the original receiver-based CA and TBR protocol.

An ad hoc network is a collection of autonomous mobile nodes to forming an instant multihop radio infrastructure-less network in a dynamic topology. Each node in Ad hoc network, functions as host and router at the same time,where maintaining connectivity in a decentralized manner by distributing the network control among the nodes. A large number of routing protocols for mobile ad-hoc networks are presented since last decade. Topology frequently changing,transmission power and asymmetric links are the main challenge that type of protocols is facing. Therefore, both proactive and reactive routing protocols for mobile ad-hoc networks show incapability, and sometimes prove to be inefficient under these circumstances. We have previously developed and presented a new multipath hybrid routing protocol in name of Multipath Distance Vector Zone Routing Protocol and we refer to it as MDVZRP. The protocol is implemented in the well known network simulator (ns2). In MDVZRP we assume that all the routes in the routing table are active and usable at any time, unless the node received or discovered a broken link. Therefore, no need to update the routing tables periodically to reduce the periodic update messages and hence we reduce the control traffic in the entire network. The protocol guarantees loop freedom, disjoint paths,and alternative paths in case of break the active path by none frequently maintaining topological map of a zone centered on each node. In this paper, the MDVZRPpsilas performance is evaluated and compared with DSDV and AODV standard protocols delivering CBR traffic. Simulation results show that it gives better performance than DSDV in all situations, and better than AODV, when mobility is low.

As (network) software is such an omnipresent component of contemporary mission-critical systems, formal analysis is required to provide the necessary certification or at least formal assurances for these systems. In this paper we focus on modelling and analysing the Optimised Link State Routing (OLSR) protocol, a distributed, proactive routing protocol. It is recognised as one of the standard ad-hoc routing protocols for Wireless Mesh Networks (WMNs). WMNs are instrumental in critical systems, such as emergency response networks and smart electrical grids. We use the model checker Uppaal for analysing safety properties of OLSR as well as to point out a case of OLSR malfunctioning.

By the enormous increase in mobile nodes and diverse service requests on wireless networks, wireless mesh network(WMN) takes an interest as the solution for such requests. However, lots of issues which should be solved to deploy WMN are still remained. In the network layer, the performance improvement of routing protocols is the major issue of nowadays researches. WMN can be easily deployed by use of protocols for mobile ad-hoc networks(MANET) because it is much similar with MANET in multi-hop wireless routing and which node plays as host and router concurrently. Unfortunately, most routing protocols for MANET have drawbacks such as large traffic overhead and long delay time for route discovery due to the network extension. They are major factors of performance degradation of WMN and most researches are focused on them. In this paper, domain-based AODV which is amended AODV to be applied in hybrid WMN is proposed. The proposed scheme divides a hybrid WMN as several domains and performs route discovery by header layer domain. Therefore it can reduce the distance for route discovery as much as average hop count between domain header and member nodes. From the simulation, domain-based AODV was showed slowly increasing delay time due to the network extension.

Nowadays there are inexpensive WiFi devices that have fostered the deployment of wireless communities. Well known routing protocols used in the Internet do not fit well to time varying characteristic of wireless networks. This has motivated an intensive research on routing protocols for wireless mesh networks. At this time there are a number of mature and stable implementations that are being deployed in production networks. In this paper we focus on the experimental evaluation of a production Wireless Mesh network being deployed in a testbed at Universitat Politecnica de Catalunya (UPC) and a quarter of the city of Barcelona, Spain. To our best knowledge, this is the first paper where a production community wireless network using 802.11an is analyzed.

Wireless mesh networks is a decentralized networking technology that is currently being adapted to connect peer-to-peer clients and large-scale backbone networks. Nodes are designed to act as repeaters allowing communication or very large distances. Robustness is another characteristic of wireless mesh networks, partly due to its decentralized nature which removes a central point of failure. Due to its complex nature, a number of issues are still under research. Broadband communication such as WLAN and UWB are ideal for transmission of mesh data due to their high speed. Researches in the PHY layer have come up with using multi-channel and multi-transceiver technology is being studied to improve the capacity of mesh networks. Routing protocols are also a vital research in mesh networks. Distributed routing is needed which can find the optimized path in a widely decentralized mesh network. Also, with the implementation of new PHY technology, existing routing protocols need to be revised to exploit the advantages of new the new PHY. This paper aims to improve existing protocols for wireless mesh networks and wireless adhoc networks in order to take advantage of the properties of multi-channel technology.

A QoS aware routing protocol for Wireless Mesh Networks is studied in this paper, the QoS metrics taken into account are bandwidth in our studies, end to end delay and stability of the routes. The routing metric reflects the maximal available bandwidth of a routing path, which is calculated based on the available bandwidth of mesh nodes with the consideration of the interference caused by the hidden terminals in WMNs. With the help of admission control decision, QRBC uses the routing metric in the route discovery process to find a QoS guarantee route for the real-time applications. The simulation results demonstrate that the QRBC protocol can find a less interfering and bandwidth guaranteed routing path for real-time flows.

Routing protocol is the primary strategy to design any wireless network. In Mobile AdHoc Network many routing protocols are present for sending packets from source to destination. Routing protocols in Mobile AdHoc Networks (MANETs) are reactive routing protocols, proactive routing protocols, hybrid routing protocols. Performance analysis of different routing protocols is the major step before selecting the routing protocol. Routing protocols perform different under different traffic conditions in different environments. In this paper, the TCP and UDP based performance analysis is carried out in reactive routing protocols and proactive routing protocols with different packet size using NS2 simulator under different traffic conditions. The delay, throughput and packet delivery ratio are common measures parameters used for the comparison of performance of reactive protocols and proactive protocols.

Designing mobility and power aware routing protocols have made the main focus of the early contributions to the field of Mobile Ad-hoc NETworks (MANETs). However, almost all conventional routing protocols for MANETs suffer from their lack of adaptivity leading to their performance degradation under varying network conditions. In fact, this is due to both simplistic conception hypotheses they made about the network and to the use of some prefixed parameters in protocols implementations. Currently, artificial intelligence methods like Reinforcement Learning (RL) are widely used to design adaptive routing strategies for MANETs. In this paper, we present a comprehensive survey of RL-based routing protocols for MANETs. Besides, we propose some future research directions in this area.

Owing to the absence of any static support structure, ad-hoc networks are prone to link failures. The 'shortest path seeking' routing protocols may not lead to stable routes. The consequent route failures that ensue, lead to the degradation of system throughput. This paper suggests a routing protocol wherein the route selection is done on the basis of an intelligent residual lifetime assessment of the candidate routes. Schemes for performance enhancement with TCP and non-TCP traffic in ad-hoc networks are proposed. The protocol is backed by simulations in ns that show excellent adaptation to increasing network mobility. We have also introduced new route cache management and power aware data transmission schemes.

Wireless Sensor Networks (WSN) utilizes more nodes to forward messages and information from source node to destination node and these nodes are battery-powered devices. Thus, Energy saving is always vital role of Routing Protocols which need to maximize the lifetime of WSN. Mobile ad hoc networks (MANET) are self-starting and self-constructing multichip wireless networks in which, the assembly of the system deviates vigorously. This is mainly due to the mobility of the nodes. The nodes in the network not only act as hosts but also as routers that route data from other nodes in network. MANETs require an efficient routing protocol that achieves the quality of service (QoS) mechanism. They are not considering the mobility as one constraint for those problems. Because, mobility of nodes causes frequent link failures and high error rates, so it makes difficult to maintain the desired QoS in the network. To overcome those problems, we propose mobility aware routing protocol for MANET using hybrid optimization (MARP-HO) algorithm, which maximizes the QoS in data transmission. The proposed routing protocol comprises of two phases. The clustering process consists of cluster formation and cluster head (CH) selection. First, the energy efficient clustering is done by improved animal migration optimization (IAMO) algorithm. Then, we gather multiple constraints are energy consumption, received signal strength, mobility and cooperative rate from each cluster member. The gathered constraints used to compute the node cost of each cluster member, here the highest cost node act as CH of cluster. Second, we compute routing path between source–destination using improved ant colony optimization (IACO) algorithm. The proposed MARP-HO routing protocol is compared with existing state-of-art routing protocols in terms of energy consumption, delivery ratio, loss ratio, link stability, delay, network lifetime, number of dead nodes and throughput.

Nowadays wireless systems changing our life experience, allowing ubiquitous communications, attracting new users, and supporting new applications, such as video streaming, VoIP, Mobile TV and other kind of multimedia applications. The combination of wireless networks and multimedia content distribution requires a new behavior of routing protocols for Wireless Mesh Networks (WMNs). Hence, new protocols must be developed to increase the user perception and optimize the usage of network resources. This paper presents a variation of the WMN routing protocol Optimized Link State Routing (OLSR), to achieve QoS and QoE requirements for multimedia applications. It is based on the dynamic choice of metrics and in a Fuzzy Link Cost (FLC) to determine the best routes for multimedia packets. Simulations were carried out to show the benefits of the proposed metric regarding user experience compared to existing versions of OLSR.KeywordsWireless Mesh NetworksQoSQoEFuzzy Logic

The Optimised Link State Routing (OLSR) protocol is a proactive, ad-hoc distributed routing protocol for Wireless Mesh Networks (WMNs). In this paper we demonstrate that by introducing a new type of message for this protocol (namely an ERROR message), the recovery time for routing in the presence of random link failures decreases. We illustrate our findings via formal model checking experiments in Uppaal. Decreased recovery time is essential for, e.g., emergency response networks and other critical WMNs.

Ad-hoc networking allows users to form temporary wireless networks without existing infrastructure. Each node acts both as host and router and must therefore be willing to forward packets for other nodes. This is done using a mobile ad-hoc network (MANET) routing protocol. Frequent topology changes make such routing challenging. Existing protocols include dynamic source routing (DSR), the cluster-based routing protocol (CBRP), and the ad hoc on-demand distance vector (AODV) protocol, among others. Using existing protocols, however, some nodes may be unduly loaded and end-to-end delay may be high. Further, existing protocols are hard to upgrade once they are in use. To address these problems, a new routing protocol, MARP, using mobile agents is presented. Mobile agents are software entities that can move between network nodes and execute programs they carry with them wherever they are running. Our agent-based algorithm implements a demand-based protocol that provides efficient routing at the application layer. A proof of concept implementation has been developed using Aglets and simulated to evaluate its performance. The details of the protocol and its performance are reported in this paper.