A mobicast routing protocol with carry-and-forward in vehicular ad-hoc networks

Chen, Yuh‐Shyan; Lin, Yun‐Wei; Lee, SingLing

doi:10.4108/chinacom.2010.33

Cited by 13 publications

(20 citation statements)

References 2 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This issue is more frequent in flooding-based dissemination protocols. Several solutions that are based on relaying and opportunistic forwarding have been proposed [11,6,9,8,4,5,20,17,1,23,15,14] to overcome this problem. As discussed in the next sections, although the proposed solutions do overcome the broadcast storm problem, they often fail to consider other problems such as network partitioning and temporal network fragmentation.…”

Section: Broadcast Storm Problemmentioning

confidence: 99%

“…Chen et al [5] extends the Mobicast protocol considering the use of a buffering strategy (carry and forward) to overcome network partitions in sparse networks. Although the carry-and-forward strategy minimizes the network partition problem, it increases packet delay, which might be unacceptable for many VANET applications.…”

Section: Data Dissemination Protocolsmentioning

confidence: 99%

“…Therefore, the capability of performing data dissemination across network partitions with short delay and low overhead is an important research issue. Some techniques may alleviate this problem [5,8,20], by relying on vehicles coming from different directions to store and forward data and assist in delivering messages across partitions. The drawback of such solution is that delay bounds are unknown.…”

Section: Network Partition Problemmentioning

confidence: 99%

“…However, it can increase data traffic, leading to packet collisions, contention, and interference. Vehicle-to-Vehicle (V2V) data dissemination: In this category, communication protocols do not require any infrastructure and vehicles communicate solely in ad hoc mode [1,[4][5][6]9]. For instance, considering the flooding approach, data is broadcasted to all neighboring vehicles, which will store and forward packets to their neighboring vehicles.…”

Section: Data Dissemination In Vanetsmentioning

confidence: 99%

See 3 more Smart Citations

DRIVE: An efficient and robust data dissemination protocol for highway and urban vehicular ad hoc networks

et al. 2014

View full text Add to dashboard Cite

Section: Broadcast Storm Problemmentioning

confidence: 99%

Section: Data Dissemination Protocolsmentioning

confidence: 99%

Section: Network Partition Problemmentioning

confidence: 99%

Section: Data Dissemination In Vanetsmentioning

confidence: 99%

See 2 more Smart Citations

DRIVE: An efficient and robust data dissemination protocol for highway and urban vehicular ad hoc networks

et al. 2014

View full text Add to dashboard Cite

“…The optimal computation of ZoF must be done to avoid wastage of channel resources and temporal network fragmentations which can occur because of larger and smaller ZoF area respectively. Chen et al [34] have defined zone of relevance area within which all vehicles receive messages that were routed through mobicast protocol. The store-carry-forward strategy was applied in this scheme.…”

Section: Zone Formation-basedmentioning

confidence: 99%

ReIDD: reliability-aware intelligent data dissemination protocol for broadcast storm problem in vehicular ad hoc networks

2016

View full text Add to dashboard Cite

Vehicular ad hoc networks (VANETs) have emerged as fast growing networks with aims to provide safety, and comfort to the onboard passengers. But, in this environment reliable data dissemination to the destination nodes is one of the biggest challenges as there may be a congestion in the network due to blind flooding of messages to their final destination, called as broadcast storm which may lead to the performance degradation with respect to the metric such as-message delivery, reliability and response time.To address this issue, in this paper, we propose a reliabilityaware intelligent data dissemination protocol for broadcast storm problem in VANETs. We have solved the above specified problem using game theory concepts in which players, strategy space and decisions with respect to the current state of the system. To reduce the message overhead with respect to the communication cost among the players of the game, in the proposed scheme, messages are routed to the next destination by selecting the most reliable path in an intelligent manner. A coalition game is formulated among the vehicles by considering vehicles as the players in the game. Each player in the game has an initial payoff value based upon the parameters such as-communication range, storage requirements, and computation power. Based upon the payoff value of the players in the game, different coalitions/clusters are formulated among the players in the proposed scheme. Then, the players send the messages to the other vehicles/players within B Neeraj Kumar the same coalition which increases the reliability of transmission. In the proposed scheme, messages are unicasted to their final destination in an intelligent manner. Different algorithms are designed for coalition formation, maintenance, and reliability-aware data dissemination. The performance of the proposed scheme is evaluated using various evaluation metrics such as-service time, packet delivery ration, and throughput. The results obtained prove the effectiveness of the proposed scheme as compared to the other state-of-the-art existing schemes.

show abstract

Robust geocast routing protocols for safety and comfort applications in VANETs

Bousbaa

Zhou

Lagraa

et al. 2015

Wireless Communications

View full text Add to dashboard Cite

Routing in cooperative vehicular networks is a challenging task because of high mobility of vehicles and difficulty of localization. In this paper, we study the geocast routing problem in Vehicular Ad‐hoc NETworks (VANETs), which aims at delivering data to a specific group of mobile vehicles identified by their geographical location. Although many geocast routing protocols have been proposed, only partial inherent constraints of VANETs (such as mobility, internal network fragmentation problem, external network fragmentation problem, and overload) are taken into account. Therefore, we propose two novel and robust geocast routing protocols: the first one, called Robust Geocast Routing Protocol for Safety Applications (RGRP‐SA), is dedicated to road safety applications, while the second, namely, Robust Geocast Routing Protocol for Comfort Applications (RGRP‐CA), is designed for comfort applications. Simulations conducted in NS‐2 demonstrate that our safety‐oriented RGRP‐SA protocol outperforms Inter‐Vehicle Geocast protocol and Mobicast Routing Protocol in VANETs by sending up to 25% more packets, cutting the end‐to‐end delay in half, and solving the internal network fragmentation problem. Besides, it is also shown that our comfort‐oriented RGRP‐CA protocol serves well comfort applications with only light overhead by solving internal and external network fragmentation problems and providing more reliable data delivery (with a 25% higher packet delivery ratio) and higher network throughput utilization in comparison with Mobicast with Carry‐and‐Forward protocol. Copyright © 2015 John Wiley & Sons, Ltd.

show abstract

A mobicast routing protocol with carry-and-forward in vehicular ad-hoc networks

Cited by 13 publications

References 2 publications

DRIVE: An efficient and robust data dissemination protocol for highway and urban vehicular ad hoc networks

DRIVE: An efficient and robust data dissemination protocol for highway and urban vehicular ad hoc networks

ReIDD: reliability-aware intelligent data dissemination protocol for broadcast storm problem in vehicular ad hoc networks

Robust geocast routing protocols for safety and comfort applications in VANETs

Contact Info

Product

Resources

About