Novel routing protocol scheme for real-time applications in mobile Ad Hoc networks
TL;DR: A novel routing protocol is proposed that aims to minimize routing overhead in route discovery procedure, and guarantee a reliable and fast packet delivery between source and destination, especially in providing real-time applications over MANETs.
Abstract: In mobile Ad Hoc networks (MANETs), flooding-based route discovery is usually preferred in order to set up the route with reliability between transmission pair. However, this approach may cause a serious contention in transmission between adjacent nodes and a considerable amount of control packets. In addition, most of Ad Hoc routing protocols establish the route with minimum hop count. Consequently, the performance of Ad Hoc routing protocol is considerably affected by link (or route) duration since the network comprises the nodes with unrestricted mobility and constrained range in transmission. This paper proposes novel routing protocol that aims to (1) minimize routing overhead in route discovery procedure, and (2) guarantee a reliable and fast packet delivery between source and destination, especially in providing real-time applications over MANETs. To achieve this objective, we introduce relay region (RR) within the transmission range of nodes in order to select optimal next relaying nodes for supporting specific application requirements in route discovery procedure. The RR is defined by the limited distance progress in transmission to next relaying node in order to maintain the established route for an arbitrary length of time (i.e., route duration) while meeting packet delivery reliability and delay constraints. In performance evaluation, the simulation results showed that the proposed scheme can significantly improve the performance in comparison with the previous routing algorithms in terms of packet delivery ratio and packet delivery latency, reducing transmission redundancy in route discovery procedure.
Citations
More filters
TL;DR: An adaptive routing protocol (AQ-Routing) based on Reinforcement Learning (RL) techniques, which has the ability to detect the level of mobility at different points of time so that each individual node can update routing metric accordingly, is described and analyzed.
Abstract: Internet of Things, is an innovative technology which allows the connection of physical things with the digital world through the use of heterogeneous networks and communication technologies. In an IoT system, a major role is played by the wireless sensor network as its components comprise: sensing, data acquiring, heterogeneous connectivity and data processing. Mobile ad-hoc networks are highly self reconfiguring networks of mobile nodes which communicate through wireless links. In such a network, each node acts both as a router and host at the same time. The interaction between MANETs and Internet of Things opens new ways for service provision in smart environments and challenging issues in its networking aspects. One of the main issues in MANET–IoT systems is the mobility of the network nodes: routing protocol must react effectively to the topological changes into the algorithm design. We describe the design and implementation of AQ-Routing, and analyze its performance using both simulations and measurements based on our implementation. In general, the networking of such a system is very challenging regarding routing aspects. Also, it is related to system mobility and limited network sensor resources. This article builds upon this observation an adaptive routing protocol (AQ-Routing) based on Reinforcement Learning (RL) techniques, which has the ability to detect the level of mobility at different points of time so that each individual node can update routing metric accordingly. The proposed protocol introduces: (i) new model, developed via Q-learning technique, to detect the level of mobility at each node in the network; (ii) a new metric, called $$Q_{\textit{metric}},$$ which account for the static and dynamic routing metrics, and which are combined and updated to the changing network topologies. The protocol can efficiently handle network mobility by a way of preemptively adapting its behaviour thanks to the mobility detection model. The presented results of simulation provide an effective approach to improve the stability of links in both static and mobile scenario and, hence, increase the packet delivery ratio in the global MANET–IoT system.
32 citations
Cites background from "Novel routing protocol scheme for r..."
...Hence, nodes might consider other factors, for example, link bandwidth [19], link availability and residual energy [36], overhead redundancy and route duration [40], besides the MF in order to improve routing performance....
[...]
TL;DR: In this paper, a load, congestion and attack-aware Fuzzy-Statistical DSR (FSDSR) protocol is suggested for optimization of man-in-Middle attack and congestion in wireless network.
Abstract: Man-in-Middle attack and congestion are challenging issues in a wireless network. In this paper, a load, congestion and attack-aware Fuzzy-Statistical DSR (FSDSR) protocol is suggested for optimizi...
References
More filters
01 Aug 1999
TL;DR: This paper proposes several schemes to reduce redundant rebroadcasts and differentiate timing of rebroadcast to alleviate the broadcast storm problem, which is identified by showing how serious it is through analyses and simulations.
Abstract: Broadcasting is a common operation in a network to resolve many issues. In a mobile ad hoc network (MANET) in particular, due to host mobility, such operations are expected to be executed more frequently (such as finding a route to a particular host, paging a particular host, and sending an alarm signal). Because radio signals are likely to overlap with others in a geographical area, a straightforward broadcasting by flooding is usually very costly and will result in serious redundancy, contention, and collision, to which we call the broadcast storm problem. In this paper, we identify this problem by showing how serious it is through analyses and simulations. We propose several schemes to reduce redundant rebroadcasts and differentiate timing of rebroadcasts to alleviate this problem. Simulation results are presented, which show different levels of improvement over the basic flooding approach.
3,819 citations
"Novel routing protocol scheme for r..." refers background in this paper
...This effect is commonly referred to as the broadcast stormproblem [7]....
[...]
TL;DR: An overview of ad hoc routing protocols that make forwarding decisions based on the geographical position of a packet's destination and previously proposed location services are discussed in addition to position-based packet forwarding strategies.
Abstract: We present an overview of ad hoc routing protocols that make forwarding decisions based on the geographical position of a packet's destination. Other than the destination's position, each node need know only its own position and the position of its one-hop neighbors in order to forward packets. Since it is not necessary to maintain explicit routes, position-based routing does scale well even if the network is highly dynamic. This is a major advantage in a mobile ad hoc network where the topology may change frequently. The main prerequisite for position-based routing is that a sender can obtain the current position of the destination. Therefore, previously proposed location services are discussed in addition to position-based packet forwarding strategies. We provide a qualitative comparison of the approaches in both areas and investigate opportunities for future research.
1,722 citations
"Novel routing protocol scheme for r..." refers background in this paper
...To cope with this situation, position-based routing protocols have been proposed [8,9]....
[...]
TL;DR: A distributed position-based network protocol optimized for minimum energy consumption in mobile wireless networks that support peer-to-peer communications that proves to be self-reconfiguring and stays close to the minimum energy solution when applied to mobile networks.
Abstract: We describe a distributed position-based network protocol optimized for minimum energy consumption in mobile wireless networks that support peer-to-peer communications. Given any number of randomly deployed nodes over an area, we illustrate that a simple local optimization scheme executed at each node guarantees strong connectivity of the entire network and attains the global minimum energy solution for stationary networks. Due to its localized nature, this protocol proves to be self-reconfiguring and stays close to the minimum energy solution when applied to mobile networks. Simulation results are used to verify the performance of the protocol.
1,666 citations
TL;DR: This paper proposes several schemes to reduce redundant rebroadcasts and differentiate timing of rebroadcast to alleviate the broadcast storm problem, which is identified by showing how serious it is through analyses and simulations.
Abstract: Broadcasting is a common operation in a network to resolve many issues. In a mobile ad hoc network (MANET) in particular, due to host mobility, such operations are expected to be executed more frequently (such as finding a route to a particular host, paging a particular host, and sending an alarm signal). Because radio signals are likely to overlap with others in a geographical area, a straightforward broadcasting by flooding is usually very costly and will result in serious redundancy, contention, and collision, to which we call the broadcast storm problem. In this paper, we identify this problem by showing how serious it is through analyses and simulations. We propose several schemes to reduce redundant rebroadcasts and differentiate timing of rebroadcasts to alleviate this problem. Simulation results are presented, which show different levels of improvement over the basic flooding approach.
1,411 citations
Book•
12 Aug 2005
TL;DR: In this article, the authors state several problems related to topology control in wireless ad hoc and sensor networks, and survey state-of-the-art solutions which have been proposed to tackle them.
Abstract: Topology Control (TC) is one of the most important techniques used in wireless ad hoc and sensor networks to reduce energy consumption (which is essential to extend the network operational time) and radio interference (with a positive effect on the network traffic carrying capacity). The goal of this technique is to control the topology of the graph representing the communication links between network nodes with the purpose of maintaining some global graph property (e.g., connectivity), while reducing energy consumption and/or interference that are strictly related to the nodes' transmitting range. In this article, we state several problems related to topology control in wireless ad hoc and sensor networks, and we survey state-of-the-art solutions which have been proposed to tackle them. We also outline several directions for further research which we hope will motivate researchers to undertake additional studies in this field.
1,367 citations