Journal ArticleDOI
Extended multipoint relays to determine connected dominating sets in MANETs
TLDR
This paper provides several extensions of the source-independent MPR to generate a smaller CDS using 3-hop neighborhood information to cover each node's 2-hop neighbor set and shows that the extended MPR has a constant local approximation ratio compared with a logarithmic local ratio in the original MPR.Abstract:
Multipoint relays (MPR) provide a localized and optimized way of broadcasting messages in a mobile ad hoc network (MANET). Using partial 2-hop information, each node chooses a small set of forward neighbors to relay messages and this set covers the node's 2-hop neighbor set. These selected forward nodes form a connected dominating set (CDS) to ensure full coverage. Adjih et al. later proposed a novel extension of MPR to construct a small CDS and it is source-independent. In this paper, we provide several extensions to generate a smaller CDS using complete 2-hop information to cover each node's 2-hop neighbor set. We extend the notion of coverage in the original MPR. We prove that the extended MPR has a constant local approximation ratio compared with a logarithmic local ratio in the original MPR. In addition, we show that the extended MPR has a constant global probabilistic approximation ratio, while no such ratio exists in the original MPR and its existing extensions. The effectiveness of our approach is confirmed through a simulation study.read more
Citations
More filters
Journal ArticleDOI
Connectivity, coverage and placement in wireless sensor networks.
TL;DR: This survey describes the state of the art in techniques for determining the minimum density and optimal locations of relay nodes and ordinary sensors to ensure connectivity, subject to various degrees of uncertainty in the locations of the nodes.
Proceedings ArticleDOI
Exploring link correlation for efficient flooding in wireless sensor networks
TL;DR: System evaluation and extensive simulation show that Collective Flooding achieves the same reliability as the state-of-the art solutions, while reducing the total number of packet transmission and dissemination delay by 30 - 50% and 35 - 50%, respectively.
Book ChapterDOI
Energy-Efficient Backbone Construction, Broadcasting, and Area Coverage in Sensor Networks.
TL;DR: This chapter discusses two specific kinds of backbones, neighbor and area dominating sets, that it is believed are the essential and perhaps only backbones required for sensor networks.
Journal ArticleDOI
A survey of multipoint relay based broadcast schemes in wireless ad hoc networks
TL;DR: A comprehensive survey of MPR-based broadcast schemes is presented, classified into three categories based on their objectives, and the evaluation of their performances is provided in light of their costs.
Journal ArticleDOI
A hierarchical energy-efficient framework for data aggregation in wireless sensor networks
TL;DR: The authors first study single-level aggregation and propose an Energy-Efficient Protocol for Aggregator Selection (EPAS) protocol, which generalize it to an aggregation hierarchy and extend EPAS to Hierarchical EPAS.
References
More filters
Proceedings ArticleDOI
Ad-hoc on-demand distance vector routing
C.E. Perkins,E.M. Royer +1 more
TL;DR: An ad-hoc network is the cooperative engagement of a collection of mobile nodes without the required intervention of any centralized access point or existing infrastructure and the proposed routing algorithm is quite suitable for a dynamic self starting network, as required by users wishing to utilize ad- hoc networks.
Dynamic Source Routing in Ad Hoc Wireless Networks.
David B. Johnson,David A. Maltz +1 more
TL;DR: In this article, the authors present a protocol for routing in ad hoc networks that uses dynamic source routing, which adapts quickly to routing changes when host movement is frequent, yet requires little or no overhead during periods in which hosts move less frequently.
Book ChapterDOI
Dynamic Source Routing in Ad Hoc Wireless Networks
David B. Johnson,David A. Maltz +1 more
TL;DR: This paper presents a protocol for routing in ad hoc networks that uses dynamic source routing that adapts quickly to routing changes when host movement is frequent, yet requires little or no overhead during periods in which hosts move less frequently.
Proceedings ArticleDOI
The broadcast storm problem in a mobile ad hoc network
TL;DR: This paper proposes several schemes to reduce redundant rebroadcasts and differentiate timing of rebroadcast to alleviate the broadcast storm problem, which is identified by showing how serious it is through analyses and simulations.
Journal ArticleDOI
A Greedy Heuristic for the Set-Covering Problem
TL;DR: It turns out that the ratio between the two grows at most logarithmically in the largest column sum of A when all the components of cT are the same, which reduces to a theorem established previously by Johnson and Lovasz.