Operation of a dynamic transmission-scheduling protocol for mobile ad hoc networks

Authors:
Praveen K. Appani;Joseph L. Hammond;Daniel L. Noneaker;Harlan B. Russell
Affiliations:
Dept. of Electrical and Computer Engineering, Clemson University, Clemson, SC;Dept. of Electrical and Computer Engineering, Clemson University, Clemson, SC;Dept. of Electrical and Computer Engineering, Clemson University, Clemson, SC;Dept. of Electrical and Computer Engineering, Clemson University, Clemson, SC
Venue:
MILCOM'03 Proceedings of the 2003 IEEE conference on Military communications - Volume II
Year:
2003

Citing 5
Cited 1

Distributed Assignment Algorithms for Multihop Packet Radio Networks

IEEE Transactions on Computers
A unified framework and algorithm for channel assignment in wireless networks

Wireless Networks
A new approach to channel access scheduling for Ad Hoc networks

Proceedings of the 7th annual international conference on Mobile computing and networking
A Five-Phase Reservation Protocol (FPRP) for Mobile Ad Hoc Networks

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

IEEE Transactions on Wireless Communications

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

Proceedings of the 2006 international conference on Wireless communications and mobile computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we develop and examine the operation of a distributed and adaptive transmission-scheduling protocol that supports contention-free link-level broadcast transmissions in mobile, multiple-hop networks. The network adapts quickly after topology changes and only the terminals near a change are required to adjust their transmission schedules. Two key parameters affect the ability of the transmission-scheduling protocol to adapt to changes in connectivity: the rate of connectivity changes and the number of terminals near the connectivity changes. We bound the rate of changes and terminal density within which the adaptive protocols can maintain collision-free schedules with an acceptable level of overhead. While the protocols can operate efficiently if the rate of change is within certain limits, there can be periods during which a large number of changes occur. We also characterize the stability of the protocols after such periods of rapid changes in connectivity and show that the protocol can quickly retum to a collision-free transmission schedule.