Citation Context

...also seek to combat collisions with that of the hidden nodes’. In [5], the authors repeatedly transmit packets within randomly selected time slots in the current frame. In order to reduce collisions, =-=[8]-=- proposes predetermined transmission patterns for each node. Here, nodes are allocated minimally correlated codewords that indicate the specific time slots assigned to each as their retransmission opp...

Citation Context

...ge Communications (DSRC) service [1] in order to improve road safety, traffic efficiency, and driving convenience. The research on VANETs focuses on applications [2] including prevention of collision =-=[3]-=-, real-time detour routes computation, and Internet downloading. Many VANET applications are heavily dependent on the message dissemination in specific geographic regions, which is referred to as geoc...

Citation Context

... our approach can achieve a delivery ratio close to that of the flooding-based approach while the cost is reduced by over 80%. Index Terms—sparse vehicular networks, multicast, trajectory, encounter prediction. F 1 INTRODUCTION Recent advances in short-range radio technology such as Dedicated Short Range Communications (DSRC) [1] [2] for inter-vehicle communications have driven significant efforts in investigating and developing vehicular networks. By sharing information among moving vehicles, a vehicular network can support a wide variety of real-world applications, including emergence alert [3], advertisement, file sharing [4] [5], data collection [6], etc. Information and message exchanges through multicast, where packets are sent from one sender to a group of receivers, have gained popular use and serve as a crucial routine operation in vehicular networks. For example, the taxis in a city may form an information network where each taxi may collect various types of information such as road surface condition, road closure status due to maintenance and traffic accidents. For more efficient information dissemination, a taxi can subscribe for some types • Manuscript received on Sep 5, ...

Citation Context

... inferring actual P-Spots. For simplicity, P-Spots can be represented by the bound in the X-dimension in our paper, as the example shown in Fig. 4.2. Note that scattered small spots (e.g., [6, 7] and =-=[17, 18]-=- on Lane 1 in Fig. 4.2) are most possibly not actual problematic spots but caused by random movement of vehicles. To exclude these spots, the length of a P-Spot should be greater than a certain minimu...

Citation Context

...s mostly led by the ad hoc networking community, seeks to propose efficient algorithms to enhance the networking metrics (such as throughput and/or delay, based on the specific application) in VANETs =-=[19, 25, 39, 77, 79]-=-. The main challenge there is to come up with schemes that can cope with the specific networking restrictions of such environments such as the fast changing topology and the high mobility of nodes. Th...

Citation Context

...tween these junctions. In recent years, the interest in VANETs research has dramatically increased. The applications in vehicular safety have widely been discussed by the National Highway Traffic Safety Administration (NHTSA) [14, 15, 16]. For example, the Vehicle Safety Communications (VSC) Project brings BMW, DCRTNA, Ford, GM, Nissan, Toyota, and VW together to work cooperatively. The VSC Project identifies vehicle safety applications enabled by DSRC communications. Safety applications rely on broadcasting. There is some previous research that addresses the broadcast messaging in VANETs. In [17, 18, 19], for example, Tonguz et al. proposed a distributed vehicular broadcasting protocol (DV-CAST), which makes local routing decisions based on a vehicle’s connectivity. Farnoud et al. in [20, 21, 22] used a positive orthogonal code to distribute a transmission pattern for broadcast messages. ISSN: 2319-8753 International Journal of Innovative Research in Science, Engineering and Technology (An ISO 3297: 2007 Certified Organization) Vol. 3, Issue 7, July 2014 Copyright to IJIRSET www.ijirset.com 14982 Figure 1 Routing flow algorithm for the RSU-advertising model[23] III PROBLEM AT INTERSECTION In ...

Citation Context

...thm in multi-hop mobile ad hoc networks is a challenging research issue. To achieve efficiency and robustness in the wireless environment, topology-transparent algorithms have been proposed [1], [2], =-=[3]-=-, [4], [5]. In these algorithms, collisions may occur but no topology information is used, and hence no topology updates are required. In [2], the authors employed the Galois field coding theory [6] t...

Citation Context

...nodes to store the message before passing it on to the next node. Numerous works have taken advantage of DTNs to set up their own models under various conditions, including: vehicular ad hoc networks =-=[3]-=-, deep-space interplanetary networks [4], underwater networks [5], military networks [6], etc. Yet, to study DTNs’ various characters, while challenging, is still a meaningful task. Some of the fascin...

Citation Context

...rk have been studied by several researchers. For example, Reed–Solomon codes are used to generate the schedules of packet transmissions in [11] and [12], optical orthogonal codes are used in [13] and =-=[14]-=-, and Gold sequences are used in [15]. One key property of protocol sequences is that they are designed to accommodate asynchronous users, which is an indispensable feature in the VANET application. T...

Citation Context

...gonal code to distribute a transmission pattern for broadcast messagessperformance in terms of the success probability and the average delay in message delivery was reported.sM. Torrent-Moreno et al. =-=[13]-=- proposed a distributed transmit power control method based on a strict fairness criterionsto control the load of periodic messages on the channel and to avoid saturated channel conditionssIn [14] P. ...