Distributed Deterministic Broadcasting in Uniform-Power Ad Hoc Wireless Networks

Development of many futuristic technologies, such as MANET, VANET, iThings, nano-devices, depend on efficient distributed communication protocols in multi-hop ad hoc networks. A vast majority of research in this area focus on design heuristic protocols, and analyze their performance by simulations on networks generated randomly or obtained in practical measurements of some (usually small-size) wireless networks. %some library. Moreover, they often assume access to truly random sources, which is often not reasonable in case of wireless devices. In this work we use a formal framework to study the problem of broadcasting and its time complexity in any two dimensional Euclidean wireless network with uniform transmission powers. For the analysis, we consider two popular models of ad hoc networks based on the Signal-to-Interference-and-Noise Ratio (SINR): one with opportunistic links, and the other with randomly disturbed SINR. In the former model, we show that one of our algorithms accomplishes broadcasting in $O(D\log^2 n)$ rounds, where $n$ is the number of nodes and $D$ is the diameter of the network. If nodes know a priori the granularity $g$ of the network, i.e., the inverse of the maximum transmission range over the minimum distance between any two stations, a modification of this algorithm accomplishes broadcasting in $O(D\log g)$ rounds. Finally, we modify both algorithms to make them efficient in the latter model with randomly disturbed SINR, with only logarithmic growth of performance. Ours are the first provably efficient and well-scalable, under the two models, distributed deterministic solutions for the broadcast task.Comment: arXiv admin note: substantial text overlap with arXiv:1207.673

An efficient counter-based broadcast scheme for mobile ad hoc networks

In mobile ad hoc networks (MANETs), broadcasting plays a fundamental role, diffusing a message from a given source node to all the other nodes in the network. Flooding is the simplest and commonly used mechanism for broadcasting in MANETs, where each node retransmits every uniquely received message exactly once. Despite its simplicity, it however generates redundant rebroadcast messages which results in high contention and collision in the network, a phenomenon referred to as broadcast storm problem. Pure probabilistic approaches have been proposed to mitigate this problem inherent with flooding, where mobile nodes rebroadcast a message with a probability p which can be fixed or computed based on the local density. However, these approaches reduce the number of rebroadcasts at the expense of reachability. On the other hand, counter-based approaches inhibit a node from broadcasting a packet based on the number of copies of the broadcast packet received by the node within a random access delay time. These schemes achieve better throughput and reachability, but suffer from relatively longer delay. In this paper, we propose an efficient broadcasting scheme that combines the advantages of pure probabilistic and counter-based schemes to yield a significant performance improvement. Simulation results reveal that the new scheme achieves superior performance in terms of saved-rebroadcast, reachability and latency

Dynamic broadcasting in vehicular ad hoc networks

Vehicular Ad hoc Network (VANET) is a subclass of mobile ad hoc networks (MANETs). VANETs provide a variety of interesting applications. Many of these applications rely on broadcasting of messages to other vehicles. The simplest broadcasting algorithm is flooding. Because of a large number of vehicles during peak hour, blindly flooding may lead to packet collision and high contention named broadcast storm problem. This paper presents a broadcasting approach for safety messages that dynamically adjust waiting time of a vehicle according to the number of neighbor vehicles and distance to source. We evaluate the performance of our proposed approach in terms of reachability, reliability. The simulation results show our protocol introduces better performance than flooding and random waiting time protocol

Performance evaluation of an efficient counter-based scheme for mobile ad hoc networks based on realistic mobility model

Flooding is the simplest and commonly used mechanism for broadcasting in mobile ad hoc networks (MANETs). Despite its simplicity, it can result in high redundant retransmission, contention and collision in the network, a phenomenon referred to as broadcast storm problem. Several probabilistic broadcast schemes have been proposed to mitigate this problem inherent with flooding. Recently, we have proposed a hybrid-based scheme as one of the probabilistic scheme, which combines the advantages of pure probabilistic and counter-based schemes to yield a significant performance improvement. Despite these considerable numbers of proposed broadcast schemes, majority of these schemes’ performance evaluation was based on random waypoint model. In this paper, we evaluate the performance of our broadcast scheme using a community based mobility model which is based on social network theory and compare it against widely used random waypoint mobility model. Simulation results have shown that using unrealistic movement pattern does not truly reflect on the actual performance of the scheme in terms of saved-rebroadcast, reachability and end to end delay

Improving multiple broadcasting of multimedia traffic in wireless ad-hoc networks

The increasing use of multimedia streaming applications in addition with advent of internet television and radio, demands from today's wireless networks to handle with reliability multiple broadcasting and multicasting sources. However, the way that 802.11 standard, which is the primary technology in wireless networking, handle this type of traffic raises a series of problems mainly related to the lack of an effective feedback mechanism. This lack in turn, limits the capability of random backoff process to eliminate collisions and reduce reliability and fairness. This inherited drawback of the standard is affecting the way broadcast and multicast traffic is transmitted as well as the overall performance of the network. In this paper initially we are highlighting the drawback of the IEEE 802.11 MAC algorithm in handling multiple stations “media type” data broadcasting in an ad-hoc wireless network. Then, we propose two different approaches in alleviating these problems. The first approach is the simple linear increase of the contention window (CW) while the second propose a linear increase of the CW implementing an exclusive backoff number allocation (EBNA) algorithm. In addition we are modifying the 802.11 medium access control (MAC) algorithm to use the clear to send to self (CTS-to-Self) protection mechanism prior to every transmission. Both the above techniques are simulated and compared with the classic 802.11 MAC. The results show that the overall performance of the network can be improved using these alternative MAC methods