Distributed Transmission Scheduling Using Code-Division Channelization

Authors:
Lichun Bao;J. J. Garcia-Luna-Aceves
Affiliations:
-;-
Venue:
NETWORKING '02 Proceedings of the Second International IFIP-TC6 Networking Conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; and Mobile and Wireless Communications
Year:
2002

Citing 5
Cited 2

Data networks (2nd ed.)

Data networks (2nd ed.)
Floor acquisition multiple access (FAMA) for packet-radio networks

SIGCOMM '95 Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
A unified framework and algorithm for channel assignment in wireless networks

Wireless Networks
Time, clocks, and the ordering of events in a distributed system

Communications of the ACM
A new approach to channel access scheduling for Ad Hoc networks

Proceedings of the 7th annual international conference on Mobile computing and networking

Distributed scheduling and dynamic pricing in a communication network

Wireless Networks
Upper bounding service capacity in multi-hop wireless SSMA-based ad hoc networks

Ad Hoc Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present the Hybrid Activation Multiple Access scheduling protocol (HAMA) for wireless ad hoc networks. Unlike previous channel access scheduling protocols that activate either nodes or links only, HAMA is a node-activation oriented channel access scheduling protocol that also maximizes the chance of link activations. According to HAMA, the only required information for scheduling channel access at each node is the identifiers of neighbors within two hops. Using this neighborhood information, multiple winners for channel access are elected in each contention context, such as a time slot in a frequency band or a spreading code. Except for time slot synchronization and neighbor updates on the two-hop neighborhood changes, HAMA dedicates the bandwidth completely to data communication. The delay and throughput characteristics of HAMA are analyzed, and its performance is compared with pure node activation based scheduling protocols by simulations.