Data dissemination model using Epidemic and Transmission-Segment-based Geographic Routing protocol: a new perspective in vehicular ad hoc networks

2021 ◽  
Vol 14 (2) ◽  
pp. 287-301
Author(s):  
Ravi Kumar D.N.S. ◽  
Barani S.
Keyword(s):  
Data Dissemination ◽  
Research Work ◽  
High Mobility ◽  
Geographic Routing ◽  
Link Quality ◽  
Traffic Density ◽  
Delivery Ratio ◽  
Timely Manner ◽  
Content Type ◽  
Head Node

PurposeThe purpose of this paper is to introduce a new data dissemination model in order to improve the performance of transmission in VANET. It proposes a protocol named Epidemic and Transmission-Segment-based Geographic Routing (ETSGR) and outlining the issues due to high mobility of nodes and uncertain physical topologies in the network. The proposed ETSGR is mainly used to analyze the vehicle state, direction, distance, traffic density and link quality of the network.Design/methodology/approachThis research work based on ETSGR protocol mainly uses epidemic algorithm in order to find the vehicle state based on susceptible, infected and recovered (SIR) model. Furthermore, the vehicle position and finding the head node in the network is utilized using the transmission segment protocol based on geographic routing and analyses each node to form the segments and find the destination to transmit the data in timely manner.FindingsThe paper provides the enhancement of the performance based on some metrics such as end-to-end delay that obtained 0.62%, data throughput as 32.3%, packet delivery ratio as 67% and one-hop communication as 13%. The proposed ETSGR protocol analyzes the state of the vehicle correctly and each node segmented to transmit the data with the timely manner and obtaining reliable performance even with high mobility of nodes in the network.Research limitations/implicationsThe proposed ETSGR protocol may have some limitation when considering the timing which should improve even in increasing many number of vehicles and different road segments.Practical implicationsThis paper includes some suggestions for the practical deployment of the approach in which a real-time traffic analysis can be evaluated for taking prior actions during an emergency situation and proper dissemination of data in timely manner can help utilize the guidance of proper planning of roads.Originality/valueThis research fulfills an enhanced protocol to improve the performance of data dissemination.

ADAPTIVE DATA DISSEMINATION IN MOBILE SENSOR NETWORKS

2009 ◽  
Vol 10 (04) ◽  
pp. 435-457
Author(s):  
ATHANASIOS KINALIS ◽  
SOTIRIS NIKOLETSEAS
Keyword(s):  
Sensor Networks ◽  
Data Dissemination ◽  
High Mobility ◽  
Cost Effective ◽  
Sensor Nodes ◽  
Inhibition Mechanism ◽  
Delivery Ratio ◽  
Message Delivery ◽  
Network Parameter ◽  
Trade Offs

Motivated by emerging applications, we consider sensor networks where the sensors themselves (not just the sinks) are mobile. Furthermore, we focus on mobility scenarios characterized by heterogeneous, highly changing mobility roles in the network. To capture these high dynamics of diverse sensory motion we propose a novel network parameter, the mobility level, which, although simple and local, quite accurately takes into account both the spatial and speed characteristics of motion. We then propose adaptive data dissemination protocols that use the mobility level estimation to optimize performance, by basically exploiting high mobility (redundant message ferrying) as a cost-effective replacement of flooding, e.g. the sensors tend to dynamically propagate less data in the presence of high mobility, while nodes of high mobility are favored for moving data around. These dissemination schemes are enhanced by a distance-sensitive probabilistic message flooding inhibition mechanism that further reduces communication cost, especially for fast nodes of high mobility level, and as distance to data destination decreases. Our simulation findings demonstrate significant performance gains of our protocols compared to non-adaptive protocols, i.e. adaptation increases the success rate and reduces latency (even by 15%) while at the same time significantly reducing energy dissipation (in most cases by even 40%). Also, our adaptive schemes achieve significantly higher message delivery ratio and satisfactory energy-latency trade-offs when compared to flooding when sensor nodes have limited message queues.

scholarly journals A Combined Modified OpportunisticNeighbor Selection and Vehicle Localization Routing Approach for Improved Connectivity in Indian Road Scenario

2018 ◽  
Vol 7 (3.16) ◽  
pp. 52
Author(s):  
Jothy. N ◽  
Jayanthi. K ◽  
Gunasundari. R
Keyword(s):  
High Mobility ◽  
Routing Algorithms ◽  
Link Quality ◽  
Delivery Ratio ◽  
Network Partitioning ◽  
Vehicle Localization ◽  
End To End Delay ◽  
End To End ◽  
Neighbor Selection ◽  
Link Availability

In the recent years, VANET is becoming a spectacular research area in wireless networks. The high mobility vehicular node in VANET dynamically changes the network topology resulting in highly unstable vehicle connectivity. This induces network partitioning and hence ensuring link availability remains to be a challenging task.  To surpass these issues, design of efficient VANET routing algorithms is necessary. The routing design for VANET scenario is highly complex and challenging making the existing AODV, greedy, cluster based routing algorithms to suffer from degraded link quality resulting in high end-to-end delay and significant packet loss. Although Opportunistic Neighbor Selection (ONS) scheme proves to be a better routing logic, it does not seem to always ensure link availability at road intersections, particularly in Indian road scenario, where multi road lane discipline is very hard to implement. To overcome these limitations, a combination of Modified Opportunistic Neighbor Selection (MONS) and Vehicle Localization (VL) routing logic for adoption in Indian road sector has been proposed in this paper. This paper addresses the connectivity challenges and provides better solution to achieve improved performance. In this work, two specific scenarios namely: varied mobility/node density rates is considered by treating the other fixed inorder to evaluate the suitability of the proposed logic in terms of packet delivery ratio, end-to-end delay.  

An advanced forwarding routing protocol for urban scenarios in VANETs

2017 ◽  
Vol 13 (4) ◽  
pp. 334-344 ◽  
Author(s):  
Sushil Kumar ◽  
Anil Kumar Verma
Keyword(s):  
Ad Hoc ◽  
Data Dissemination ◽  
Local Maximum ◽  
Movement Pattern ◽  
Delivery Ratio ◽  
Content Type ◽  
Greedy Forwarding ◽  
Suppression Technique ◽  
Efficient Data ◽  
Network Overhead

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.

scholarly journals Congestion-aware and Predictive Geo-Casting Routing Mechanisms for Mobile ad hoc Network

2021 ◽  
Author(s):  
Ahlam Hashim
Keyword(s):  
Routing Protocols ◽  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Data Dissemination ◽  
High Mobility ◽  
Delivery Ratio ◽  
High Quality ◽  
Control Overhead ◽  
Mobile Ad Hoc ◽  
Congestion Aware

Abstract Mobile Ad-hoc Networks (MANETs) has gained remarkable appreciation during the last decade because of its high flexibility. Due to high mobility and unpredictable topology changes, most of the existing routing protocols are unable to adapt to these changes and efficient route selection becomes a challenging task. The existing routing protocols incur high control overhead during route discovery process, tendency to select an unreliable route and high data packet loss during route maintenance. Therefore, this paper presents A Congestion-aware and Predictive Geo-casting Routing Mechanism (CPGR) for MANET that optimally utilize the constrained network resources and reliably detect high-quality links. CPGR exploits a multi-facet routing strategy that takes into consideration the congestion level, relatively higher signal strength, and hop-counts of neigh- boring nodes while making routing decisions. This strategy not only ensures data dissemination via high quality nodes but also balances out resource consumption among nodes while traversing through shorter paths. Demonstrated by simulation results in NS-2, CPGR achieves improved performance in terms of end-to-end delay, control overhead, and packet delivery ratio as compared to existing solutions.

A Security Based Greedy Method (SGMA) for VANETs in City Environment using Score Point Technique

2014 ◽  
Vol 10 (3) ◽  
pp. 1-16
Author(s):  
C. Kumuthini ◽  
P. Krishnakumari
Keyword(s):  
Vehicular Ad Hoc Networks ◽  
Ad Hoc ◽  
Research Work ◽  
High Mobility ◽  
Transportation Systems ◽  
Base Station ◽  
Delivery Ratio ◽  
Greedy Method ◽  
Hoc Networks ◽  
Score Point

The vehicular Ad-Hoc Networks (VANET) is constrained by high mobility of vehicles and frequent disconnections. The emerging adoption of wireless communications on surface transportation systems has generated extensive interest among researchers over the last several years. This research work deals with the crucial problems associated with routing in both city and urban environment due to false message receive from Vehicles. The main objectives of research, is to avoid the problem of false message attacks in VANET. To address this problem, the authors propose a Security Based Greedy Method (SGMA) specifically for a VANET and evaluate the performance using the NS2 simulator, which is used to add the functionality to validate message of each and every vehicle is secure and reliable. Results show that the proposed scheme will provide the score points of each vehicles, list the fake vehicles id and also SGMA operates properly in terms of packet delivery ratio. With the help of the score point received, the base station should identify the message is fake or not. The score point of vehicles is initialized in the Base station and the score point is stable or decreased depends on the feedback from receiver vehicle. The authors conclude that, the proposed work SGMA to make the network message more securable.

scholarly journals Towards Optimal Dissemination of Emergency Messages in Internet of Vehicles: A Dynamic Clustering-Based Approach

Electronics ◽  
2021 ◽  
Vol 10 (8) ◽  
pp. 979
Author(s):  
Nadjet Azzaoui ◽  
Ahmed Korichi ◽  
Bouziane Brik ◽  
Med el Amine Fekair
Keyword(s):  
Road Safety ◽  
Vehicular Networks ◽  
Data Dissemination ◽  
Cluster Head ◽  
High Mobility ◽  
Delivery Ratio ◽  
Dynamic Clustering ◽  
Selection Algorithm ◽  
Internet Of Vehicles ◽  
Broadcast Storm

In this paper, we target dissemination issues of emergency messages in a highly dynamic Internet of Vehicles (IoV) network. IoV is emerging as a new class of vehicular networks to optimize road safety as well as users’ comfort. In such a context, forwarding emergency messages through vehicle-to-vehicle communications (V2V) plays a vital role in enabling road safety-related applications. For instance, when an accident occurs, forwarding such information in real time will help to avoid other accidents in addition to avoiding congestion of network traffic. Thus, dissemination of emergency information is a major concern. However, on the one hand, vehicle density has increased in the last decade which may lead to several issues including message collisions, broadcast storm, and the problem of hidden nodes. On the other hand, high mobility of vehicles and hence dynamic changes of network topology result in failure of dissemination of emergency packets. To overcome these problems, we propose a new dissemination scheme of emergency packets by vehicles equipped with both DSRC and cellular LTE wireless communication capabilities. Our scheme is based on a dynamic clustering strategy, which includes a new cluster head selection algorithm to deal with the broadcast storm problem. Furthermore, our selection algorithm enables not only the election of the most stable vehicles as cluster heads, and hence their exploitation in forwarding the emergency information, but also the avoidance of packet collisions. We simulated our scheme in an urban environment and compared it with other data dissemination schemes. Obtained results show the efficiency of our scheme in minimizing collision and broadcast storm problems, while improving latency, packet delivery ratio and data throughput, as compared to other schemes.

Optimal broadcast scheduling method for VANETs: An adaptive discrete firefly approach

2020 ◽  
Vol 39 (6) ◽  
pp. 8125-8137
Author(s):  
Jackson J Christy ◽  
D Rekha ◽  
V Vijayakumar ◽  
Glaucio H.S. Carvalho
Keyword(s):  
Intelligent Transportation System ◽  
Search Algorithm ◽  
Mac Protocol ◽  
High Mobility ◽  
Optimal Solution ◽  
Cuckoo Search ◽  
Cuckoo Search Algorithm ◽  
Traffic Density ◽  
Scheduling Problem ◽  
Broadcast Scheduling

Vehicular Adhoc Networks (VANET) are thought-about as a mainstay in Intelligent Transportation System (ITS). For an efficient vehicular Adhoc network, broadcasting i.e. sharing a safety related message across all vehicles and infrastructure throughout the network is pivotal. Hence an efficient TDMA based MAC protocol for VANETs would serve the purpose of broadcast scheduling. At the same time, high mobility, influential traffic density, and an altering network topology makes it strenuous to form an efficient broadcast schedule. In this paper an evolutionary approach has been chosen to solve the broadcast scheduling problem in VANETs. The paper focusses on identifying an optimal solution with minimal TDMA frames and increased transmissions. These two parameters are the converging factor for the evolutionary algorithms employed. The proposed approach uses an Adaptive Discrete Firefly Algorithm (ADFA) for solving the Broadcast Scheduling Problem (BSP). The results are compared with traditional evolutionary approaches such as Genetic Algorithm and Cuckoo search algorithm. A mathematical analysis to find the probability of achieving a time slot is done using Markov Chain analysis.

An Efficient Cluster-Based Flooding Using Fuzzy Logic Scheme (CBF2S) In Mobile Adhoc Networks

2020 ◽  
Vol 14 ◽  
Author(s):  
S. Mahima ◽  
N. Rajendran
Keyword(s):  
Fuzzy Logic ◽  
Ad Hoc ◽  
Link Quality ◽  
Traffic Load ◽  
Node Degree ◽  
Communication Overhead ◽  
Delivery Ratio ◽  
Node Mobility ◽  
Centralized Control ◽  
Hop Count

: Mobile ad hoc networks (MANET) hold a set of numerous mobile computing devices useful for communication with one another with no centralized control. Due to the inherent features of MANET such as dynamic topology, constrained on bandwidth, energy and computing resources, there is a need to design the routing protocols efficiently. Flooding is a directive for managing traffic since it makes use of only chosen nodes for transmitting data from one node to another. This paper intends to develop a new Cluster-Based Flooding using Fuzzy Logic Scheme (CBF2S). To construct clusters and choose proper cluster heads (CHs), thefuzzy logic approach is applied with the use of three parameters namely link quality, node mobility and node degree. The presented model considerably minimizes the number of retransmissions in the network. The presented model instructs the cluster members (CM) floods the packets inside a cluster called intra-cluster flooding and CHs floods the packets among the clusters called inter-cluster flooding. In addition, the gateway sends a packet to another gateway for minimizing unwanted data retransmissions when it comes under different CH. The presented CBF2S is simulated using NS2 tool under the presence of varying hop count. The CBF2S model exhibits maximum results over the other methods interms of overhead, communication overhead, traffic load, packet delivery ratio and the end to end delay.

Performance Analysis of Energy Efficient Opportunistic Routing Protocols in Wireless Sensor Network

2019 ◽  
Vol 09 ◽  
Author(s):  
Premkumar Chithaluru ◽  
Rajeev Tiwari ◽  
Kamal Kumar
Keyword(s):  
Energy Consumption ◽  
Routing Protocols ◽  
Energy Efficient ◽  
Data Communication ◽  
Opportunistic Routing ◽  
Link Quality ◽  
Delivery Ratio ◽  
Performance Parameters ◽  
Wireless Medium ◽  
Reduce Energy Consumption

Background: Energy Efficient wireless routing has been an area of research particularly to mitigate challenges surrounding performance in category of Wireless Networks. Objectives: The Opportunistic Routing (OR) technique was explored in recent times and exhibits benefits over many existing protocols and can significantly reduce energy consumption during data communication with very limited compromise on performance. Methods : Using broadcasting nature of the wireless medium, OR practices to discourse two foremost issues of variable link quality and unpredictable node agility in constrained WSNs. OR has a potential to reduce delay in order to increase the consistency of data delivery in network. Results : Various OR based routing protocols have shown varying performances. In this paper, a detailed conceptual and experimental analysis is carried out on different protocols that uses OR technique for providing more clear and definitive view on performance parameters like Message Success Rate, Packet Delivery Ratio and Energy Consumption.

BlueFlood

2021 ◽  
Vol 2 (4) ◽  
pp. 1-30
Author(s):  
Beshr Al Nahas ◽  
Antonio Escobar-Molero ◽  
Jirka Klaue ◽  
Simon Duquennoy ◽  
Olaf Landsiedel
Keyword(s):  
Experimental Study ◽  
Bit Error Rate ◽  
Error Rate ◽  
Data Dissemination ◽  
Delivery Ratio ◽  
Controlled Experiments ◽  
Seamless Integration ◽  
Peer Communication ◽  
Shift Keying ◽  
University Buildings

Bluetooth is an omnipresent technology, available on billions of devices today. While it has been traditionally limited to peer-to-peer communication and star networks, the recent Bluetooth Mesh standard extends it to multi-hop networking. In addition, the Bluetooth 5 standard introduces new modes to allow for increased reliability. In this article, we evaluate the feasibility of concurrent transmissions (CT) in Bluetooth via modeling and controlled experiments and then devise an efficient network-wide data dissemination protocol, BlueFlood, based on CT for multi-hop Bluetooth networks. First, we model and analyze how CT distorts the received waveform and characterize the Bit Error Rate of a Frequency-Shift Keying receiver to show that CT is feasible over Bluetooth. Second, we verify our analytic results with a controlled experimental study of CT over Bluetooth PHY. Third, we present BlueFlood, a fast and efficient network-wide data dissemination in multi-hop Bluetooth networks. In our experimental evaluation, in two testbeds deployed in university buildings, we show that BlueFlood achieves 99.9% end-to-end delivery ratio with a duty-cycle of 0.4% for periodic dissemination of advertising packets of 38 bytes with 200 milliseconds intervals at 2 Mbps. Moreover, we show that BlueFlood can be received by off-the-shelf devices such as smartphones, paving a seamless integration with existing technologies.

Sign in / Sign up

Export Citation Format

Share Document