SURVEY ON ROUTING METRICS AND ROUTING PROTOCOLS IN WIRELESS MESH NETWORKS

Today, Internet has become an indispensable part of our daily lives. It has a growing user community in many fields from banking transactions to online entertainment. It will be very efficient for users, as the next generation internet access becomes wireless like frequently used services such as cellular phones. But for providing this, a new network is needed to be designed or an existing network must be improved as well as making changes on infrastructure. At this point, mesh network infrastructure arises and offers more sophisticated internet access with less need. The most important advantage of mesh networks is the capability of working without infrastructure. Mesh networks are an additional access technology more than being a renewed one in the next generation wireless networks called 4G. In this study, wireless mesh networks base architecture and design factors are emphasized, current routing protocols that are used on wireless mesh networks and routing metrics on which these protocols are based, are explained. Finally, the performance effects of these protocols and metrics on different network topologies are referred.

이기종 IoT 기기간 협력을 통한 네트워크 성능 향상

학위논문(박사) -- 서울대학교대학원 : 공과대학 전기·정보공학부, 2022. 8. 박세웅.The Internet of Things (IoT) has become a daily life by pioneering applications in various fields. In this dissertation, we consider increasing transmission data rate with energy efficiency, extending transmission coverage with low power, and improving reliability in congested frequency bands as three challenges to expanding IoT applications. We address two issues to overcome these challenges. First, we design a layered network system with a new structure that combines Bluetooth Low Energy (BLE) and Wi-Fi networks in a multi-hop network. Based on the system, we propose methods to increase data rate with energy efficiency and extend transmission coverage in a low-power situation. We implement the proposed system in the Linux kernel and evaluate the performance through an indoor testbed. As a result, we confirmed that the proposed system supports high data traffic and reduces average power consumption in the testbed compared to the existing single BLE/Wi-Fi ad-hoc network in a multi-hop situation. Second, we tackle the adaptive frequency hopping (AFH) problem of BLE through cross-technology communication (CTC) and channel weighting. We design the AFH scheme that weights the channels used by BLE devices with improving reliability in the congested bands of both Wi-Fi and BLE devices. We evaluate the proposed scheme through prototype experiments and simulations, confirming that the proposed scheme increases the packet reception rate of BLE in the congested ISM band compared to the existing AFH algorithm.사물인터넷은 현재 다양한 영역에서 application을 개척하여 생활화되어 왔다. 이 학위 논문에서는 사물인터넷의 응용 사례 확장을 위해 에너지 효율적인 전송 속도 향상, 저전력 상황에서의 전송 범위 확장, 혼잡한 대역에서의 신뢰성 향상을 새로운 도전 과제로 삼고, 이러한 도전 과제를 극복할 두 가지 주제를 다룬다. 첫째, 다중 홉 네트워크 상황에서의 블루투스 저전력과 Wi-Fi 네트워크를 결합 한 새로운 구조의 계층적 네트워크 시스템을 설계하고 이에 기반한 에너지 효율적인 전송 속도 향상 및 저전력 상황에서의 전송 범위확장을 제안한다. 제안된 시스템은 Linux 커널에 구현하여 실내 테스트베드를 통해 성능을 평가한다. 결과적으로 제안 한 기법이 다중 홉 상황에서 기존 블루투스 저전력/Wi-Fi 단일 ad-hoc 네트워크와 비교하여 높은 데이터 트래픽을 지원하며, 테스트베드에서의 평균 전력 소비를 줄 이는 것을 확인한다. 둘째, Cross-technology Communication (CTC)과 채널 가중치를 통한 블루투스 저전력의 Adaptive Frequency Hopping (AFH) 문제를 해결한다. 최종적으로 블루투스 저전력 기기가 사용하는 채널에 가중치를 두는 AFH 기법을 설계하여 Wi-Fi 와 블루투스 저전력 기기가 모두 혼잡한 대역에서의 신뢰성을 향상한다. 프로토타입 실험과 시뮬레이션을 통해 제안한 기법이 기존의 AFH 기법과 비교하여 혼잡한 ISM 대역에서 블루투스 저전력의 패킷 수신율을 증가시키는 것을 확인한다.1 Introduction 1 1.1 Motivation 1 1.2 Contributions and Outline 2 2 Wi-BLE: On Cooperative Operation of Wi-Fi and Bluetooth Low Energy under IPv6 4 2.1 Introduction 4 2.2 Related Work 7 2.2.1 Multihop Connectivity for Wi-Fi or BLE 7 2.2.2 Multi-radio Operation 11 2.3 System Overview 13 2.3.1 Control Plane 13 2.3.2 Data Plane 16 2.3.3 Overall Procedure 16 2.4 MABLE: AODV Routing over BLE 17 2.4.1 BLE Channel Utilization 17 2.4.2 Joint Establishment of Route and Connection 20 2.4.3 Link Quality Metric for BLE Data Channels 22 2.4.4 Bi-directional Route Error Propagation 25 2.5 Wi-BLE: Wi-Fi Ad-hoc over BLE 27 2.5.1 Radio Selection 27 2.5.2 Routing and Radio Wake-up for Wi-Fi 30 2.6 Evaluation 32 2.6.1 BLE Routing 33 2.6.2 Wi-Fi Routing over BLE 35 2.6.3 Radio Selection 38 2.7 Summary 40 3 WBC-AFH: Direct Wi-Fi to BLE Communication based AFH 41 3.1 Introduction 41 3.2 Background 45 3.2.1 Frequency hopping in BLE 45 3.2.2 Cross Technology Communication 47 3.3 Proposed AFH 49 3.3.1 CTC based informing 50 3.3.2 Weighted channel select 51 3.3.3 Hopping set size optimization 52 3.3.4 WBC-AFH 54 3.4 Evaluation 57 3.4.1 Setup 57 3.4.2 Robustness 60 3.4.3 Reliability 61 3.5 Future Work 65 3.6 Summary 66 4 Conclusion 67박

Planning in FARS by dynamic multipath Reconfiguration system failure recovery in Wireless Mesh Network

ABSTRACT: Mesh Network has the advantages of fast implementation, easy maintenance and low direct investment while comparing with the existing networks. Wireless mesh networks are implemented as wireless anchors, but they are not stabilized. WMN experience frequent link failures caused by channel interference, dynamic obstacles and/or applications bandwidth demands. These failures cause severe performance degradation in WMNs. This paper presents the fast autonomous network reconfiguration system which provides the multi radio Wireless Mesh Networks to recover from link failure automatically to maintain the network performance. Fast autonomous network reconfiguration system gives the necessary changes in local radio and channel allocations to rescue from fails. The cooperative networks reconfigure network protocol for routers. FARS widely used in Wireless Mesh Networks test. The Implementation results Shows Fast Autonomous Network Reconfiguration System failure recovery by more than 97%. Recover Mechanism have been introduced in order to increase the network performance while failure occurs. The infrastructure will be implemented to create disjoint paths in those frameworks

Distributed Topology Control for Stable Path Routing in Multi-hop Wireless Networks

In this paper, we introduce the stable path topology control problem for routing in mobile multi-hop networks. We formulate the topology control problem of selective link-state broadcast as a graph pruning problem with restricted local neighborhood information. We develop a multi-agent optimiza- tion framework where the decision policies of each agent are restricted to local policies on incident edges and independent of the policies of the other agents. We show that under a condition called the positivity condition, these independent local policies preserve the stable routing paths globally. We then provide an efficient algorithm to compute an optimal local policy that yields a minimal pruned graph, which we call the Stable Path Topology Control (SPTC) algorithm. Using simulations, we demonstrate that this algorithm, when used with the popular ETX metric, outperforms topology control mechanisms commonly used for Mobile Ad Hoc Networks

7. GI/ITG KuVS Fachgespräch Drahtlose Sensornetze

In dem vorliegenden Tagungsband sind die Beiträge des Fachgesprächs Drahtlose Sensornetze 2008 zusammengefasst. Ziel dieses Fachgesprächs ist es, Wissenschaftlerinnen und Wissenschaftler aus diesem Gebiet die Möglichkeit zu einem informellen Austausch zu geben – wobei immer auch Teilnehmer aus der Industrieforschung willkommen sind, die auch in diesem Jahr wieder teilnehmen.Das Fachgespräch ist eine betont informelle Veranstaltung der GI/ITG-Fachgruppe „Kommunikation und Verteilte Systeme“ (www.kuvs.de). Es ist ausdrücklich keine weitere Konferenz mit ihrem großen Overhead und der Anforderung, fertige und möglichst „wasserdichte“ Ergebnisse zu präsentieren, sondern es dient auch ganz explizit dazu, mit Neueinsteigern auf der Suche nach ihrem Thema zu diskutieren und herauszufinden, wo die Herausforderungen an die zukünftige Forschung überhaupt liegen.Das Fachgespräch Drahtlose Sensornetze 2008 findet in Berlin statt, in den Räumen der Freien Universität Berlin, aber in Kooperation mit der ScatterWeb GmbH. Auch dies ein Novum, es zeigt, dass das Fachgespräch doch deutlich mehr als nur ein nettes Beisammensein unter einem Motto ist.Für die Organisation des Rahmens und der Abendveranstaltung gebührt Dank den beiden Mitgliedern im Organisationskomitee, Kirsten Terfloth und Georg Wittenburg, aber auch Stefanie Bahe, welche die redaktionelle Betreuung des Tagungsbands übernommen hat, vielen anderen Mitgliedern der AG Technische Informatik der FU Berlin und natürlich auch ihrem Leiter, Prof. Jochen Schiller

Mobile Ad-Hoc Networks

Being infrastructure-less and without central administration control, wireless ad-hoc networking is playing a more and more important role in extending the coverage of traditional wireless infrastructure (cellular networks, wireless LAN, etc). This book includes state-of-the-art techniques and solutions for wireless ad-hoc networks. It focuses on the following topics in ad-hoc networks: quality-of-service and video communication, routing protocol and cross-layer design. A few interesting problems about security and delay-tolerant networks are also discussed. This book is targeted to provide network engineers and researchers with design guidelines for large scale wireless ad hoc networks

A cross-layer middleware architecture for time and safety critical applications in MANETs

Mobile Ad hoc Networks (MANETs) can be deployed instantaneously and adaptively, making them highly suitable to military, medical and disaster-response scenarios. Using real-time applications for provision of instantaneous and dependable communications, media streaming, and device control in these scenarios is a growing research field. Realising timing requirements in packet delivery is essential to safety-critical real-time applications that are both delay- and loss-sensitive. Safety of these applications is compromised by packet loss, both on the network and by the applications themselves that will drop packets exceeding delay bounds. However, the provision of this required Quality of Service (QoS) must overcome issues relating to the lack of reliable existing infrastructure, conservation of safety-certified functionality. It must also overcome issues relating to the layer-2 dynamics with causal factors including hidden transmitters and fading channels. This thesis proposes that bounded maximum delay and safety-critical application support can be achieved by using cross-layer middleware. Such an approach benefits from the use of established protocols without requiring modifications to safety-certified ones. This research proposes ROAM: a novel, adaptive and scalable cross-layer Real-time Optimising Ad hoc Middleware framework for the provision and maintenance of performance guarantees in self-configuring MANETs. The ROAM framework is designed to be scalable to new optimisers and MANET protocols and requires no modifications of protocol functionality. Four original contributions are proposed: (1) ROAM, a middleware entity abstracts information from the protocol stack using application programming interfaces (APIs) and that implements optimisers to monitor and autonomously tune conditions at protocol layers in response to dynamic network conditions. The cross-layer approach is MANET protocol generic, using minimal imposition on the protocol stack, without protocol modification requirements. (2) A horizontal handoff optimiser that responds to time-varying link quality to ensure optimal and most robust channel usage. (3) A distributed contention reduction optimiser that reduces channel contention and related delay, in response to detection of the presence of a hidden transmitter. (4) A feasibility evaluation of the ROAM architecture to bound maximum delay and jitter in a comprehensive range of ns2-MIRACLE simulation scenarios that demonstrate independence from the key causes of network dynamics: application setting and MANET configuration; including mobility or topology. Experimental results show that ROAM can constrain end-to-end delay, jitter and packet loss, to support real-time applications with critical timing requirements

Evaluation of on-demand routing in mobile ad hoc networks and proposal for a secure routing protocol

Secure routing Mobile Ad hoc Networks (MANETs) has emerged as an important MANET research area. Initial work in MANET focused mainly on the problem of providing efficient mechanisms for finding paths in very dynamic networks, without considering the security of the routing process. Because of this, a number of attacks exploit these routing vulnerabilities to manipulate MANETs. In this thesis, we performed an in-depth evaluation and performance analysis of existing MANET Routing protocols, identifying Dynamic Source Routing (DSR) as the most robust (based on throughput, latency and routing overhead) which can be secured with negligible routing efficiency trade-off. We describe security threats, specifically showing their effects on DSR. We proposed a new routing protocol, named Authenticated Source Routing for Ad hoc Networks (ASRAN) which is an out-of-band certification-based, authenticated source routing protocol with modifications to the route acquisition process of DSR to defeat all identified attacks. Simulation studies confirm that ASRAN has a good trade-off balance in reference to the addition of security and routing efficiency

Self-organized backpressure routing for the wireless mesh backhaul of small cells

The ever increasing demand for wireless data services has given a starring role to dense small cell (SC) deployments for mobile networks, as increasing frequency re-use by reducing cell size has historically been the most effective and simple way to increase capacity. Such densification entails challenges at the Transport Network Layer (TNL), which carries packets throughout the network, since hard-wired deployments of small cells prove to be cost-unfeasible and inflexible in some scenarios. The goal of this thesis is, precisely, to provide cost-effective and dynamic solutions for the TNL that drastically improve the performance of dense and semi-planned SC deployments. One approach to decrease costs and augment the dynamicity at the TNL is the creation of a wireless mesh backhaul amongst SCs to carry control and data plane traffic towards/from the core network. Unfortunately, these lowcost SC deployments preclude the use of current TNL routing approaches such as Multiprotocol Label Switching Traffic Profile (MPLS-TP), which was originally designed for hard-wired SC deployments. In particular, one of the main problems is that these schemes are unable to provide an even network resource consumption, which in wireless environments can lead to a substantial degradation of key network performance metrics for Mobile Network Operators. The equivalent of distributing load across resources in SC deployments is making better use of available paths, and so exploiting the capacity offered by the wireless mesh backhaul formed amongst SCs. To tackle such uneven consumption of network resources, this thesis presents the design, implementation, and extensive evaluation of a self-organized backpressure routing protocol explicitly designed for the wireless mesh backhaul formed amongst the wireless links of SCs. Whilst backpressure routing in theory promises throughput optimality, its implementation complexity introduces several concerns, such as scalability, large end-to-end latencies, and centralization of all the network state. To address these issues, we present a throughput suboptimal yet scalable, decentralized, low-overhead, and low-complexity backpressure routing scheme. More specifically, the contributions in this thesis can be summarized as follows: We formulate the routing problem for the wireless mesh backhaul from a stochastic network optimization perspective, and solve the network optimization problem using the Lyapunov-driftplus-penalty method. The Lyapunov drift refers to the difference of queue backlogs in the network between different time instants, whereas the penalty refers to the routing cost incurred by some network utility parameter to optimize. In our case, this parameter is based on minimizing the length of the path taken by packets to reach their intended destination. Rather than building routing tables, we leverage geolocation information as a key component to complement the minimization of the Lyapunov drift in a decentralized way. In fact, we observed that the combination of both components helps to mitigate backpressure limitations (e.g., scalability,centralization, and large end-to-end latencies). The drift-plus-penalty method uses a tunable optimization parameter that weight the relative importance of queue drift and routing cost. We find evidence that, in fact, this optimization parameter impacts the overall network performance. In light of this observation, we propose a self-organized controller based on locally available information and in the current packet being routed to tune such an optimization parameter under dynamic traffic demands. Thus, the goal of this heuristically built controller is to maintain the best trade-off between the Lyapunov drift and the penalty function to take into account the dynamic nature of semi-planned SC deployments. We propose low complexity heuristics to address problems that appear under different wireless mesh backhaul scenarios and conditions..