Nowa wersja platformy, zawierająca wyłącznie zasoby pełnotekstowe, jest już dostępna.
Przejdź na https://bibliotekanauki.pl
Preferencje help
Widoczny [Schowaj] Abstrakt
Liczba wyników

Znaleziono wyników: 4

Liczba wyników na stronie
first rewind previous Strona / 1 next fast forward last
Wyniki wyszukiwania
Wyszukiwano:
w słowach kluczowych:  VANET
help Sortuj według:

help Ogranicz wyniki do:
first rewind previous Strona / 1 next fast forward last
EN
A special type of Mobile Ad-hoc Networks (MANETs) which has frequent changes of topology and higher mobility is known as Vehicular Ad-hoc Networks (VANETs). In order to divide the network into groups of mobile vehicles and improve routing, data gathering, clustering is applied in VANETs. A stable clustering scheme based on adaptive multiple metric combining both the features of static and dynamic clustering methods is proposed in this work. Based on a new multiple metric method, a cluster head is selected among the cluster members which is taken from the mobility metrics such as position and time to leave the road segment, relative speed and Quality of Service metrics which includes neighborhood degree, link quality of the RSU and bandwidth. A higher QoS and cluster stability are achieved through the adaptive multiple metric. The results are simulated using NS2 and shows that this technique provides more stable cluster structured with the other methods.
EN
Vehicular Ad-Hoc Networks (VANETs) are getting more and more commercial relevance, because it offers a new level of vehicle communication services. One of the main problems of the analyzed communication system is the security assurance of transmitted data because security mechanisms common in wireless LANs are not suitable for VANETs and handoff latency is crucial. In this paper, VANET authentication schemes are analyzed and a new trust based authentication scheme is proposed which significantly can reduce the handoff latency time.
PL
Samochodowe sieci Ad-Hoc (VANETs) mają coraz większe znaczenie komercyjne, ponieważ oferują nowy poziom usług komunikacji pojazdu. Jednym z głównych problemów analizowanego systemu komunikacji jest zapewnienie bezpieczeństwa przesyłanych danych, ponieważ mechanizmy bezpieczeństwa powszechne w bezprzewodowych sieciach LAN nie nadają się do sieci typu VANET, a wartość opóźnienia ma kluczowe znaczenie. W niniejszej pracy przeanalizowano metody uwierzytelniania systemów VANET i zaproponowano nowy system bezpieczeństwa oparty na uwierzytelnianiu, co może znacznie zmniejszyć czasy opóźnień.
3
Content available remote Vehicular Ad-Hoc Network for Smart Cities
89%
EN
The rapid increase in urban population is alleviating various kinds of problems such as long hours traffic-jams, pollution which is making cities life insecure and non-livable. The notion of a smart city is proposed to improve the quality of life. Smart cities are emerging to fulfill the desire for the safety of its users' and secure journeys over in the urban scenario by developing the smart mobility concept. At the same time, Vehicular Ad-hoc networks are widely accepted to attain such idea, by providing safety and non-safety applications. However, VANET has its own challenges from node mobility to location privacy. This paper discusses the application areas, security threats and their consequences of VANET into the smart city.
4
Content available remote Optimal Roadside Gateway Deployment for VANETs
88%
EN
VANETs allowing the mobile vehicles exchange data with the roadside gateways are being used in various applications such as local electronic advertisement, intelligent transportation system and urban data collection. In this paper, we study the problem of deploying the gateways to provide the desired communication performance while minimizing the deployment cost. The key idea of our solution is to exploit the time-stable vehicular mobility pattern to find the optimal deployment places. We propose a graph model to characterize the observed mobility pattern. Then the gateway deployment problem is transformed into a vertex selection problem in a graph. By reducing it the minimum vertex coverage problem, we show the gateway deployment problem is NP-complete, so a heuristic algorithm MobGDeploy is proposed to search greedily the optimal deployment points. Extensive simulations are carried out to evaluate the performance, and the results show that the proposed algorithm outperforms others.
PL
W artykule analizowano problem rozlokowania wjazdów w celu osiągnięcia pożądanej jakości komunikacji. Przyjęto założenie stabilnej czasowo mobilności pojazdów. Zaproponowano model grafu do opisu mobilności pojazdów. Wykorzystano metodę VANET – vehicular ad hoc network.
first rewind previous Strona / 1 next fast forward last
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.