Abstract
We study group communication scheduling in duty-cycled multi-hop wireless sensor networks. Assume that time is divided into time-slots and we group multiple consecutive time-slots into periods. Each node can transmit data at any time-slot while it only wakes up at its active time-slot of every period and thus be allowed to receive data. Under the protocol interference model, we investigate four group communication patterns, i.e., broadcast, data aggregation, data gathering, and gossiping. For each pattern, we develop a delay efficient scheduling algorithm which greatly improve the current state-of-the-art algorithm. Additionally, we propose a novel and efficient design to coherently couple the wireless interference requirement and duty cycle requirement.
This work was supported in part by the National Science Foundation of USA under grant CNS-0916666 and by National Natural Science Foundation of P. R. China under grant 61128005.
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
Blum, J., Ding, M., Thaeler, A., Cheng, X.: Connected dominating set in sensor networks and manets. In: Handbook of Combinatorial Optimization, pp. 329–369 (2005)
Chen, X., Hu, X., Zhu, J.: Minimum Data Aggregation Time Problem in Wireless Sensor Networks. In: Jia, X., Wu, J., He, Y. (eds.) MSN 2005. LNCS, vol. 3794, pp. 133–142. Springer, Heidelberg (2005)
Chlamtac, I., Kutten, S.: On broadcasting in radio networks–problem analysis and protocol design. IEEE Transactions on Communications, 1240–1246 (2002)
Gandhi, R., Mishra, A., Parthasarathy, S.: Minimizing broadcast latency and redundancy in ad hoc networks. IEEE/ACM Transactions on Networking, 840–851 (2008)
Gupta, P., Kumar, P.: The capacity of wireless networks. IEEE Transactions on Information Theory 46(2), 388–404 (2000)
Hong, J., Cao, J., Li, W., Lu, S., Chen, D.: Sleeping schedule-aware minimum latency broadcast in wireless ad hoc networks. In: IEEE ICC, pp. 1–5. IEEE (2009)
Huang, S., Du, H., Park, E.: Minimum-latency gossiping in multi-hop wireless networks. In: ACM MobiHoc, pp. 323–330 (2008)
Huang, S., Wan, P., Du, H., Park, E.: Minimum latency gossiping in radio networks. IEEE TPDS, 790–800 (2010)
Huang, S., Wan, P., Jia, X., Du, H., Shang, W.: Minimum-latency broadcast scheduling in wireless ad hoc networks. In: IEEE INFOCOM, pp. 733–739 (2007)
Huang, S., Wan, P., Vu, C., Li, Y., Yao, F.: Nearly Constant Approximation for Data Aggregation Scheduling in Wireless Sensor Networks. In: IEEE INFOCOM, pp. 366–372 (2007)
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: IEEE ICDCS, pp. 754–763 (2010)
Jiao, X., Lou, W., Wang, X., Cao, J., Xu, M., Zhou, X.: Data aggregation scheduling in uncoordinated duty-cycled wireless sensor networks under protocol interference model. In: Ad Hoc and Sensor Wireless Networks
Jiao, X., Lou, W., Wang, X., Ma, J., Cao, J., Zhou, X.: 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.) WASA 2010. LNCS, vol. 6221, pp. 192–202. Springer, Heidelberg (2010)
Jiao, X., Lou, W., Wang, X., Ma, J., Cao, J., Zhou, X.: On interference-aware gossiping in uncoordinated duty-cycled multi-hop wireless networks. In: Ad Hoc Networks (2011)
Wan, P.-J., Alzoubi, K.M., Frieder, O.: Distributed construction of connected dominating set in wireless ad hoc networks. In: IEEE INFOCOM (2002)
Wan, P., Huang, S., Wang, L., Wan, Z., Jia, X.: Minimum-latency aggregation scheduling in multihop wireless networks. In: ACM MobiHoc, pp. 185–194 (2009)
Wan, P., Wang, L., Frieder, O.: Fast group communications in multihop wireless networks subject to physical interference. In: IEEE MASS, pp. 526–533 (2009)
Xu, X., Li, X.Y., Mao, X., Tang, S., Wang, S.: An improved approximation algorithm for data aggregation in multi-hop wireless sensor networks. IEEE TPDS (2011)
Xu, X., Li, X.Y., Wan, P.J., Tang, S.: Efficient Scheduling for Periodic Aggregation Queries in Multihop Sensor Networks. To Appear in IEEE/ACM Transactions on Networking
Yu, B., Li, J., Li, Y.: Distributed Data Aggregation Scheduling in Wireless Sensor Networks. In: INFOCOM (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Xu, X., Cao, J., Wan, PJ. (2012). Fast Group Communication Scheduling in Duty-Cycled Multihop Wireless Sensor Networks. In: Wang, X., Zheng, R., Jing, T., Xing, K. (eds) Wireless Algorithms, Systems, and Applications. WASA 2012. Lecture Notes in Computer Science, vol 7405. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31869-6_17
Download citation
DOI: https://doi.org/10.1007/978-3-642-31869-6_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-31868-9
Online ISBN: 978-3-642-31869-6
eBook Packages: Computer ScienceComputer Science (R0)