Interconnection algorithms in multi-hop packet radio topologies 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 Interconnection algorithms in multi-hop packet radio topologies PDF full book. Access full book title Interconnection algorithms in multi-hop packet radio topologies by P. Papantoni-Kazakos. Download full books in PDF and EPUB format.
Author: P. Papantoni-Kazakos Publisher: ISBN: Category : Languages : en Pages : 80
Book Description
We consider a two-cluster system in multi-hop packet radio topologies. Each cluster deploys a limited sensing random access algorithm, and contains local users who transmit their packets only via the algorithm in their own cluster. The system also contains marginal users, who may transmit their packers via either one of the algorithms in the two clusters. For the above system, we adopt a limited sensing random access algorithm per cluster that has been previously studied. This algorithm utilizes binary, collision versus noncollision, feedback per slot, and in the presence of the limit Poisson user model and the absence of marginal back per slot, and in the presence of the limit Poisson user model and the absence of marginal users its throughout is 0.43. We consider a dynamic interconnection policy for the marginal users, and we then study the overall system performance in the presence of limit Poisson user populations. Specifically, we study the stability regions of the system and the per packet expected delays. Our interconnection policy accelerates the marginal users, presenting them with a significant delay advantage over the local users. This is desirable when the marginal users transmit high priority data, for example. (rrh).
Author: P. Papantoni-Kazakos Publisher: ISBN: Category : Languages : en Pages : 80
Book Description
We consider a two-cluster system in multi-hop packet radio topologies. Each cluster deploys a limited sensing random access algorithm, and contains local users who transmit their packets only via the algorithm in their own cluster. The system also contains marginal users, who may transmit their packers via either one of the algorithms in the two clusters. For the above system, we adopt a limited sensing random access algorithm per cluster that has been previously studied. This algorithm utilizes binary, collision versus noncollision, feedback per slot, and in the presence of the limit Poisson user model and the absence of marginal back per slot, and in the presence of the limit Poisson user model and the absence of marginal users its throughout is 0.43. We consider a dynamic interconnection policy for the marginal users, and we then study the overall system performance in the presence of limit Poisson user populations. Specifically, we study the stability regions of the system and the per packet expected delays. Our interconnection policy accelerates the marginal users, presenting them with a significant delay advantage over the local users. This is desirable when the marginal users transmit high priority data, for example. (rrh).
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: Zachary Shane Bunting Publisher: ISBN: Category : Languages : en Pages : 93
Book Description
We investigate two distinct problems in military radio networking. In the first problem, we study a mobile airborne multi-hop wireless network. The mobility of the nodes leads to dynamic link capacities requiring changes to the topology by adding and removing links. Changes are intended to minimize maximum link load. Mixed integer linear programming is used to periodically find topological modifications resulting in optimal performance. To reduce computation and the rate of changes to the topology, we design and employ heuristic algorithms. We present several such algorithms of differing levels of complexity, and model performance using each. A comparison of the results of each method is given. In the second problem, we study a ground multi-hop wireless network. Scalability is an issue for such ground tactical radio networks, as increasing numbers of nodes and flows compete for the capacity of each link. The introduction of a relay node allows additional routes for traffic flows. Greater benefit is achieved by fixing the relay node at a higher elevation to allow it to broadcast to all other nodes simultaneously, thereby reducing the number of hops packets must travel. We use a combination of linear programming (LP) and novel bounds on the achievable network performance to investigate the benefits of such a relay node. We show that a relay node provides moderate improvement under an all-to-all unicast traffic model and more substantial improvement for broadcast traffic patterns.
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: P. Papantoni-Kazakos
Author: P. Papantoni-Kazakos
Author: Jong-Hoon Youn
Author: 
Author: International Business Machines Corporation. Research Division
Author: Arr-Mien Chou
Author: Limin Hu
Author: Zachary Shane Bunting
Author: 
Author: Jong-Hoon Youn
Author: Clifford A. Lynch