اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدEfficient Packet Forwarding Approach in Vehicular Ad Hoc Networks Using EBGR Algorithm
173
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
VANETs (Vehicular Ad hoc Networks) are highly mobile wireless ad hoc networks and will play an important role in public safety communications and commercial applications. Routing of data in VANETs is a challenging task due to rapidly changing topology and high speed mobility of vehicles. Conventional routing protocols in MANETs (Mobile Ad hoc Networks) are unable to fully address the unique characteristics in vehicular networks. In this paper, we propose EBGR (Edge Node Based Greedy Routing), a reliable greedy position based routing approach to forward packets to the node present in the edge of the transmission range of source/forwarding node as most suitable next hop, with consideration of nodes moving in the direction of the destination. We propose Revival Mobility model (RMM) to evaluate the performance of our routing technique. This paper presents a detailed description of our approach and simulation results show that packet delivery ratio is improved considerably compared to other routing techniques of VANET.
قيم البحث
اقرأ أيضاً
In the paradigm of mobile Ad hoc networks (MANET), forwarding packets originating from other nodes requires cooperation among nodes. However, as each node may not want to waste its energy, cooperative behavior can not be guaranteed. Therefore, it is
necessary to implement some mechanism to avoid selfish behavior and to promote cooperation. In this paper, we propose a simple quid pro quo based reputation system, i.e., nodes that forward gain reputation, but lose more reputation if they do not forward packets from cooperative users (determined based on reputation), and lose less reputation when they chose to not forward packets from non-cooperative users. Under this framework, we model the behavior of users as an evolutionary game and provide conditions that result in cooperative behavior by studying the evolutionary stable states of the proposed game. Numerical analysis is provided to study the resulting equilibria and to illustrate how the proposed model performs compared to traditional models.
Broadcast routing has become an important research field for vehicular ad-hoc networks (VANETs) recently. However, the packet delivery rate is generally low in existing VANET broadcast routing protocols. Therefore, the design of an appropriate broadc
ast protocol based on the features of VANET has become a crucial part of the development of VANET. This paper analyzes the disadvantage of existing broadcast routing protocols in VANETs, and proposes an improved algorithm (namely ODAM-C) based on the ODAM (Optimized Dissemination of Alarm Messages) protocol. The ODAM-C algorithm improves the packet delivery rate by two mechanisms based on the forwarding features of ODAM. The first distance-based mechanism reduces the possibility of packet loss by considering the angles between source nodes, forwarding nodes and receiving nodes. The second mechanism increases the redundancy of forwarding nodes to guarantee the packet success delivery ratio. We show by analysis and simulations that the proposed algorithm can improve packet delivery rate for vehicular networks compared against two widely-used existing protocols.
With the growing interest in the use of internet of things (IoT), machine-to-machine (M2M) communications have become an important networking paradigm. In this paper, with recent advances in wireless network virtualization (WNV), we propose a novel f
ramework for M2M communications in vehicular ad-hoc networks (VANETs) with WNV. In the proposed framework, according to different applications and quality of service (QoS) requirements of vehicles, a hypervisor enables the virtualization of the physical vehicular network, which is abstracted and sliced into multiple virtual networks. Moreover, the process of resource blocks (RBs) selection and random access in each virtual vehicular network is formulated as a partially observable Markov decision process (POMDP), which can achieve the maximum reward about transmission capacity. The optimal policy for RBs selection is derived by virtue of a dynamic programming approach. Extensive simulation results with different system parameters are presented to show the performance improvement of the proposed scheme.
Information security is an important issue in vehicular networks as the accuracy and integrity of information is a prerequisite to satisfactory performance of almost all vehicular network applications. In this paper, we study the information security
of a vehicular ad hoc network whose message may be tampered by malicious vehicles. An analytical framework is developed to analyze the process of message dissemination in a vehicular network with malicious vehicles randomly distributed in the network. The probability that a destination vehicle at a fixed distance away can receive the message correctly from the source vehicle is obtained. Simulations are conducted to validate the accuracy of the theoretical analysis. Our results demonstrate the impact of network topology and the distribution of malicious vehicles on the correct delivery of a message in vehicular ad hoc networks, and may provide insight on the design of security mechanisms to improve the security of message dissemination in vehicular networks.
Ad hoc network is a collection of different types of nodes, which are connected in heterogeneous or homogeneous manner. It is also known as self-organizing-wireless network. The dynamic nature of ad hoc networks make them more attractive, which is us
ed in many different applications. Every coin has two sides: one is the advantage part and other is disadvantages, in the same manner nature of ad hoc network make it more attractive from one side in other hand there are some issues too. Energy efficiency is a core factor which effects on ad hoc network in terms of battery life, throughput, overhead of messages, transmission error. For solving issues of energy constraints, different mechanisms are proposed by various researchers. In this paper, we survey various existing schemes which attempt to improve energy efficiency of different types of ad hoc routing protocol to increase network lifetime. Furthermore we outline future scope of these existing schemes which may help researches to carry out further research in this direction.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
