The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.01 - January (2012 vol.23)
pp: 110-117
Xianlong Jiao , PDL, Nat. Univ. of Defense & Technol., Changsha, China
ABSTRACT
Broadcast is an essential and widely used operation in multihop wireless networks. Minimum latency broadcast scheduling (MLBS) aims to find a collision-free scheduling for broadcast with the minimum latency. Previous work on MLBS mostly assumes that nodes are always active, and, thus, is not suitable for duty-cycled scenarios. In this paper, we investigate the MLBS problem in duty cycled multihop wireless networks (MLBSDC problem). We prove both the one-to-all and the all-to-all MLBSDC problems to be NP hard. We propose a novel approximation algorithm called OTAB for the one-to-all MLBSDC problem, and two approximation algorithms called UTB and UNB for the all-to-all MLBSDC problem under the unit-size and the unbounded-size message models, respectively. The approximation ratios of the OTAB, UTB, and UNB algorithms are at most 17|T|, 17|T| + 20, and (Δ + 22)|T|, respectively, where |T| denotes the number of time slots in a scheduling period, and Δ denotes the maximum node degree of the network. The overhead of our algorithms is at most constant times as large as the minimum overhead in terms of the total number of transmissions. We also devise a method called Prune to further reduce the overhead of our algorithms. Extensive simulations are conducted to evaluate the performance of our algorithms.
INDEX TERMS
radio networks, approximation theory, optimisation, radio broadcasting, prune method, minimum latency broadcast scheduling, duty cycled multihop wireless networks, collision free scheduling, NP hard problem, approximation algorithm, OTAB, one-to-all MLBSDC problem, UTB, UNB, all-to-all MLBSDC problem, Approximation algorithms, Color, Approximation methods, Spread spectrum communication, Wireless networks, Algorithm design and analysis, Schedules, approximation algorithms., Broadcast scheduling, duty cycle, multihop wireless networks
CITATION
Xianlong Jiao, "Minimum Latency Broadcast Scheduling in Duty-Cycled Multihop Wireless Networks", IEEE Transactions on Parallel & Distributed Systems, vol.23, no. 1, pp. 110-117, January 2012, doi:10.1109/TPDS.2011.106
REFERENCES
[1] L. Gasieniec and A. Lingas, “On Adaptive Deterministic Gossiping in Ad Hoc Radio Networks,” Information Processing Letters, vol. 83, no. 2, pp. 89-93, 2002.
[2] R. Gandhi, S. Parthasarathy, and A. Mishra, “Minimizing Broadcast Latency and Redundancy in Ad Hoc Networks,” Proc. ACM Int'l Symp. Mobile Ad Hoc Networking and Computing (MobiHoc), 2003.
[3] S.C.-H. Huang, P.-J. Wan, X. Jia, H. Du, and W. Shang, “Minimum-Latency Broadcast Scheduling in Wireless Ad Hoc Networks,” Proc. IEEE INFOCOM, 2007.
[4] R. Gandhi, S.L.Y.-A. Kim, J. Ryu, and P.-J. Wan, “Approximation Algorithms for Data Broadcast in Wireless Networks,” Proc. IEEE INFOCOM, 2009.
[5] Z. Chen, C. Qiao, J. Xu, and T. Lee, “A Constant Approximation Algorithm for Interference Aware Broadcast in Wireless Networks,” Proc. IEEE INFOCOM, 2007.
[6] R. Mahjourian, F. Chen, and R. Tiwari, “An Approximation Algorithm for Conflict-Aware Broadcast Scheduling in Wireless Ad Hoc Networks,” Proc. ACM Int'l Symp. Mobile Ad Hoc Networking and Computing (MobiHoc), 2008.
[7] S.C.-H. Huang, P.-J. Wan, J. Deng, and Y.S. Han, “Broadcast Scheduling in Interference Environment,” IEEE Trans. Mobile Computing, vol. 7, no. 11, pp. 1338-1348, Nov. 2008.
[8] S.C.-H. Huang, H. Du, and E.-K. Park, “Minimum-latency Gossiping in Multi-hop Wireless Networks,” Proc. ACM Int'l Symp. Mobile Ad Hoc Networking and Computing (MobiHoc), 2008.
[9] S.C.-H. Huang, P.-J. Wan, H. Du, and E.-K. Park, “Minimum Latency Gossiping in Radio Networks,” IEEE Trans. Parallel and Distributed Systems, vol. 21, no. 6, pp. 790-800, June 2010.
[10] R. Zheng and R. Kravets, “On-Demand Power Management for Ad Hoc Networks,” Proc. IEEE INFOCOM, 2003.
[11] O. Dousse, P. Mannersalo, and P. Thiran, “Latency of Wireless Sensor Networks with Uncoordinated Power Saving Mechanisms,” Proc. ACM Int'l Symp. Mobile Ad Hoc Networking and Computing (MobiHoc), 2004.
[12] C. Hua and T.-S.P. Yum, “Asynchronous Random Sleeping for Sensor Networks,” ACM Trans. Sensor Networks, vol. 3, no. 3, p. 15, 2007.
[13] J. Hong, J. Cao, W. Li, S. Lu, and D. Chen, “Sleeping Schedule-Aware Minimum Latency Broadcast in Wireless Ad Hoc Networks,” Proc. IEEE Int'l Conf. Comm., 2009.
[14] I. Chlamtac and S. Kutten, “On Broadcasting in Radio Networks - Problem Analysis and Protocol Design,” IEEE Trans. Comm., vol. C-33, no. 12, pp. 1240-1246, Dec. 1985.
[15] I. Chlamtac and O. Weinstein, “The Wave Expansion Approach to Broadcasting in Multihop Radio Networks,” IEEE Trans. Comm., vol. 39, no. 3, pp. 426-433, Mar. 1991.
[16] I. Chlamtac and S. Kutten, “Tree-Based Broadcasting in Multihop Radio Networks,” IEEE Trans. Computers, vol. C-36, no. 10, pp. 1209-1223, Oct. 1987.
[17] S.-Y. Ni, Y.-C. Tseng, Y.-S. Chen, and J.-P. Sheu, “The Broadcast Storm Problem in a Mobile Ad Hoc Network,” Proc. ACM Int'l Conf. Mobile Computing and Networking (MobiCom), 1999.
[18] W. Lou and J. Wu, “On Reducing Broadcast Redundancy in Mobile Ad Hoc Networks,” IEEE Trans. Mobile Computing, vol. 1, no. 2, pp. 111-123, 2002.
[19] B.N. Clark, C.J. Colbourn, and D.S. Johnson, “Unit Disk Graphs,” Discrete Math., vol. 86, nos. 1-3, pp. 165-177, 1990.
[20] M. Chrobak, L. Gasiniec, and W. Rytter, “Fast Broadcasting and Gossiping in Radio Networks,” J. Algorithms, vol. 43, no. 2, pp. 177-189, 2002.
[21] L. Gasieniec, I. Potapov, and Q. Xin, “Time Efficient Gossiping in Known Radio Networks,” Proc. 11th Colloquium on Structural Information and Comm. Complexity (SIROCCO), 2004.
[22] M. Miller, C. Sengul, and I. Gupta, “Exploring the Energy-Latency Tradeoff for Broadcasts in Energy-Saving Sensor Networks,” Proc. IEEE Int'l Conf. Distributed Computing Systems (ICDCS), 2005.
[23] F. Wang and J. Liu, “Duty-Cycle-Aware Broadcast in Wireless Sensor Networks,” Proc. IEEE INFOCOM, 2009.
[24] S. Guo, Y. Gu, B. Jiang, and T. He, “Opportunistic Flooding in Low-Duty-Cycle Wireless Sensor Networks with Unreliable Links,” Proc. ACM MobiCom, 2009.
[25] P.-J. Wan, K.M. Alzoubi, and O. Frieder, “Distributed Construction of Connected Dominating Set in Wireless Ad Hoc Networks,” Mobile Networks and Applications, vol. 9, no. 2, pp. 141-149, 2004.
[26] D.W. Matula and L.L. Beck, “Smallest-Last Ordering and Clustering and Graph Coloring Algorithms,” J. Assoc. of Computing Machinery, vol. 30, no. 3, pp. 417-427, 1983.
[27] E.W. Dijkstra, “A Note on Two Problems in Connexion with Graphs,” Numerische Mathematik, vol. 1, no. 1, pp. 269-271, 1959.
[28] B. Yu, J. Li, and Y. Li, “Distributed Data Aggregation Scheduling in Wireless Sensor Networks,” Proc. IEEE INFOCOM, 2009.
[29] P.-J. Wan, S.C.-H. Huang, and L. Wang, “Minimum-latency Aggregation Scheduling in Multihop Wireless Networks,” Proc. ACM Int'l Symp. Mobile Ad Hoc Networking and Computing (MobiHoc), 2009.
6 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool