Topology-independent Transmission Scheduling Algorithms in Multihop Packet Radio 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-independent Transmission Scheduling Algorithms in Multihop Packet Radio Networks PDF full book. Access full book title Topology-independent Transmission Scheduling Algorithms in Multihop Packet Radio Networks by Jong-Hoon Youn. Download full books in PDF and EPUB format.
Author: Jong-Hoon Youn Publisher: ISBN: Category : Mobile communication systems Languages : en Pages : 19
Book Description
In this paper, based on coding theory concepts, new time scheduling algorithms for multihop packet radio networks are described. Each mobile host is assigned a word from an appropriate constant weight code of length n, distance d and weight w. The host can send a message at the j[superscipt th] slot provided the assigned code has a 1 in this j[superscipt th] bit. The proposed algorithms are better than the previously known algorithms in terms of minimum system throughput and/or delay bound. The algorithms also preserve other desired properties, such as topology independence, guaranteed minimum throughput, bounded maximum delay, and fair transmission policy. In the simulation, we measure the average system throughput of transmission scheduling algorithms. The simulation results show that the proposed algorithms outperform the previously known algorithms in terms of mean system throughput.
Author: Jong-Hoon Youn Publisher: ISBN: Category : Mobile communication systems Languages : en Pages : 19
Book Description
In this paper, based on coding theory concepts, new time scheduling algorithms for multihop packet radio networks are described. Each mobile host is assigned a word from an appropriate constant weight code of length n, distance d and weight w. The host can send a message at the j[superscipt th] slot provided the assigned code has a 1 in this j[superscipt th] bit. The proposed algorithms are better than the previously known algorithms in terms of minimum system throughput and/or delay bound. The algorithms also preserve other desired properties, such as topology independence, guaranteed minimum throughput, bounded maximum delay, and fair transmission policy. In the simulation, we measure the average system throughput of transmission scheduling algorithms. The simulation results show that the proposed algorithms outperform the previously known algorithms in terms of mean system throughput.
Author: Jong-Hoon Youn Publisher: ISBN: Category : Mobile communication systems Languages : en Pages : 152
Book Description
Due to the rapid growth of wireless technology, there has been a growing interest in the capabilities of ad hoc networks connecting mobile phones, PDAs and laptop computers. The distributed and self-configurable capabilities of ad hoc networks make them very attractive for some applications such as tactical communication for military, search and rescue mission, disaster recovery, conferences, lectures, etc. In this thesis, we describe several new time scheduling algorithms for multihop packet radio networks; MaxThrou, MinDelay, ECTS (Energy Conserving Transmission Scheduling) and LA-TSMA (Location-Aided Time-Spread Multiple-Access). The MaxThrou and MinDelay algorithms focus on maximizing the system throughput and minimizing the delay bound by using constant weight codes. In these algorithms, each mobile host is assigned a word from an appropriate constant weight code of length n, distance d and weight w. The host can send a message at the j[superscript th] slot provided the assigned code has a 1 in this j[superscript th] bit. The MaxThrou and MinDelay scheduling algorithms are better than the previously known algorithms in terms of the minimum throughput per node and/or the delay bound. Since most of mobile hosts are operated using the scarce battery, and the battery life is not expected to increase significantly in the near future, energy efficiency is a critical issue in ad hoc networks. The ECTS algorithm conserves the power using strategies that allow the network interface to use the low power sleep mode instead of the idle mode, and also eliminates data collisions by introducing Request-To-Send (RTS) and Clear-To-Send (CTS) control slots. Simulation study shows that the ECTS algorithm outperforms previously known protocols. Due to the increasing popularity of mobile networking systems, the scalability becomes a significant new challenge for ad hoc network protocols. To provide a scalable solution for mobile ad hoc networks, we introduce the LA-TSMA algorithm. Instead of assigning a globally unique TSV to each host as done in previous topology-transparent scheduling algorithms, the proposed algorithm assigns a locally unique TSV to each host. In LA-TSMA, a territory is divided into zones, and the mobile hosts located in different zones can be assigned the same TSV.
Author: Publisher: ISBN: Category : Languages : en Pages : 4
Book Description
In the classic transmission scheduling problem, the nodes of a Packed Radio Network (PRN) broadcast fixed-length packets over a common resource (the channel). Packet transmissions are subject to interference constraints; for example, if a node is transmitting a packet, then all adjacent (neighboring) nodes must refrain from transmission. One then adopts a slotted time model where every slot is allocated to a set of nodes which can simultaneously transmit without conflict. Thus, a node is generally belongs to one or more of these sets(called transmission sets). Our approach is based on viewing the transmission scheduling problem as a single server multiclass polling problem with simultaneous resource possession. Here, a class corresponds to a transmission set. The server corresponds to a channel operating with deterministic service times: a service time is equal to one time slot required for transmitting a packet. The scheduling problem is then equivalent to assigning the server (equivalently, each time slot) to a particular transmissions set. The simultaneous resource possession feature arises because the server is assigned to a transmission set, i.e. it can simultaneously provide service to packets from all nodes which belong to that set. The construction of the transmission set is dependent upon the topology and connectivity of the PRN and is equivalent to a graph partitioning problem. For our purposes, we assume M transmission sets have been specified. Finally, we allow for overlapping transmission sets, i.e. a node can belong to two or more difference transmission sets.
Author: Mihaela Cardei Publisher: Springer Science & Business Media ISBN: 0387238085 Category : Technology & Engineering Languages : en Pages : 716
Book Description
Following the pattern of the Internet growth in popularity, started in the early 1990s, the current unprecedented expansion of wireless technology promises to have an even greater effect on how people communicate and interact, with considerable socio-economic impact all over the world. The driving force behind this growth is the remarkable progress in component miniaturization, integration, and also devel- ments in waveforms, coding, and communication protocols. Besides established infrastructurebased wireless networks (cellular, WLAN, sat- lite) ad-hoc wireless networks emerge as a new platform for distributed applications and for personal communication in scenarios where deploying infrastructure is not feasible. In ad-hoc wireless networks, each node is capable of forwarding packets on behalf of other nodes, so that multi-hop paths provide end-to-end connectivity. The increased flexibility and mobility of ad-hoc wireless networks are favored for appli- tions in law enforcement, homeland defense and military. In a world where wireless networks become increasingly interoperable with each other and with the high-speed wired Internet, personal communication systems will transform into universal terminals with instant access to variate content and able of handle demanding tasks, such as multimedia and real-time video. With users roaming between networks, and with wide variation in wireless link quality even in a single domain, the communications terminal must continue to provide a level of Quality of Service that is acceptable to the user and conforms to a contracted Service Level Agreement.
Author: Yijiang Sun Publisher: Open Dissertation Press ISBN: 9781361470701 Category : Languages : en Pages :
Book Description
This dissertation, "Distributed Scheduling in Multihop Ad Hoc Networks" by Yijiang, 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. Abstract: Abstract of thesis entitled "Distributed Scheduling in Multihop Ad Hoc Networks" Submitted by Sun Yijiang for the degree of Master of Philosophy at The University of Hong Kong in February 2008 A multihop ad hoc network is a network formed by multiple nodes with- out the aid of any centralized administration, and data traffic is typically forwarded by multiple intermediate nodes before reaching its destination. In this thesis, we focus on improving QoS of end-to-end traffic flows in multihop ad hoc networks through packet transmission scheduling. Our approach was to design a framework in which existing schedul- ingalgorithmsoriginallydesigned forinfrastructure-basedwirelessnetworks could be adapted to multihop ad hoc networks. While infrastructure-based wireless scheduling has been studied extensively and most of the proposed algorithms handle the characteristics of wireless medium in an effective and fairway, ourapproach aimstogeneralizetheadaptationofthese algorithms to ad hoc networks and thus to make maximum use of the existing resource of wireless scheduling. iThe framework consists of two sets of mechanisms. The first one is an end-to-end service compensation mechanism. Each multihop flow is asso- ciated with some QoS requirement, which is requested and granted in the form of the desired service rate. The achieved rate is estimated at the des- tination and fed back to the source periodically. Both the desired rate and achieved rate of a multihop flow are propagated from the source node to all its downstream relaying nodes. With this information, a compensation- capable scheduling algorithm originally designed for infrastructure-based wireless networks can be adapted to each ad hoc node for error compensa- tion. The second part of the framework is a set of mechanisms for distributed opportunistic scheduling in multihop wireless ad hoc networks. The frame- work includes a wireless link state estimation mechanism, a requirement on medium access control protocol and two mechanisms to limit the access of the wireless medium. The link state estimation mechanism provides the necessary status of each wireless link and thus enables the adaptation of various opportunistic scheduling algorithms. The performance ofthe proposed framework was evaluated by computer simulations. Theresultsshowed thattheframeworkcaneffectivelycompen- sate flows that suffer sporadic burst channel errors in an end-to-end fashion and provides robust outcome fairness in the presence of channel errors. (Total number of words: 357) Signed Sun Yijiang ii DOI: 10.5353/th_b3955828 Subjects: Ad hoc networks (Computer networks) Computer algorithms
Author: IEEE Information Theory Society Publisher: Institute of Electrical & Electronics Engineers(IEEE) ISBN: 9780780320161 Category : Computers Languages : en Pages : 540
Author: Publisher: ISBN: Category : Languages : en Pages : 27
Book Description
This paper describes two algorithms for scheduling packets in a multi-hop network. The objective of the algorithms is to reduce end-to-end message (not packet) transmission delays. Both algorithms schedule packet transmissions based on the length of the original message that the packet belongs to. The first algorithm is preemptive and is based on the shortest-message-first principle and the second is based on the shortest-remaining-transmit-time principle. We develop simulation models for analyzing the algorithms. The simulations show that when message sizes vary widely, these algorithms can significantly reduce average end-to-end message delays compared to First-Come-First-Serve scheduling.
Author: Jong-Hoon Youn
Author: Jong-Hoon Youn
Author: Jong-Hoon Youn
Author: Ji-Her Ju
Author: 
Author: Mihaela Cardei
Author: Yijiang Sun
Author: 
Author: Rajiv Ramaswami
Author: IEEE Information Theory Society
Author: