scholarly journals EEMDS: An Effective Emergency Message Dissemination Scheme for Urban VANETs

Sensors ◽  
2021 ◽  
Vol 21 (5) ◽  
pp. 1588
Author(s):  
Sami Ullah ◽  
Ghulam Abbas ◽  
Muhammad Waqas ◽  
Ziaul Haq Abbas ◽  
Shanshan Tu ◽  
...  
Keyword(s):  
Large Scale ◽  
Cluster Structure ◽  
Cluster Head ◽  
Path Loss ◽  
Communication Overhead ◽  
Delivery Ratio ◽  
Broadcast Storm ◽  
Message Dissemination ◽  
Link Stability ◽  
Challenging Tasks

In Vehicular Adhoc Networks (VANETs), disseminating Emergency Messages (EMs) to a maximum number of vehicles with low latency and low packet loss is critical for road safety. However, avoiding the broadcast storm and dealing with large-scale dissemination of EMs in urban VANETs, particularly at intersections, are the challenging tasks. The problems become even more challenging in a dense network. We propose an Effective Emergency Message Dissemination Scheme (EEMDS) for urban VANETs. The scheme is based on our mobility metrics to avoid communication overhead and to maintain a stable cluster structure. Every vehicle takes into account its direction angle and path loss factor for selecting a suitable cluster head. Moreover, we introduce estimated link stability to choose a suitable relay vehicle that reduces the number of rebroadcasts and communication congestion in the network. Simulation results show that EEMDS provides an acceptable end-to-end delay, information coverage, and packet delivery ratio compared to the eminent EM dissemination schemes.

scholarly journals A Selective reliable communication to reduce broadcasting for cluster based VANET

2021 ◽  
Vol 12 (3) ◽  
pp. 4450-4457
Author(s):  
R. Shiddharthy Et.al
Keyword(s):  
Ad Hoc Network ◽  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Cluster Head ◽  
Delivery Ratio ◽  
Vehicular Communication ◽  
Reliable Communication ◽  
Average Delay ◽  
Broadcast Storm ◽  
Mobile Ad Hoc

Vehicular Ad hoc Network (VANET) is one of the subset of Mobile Ad hoc Network (MANET) and it is a self-organised system with a group of vehicles, which are capable of short-range communication using On Board Unit (OBU). This unit is comprised with the vehicles that are possible to communicate with the nearby vehicles. VANETs rely on heavy broadcast transmission due to sharing data (messages) between the nearby vehicles about the traffic, collision and so on. This redundant information spoils the nature of VANET that affects the inter-vehicular communication, rebroadcasting and information on collision. This message transmission increases largely as the number of vehicles increases. This problem is typically named as broadcast storm and it is relatively reduced through the proposed Selective Reliable Communication (SRC) Protocol.  Through a reliable communication, packets are retransmitted to reduce a number of transmission in the network within the acceptable level of QoS. The proposed SRC protocol automatically detect the vehicle clusters as “Zone of Interest”. Generally, the proposed protocol forwards the packets to the cluster-heads and the cluster-head forwards the packets to the cluster-members. The proposed protocol outperforms than the existing protocols in terms of Throughput, Packet Delivery Ratio (PDR) and Average delay.

scholarly journals MAC protocol with grouping awareness GMAC for large scale Internet-of-Things network

2021 ◽  
Vol 7 ◽  
pp. e733
Author(s):  
Abdulrahman Sameer Sadeq ◽  
Rosilah Hassan ◽  
Azana Hafizah Mohd Aman ◽  
Hasimi Sallehudin ◽  
Khalid Allehaibi ◽  
...  
Keyword(s):  
Energy Consumption ◽  
Internet Of Things ◽  
Large Scale ◽  
Ieee 802.15.4 ◽  
Mac Protocol ◽  
Cluster Head ◽  
Delivery Ratio ◽  
Energy Aware ◽  
Medium Access ◽  
Two Stages

The development of Medium Access Control (MAC) protocols for Internet of Things should consider various aspects such as energy saving, scalability for a wide number of nodes, and grouping awareness. Although numerous protocols consider these aspects in the limited view of handling the medium access, the proposed Grouping MAC (GMAC) exploits prior knowledge of geographic node distribution in the environment and their priority levels. Such awareness enables GMAC to significantly reduce the number of collisions and prolong the network lifetime. GMAC is developed on the basis of five cycles that manage data transmission between sensors and cluster head and between cluster head and sink. These two stages of communication increase the efficiency of energy consumption for transmitting packets. In addition, GMAC contains slot decomposition and assignment based on node priority, and, therefore, is a grouping-aware protocol. Compared with standard benchmarks IEEE 802.15.4 and industrial automation standard 100.11a and user-defined grouping, GMAC protocols generate a Packet Delivery Ratio (PDR) higher than 90%, whereas the PDR of benchmark is as low as 75% in some scenarios and 30% in others. In addition, the GMAC accomplishes lower end-to-end (e2e) delay than the least e2e delay of IEEE with a difference of 3 s. Regarding energy consumption, the consumed energy is 28.1 W/h for GMAC-IEEE Energy Aware (EA) and GMAC-IEEE, which is less than that for IEEE 802.15.4 (578 W/h) in certain scenarios.

Designing a New Scalable Autoconfiguration Protocol with Optimal Header Selection for Large Scale MANETs

2019 ◽  
Vol 29 (05) ◽  
pp. 2050068
Author(s):  
Rajula Angelin Samuel ◽  
D. Shalini Punithavathani
Keyword(s):  
Large Scale ◽  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Cluster Head ◽  
Mobile Node ◽  
Communication Overhead ◽  
Gray Wolf ◽  
Wired Networks ◽  
Node Location ◽  
Group Members

Autoconfiguration in mobile ad hoc network (MANET) is a challenging task to be accomplished in hostile environment. Moreover, a mobile node in MANET is usually configured with a unique IP address for providing better communication and to connect it with an IP network. Essentially, the nodes in wired networks are autoconfigured using a commonly known Dynamic Host Configuration Protocol (DHCP) server. However, MANET exhibits the intrinsic characteristics (i.e., distributed, dynamic and multi-hop) in nature; hence, it is hard to adopt DHCP server for autoconfiguration of nodes in MANET without applying significant modifications in auto-configuration scheme. This paper proposes an efficient IPV6 Duplicate address Elimination Autoconfiguration protocol for MANETs (IDEAM) which comprises the member and the cluster head (CH) nodes organized in a hierarchical fashion. Further, the proposed protocol considers the global connectivity exhibiting reduced communication overhead among the nodes. Initially, our proposed auto-configuration protocol encourages the Duplicate Address Detection (DAD) operation by selecting a controller node from the prefixed group members using a joining node in the network. In other words, the DAD operation is performed perfectly by a selected controller node on behalf of the new joining node. Thus, our proposed protocol becomes more effective and behaves better in the minimization of overhead by considerably eliminating the DAD messages broadcast in the network. Also, we imposed a new Flower pollination based gray wolf optimization (FPGWO) algorithm for selecting an optimal header among the group members by considering various node parameters (i.e., node location, resources and node density) to avoid unnecessary broadcasting of additional weight messages about each node in the network. The simulation results proved the efficiency of our proposed protocol in terms of scalability and in the minimization of overhead. Also, an effectual method provided by our proposed approach enhances the activity of marginal nodes over the group for healing the network that degrades its performance followed by the splitting and merging operation.

A Mobility Prediction-Based Weighted Clustering Algorithm for Vehicular Ad-Hoc Network

2014 ◽  
Vol 687-691 ◽  
pp. 4114-4118
Author(s):  
Shou Jie Li ◽  
Qiong Huang ◽  
Ning Gao ◽  
Lun Tang
Keyword(s):  
Ad Hoc Network ◽  
Large Scale ◽  
Clustering Algorithm ◽  
Ad Hoc ◽  
Cluster Structure ◽  
High Mobility ◽  
Vehicular Ad Hoc Network ◽  
Mobility Prediction ◽  
Delivery Ratio ◽  
Weighted Clustering

For dynamical changed network topology and unstable links, this paper proposes a mobility prediction-based weighted clustering algorithm for vehicular ad-hoc network with high mobility nodes. In the CH election stage, it computes vehicle’s priority through the similarity, intimacy and centrality, the vehicles with the highest priority in their neighborhoods are selected as the CHs, this scheme suitable for large scale network. NS2 simulation results show that the proposed clustering scheme improves the stability of cluster structure, prolongs the CH duration time, improves the delivery ratio.

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.

Fault Tolerant Reliable Protocol (FTRP) Performance Evaluation in Wireless Sensor Networks: An Extensitive Study

2019 ◽  
pp. 1-36
Keyword(s):  
Wireless Sensor Networks ◽  
Fault Tolerance ◽  
Sensor Networks ◽  
Fault Tolerant ◽  
Cluster Head ◽  
Biological Data ◽  
Wireless Sensor ◽  
Delivery Ratio ◽  
Good Performer ◽  
Wide Range

Fault Tolerant Reliable Protocol (FTRP) is proposed as a novel routing protocol designed for Wireless Sensor Networks (WSNs). FTRP offers fault tolerance reliability for packet exchange and support for dynamic network changes. The key concept used is the use of node logical clustering. The protocol delegates the routing ownership to the cluster heads where fault tolerance functionality is implemented. FTRP utilizes cluster head nodes along with cluster head groups to store packets in transient. In addition, FTRP utilizes broadcast, which reduces the message overhead as compared to classical flooding mechanisms. FTRP manipulates Time to Live values for the various routing messages to control message broadcast. FTRP utilizes jitter in messages transmission to reduce the effect of synchronized node states, which in turn reduces collisions. FTRP performance has been extensively through simulations against Ad-hoc On-demand Distance Vector (AODV) and Optimized Link State (OLSR) routing protocols. Packet Delivery Ratio (PDR), Aggregate Throughput and End-to-End delay (E-2-E) had been used as performance metrics. In terms of PDR and aggregate throughput, it is found that FTRP is an excellent performer in all mobility scenarios whether the network is sparse or dense. In stationary scenarios, FTRP performed well in sparse network; however, in dense network FTRP’s performance had degraded yet in an acceptable range. This degradation is attributed to synchronized nodes states. Reliably delivering a message comes to a cost, as in terms of E-2-E. results show that FTRP is considered a good performer in all mobility scenarios where the network is sparse. In sparse stationary scenario, FTRP is considered good performer, however in dense stationary scenarios FTRP’s E-2-E is not acceptable. There are times when receiving a network message is more important than other costs such as energy or delay. That makes FTRP suitable for wide range of WSNs applications, such as military applications by monitoring soldiers’ biological data and supplies while in battlefield and battle damage assessment. FTRP can also be used in health applications in addition to wide range of geo-fencing, environmental monitoring, resource monitoring, production lines monitoring, agriculture and animals tracking. FTRP should be avoided in dense stationary deployments such as, but not limited to, scenarios where high application response is critical and life endangering such as biohazards detection or within intensive care units.

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.

scholarly journals Deterministic and Empirical Approach for Millimeter-Wave Complex Outdoor Smart Parking Solution Deployments

Sensors ◽  
2021 ◽  
Vol 21 (12) ◽  
pp. 4112
Author(s):  
Fidel Alejandro Rodríguez-Corbo ◽  
Leyre Azpilicueta ◽  
Mikel Celaya-Echarri ◽  
Peio Lopez-Iturri ◽  
Ana V. Alejos ◽  
...  
Keyword(s):  
Large Scale ◽  
Radio Channel ◽  
Path Loss ◽  
Ground Level ◽  
Directional Antennas ◽  
Scale Parameters ◽  
Parking Lot ◽  
Smart Parking ◽  
Wireless Communications Systems

The characterization of different vegetation/vehicle densities and their corresponding effects on large-scale channel parameters such as path loss can provide important information during the deployment of wireless communications systems under outdoor conditions. In this work, a deterministic analysis based on ray-launching (RL) simulation and empirical measurements for vehicle-to-infrastructure (V2I) communications for outdoor parking environments and smart parking solutions is presented. The study was carried out at a frequency of 28 GHz using directional antennas, with the transmitter raised above ground level under realistic use case conditions. Different radio channel impairments were weighed in, considering the progressive effect of first, the density of an incremental obstructed barrier of trees, and the effect of different parked vehicle densities within the parking lot. On the basis of these scenarios, large-scale parameters and temporal dispersion characteristics were obtained, and the effect of vegetation/vehicle density changes was assessed. The characterization of propagation impairments that different vegetation/vehicle densities can impose onto the wireless radio channel in the millimeter frequency range was performed. Finally, the results obtained in this research can aid communication deployment in outdoor parking conditions.

scholarly journals A Proximal Algorithm for Fork-Choice in Distributed Ledger Technology for Context-Based Clustering on Edge Computing

2020 ◽  
Vol 2 (1) ◽  
pp. 92
Author(s):  
Rahim Rahmani ◽  
Ramin Firouzi ◽  
Sachiko Lim ◽  
Mahbub Alam
Keyword(s):  
Large Scale ◽  
Cluster Head ◽  
Edge Computing ◽  
Computing Technology ◽  
Proximal Algorithm ◽  
Data Intensive ◽  
Distributed Ledger ◽  
Smart Contract ◽  
Distributed Ledger Technology ◽  
Iot Devices

The major challenges of operating data-intensive of Distributed Ledger Technology (DLT) are (1) to reach consensus on the main chain as a set of validators cast public votes to decide on which blocks to finalize and (2) scalability on how to increase the number of chains which will be running in parallel. In this paper, we introduce a new proximal algorithm that scales DLT in a large-scale Internet of Things (IoT) devices network. We discuss how the algorithm benefits the integrating DLT in IoT by using edge computing technology, taking the scalability and heterogeneous capability of IoT devices into consideration. IoT devices are clustered dynamically into groups based on proximity context information. A cluster head is used to bridge the IoT devices with the DLT network where a smart contract is deployed. In this way, the security of the IoT is improved and the scalability and latency are solved. We elaborate on our mechanism and discuss issues that should be considered and implemented when using the proposed algorithm, we even show how it behaves with varying parameters like latency or when clustering.

Coding Algorithms and Network Plan for Context-Aware Data Collection Based on Internet of Things in Large Marine Ships

2014 ◽  
Vol 701-702 ◽  
pp. 957-960
Author(s):  
Feng Xie
Keyword(s):  
Internet Of Things ◽  
Formal Analysis ◽  
Cluster Head ◽  
Communication Overhead ◽  
Context Aware ◽  
Sensing Data ◽  
Communication Efficiency ◽  
Data Volume ◽  
Using Data ◽  
Data Context

The equipment maintenance in large marine ships may rely on Internet of Things to provide monitoring of equipment status instantly. The data volume of sensing data is huge as the number of equipments is large. It is critical to decrease the communication overhead of uploading sensing data for efficiently and timely monitoring. In this paper, we propose several coding algorithms by using data context that is modeled by our normal forms on the base of our observations. The communication efficiency is improved, which is justified by formal analysis and rigorous proof. We also propose several network plan policies for further improvement of the communication efficiency by using data context and cluster head deployment.

Sign in / Sign up

Export Citation Format

Share Document