Adaptive multihop broadcast protocols for ad hoc networks

Kokuti, Andras; Simon, Vilmos

doi:10.1109/csndsp.2012.6292702

Cited by 7 publications

(5 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Indeed, many approaches, including counter-based, area-based, or RAD-based ones, rely on thresholds for decision making, but finding the appropriate value that fits rapidly evolving MANETs is a very complex task that highly influences the performance of the protocols. [Ni et al 1999] local -yes no sourceindependent Hyper-flooding [Viswanath and Obraczka 2002] Probabilistic flooding [Ni et al 1999] local -no no sourceindependent SAPF [Mylonas et al 2008] [Banerjee et al 2012] [Gang et al 2012] DibA ] [Slavik and Mahgoub 2010] Weighted/slotted 1/p -persistent local 1-hop no yes sourceindependent Rewarn ] Distance-to-mean [Slavik et al 2011] Defer time [Sun and Lai 2002] Gossip-based broadcast [Kermarrec et al 2003] local 1-hop no no sourceindependent n th power p-persistent [Zhou et al 2010] Adaptive counter [Tseng et al 2002] Color-based [Keshavarz-Haddad et al 2006] DIS RAD [Chen et al 2005] [Al-Humoud et al 2008] ProbA Fuzzy logic probabilistic [Liarokapis and Shahrabi 2011] DBHG/VBHG/AVBHG [Kokuti and Simon 2012] DAD-NUM/PER [Chen et al 2002] local 1-hop yes no sourceindependent BMBD [Kasamatsu et al 2009] Optimized broadcast protocol [Durresi et al 2005] Geoflood [Arango et al 2004] Six-shot broadcast [Garbinato et al 2008] local -yes yes sourceindependent Optimized flooding protocol [Paruchuri et al 2003] local 1-hop yes yes sourceindependent [CAO et al 2007] [Tseng et al 2002] [Gang et al 2012] local 1-hop yes/no yes sourceindependent ABBA [Ovalle-Martínez et al 2006] local -yes/no yes sourceindependent In this work, we classified the protocols and present a summary of their main features using tables. In these tables, Neigh., Hops, Determ.…”

Section: Area-based Approachesmentioning

confidence: 99%

See 1 more Smart Citation

Survey on Broadcast Algorithms for Mobile Ad Hoc Networks

Ruiz

Bouvry

2015

ACM Comput. Surv.

View full text Add to dashboard Cite

Networking at any time and any place paves the way for a large number of possible applications in ad hoc networks, from disaster relief in remote areas to network extension. Thus, for the past decades, many works have been proposed trying to make ad hoc networks a reality. The importance of broadcasting in networking and the broadcast nature of the wireless medium have encouraged researchers to join their efforts on designing efficient dissemination algorithms for Mobile Ad Hoc Networks (MANETs). The many different challenges that MANETs face, such as limited network resources, network partitions, or energy restrictions, gave rise to many different approaches to overcome one or more of those problems. Therefore, literature reveals a huge variety of techniques that have been proposed for efficient message dissemination. In this article, we make an in-depth review of the existing state-of-the-art techniques, as well as propose a new taxonomy that provides a global overview of the most relevant existing algorithms.

show abstract

Section: Area-based Approachesmentioning

confidence: 99%

“…Three different stochastic approaches are presented in Kokuti and Simon [2012]. The first one, Distance-Based Handshake Gossiping (DBHG) is a distance-based protocol where the source node indicates the forwarding probability of neighboring nodes in terms of their distance to itself.…”

Section: Area-based Approachesmentioning

confidence: 99%

Survey on Broadcast Algorithms for Mobile Ad Hoc Networks

Ruiz

Bouvry

2015

ACM Comput. Surv.

View full text Add to dashboard Cite

show abstract

“…In [26] the authors consider the available bandwidth to chose the best nodes to disseminate the emergency message. The works in [27], [28] consider the existence of specific control messages to coordinate the process to choose the nodes disseminating the messages.…”

Section: Related Workmentioning

confidence: 99%

When Backscatter Communication Meets Vehicular Networks: Boosting Crosswalk Awareness

et al. 2020

View full text Add to dashboard Cite

The research of safety applications in vehicular networks has been a popular research topic in an effort to reduce the number of road victims. Advances on vehicular communications are facilitating information sharing through real time communications, critical for the development of driving assistance systems. However, the communication by itself is not enough to reach the most desired target as we need to know which safety-related information should be disseminated. In this work, we bring passive sensors and backscatter communication to the vehicular network world. The idea is to increase the driver (or vehicle) awareness regarding the presence of pedestrians in a crosswalk. Passive sensors and backscatter communication technologies are used for the pedestrians' detection phase, while the vehicular network is used during the dissemination of the detection information to surrounding vehicles. The proposed solution was validated through end-to-end experimentation, with real hardware and in a real crosswalk with real pedestrians and vehicles, demonstrating its applicability. INDEX TERMS Vulnerable road users, driver assistance systems, connected vehicles, passive sensors, energy harvesting, backscatter communication, vehicular networks, decentralized message dissemination.

show abstract

“…Determining the optimal configuration for a MANET broadcast algorithm is difficult. Kokuti and Vilmos [33] propose adaptation techniques to dynamically decide on parameters in controlled flooding. Tseng, Ni and Shih [22] similarly propose the ACF adaptation mechanism that we used in our evaluation ( §VI).…”

Section: Related Workmentioning

confidence: 99%

Emergent Overlays for Adaptive MANET Broadcast

Carvajal-Gómez

Elkhatib

Réveillère

et al. 2019

2019 38th Symposium on Reliable Distributed Systems (SRDS)

View full text Add to dashboard Cite

Mobile Ad-Hoc Networks (MANETs) allow distributed applications where no fixed network infrastructure is available. MANETs use wireless communication subject to faults and uncertainty, and must support efficient broadcast. Controlled flooding is suitable for highly-dynamic networks, while overlay-based broadcast is suitable for dense and more static ones. Density and mobility vary significantly over a MANET deployment area. We present the design and implementation of emergent overlays for efficient and reliable broadcast in heterogeneous MANETs. This adaptation technique allows nodes to automatically switch from controlled flooding to the use of an overlay. Interoperability protocols support the integration of both protocols in a single heterogeneous system. Coordinated adaptation policies allow regions of nodes to autonomously and collectively emerge and dissolve overlays. Our simulation of the full network stack of 600 mobile nodes shows that emergent overlays reduce energy consumption, and improve reliability and coverage compared to single protocols and to two previouslyproposed adaptation techniques.

show abstract

Adaptive multihop broadcast protocols for ad hoc networks

Cited by 7 publications

References 14 publications

Survey on Broadcast Algorithms for Mobile Ad Hoc Networks

Survey on Broadcast Algorithms for Mobile Ad Hoc Networks

When Backscatter Communication Meets Vehicular Networks: Boosting Crosswalk Awareness

Emergent Overlays for Adaptive MANET Broadcast

Contact Info

Product

Resources

About