Abstract
Communication constraints, in the context of scheduling in a wireless ad hoc (multi-hop) network, are a set of rules defining permissible concurrent transmissions. These rules may be imposed either by technological limitations of the transceiver, or by the operational mode of the network. This paper considers 24 distinct communication constraint sets (CCS) by comparing the average cardinality of a maximal schedule under each CCS using a greedy edge selection heuristic. The average cardinality as a function of the network size is studied via Monte Carlo simulation. The simulation results are useful for network and transceiver designers by identifying the sensitivity of scheduling performance to the CCS. In particular, the results illuminate that the performance gain obtainable by removing each constraint is highly dependent upon the overall CCS.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
E. Arikan, “Some complexity results about packet radio networks,” IEEE Transactions on Information Theory, vol. IT-30, no. 4, pp. 681–685, July 1984.
J. Grönkvist and A. Hannson, “Comparison between graph-based and interference-based STDMA scheduling,” in Proceedings of ACMMobiHoc, Long Beach, CA, October 2001, pp. 255–258.
A. Behzad and I. Rubin, “On the performance of graph-based scheduling algorithms for packet radio networks,” in Proceedings of IEEE GlobeCom, vol. 6, San Francisco, CA, December 2003, pp. 3432–3436.
R. Negi and A. Rajeswaran, “Physical layer effect on MAC performance in ad-hoc wireless networks,” in Proceedings of CIIT, Scottsdale, AZ, November 2003, pp. 1–6.
K. Jain, J. Padhye, V. Padmanabhan, and L. Qiu, “Impact of interference on multi-hop wireless network performance,” Wireless Networks, vol. 11, no. 4, pp. 471–487, 2005.
S. Ramanathan and E. Lloyd, “Scheduling algorithms for multihop radio networks,” IEEE/ACM Transactions on Networking, vol. 1, no. 2, pp. 166–177, April 1993.
E. Lloyd and S. Ramanathan, “On the complexity of distance-2 coloring,” in Proceedings of IEEE ICC, Chicago, IL, May 1992, pp. 71–74.
L. Tassiulas, “Scheduling and performance limits of networks with constantly changing topology,” IEEE Transactions on Information Theory, vol. 43, no. 3, pp. 1067–1073, May 1997.
D. Peleg, Distributed computing: a locality–sensitive approach. Philadelphia, PA: Society for Industrial and Applied Mathematics, 2000.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer Science+Business Media, LLC
About this chapter
Cite this chapter
Weber, S. (2008). Communication Constraints and Ad Hoc Scheduling. In: Raghavan, S., Golden, B., Wasil, E. (eds) Telecommunications Modeling, Policy, and Technology. Operations Research/Computer Science Interfaces, vol 44. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-77780-1_13
Download citation
DOI: https://doi.org/10.1007/978-0-387-77780-1_13
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-77779-5
Online ISBN: 978-0-387-77780-1
eBook Packages: Computer ScienceComputer Science (R0)