A High Performance Cluster-Based Flooding Algorithm for Wireless Ad Hoc Networks

Purtoosi, R.; Taheri, Hassan; Mohammadi, Abbas; Foroozan, Foroohar

doi:10.1109/cit.2005.14

Cited by 4 publications

(1 citation statement)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The first type of solutions is clustering-based broadcasting [25], [28], [29]. The algorithms achieve broadcasting by sending messages to voted cluster headers.…”

Section: Broadcasting Algorithmsmentioning

confidence: 99%

Virtual Surrounding Face Geocasting in Wireless Ad Hoc and Sensor Networks

Lian

Naik

Chen

2009

IEEE/ACM Trans. Networking

View full text Add to dashboard Cite

Abstract-Geocasting in wireless sensor and ad hoc networks means delivering a message from a source node to all the nodes in a given geographical region. The objectives of a geocasting protocol are two-fold: guaranteed message delivery and low transmission cost. Most of the existing protocols do not guarantee message delivery, and those that do, incur high transmission costs.In this study, we propose the concept of Virtual Surrounding Face (VSF), and design a VSF-based geocasting protocol (VSFG). We also design a SKIP method and a local dominating set (DS) based restricted flooding technique to further reduce the cost of VSFG. Through mathematical analysis and comprehensive simulations, we show that VSFG, together with SKIP and local DS based restricted flooding, guarantees message delivery and has a much lower transmission cost than the previous approaches. The reduction of cost can be up to 65% compared with the most efficient existing approach.Index Terms-Ad hoc networks, geocasting, virtual surrounding face, wireless sensor networks.

show abstract

“…The first type of solutions is clustering-based broadcasting [25], [28], [29]. The algorithms achieve broadcasting by sending messages to voted cluster headers.…”

Section: Broadcasting Algorithmsmentioning

confidence: 99%

Virtual Surrounding Face Geocasting in Wireless Ad Hoc and Sensor Networks

Lian

Naik

Chen

2009

IEEE/ACM Trans. Networking

View full text Add to dashboard Cite

show abstract

Cluster‐based emergency message dissemination strategy for VANET using V2V communication

Benkerdagh

Duvallet

2019

Int J Communication

View full text Add to dashboard Cite

Data dissemination in vehicular ad hoc network (VANET) is emerging as a critical area of research. One of the challenges posed by this domain is the reliability of connection, which depends on many parameters, such as the bandwidth consumption, transmission delay, and data quality of service (QoS). Dissemination of emergency messages is very critical since the network topology is changing frequently and rapidly, which leads to data loss. So, it is necessary to develop new protocols and enhance dissemination schemes in VANET to avoid more emergencies and hazards cases. In this regard, we have proposed a new strategy, which consists of data handling before dissemination process as the first step of our scheme. In this phase, the original message is optimized in order to reduce the number of exchanged packets. The second part of this proposition consists of constructing fast and stable clusters to improve the message delivery time and to procure efficient bandwidth consumption. This approach is based on a Fitness function, which takes into account different parameters such as the transmission period, the connectivity degree, the relative velocity, and the link lifetime validity. Since exchanging data in VANET is an important process, routing phase is proposed to perform data exchange among clusters. It is based on a rapid and real-time heuristic (real-time adaptive A* [RTAA*]). To evaluate the reliability of the proposed approach, an urban scenario is used with different simulation parameters. The simulation results show that our proposed approach presents a better stability and efficiency performance compared with the discussed approaches. The proposed approach improves the performance of cluster duration (5% − 25%), delivery rate (2% − 8%), and the overhead (5% − 35%) on average compared with the discussed approaches. KEYWORDS clustering algorithm, data dissemination, Fitness function, quality of service, routing, transmission delay Int J Commun Syst. 2019;32:e3897.wileyonlinelibrary.com/journal/dac

show abstract