scispace - formally typeset
Search or ask a question

Showing papers on "Hazy Sighted Link State Routing Protocol published in 2017"


Journal ArticleDOI
TL;DR: This paper mathematically formulate the routing selection issue as a constrained optimization problem and proposes an ant colony optimization (ACO)-based algorithm to solve this problem, and a terminal intersection (TI) concept is presented to decrease routing exploration time and alleviate network congestion.
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.

151 citations


Journal ArticleDOI
TL;DR: The results clearly demonstrate that the proposed FF-AOMDV outperformed AomDV and AOMR-LM under majority of the network performance metrics and parameters.
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

150 citations


Journal ArticleDOI
TL;DR: Three algorithms are proposed: cluster-based life-time routing (CBLTR), Intersection dynamic VANET routing (IDVR) protocol, and control overhead reduction algorithm (CORA) that significantly outperform many protocols mentioned in the literature, in terms of many parameters.
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.

101 citations


Journal ArticleDOI
TL;DR: 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 is proposed.
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.

92 citations


Journal ArticleDOI
TL;DR: This paper proposes path observation based physical routing protocol named POPR for WANET that 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.
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

89 citations


Journal ArticleDOI
TL;DR: A routing protocol is proposed for Wireless Sensor Networks which are heterogeneous and are based on the adaptive threshold sensitive distributed energy efficient cross layer routing protocol and the concept of weighted probability is used to assign the CH (Cluster Head) of the network cluster.
Abstract: Wireless Sensor Networks (WSNs) perform an important part in modern day communication as it can sense the various physical and environmental parameters by employing low cost sensor devices. The growth of the networks due to scientific advancements have altogether made it possible to create an energy efficient cross layer network that can improve its lifespan. In this paper, a routing protocol is proposed for the networks which are heterogeneous and are based on the adaptive threshold sensitive distributed energy efficient cross layer routing protocol. The concept of weighted probability is used to assign the CH (Cluster Head) of the network cluster. The proposed algorithm is simulated, tested and compared with previously established routing protocols and has shown enhanced results and prolonged network lifespan. In the proposed protocol, a combination of the proactive and reactive network is considered for effective data transmission.

87 citations


Journal ArticleDOI
TL;DR: 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), which alleviates routing overhead and end-to-end delay with only a slightly decrease in the packet delivery ratio.
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.

81 citations


Proceedings ArticleDOI
21 May 2017
TL;DR: This paper presents a new proposal to implement an intelligent routing protocol in a SDN topology based on the reinforcement learning process that allows choosing the best data transmission paths according to the best criteria andbased on the network status.
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.

77 citations


Journal ArticleDOI
Deyu Lin1, Quan Wang1
TL;DR: A novel routing protocol named Game theory based Energy Efficient Clustering routing protocol (GEEC) is proposed, which belongs to a kind of clustering routing protocols, adopts evolutionary game theory mechanism to achieve energy exhaust equilibrium as well as lifetime extension at the same time.
Abstract: The energy constraint is one of the inherent defects of the Wireless Sensor Networks (WSNs). How to prolong the lifespan of the network has attracted more and more attention. Numerous achievements have emerged successively recently. Among these mechanisms designing routing protocols is one of the most promising ones owing to the large amount of energy consumed for data transmission. The background and related works are described firstly in detail in this paper. Then a game model for selecting the Cluster Head is presented. Subsequently, a novel routing protocol named Game theory based Energy Efficient Clustering routing protocol (GEEC) is proposed. GEEC, which belongs to a kind of clustering routing protocols, adopts evolutionary game theory mechanism to achieve energy exhaust equilibrium as well as lifetime extension at the same time. Finally, extensive simulation experiments are conducted. The experimental results indicate that a significant improvement in energy balance as well as in energy conservation compared with other two kinds of well-known clustering routing protocols is achieved.

70 citations


Journal ArticleDOI
TL;DR: 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.
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.

67 citations


Journal ArticleDOI
TL;DR: A novel protocol that uses Q-learning-based geographic routing (QGeo) to improve the network performance of unmanned robotic networks and finds that QGeo has a higher packet delivery ratio and a lower network overhead than existing methods.
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.

Journal ArticleDOI
TL;DR: A novel infrastructure-based connectivity aware routing protocol called CAR-II that enables multihop vehicular applications, as well as mobile data offloading and Internet-based services, and improves the routing performance in VANETs by dynamically selecting routing paths with guaranteed connectivity and reduced delivery delay.
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.

Journal ArticleDOI
TL;DR: ORR, an opportunistic routing protocol that addresses the two issues of sender wait time and redundant packet forwarding, is proposed and is proven to avoid loops and shown to achieve longer network lifetime compared to other protocols regardless of duty cycle and network topology.
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.

Journal ArticleDOI
TL;DR: 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.
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.

Journal ArticleDOI
Danyang Qin1, Songxiang Yang1, Jia Shuang1, Yan Zhang1, Jingya Ma1, Qun Ding1 
TL;DR: Performance analysis and simulation results show that TSSRM can improve the security and effectiveness of WSN.
Abstract: Aiming at the serious impact of the typical network attacks caused by the limited energy and the poor deployment environment of wireless sensor network (WSN) on data transmission, a trust sensing-based secure routing mechanism (TSSRM) with the lightweight characteristics and the ability to resist many common attacks simultaneously is proposed in this paper, at the same time the security route selection algorithm is also optimized by taking trust degree and QoS metrics into account. Performance analysis and simulation results show that TSSRM can improve the security and effectiveness of WSN.

Journal ArticleDOI
TL;DR: Simulation results show that the proposed routing protocol provide shortest path and disjoint multipath routing for nodes, and its network lifetime is longer than existing algorithms (OLSR, AODV) when traffic load reaches a certain value.

Journal ArticleDOI
TL;DR: Simulation results demonstrate that AECR protocol outperforms state of the art in terms of various performance metrics.
Abstract: Wireless sensor networks (WSNs) have grown excessively due to their various applications and low installation cost. In WSN, the main concern is to reduce energy consumption among nodes while maintaining timely and reliable data forwarding. However, most of the existing energy aware routing protocols incur unbalanced energy consumption, which results in inefficient load balancing and compromised network lifetime. Therefore, the main target of this research paper is to present adaptive energy aware cluster-based routing (AECR) protocol for improving energy conservation and data delivery performance. Our proposed AECR protocol differs from other energy efficient routing schemes in some aspects. Firstly, it generates balance sized clusters based on nodes distribution and avoids random clusters formation. Secondly, it optimizes both intra-cluster and inter-cluster routing paths for improving data delivery performance while balancing data traffic on constructed forwarding routes and at the end, in order to reduce the excessive energy consumption and improving load distribution, the role of Cluster Head (CH) is shifted dynamically among nodes by exploit of network conditions. Simulation results demonstrate that AECR protocol outperforms state of the art in terms of various performance metrics.

Journal ArticleDOI
TL;DR: A Black Hole attack is conducted on a real-world Z-Wave network to demonstrate a well-known routing attack that exploits the exposed vulnerabilities and several recommendations are made to enhance the security of the routing protocol.

Journal ArticleDOI
TL;DR: An energy-efficient multi-hop routing algorithm based on grid clustering to tackle the problems of unbalanced energy consumption of sensor nodes and better performance of energy balance and efficiency in the larger network area is proposed.
Abstract: Due to the limited energy of wireless sensor network nodes, it is necessary to reduce and balance the energy consumption of the nodes in order to extend the network lifetime. Clustering routing algorithm is a very effective solution to the problem. However, in existing clustering algorithms based on uniform and non-uniform clustering routing protocols, the heavy burden of cluster heads may lead to the rapid death of the nodes, and the location of functional nodes within clusters is not carefully considered during clustering. The unbalanced energy consumption of sensor nodes shortens the network lifetime. In this paper, we propose an energy-efficient multi-hop routing algorithm based on grid clustering to tackle the problems. In order to minimize the energy consumption, the algorithm optimizes the electoral process of functional nodes by combining various factors such as nodes' energy, nodes' location, and levels of the network area. Communication nodes are introduced to select cluster head nodes and transfer data between clusters via multi-hop routing, easing the burden of cluster heads. Simulation results show that the network lifetime of the proposed EEMRP protocol is extended by 17.5---25.2%, as compared to other algorithms. Specially, EEMRP has better performance of energy balance and efficiency in the larger network area.

Journal ArticleDOI
TL;DR: Experimental results show that CLOC indeed ensures control application stability and fulfills communication constraints while maximizing the worst case redundancy gain of the system performance.
Abstract: When multiple control processes share a common wireless network, the communication protocol must provide reliable performance in order to yield stability of the overall system. In this paper, the novel cross-layer optimized control (CLOC) protocol is proposed for minimizing the worst case performance loss of multiple industrial control systems. CLOC is designed for a general wireless sensor and actuator network where both sensor to controller and controller to actuator connections are over a multihop mesh network. The design approach relies on a constrained max-min optimization problem, where the objective is to maximize the minimum resource redundancy of the network and the constraints are the stability of the closed-loop control systems and the schedulability of the communication resources. The optimal operation point of the protocol is automatically set in terms of the sampling rate, scheduling, and routing, and is achieved by solving a linear programming problem, which adapts to system requirements and link conditions. The protocol has been experimentally implemented and evaluated on a testbed with off-the-shelf wireless sensor nodes, and it has been compared with a traditional network design and a fixed-schedule approach. Experimental results show that CLOC indeed ensures control application stability and fulfills communication constraints while maximizing the worst case redundancy gain of the system performance.

Journal ArticleDOI
TL;DR: Several additional components for extending LOADng are studied: support for smart route requests and expanding ring search, an extension permitting maintaining collection trees, a fast rerouting extension, and a general framework is also proposed to secure the routing protocol.

Journal ArticleDOI
TL;DR: A new cluster-based on-demand routing protocol to support multihop communication in Bluetooth low energy ad hoc networks and substantially reduces energy consumption, which is the most critical issue on energy constrained networks.
Abstract: This paper proposes a new cluster-based on-demand routing protocol to support multihop communication in Bluetooth low energy ad hoc networks The proposed scheme includes the topology configuration procedure, topology recovery scheme, and on-demand routing protocol The topology configuration procedure consists of node discovery, piconet configuration, and scatternet formation in a randomly distributed environment The proposed on-demand routing protocol is designed to minimize the number of route request messages by forwarding them to a master and relay nodes in each cluster during the route request procedure The performance evaluation shows that our proposed scheme substantially reduces energy consumption, which is the most critical issue on energy constrained networks

Journal ArticleDOI
TL;DR: A spectrum-aware anypath routing (SAAR) scheme is proposed with consideration of both the salient spectrum uncertainty feature of CRNs and the unreliable transmission characteristics of wireless medium, which makes it suitable and scalable to be used in multi-hop CRNs.
Abstract: Cognitive radio networks (CRNs) have been emerging as a promising technique to improve the spectrum efficiency of wireless and mobile networks, which form spectrum clouds to provide services for unlicensed users. As spectrum clouds, the performance of multi-hop CRNs heavily depends on the routing protocol. In this paper, taking the newly proposed Cognitive Capacity Harvesting network as an example, we study the routing problem in multi-hop CRNs and propose a spectrum-aware anypath routing (SAAR) scheme with consideration of both the salient spectrum uncertainty feature of CRNs and the unreliable transmission characteristics of wireless medium. A new cognitive anypath routing metric is designed based on channel and link statistics to accurately estimate and evaluate the quality of an anypath under uncertain spectrum availability. A polynomial-time routing algorithm is also developed to find the best channel and the associated optimal forwarding set and compute the least cost anypath. Extensive simulations show that the proposed protocol SAAR significantly increases packet delivery ratio and reduces end-to-end delay with low communication and computation overhead, which makes it suitable and scalable to be used in multi-hop CRNs.

Journal ArticleDOI
01 Feb 2017
TL;DR: Experiments show that the proposed routing protocol outperforms other work in most cases by reducing the network energy consumption for WSNs by more than 13%, which indicates the feasibility of the authors' approach for efficient and reliable routing protocol in wireless sensor networks.
Abstract: Efficient and reliable routing protocol is one of the key technologies in wireless sensor networks, and it has been concerned by a lot of researchers. In light of the random selection of cluster head in low energy adaptive clustering hierarchy protocol algorithm, the residual energy of nodes, node location and node density are not considered. Through theoretical deduction and mathematical calculation, the study found that it is a NP - hard problem. A swarm intelligence algorithm was introduced into the clustering algorithm of wireless sensor network, and an efficient and reliable clustering algorithm for wireless sensor networks (WSNs) based on quantum artificial bee colony algorithm was proposed. Considering the residual energy of nodes, node location and node density, and the energy consumption of the network is balanced. Experiments show that the proposed routing protocol outperforms other work in most cases by reducing the network energy consumption for WSNs by more than 13%, which indicates the feasibility of the authors' approach for efficient and reliable routing protocol in wireless sensor networks.

Journal ArticleDOI
TL;DR: This paper presents comprehensive survey of Ant Colony Optimization based routing protocols for Wireless Sensor Networks to give better platform for researchers to work on various shortcomings of protocols developed till date to develop efficient routing protocol for WSN in near future.
Abstract: Wireless Sensor Networks have several issues and challenges with regard to Energy Efficiency, Limited Computational capability, Routing Overhead, Packet Delivery and many more. Designing Energy Efficient Routing Protocol has always been a limiting factor cum issue for Wireless Sensor Networks. Varied routing protocols being proposed till date for overcoming these issues based on Swarm Intelligence. Swarm Intelligence is concerned with study of combined behavior of systems designed by varied components for coordinating among themselves via decentralized controls and self-organization. Algorithms based on Swarm Intelligence, nature based intelligence are highly robust, adaptive and scalable. This paper presents comprehensive survey of Ant Colony Optimization based routing protocols for Wireless Sensor Networks to give better platform for researchers to work on various shortcomings of protocols developed till date to develop efficient routing protocol for WSN in near future.

Journal ArticleDOI
TL;DR: A road aware geographical routing protocol for urban vehicular ad hoc networks is proposed that uses distance, direction and traffic density routing metrics to forward the data towards the destination.
Abstract: The new information and communication technologies have changed the trend of communication in all fields. The transportation sector is one of the emerging field, where vehicles are communicating with each other or with infrastructure for different safety and comfort applications in the network. Vehicular ad hoc networks is one of the emerging multi-hop communication type of intelligent transportation field to deal with high mobility and dynamic vehicular traffic to deliver data packets in the network. The high mobility and dynamic topologies make the communication links unreliable and leads to frequent disconnectivity, delay and packet dropping issues in the network. To address these issues, we proposed a road aware geographical routing protocol for urban vehicular ad hoc networks. The proposed routing protocol uses distance, direction and traffic density routing metrics to forward the data towards the destination. The simulation results explore the better performance of proposed protocol in terms of data delivery, network delay and compared it with existing geographical routing protocols.

Proceedings ArticleDOI
01 Jul 2017
TL;DR: Simulation results demonstrate that LEPR significantly outperforms two popular routing protocols, AODV and DSR, in terms of packet delivery ratio, delay and routing overhead, whether in a high or low mobility setting.
Abstract: Flying Ad Hoc Network (FANET) consisting of Unmanned Aerial Vehicles (UAVs) can undertake many tasks difficult for traditional Mobile Ad Hoc Networks (MANETs). However, the highly dynamic topology of FANET imposes difficulties for adopting existing MANET routing protocols. In this paper, we present the Link Stability Estimation-based Preemptive Routing (LEPR) protocol targeting FANET on the basis of AODV, an existing routing protocol for ad hoc networks. Taking advantage of GPS location information of UAVs, a new link stability metric is introduced for LEPR. This new metric uses the link quality, safety degree and mobility prediction factor to take into account the past, current and future statuses of link stability respectively. With this new metric, LEPR calculates multiple robust link-disjoint paths during the route discovery process. In addition, a semi-proactive route maintenance process is initiated when anticipating link breaks. This preemptive mechanism reduces the number of broken paths and packet latency by finding and switching to a more reliable path early. Simulation results demonstrate that LEPR significantly outperforms two popular routing protocols, AODV and DSR, in terms of packet delivery ratio, delay and routing overhead, whether in a high or low mobility setting.

Proceedings ArticleDOI
24 Jun 2017
TL;DR: This paper introduces three theorems that directly lead to routing algorithms with an acyclic channel dependency graph and proposes the partitioning methodology, enabling a design to reach the maximum adaptiveness for the n-dimensional mesh and k-ary n-cube topologies with any given number of channels.
Abstract: Freedom from deadlock is one of the most important issues when designing routing algorithms in on-chip/off-chip networks. Many works have been developed upon Dally's theory proving that a network is deadlock-free if there is no cyclic dependency on the channel dependency graph. However, finding such acyclic graph has been very challenging, which limits Dally's theory to networks with a low number of channels. In this paper, we introduce three theorems that directly lead to routing algorithms with an acyclic channel dependency graph. We also propose the partitioning methodology, enabling a design to reach the maximum adaptiveness for the n-dimensional mesh and k-ary n-cube topologies with any given number of channels. In addition, deadlock-free routing algorithms can be derived ranging from maximally fully adaptive routing down to deterministic routing. The proposed theorems can drastically remove the difficulties of designing deadlock-free routing algorithms.

Journal ArticleDOI
TL;DR: This research work aims to establish guidelines for future research and development in the area of Wireless Sensor Networks (WSNs) based on the critical analysis of the prevalent multi-channel based routing protocols for WSNs.

Journal ArticleDOI
TL;DR: Widespread packet - level simulation in ns-2 environment, shows that AIS-OL SR outperforms OLSR and EA-OLSR in terms of packet delivery ratio, throughput, end-end delay and lifetime.
Abstract: Characteristics of the mobile ad-hoc networks such as nodes high mobility and limited energy are regarded as the routing challenges in these networks. OLSR protocol is one of the routing protocols in mobile ad hoc network that selects the shortest route between source and destination through Dijkstra's algorithm. However, OLSR suffers from a major problem. It does not consider parameters such as nodes’ energy level and links length in its route processing. This paper employs the artificial immune system (AIS) to enhance efficiency of OLSR routing protocol. The proposed algorithm, called AIS-OLSR, considers hop count, remaining energy in the intermediate nodes, and distance among node, which is realized by negative selection and ClonalG algorithms of AIS. Widespread packet - level simulation in ns-2 environment, shows that AIS-OLSR outperforms OLSR and EA-OLSR in terms of packet delivery ratio, throughput, end-end delay and lifetime.