Topology-Transparent Distributed Scheduling in Wireless Networks PDF Download
Are you looking for read ebook online? Search for your book and save it on your Kindle device, PC, phones or tablets. Download Topology-Transparent Distributed Scheduling in Wireless Networks PDF full book. Access full book title Topology-Transparent Distributed Scheduling in Wireless Networks by Qiong Sun. Download full books in PDF and EPUB format.
Author: Qiong Sun Publisher: Open Dissertation Press ISBN: 9781360972220 Category : Languages : en Pages :
Book Description
This dissertation, "Topology-transparent Distributed Scheduling in Wireless Networks" by Qiong, Sun, 孙琼, was obtained from The University of Hong Kong (Pokfulam, Hong Kong) and is being sold pursuant to Creative Commons: Attribution 3.0 Hong Kong License. The content of this dissertation has not been altered in any way. We have altered the formatting in order to facilitate the ease of printing and reading of the dissertation. All rights not granted by the above license are retained by the author. DOI: 10.5353/th_b4490410 Subjects: Data transmission systems Scheduling Wireless communication systems Algorithms
Author: Qiong Sun Publisher: Open Dissertation Press ISBN: 9781360972220 Category : Languages : en Pages :
Book Description
This dissertation, "Topology-transparent Distributed Scheduling in Wireless Networks" by Qiong, Sun, 孙琼, was obtained from The University of Hong Kong (Pokfulam, Hong Kong) and is being sold pursuant to Creative Commons: Attribution 3.0 Hong Kong License. The content of this dissertation has not been altered in any way. We have altered the formatting in order to facilitate the ease of printing and reading of the dissertation. All rights not granted by the above license are retained by the author. DOI: 10.5353/th_b4490410 Subjects: Data transmission systems Scheduling Wireless communication systems Algorithms
Author: Akula Aneesh Reddy Publisher: ISBN: Category : Languages : en Pages : 342
Book Description
Wireless scheduling is a fundamental problem in wireless networks that involves scheduling transmissions of multiple users in order to support data flows with as high rates as possible. This problem was first addressed by Tassuilas and Ephremides, resulting in the celebrated Back-Pressure network scheduling algorithm. This algorithm schedules network links to maximize throughput in an opportunistic fashion using instantaneous network state information (NSI), i.e., queue and channel state knowledge across the entire network. However, the Back-Pressure (BP) algorithm suffers from various drawbacks - (a) it requires knowledge of instantaneous NSI from the whole network, i.e. feedback about time-varying channel and queue states from all links of the network, (b) the algorithm requires solving a global optimization problem at each time to determine the schedule, making it highly centralized. Further, Back-pressure algorithm was originally designed for wireless networks where interference is modeled using protocol interference model. As recent break-throughs in full-duplex communications and interference cancelation techniques provide greatly increased capacity and scheduling flexibility, it is not clear how BP algorithm can be modified to improve the data rates and reduce the delay. In this thesis, we address the drawbacks of Back-Pressure algorithm to some extent. In particular, our first work provides a new scheduling algorithm (similar to BP) that allows users to make individual decisions (distributed) based on heterogeneously delayed network state information (NSI). Regarding the complexity issue, in our second work, we analyze the performance of the greedy version of BP algorithm, known as Greedy Maximal Scheduling (GMS) and understand the effect of channel variations on the performance of GMS. In particular, we characterize the efficiency ratio of GMS in wireless networks with fading. In our third and fourth work, we propose and analyze new scheduling algorithms that can benefit from new advancements in interference cancelation techniques.
Author: Azzedine Boukerche Publisher: CRC Press ISBN: 1420035096 Category : Computers Languages : en Pages : 1042
Book Description
The Handbook of Algorithms for Wireless Networking and Mobile Computing focuses on several aspects of mobile computing, particularly algorithmic methods and distributed computing with mobile communications capability. It provides the topics that are crucial for building the foundation for the design and construction of future generations of mobile and wireless networks, including cellular, wireless ad hoc, sensor, and ubiquitous networks. Following an analysis of fundamental algorithms and protocols, the book offers a basic overview of wireless technologies and networks. Other topics include issues related to mobility, aspects of QoS provisioning in wireless networks, future applications, and much more.
Author: Shuang Xia Publisher: ISBN: Category : Electronic dissertations Languages : en Pages : 39
Book Description
Recent advancement in distributed scheduling algorithms mainly focuses on designing CSMA-type protocols to achieve maximum network throughput in a fully distributive manner. However, it is inherently difficult for distributed scheduling algorithms to promise hard deadlines and a good performance in the presence of heavy-tailed traffic. To encounter this, there are two distributed throughput optimal scheduling to be proposed, which is timely-throughput optimal scheduling and throughput optimal scheduling with heavy-tailed traffic. The timely-throughput optimal scheduling distributed determines the optimal transmission times for network users so that the largest set of traffic rates of network users can be supported, while ensuring timely data delivery within hard deadlines. Then, the distributed throughput optimal scheduling with heavy-tailed traffic is proposed, which makes the scheduling decision based on the queue lengths raised to the ?-th power. It is demonstrated that DMWS-? is throughput optimal with respect to moment stability in the sense that if the traffic arrivals rates are within the network stability region, all network users with light-tailed traffic arrivals always have bounded queueing delay with finite mean and variance.
Author: Publisher: ISBN: Category : Languages : en Pages : 6
Book Description
A new channel access protocol for ad-hoc networks based on topology-dependent transmission scheduling, named collision-avoidance time allocation (CATA), is introduced. CATA allows nodes to contend for and reserve time slots by means of a distributed reservation and handshake mechanism. Contention is limited among nodes within two hops of one another, which provides a very efficient spatial reuse of the bandwidth available. CATA ensures that no collisions occur in successfully reserved time slots, even when hidden terminals exist. Reservations in CATA support unicasting, multicasting and broadcasting simultaneously, and adapt to dynamic service time. The throughput achieved by CATA is analyzed for the case of a fully-connected network topology. Numerical results show that CATA can achieve very high throughput.
Author: Libin Jiang Publisher: Morgan & Claypool Publishers ISBN: 1608454622 Category : Technology & Engineering Languages : en Pages : 156
Book Description
In this book, we consider the problem of achieving the maximum throughput and utility in a class of networks with resource-sharing constraints. This is a classical problem of great importance. In the context of wireless networks, we first propose a fully distributed scheduling algorithm that achieves the maximum throughput. Inspired by CSMA (Carrier Sense Multiple Access), which is widely deployed in today's wireless networks, our algorithm is simple, asynchronous, and easy to implement. Second, using a novel maximal-entropy technique, we combine the CSMA scheduling algorithm with congestion control to approach the maximum utility. Also, we further show that CSMA scheduling is a modular MAC-layer algorithm that can work with other protocols in the transport layer and network layer. Third, for wireless networks where packet collisions are unavoidable, we establish a general analytical model and extend the above algorithms to that case. Stochastic Processing Networks (SPNs) model manufacturing, communication, and service systems. In manufacturing networks, for example, tasks require parts and resources to produce other parts. SPNs are more general than queueing networks and pose novel challenges to throughput-optimum scheduling. We proposes a "deficit maximum weight" (DMW) algorithm to achieve throughput optimality and maximize the net utility of the production in SPNs. Table of Contents: Introduction / Overview / Scheduling in Wireless Networks / Utility Maximization in Wireless Networks / Distributed CSMA Scheduling with Collisions / Stochastic Processing networks
Author: Mohammad Ilyas Publisher: CRC Press ISBN: 1420040405 Category : Technology & Engineering Languages : en Pages : 621
Book Description
A relative newcomer to the field of wireless communications, ad hoc networking is growing quickly, both in its importance and its applications. With rapid advances in hardware, software, and protocols, ad hoc networks are now coming of age, and the time has come to bring together into one reference their principles, technologies, and techniques. The Handbook of Ad Hoc Wireless Networks does exactly that. Experts from around the world have joined forces to create the definitive reference for the field. From the basic concepts, techniques, systems, and protocols of wireless communication to the particulars of ad hoc network routing methods, power, connections, traffic management, and security, this handbook covers virtually every aspect of ad hoc wireless networking. It includes a section that explores several routing methods and protocols directly related to implementing ad hoc networks in a variety of applications. The benefits of ad hoc wireless networks are many, but several challenges remain. Organized for easy reference, The Handbook of Ad Hoc Wireless Networks is your opportunity to gain quick familiarity with the state of the art, have at your disposal the only complete reference on the subject available, and prepare to meet the technological and implementation challenges you'll encounter in practice.
Author: Qiong Sun
Author: Qiong Sun
Author: Qiong Sun
Author: Akula Aneesh Reddy
Author: Ji-Her Ju
Author: Azzedine Boukerche
Author: Shuang Xia
Author: Daeseob Lim
Author: 
Author: Libin Jiang
Author: Mohammad Ilyas