MPR (multipoint relays) (A. Qayyum et al., Jan. 2002) provides a localized and optimized way of broadcasting messages in a mobile ad hoc network (MANET). Using 2-hop neighborhood information, each node determines a small set of forward neighbors to relay messages. Selected forward nodes form a connected dominating set (CDS) to ensure full coverage. Adjih, Jacquet, and Viennot (2002) later proposed a novel localized algorithm to construct a small CDS based on the original MPR without any broadcast information. Such an approach is called source-independent or broadcast-independent. In this paper, we provide 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. In addition, we extend the notion of coverage in the original MPR. We show that the extended MPR has a constant local approximation ratio compared with a logarithmic local ratio in the original MPR. The effectiveness of our approach is confirmed through a simulation study.
Extended multipoint relays to determine connected dominating sets in MANETs
01.01.2004
579858 byte
Aufsatz (Konferenz)
Elektronische Ressource
Englisch
The New Multipoint Relays Selection in OLSR using Particle Swarm Optimization
BASE | 2012
|A Heuristic Minimum Connected Dominating Set Algorithm for Wireless Sensor Network
British Library Online Contents | 2009
|HIGH VOLTAGE BATTERY MODULE WITH SERIES CONNECTED CELLS AND INTERNAL RELAYS
Europäisches Patentamt | 2022
|HIGH VOLTAGE BATTERY MODULE WITH SERIES CONNECTED CELLS AND INTERNAL RELAYS
Europäisches Patentamt | 2023
|IEEE | 2017
|