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.
This work was supported in part by Advanced Technology Office of the Defense Advanced Research Projects Agency (DARPA) under grant No. DAAD19-01-C-0026, and by the U.S. Air Force/OSR under grant No. F49620-00-1-0330.
Chapter PDF
Similar content being viewed by others
References
L. Bao and J.J. Garcia-Luna-Aceves. A New Approach to Channel Access Scheduling for Ad Hoc Networks. In Proc. ACM Seventh Annual International Conference on Mobile Computing and networking, Rome, Italy, Jul. 16–21 2001.
D. Bertsekas and R. Gallager. Data Networks, 2nd edition. Prentice Hall, Engle-wood Cliffs, NJ, 1992.
A. Ephremides and T.V. Truong. Scheduling broadcasts in multihop radio networks. IEEE Transactions on Communications, 38(4):456–60, Apr. 1990.
S. Even, O. Goldreich, S. Moran, and P. Tong. On the NP-completeness of certain network testing problems. Networks, 14(1):1–24, Mar. 1984.
C.L. Fullmer and J.J. Garcia-Luna-Aceves. Floor acquisition multiple access (FAMA) for packet-radio networks. In A CM SIGCOMM’ 95, pages 262–73, Cambridge, MA, USA, Aug. 28–Sep. 1 1995.
J.J. Garcia-Luna-Aceves and J. Raju. Distributed assignment of codes for multihop packet-radio networks. In MILCOM 97 Proceedings, pages 450–4, Monterey, CA, USA, Nov. 2–5 1997.
M. Joa-Ng and I.T. Lu. Spread spectrum medium access protocol with collision avoidance in mobile ad-hoc wireless network. In IEEE INFOCOM’ 9, pages 776–83, New York, NY, USA, Mar. 21–25 1999.
P. Karn. MACA-a new channel access method for packet radio. In Proceedings ARRL/CRRL Amateur Radio 9th Computer Networking Conference, New York, Apr. 1990.
L. Kleinrock and F.A. Tobagi. Packet switching in radio channels. I. Carrier sense multiple-access modes and their throughput-delay characteristics. IEEE Transactions on Communications, COM-23(12):1400–16, Dec 1975.
L. Lamport. Time, clocks, and the ordering of events in a distributed system. Communications of the ACM, 21(7):558–65, Jul. 1978.
T. Makansi. Trasmitter-Oriented Code Assignment for Multihop Radio Net-works. IEEE Transactions on Communications, 35(12):1379–82, Dec. 1987.
S. Ramanathan. A unified framework and algorithm for channel assignment in wireless networks. Wireless Networks, 5(2):81–94, 1999.
R. Ramaswami and K.K. Parhi. Distributed scheduling of broadcasts in a radio network. In IEEE INFOCOM’89, volume 2, pages 497–504, Ottawa, Ont., Canada, Apr. 23–27 1989. IEEE Comput. Soc. Press.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bao, L., Garcia-Luna-Aceves, J.J. (2002). Distributed Transmission Scheduling Using Code-Division Channelization. In: Gregori, E., Conti, M., Campbell, A.T., Omidyar, G., Zukerman, M. (eds) NETWORKING 2002: Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications. NETWORKING 2002. Lecture Notes in Computer Science, vol 2345. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-47906-6_12
Download citation
DOI: https://doi.org/10.1007/3-540-47906-6_12
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43709-3
Online ISBN: 978-3-540-47906-2
eBook Packages: Springer Book Archive