Performance Analysis Of Broadcast Protocols Research Articles

Performance analysis of broadcast protocol for streets in vehicular ad-hoc networks

Vehicular Ad-Hoc Network (VANET) is an emerging technology which allows vehicles on the roads to communicate and exchange information with each other. Broadcast in VANET has gained a lot of attention because it is used as a building block in many VANET applications. Recently, Cell Broadcast for Streets (CB-S), a cell-based algorithm has been proposed and showed better performance compared to different classes of broadcast protocols in VANET. This paper proposes an enhancement of CB-S protocol called Efficient Broadcast for Streets (EB-S). The new efficient broadcast protocol EB-S does not use a cell-based approach as in CB-S which simplifies the implementation. It addresses CB-S limitations by selecting rebroadcast nodes as the farthest nodes within the transmission range compared to only nodes located in any other cell in CB-S. Analytical model and simulation study show that EB-S outperforms considerably the original CB-S in terms of reachability and end-to-end delay under different traffic, density, and mobility conditions.

Performance analysis of broadcast protocol for streets in vehicular ad-hoc networks

Performance analysis of broadcast protocol for streets in vehicular ad-hoc networks

A Novel Unified Analytical Model for Broadcast Protocols in Multi-Hop Cognitive Radio Ad Hoc Networks

Broadcast is an important operation in wireless ad hoc networks where control information is usually propagated as broadcasts for the realization of most networking protocols. In traditional ad hoc networks, since the spectrum availability is uniform, broadcasts are delivered via a common channel which can be heard by all users in a network. However, in cognitive radio (CR) ad hoc networks, different unlicensed users may acquire different available channels depending on the locations and traffic of licensed users. This non-uniform channel availability leads to several significant differences and causes unique challenges when analyzing the performance of broadcast protocols in CR ad hoc networks. In this paper, a novel unified analytical model is proposed to address these challenges. Our proposed analytical model can be applied to any broadcast protocol with any CR network topology. We propose to decompose an intricate network into several simple networks which are tractable for analysis. We also propose systematic methodologies for such decomposition. Results from both the hardware implementation and software simulation validate the analysis well. To the best of our knowledge, this is the first analytical work on the performance analysis of broadcast protocols for multi-hop CR ad hoc networks.

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

Self-pruning is an effective scheme for efficient broadcasting in ad hoc wireless networks. In a self-pruning broadcast protocol, a node may not forward a broadcast packet if a certain self-pruning condition is satisfied based on the neighborhood information. In a static network with an ideal MAC layer, only a subset of nodes forward the broadcast packet and still guarantee the complete network delivery. Various protocols have been proposed with different self-pruning conditions. Recently, a generic self-pruning protocol was proposed by Wu and Dai (2003), which combines the strength of previous conditions and is more effective. In this paper, we first propose an enhanced version of the generic protocol, which is more elegant in interpreting existing protocols and has a simpler correctness proof. Then, we evaluate the performance of the family of self-pruning protocols under various network situations with ns2. The objective is to observe the efficiency and reliability of these protocols as a function of network density, congestion, and mobility, and provide a guideline of implementation in the "real world". Our performance analysis reveals that the protocol reliability is barely affected by packet collision. However, most self-pruning protocols suffer from low delivery ratio in highly mobile networks. We further explore various techniques that improve the delivery ratio and show that both high efficiency and reliability can be achieved in highly mobile networks.