Abstract
In this paper the problem of generating a schedule for a given set of broadcasts in a Packet Radio Network is considered. The schedule must be free from primary and secondary interference. Both fixed and variable frame length cases are investigated. We show that this problem is NP‐complete even in its decision version. We also present several fast suboptimal centralized and distributed heuristics, as well as their average performances obtained through computer simulation.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
E. Arikan, Some complexity results about packet radio networks, IEEE Trans. Information Theory 30 (July 1984) 681–685.
B. Awerbuch, Optimal distributed algorithms for minimum weight spanning tree, counting, leader election and related problems, in: Proceedings 19th Annual ACM Symp. on Theory of Computing (1987) pp. 230–240.
A. Bagchi and S.L. Hakimi, Data transfers in broadcast networks, IEEE Trans. Computers 41 (July 1992) 842–847.
A.A. Bertossi and M.A. Bonuccelli, Code assignement for hidden terminal interference avoidance in multihop packet radio networks, IEEE/ACM Trans. Networking 3 (August 1995) 441–449.
I. Chlamtac and A. Lerner, Fair algorithms for maximal link activation in multihop radio networks, IEEE Trans. Communications 35 (July 1987) 739–746.
I. Chlamtac and S.S. Pinter, Distributed nodes organization algorithm for channel access in a multihop dynamic radio network, IEEE Trans. Computers 36 (June 1987) 728–737.
I. Chlamtac and O. Weinstein, The wave expansion approach to broadcasting in multihop radio networks, IEEE Trans. Communications 39 (March 1991) 426–433.
H.A. Choi and S.L. Hakimi, Data transfers in networks, Algorithmica 3 (March 1988) 223–245.
A.M. Chou and V.O.K. Li, Fair spatial TDMA channel access protocols for multihop radio network, in: '91 (April 1991) pp. 1064–1073.
A.M. Chou and V.O.K. Li, Slot allocation strategies for TDMA protocols in multihop packet radio networks, in: '91 (May 1992) pp. 710–716.
I. Cidon and M. Sidi, Distributed assignment algorithms for multihop packet radio networks, IEEE Trans. Computers 38 (October 1989) 1353–1361.
A. Ephremides and T.V. Truong, Scheduling broadcasts in multihop radio networks, IEEE Trans. Communications 38 (April 1990) 456–460.
M.R. Garey and D.S. Johnson, Computers and Intractability - A Guide to the Theory of NPCompleteness (Freeman, San Francisco, 1979).
B. Hajek and G. Sasaki, Link scheduling in polynomial time, IEEE Trans. Inform. Theory 34 (September 1988) 910–917.
A.S. Kershenbaum and M.J. Post, Distributed scheduling of CDMA networks with minimal information, IEEE Trans. Communications 39 (January 1991) 17–20.
M.J. Post, A.S. Kershenbaum and P.E. Sarachik, Scheduling multihop CDMA networks in the presence of secondary conflicts, Algorithmica 4 (December 1989) 365–394.
S. Ramanathan and E.L. Lloyd, Scheduling algorithms for multihop radio network, IEEE/ACM Trans. Networking 1 (April 1993) 166–177.
M. Raynal, Distributed Algorithms and Protocols (Wiley, New York, 1988).
G. Sasaki and R. Jain, Scheduling data transfers in preemptive hierarchical switching systems with applications to packet radio networks, in: '92 (May 1992) pp. 691–700.
M. Schwartz, Telecommunication Networks: Protocols, Modelling and Analysis (Addison-Wesley, Reading, MA, 1987).
A.S. Tanenbaum, Computer Networks (Prentice-Hall, Englewood Cliffs, NJ, 2nd ed., 1989).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Bonuccelli, M.A., Leonardi, S. On scheduling variable length broadcasts in wireless networks. Telecommunication Systems 8, 211–227 (1997). https://doi.org/10.1023/A:1019113521414
Issue Date:
DOI: https://doi.org/10.1023/A:1019113521414