A new phase for screening redundant broadcast nodes in source-independent broadcasting protocols

Following the distributed approach, source-independent broadcasting protocols select a subset of nodes in a network as broadcasting nodes to cover the entire network. The selection of broadcasting nodes is performed prior to actual message transmission. These broadcasting nodes collectively form a connected dominating set or CDS. Aiming at finding a minimum CDS, existing source-independent broadcasting protocols consist of two phases. In this paper, we propose to add a third phase to eliminate unnecessary nodes in a CDS while ensuring all remaining nodes are still connected. We call it the redundant node screening phase. This paper shows that this new phase is a very important element that has been ignored by existing source-independent broadcasting protocols. When applying the new phase on existing broadcasting protocols, the savings in terms of number of nodes in the CDS could be as high as 21% in a 1000m x 1000m network of 20 nodes. © 2011 IEEE.published_or_final_versionThe 2011 IEEE International Conference on Communications (ICC 2011), Kyoto, Japan, 5-9 June 2011. In Proceedings of the IEEE ICC, 2011, p. 1-

Broadcasting protocols for coordinating nonlinear network systems

We propose a new methodology to design broadcasting protocols for coordinating nonlinear network systems. Our design of the scheduling of information transmission is based on the introduction of clock variables, whose dynamics are regulated through a suitable storage function. Required clock dynamics, ensuring stability, follow then elegantly from Lyapunov like arguments. For illustrative purposes, we first consider an example of a consensus algorithm, whereafter we discuss a distributed integral controller in feedback interconnection to a network composed of output strictly incrementally passive subsystems. Finally, we show how the proposed method can be used to redesign a popular distributed controller in power grids, enabling a sampled-data implementation

A Voice for the Voiceless: Peer-to-peer Mobile Phone Networks for a Community Radio Service

We propose a new application for mobile ad-hoc networks (MANETs) – community radio. We argue how MANETS help overcome important limitations in how community radio is currently operationalized. We identify critical design elements for a MANET based community radio service and propose a broad architecture for the same. We then investigate a most critical issue– the choice of the network wide broadcast protocol for the audio content. We identify desired characteristics of a community radio broadcasting service. We choose and evaluate eight popular broadcasting protocols on these characteristics, to find the protocols most suited for our application.

Performance Evaluation of Broadcasting Protocols for Ad Hoc and Sensor Networks.

In ad hoc and sensor networks, the simplest and most widely used approach to broadcast is blind flooding, which lets every node in the network to rebroadcast a receiving packet to all its neighbors. This causes redundancy of broadcast packets and results in unnecessary collision and bandwidth waste. To overcome these problems, a number of research groups have proposed more efficient broadcasting schemes with the goal of minimizing the re-transmissions, while still guaranteeing that a broadcast packet is delivered to all the nodes in the network. Multipoint relay (MPR) and dominating set (DS) based broadcasting schemes can effectively improve the broadcasting efficiency while providing reliable broadcasting. The neighbor elimination scheme (NES) can improve any broadcasting protocol as an added feature. In this paper, we evaluate the performance of MPR (source dependent), MPR-DS (source-independent MPR), and DS based broadcasting protocols. We add NES to these three schemes separately and evaluate the performance of the resulted protocols. In our experiments, we use the random unit graphs to model the ad hoc and sensor networks. Each of the studied protocols has scenarios under which it has the best performance. Our experiments demonstrate that, without applying neighbor elimination scheme, MPR based protocol requires fewest retransmissions (however, each retransmission is with a longer message including list of forwarding neighbors). DS and MP-RDS schemes benefit significantly from the neighbor elimination technique in terms of the ratio of re-broadcasting nodes and the message redundancy on both transmitting and non-transmitting nodes, while MPR benefits marginally. After adding the neighbor elimination scheme, three new protocols behave almost equally well in terms of rebroadcast message counts. MPR-NES method is narrowly the best when the message that is broadcasted is very large one, and the network is dynamic. MPR-DS-NES is narrowly the best when the broadcast message is not very large, and the network is stable (this method requires the third round of preprocessing HELLO messages). Overall, DS-NES appears to be the most robust, taking all measurements and parameters into acount, because it remains competitive under all scenarios, and has significant advantages over MPR-DS-NES in dynamic scenarios, and significant advantages over MPR-NES when the broadcast message is not very large, because MPR has overhead in packet lengths

An adaptive quasi harmonic broadcasting scheme with optimal bandwidth requirement

The aim of Harmonic Broadcasting protocol is to reduce the bandwidth usage in video-on-demand service where a video is divided into some equal sized segments and every segment is repeatedly transmitted over a number of channels that follows harmonic series for channel bandwidth assignment. As the bandwidth of channels differs from each other and users can join at any time to these multicast channels, they may experience a synchronization problem between download and playback. To deal with this issue, some schemes have been proposed, however, at the cost of additional or wastage of bandwidth or sudden extreme bandwidth requirement. In this paper we present an adaptive quasi harmonic broadcasting scheme (AQHB) which delivers all data segment on time that is the download and playback synchronization problem is eliminated while keeping the bandwidth consumption as same as traditional harmonic broadcasting scheme without cost of any additional or wastage of bandwidth. It also ensures the video server not to increase the channel bandwidth suddenly that is, also eliminates the sudden buffer requirement at the client side. We present several analytical results to exhibit the efficiency of our proposed broadcasting scheme over the existing ones.Comment: IEEE International Conference on Informatics, Electronics & Vision (ICIEV), 2013, 6pages, 8 figure

Enhanced termination condition for deterministic broadcasting protocols in mobile ad hoc networks

Deterministic approach to broadcasting in Mobile Ad Hoc Networks (MANETs) is effective in reducing redundant broadcasting. In this approach, a transmitting node selects a subset of its immediate or 1-hop neighbors to rebroadcast the message such that all its 2-hop neighbors will receive the message, or being covered. In order to reduce redundant broadcasting, the set of 1-hop neighbors to be covered should be reduced as much as possible. Another important aspect that affects the effectiveness of a deterministic broadcasting protocol is the termination condition that inhibits a node from transmitting a particular message unnecessarily. However, existing termination conditions are not optimized. We propose a new covered/uncovered termination condition where each node is assigned with covered/uncovered status. In this paper, we show that our covered/uncovered termination condition ensures full network coverage, does not incur any control message overhead, and yet requires the least number of rebroadcasting nodes. When we apply the termination condition to some existing deterministic broadcasting protocols, the saving in the number of broadcasting nodes can be as significant as 45% when there are 100 nodes randomly distributed in an area of 1000 x 1000 m2. ©2010 IEEE.published_or_final_versionThe 72nd IEEE Vehicular Technology Conference (VTC 2010-Fall), Ottawa, ON., 6-9 September 2010. In Proceedings of the IEEE-VTS Vehicular Technology Conference, 2010, p. 1-

Variable power broadcasting based on local information for source-dependent broadcasting protocols

A typical broadcasting protocol for wireless network usually involves fixed transmission power that covers, for example an area within 250 meters (m). However, it is often unnecessary to broadcast using fixed power because a node that needs to be covered may just be 100m away. By reducing the transmission power enough to cover this node, energy expenditure would be reduced, thus, prolonging the lifetime of battery-powered wireless networks such as Mobile Ad Hoc Networks (MANETs) and Wireless Sensor Networks (WSNs). Existing source-dependent broadcasting protocols do not have any mechanisms for adjusting the transmission power of nodes. Therefore, this paper proposes some effective mechanisms based on local neighborhood knowledge, while ensuring the overall network is still covered. Results of extensive simulations confirm the effectiveness of the proposed protocols in reducing energy consumption. © 2011 IEEE.published_or_final_versionThe 2011 IEEE Wireless Communications and Networking Conference (WCNC), Cancun, Mexico, 28-31 March 2011. In Proceedings of IEEE WCNC, 2011, p. 796-80

A SURVEY ON TOPOLOGY-BASED MESSAGE BROADCAST SCHEMES IN VEHICULAR NETWORKS

Vehicular ad-hoc networks (VANETs) are subclass of mobile ad-hoc networks (MANETs). They have been the most promising research field and development for the last few years. VANETs use vehicles as mobile nodes to provide communication among nearby vehicles and between vehicles and nearby roadside equipment. VANETs come with several challenging characteristics, such as dynamic and potentially large scale network topology, high mobility and intermittent connectivity of vehicular nodes, and broadcasting as the predominant communication to disseminate the safety messages. When a traffic accident happens, the safety message should be broadcasted to all vehicles in the area exposed to potential hazard. Recently, there have been a significant number of broadcasting protocols for VANETs reported in the literature. In this survey paper we provide an overview of topology-based broadcasting protocols and associated requirements, along with challenges and their proposed current and past major solutions. In addition, classification and comparison of topology-based broadcasting protocols are described from their pros and cons. Featured solutions in this domain are categorized and discussed

Efficient Broadcasting for a Mobile Ad-hoc Network based Peer-to-peer Community Radio Service

Ad-hoc networks consisting entirely of simple mobile phones can be used to deploy village level telephony. We investigate a novel application for such networks – a peer-to peer community radio service. We envision a system, where any user in the network is equally empowered to generate and distribute audio content to the entire network, using his or her mobile phone. This study concentrates on a critical aspect of this service – the choice of the network-wide broadcast protocol. Using extensive simulations, we evaluate the suitability of various broadcast techniques for a rural peer-to-peer mobile adhoc network. Our simulations identify the best choice of protocols under various village network conditions while simultaneously identifying limitations of the current protocols.