7 research outputs found

    Efficient Broadcast in MANETs Using Network Coding and Directional Antennas

    Get PDF

    Optimal transmission radius for energy efficient broadcasting protocols in ad hoc and sensor networks

    Full text link

    Efficient broadcasting in ad hoc wireless networks using directional antennas

    Full text link

    An adaptive localized scheme for energy-efficient broadcasting in ad hoc networks with directional antennas

    No full text
    Abstract. Several solutions for energy-efficient broadcasting, mostly centralized, have been proposed with directional antennas. However, such globalized protocols are not suitable for ad hoc networks, because each node needs a full knowledge of the topology. Recently, a localized algorithm, called DRBOP, using one-to-one communication model has been proposed. It uses RNG graphs, which can be locally computed by each node. However, for energy consumption reasons, it can be useful to reach more than one neighbor at a time. In this paper, we propose an efficient protocol which uses both one-to-one and one-to-many communication models. First, we present a variant of DRBOP efficient for sparse networks, based on LMST graph which is a local adaptation of minimal spanning tree. Then, a one-to-many protocol efficient for dense networks is proposed. From these two algorithms we derive an adaptive protocol which is shown to be efficient for both sparse and dense networks.

    Development of an efficient Ad Hoc broadcasting scheme for critical networking environments

    Get PDF
    Mobile ad hoc network has been widely deployed in support of the communications in hostile environment without conventional networking infrastructure, especially in the environments with critical conditions such as emergency rescue activities in burning building or earth quick evacuation. However, most of the existing ad hoc based broadcasting schemes either rely on GPS location or topology information or angle-of-arrival (AoA) calculation or combination of some or all to achieve high reachability. Therefore, these broadcasting schemes cannot be directly used in critical environments such as battlefield, sensor networks and natural disasters due to lack of node location and topology information in such critical environments. This research work first begins by analyzing the broadcast coverage problem and node displacement form ideal locations problem in ad hoc networks using theoretical analysis. Then, this research work proposes an efficient broadcast relaying scheme, called Random Directional Broadcasting Relay (RDBR), which greatly reduces the number of retransmitting nodes and end-to-end delay while achieving high reachability. This is done by selecting a subset of neighboring nodes to relay the packet using directional antennas without relying on node location, network topology and complex angle-of-arrival (AoA) calculations. To further improve the performance of the RDBR scheme in complex environments with high node density, high node mobility and high traffic rate, an improved RDBR scheme is proposed. The improved RDBR scheme utilizes the concept of gaps between neighboring sectors to minimize the overlap between selected relaying nodes in high density environments. The concept of gaps greatly reduces both contention and collision and at the same time achieves high reachability. The performance of the proposed RDBR schemes has been evaluated by comparing them against flooding and Distance-based schemes. Simulation results show that both proposed RDBR schemes achieve high reachability while reducing the number of retransmitting nodes and end-to-end delay especially in high density environments. Furthermore, the improved RDBR scheme achieves better performance than RDBR in high density and high traffic environment in terms of reachability, end-to-end delay and the number of retransmitting nodes
    corecore