A self-correcting neighbor protocol for mobile ad-hoc wireless networks

Mosko, Marc; Garcia-Luna-Aceves, J. J.

doi:10.1109/icccn.2002.1043124

Cited by 9 publications

(6 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The latter can be implemented by means of a neighbor protocol with which nodes exchange hello messages [47], as part of the MAC protocol, or using periodic HELLO messages as part of the protocol itself.…”

Section: Summary Descriptionmentioning

confidence: 99%

Bounded-distance multi-clusterhead formation in wireless ad hoc networks

Spohn

Garcia-Luna-Aceves

2007

Ad Hoc Networks

View full text Add to dashboard Cite

We present a clustering technique addressing redundancy for bounded-distance clusters, which means being able to determine the minimum number of cluster-heads per node, and the maximum distance from nodes to their cluster-heads. This problem is similar to computing a (k, r)-dominating set, (k, r)-DS, of the network. (k, r)-DS is defined as the problem of selecting a minimum cardinality vertex set D of the network such that every vertex u not in D is at a distance smaller than or equal to r from at least k vertices in D. In mobile ad hoc networks (MANETs), clusters should be computed distributively, because the topology may change frequently. We present the first centralized and distributed solutions to the (k, r)-DS problem for arbitrary topologies. The centralized algorithm computes a (k AE ln D)-approximation, where D is the largest cardinality among all r-hop neighborhoods in the network. The distributed approach is extended for clustering applications, while the centralized is used as a lower bound for comparison purposes. Extensive simulations are used to compare the distributed solution with the centralized one. As a case study, we propose a novel multi-core multicast protocol that applies the distributed solution for the election of cores. The new protocol is compared against PUMA, one of the best performing multicast protocols for MANETS. Simulation results show that the new protocol outperforms PUMA on the context of static networks.

show abstract

Section: Summary Descriptionmentioning

confidence: 99%

Bounded-distance multi-clusterhead formation in wireless ad hoc networks

Spohn

Garcia-Luna-Aceves

2007

Ad Hoc Networks

View full text Add to dashboard Cite

show abstract

“…Generally, neighbor protocols fall into two groups: periodic or even-based [3]. Periodic protocols broadcast Hello packets with fixed or variable frequency based on network load, node mobility, or relative group mobility.…”

Section: Introductionmentioning

confidence: 99%

In-frame neighbor indexing schemes for multichannel mobile ad hoc networks

Hsu

Lee

2011

2011 IEEE International Conference on Signal Processing, Communications and Computing (ICSPCC)

View full text Add to dashboard Cite

Utilization of multiple channels in ad hoc networks provides the benefits of reducing the probability of collisions, decreasing the normalized propagation delay and support of QoS. However, problems like busy waiting or deadlock existence degrade the bandwidth utilization. In this paper, we introduce two neighbor indexing schemes which assign different sequence numbers to the neighbors of every nodes to avoid the collision when communicating. Our neighbor indexing schemes are integrated into MAC protocols. The first is a basic neighborsequenced scheme, which we call static neighbor indexing scheme (SNI). SNI can be employed in the ad hoc network where the maximal number of neighbors every nodes could have is restricted to a fixed number. The second method we propose is the adaptive neighbor indexing scheme (ANI) which can reassign a new sequence number to a registered neighbor for reducing the maximal sequence number assigned to its neighbors. The proposed schemes can adequately adjust to station movements so as to support the high mobility network.

show abstract

“…Therefore, only heuristic algorithms can be applied. Many algorithms that aim to construct CDS's are classified into four groups: global [6], [10], quasi-global [11], quasi-local [12], [13], and local [1], [2], [3], [4], [14], [15], [16], [17], [18], [19], [20], [21], [22], [23].…”

Section: Related Workmentioning

confidence: 99%

“…Many algorithms belong to the source-independent approach, such as MPR [2], EMPR [4], marking process with rules 1&2 [15] and its extensions [16], SPAN [17], and d-hop CDS [18]. Algorithms that belong to the source-dependent approach are the original MPR [1], dominant pruning [14] and its extensions [19], [20], LENWB [21], SBA [22], and neighbor-elimination-based broadcasting [23].…”

Section: Related Workmentioning

confidence: 99%

Extended multipoint relays to determine connected dominating sets in MANETs

Lou

2004 First Annual IEEE Communications Society Conference on Sensor and Ad Hoc Communications and Networks, 2004. IEEE SECON 200

View full text Add to dashboard Cite

MPR (multipoint relays) [1] 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 [2] 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.

show abstract

A self-correcting neighbor protocol for mobile ad-hoc wireless networks

Cited by 9 publications

References 7 publications

Bounded-distance multi-clusterhead formation in wireless ad hoc networks

Bounded-distance multi-clusterhead formation in wireless ad hoc networks

In-frame neighbor indexing schemes for multichannel mobile ad hoc networks

Extended multipoint relays to determine connected dominating sets in MANETs

Contact Info

Product

Resources

About