ترغب بنشر مسار تعليمي؟ اضغط هنا

GSTR: Secure Multi-hop Message Dissemination in Connected Vehicles using Social Trust Model

65   0   0.0 ( 0 )
 نشر من قبل Mohammad S Khan
 تاريخ النشر 2019
  مجال البحث الهندسة المعلوماتية
والبحث باللغة English




اسأل ChatGPT حول البحث

The emergence of connected vehicles paradigm has made secure communication a key concern amongst the connected vehicles. Communication between the vehicles and Road Side Units (RSUs) is critical to disseminate message among the vehicles. We focus on secure message transmission in connected vehicles using multi_hop social networks environment to deliver the message with varying trustworthiness. We proposed a Geographic Social Trust Routing (GSTR) approach; messages are propagated using multiple hops and by considering the various available users in the vehicular network. GSTR is proposed in an application perspective with an assumption that the users are socially connected. The users are selected based on trustworthiness as defined by social connectivity. The route to send a message is calculated based on the highest trust level of each node by using the nodes social network connections along the path in the network. GSTR determines the shortest route using the trusted nodes along the route for message dissemination. GSTR is made delay tolerant by introducing message storage in the cloud if a trustworthy node is unavailable to deliver the message. We compared the proposed approach with Geographic and Traffic Load based Routing (GTLR), Greedy Perimeter Stateless Routing (GPSR), Trust-based GPSR (T_GPSR). The performance results obtained show that GSTR ensures efficient resource utilization, lower packet losses at high vehicle densities.



قيم البحث

اقرأ أيضاً

With geographic message dissemination, connected vehicles can be served with traffic information in their proximity, thereby positively impacting road safety, traffic management, or routing. Since such messages are typically relevant in a small geogr aphic area, servers only distribute messages to affected vehicles for efficiency reasons. One main challenge is to maintain scalability of the server infrastructure when collecting location updates from vehicles and determining the relevant group of vehicles when messages are distributed to a geographic relevance area, while at the same time respecting the individual users privacy in accordance with legal regulations. In this paper, we present a framework for geographic message dissemination following the privacy-by-design and privacy-by-default principles, without having to accept efficiency drawbacks compared to conventional server-client based approaches.
Secure message dissemination is an important issue in vehicular networks, especially considering the vulnerability of vehicle to vehicle message dissemination to malicious attacks. Traditional security mechanisms, largely based on message encryption and key management, can only guarantee secure message exchanges between known source and destination pairs. In vehicular networks however, every vehicle may learn its surrounding environment and contributes as a source, while in the meantime act as a destination or a relay of information from other vehicles, message exchanges often occur between stranger vehicles. For secure message dissemination in vehicular networks against insider attackers, who may tamper the content of the disseminated messages, ensuring the consistency and integrity of the transmitted messages becomes a major concern that traditional message encryption and key management based approaches fall short to provide. In this paper, by incorporating the underlying network topology information, we propose an optimal decision algorithm that is able to maximize the chance of making a correct decision on the message content, assuming the prior knowledge of the percentage of malicious vehicles in the network. Furthermore, a novel heuristic decision algorithm is proposed that can make decisions without the aforementioned knowledge of the percentage of malicious vehicles. Simulations are conducted to compare the security performance achieved by our proposed decision algorithms with that achieved by existing ones that do not consider or only partially consider the topological information, to verify the effectiveness of the algorithms. Our results show that by incorporating the network topology information, the security performance can be much improved. This work shed light on the optimum algorithm design for secure message dissemination.
In this paper, we consider context-awareness to enhance route reliability and robustness in multi-hop cognitive networks. A novel context-aware route discovery protocol is presented to enable secondary users to select the route according to their QoS requirements. The protocol facilitates adjacent relay selection under different criteria, such as shortest available path, route reliability and relay reputation. New routing and security-based metrics are defined to measure route robustness in spatial, frequency and temporal domains. Secure throughput, defined as the percentage of traffic not being intercepted in the network, is provided. The resources needed for trading are then obtained by jointly optimizing secure throughput and trading price. Simulation results show that when there is a traffic imbalance of factor 4 between the primary and secondary networks, 4 channels are needed to achieve 90% link reliability and 99% secure throughput in the secondary network. Besides, when relay reputation varies from 0.5 to 0.9, a 20% variation in the required resources is observed.
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.
Wireless communication is a basis of the vision of connected and automated vehicles (CAVs). Given the heterogeneity of both wireless communication technologies and CAV applications, one question that is critical to technology road-mapping and policy making is which communication technology is more suitable for a specific CAV application. Focusing on the technical aspect of this question, we present a multi-scale spatiotemporal perspective of wireless communication technologies as well as canonical CAV applications in active safety, fuel economy and emission control, vehicle automation, and vehicular infotainment. Our analysis shows that CAV applications in the regime of small spatiotemporal scale communication requirements are best supported by V2V communications, applications in the regime of large spatiotemporal scale communication requirements are better supported by cellular communications, and applications in the regime of small spatial scale but medium-to-large temporal scale can be supported by both V2V and cellular communications and provide the opportunity of leveraging heterogeneous communication resources.
التعليقات
جاري جلب التعليقات جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا