Quality of Service provisioning is one of the major design goals of IEEE 802.16 mesh networks. In order to provide quality delivery of delay sensitive services such as voice, video etc., it is required to route such traffic over a minimum delay path. In this paper we propose a routing metric for delay sensitive services in IEEE 802.16 mesh networks. We design a new cross layer routing metric, namely Expected Scheduler Delay (ESD), based on HoldOff exponent and the current load at each node of the network. This proposed metric takes into account the expected theoretical end-to-end delay of routing paths as well as network congestion to find the best suited path. We propose an efficient distributed scheme to calculate ESD and route the packets using source routing mechanism based on ESD. The simulation results demonstrate that our metric achieves reduced delay compared to a standard scheme used in IEEE 802.16 mesh, that takes hop count to find the path.
The end-to-end throughput of multi-hop communication in wireless ad hoc networks is affected by the conflict between forwarding nodes. It has been shown that sending more packets than maximum achievable end-to-end throughput not only fails to increase throughput, but also decreases throughput owing to high contention and collision. Accordingly, it is of crucial importance for a source node to know the maximum end-to-end throughput. The end-to-end throughput depends on multiple factors, such as physical layer limitations, MAC protocol properties, routing policy and nodes distribution. There hav…
Critical and public safety operations require real-time data transfer from the incident area(s) to the distant operations command center going through the evacuation and medical support areas. Any delay in communication may cause significant loss. In some cases, it is anticipated that the existing communication infrastructures can be damaged or out-of-service. It is thus required to deploy tactical ad-hoc networks to cover the operation zones. Routing data over the deployed network is a significant challenge with consideration to the operations conditions. In this paper we evaluate the perform…
ZigBee mesh network is very important research field in computer networks. However, the location of ZigBee coordinator plays a significant role in design and routing performance. In this paper, an extensive study on the factors that influence the performance of AODV routing protocol had been performed through the study of battery voltage decaying of nodes, neighboring tables, time delay and network topology structure. Simulation results reveal that the location of the coordinator within approximate equal distances to all nodes is more appropriate for lifelong batteries and AODV routing perform…
Enhanced Location Based Routing Protocol for 6LoWPAN
IEEE 802.15.4标准化的6LoWPAN（IPv6 over IEEE 802.15.4）为无线传感器网络中的节点提供IP通信能力。在MAC层之上引入适配层以实现IP分组的报头压缩、分段和重组。基于位置的信息用于简化路由策略。本文提出了一种高效的基于位置的路由协议，考虑链路质量和节点之间的距离作为路由度量。在NS22.32环境下对所提出的增强型基于位置的路由协议（ELBRP）进行了仿真，并从分组投递率、吞吐量和平均端到端时延等方面对ELBRP的性能进行了分析。从得到的结果，它被发现，建议ELBRP优于现有的LOAD协议。
Finding the shortest route in wireless mesh networks is an important aspect. Many techniques are used to solve this problem like dynamic programming, evolutionary algorithms, weighted-sum techniques, and others. In this paper, we use dynamic programming techniques to find the shortest path in wireless mesh networks due to their generality, reduction of complexity and facilitation of numerical computation, simplicity in incorporating constraints, and their conformity to the stochastic nature of some problems. The routing problem is a multi-objective optimization problem with some constraints su…
Multicast communication plays a crucial role in Mobile Adhoc Networks (MANETs). MANETs provide low cost, self configuring devices for multimedia data communication in military battlefield scenarios, disaster and public safety networks (PSN). Multicast communication improves the network performance in terms of bandwidth consumption, battery power and routing overhead as compared to unicast for same volume of data communication. In recent past, a number of multicast routing protocols (MRPs) have been proposed that tried to resolve issues and challenges in MRP. Multicast based group communication…
In this paper, we present Context-Adaptive PARRoT (CA-PARRoT) as an extension of our previous work Predictive Ad-hoc Routing fueled by Reinforcement learning and Trajectory knowledge (PARRoT). Short-term effects, as occurring in urban surroundings, have shown to have a negative impact on the Reinforcement Learning (RL)-based routing process. Therefore, we add a timer-based compensation mechanism to the update process and introduce a hybrid Machine Learning (ML) approach to classify Radio Environment Prototypes (REPs) with a dedicated ML component and enable the protocol for autonomous context …
The provision of reliable and efficient end-to-end communication within ground- and air-based mobile mesh networks is a major challenge for routing protocols due to the mobility-related dynamics of the channel properties and the resulting mesh network topology. In this paper, we evaluate the performance of the novel Better Approach To Mobile Adhoc Networking (B.A.T.M.A.N.) V routing protocol for vehicular mesh networks and propose a mobility-predictive extension that explicitly addresses highly dynamic communication networks. In order to enable large-scale simulative analysis, we present an op…
Network coding and opportunistic routing are two recognized innovative ideas to improve the performance of wireless networks by utilizing the broadcast nature of the wireless medium. In the last decade, there has been considerable research on how to synergize inter-flow network coding and opportunistic routing in a single joint protocol outperforming each in any scenario. This paper explains the motivation behind the integration of these two techniques, and highlights certain scenarios in which the joint approach may even degrade the performance, emphasizing the fact that their synergistic eff…
In IEEE 802.11 networks, selfish stations can pursue a better quality of service (QoS) through selfish MAC-layer attacks. Such attacks are easy to perform, secure routing protocols do not prevent them, and their detection may be complex. Two-hop relay topologies allow a new angle of attack: a selfish relay can tamper with either source traffic, transit traffic, or both. We consider the applicability of selfish attacks and their variants in the two-hop relay topology, quantify their impact, and study defense measures.
This paper evaluates the energy consumption of well-known routing protocols, along with other metrics such as throughput, packet delivery ratio (PDR), and delay in different scenarios. We consider two other metrics in order to capture the efficiency of the energy consumption: e-throughput which is the ratio between the consumed energy and the throughput; and the e-PDR which is the ratio between the consumed energy and the PDR. We compare four routing protocols: AODV, OLSR, and HWMP in Reactive and Proactive modes. The number of nodes is varying between 25 and 81 nodes, with different mobility …
The objective of this systematic review is to assess the state of the art on routing protocols aimed at WMNs, when associated with mechanisms for financial incentives that aim to ensure the self-sustainability of the network, seeking to identify the improvements and associated risks as well as the efficiency of the mechanisms adopted within networks, thus ensuring increased reliability in the use of such protocols for routing encouraged WMNs.
Citizens develop Wireless Mesh Networks (WMN) in many areas as an alternative or their only way for local interconnection and access to the Internet. This access is often achieved through the use of several shared web proxy gateways. These network infrastructures consist of heterogeneous technologies and combine diverse routing protocols. Network-aware state-of-art proxy selection schemes for WMNs do not work in this heterogeneous environment. We developed a client-side gateway selection mechanism that optimizes the client-gateway selection, agnostic to underlying infrastructure and protocols,…
This paper presents a novel storage aware routing (STAR) protocol designed to provide a general networking solution over a broad range of wired and wireless usage scenarios. STAR enables routing policies which adapt seamlessly from a well-connected wired network to a disconnected wireless network. STAR uses a 2-Dimensional routing metric composed of a short and a long term route cost and storage availability on downstream routers to make store or forward routing decisions. Temporary in-network storage is preferred over forwarding along a path that is slower than average and opportunistic trans…
Multi-beam antenna technologies have provided lots of promising solutions to many current challenges faced in wireless mesh networks. The antenna can establish several beamformings simultaneously and initiate concurrent transmissions or receptions using multiple beams, thereby increasing the overall throughput of the network transmission. Multi-beam antenna has the ability to increase the spatial reuse, extend the transmission range, improve the transmission reliability, as well as save the power consumption. Traditional Medium Access Control (MAC) protocols for wireless network largely relied…
MAC layer protocol design in a WSN is crucial due to the limitations on processing capacities and power of wireless sensors. The latest version of the IEEE 802.15.4, referenced to as IEEE 802.15.4e, was released by IEEE and outlines the mechanism of the Time Slotted Channel Hopping (TSCH). Hence, 6TiSCH working group has released a distributed algorithm for neighbour nodes to agree on a communication pattern driven by a minimal scheduling function. A slotframe contains a specific number of time slots, which are scheduled based on the application requirements and the routing topology. Sensors n…
The paper presents a topology-agnostic greedy protocol for network-on-chip routing. The proposed routing algorithm can tolerate any number of permanent faults, and is proven to be deadlock-free. We introduce a specialized variant of the algorithm, which is optimized for 2D mesh networks, both flat and wireless. The adaptiveness and minimality of several variants this algorithm are analyzed through graph-based simulations.
Wireless Mesh Networks(WMN) is an active research topic for wireless networks designers and researchers. Routing has been studied in the last two decades in the field of optimization due to various applications in WMN. In this paper, Adaptive Genetic Algorithm (AGA) for identifying the shortest path in WMN satisfying multi- QoS measure is introduced. The proposed algorithm is adaptive in the sense that it uses various selection methods during the reproduction process and the one with the best multi-QoS measure is adopted in that generation .The multi-objective QoS measure defined as the combin…
We investigate the problem of network utility maximization in multiple gateways wireless mesh networks by considering Signal to Interference plus Noise Ratio (SINR) as the interference model. The aim is a cross layer design that considers joint rate control, traffic splitting, routing, scheduling, link rate allocation and power control to formulate the network utility maximization problem. As this problem is computationally complex, we propose the Joint dynamic Gateway selection, link Rate allocation and Power control (JGRP) algorithm based on the differential backlog as a sub-optimal solution…
Network coding is an effective idea to boost the capacity of wireless networks, and a variety of studies have explored its advantages in different scenarios. However, there is not much analytical study on throughput and end-to-end delay of network coding in multi-hop wireless networks considering the specifications of IEEE 802.11 Distributed Coordination Function. In this paper, we utilize queuing theory to propose an analytical framework for bidirectional unicast flows in multi-hop wireless mesh networks. We study the throughput and end-to-end delay of inter-flow network coding under the IEEE…
We present the TDMH (Time Deterministc Multi-Hop) protocol, a complete stack for real-time wireless mesh networks. TDMH offers to applications a connection-oriented, bounded-latency communication model. Point-to-point data streams can be created and destroyed at any time. Path redundancy can be optionally introduced to improve reliability. TDMH exploits state-of-the-art low power clock synchronisation and constructive interference flooding to build a continuously updated graph of the network topology, onto which a centralized scheduler maps data streams using TDMA channel access. We realised T…
