Abstract
Broadcast scheduling is a mechanism for performing interference-aware broadcasting in multi-hop wireless sensor networks (WSNs). Existing studies assume all the WSN nodes lie on a 2D plane. This assumption is not always appropriate, as in practice the sensor nodes may acquire positions in the 3D space. In this paper, we study the broadcast scheduling problem in which we consider two different models of the transmission graph: Disk Graph (DG) in 2D and Ball Graph (BG) in 3D. We consider each node may have different transmission ranges and the interference range is α time of the transmission range (where α> 1). We devise efficient coloring methods for coloring a hexagonal tiling in 2D and truncated octahedragonal tiling in 3D, which leads to O(1)-approximation ratio for broadcast scheduling problem in 2D and 3D, respectively.
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
Gandhi, R., Parthasarthy, S., Mishra, A.: Minimizing broadcast latency and redundancy in ad hoc networks. In: Mobihoc 2003, Proceedings of the 4th international symposium on Mobile Ad hoc Networking and Computing, pp. 222–232 (2003)
Chen, Z., Qiao, C., Xu, J., Lee, T.: A constant approximation algorithm for interference -aware broadcast in wireless networks. In: INFOCOM, pp. 740–748 (2007)
Huang, S.C.-H., Wan, P.-J., Jia, X., Du, H., Shang, W.: Minimum-latency broadcast scheduling in wireless ad hoc networks. In: INFOCOM, pp. 733–739 (2007)
Huang, S.C.-H., Wan, P.-J., Deng, J., Han, Y.S.: Broadcast Scheduling in interference Environment. IEEE Transaction on Mobile Computing 7(11) (2008)
Mahjourian, R., Chen, F., Tiwari, R., Thai, M.T., Zhai, H., Fang, Y.: An approximation algorithm for conflict-aware broadcast scheduling in wireless ad hoc networks. In: MobiHoc 2008, Proceedings of the 9th ACM international symposium on Mobile Ad hoc Networking and Computing, pp. 331–340 (2008)
Sen, A., Roxboroough, T., Sinha, B.P.: On an Optimal Algorithm for Channel Assignment in Cellur networks. In: ICC 1999, International Conference on Communication, vol. 2, pp. 1147–1151 (1999)
Ho, C., Obraczka, K., Tsudik, G., Vishvanath, K.: Flooding for reliable multicast in multi-hop ad hoc networks. In: The proceeding of the 3rd international workshop on discrete algorithms and methods for mobile communication, pp. 64–71 (1999)
Gamst, A.: Homogeneous distribution of frequencies in a regular hexagonal cell system. IEEE Transaction on Vehicular Technology 31(3), 132–144 (1982)
Cassels, J.W.S.: An introduction to the geometry of numbers. Springer, Berlin (1971)
Griggs, J.R., Jin, X.T.: Optimal Channel Assignment for Lattices with Conditions at Distance Two. In: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS 2005), vol. 13, p. 238 (2005)
Leese, R.A.: A Unified Approach to the Assignment of Radio Channels on a Regular hexagonal Grid. IEEE Transactions on Vehicular Technology 46 (November 1997)
Arnaud, J.F.: Frequency Planning for Broadcast Services in Europe. Proceedings of the IEEE 68 (December 1980)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tiwari, R., Dinh, T.N., Thai, M.T. (2009). On Approximation Algorithms for Interference-Aware Broadcast Scheduling in 2D and 3D Wireless Sensor Networks. In: Liu, B., Bestavros, A., Du, DZ., Wang, J. (eds) Wireless Algorithms, Systems, and Applications. WASA 2009. Lecture Notes in Computer Science, vol 5682. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03417-6_43
Download citation
DOI: https://doi.org/10.1007/978-3-642-03417-6_43
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-03416-9
Online ISBN: 978-3-642-03417-6
eBook Packages: Computer ScienceComputer Science (R0)