Abstract
Gossiping is to broadcast the message of every node to all the other nodes in multi-hop wireless networks (MWNs). This operation plays an important role and is widely used in MWNs. Interference-aware gossiping scheduling (IAGS) aims to provide an interference-free scheduling for gossiping with the minimum latency. Previous work on IAGS mostly assumes that nodes are always active, and thus is not suitable for duty-cycled scenarios. In this paper, we investigate the IAGS problem in uncoordinated duty-cycled multi-hop wireless networks (IAGS-UDC problem) under protocol interference model and unbounded-size message model. We prove that the IAGS-UDC problem is NP-hard. We propose a novel approximation algorithm called MILD for this problem. The MILD algorithm achieves an approximation ratio of 3β 2(Δ + 6)|T|, where β is \(\lceil \frac{2}{3}(\alpha+2)\rceil\), α denotes the ratio of the interference radius to the transmission radius, Δ denotes the maximum node degree of the network, and |T| denotes the number of time-slots in a scheduling period. Moreover, the number of transmissions scheduled by the MILD algorithm is at most 3 times as large as the minimum number of transmissions.
This work is supported in part by Hong Kong GRF grants (PolyU 5236/06E, PolyU 5102/08E), PolyU ICRG grant 1-ZV5N, National Basic Research Program of China grant 2006CB30300.
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
Chlamtac, I., Kutten, S.: On broadcasting in radio networks - problem analysis and protocol design. IEEE Transactions on Communications 33, 1240–1246 (1985)
Gandhi, R., Parthasarathy, S., Mishra, A.: Minimizing broadcast latency and redundancy in ad hoc networks. In: Proc. of ACM MobiHoc (2003)
Chrobak, M., Gasiniec, L., Rytter, W.: Fast broadcasting and gossiping in radio networks. Journal of Algorithms 43, 177–189 (2002)
Chrobak, M., Gasiniec, L., Rytter, W.: A randomized algorithm for gossiping in radio networks. In: Wang, J. (ed.) COCOON 2001. LNCS, vol. 2108, pp. 483–492. Springer, Heidelberg (2001)
Gasieniec, L., Lingas, A.: On adaptive deterministic gossiping in ad hoc radio networks. Information Processing Letters 83, 89–93 (2002)
Huang, S.C.H., Du, H., Park, E.K.: Minimum-latency gossiping in multi-hop wireless networks. In: Proc. of ACM MobiHoc (2008)
Gandhi, R., Kim, Y.-A., Lee, S., Ryu, J., Wan, P.J.: Approximation algorithms for data broadcast in wireless networks. In: Proc. of IEEE INFOCOM (2009)
Ni, S.Y., Tseng, Y.C., Chen, Y.S., Sheu, J.P.: The broadcast storm problem in a mobile ad hoc network. In: Proc. of ACM MobiCom (1999)
Wan, P.J., Wang, Z., Wan, Z., Huang, S.C.H., Liu, H.: Minimum-latency schedulings for group communications in multi-channel multihop wireless networks. In: Liu, B., Bestavros, A., Du, D.-Z., Wang, J. (eds.) WASA 2009. LNCS, vol. 5682, pp. 469–478. Springer, Heidelberg (2009)
Wang, F., Liu, J.: Duty-cycle-aware broadcast in wireless sensor networks. In: Proc. of IEEE INFOCOM (2009)
Guo, S., Gu, Y., Jiang, B., He, T.: Opportunistic flooding in low-duty-cycle wireless sensor networks with unreliable links. In: Proc. of ACM MobiCom (2009)
Hong, J., Cao, J., Li, W., Lu, S., Chen, D.: Sleeping schedule-aware minimum latency broadcast in wireless ad hoc networks. In: Proc. of IEEE ICC (2009)
Jiao, X., Lou, W., Ma, J., Cao, J., Wang, X., Zhou, X.: Duty-cycle-aware minimum latency broadcast scheduling in multi-hop wireless networks. In: Proc. of IEEE ICDCS (2010)
Huang, S.C.H., Wan, P.J., Deng, J., Han, Y.S.: Broadcast scheduling in interference environment. IEEE Transactions on Mobile Computing 7, 1338–1348 (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jiao, X., Lou, W., Wang, X., Ma, J., Cao, J., Zhou, X. (2010). Interference-Aware Gossiping Scheduling in Uncoordinated Duty-Cycled Multi-hop Wireless Networks. In: Pandurangan, G., Anil Kumar, V.S., Ming, G., Liu, Y., Li, Y. (eds) Wireless Algorithms, Systems, and Applications. WASA 2010. Lecture Notes in Computer Science, vol 6221. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14654-1_24
Download citation
DOI: https://doi.org/10.1007/978-3-642-14654-1_24
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-14653-4
Online ISBN: 978-3-642-14654-1
eBook Packages: Computer ScienceComputer Science (R0)