
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Scott C.H. Huang, PengJun Wan, Jing Deng, Yunghsiang S. Han, "Broadcast Scheduling in Interference Environment," IEEE Transactions on Mobile Computing, vol. 7, no. 11, pp. 13381348, November, 2008.  
BibTex  x  
@article{ 10.1109/TMC.2008.56, author = {Scott C.H. Huang and PengJun Wan and Jing Deng and Yunghsiang S. Han}, title = {Broadcast Scheduling in Interference Environment}, journal ={IEEE Transactions on Mobile Computing}, volume = {7}, number = {11}, issn = {15361233}, year = {2008}, pages = {13381348}, doi = {http://doi.ieeecomputersociety.org/10.1109/TMC.2008.56}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Mobile Computing TI  Broadcast Scheduling in Interference Environment IS  11 SN  15361233 SP1338 EP1348 EPD  13381348 A1  Scott C.H. Huang, A1  PengJun Wan, A1  Jing Deng, A1  Yunghsiang S. Han, PY  2008 KW  Algorithm/protocol design and analysis KW  Data communications VL  7 JA  IEEE Transactions on Mobile Computing ER   
[1] N. Alon, A. BarNoy, N. Linial, and D. Peleg, “A Lower Bound for Radio Broadcast,” J. Computer and System Sciences, vol. 43, no. 2, pp. 290298, 1991.
[2] B. Awerbuch and R. Gallager, “A New Distributed Algorithm to Find Breadth First Search Trees,” IEEE Trans. Information Theory, vol. 33, no. 3, pp. 315322, 1987.
[3] R. BarYehuda, O. Goldreich, and A. Itai, “On the Time Complexity of Broadcast in MultiHop Radio Networks: An Exponential Gap between Determinism and Randomization,” J.Computer and System Sciences, vol. 45, no. 1, pp. 104126, 1992.
[4] S. Basagni, I. Chlamtac, and D. Bruschi, “A MobilityTransparent Deterministic Broadcast Mechanism for Ad Hoc Networks,” IEEE/ACM Trans. Networking, vol. 7, no. 6, pp. 799807, 1999.
[5] D. Bruschi and M. Del Pinto, “Lower Bounds for the Broadcast Problem in Mobile Radio Networks,” Distributed Computing, vol. 10, no. 3, pp. 129135, 1997.
[6] I. Chlamtac and S. Kutten, “On Broadcasting in Radio Networks: Problem Analysis and Protocol Design,” IEEE Trans. Comm., vol. 33, pp. 12401246, 1985.
[7] I. Chlamtac and O. Weinstein, “The Wave Expansion Approach to Broadcasting in Multihop Radio Networks,” IEEE Trans. Comm., vol. 39, pp. 426433, 1991.
[8] B.S. Chlebus, L. Gasieniec, A. Gibbons, A. Pelc, and W. Rytter, “Deterministic Broadcasting in Unknown Radio Networks,” Proc. 11th Ann. ACMSIAM Symp. Discrete Algorithms (SODA '00), pp.861870, 2000.
[9] A. Dessmark and A. Pelc, “Tradeoffs between Knowledge andTime of Communication in Geometric Radio Networks,” Proc. 13th Ann. ACM Symp. Parallel Algorithms and Architectures (SPAA '01), pp. 5966, 2001.
[10] M. Elkin and G. Kortsarz, “Logarithmic Inapproximability of the Radio Broadcast Problem,” J. Algorithms, vol. 52, pp. 825, 2004.
[11] M. Elkin and G. Kortsarz, “Polylogarithmic Additive Inapproximability of the Radio Broadcast Problem,” Proc. Seventh Int'l Workshop Approximation Algorithms for Combinatorial Optimization Problems (APPROXRANDOM), 2004.
[12] M. Elkin and G. Kortsarz, “An Improved Algorithm for Radio Networks,” Proc. 16th Ann. ACMSIAM Symp. Discrete Algorithms (SODA), 2005.
[13] I. Gaber and Y. Mansour, “Centralized Broadcast in Multihop Radio Networks,” J. Algorithms, vol. 46, no. 1, pp. 120, 2003.
[14] R. Gandhi, S. Parthasarathy, and A. Mishra, “Minimizing Broadcast Latency and Redundancy in Ad Hoc Networks,” Proc. ACM MobiHoc '03, pp. 222232, 2003.
[15] L. Ga¸sieniec, D. Peleg, and Q. Xin, “Faster Communication in Known Topology Radio Networks,” Proc. 24th Ann. ACM Symp. Principles of Distributed Computing (PODC '05), pp. 129137, 2005.
[16] P. Gupta and P.R. Kumar, “Capacity of Wireless Networks,” IEEE Trans. Information Theory, vol. 46, no. 2, pp. 388404, 2000.
[17] P. Gupta and P.R. Kumar, “Internets in the Sky: The Capacity of ThreeDimensional Wireless Networks,” Comm. Information and Systems, vol. 1, no. 1, pp. 3350, 2001.
[18] S.C.H. Huang, P.J. Wan, X. Jia, and H. Du, “LowLatency Broadcast Scheduling Schemes in Ad Hoc Networks,” Proc. First Int'l Conf. Wireless Algorithms, Systems, and Applications (WASA '06), Aug. 2006.
[19] D.R. Kowalski and A. Pelc, “Optimal Deterministic Broadcasting in Known Topology Radio Networks,” Distributed Computing, 2007.
[20] D.R. Kowalski and A. Pelc, “Centralized Deterministic Broadcasting in Undirected MultiHop Radio Networks,” Proc. Seventh Int'l Workshop Approximation Algorithms for Combinatorial Optimization Problems (APPROXRANDOM '04), pp. 171182, 2004.
[21] E. Kushilevitz and Y. Mansour, “An $\Omega(D\log(N/D))$ Lower Bound for Broadcast in Radio Networks,” SIAM J. Computing, vol. 27, pp.702712, 1998.
[22] R.A. Leese, “A Unified Approach to the Assignment of Radio Channels on a Regular Hexagonal Grid,” IEEE Trans. Vehicular Technology, vol. 46, no. 4, pp. 968980, 1997.
[23] M. Luby, “A Simple Parallel Algorithm for the Maximal Independent Set Problem,” SIAM J. Computing, vol. 21, no. 1, pp.10361053, 1986.
[24] T. Moscibroda and R. Wattenhofer, “Maximal Independent Sets in Radio Networks,” Proc. 24th Ann. ACM Symp. Principles of Distributed Computing (PODC '05), pp. 148157, 2005.
[25] T. Moscibroda, R. Wattenhofer, and A. Zollinger, “Topology Control Meets SINR: The Scheduling Complexity of Arbitrary Topologies,” Proc. ACM MobiHoc '06, pp. 310321, 2006.
[26] 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 MobiCom '99, pp. 151162, 1999.
[27] J.P. Sheu, P.K. Hung, and C.S. Hsu, “Scheduling of Broadcasts in Multihop Wireless Networks,” The Handbook of Ad Hoc Wireless Networks. CRC Press, pp. 483495, 2003.
[28] R. Zheng and R. Barton, “Toward Optimal Data Aggregation in Random Wireless Sensor Networks,” Proc. IEEE INFOCOM '07, pp. 249257, 2007.