An advanced forwarding routing protocol for urban scenarios in VANETs

2017 ◽  
Vol 13 (4) ◽  
pp. 334-344 ◽  
Author(s):  
Sushil Kumar ◽  
Anil Kumar Verma

Purpose The purpose of this paper is to give an insight in to the routing protocols in Vehicular ad hoc Network (VANET). In this direction, for the efficient data dissemination in VANETs, a street-based forwarding protocol (SBFP) has been proposed. Design/methodology/approach The interferences among different street segments are considered and a unique street-based forwarding concept is introduced to reduce the local maximum problem. In this protocol, the greedy forwarding concept along with the broadcasting mechanism and suppression technique is implemented to minimize the overhead created in the regular beacons forwarding processes. QualNet simulator is used to implement and simulate SBFP. SUMO and MOVE tools are used to create the vehicle’s movement pattern and network topology. Findings The simulated results demonstrated improved packet delivery ratio (PDR) with a minimum average number of broadcast by each individual vehicle in the proposed SBFP than in its peer protocols. Originality/value This paper will be discussing a unique street-based forwarding technique exploring the advantages of global positioning system to obtain the location of vehicles and streets. This technique results in higher PDR and reduced network overhead.

2018 ◽  
Vol 26 (3) ◽  
pp. 25-36
Author(s):  
Deo Prakash ◽  
Neeraj Kumar ◽  
M.L. Garg

Mobile Adhoc Network (MANET) is a dynamic network without any centralized control. Due to frequent topological change, routing has been always a challenging task in these networks. This article presents optimized routing for efficient data dissemination in MANETs to meet the fast-changing technology of today's world. A novel metric for such optimized routing in MANET is proposed. The main parameters considered to evaluate this metric are the energy consumed during the communication, link stability, Packet Delivery Ratio (PDR) and traffic. The concept is based on a scenario in which a mobile node (source) sends data packets to another mobile node (destination) through its dynamically connected neighboring nodes. The path which consumes the lowest energy and also shows highest link stability is selected for consideration. In case the paths consume the same amount of energy, the highest stable path is chosen. In this manner, the most optimized path is selected. The authors' routing approach shows more efficiency than earlier in dissemination of data and information over the Mobile Ad-Hoc Networks.


Author(s):  
Yahya M. Tashtoush ◽  
Mohammad A. Alsmirat ◽  
Tasneem Alghadi

Purpose The purpose of this paper is to propose, a new multi-path routing protocol that distributes packets over the available paths between a sender and a receiver in a multi-hop ad hoc network. We call this protocol Geometric Sequence Based Multipath Routing Protocol (GMRP). Design/methodology/approach GMRP distributes packets according to the geometric sequence. GMRP is evaluated using GloMoSim simulator. The authors use packet delivery ratio and end-to-end delay as the comparison performance metrics. They also vary many network configuration parameters such as number of nodes, transmission rate, mobility speed and network area. Findings The simulation results show that GMRP reduces the average end-to-end delay by up to 49 per cent and increases the delivery ratio by up to 8 per cent. Originality/value This study is the first to propose to use of geometric sequence in the multipath routing approach.


Data dissemination is a high level application service, provided to WSN to update the configuration parameter to make the node perform intended services. The configuration parameters of the nodes are updated by means of reprogramming and reconfiguration through over air programming. In data dissemination, the data are so sensitive that even a small change in a data will lead to data corruption and nodes will not perform intended services. In most of the existing systems, providing energy efficient secured data dissemination is a major concern. The attackers can interrupt the process data dissemination and launch various types of attacks, In-order to overcome these challenges. In this paper, a novel Secure Based Dissemination protocol is proposed which can provide energy efficient data dissemination. The proposed protocol ensures better authentication during data dissemination. The proposed protocol is implemented in NS2 simulator. Simulation results justifies that, proposed protocol output forms the existing techniques and has better Packet Delivery Ratio, throughput , network life time, energy consumption, end to end delay and routing overhead .


2015 ◽  
Vol 37 ◽  
pp. 399
Author(s):  
Sogand Sahabi Moghaddam ◽  
Abbas Karimi

Multicast data replication provides a possible solution for improving data accessibility in highly dynamic and fault prone mobile ad hoc environments. Our novel multicast data replication approach operates in a self-organizing manner where the network nodes that has unit host detector construct a connected dominating set (CDS) based on the topology graph by collecting information from neighboring nodes using multicast if gathered data from neighbors have two non-adjacent neighbors then use that virtual backbone for efficient data replication, data search and routing. In this study, we compare our proposed approach with SCALAR and evaluate it in average hop counts and successful delivery ratio with different node numbers and speeds.It is shown that the average hop counts increased but with falling rate and 20 percent successful delivery ratio is achieved, so it is demonstrated that PM act with respect to fault tolerance improvement, power consumption and load balancing is occurred.


Energies ◽  
2018 ◽  
Vol 11 (8) ◽  
pp. 2073
Author(s):  
Seho Han ◽  
Kisong Lee ◽  
Hyun-Ho Choi ◽  
Howon Lee

In opportunistic device-to-device (D2D) networks, the epidemic routing protocol can be used to optimize the message delivery ratio. However, it has the disadvantage that it causes excessive coverage overlaps and wastes energy in message transmissions because devices are more likely to receive duplicates from neighbors. We therefore propose an efficient data dissemination algorithm that can reduce undesired transmission overlap with little performance degradation in the message delivery ratio. The proposed algorithm allows devices further away than the k-th furthest distance from the source device to forward a message to their neighbors. These relay devices are determined by analysis based on a binomial point process (BPP). Using a set of intensive simulations, we present the resulting network performances with respect to the total number of received messages, the forwarding efficiency and the actual number of relays. In particular, we find the optimal number of relays to achieve almost the same message delivery ratio as the epidemic routing protocol for a given network deployment. Furthermore, the proposed algorithm can achieve almost the same message delivery ratio as the epidemic routing protocol while improving the forwarding efficiency by over 103% when k≥10.


Electronics ◽  
2020 ◽  
Vol 9 (7) ◽  
pp. 1129
Author(s):  
Dimitris Kanellopoulos ◽  
Varun Kumar Sharma

Mobile ad hoc networks (MANETs) possess numerous and unique characteristics, such as high channel error-rate, severe link-layer contentions, frequent link breakage (due to node mobility), and dissimilar path properties (e.g., bandwidth, delay, and loss rate) that make these networks different from the traditional ones. These characteristics seriously interfere with communication and hence, ultimately degrade the overall performance in terms of end-to-end delay, packet delivery ratio, network throughput, and network overhead. The traditional referenced layered strict architecture is not capable of dealing with MANET characteristics. Along with this, the most important apprehension in the intent of MANETs is the battery-power consumption, which relies on non-renewable sources of energy. Even though improvements in battery design have not yet reached that great a level, the majority of the routing protocols have not emphasized energy consumption at all. Such a challenging aspect has gained remarkable attention from the researchers, which inspired us to accomplish an extensive literature survey on power-aware optimization approaches in MANETs. This survey comprehensively covers power-aware state-of-the-art schemes for each suggested group, major findings, crucial structures, advantages, and design challenges. In this survey, we assess the suggested power-aware policies in the past in every aspect so that, in the future, other researchers can find new potential research directions.


2012 ◽  
Vol 8 (4) ◽  
pp. 186146 ◽  
Author(s):  
Fan Li ◽  
Lei Zhao ◽  
Xiumei Fan ◽  
Yu Wang

Efficient data delivery in vehicular sensor networks is still a challenging research issue. Position-based routing protocols have been proven to be more suitable for dynamic vehicular networks or large-scale mobile sensor networks than traditional ad hoc routing protocols. However, position-based routing assumes that intermediate nodes can always be found to set up an end-to-end connection between the source and the destination; otherwise, it suffers from network partitions which are very common in vehicular networks and leads to poor performances. This paper addresses data delivery challenge in the possible intermittently connected vehicular sensor networks by combining position-based forwarding strategy with store-carry-forward routing scheme from delay tolerant networks. The proposed routing method makes use of vehicle driving direction to determine whether holding or forwarding the packet. Experimental results show that the proposed mechanism outperforms existing position-based solutions in terms of packet delivery ratio.


Sign in / Sign up

Export Citation Format

Share Document