Properties of a transmission assignment algorithm for multiple-hop packet radio networks

Hammond, J.L.; Russell, H.B.

doi:10.1109/twc.2004.830855

Cited by 35 publications

(19 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Lyui's algorithm ensures one guaranteed transmission slot per frame for each terminal, and a terminal may be assigned multiple transmission slots depending on the color numbers of the other terminals in its neighborhood. A description of Lyui's slot assignment algorithm and its properties can be found in [9].…”

Section: B Lyui's Transmission Scheduling Algorithmmentioning

confidence: 99%

A Load-Based Approach for Selecting the Backbone Terminals for a Hierarchical Ad Hoc Network

Hazarika

Russell

2014

2014 IEEE Military Communications Conference

View full text Add to dashboard Cite

Efficient routing in mobile ad hoc networks (MANETs) is highly desired and connected dominating sets (CDS) have been gaining significant popularity in this regard. The CDS based approach reduces the search for a minimum cost path between a source and destination terminals to the set of terminals forming the backbone network. Researchers over the years have developed numerous distributed and localized algorithms for constructing CDSs which minimize the number of terminals forming the backbone or which provide multiple source-destination paths between each pair of terminals. However none of this research focuses on minimizing the load at the bottleneck terminal of the backbone network constructed by the CDS algorithms. A terminal becomes a bottleneck if the offered traffic load is greater than its effective transmission rate. In this paper we analyze the load based performance of a CDS algorithm and a k-connected k-dominating set (k-CDS) algorithm and compare it with our centralized algorithm which has been designed to minimize the load at the bottleneck terminals of the backbone network. We verify the effectiveness of our algorithm by simulating a large number of random test networks.

show abstract

Section: B Lyui's Transmission Scheduling Algorithmmentioning

confidence: 99%

A Load-Based Approach for Selecting the Backbone Terminals for a Hierarchical Ad Hoc Network

Hazarika

Russell

2014

2014 IEEE Military Communications Conference

View full text Add to dashboard Cite

show abstract

“…We employ a distributed scheduling algorithm developed by Lyui [30], and a description of the algorithm and its properties is found in [31]. To schedule transmissions for a given terminal i, we define the neighborhood of i as the set of terminals with which i must share the channel (in Section 4 we explain how i builds its neighborhood).…”

Section: Scheduling Algorithmmentioning

confidence: 99%

Immediate neighbor scheduling (INS): An adaptive protocol for mobile ad hoc networks using direct-sequence spread-spectrum modulation

Wolf¹,

Russell²

2011

Ad Hoc Networks

View full text Add to dashboard Cite

“…The length of the transmission schedule is referred to as the frame size, measured as the number of slots in each transmission frame. We use a more sophisticated method for assigning transmission slots to colors that was developed by Lyui and described in [10]. In Lyui's slot assignment algorithm, a terminal with color i is a candidate to transmit in slot j if…”

Section: Network Modelmentioning

confidence: 99%

A distributed load-based transmission scheduling protocol for wireless ad hoc networks

Wolf

Hammond

Russell

2006

Proceedings of the 2006 International Conference on Wireless Communications and Mobile Computing

View full text Add to dashboard Cite

This paper presents a load-based transmission scheduling (LoBaTS) protocol for wireless ad hoc networks. Since terminals in these networks may be required to forward unequal amounts of traffic, a transmission scheduling protocol which assigns equal transmission capacity to all terminals may result in traffic bottlenecks as traffic load increases. The LoBaTS protocol allows terminals to alter their existing transmission schedules so that those terminals which are required to forward more traffic can reserve additional transmission slots, thereby alleviating traffic bottlenecks. The LoBaTS protocol is designed to avoid creation of new traffic bottlenecks, maintain collision-free broadcast transmissions, and execute with minimal disruption to the network. In addition, it requires only local information to operate, making it suitable for implementation in a distributedcontrol environment. Simulations utilizing a variety of test networks and traffic conditions show that the LoBaTS protocol greatly improves end-to-end packet delay, throughput, and completion rate when compared to a transmission schedule which does not account for traffic load.

show abstract

Properties of a transmission assignment algorithm for multiple-hop packet radio networks

Cited by 35 publications

References 11 publications

A Load-Based Approach for Selecting the Backbone Terminals for a Hierarchical Ad Hoc Network

A Load-Based Approach for Selecting the Backbone Terminals for a Hierarchical Ad Hoc Network

Immediate neighbor scheduling (INS): An adaptive protocol for mobile ad hoc networks using direct-sequence spread-spectrum modulation

A distributed load-based transmission scheduling protocol for wireless ad hoc networks

Contact Info

Product

Resources

About