Performance analysis of broadcast protocols in ad hoc networks based on self-pruning

Dai, Fei; Wu, Jie

doi:10.1109/tpds.2004.69

Cited by 50 publications

(2 citation statements)

References 17 publications

(24 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Several protocols have been proposed for unicast (Johnson & Maltz, 1996;Perkins & Royer, 1999), multicast (Wu & Tay, 1999;Mnaouer et. al., 2007) and broadcast (Dai & Wu, 2004;Saha et. al., 2010) communication in MANETs.…”

Section: Introductionmentioning

confidence: 99%

Correlations between Centrality Measures for Mobile Ad hoc Networks

Meghanathan

2015

International Journal of Wireless Networks and Broadband Technologies

View full text Add to dashboard Cite

The author conducts an extensive correlation coefficient analysis of four prominent centrality measures for mobile ad hoc networks. The centrality measures considered are the degree-based degree centrality and eigenvector centrality, and the shortest path-based betweenness centrality and closeness centrality. The author evaluates the correlation coefficient between any two of the above four centrality measures as a function of network connectivity and node mobility. He observes a consistent ranking (with respect to the correlation coefficients) among the pairs of centrality measures for all levels of network connectivity, node mobility and across the duration of the simulation session. The shortest path-based closeness centrality measure exhibits high correlation with the degree-based centrality measures, whereas the betweenness centrality exhibits relatively weak correlation with the degree-based centrality measures. For a given level of node mobility and network connectivity, the author does not observe the correlation coefficient values between any two centrality measures to significantly change with time.

show abstract

Section: Introductionmentioning

confidence: 99%

Correlations between Centrality Measures for Mobile Ad hoc Networks

Meghanathan

2015

International Journal of Wireless Networks and Broadband Technologies

View full text Add to dashboard Cite

show abstract

“…The marking algorithm needs two-hop or three-hop network topology information. F. Dai [4] further extends the marking algorithm, presents a more general purpose Rulek broadcast algorithm. Rulek further eliminates some redundant node, improves the broadcast efficiency, but its calculation cost is much higher.…”

Section: Introductionmentioning

confidence: 99%

A Distributed Broadcast Algorithm Based on Master/Slave Dominators for Wireless Mesh Networks

Zhang

Wang

2013

AMM

View full text Add to dashboard Cite

We proposed a distributed broadcast algorithm which is based on master/slave dominator partition, it not only guarantees the full coverage of the network, but also has better scalability. In our algorithm, each node first selects its connected domination set (CDS) from its two hop neighbor graph, then partitions the domination nodes into master and slave dominators, master dominators forward the broadcast packet, slave dominators monitor the network coverage and forward the broadcast packet when necessary.

show abstract

Opportunistic Broadcasts in Vehicular Networks

Zeng

Lou

2011

Multihop Wireless Networks

View full text Add to dashboard Cite

In this chapter, we apply the concept of opportunistic routing in broadcasts in vehicular networks. Vehicular ad hoc network (VANET) is a special type of mobile MWN designed to provide a wide range of road applications such as safety warning (Torrent-Moreno et al. 2009;Xu et al. 2004), congestion avoidance or mobile infotainment (Li et al. 2011). One important function of VANET is the broadcast of event-driven warning messages (WMs) like accident and hazard warning, for example, after two vehicles collided with each other on a highway, or traffic congestion happens because of heavy rain or snow, the upcoming vehicles need to be notified immediately. In both cases, the WMs should be disseminated with only a short delay to vehicles that are up to several kilometers away, not only to prevent more possible accidents but also to enable the vehicles to make a detour as early as possible to avoid congestion. While Dedicated Short Range Communication (DSRC) (http://www.standards.its.dot.gov/Documents/advisories/dsrc advisory.htm) allows the data transmission range of vehicles to be up to a few hundred meters, a single-hop broadcast is not sufficient to provide the desired warning message coverage. So a multihop broadcast is necessary to disseminate time-sensitive warning messages in VANETs.There are three main performance goals in WM broadcast in VANETs. 1. High reliability, which is usually measured as the percentage of vehicles that received the warning message. 2. Fast dissemination-that is the warning messages should be delivered to the vehicles with short end-to-end delay. 3. High scalability, which means the WM's propagation should only incur a small transmission overhead (especially when the network is dense) because unnecessary transmissions waste Multihop Wireless Networks: Opportunistic Routing, First Edition.

show abstract

Performance analysis of broadcast protocols in ad hoc networks based on self-pruning

Cited by 50 publications

References 17 publications

Correlations between Centrality Measures for Mobile Ad hoc Networks

Correlations between Centrality Measures for Mobile Ad hoc Networks

A Distributed Broadcast Algorithm Based on Master/Slave Dominators for Wireless Mesh Networks

Opportunistic Broadcasts in Vehicular Networks

Contact Info

Product

Resources

About