Energy efficient secured routing protocol for MANETs

The design of routing protocol with energy efficiency and security is a challenging task. To overcome this challenge, we propose energy-efficient secured routing protocol. The objective of our work is to provide a secured routing protocol, which is energy efficient. To provide security for both link and message without relying on the third party, we provide security to the protocol by choosing a secure link for routing using Secure Optimized Link State Routing Protocol. Each node chooses multipoint relay nodes amongst the set of one-hop neighbors, so as to reach all two-hop neighbors. The access control entity authorizes nodes announcing the node identification to the network. In addition, the access control entity signs a public key Ki, a private key ki, and the certificate Ci required by an authorized node to obtain the group key. Each node maintains a route table with power status as one of its entry. After selecting the link, on requirement of a new route, we check nodes’ power status in its routing table and then accordingly arise a route. Then, we perform group key distribution using the generated keys using a small number of messages which helps reducing energy consumption. The group key can be altered periodically to avoid nonauthorized nodes and to avoid the use of the same group key in more than some amount of data. Then, we provide communication privacy for both message sender and message recipient using Secure Source Anonymous Message Authentication Scheme. Thereby, the message sender or the sending node generates a source anonymous message authentication for message for releasing each message based on the MES scheme. Hence, our approach will provide message content authenticity without relying on any trusted third parties.     

一种新的无线局域网节点自私行为检测算法

提出了一种基于Kolmogorov-Smirnoff(K-S)检验的节点自私行为检测算法,并结合对节点发送次数的检测进一步提高了检测速度和精度。该算法无需对无线信道参数进行假设,性能不受捕获效应的影响。仿真实验表明,该算法具有较快的检测速度和较低的误判率,性能明显优于经典的中心极限定理(CLT)检测算法和DOMINO检测算法。     

Enhancing QoE for video streaming in MANETs via multi-constraint routing

In this paper, we propose a Multi-Constraint Quality-of-Experience (QoE) centric Routing (MCQR) technique for efficient real-time video streaming over Mobile Ad-hoc Networks (MANETs). The dynamic estimation of link quality metric during MCQR route discovery process is the key of enhancing QoE at end user. MCQR limits end-to-end delay and jitter of received data packets by selecting long lifetime routes with maximum permissible delay. This minimizes the distortion caused fluctuations in perceived video. To prove the effectiveness of MCQR for real-time video streaming, we have designed a hybrid MANET consisting of simulated nodes and physical machines. In our hybrid network, the source and destination nodes are video traffic generators and receivers running on physical devices. Emulation results are obtained using real-time video streaming over high fidelity virtual wireless network, and conforming that the MCQR protocol provides satisfactory QoE to end users as compared to existing similar techniques. The packet delivery ratio of MCQR is higher than 90 % and its mean opinion score is higher than three (i.e., satisfactory) even when mobility and shadowing effects are kept high in target network scenarios. These improvements are achieved along with still maintaining similar or better routing overhead and processing delays.     

Secure routing in MANETs using local times

We present a new approach to secure routing in mobile ad-hoc networks based solely on the relative transmission times of overhead packets. Unlike most previous works aimed at securing route computation, we eliminate a key vulnerability (explicitly stated routing metrics) altogether. We introduce the Secure Time-Ordered routing Protocol (STOP), which uses time-based orderings to ensure the establishment of multiple loop-free paths between a source and a destination. STOP is the first routing protocol to use performance-based path selection without source routing, path vectors, or complete topology information, making it far more efficient that similar approaches. We prove that adversaries cannot take any action to manipulate the time-based ordering so as to unfairly gain control of the forwarding topology and, by design, nodes which drop data packets will be avoided. Furthermore, at convergence, traffic load is evenly distributed over the well-performing paths, so adversaries cannot gain complete control over the data flow through temporary good behavior. Simulation results show that the countermeasures in STOP are effective against a variety of attacks from independent and colluding adversaries, and that this improved security does not come at the expense of routing performance.     

Efficient routing in MANETs using ordered walks

A new approach for routing protocols operating in MANETs is presented in which flooding is not required to establish paths from sources to destinations on demand in MANETs of moderate size. The concept of ordered walk is introduced as a depth-first search (DFS) that does not rely on geographical or virtual coordinate information and is much more efficient than mere random walks. The benefits of using DFS as the building block of the signaling in MANET routing protocols are exemplified by the introduction of the Ordered Walk Search Algorithm (OSA), which is used as part of the proposed Ordered Walk with Learning (OWL) protocol. OWL integrates OSA with the learning of paths from prior successful and failed attempts, and performs one or multiple concurrent ordered walks to search for destinations. Simulation experiments are used to compare the performance of OWL against that of well-known MANET routing protocols based on BFS (e.g., OLSR and AODV). The results show that OWL can achieve a performance comparable to traditional protocols that rely on some form of flooding of link states or network-wide dissemination of distance information in terms of packet delivery ratios and average end-to-end delays, while incurring up to ten times less overhead than AODV.     

A prediction-based link availability estimation for routing metrics in MANETs

A Mobile Ad hoc Network (MANET) is a collection of wireless mobile terminals that are able to dynamically form a temporary network without any aid from fixed infrastructure or centralized administration. One critical issue for routing in MANETs is how to select reliable paths that can last as long as possible since terminal mobility may cause radio links to be broken frequently. To solve this problem, a criterion that can judge path reliability is needed. The reliability of a path depends on the number of links and the reliability of each link constituting the path. Many routing metrics in terms of number of links have been proposed, such as the shortest path routing. However, how to measure link availability or reliability in order to find more reliable paths has not been addressed adequately in the literature. (By a link being available, we mean that the radio quality of the link satisfies the minimum requirement for successful communication. Link availability is used to measure probability or degree that a link is available. The terms availability and reliability are used interchangeable in this paper.) This paper first introduces a prediction-based link availability estimation to quantify the link reliability. This quantity makes use of some instantly available information and also considers the dynamic nature of link status in order to properly reflect the link reliability. Then, this quantity has been further used to develop routing metrics for path selection in terms of path reliability to improve routing performances. The proposed schemes have been investigated through computer simulation.     

SRDP: Secure route discovery for dynamic source routing in MANETs

Routing is a critical function in multi-hop mobile ad hoc networks (MANETs). A number of MANET-oriented routing protocols have been proposed, of which DSR is widely considered both the simplest and the most effective. At the same time, security in MANETs – especially, routing security – presents a number of new and interesting challenges. Many security techniques geared for MANETs have been developed, among which Ariadne is the flagship protocol for securing DSR.The focus of this work is on securing the route discovery process in DSR. Our goal is to explore a range of suitable cryptographic techniques with varying flavors of security, efficiency and robustness. The Ariadne approach (with TESLA), while very efficient, assumes loose time synchronization among MANET nodes and does not offer non-repudiation. If the former is not possible or the latter is desired, an alternative approach is necessary. To this end, we construct a secure route discovery protocol (SRDP) which allows the source to securely discover an authenticated route to the destination using either aggregated message authentication codes (MACs) or multi-signatures. Several concrete techniques are presented and their efficiency and security are compared and evaluated.     

Provisioning of adaptability to variable topologies for routing schemes in MANETs

Frequent changes in network topologies caused by mobility in mobile ad hoc networks (MANETs) impose great challenges to designing routing schemes for such networks. Various routing schemes each aiming at particular type of MANET (e.g., flat or clustered MANETs) with different mobility degrees (e.g., low, medium, and high mobility) have been proposed in the literature. However, since a mobile node should not be limited to operate in a particular MANET assumed by a routing scheme, an important issue is how to enable a mobile node to achieve routing performance as high as possible when it roams across different types of MANETs. To handle this issue, a quantity that can predict the link status for a time period in the future with the consideration of mobility is required. In this paper, we discuss such a quantity and investigate how well this quantity can be used by the link caching scheme in the dynamic source routing protocol to provide the adaptability to variable topologies caused by mobility through computer simulation in NS-2.     

无线网络中一种高QoS保证的路由协议研究

随着多媒体及实时应用的普及,在移动自组网中为业务流提供服务质量保证现已成为研究热点.提出一种在大规模移动自组网中提供服务质量保证的分段式路由协议.该协议采用直线逼近的方法,逐段建立满足带宽要求且延迟小的路径,并选择到源节点和目的节点连线距离最近的节点作为转发节点.通过分段、独立地维护路由,减小了路由维护的代价,提高了可扩展性.模拟结果表明该路由协议具有路由成功率高、路径短和延迟小等特点.     

A routing layer-based hierarchical service advertisement and discovery for MANETs

The implementation of mobile ad hoc networks (MANETs) is steadily increasing. MANETs are especially popular in locations that lack a fixed communication infrastructure. To achieve zero-configuration MANETs, as well as quick and easy access to network resources, resources must be well managed by the network. This paper proposes a hierarchical service discovery and advertisement protocol (HSDAP) implemented in the routing layer. HSDAP queries services by piggybacking service REQuest (SREQ) packets on routing packets to reduce overhead and energy consumption. We extend the cluster-based routing protocol (CBRP) to improve service management hierarchy. Simulation results show that adding service discovery and advertisement (SDA) functions to CBRP does not significantly affect overhead. SDA overhead, routing overhead, energy consumption, and SDA delay are significantly less than the extended zone routing protocol. Furthermore, SDA hit ratio of the proposed protocol is greater than 86% for various levels of mobility. The proposed HSDAP is robust and scalable.     

Active routing

Active routing permits individual customers, network managers, or network owners to control the paths that their data takes through the network. The objective is to allow routing mechanisms that provide quality of service (QoS), mobility, etc., to be quickly deployed, without waiting for standards, and to allow different routing mechanisms, that provide similar services, to compete. The current work on label switching (MPLS) can also be used to give high level customers, such as virtual private networks (VPNs), more control over their paths. We show how active routing can extend the capabilities of MPLS. We address several implementation issues, including pricing and distributed sandboxes. Pricing or policing must be used to limit the resources that customers acquire, in order to encourage them to use network resources economically. Sandboxes must be used to limit the resources that the participants acquire, in order to limit the harm that they can inflict on other participants. Active routing creates a free market system where network providers compete to sell their resources and implementers compete to sell their active routing programs. We establish a framework to quantitatively compare networks and service providers. As an example, we route Internet protocol (IP) telephony over combinations of circuit and packet networks     

Bandwidth-aware routing and admission control for efficient video streaming over MANETs

In this paper, we develop and evaluate an adaptive self-configurable routing framework that can deal with dynamic nature of mobile ad hoc networks and provides quality-of-service (QoS) guarantees for efficient video streaming. Proposed framework mainly consists of two major components. Firstly, it is a reactive bandwidth-aware node-disjoint multipath routing protocol which determines routes based on the specified bandwidth requirements of the requesting application. The second component of the framework is a session admission control (SAC) process that permits or denies a session to enter into the network based on the current availability of network bandwidth. We also propose methods to handle QoS violations caused by network mobility and congestion by keeping backup routes, performing local route recovery, avoiding routing through short-lived low quality links and periodic monitoring of the active transmission routes. To verify our proposed algorithms, the network with H.264/SVC encoded video traces which are generated from real-time video traffic is used for modeling the behaviour of the source nodes. It has been observed that reactively discovered and maintained routes on the basis of the most recent information about network topology and available resources can significantly improve the admission decision accuracy of SAC process, in turn improving the quality of received video traffic significantly.

     

Urgency-based packet scheduling and routing algorithms for delay-sensitive data over MANETs

This paper proposes urgency-based packet scheduling and routing algorithms to effectively deliver delay-sensitive data over a multi-hop mobile ad hoc networks supporting IEEE 802.11 multi-rate service. First, packet urgency, node urgency, and route urgency are defined on the basis of the end-to-end delay requirement. Based on these urgency metrics and the estimated transmission delay of each packet by Kalman filter, the proposed packet scheduling algorithm determines the transmission order and drop policy to minimize the node urgency without unnecessary packet drop, and the proposed routing algorithm establishes a route to minimize the derivative of route urgency in order to maximize the number of packets delivered within the required end-to-end delay. Finally, experimental results are presented to evaluate the performance of the proposed joint working algorithms.     

Power-efficient routing schemes for MANETs: a survey and open issues

Ubiquitous smart devices with embedded sensors are paving the way for mobile ad hoc networks (MANETs) that enable users to communicate directly, thereby playing a key role in Smart City and Internet of Things applications. In such smart environments, people with smart devices (nodes) can freely self-organize and form self-configuring MANETs to send and forward data packets to a destination over multiple hops via intermediate nodes. However, the energy consumption during routing remains a challenge in such ensemble mobile environments due to the limited battery capacity of mobile devices. This challenging issue has received substantial research attention, necessitating an exhaustive literature search over the variety of academic fields addressing this topic. The main motivation of this paper is to review various power-efficient routing schemes in MANETs that have recently been proposed to reduce the energy consumed when transmitting and receiving packets during active communication. Accordingly, these protocols are classified into six categories: (1) link state-based, (2) source-initiated-based, (3) transmission power control-based, (4) load-balancing-based, (5) location-based and (6) multicast-based routing approaches. The review covers various state-of-the-art protocols for each category and highlights their operation concepts, design challenges and key features. In addition, the various protocols are compared with emphasis on the merits and drawbacks as well as the considered metrics of each scheme. Finally, we provide a conclusion and suggest potential directions for future research in the field.     

Status adaptive routing with delayed rebroadcast scheme in AODV-based MANETs

An efficient solution is proposed in this article to determine the best reliable route and to prolong the lifetime of the mobile Ad-hoc networks （MANETs）. In the proposed solution, the route discovery process of the Ad-hoc on-demand distance vector routing protocol （AODV） has been modified using a novel delayed rebroadcast scheme. It combines the shortest route selection criterion of AODV with the real network status including the wireless link quality, the remaining power capacity, as well as the traffic load at each node. Simulation results show that the proposed scheme can significantly extend the network lifetime and provide fewer packet losses than the conventional AODV protocol.     

Query routing mismatch alleviation architecture for P2P file lookup in MANETs

A cross-layer optimized query routing mismatch alleviation(QRMA)architecture is proposed to mitigate the problem of query routing mismatch(QRM)phenomenon between the structured peer to peer(P2P)overlay and the routing layer in mobile Ad-hoc networks(MANETs),which is an important issue that results in the inefficiency of lookup process in the system.Explicated with the representative Chord protocol,the proposal exploits the information of topologic neighbors in the routing layer of MANETs to find if there is any optimized alternative next hop in P2P overlay during conventional lookup progress.Once an alternative next hop is detected,it will take the shortcut to accelerate the query procedure and therefore alleviate the QRM problem in scalable MANETs without any assistance of affiliation equipments such as GPS device.The probability of finding out such an alternative node is formulated and the factors that could increase the chance are discussed.The simulation results show that the proposed architecture can effectively alleviate the QRM problem and significantly improve the system performance compared with the conventional mechanism.     

Active routing for ad hoc networks

Ad hoc networks are wireless multihop networks whose highly volatile topology makes the design and operation of a standard routing protocol hard. With an active networking approach, one can define and deploy routing logic at runtime in order to adapt to special circumstances and requirements. We have implemented several active ad hoc routing protocols that configure the forwarding behavior of mobile nodes, allowing data packets to be efficiently routed between any two nodes of the wireless network. Isolating a simple forwarding layer in terms of both implementation and performance enables us to stream delay-sensitive audio data over the ad hoc network. In the control plane, active packets permanently monitor the connectivity and setup, and modify the routing state     

Context aware adaptive fuzzy based QoS routing scheme for streaming services over MANETs

The need for an adaptive with support for context service aware Quality of Service routing scheme is always a major research challenge. The complexities of Mobile Ad hoc Networks are well surveyed, but traditional routing protocols do not focus on the context aware nature of services, which is highly required for dynamic change in service requirements. Context Aware Adaptive Fuzzy (COAAF) is a ‘context aware’ protocol, which is adaptive for variable services and network traffic intensity. The behaviour of streaming services is found to be highly variable; hence, fuzzy approach is adopted. COAAF is simulated over NS-2 and its performance analyzed in comparison with AODV, DYMO and GPSR routing schemes.     

Towards an efficient failure detection in MANETs

Mobile ad hoc networks (MANETs) are characterized by a dynamic topology and generally deployed in a hostile environment with limited resources. As a result, the nodes are more vulnerable and are often subject to failures. Therefore, the design of an efficient failure detector in MANETs is a very challenging issue as the detection is proved to be unreliable. Such an achievement amounts to balance between the performances of the accuracy, the completeness and the resource consumption. We present and discuss in this paper a solution for an efficient failure detection in MANETs. This new protocol, called efficient failure detection for MANETs, exploits different mechanisms to improve the completeness and the accuracy of the detection while reducing the traffic overhead. The number of used timers are limited to two for each node thus reducing the complexity of the algorithm. The simulations performed on NS2 platform show the efficiency of efficient failure detection for MANETs comparing with other protocols. Copyright © 2016 John Wiley & Sons, Ltd.     

MQ-Routing: Mobility-, GPS- and energy-aware routing protocol in MANETs for disaster relief scenarios

Mobile-Ad-Hoc-Networks (MANETs) are self-configuring networks of mobile nodes, which communicate through wireless links. The main issues in MANETs include the mobility of the network nodes, the scarcity of computational, bandwidth and energy resources. Thus, MANET routing protocols should explicitly consider network changes and node changes into the algorithm design. MANETs are particularly suited to guarantee connectivity in disaster relief scenarios, which are often impaired by the absence of network infrastructures. Moreover, such scenarios entail strict requirements on the lifetime of the device batteries and on the reactivity to possibly frequent link failures. This work proposes a proactive routing protocol, named MQ-Routing, aimed at maximizing the minimum node lifetime and at rapidly adapting to network topology changes. The proposed protocol modifies the Q-Routing algorithm, developed via Reinforcement Learning (RL) techniques, by introducing: (i) new metrics, which account for the paths availability and the energy in the path nodes, and which are dynamically combined and adapted to the changing network topologies and resources; (ii) a fully proactive approach to assure the protocol usage and reactivity in mobile scenarios. Extensive simulations validate the effectiveness of the proposed protocol, through comparisons with both the standard Q-Routing and the Optimized Link State Routing (OLSR) protocols.