Subscribe
Issue No.10 - Oct. (2012 vol.23)
pp: 1908-1914
Scott C.-H. Huang , National Tsing Hua University, Hsinchu
Hsiao-Chun Wu , Louisiana State University, Baton Rouge
Sundaraja Sitharama Iyengar , Louisiana State University, Baton Rouge
ABSTRACT
Nowadays, there is urgent demand for wireless sensor network applications. In these applications, usually a base station is responsible for monitoring the entire network and collecting information. If emergency happens, it will propagate such information to all other nodes. However, quite often the message source is not a fixed node, since there may be base stations in charge of different regions or events. Therefore, how to propagate information efficiently when message sources vary from time to time is a challenging issue. None of conventional broadcast algorithms can deal with this case efficiently, since the change of message source incurs a huge implementation cost of rebuilding a broadcast tree. To deal with this difficult problem, we make endeavor in studying multiple source broadcast, in which targeted algorithms should be source-independent to serve the practical need. In this paper, we formulate the Minimum-Latency Multisource Broadcast problem. We propose a novel solution using a fixed shared backbone, which is independent of the message sources and can be used repeatedly to reduce the broadcast latency. To the best of our knowledge, our work is deemed the first attempt to design such a multisource broadcast algorithm with a derived theoretical latency upper bound.
INDEX TERMS
Schedules, Algorithm design and analysis, Connectors, Relays, Complexity theory, Routing, Wireless networks, distributed algorithms, All-to-all broadcast, wireless networks
CITATION
Scott C.-H. Huang, Hsiao-Chun Wu, Sundaraja Sitharama Iyengar, "Multisource Broadcast in Wireless Networks", IEEE Transactions on Parallel & Distributed Systems, vol.23, no. 10, pp. 1908-1914, Oct. 2012, doi:10.1109/TPDS.2011.310
REFERENCES
 [1] R. Gandhi, S. Parthasarathy, and A. Mishra, "Minimizing Broadcast Latency and Redundancy in Ad Hoc Networks," Proc. MobiHoc '03, pp. 222-232, 2003. [2] 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 '07, pp. 733-739, 2007. [3] N. Alon, A. Bar-Noy, N. Linial, and D. Peleg, "A Lower Bound for Radio Broadcast," J. Computer and System Sciences, vol. 43, no. 2, pp. 290-298, 1991. [4] M. Elkin and G. Kortsarz, "An Improved Algorithm for Radio Networks," Proc. 16th Ann. ACM-SIAM Symp. Discrete Algorithms (SODA '05), 2005. [5] I. Gaber and Y. Mansour, "Centralized Broadcast in Multihop Radio Networks," J. Algorithms, vol. 46, no. 1, pp. 1-20, 2003. [6] 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. [7] D.R. Kowalski and A. Pelc, "Centralized Deterministic Broadcasting in Undirected Multi-Hop Radio Networks," Proc. Int'l Workshop Approximation Algorithms for Combinatorial Optimization Problems (APPROX-RANDOM '04), pp. 171-182, 2004. [8] L. Gasieniec, D. Peleg, and Q. Xin, "Faster Communication in Known Topology Radio Networks," Proc. ACM Symp. Principles of Distributed Computing (PODC '05), pp. 129-137, 2005. [9] D.R. Kowalski and A. Pelc, "Optimal Deterministic Broadcasting in Known Topology Radio Networks," Distributed Computing, vol. 19, pp. 185-195, 2007. [10] D. Bruschi and M. Del Pinto, "Lower Bounds for the Broadcast Problem in Mobile Radio Networks," Distributed Computing, vol. 10, no. 3, pp. 129-135, 1997. [11] M. Chrobak, L. Gasieniec, and W. Rytter, "Faster Broadcasting and Gossiping in Radio Networks," Proc. Symp. Foundations of Computer Science (FOCS '00), pp. 575-581, 2000. [12] R. Bar-Yehuda, O. Goldreich, and A. Itai, "On the Time-Complexity of Broadcast in Multi-Hop Radio Networks: An Exponential Gap between Determinism and Randomization," J. Computer and System Sciences, vol. 45, no. 1, pp. 104-126, 1992. [13] E. Kushilevitz and Y. Mansour, "An $\Omega (D \log (N/D))$ Lower Bound for Broadcast in Radio Networks," SIAM J. Computing, vol. 27, pp. 702-712, 1998. [14] A. Dessmark and A. Pelc, "Tradeoffs between Knowledge and Time of Communication in Geometric Radio Networks," Proc. ACM Symp. Parallel Algorithms and Architectures (SPAA '01), pp. 59-66, 2001. [15] Z. Chen, C. Qiao, J. Xu, and T. Lee, "A Constant Approximation Algorithm for Interference Aware Broadcast in Wireless Networks," Proc. IEEE INFOCOM '07, pp. 740-748, 2007. [16] W.-P. Shang, P.-J. Wan, and X.-D. Xu, "Improved Algorithm for Broadcast Scheduling of Minimal Latency in Wireless Ad Hoc Networks," Acta Math. Applicatae Sinica, vol. 26, no. 1, pp. 13-22, 2010. [17] R. Bar-Yehuda and A. Israeli, "Multiple Communication in Multi-Hop Radio Networks," Proc. ACM Symp. Principles of Distributed Computing (PODC '89), pp. 329-338, 1989. [18] C. Lee, M.H. Ammar, and J.E. Burns, "Randomized Multi-Source Broadcast Protocols in Multi-Hop Radio Networks," Technical Report: GIP-CC-93-69, Georgia Inst. of Tech nology, 1993. [19] P.-J. Wan, X. Xu, L. Wang, X. Jia, and E.K. Park, "Minimum-Latency Beaconing Schedule in Multihop Wireless Networks," Proc. IEEE INFOCOM '09, pp. 2340-2346, 2009. [20] 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. [21] L. Gewali, K. Mohamad, and M. Tun, "Interference Aware Dominating Set for Sensor Network," Proc. Third Int'l Conf. Information Technology: New Generations, pp. 268-273, http://dl.acm.orgcitation.cfm?id=1128011.1128119 , 2006. [22] S. Yi and Y.T. Hou, "Theoretical Results on Base Station Movement Problem for Sensor Network," Proc. IEEE INFOCOM '08, pp. 1-5, 2008.