Gateway Multipoint Relays-an MPR-Based Broadcast Algorithm for Ad Hoc Networks

Ou, Liang; Şekercioğlu, Y. Ahmet; Mani, N.

doi:10.1109/iccs.2006.301379

Cited by 20 publications

(12 citation statements)

References 2 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Clearly, those algorithms apply to static MANET because each node only considers the number of 1-hop neighbor nodes. Sakai et al (2009), Liang et al (2006, Gandhi et al (2008), Funke et al (2006) and Gao and Wang (2009) use k-hop searching scheme as the basis foundation. In a MANET, each MN sends ''Hello message'' to its 2-hop neighbors and gains the number of its 2-hop neighbor nodes.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

A weight-value algorithm for finding connected dominating sets in a MANET

Leu

Chang

2012

Journal of Network and Computer Applications

View full text Add to dashboard Cite

Section: Related Workmentioning

confidence: 99%

“…In order to solve the Broadcasting Storm Problem, Connected Dominating Set (CDS) (Cedric Adjih et al, 2005;Wu et al, 2006;Liang et al, 2006) is a favorite scheme. First, it constructs a dominating set (DS) in which only nodes can relay the broadcasting packets.…”

Section: Introductionmentioning

confidence: 99%

A weight-value algorithm for finding connected dominating sets in a MANET

Leu

Chang

2012

Journal of Network and Computer Applications

View full text Add to dashboard Cite

“…The strategies based on topology control can be divided into the three types: Multi-node transmit [19], Connected dominating set [20], Clustering algorithm [21]. Among them, clustering algorithm is widely used.…”

Section: Related Workmentioning

confidence: 99%

An Efficient Tree-Based Self-Organizing Protocol for Internet of Things

et al. 2016

View full text Add to dashboard Cite

There are a lot of researches on self-organizing network at present. However, due to the characteristics of topological change of the Internet of Things, node resource constraints and random distribution and so on. Most of the existing self-organizing network are not applicable. This paper is aimed at the characteristics of the Internet of Things, and draws lessons from small world model, energy multi-path routing and hybrid routing algorithm. On the basis of GEAR protocol, a model of high efficient self-organizing network for large scale aware node is proposed: A multi-path hybrid routing model based on small world model, referred as SMH (Small World Multi-Path Hybrid Routing) model. In this paper, the model is implemented and an improved protocol based on GEAR is obtained, which is SMH-GEAR protocol. And SMH-GEAR protocol and GEAR protocol are compared and analyzed with simulation by using NS-2 network simulation platform. The result of the experiment shows SMH-GEAR protocol is better than GEAR protocol in terms of overall performance.

show abstract

“…They sort all one hop neighbors in a descending order of QoS parameters in first step and employ the MPR algorithm to choose the MPRs. Furthermore, [11] employed Maximal Independent Set (MIS) concept to choose more independent connected dominating set and they form gateways while MPRs will be selected among these nodes based on the original MPR selection algorithm. Obviously, the existing works concentrated mostly on improving the MPR selection mechanism by considering different parameters while the main selection algorithm remains same.…”

Section: Algorithm 1 Mpr Selection Algorithmmentioning

confidence: 99%

EF-MPR, a new energy eFficient multi-point relay selection algorithm for MANET

et al. 2010

View full text Add to dashboard Cite

MultiPoint Relay (MPR) selection algorithm is a flooding technique for propagating a broadcast message inside an ad-hoc network which reduces the number of unnecessary broadcast messages in order to save more energy in the network, minimize the number of packet collisions, and speed up the propagation time. In this paper, we demonstrate that MPR selection is an application of Set Covering Problem (SCP). A few optimization methods are developed in this work to find the optimum solution including Simulated Annealing (SA), Tabu Search (TS), Genetic Algorithm (GA), and a new greedy algorithm. Extensive simulations are set up to evaluate the developed methods. The new algorithm is named Energy eFficient MPR or EF-MPR in short. The simulation results show that EF-MPR can reduce the number of MPR nodes up to 19%. Moreover, EF-MPR algorithm reduces the power-consumption of network up to 12% and speed up the propagation time by 9%.

show abstract

Gateway Multipoint Relays-an MPR-Based Broadcast Algorithm for Ad Hoc Networks

Cited by 20 publications

References 2 publications

A weight-value algorithm for finding connected dominating sets in a MANET

A weight-value algorithm for finding connected dominating sets in a MANET

An Efficient Tree-Based Self-Organizing Protocol for Internet of Things

EF-MPR, a new energy eFficient multi-point relay selection algorithm for MANET

Contact Info

Product

Resources

About