This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
On the Construction of a Strongly Connected Broadcast Arborescence with Bounded Transmission Delay
October 2006 (vol. 5 no. 10)
pp. 1460-1470
Yingshu Li, IEEE
My T. Thai, IEEE
Feng Wang, IEEE
Energy conservation is an important concern in wireless networks. Many algorithms for constructing a broadcast tree with minimum energy consumption and other goals have been developed. However, no previous research work considers the total energy consumption and transmission delays of the broadcast tree simultaneously. In this paper, based on an (\alpha, \beta){\hbox{-}}{\rm tree}, a novel concept to wireless networks, we define a new Strongly connected Broadcast Arborescence with bounded Transmission delay (SBAT) problem and design the Strongly connected Broadcast Arborescence (SBA) algorithm with linear running time to construct a strongly connected broadcast tree with bounded total power, while satisfying the constraint that the transmission delays between the source and the other hosts are also bounded. We also propose the distributed version of the SBA algorithm. The theoretical analysis and simulation results show that the SBA algorithm gives a proper solution to the SBAT problem.

[1] M. Agarwal, J.H. Cho, L. Gao, and J. Wu, “Energy Efficient Broadcast in Wireless Ad Hoc Networks with Hitch-Hiking,” Proc. IEEE INFOCOM, 2004.
[2] I.F. Akyildiz, W. Su, Y. Sankarasubramaniam, and E. Cayirci, “Wireless Sensor Networks: A Survey,” Computer Networks, vol. 38, pp. 393-422, 2002.
[3] A.K. Das, R.J. Marks, M. El-Sharkawi, P. Arabshahi, and A. Gray, “Minimum Power Broadcast Trees for Wireless Networks: Integer Programming Formulations,” Proc. IEEE INFOCOM, 2003.
[4] L. Brim, I. Cerna, P. Krcal, and R. Pelanek, “Distributed Shortest Paths for Directed Graphs with Negative Edge Lengths,” Technical Report FIMU-RS-2001-01, Faculty of Informatics, Masaryk Univ., http://www.fi.muni.cz/informaticsreports , 2001.
[5] J. Cartigny, D. Simplot, and I. Stojmenovic, “Localized Minimum-Energy Broadcasting in Ad-Hoc Networks,” Proc. IEEE INFOCOM, 2003.
[6] J.-H. Chang and L. Tassiulas, “Energy Conserving Routing in Wireless Ad-Hoc Networks,” Proc. IEEE INFOCOM, pp. 22-31, 2000.
[7] M.X. Cheng, J. Sun, M. Min, Y. Li, and W. Wu, “Energy-Efficient Broadcast and Multicast Routing in Multihop Ad Hoc Wireless Networks,” Wireless Comm. and Mobile Computing (WCMC), vol. 6, no. 2, pp. 213-223, Mar. 2006.
[8] C.E. Leiserson, R.L. Rivest, T.H. Cormen, and C. Ste, Introduction to Algorithms. MIT Press and McGraw-Hill Book Company, 1976.
[9] O. Egecioglu and T.F. Gonzalez, “Minimum-Energy Broadcast in Simple Graphs with Limited Node Power,” Proc. IASTED Int'l Conf. Parallel and Distributed Computing and Systems (PDCS 2001), pp. 334-338, Aug. 2001.
[10] M.L. Fredman and R.E. Tarjan, “Fibonacci Heaps and Their Uses in Improved Network Optimization Algorithms,” J. ACM, vol. 34, no. 3, pp. 596-615, 1987.
[11] H.N. Gabow, Z. Galil, T.H. Spencer, and R.E. Tarjan, “Efficient Algorithms for Finding Minimum Spanning Trees in Undirected and Directed Graphs,” Combinatorica, vol. 6, no. 2, pp. 109-122, 1986.
[12] P.A. Humblet, “A Distributed Algorithm for Minimum Weight Directed Spanning Trees,” Technical Report LIDS-P-1149-A, Lab. for Information and Decision Systems, Massachusetts Inst. of Technology, Cambridge, Mass., Sept. 1981.
[13] S. Khuller, B. Raghavachari, and N. Young, “Balancing Minimum Spaning and Shortest Path Trees,” Algorithmica, vol. 120, no. 4, pp. 305-321, 1994.
[14] Y. Li, M.X. Cheng, and D.-Z. Du, “Optimal Topology Control for Balanced Energy Consumption in Ad Hoc Wireless Networks,” J. Parallel and Distributed Computing (JPDC), vol. 65, no. 2, pp. 124-131, Feb. 2005.
[15] E.L. Lloyd, R. Liu, M.V. Marathe, R. Ramanathan, and S.S. Ravi, “Algorithmic Aspects of Topology Control Problems for Ad Hoc Networks,” Proc. Ann. Workshop Mobile and Ad Hoc Networking and Computing (MobiHoc), 2002.
[16] T.S. Rappaport, Wireless Communications: Principles and Practice. Prentice Hall, 1996.
[17] M.B. Sharma, S.S. Iyengar, and N.K. Mandyam, “An Optimal Distributed Depth-First-Search Algorithm,” Proc. 17th Ann. ACM Conf. Computer Science: Computing Trends in the 1990's, pp. 287-294, 1989.
[18] Y. Ben-Shimol, A. Dvir, and M. Segal, “SPLAST: A Novel Approach for Multicasting in Mobile Wireless Ad Hoc Networks,” Proc. IEEE Int'l Symp. Personal, Indoor, and Mobile Radio Comm. (PIMRC 2004), 2004.
[19] P.-J. Wan, G. Calinescu, X.-Y. Li, and O. Frieder, “Minimum-Energy Broadcast Routing in Static Ad Hoc Wireless Networks,” Proc. IEEE INFOCOM, pp. 1162-1171, 2001.
[20] J.E. Wieselthier, G.D. Nguyen, and A. Ephremides, “On the Construction of Energy-Efficient Broadcast and Multicast Trees in Wireless Networks,” Proc. IEEE INFOCOM, pp. 585-594, 2000.
[21] J.E. Wieselthier, G.D. Nguyen, and A. Ephremides, “Algorithms for Energy-Efficient Multicasting in Static Ad Hoc Wireless Networks,” Mobile Networks and Applications (MONET), vol. 6, no. 3, pp. 251-263, 2001.
[22] Q. Zhu, M. Parsa, and J.J. Garcia-Luna-Aceves, “A Source-Based Algorithm for Delay-Constrained Minimum-Cost Multicasting,” Proc. IEEE INFOCOM, Apr. 1995.
[23] A. Zygmund, Trigonometric Series, third ed., pp. 21-22. Cambridge Univ. Press, 2002.

Index Terms:
Wireless networks, routing protocols, network management, distributed applications, algorithm design and analysis.
Citation:
Yingshu Li, My T. Thai, Feng Wang, Ding-Zhu Du, "On the Construction of a Strongly Connected Broadcast Arborescence with Bounded Transmission Delay," IEEE Transactions on Mobile Computing, vol. 5, no. 10, pp. 1460-1470, Oct. 2006, doi:10.1109/TMC.2006.154
Usage of this product signifies your acceptance of the Terms of Use.