Performance Analysis of On-Demand Routing Protocols in Wireless Mesh Networks

Wireless Mesh Networks (WMNs) have recently gained a lot of popularity due to their rapid deployment and instant communication capabilities. WMNs are dynamically self-organizing, self-configuring and self-healing with the nodes in the network automatically establishing an adiej hoc network and preserving the mesh connectivity. Designing a routing protocol for WMNs requires several aspects to consider, such as wireless networks, fixed applications, mobile applications, scalability, better performance metrics, efficient routing within infrastructure, load balancing, throughput enhancement, interference, robustness etc. To support communication, various routing protocols are designed for various networks (e.g. ad hoc, sensor, wired etc.). However, all these protocols are not suitable for WMNs, because of the architectural differences among the networks. In this paper, a detailed simulation based performance study and analysis is performed on the reactive routing protocols to verify the suitability of these protocols over such kind of networks. Ad Hoc On-Demand Distance Vector (AODV), Dynamic Source Routing (DSR) and Dynamic MANET On-demand (DYMO) routing protocol are considered as the representative of reactive routing protocols. The performance differentials are investigated using varying traffic load and number of source. Based on the simulation results, how the performance of each protocol can be improved is also recommended.Wireless Mesh Networks (WMNs), IEEE 802.11s, AODV, DSR, DYMO

Performance analysis of on-demand routing protocols in wireless mesh networks

Wireless Mesh Networks (WMNs) have recently gained a lot of popularity due to their rapid deployment and instant communication capabilities. WMNs are dynamically self-organizing, self-configuring and self-healing with the nodes in the network automatically establishing an adiej hoc network and preserving the mesh connectivity. Designing a routing protocol for WMNs requires several aspects to consider, such as wireless networks, fixed applications, mobile applications, scalability, better performance metrics, efficient routing within infrastructure, load balancing, throughput enhancement, interference, robustness etc. To support communication, various routing protocols are designed for various networks (e.g. ad hoc, sensor, wired etc.). However, all these protocols are not suitable for WMNs, because of the architectural differences among the networks. In this paper, a detailed simulation based performance study and analysis is performed on the reactive routing protocols to verify the suitability of these protocols over such kind of networks. Ad Hoc On-Demand Distance Vector (AODV), Dynamic Source Routing (DSR) and Dynamic MANET On-demand (DYMO) routing protocol are considered as the representative of reactive routing protocols. The performance differentials are investigated using varying traffic load and number of source. Based on the simulation results, how the performance of each protocol can be improved is also recommended

Adaptive load balancing routing algorithms for the next generation wireless telecommunications networks

This thesis was submitted for the degree of Doctor of Philosophy and was awarded by Brunel UniversityWith the rapid development of wireless networks, mesh networks are evolving as a new important technology, presenting a high research and commercial interest. Additionally, wireless mesh networks have a wide variety of applications, offering the ability to provide network access in both rural and urban areas with low cost of maintenance. One of the main functionalities of a wireless mesh network is load balancing routing, which is the procedure of finding the best, according to some criteria, routes that data need to follow to transfer from one node to another. Routing is one of the state-of-the-art areas of research because the current algorithms and protocols are not efficient and effective due to the diversity of the characteristics of these networks. In this thesis, two new routing algorithms have been developed for No Intra-Cell Interference (NICI) and Limited Intra-Cell Interference (LICI) networks based on WiMAX, the most advanced wireless technology ready for deployment. The algorithms created are based on the classical Dijkstra and Ford-Fulkerson algorithms and can be implemented in the cases of unicast and multicast transmission respectively.State scholarships foundation of Greece

Performance Evaluation Cross Layer Routing Metric in Protocol Routing OLSR Wi-Fi Wireless Mesh Networks

Wireless Mesh network is a wireless communications and allows multiple nodes work together to deliver message to the destination. Mesh topology improve the reliability of the entire network. Investment is needed in wireless mesh networks less than the cellular network. Wireless Mesh Network is a technology solution to increase the coverage, reliability and ease of implementation that have the nature of multi-hop, self-reconfigurable, self-healing and self-organized. WMN performance depends on the routing protocol used. Routing metrics used by routing protocols decides which route to use between pair of nodes. Various routing metrics have been developed to increase throughput, load balancing and choose the path that is reliable in Wireless Mesh Network. Some cross-layer routing metrics have been developed to improve network performance. This study aims to improve the throughput received by the network, by evaluating the performance of the simulation results cross layer routing metrics Expected Forwarded Counter (EFW) using routing protocols OLSR at 802.11 Wi-Fi Wireless Mesh Network. EFW is routing based on cross-layer metrics to overcome the problems caused by the drop packet selfish behavior on a mesh router. Simulations carried out by using Network Simulator 2. An optimal routing metric has a potential to improve performance of a wireless mesh network. For better performance Improvement can be done by designing efficient routing metrics that can support adaptive mesh routers and mesh clients. The simulation results were evaluated with a modified routing metric EFW with protocol routing OLSR in Wi-FI Wireless Mesh Network. Routing metric EFW is an improvement of ETX by adding the estimated probability of dropping relaying node. The propose routing metric is a combination of EFW metric with routing metric ETT that consider packet size and bandwidth of the link to improve overall routing performance. From the simulation result , routing metric EFW modification has better performance fo throughput,PDR, Packet loss, and end to end delay than routing metrix etx or routing metric EFW, when the number of nodes used is smaller and using high data rate scenario

Cross-layer energy-efficient schemes for multimedia content delivery in heterogeneous wireless networks

The wireless communication technology has been developed focusing on fulfilling the demand in various parts of human life. In many real-life cases, this demand directs to most types of commonly-used rich-media applications which – with diverse traffic patterns - often require high quality levels on the devices of wireless network users. Deliveries of applications with different patterns are accomplished using heterogeneous wireless networks using multiple types of wireless network structure simultaneously. Meanwhile, content deliveries with assuring quality involve increased energy consumption on wireless network devices and highly challenge their limited power resources. As a result, many efforts have been invested aiming at high-quality and energy-efficient rich-media content deliveries in the past years. The research work presented in the thesis focuses on developing energy-aware content delivery schemes in heterogeneous wireless networks. This thesis has four major contributions outlined below: 1. An energy-aware mesh router duty cycle management scheme (AOC-MAC) for high-quality video deliveries over wireless mesh networks. AOC-MAC manages the sleep-periods of mesh devices based on link-state communication condition, reducing their energy consumption by extending their sleep-periods. 2. An energy efficient routing algorithm (E-Mesh) for high-quality video deliveries over wireless mesh networks. E-Mesh evolves an innovative energy-aware OLSR-based routing algorithm by taking energy consumption, router position and network load into consideration. 3. An energy-aware multi-flow-based traffic load balancing scheme (eMTCP) for multi-path content delivery over heterogeneous wireless networks. The scheme makes use of the MPTCP protocol at the upper transport layer of network, allowing data streams to be delivered across multiple consequent paths. Meanwhile, this benefit of MPTCP is also balanced with energy consumption awareness by partially off-loading traffic from the paths with higher energy cost to others. 4. A MPTCP-based traffic-characteristic-aware load balancing mechanism (eMTCP-BT) for heterogeneous wireless networks. In eMTCP-BT, mobile applications are categorized according to burstiness level. eMTCP-BT increases the energy efficiency of the application content deliveries by performing a MDP-based distribution of traffic delivery via the available wireless network interfaces and paths based on the traffic burstiness level

Towards Optimal Distributed Node Scheduling in a Multihop Wireless Network through Local Voting

In a multihop wireless network, it is crucial but challenging to schedule transmissions in an efficient and fair manner. In this paper, a novel distributed node scheduling algorithm, called Local Voting, is proposed. This algorithm tries to semi-equalize the load (defined as the ratio of the queue length over the number of allocated slots) through slot reallocation based on local information exchange. The algorithm stems from the finding that the shortest delivery time or delay is obtained when the load is semi-equalized throughout the network. In addition, we prove that, with Local Voting, the network system converges asymptotically towards the optimal scheduling. Moreover, through extensive simulations, the performance of Local Voting is further investigated in comparison with several representative scheduling algorithms from the literature. Simulation results show that the proposed algorithm achieves better performance than the other distributed algorithms in terms of average delay, maximum delay, and fairness. Despite being distributed, the performance of Local Voting is also found to be very close to a centralized algorithm that is deemed to have the optimal performance

Reliable data delivery in low energy ad hoc sensor networks

Reliable delivery of data is a classical design goal for reliability-oriented collection routing protocols for ad hoc wireless sensor networks (WSNs). Guaranteed packet delivery performance can be ensured by careful selection of error free links, quick recovery from packet losses, and avoidance of overloaded relay sensor nodes. Due to limited resources of individual senor nodes, there is usually a trade-off between energy spending for packets transmissions and the appropriate level of reliability. Since link failures and packet losses are unavoidable, sensor networks may tolerate a certain level of reliability without significantly affecting packets delivery performance and data aggregation accuracy in favor of efficient energy consumption. However a certain degree of reliability is needed, especially when hop count increases between source sensor nodes and the base station as a single lost packet may result in loss of a large amount of aggregated data along longer hops. An effective solution is to jointly make a trade-off between energy, reliability, cost, and agility while improving packet delivery, maintaining low packet error ratio, minimizing unnecessary packets transmissions, and adaptively reducing control traffic in favor of high success reception ratios of representative data packets. Based on this approach, the proposed routing protocol can achieve moderate energy consumption and high packet delivery ratio even with high link failure rates. The proposed routing protocol was experimentally investigated on a testbed of Crossbow's TelosB motes and proven to be more robust and energy efficient than the current implementation of TinyOS2.x MultihopLQI

AMCTD: Adaptive Mobility of Courier nodes in Threshold-optimized DBR Protocol for Underwater Wireless Sensor Networks

In dense underwater sensor networks (UWSN), the major confronts are high error probability, incessant variation in topology of sensor nodes, and much energy consumption for data transmission. However, there are some remarkable applications of UWSN such as management of seabed and oil reservoirs, exploration of deep sea situation and prevention of aqueous disasters. In order to accomplish these applications, ignorance of the limitations of acoustic communications such as high delay and low bandwidth is not feasible. In this paper, we propose Adaptive mobility of Courier nodes in Threshold-optimized Depth-based routing (AMCTD), exploring the proficient amendments in depth threshold and implementing the optimal weight function to achieve longer network lifetime. We segregate our scheme in 3 major phases of weight updating, depth threshold variation and adaptive mobility of courier nodes. During data forwarding, we provide the framework for alterations in threshold to cope with the sparse condition of network. We ultimately perform detailed simulations to scrutinize the performance of our proposed scheme and its comparison with other two notable routing protocols in term of network lifetime and other essential parameters. The simulations results verify that our scheme performs better than the other techniques and near to optimal in the field of UWSN.Comment: 8th International Conference on Broadband and Wireless Computing, Communication and Applications (BWCCA'13), Compiegne, Franc