scholarly journals SDN-based Handover Scheme in Cellular/IEEE 802.11p Hybrid Vehicular Networks

Sensors ◽  
2020 ◽  
Vol 20 (4) ◽  
pp. 1082 ◽  
Author(s):  
Ran Duo ◽  
Celimuge Wu ◽  
Tsutomu Yoshinaga ◽  
Jiefang Zhang ◽  
Yusheng Ji
Keyword(s):  
Network Topology ◽  
Network Performance ◽  
Vehicular Networks ◽  
Ieee 802.11P ◽  
Centralized Control ◽  
Topology Changes ◽  
Dynamic Topology ◽  
Stable Transmission ◽  
Transmission Layer ◽  
Handover Scheme

With the arrival of 5G, the wireless network will be provided with abundant spectrum resources, massive data transmissions and low latency communications, which makes Vehicle-to-Everything applications possible. However, VANETs always accompany with frequent network topology changes due to the highly mobile feature of vehicles. As a result, the network performance will be affected by the frequent handover. In this paper, a seamless handover scheme is proposed where the Software-Defined Networking (SDN) and Mobile Edge Computing (MEC) technologies are employed to adapt to the dynamic topology change in VANETs. The introduction of SDN provides a global view of network topology and centralized control, which enables a stable transmission layer connection when a handover takes place, so that the upper layer performance is not influenced by the network changes. By employing MEC server, the data are cached in advance before a handover happens, so that the vehicle can restore normal communication faster. In order to confirm the superiority of our proposal, computer simulations are conducted from different aspects. The results show that our proposal can significantly improve the network performance when a handover happens.

A Cross Layer Seamless Handover Scheme in IEEE 802.11p Based Vehicular Networks

2010 ◽  
pp. 84-95 ◽  
Author(s):  
Arun Prakash ◽  
Sarsij Tripathi ◽  
Rajesh Verma ◽  
Neeraj Tyagi ◽  
Rajeev Tripathi ◽  
...  
Keyword(s):  
Vehicular Networks ◽  
Ieee 802.11P ◽  
Cross Layer ◽  
Seamless Handover ◽  
Handover Scheme

scholarly journals Optimal Coordination of Over-Current Relays in Microgrids Using Unsupervised Learning Techniques

2021 ◽  
Vol 11 (3) ◽  
pp. 1241
Author(s):  
Sergio D. Saldarriaga-Zuluaga ◽  
Jesús M. López-Lezama ◽  
Nicolás Muñoz-Galeano
Keyword(s):  
Unsupervised Learning ◽  
Distributed Generation ◽  
Network Topology ◽  
International Electrotechnical Commission ◽  
Number Of Clusters ◽  
Learning Techniques ◽  
Topology Changes ◽  
Network Topologies ◽  
Optimal Coordination ◽  
Operational Modes

Microgrids constitute complex systems that integrate distributed generation (DG) and feature different operational modes. The optimal coordination of directional over-current relays (DOCRs) in microgrids is a challenging task, especially if topology changes are taken into account. This paper proposes an adaptive protection approach that takes advantage of multiple setting groups that are available in commercial DOCRs to account for network topology changes in microgrids. Because the number of possible topologies is greater than the available setting groups, unsupervised learning techniques are explored to classify network topologies into a number of clusters that is equal to the number of setting groups. Subsequently, optimal settings are calculated for every topology cluster. Every setting is saved in the DOCRs as a different setting group that would be activated when a corresponding topology takes place. Several tests are performed on a benchmark IEC (International Electrotechnical Commission) microgrid, evidencing the applicability of the proposed approach.

Analysis of Wireless Mesh Network Routing

2014 ◽  
Vol 989-994 ◽  
pp. 4629-4632
Author(s):  
Xiao Long Tan ◽  
Jia Zhou ◽  
Wen Bin Wang
Keyword(s):  
Network Topology ◽  
Routing Protocol ◽  
Wireless Mesh Network ◽  
Network Routing ◽  
Mesh Network ◽  
Mac Layer ◽  
Key Factors ◽  
Wireless Mesh ◽  
Topology Changes ◽  
Communication Links

Since the wireless mesh network topology dynamics and the radio channels instable, the design of wireless mesh network routing protocol become one of the key factors to determine the performance. This paper mainly studied the existing several kinds of typical three-layer mesh network routing protocol (DSDV and AODV), aimed at the defects of three-layer routing limited to the network topology changes, the paper proposed a network model based on two-layer routing. Forwarding the packet, establishing and maintaining the communication links are accomplished on the Mac layer. Simulation tests showed that two-layer routing has a big improvement on the efficiency of packet forwarding, and it effectively reduced the routing overhead and end-to-end delay simultaneously.

Detection and Ignoring of Blackhole Attack in Vanets Networks

2016 ◽  
Vol 6 (2) ◽  
pp. 1-10
Author(s):  
Chaima Bensaid ◽  
Sofiane Boukli Hacene ◽  
Kamel Mohamed Faraoun
Keyword(s):  
Black Hole ◽  
Communication Networks ◽  
Network Performance ◽  
Vehicular Networks ◽  
Data Communication ◽  
Main Idea ◽  
Black Hole Attack ◽  
Malicious Nodes ◽  
The Future ◽  
Detailed Simulation

Vehicular networks or VANET announce as the communication networks of the future, where the mobility is the main idea. These networks should be able to interconnect vehicles. The optimal goal is that these networks will contribute to safer roads and more effective in the future by providing timely information to drivers and concerned authorities. They are therefore vulnerable to many types of attacks among them the black hole attack. In this attack, a malicious node disseminates spurious replies for any route discovery in order to monopolize all data communication and deteriorate network performance. Many studies have focused on detecting and isolating malicious nodes in VANET. In this paper, the authors present two mechanisms to detect this attack. The main goal is detecting as well as bypass cooperative black hole attack. The authors' approaches have been evaluated by the detailed simulation study with NS2 and the simulation results shows an improvement of protocol performance.

scholarly journals A Cooperative Communication Protocol for QoS Provisioning in IEEE 802.11p/Wave Vehicular Networks

Sensors ◽  
2018 ◽  
Vol 18 (11) ◽  
pp. 3622 ◽  
Author(s):  
Jin-Woo Kim ◽  
Jae-Wan Kim ◽  
Dong-Keun Jeon
Keyword(s):  
Cooperative Communication ◽  
Vehicular Networks ◽  
Vehicular Ad Hoc Networks ◽  
Ad Hoc ◽  
Communication Protocol ◽  
Ieee 802.11P ◽  
The Road ◽  
Free Data ◽  
On The Road ◽  
Hoc Networks

Vehicular ad hoc networks (VANETs) provide information and entertainment to drivers for safe and enjoyable driving. Wireless Access in Vehicular Environments (WAVE) is designed for VANETs to provide services efficiently. In particular, infotainment services are crucial to leverage market penetration and deployment costs of the WAVE standard. However, a low presence of infrastructure results in a shadow zone on the road and a link disconnection. The link disconnection is an obstacle to providing safety and infotainment services and becomes an obstacle to the deployment of the WAVE standard. In this paper, we propose a cooperative communication protocol to reduce performance degradation due to frequent link disconnection in the road environment. The proposed protocol provides contention-free data delivery by the coordination of roadside units (RSUs) and can provide the network QoS. The proposed protocol is shown to enhance throughput and delay through the simulation.

Overhauling ns-2 PHY/MAC simulations for IEEE 802.11p/WAVE vehicular networks

2012 ◽  
Author(s):  
Claudia Campolo ◽  
Hector Agustin Cozzetti ◽  
Antonella Molinaro ◽  
Riccardo M. Scopigno
Keyword(s):  
Vehicular Networks ◽  
Ieee 802.11P

scholarly journals Feature Extraction of Real-World Traces Using K Means Clustering In OppNet

2021 ◽  
Author(s):  
Rahul Johari ◽  
Tanvi Gautam
Keyword(s):  
Network Topology ◽  
Real World ◽  
Network Performance ◽  
Performance Metrics ◽  
Learning Algorithm ◽  
Dynamic Network ◽  
Delivery Ratio ◽  
Communication Link ◽  
Alternative Measure ◽  
Intermittent Connectivity

Abstract Natural calamities leave people helpless by arising several situations such as network breakdown, zero communication, intermittent connectivity, dynamic network topology. In such situation an application of dynamic and intermittent routing scheme is essential to make further communication possible during likewise scenarios. An application of TCP/IP becomes futile in mentioned circumstances as it best works for static nodes and pre-defined network topology wherein source and destination nodes are first establishing the communication link with each other. An alternative measure of such hitches is to encounter an application of DTN protocol which possess all characteristics to withstand in such scenarios such as; dynamic network topology, intermittent connectivity, frequent path breaks, store – carry – forward fashion. In this paper we did thorough investigation of forest fire dataset (Uttarakhand) after exploring its implementation in ONE with Epidemic, Prophet, Spray and Wait, HBPR, GAER respectively. An extensive and thorough investigation for real world traces implementation has been done with OppNet routing protocols against mobility models namely; Shortest path map – based, Random Direction, Random Walk, Random Waypoint, Cluster Movement respectively for network performance metrics namely packet delivery ratio, packet overhead ratio and average latency ratio respectively with the application of K means clustering machine learning algorithm. With the help of this analysis, we explore the real-world traces characteristics and study the areas on which network performance can be improved.

Connectivity, Accessibility, and Mobility Relationships in the Context of Low-Volume Road Networks

2019 ◽  
Vol 2673 (12) ◽  
pp. 717-727
Author(s):  
Samuel Labi ◽  
Asif Faiz ◽  
Tariq Usman Saeed ◽  
Bortiorkor Nii Tsui Alabi ◽  
Wubeshet Woldemariam
Keyword(s):  
Network Topology ◽  
Network Performance ◽  
Holistic Approach ◽  
Operational Performance ◽  
Socioeconomic Characteristics ◽  
Project Appraisal ◽  
Road Condition ◽  
Road Projects ◽  
Low Volume ◽  
Area Of Influence

The concepts of connectivity, accessibility, and mobility (CAM) are key measures of transport network performance that have been discussed extensively in the literature. However, there has been little work that discussed the relationships among these concepts. A clear discourse on these concepts and their interrelationships can help agencies carry out more objective evaluations of projects that seek to improve at least one of these measures of transportation performance. This paper presents three alternative perspectives (models) of the CAM relationship: the nested, snowman, and three-way overlapping models. The paper also presents, for project appraisal purposes, two alternative ways of classifying the three CAM concepts. The first is based on the three concepts in their basic forms; the second considers some variation of these concepts in addition to aspects of the network topology, operational performance, road condition, and socioeconomic characteristics of the project’s area of influence. The conceptual framework outlined in this paper contributes towards a holistic approach to the appraisal of low-volume road projects, programs, or existing networks based on their impact on overall CAM.

scholarly journals The (T, L)-Path Model and Algorithms for Information Dissemination in Dynamic Networks

Information ◽  
2018 ◽  
Vol 9 (9) ◽  
pp. 212
Author(s):  
Zhiwei Yang ◽  
Weigang Wu
Keyword(s):  
Network Topology ◽  
Information Dissemination ◽  
Dynamic Networks ◽  
Dynamic Network ◽  
Network Models ◽  
Point Of View ◽  
Path Model ◽  
Dynamic Network Models ◽  
Topology Changes ◽  
Practical Design

A dynamic network is the abstraction of distributed systems with frequent network topology changes. With such dynamic network models, fundamental distributed computing problems can be formally studied with rigorous correctness. Although quite a number of models have been proposed and studied for dynamic networks, the existing models are usually defined from the point of view of connectivity properties. In this paper, instead, we examine the dynamicity of network topology according to the procedure of changes, i.e., how the topology or links change. Following such an approach, we propose the notion of the “instant path” and define two dynamic network models based on the instant path. Based on these two models, we design distributed algorithms for the problem of information dissemination respectively, one of the fundamental distributing computing problems. The correctness of our algorithms is formally proved and their performance in time cost and communication cost is analyzed. Compared with existing connectivity based dynamic network models and algorithms, our procedure based ones are definitely easier to be instantiated in the practical design and deployment of dynamic networks.

Sign in / Sign up

Export Citation Format

Share Document