Showing papers on "Optimized Link State Routing Protocol published in 2017"

A Comparative Survey of VANET Clustering Techniques

Abstract: A vehicular ad hoc network (VANET) is a mobile ad hoc network in which network nodes are vehicles—most commonly road vehicles. VANETs present a unique range of challenges and opportunities for routing protocols due to the semi-organized nature of vehicular movements subject to the constraints of road geometry and rules, and the obstacles which limit physical connectivity in urban environments. In particular, the problems of routing protocol reliability and scalability across large urban VANETs are currently the subject of intense research. Clustering can be used to improve routing scalability and reliability in VANETs, as it results in the distributed formation of hierarchical network structures by grouping vehicles together based on correlated spatial distribution and relative velocity. In addition to the benefits to routing, these groups can serve as the foundation for accident or congestion detection, information dissemination and entertainment applications. This paper explores the design choices made in the development of clustering algorithms targeted at VANETs. It presents a taxonomy of the techniques applied to solve the problems of cluster head election, cluster affiliation, and cluster management, and identifies new directions and recent trends in the design of these algorithms. Additionally, methodologies for validating clustering performance are reviewed, and a key shortcoming—the lack of realistic vehicular channel modeling—is identified. The importance of a rigorous and standardized performance evaluation regime utilizing realistic vehicular channel models is demonstrated.

MoZo: A Moving Zone Based Routing Protocol Using Pure V2V Communication in VANETs

Abstract: Vehicular Ad-hoc Networks (VANETs) are an emerging field, whereby vehicle-to-vehicle communications can enable many new applications such as safety and entertainment services. Most VANET applications are enabled by different routing protocols. The design of such routing protocols, however, is quite challenging due to the dynamic nature of nodes (vehicles) in VANETs. To exploit the unique characteristics of VANET nodes, we design a moving-zone based architecture in which vehicles collaborate with one another to form dynamic moving zones so as to facilitate information dissemination. We propose a novel approach that introduces moving object modeling and indexing techniques from the theory of large moving object databases into the design of VANET routing protocols. The results of extensive simulation studies carried out on real road maps demonstrate the superiority of our approach compared with both clustering and non-clustering based routing protocols.

Adaptive Quality-of-Service-Based Routing for Vehicular Ad Hoc Networks With Ant Colony Optimization

Abstract: Developing highly efficient routing protocols for vehicular ad hoc networks (VANETs) is a challenging task, mainly due to the special characters of such networks: large-scale sizes, frequent link disconnections, and rapid topology changes. In this paper, we propose an adaptive quality-of-service (QoS)-based routing for VANETs called AQRV. This new routing protocol adaptively chooses the intersections through which data packets pass to reach the destination, and the selected route should satisfy the QoS constraints and fulfil the best QoS in terms of three metrics, namely connectivity probability, packet delivery ratio (PDR), and delay. To achieve the given objectives, we mathematically formulate the routing selection issue as a constrained optimization problem and propose an ant colony optimization (ACO)-based algorithm to solve this problem. In addition, a terminal intersection (TI) concept is presented to decrease routing exploration time and alleviate network congestion. Moreover, to decrease network overhead, we propose local QoS models (LQMs) to estimate real time and complete QoS of urban road segments. Simulation results validate our derived LQM models and show the effectiveness of AQRV.

Energy Efficient Multipath Routing Protocol for Mobile Ad-Hoc Network Using the Fitness Function

Abstract: Mobile ad hoc network (MANET) is a collection of wireless mobile nodes that dynamically form a temporary network without the reliance of any infrastructure or central administration Energy consumption is considered as one of the major limitations in MANET, as the mobile nodes do not possess permanent power supply and have to rely on batteries, thus reducing network lifetime as batteries get exhausted very quickly as nodes move and change their positions rapidly across MANET This paper highlights the energy consumption in MANET by applying the fitness function technique to optimize the energy consumption in ad hoc on demand multipath distance vector (AOMDV) routing protocol The proposed protocol is called AOMDV with the fitness function (FF-AOMDV) The fitness function is used to find the optimal path from source node to destination node to reduce the energy consumption in multipath routing The performance of the proposed FF-AOMDV protocol has been evaluated by using network simulator version 2, where the performance was compared with AOMDV and ad hoc on demand multipath routing with life maximization (AOMR-LM) protocols, the two most popular protocols proposed in this area The comparison was evaluated based on energy consumption, throughput, packet delivery ratio, end-to-end delay, network lifetime and routing overhead ratio performance metrics, varying the node speed, packet size, and simulation time The results clearly demonstrate that the proposed FF-AOMDV outperformed AOMDV and AOMR-LM under majority of the network performance metrics and parameters

Information-centric mobile ad hoc networks and content routing

Abstract: As the future Internet architecture, information centric networking(ICN) can also offer superior architectural support for mobile ad hoc networking. Therefore, information-centric mobile ad hoc networks (ICMANET), a new cross-cutting research area, is gradually forming. In the paper, we firstly introduce the current advances in ICN and analyze its development trends, and then interpret the formation of ICMANET and sketch an overview of it. Subsequently, we define a concept model for content routing and categorize the content routing into proactive, reactive and opportunistic types, and then detail the representative schemes. Finally, the existing issues are summarized. The goal of the work is to provide the references and guidelines for readers approaching study on the new area.

A Comprehensive Survey on Hierarchical-Based Routing Protocols for Mobile Wireless Sensor Networks: Review, Taxonomy, and Future Directions

Abstract: Introducing mobility to Wireless Sensor Networks (WSNs) puts new challenges particularly in designing of routing protocols. Mobility can be applied to the sensor nodes and/or the sink node in the network. Many routing protocols have been developed to support the mobility of WSNs. These protocols are divided depending on the routing structure into hierarchical-based, flat-based, and location-based routing protocols. However, the hierarchical-based routing protocols outperform the other routing types in saving energy, scalability, and extending lifetime of Mobile WSNs (MWSNs). Selecting an appropriate hierarchical routing protocol for specific applications is an important and difficult task. Therefore, this paper focuses on reviewing some of the recently hierarchical-based routing protocols that are developed in the last five years for MWSNs. This survey divides the hierarchical-based routing protocols into two broad groups, namely, classical-based and optimized-based routing protocols. Also, we present a detailed classification of the reviewed protocols according to the routing approach, control manner, mobile element, mobility pattern, network architecture, clustering attributes, protocol operation, path establishment, communication paradigm, energy model, protocol objectives, and applications. Moreover, a comparison between the reviewed protocols is investigated in this survey depending on delay, network size, energy-efficiency, and scalability while mentioning the advantages and drawbacks of each protocol. Finally, we summarize and conclude the paper with future directions.

Robust and Reliable Predictive Routing Strategy for Flying Ad-Hoc Networks

Abstract: Ever-increasing demands for portable and flexible communications have led to rapid growth in networking between unmanned aerial vehicles often referred to as flying ad-hoc networks (FANETs). Existing mobile ad hoc routing protocols are not suitable for FANETs due to high-speed mobility, environmental conditions, and terrain structures. In order to overcome such obstacles, we propose a combined omnidirectional and directional transmission scheme, together with dynamic angle adjustment. Our proposed scheme features hybrid use of unicasting and geocasting routing using location and trajectory information. The prediction of intermediate node location using 3-D estimation and directional transmission toward the predicted location, enabling a longer transmission range, allows keeping track of a changing topology, which ensures the robustness of our protocol. In addition, the reduction in path re-establishment and service disruption time to increase the path lifetime and successful packet transmissions ensures the reliability of our proposed strategy. Simulation results verify that our proposed scheme could significantly increase the performance of flying ad hoc networks.

Routing in Vehicular Ad-hoc Networks: A Survey on Single- and Cross-Layer Design Techniques, and Perspectives

Abstract: Vehicular ad-hoc networks (VANETs) play an important role in intelligent transportation systems for improving security and efficiency. However, due to dynamic characteristics of the vehicular environment, routing remains a significant challenge in the VANETs. While single-layer routing protocols based on the traditional layered open systems interconnection (OSI) model are readily available, they often do not make use of important parameters at the lower three layers of the OSI model when making routing decision. Hence, for making optimal routing decision to gain superior network performance, there is a need to design cross-layer routing that allows information exchange between layers. In this article, a survey of the existing single-layer and cross-layer routing techniques in VANETs is presented, emphasizing on cross-layer routing protocols that utilize information at the physical, medium access control and network layers as routing parameters. An overview and challenges of routing are given, followed by a brief discussion of single-layer routing with more focus on geographic routing. Cross-layer routing protocols are then discussed in detail. The article then elaborates on some advantages and disadvantages of the existing routing approaches, cross-layer routing parameter selection and cross-layer design issues. Finally, some open research challenges in developing efficient routing protocols in the VANETs are highlighted.

Performance Improvement of Cluster-Based Routing Protocol in VANET

Abstract: Vehicular ad-hoc NETworks (VANETs) have received considerable attention in recent years, due to its unique characteristics, which are different from mobile ad-hoc NETworks, such as rapid topology change, frequent link failure, and high vehicle mobility. The main drawback of VANETs network is the network instability, which yields to reduce the network efficiency. In this paper, we propose three algorithms: cluster-based life-time routing (CBLTR) protocol, Intersection dynamic VANET routing (IDVR) protocol, and control overhead reduction algorithm (CORA). The CBLTR protocol aims to increase the route stability and average throughput in a bidirectional segment scenario. The cluster heads (CHs) are selected based on maximum lifetime among all vehicles that are located within each cluster. The IDVR protocol aims to increase the route stability and average throughput, and to reduce end-to-end delay in a grid topology. The elected intersection CH receives a set of candidate shortest routes (SCSR) closed to the desired destination from the software defined network. The IDVR protocol selects the optimal route based on its current location, destination location, and the maximum of the minimum average throughput of SCSR. Finally, the CORA algorithm aims to reduce the control overhead messages in the clusters by developing a new mechanism to calculate the optimal numbers of the control overhead messages between the cluster members and the CH. We used SUMO traffic generator simulators and MATLAB to evaluate the performance of our proposed protocols. These protocols significantly outperform many protocols mentioned in the literature, in terms of many parameters.

A secure and trust based on-demand multipath routing scheme for self-organized mobile ad-hoc networks

Abstract: A mobile ad hoc network (MANET) is a self-configurable network connected by wireless links. This type of network is only suitable for provisional communication links as it is infrastructure-less and there is no centralized control. Providing QoS and security aware routing is a challenging task in this type of network due to dynamic topology and limited resources. The main purpose of secure and trust based on-demand multipath routing is to find trust based secure route from source to destination which will satisfy two or more end to end QoS constraints. In this paper, the standard ad hoc on-demand multi-path distance vector protocol is extended as the base routing protocol to evaluate this model. The proposed mesh based multipath routing scheme to discover all possible secure paths using secure adjacent position trust verification protocol and better link optimal path find by the Dolphin Echolocation Algorithm for efficient communication in MANET. The performance analysis and numerical results show that our proposed routing protocol produces better packet delivery ratio, reduced packet delay, reduced overheads and provide security against vulnerabilities and attacks.

Path Observation Based Physical Routing Protocol for Wireless Ad Hoc Networks

Abstract: Wireless ad hoc networks are going to be an emerged multi-hop communication exploit among mobiles to deliver data packets The special characteristics of Wireless network make the communication link between mobiles to be unreliable To handle high mobility and environmental obstacles, most of physical routing protocols do not consider stable links during packet transmission which lead to higher delay and packet dropping in network In this paper, we propose path observation based physical routing protocol named POPR for WANET The proposed routing protocol incorporates relative distance, direction and mid-range forwarder node with traffic density to forward the data toward destination in order to improve physical forwarding between and at the intersection Simulation results show that the proposed routing protocol performs better as compared to existing solutions

Geographical awareness hybrid routing protocol in Mobile Ad Hoc Networks

Abstract: This paper proposes a geographical awareness routing protocol based on a hybrid routing protocol, the Zone Routing Protocol (ZRP), in Mobile Ad Hoc Networks (MANETs). ZRP is created from combining proactive routing protocol and on-demand routing protocol; therefore, it inherits the advantages of both these routing protocols. The long delay time of the on-demand routing protocol and the huge routing overhead of the proactive routing approach are reduced in ZRP. However, ZRP still produces a large amount of redundant routing overhead in the route discovery process, which not only wastes energy but also increases the workload of the network, while limited bandwidth is a challenge for MANETs. To mitigate routing overhead, a geographical awareness approach that is applied to limit the discovered route area in ZRP is proposed and is called the Geographical awareness ZRP (GeoZRP). Simulation results confirm that the proposed algorithm alleviates routing overhead and end-to-end delay with only a slightly decrease in the packet delivery ratio.

Including artificial intelligence in a routing protocol using Software Defined Networks

Abstract: Software defined network (SDN) is one of the most interesting research topic that is currently being investigated. The inclusion of artificial intelligence (AI) can improve the performance of routing protocols. Nowadays the application of AI over routing protocols is only applied to real devices, especially in wireless sensor nodes. In this paper, we present a new proposal to implement an intelligent routing protocol in a SDN topology. The intelligent routing protocol is based on the reinforcement learning process that allows choosing the best data transmission paths according to the best criteria and based on the network status.

Delay Analysis and Routing for Two-Dimensional VANETs Using Carry-and-Forward Mechanism

Abstract: For disconnected Vehicular Ad hoc NETworks (VANETs), the carry-and-forward mechanism is promising to ensure the delivery success ratio at the cost of a longer delay, as the vehicle travel speed is much lower than the wireless signal propagation speed. Estimating delay is critical to select the paths with low delay, and is also challenging given the random topology and high mobility, and the difficulty to let the message propagate along the selected path. In this paper, we first propose a simple yet effective propagation strategy considering bidirectional vehicle traffic for two-dimensional VANETs, so the opposite-direction vehicles can be used to accelerate the message propagation and the message can largely follow the selected path. Focusing on the propagation delay, an analytical framework is developed to quantify the expected path delay. Using the analytical model, a source node can apply the shortest-path algorithm to select the path with the lowest expected delay. Performance evaluation by simulation show that, when the vehicle density is uneven but known, the proposed Minimum Delay Routing Algorithm can achieve a substantial reduction in delay compared with the geocast-routing approach, and its performance is close to the flooding-based Epidemic algorithm, while our solution maintains only a single copy of the message.

A Survey of Ant Colony Optimization Based Routing Protocols for Mobile Ad Hoc Networks

Abstract: Developing highly efficient routing protocols for Mobile Ad hoc NETworks (MANETs) is a challenging task. In order to fulfill multiple routing requirements, such as low packet delay, high packet delivery rate, and effective adaptation to network topology changes with low control overhead, and so on, new ways to approximate solutions to the known NP-hard optimization problem of routing in MANETs have to be investigated. Swarm intelligence (SI)-inspired algorithms have attracted a lot of attention, because they can offer possible optimized solutions ensuring high robustness, flexibility, and low cost. Moreover, they can solve large-scale sophisticated problems without a centralized control entity. A successful example in the SI field is the ant colony optimization (ACO) meta-heuristic. It presents a common framework for approximating solutions to NP-hard optimization problems. ACO has been successfully applied to balance the various routing related requirements in dynamic MANETs. This paper presents a comprehensive survey and comparison of various ACO-based routing protocols in MANETs. The main contributions of this survey include: 1) introducing the ACO principles as applied in routing protocols for MANETs; 2) classifying ACO-based routing approaches reviewed in this paper into five main categories; 3) surveying and comparing the selected routing protocols from the perspective of design and simulation parameters; and 4) discussing open issues and future possible design directions of ACO-based routing protocols.

SCOTRES: Secure Routing for IoT and CPS

Abstract: Wireless ad-hoc networks are becoming popular due to the emergence of the Internet of Things and cyber-physical systems (CPSs). Due to the open wireless medium, secure routing functionality becomes important. However, the current solutions focus on a constrain set of network vulnerabilities and do not provide protection against newer attacks. In this paper, we propose SCOTRES—a trust-based system for secure routing in ad-hoc networks which advances the intelligence of network entities by applying five novel metrics. The energy metric considers the resource consumption of each node, imposing similar amount of collaboration, and increasing the lifetime of the network. The topology metric is aware of the nodes’ positions and enhances load-balancing. The channel-health metric provides tolerance in periodic malfunctioning due to bad channel conditions and protects the network against jamming attacks. The reputation metric evaluates the cooperation of each participant for a specific network operation, detecting specialized attacks, while the trust metric estimates the overall compliance, safeguarding against combinatorial attacks. Theoretic analysis validates the security properties of the system. Performance and effectiveness are evaluated in the network simulator 2, integrating SCOTRES with the DSR routing protocol. Similar schemes are implemented using the same platform in order to provide a fair comparison. Moreover, SCOTRES is deployed on two typical embedded system platforms and applied on real CPSs for monitoring environmental parameters of a rural application on olive groves. As is evident from the above evaluations, the system provides the highest level of protection while retaining efficiency for real application deployments.

Wireless SDN mobile ad hoc network: From theory to practice

Abstract: A promising approach for dealing with the increasing demand of data traffic is the use of device-to-device (D2D) technologies, in particular when the destination can be reached directly, or though few retransmissions by peer devices. Thus, the cellular network can offload local traffic that is transmitted by an ad hoc network, e.g., a mobile ad hoc network (MANET), or a vehicular ad hoc network (VANET). The cellular base station can help coordinate all the devices in the ad hoc network by reusing the software tools developed for software-defined networks (SDNs), which divide the control and the data messages, transmitted in two separate interfaces. In this paper, we present a practical implementation of an SDN MANET, describe in detail the software components that we adopted, and provide a repository for all the new components that we developed. This work can be a starting point for the wireless networking community to design new testbeds with SDN capabilities that can have the advantages of D2D data transmissions and the flexibility of a centralized network management. In order to prove the feasibility of such a network, we also showcase the performance of the proposed network implemented in real devices, as compared to a distributed ad hoc network.

E2HRC: An Energy-Efficient Heterogeneous Ring Clustering Routing Protocol for Wireless Sensor Networks

Abstract: A heterogeneous ring domain communication topology with equal area in each ring is presented in this paper in an effort to solve the energy balance problem in original IPv6 routing protocol for low power and lossy networks (RPL). A new clustering algorithm and event-driven cluster head rotation mechanism are also proposed based on this topology. The clustering information announcement message and clustering acknowledgment message were designed according to RFC and original RPL message structure. An energy-efficient heterogeneous ring clustering (E2HRC) routing protocol for wireless sensor networks is then proposed and the corresponding routing algorithms and maintenance methods are established. Related messages are analyzed in detail. Experimental results show that in comparison against the original RPL, the E2HRC routing protocol more effectively balances wireless sensor network energy consumption, thus decreasing both node energy consumption and the number of control messages.

QGeo: Q-Learning-Based Geographic Ad Hoc Routing Protocol for Unmanned Robotic Networks

Abstract: This letter proposes a novel protocol that uses Q-learning-based geographic routing (QGeo) to improve the network performance of unmanned robotic networks. A rapid and reliable network is essential for the remote control and monitoring of mobile robotic devices. However, controlling the network overhead required for route selection and repair is still a notable challenge, owing to high mobility of the devices. To alleviate this problem, we propose a machine-learning-based geographic routing scheme to reduce network overhead in high-mobility scenarios. We evaluate the performance of QGeo in comparison with other methods using the NS-3 simulator. We find that QGeo has a higher packet delivery ratio and a lower network overhead than existing methods.

$i$CAR-II: Infrastructure-Based Connectivity Aware Routing in Vehicular Networks

Abstract: With the high demand of mobile Internet services, vehicular ad hoc networks (VANETs) have become a promising technology to enable vehicular Internet access. However, the development of a reliable routing protocol to route data packets between vehicles and infrastructure gateways is still a challenging task due to the high mobility and frequent changes of the network topology. The conventional position-based routing (PBR) in VANETs can neither guarantee the existence of a routing path between the source and the destination prior to the transmission nor provide connection duration information, which makes it unsuitable to route Internet packets. In this paper, we propose a novel infrastructure-based connectivity aware routing protocol called $i$ CAR-II that enables multihop vehicular applications, as well as mobile data offloading and Internet-based services. $i$ CAR-II consists of a number of algorithms triggered and run by vehicles to predict local network connectivity and update location servers with real-time network information, in order to construct a global network topology. By providing real-time connectivity awareness, $i$ CAR-II improves the routing performance in VANETs by dynamically selecting routing paths with guaranteed connectivity and reduced delivery delay. Detailed analysis and simulation-based evaluations of $i$ CAR-II demonstrate the validity of using VANETs for mobile data offloading and the significant improvement of VANETs performance in terms of packet delivery ratio and end to end delay.

Research and Simulation of Queue Management Algorithms in Ad Hoc Networks Under DDoS Attack

Abstract: Concentrating on the influence of DDoS applied to ad hoc networks, we introduced three classic queue management algorithms: Drop-Tail, random early detection (RED), and random exponential marking (REM). We analyzed and compared the defensive abilities of these algorithms applied to ad hoc networks with NS2 under DDoS attack. The results showed that active queue management algorithms, such as REM and RED, exhibited stronger defensive abilities than the passive queue management algorithm Drop-Tail under medium- and small-scale DDoS attacks; however, under large-scale DDoS attack, all three algorithms exhibited insufficient defensive capabilities. This means that other defense schemes, such as network detection, must be integrated into security schemes to defeat DDoS attacks.

Contradiction Based Gray-Hole Attack Minimization for Ad-Hoc Networks

Abstract: Although quite popular for the protection for ad-hoc networks (MANETs, IoT, VANETs, etc), detection & mitigation techniques only function after the attack has commenced Prevention, however, attempts at thwarting an attack before it is executed Both techniques can be realized either by the collective collaboration of network nodes (ie, adding security messages to protocols) or by internal deduction of attack state In this paper, we propose a method for minimizing the gray-hole DoS attack Our solution assumes no explicit node collaboration, with each node using only internal knowledge gained by routine routing information The technique was evaluated using five different threat models (different attacker capabilities), allowing for a better understanding of the attack surface and its prevention Our simulation results show a decrease of up to 51 percent in previously dropped packet, greatly minimizing gray-hole attack effectiveness

Load-Balanced Opportunistic Routing for Duty-Cycled Wireless Sensor Networks

Abstract: In duty-cycled wireless sensor networks running asynchronous MAC protocols, the time when a sender waits for its receiver to wake up and receive the packet is the major source of energy consumption. Opportunistic routing can reduce the sender wait time by allowing multiple candidate receivers, but by doing that it suffers from redundant packet forwarding due to multiple receivers waking up at the same time. Thus, the number of forwarders should be controlled in a way that overall forwarding cost is minimized considering both sender wait time and cost of redundant packet forwarding. Also, in order to prolong network lifetime, candidate forwarders should be selected so that load is balanced among nodes. We propose ORR, an opportunistic routing protocol that addresses the two issues. First, the optimal number of forwarders is calculated based on forwarding cost estimation, which is derived from duty cycle and network topology. Second, the metric used for selecting forwarders considers residual energy so that more traffic is guided through nodes with larger remaining energy. The resulting routing protocol is proven to avoid loops and shown to achieve longer network lifetime compared to other protocols regardless of duty cycle and network topology.

Energy-Efficient Hierarchical Routing for Wireless Sensor Networks: A Swarm Intelligence Approach

Abstract: Energy efficient routing in wireless sensor networks (WSNs) require non-conventional paradigm for design and development of power aware protocols. Swarm intelligence (SI) based metaheuristic can be applied for optimal routing of data, in an energy constraint WSNs environment. In this paper, we present BeeSwarm, a SI based energy-efficient hierarchical routing protocol for WSNs. Our protocol consists of three phases: (1) Set-up phase-BeeCluster, (2) Route discovery phase-BeeSearch and (3) Data transmission phase-BeeCarrier. Integration of three phases for clustering, data routing and transmission, is the key aspect of our proposed protocol, which ultimately contributes to its robustness. Evaluation of simulation results show that BeeSwarm perform better in terms of packet delivery, energy consumption and throughput with increased network life compared to other SI based hierarchical routing protocols.