Neighbor discovery in mobile ad hoc networks using an abstract MAC layer

Cornejo, Alejandro; Lynch, Nancy; Viqar, Saira; Welch, Jennifer L.

doi:10.1109/allerton.2009.5394502

Cited by 20 publications

(20 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This work demonstrates that it is feasible to design and analyze high-level algorithms for collision-prone physical networks using abstract MAC layers. More evidence for the value of this approach appears in other recent work: Cornejo et al [4,5] have developed new Neighbor Discovery algorithms over the basic abstract MAC layer. These enable the construction of a high-level dynamic graph model like the one used in [19] over an abstract MAC layer, which in turn supports the analysis of many already-existing algorithms based on dynamic graphs, in terms of abstract MAC layers and so in terms of physical network models.…”

Section: Introductionmentioning

confidence: 90%

Decomposing broadcast algorithms using abstract MAC layers

Khabbazian

Kühn

Kowalski

et al. 2010

Proceedings of the 6th International Workshop on Foundations of Mobile Computing

Self Cite

View full text Add to dashboard Cite

In much of the theoretical literature on wireless algorithms, issues of message dissemination are considered together with issues of contention management. This combination leads to complicated algorithms and analysis, and makes it difficult to extend the work to harder communication problems. In this paper, we present results of a current project aimed at simplifying such algorithms and analysis by decomposing the treatment into two levels, using abstract "MAC layer" specifications to encapsulate the contention management. We use two different abstract MAC layers: the basic one of [14,15] and a new probabilistic layer. We first present a typical randomized contention-manageent algorithm for a standard graph-based radio network model We show that it implements both abstract MAC layers. We combine this algorithm with greedy algorithms for singlemessage and multi-message global broadcast and analyze the combination, using both abstract MAC layers as intermediate layers. Using the basic MAC layer, we prove a bound of O(D log( n ) log ∆) for the time to deliver a single message everywhere with probability 1 − , where D is the network diameter, n is the number of nodes, and ∆ is the maximum node degree. Using the probabilistic layer, we prove a bound of O((D + log( n )) log ∆), which matches the best previously-known bound for single-message broadcast over the physical network model. For multi-message broadcast, we obtain bounds of O((D + k∆) log( n ) log ∆) using the * Research supported by AFOSR contract FA9550-08-1-0159 and NSF grants CCF-0726514, CNS-0715397 and CCF-0937274.† The work of this author was supported by the NSERC postdoctoral fellowship. ‡ The work of this author was supported by the Engineering and Physical Sciences Research Council [grant numbers EP/G023018/1, EP/H018816/1].Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. To copy otherwise, to republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. DIALM-POMC'10, September 16, 2010, Cambridge, MA, USA. Copyright 2010 ACM 978-1-4503-0413-9/10/09 ...$10.00.basic layer and O((D + k∆ log( n )) log ∆) using the probabilistic layer, for the time to deliver a message everywhere in the presence of at most k concurrent messages.

show abstract

Section: Introductionmentioning

confidence: 90%

Decomposing broadcast algorithms using abstract MAC layers

Khabbazian

Kühn

Kowalski

et al. 2010

Proceedings of the 6th International Workshop on Foundations of Mobile Computing

Self Cite

View full text Add to dashboard Cite

show abstract

“…Alejandro Cornejo et al, [8] described a protocol for learning about the neighboring nodes in a network environment. The protocol is used to establish and tear down the communication links with neighboring nodes as they move from one region of the network to another.…”

Section: Related Workmentioning

confidence: 99%

“…The proposed MAC Layer Based Certificate Authentication for the multiple Certification Authority in MANET (MBCA) was compared with the ID-based multiple secrets key management scheme (IMKM) [8]. Fig.…”

Section: Performance Metricsmentioning

confidence: 99%

MAC Layer Based Certificate Authentication for Multiple Certification Authority in MANET

Sekhar¹,

Prasad²

2014

IEIE Transactions on Smart Processing and Computing

View full text Add to dashboard Cite

Abstract:In this study, a novel Randomly Shifted Certification Authority Authentication protocol was used in ad hoc networks to provide authentication by considering the MAC layer characteristics. The nodes achieve authentication through the use of public key certificates issued by a CA, which assures the certificate's ownership. As a part of providing key management, the active CA node transfers the image of the stored public keys to other idle CA nodes. Finally the current active CA randomly selects the ID of the available idle CA and shifts the CA ownership by transferring it. Revoking is done if any counterfeit or duplicate non CA node ID is found. Authentication and integrity is provided by preventing MAC control packets, and Enhanced Hash Message Authentication Code (EHMAC) can be used. Here EHMAC with various outputs is introduced in all control packets. When a node transmits a packet to a node with EHMAC, verification is conducted and the node replies with the transmitter address and EHMAC in the acknowledgement.

show abstract

“…To this end, we note that our algorithm can be interpreted as an implementation of the Abstract MAC Layer specification [13,15]. It follows that the growing corpus of results designed to run on top of this abstraction (e.g., [9,20,6,12,11,5]) can be composed with our implementation, automatically porting these existing solutions to the dual graph model for the first time.…”

Section: Introductionmentioning

confidence: 99%

A (Truly) Local Broadcast Layer for Unreliable Radio Networks

Lynch

Newport

2015

Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing

Self Cite

View full text Add to dashboard Cite

In this paper, we implement an efficient local broadcast service for the dual graph model, which describes communication in a radio network with both reliable and unreliable links. Our local broadcast service offers probabilistic latency guarantees for: (1) message delivery to all reliable neighbors (i.e., neighbors connected by reliable links), and (2) receiving some message when one or more reliable neighbors are broadcasting. This service significantly simplifies the design and analysis of algorithms for the otherwise challenging dual graph model. To this end, we also note that our solution can be interpreted as an implementation of the abstract MAC layer specification-therefore translating the growing corpus of algorithmic results studied on top of this layer to the dual graph model. At the core of our service is a seed agreement routine which enables nodes in the network to achieve "good enough" coordination to overcome the difficulties of unpredictable link behavior. Because this routine has potential application to other problems in this setting, we capture it with a formal specification-simplifying its reuse in other algorithms. Finally, we note that in a break from much work on distributed radio network algorithms, our problem definitions (including error bounds), implementation, and analysis do not depend on global network parameters such as the network size, a goal which required new analysis techniques. We argue that breaking the dependence of these algorithms on global parameters makes more sense and aligns better with the rise of ubiquitous computing, where devices will be increasingly working locally in an otherwise massive network. Our push for locality, in other words, is a contribution independent of the specific radio network model and problem studied here.

show abstract

Neighbor discovery in mobile ad hoc networks using an abstract MAC layer

Cited by 20 publications

References 10 publications

Decomposing broadcast algorithms using abstract MAC layers

Decomposing broadcast algorithms using abstract MAC layers

MAC Layer Based Certificate Authentication for Multiple Certification Authority in MANET

A (Truly) Local Broadcast Layer for Unreliable Radio Networks

Contact Info

Product

Resources

About