Abstract
The broadcast scheduling problem asks how a multihop network of broadcast transceivers operating on a shared medium may share the medium in such a way that communication over the entire network is possible. This can be naturally modeled as a graph coloring problem via distance-2 coloring (L(1,1)-labeling, strict scheduling). This coloring is difficult to compute and may require a number of colors quadratic in the graph degree. This paper introduces pseudo-scheduling, a relaxation of distance-2 coloring. Centralized and decentralized algorithms that compute pseudo-schedules with colors linear in the graph degree are given and proved.
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
Ahn, G., Miluzzo, E., Campbell, A.T., Hong, S., Curomo, F.: Funneling-MAC: A localized, sink-oriented MAC for boosting fidelity in sensor networks. In: Fourth ACM Conference on Embedded Network Sensor Systems (SenSys 2006), pp. 293–306 (November 2006)
Chlamtac, I., Faragó, A., Zhang, H.: Time-spread multiple access protocols for multihop mobile radio networks. IEEE/ACM Transactions on Networking 5(6), 804–812 (1997)
DiPippo, L., Tucker, D., Fay-Wolfe, V., Bryan, K.L., Ren, T., Day, W., Murphy, M., Henry, T., Joseph, S.: Energy-efficient MAC for broadcast problems in wireless sensor networks. In: Third International Conference on Networked Sensing Systems (June 2006)
Joseph, S.N.: Relaxations of L(1,1)-labeling for the broadcast scheduling problem. Ph.D. thesis, University of Rhode Island (2011), http://digitalcommons.uri.edu/cgi/viewcontent.cgi?article=2382&context=dissertations
McCormick, S.T.: Optimal approximation of sparse Hessians and its equivalence to a graph coloring problem. Mathematical Programming 26, 153–171 (1983)
Polastre, J., Hill, J., Culler, D.: Versatile low power media access for wireless sensor networks. In: Second ACM Conference on Embedded Network Sensor Systems (SenSys 2004), pp. 95–107 (November 2004)
Ren, T.: Graph Coloring Algorithms for TDMA Scheduling in Wireless Sensor Networks. Ph.D. thesis, University of Rhode Island (2007)
Rhee, I., Warrier, A., Aia, M., Min, J.: Z-MAC: a hybrid MAC for wireless sensor networks. In: Third ACM Conference on Embedded Network Sensor Systems (SenSys 2005), pp. 90–101 (November 2005)
Rhee, I., Warrier, A., Min, J., Xu, L.: DRAND: distributed randomized TDMA scheduling for wireless ad-hoc networks. In: Seventh ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc 2006), pp. 190–201 (May 2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Joseph, S.N., DiPippo, L.C. (2013). Pseudo-scheduling: A New Approach to the Broadcast Scheduling Problem. In: Bar-Noy, A., Halldórsson, M.M. (eds) Algorithms for Sensor Systems. ALGOSENSORS 2012. Lecture Notes in Computer Science, vol 7718. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-36092-3_11
Download citation
DOI: https://doi.org/10.1007/978-3-642-36092-3_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-36091-6
Online ISBN: 978-3-642-36092-3
eBook Packages: Computer ScienceComputer Science (R0)