Abstract
The scheduling problem in wireless networks asks to split a set of links (transmission requests) into the minimum number of “feasible” subsets. In this paper the theoretical gap between the schedule length in the SINR model and in the corresponding conflict-graph model is evaluated, considering three different power schemes. It is shown that this gap depends largely on the power scheme used and on the metric space where the network is located. While in metric spaces of small doubling dimension (such as Euclidean metrics) certain upper bounds can be proven for the difference between the two models, in general metrics the difference can be arbitrary.
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
Cardieri, P.: Modeling interference in wireless ad hoc networks. IEEE Commun. Surveys Tuts. 12(4), 551–572 (2010)
Grönkvist, J., Hansson, A.: Comparison between graph-based and interference-based STDMA scheduling. In: 2nd ACM International Symposium on Mobile Ad Hoc Networking & Computing, pp. 255–258. ACM (2001)
Moscibroda, T., Wattenhofer, R., Yves, W.: Protocol design beyond graph-based models. In: 5th ACM SIGCOMM Workshop on Hot Topics in Networks, Irvine, California, USA. ACM (2006)
Behzad, A., Rubin, I.: On the performance of graph-based scheduling algorithms for packet radio networks. In: IEEE Global Telecommunications Conference, pp. 3432–3436. IEEE (2003)
Iyer, A., Rosenberg, C., Karnik, A.: What is the right model for wireless channel interference? IEEE Trans. Wireless Commun. 8(5), 2662–2671 (2009)
Halldórsson, M.M.: Wireless scheduling with power control. In: Fiat, A., Sanders, P. (eds.) ESA 2009. LNCS, vol. 5757, pp. 361–372. Springer, Heidelberg (2009)
Tonoyan, T.: Algorithms for scheduling with power control in wireless networks. In: Marchetti-Spaccamela, A., Segal, M. (eds.) TAPAS 2011. LNCS, vol. 6595, pp. 252–263. Springer, Heidelberg (2011)
Rappaport, T.S.: Wireless Communications: Principles and Practice, 2nd edn. Prentice Hall (2002)
Tonoyan, T.: On the capacity of oblivious powers. In: Erlebach, T., Nikoletseas, S., Orponen, P. (eds.) ALGOSENSORS 2011. LNCS, vol. 7111, pp. 225–237. Springer, Heidelberg (2012)
Heinonen, J.: Lectures on Analysis on Metric Spaces, 1st edn. Springer (2000)
Halldórsson, M.M., Mitra, P.: Wireless capacity with oblivious power in general metrics. In: 22nd Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1538–1548. SIAM (2011)
Halldórsson, M.M., Wattenhofer, R.: Wireless communication is in APX. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009, Part I. LNCS, vol. 5555, pp. 525–536. Springer, Heidelberg (2009)
Moscibroda, T., Wattenhofer, R.: The complexity of connectivity in wireless networks. In: 25th IEEE International Conference on Computer Communications, Barcelona, Spain, pp. 1–13. IEEE (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
Tonoyan, T. (2013). Comparing Schedules in the SINR and Conflict-Graph Models with Different Power Schemes. In: Cichoń, J., Gȩbala, M., Klonowski, M. (eds) Ad-hoc, Mobile, and Wireless Network. ADHOC-NOW 2013. Lecture Notes in Computer Science, vol 7960. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-39247-4_27
Download citation
DOI: https://doi.org/10.1007/978-3-642-39247-4_27
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-39246-7
Online ISBN: 978-3-642-39247-4
eBook Packages: Computer ScienceComputer Science (R0)