Distributed Algorithms for Coloring and Domination in Wireless Ad Hoc Networks

Parthasarathy, Srinivasan; Gandhi, Rajiv

doi:10.1007/978-3-540-30538-5_37

Cited by 41 publications

(23 citation statements)

References 32 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In the context of radio networks without unreliable links (what we call the classic radio network model), [19] describes an O(n) time CCDS algorithm, and [15] describes an O(log 2 n) time algorithm. The latter algorithm, however, requires that processes know their multihop local neighborhoods so they can construct collision-free broadcast schedules.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Structuring unreliable radio networks

Censor-Hillel¹,

Gilbert

Kühn

et al. 2011

Proceedings of the 30th Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing

View full text Add to dashboard Cite

In this paper we study the problem of building a connected dominating set with constant degree (CCDS) in the dual graph radio network model [4,9,10]. This model includes two types of links: reliable, which always deliver messages, and unreliable, which sometimes fail to deliver messages. Real networks compensate for this differing quality by deploying low-layer detection protocols to filter unreliable from reliable links. With this in mind, we begin by presenting an algorithm that solves the CCDS problem in the dual graph model under the assumption that every process u is provided a local link detector set consisting of every neighbor connected to u by a reliable link. The algorithm solves the CCDS problem in O( ∆ log2 n b + log 3 n) rounds, with high probability, where ∆ is the maximum degree in the reliable link graph, n is the network size, and b is an upper bound in bits on the message size. The algorithm works by first building a Maximal Independent Set (MIS) in log 3 n time, and then leveraging the local topology knowledge to efficiently connect nearby MIS processes. A natural follow up question is whether the link detector must be perfectly reliable to solve the CCDS problem. With this in mind, we first describe an algorithm that builds a CCDS in O(∆polylog(n)) time under the assumption of O(1) unreliable links included in each link detector set. We then prove this algorithm to be (almost) tight by showing that the possible inclusion of only a single unreliable link in each process's local link detector set is sufficient to require Ω(∆) rounds to solve the CCDS problem, regardless of message size. We con- * Supported by the Simons Postdoctoral Fellows Program. 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. PODC '11, June 6-8, 2011, San Jose, California, USA. Copyright 2011 ACM 978-1-4503-0719-2/11/06 ...$10.00.clude by discussing how to apply our algorithm in the setting where the topology of reliable and unreliable links can change over time.

show abstract

Section: Related Workmentioning

confidence: 99%

“…The CCDS problem is important in this setting as it provides a routing backbone that can be used to efficiently move information through the network [15,19]. In more detail, we study this problem in the dual graph network model, which describes static ad hoc radio networks.…”

Section: Introductionmentioning

confidence: 99%

Structuring unreliable radio networks

Censor-Hillel¹,

Gilbert

Kühn

et al. 2011

Proceedings of the 30th Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing

View full text Add to dashboard Cite

show abstract

“…Most of distributed TDMA protocols (e.g., TRAMA [14], Parthasarathy [12], ED-TDMA [6], and Herman [7]) assume time is already slotted or all nodes are synchronized to achieve the same global clock. Some distributed TDMA protocols do not require time synchronization.…”

Section: Related Workmentioning

confidence: 99%

Desynchronization with an artificial force field for wireless networks

Choochaisri

Apicharttrisorn

Korprasertthaworn

et al. 2012

SIGCOMM Comput. Commun. Rev.

View full text Add to dashboard Cite

Desynchronization is useful for scheduling nodes to perform tasks at different time. This property is desirable for resource sharing, TDMA scheduling, and collision avoiding. Inspired by robotic circular formation, we propose DWARF (Desynchronization With an ARtificial Force field), a novel technique for desynchronization in wireless networks. Each neighboring node has artificial forces to repel other nodes to perform tasks at different time phases. Nodes with closer time phases have stronger forces to repel each other in the time domain. Each node adjusts its time phase proportionally to its received forces. Once the received forces are balanced, nodes are desynchronized. We evaluate our implementation of DWARF on TOSSIM, a simulator for wireless sensor networks. The simulation results indicate that DWARF incurs significantly lower desynchronization error and scales much better than existing approaches.

show abstract

“…[19] presented a distributed algorithm that computes a constant factor approximation of a minimum dominating set in O(log 2 n) time without needing any synchronization but it requires that nodes know an estimate of the total number of nodes in the network. In [24], Parthasarathy and Gandhi also present distributed algorithms to compute a constant factor approximation to the minimum dominating set. The running time of their algorithm depends on the amount of information available to the nodes, and nodes have to know an estimate of the size of the network.…”

Section: Related Workmentioning

confidence: 99%

An O(log n) dominating set protocol for wireless ad-hoc networks under the physical interference model

Scheideler

Richa

Santi

2008

Proceedings of the 9th ACM International Symposium on Mobile Ad Hoc Networking and Computing

101

View full text Add to dashboard Cite

Dealing with interference is one of the primary challenges to solve in the design of protocols for wireless ad-hoc networks. Most of the work in the literature assumes localized or hopbased interference models in which the effect of interference is neglected beyond a certain range from the transmitter. However, interference is a more complex phenomenon that cannot, in general, be captured by localized models, implying that protocols based on such models are not guaranteed to work in practice. This paper is the first to present and rigorously analyze a distributed dominating set protocol for wireless ad-hoc networks with O(1) approximation bound based on the physical interference model, which accounts for interference generated by all nodes in the network. The proposed protocol is fully distributed, randomized, and extensively uses physical carrier sensing to reduce message overhead. It does not need node identifiers or any kind of prior information about the system, and all messages are of constant size (in bits). We prove that, by appropriately choosing the threshold for physical carrier sensing, the protocol stabilizes within a logarithmic number of communication rounds, w.h.p., which is faster than the runtime of any known distributed protocol without prior knowledge about the system under any wireless model that does not abstract away collisions.

show abstract

Distributed Algorithms for Coloring and Domination in Wireless Ad Hoc Networks

Cited by 41 publications

References 32 publications

Structuring unreliable radio networks

Structuring unreliable radio networks

Desynchronization with an artificial force field for wireless networks

An O(log n) dominating set protocol for wireless ad-hoc networks under the physical interference model

Contact Info

Product

Resources

About