Neighbourhood-aware counter-based broadcast scheme for wireless ad hoc networks

Broadcasting is a vital operation in mobile ad hoc networks (MANETs) and it is crucial to enhance its efficiency to ensure successful deployment. Although flooding is ideal for broadcast operations due to its simplicity and high reachability it suffers from high packet collision which can degrade network performance severely. Counter-based broadcast schemes have been introduced to alleviate the limitations of flooding. This study introduces an enhancement to counter-based broadcast by adjusting the threshold value and the Random Assessment Delay (RAD) using minimal neighbourhood information

An Adaptive Probabilistic Model for Broadcasting in Mobile Ad Hoc Networks

Ad hoc peer-to-peer mobile phone networks (phone MANETs) enable cheap village level telephony for cash-strapped, off-the-grid communities. Broadcasting is a fundamental operation in such manets and is used for route discovery. This paper proposed a new broadcast technique that is lightweight, efficient and incurs low latency. Using extensive simulations, we compare our proposed technique to existing lightweight protocols. The results show that our technique is successful in outperforming existing lightweight techniques on the criteria that are critical for a phone-MANET.

Self-pruning broadcasting for mobile ad hoc networks

The IEEE Global Telecommunications Conference (GLOBECOM 2009), Honolulu, HI., 30 November-4 December 2009, p. 1-6Broadcasting is a process of delivering a message to all nodes in a network. While it is important to ensure that all nodes get a copy of the broadcast message, minimizing the number of sending nodes is equally important especially in resource-constrained wireless networks. Existing broadcasting protocols based on self-pruning are ineffective in achieving these objectives. Therefore this paper proposes two protocols based on simple timer mechanisms to prioritize broadcasting of messages such that node with most uncovered neighbors rebroadcast first. Additionally a timer suppression mechanism is proposed to further enhance the effectiveness of the broadcasting protocol. Compared with an existing protocol, extensive simulation experiments confirm that the proposed protocols achieve better performance.published_or_final_versio

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-

Broadcasting in Hybrid Ad Hoc Networks.

In this paper, we consider hybrid ad hoc networks, which are composed of two kinds of nodes, regular ones and nodes with additional capabilities. For example, multi-hop cellular and wireless Internet networks consist of static or mobile nodes, and fixed access points which provide an access to an infrastructure. In such a network, each node may use direct or multihop link to connect to an access point, allowing a greater mobility. The goal of this paper is to provide protocols for broadcasting data in such an environment, by taking advantage of the presence of access points to optimize the broadcast, either from an energy consumption or from a latency point of view. We thus consider known protocols for pure ad hoc networks and adapt them to hybrid ad hoc networks. These protocols are the Blind Flooding, the Neighbor Elimination Scheme, the Multipoint Relay protocol and the generalized Self-Pruning Rule (algorithm that elects some dominant nodes to relay messages). We give some experimental data for these modified protocols to compare them to their original version, so that we are able to emphasize the gain obtained thanks to our proposed modifications

Smaller Connected Dominating Sets in Ad Hoc and Sensor Networks based on Coverage by Two-Hop Neighbors

In this paper, we focus on the construction of an efficient dominating set in ad hoc and sensor networks. A set of nodes is said to be dominating if each node is either itself dominant or neighbor of a dominant node. This set can for example be used for broadcasting, so the smaller the set is, the more efficient it is. As a basis for our work, we use a heuristics given by Dai and Wu for constructing such a set and propose an enhanced definition to obtain smaller sets. This approach, in conjunction with the elimination of message overhead by Stojmenovic, has been shown (in recent studies) to be an excellent compromise with respect to a wide range of metrics considered. In our new definition, a node u is not dominant if there exists in its 2-hop neighborhood a connected set of nodes with higher priorities that covers u and its 1-hop neighbors. This new rule uses the exact same level of information required by the original heuristics, only neighbors of nodes and neighbors of neighbors must be known to apply it, but it takes advantage of some knowledge originally not taken into account: 1-hop neighbors can be covered by some 2-hop neighbors. We give the proof that the set obtained with this new definition is a subset of the one obtained with Dai and Wu's heuristics. We also give the proof that our set is always dominating for any graph, and connected for any connected graph. Two versions were considered: with topological and positional information, which differ in whether or not nodes are aware of links between their 2-hop neighbors that are not 1-hop neighbors. An algorithm for applying the concept at each node is described. We finally provide experimental data that demonstrates the superiority of our rule in obtaining smaller dominating sets. A centralized algorithm was used as a benchmark in the comparison. The overhead of the size of connected dominating set was reduced by about 15% with the topological variant and by about 30% with the positional variant of our new definition

A survey on probabilistic broadcast schemes for wireless ad hoc networks

Broadcast or flooding is a dissemination technique of paramount importance in wireless ad hoc networks. The broadcast scheme is widely used within routing protocols by a wide range of wireless ad hoc networks such as mobile ad hoc networks, vehicular ad hoc networks, and wireless sensor networks, and used to spread emergency messages in critical scenarios after a disaster scenario and/or an accidents. As the type broadcast scheme used plays an important role in the performance of the network, it has to be selected carefully. Though several types of broadcast schemes have been proposed, probabilistic broadcast schemes have been demonstrated to be suitable schemes for wireless ad hoc networks due to a range of benefits offered by them such as low overhead, balanced energy consumption, and robustness against failures and mobility of nodes. In the last decade, many probabilistic broadcast schemes have been proposed by researchers. In addition to reviewing the main features of the probabilistic schemes found in the literature, we also present a classification of the probabilistic schemes, an exhaustive review of the evaluation methodology including their performance metrics, types of network simulators, their comparisons, and present some examples of real implementations, in this paper