Distributed Algorithms for End-to-End Packet Scheduling in Wireless Ad Hoc Networks

Kumar, V. S. Anil; Marathe, Madhav V.; Parthasarathy, Srinivasan; Srinivasan, Aravind

doi:10.1145/2812811

Cited by 8 publications

(11 citation statements)

References 48 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Under the protocol model, graph-based scheduling algorithms employing implicit or explicit coloring strategies are widely used, e.g., [73,74]. In [75,76], greedy-type heuristic algorithms are developed for the MTSP.…”

Section: Solutionsmentioning

confidence: 99%

A Comprehensive Analysis of Optimal Link Scheduling for Emptying a Wireless Network

He¹

View full text Add to dashboard Cite

Wireless communications have become an important part of modern life. The ubiquitous wireless networks and connectivities generate exponentially increasing data traffic. In view of this, wireless network optimization, which aims at utilizing the limited resource, especially spectrum and energy, as efficiently as possible from a network perspective, is essential for performance improvement and sustainable development of wireless communications.In the dissertation, we focus on a fundamental problem of wireless network optimization, link scheduling, as well as its subproblem, link activation. The problem type arises because of the nature of wireless media and hence it is of relevance to a wide range of networks with multiple access. We freshen these classic problems up by novel extensions incorporating new technologies of interference management or with new performance metrics. We also revisit the problems in their classic setup to gain new theoretical results and insights for problemsolving. Throughout the study, we consider the problems with a general setup, such that the insights presented in this dissertation are not constrained to a specific technology or network type. Since link activation and scheduling are key elements of access coordination in wireless communications, the study opens up new approaches that significantly i improve network performance, and eventually benefit practical applications.The dissertation consists of five research papers. The first paper addresses maximum link activation with cooperative transmission and interference cancellation. Papers II and III investigate the minimumtime link scheduling problem in general and a particular class of networks, respectively. In Paper IV, we consider the scheduling problem of emptying a network in its broad form and provide a general optimality condition. In Paper V, we study the scheduling problem with respect to age of information.ii Populärvetenskaplig SammanfattningTrådlös kommunikationär av stor betydelse i dagens samhälle. Möjligheten att ansluta kommunikationsenheter till trådlösa nätverk harökat markant på senare tid vilket medfört att nätverken belastas alltmer då mängden datatrafik tilltar. Med hänsyn till dettaär optimering av trådlösa nätverk synnerligen betydelsefullt. Genom att t.ex. effektivisera nyttjandet av tillgängliga frekvenser samt minska energiförbrukningenär det möjligt att erhålla hållbara kommunikationslösningar med hög prestanda.Den här avhandlingen fokuserar på optimering i trådlösa nätverk och viktiga utmaningar som berör resurstilldelning och aktivering av förbindelser mellan kommunikationsenheter, vilket kan hanteras på olika sätt och där vald strategi ofta har påtaglig inverkan på ett nätverks prestanda. I avhandlingen studeras klassiska problemställningar på nya sätt med hänsyn till alternativa prestandamått samt tekniker som berör interferens. Detär avgörande att förbindelser och reglering av resurser hanteras på ett vettigt och välgenomtänkt sätt och i avhandlingen ges nya förslag på hur detta kanåstadkomma...

show abstract

Section: Solutionsmentioning

confidence: 99%

A Comprehensive Analysis of Optimal Link Scheduling for Emptying a Wireless Network

He¹

View full text Add to dashboard Cite

show abstract

“…in packet scheduling (Kumar et al [2004]), channel assignment (Kodialam and Nandagopal [2005]) or link scheduling (Gandham et al [2005]). Many wireless and ad hoc networks are modeled by Unit Disk Graphs (UDGs), where nodes are embedded in the plane and two nodes are adjacent if and only if their Euclidean distance is at most one.…”

Section: Introductionmentioning

confidence: 99%

Local Edge Colouring of Yao-Like Subgraphs of Unit Disk Graphs

Czyzowicz

Dobrev

Kranakis

et al.

Structural Information and Communication Complexity

View full text Add to dashboard Cite

The focus of the present paper is on providing a local deterministic algorithm for colouring the edges of Yao-like subgraphs of Unit Disc Graphs. These are geometric graphs such that for some positive integers l, k the following property holds at each node v: if we partition the unit circle centered at v into 2k equally sized wedges then each wedge can contain at most l points different from v. We assume that the nodes are location aware, i.e. they know their Cartesian coordinates in the plane. The algorithm presented is local in the sense that each node can receive information emanating only from nodes which are at most a constant (depending on k and l, but not on the size of the graph) number of hops away from it, and hence the algorithm terminates in a constant number of steps. The number of colours used is 2kl + 1 and this is optimal for local algorithms (since the maximal degree is 2kl and a colouring with 2kl colours can only be constructed by a global algorithm), thus showing that in this class of graphs the price for locality is only one additional colour.

show abstract

“…We notice that most solution methods proposed so far focus on polynomial time algorithms that achieve provably good performance in the worst case. Unfortunately these methods are not suitable for practical implementations; in fact they are centralized and/or require solving complex combinatorial optimization problems [5,15,16]. Since sensors have limited computational power and are unable to perform sophisticated coordination activities, sophisticated algorithms that require solving complex combinatorial optimization problems are impractical for implementations and have mainly theoretical interest.…”

Section: Introductionmentioning

confidence: 99%

“…A relevant parameter that has been considered in the literature is ∆, the maximum degree of a node in the network [3,15,16]. We assume that all nodes know ∆ (or an upper bound on it); we observe that such an information can be easily obtained once the routing tree has been constructed.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

The Distributed Wireless Gathering Problem

Bonifaci

Korteweg

Marchetti-Spaccamela

et al.

Algorithmic Aspects in Information and Management

View full text Add to dashboard Cite

We address the problem of data gathering in a wireless network using multi-hop communication; our main goal is the analysis of simple algorithms suitable for implementation in realistic scenarios. We study the performance of distributed algorithms, which do not use any form of local coordination, and we focus on the objective of minimizing average flow times of data packets. We prove a lower bound of Ω(n) on the expected competitive ratio of any acknowledgment-based distributed algorithm minimizing the maximum flow time, where n is the number of nodes of the network. Next, we consider a distributed algorithm which sends packets over shortest paths, and we use resource augmentation to analyze its performance when the objective is to minimize the average flow time. If interferences are modeled as in Bar-Yehuda et al. (J. of Computer and Systems Science, 45(1):104-126, 1992) we prove that the algorithm is (1+ )-competitive, when the algorithm sends packets a factor O(log(δ/ ) log ∆) faster than the optimal offline solution; here δ is the radius of the network and ∆ the maximum degree. We finally extend this result to a more complex interference model.

show abstract

Distributed Algorithms for End-to-End Packet Scheduling in Wireless Ad Hoc Networks

Cited by 8 publications

References 48 publications

A Comprehensive Analysis of Optimal Link Scheduling for Emptying a Wireless Network

A Comprehensive Analysis of Optimal Link Scheduling for Emptying a Wireless Network

Local Edge Colouring of Yao-Like Subgraphs of Unit Disk Graphs

The Distributed Wireless Gathering Problem

Contact Info

Product

Resources

About