The Community for Technology Leaders
RSS Icon
Issue No.02 - February (2009 vol.8)
pp: 188-202
Kerem Bulbul , Sabanci University, Istanbul
Ozgur Ercetin , Sabanci University, Istanbul
Tonguç Ünlüyurt , Sabanci University, Istanbul
We consider source-initiated broadcast session traffic in an ad hoc wireless network operating under a hard constraint on the end-to-end delay between the source and any node in the network. We measure the delay to a given node in the number of hops data travels from the source to that node, and our objective in this paper is to construct an energy-efficient broadcast tree that has a maximum depth Δ, where Δ; represents the end-to-end hop constraint in the network. We characterize the optimal solution to a closely related problem in massively dense networks using a dynamic programming formulation. We prove that the optimal solution can be obtained by an algorithm of polynomial time complexity O(Δ²). The solution to the dynamic program indicates that there is a single optimal policy applicable to all massively dense networks. Elaborating on the insights provided by the structure of the problem in massively dense networks, we design an algorithm for finding a solution to the hop constrained minimum power broadcasting problem in general networks. By extensive simulations, we demonstrate that our proposed optimization-based algorithm generates broadcast trees within 20% of optimality for general dense networks.
energy efficiency, multicast, optimization
Kerem Bulbul, Ozgur Ercetin, Tonguç Ünlüyurt, "Hop Constrained Energy-Efficient Broadcasting: Insights from Massively Dense Ad Hoc Networks", IEEE Transactions on Mobile Computing, vol.8, no. 2, pp. 188-202, February 2009, doi:10.1109/TMC.2008.105
[1] K. Bulbul, O. Ercetin, and T. Ünlüyurt, “Delay Constrained Minimum Power Broadcasting in Wireless Networks,” Proc. Fifth Int'l Symp. Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt), 2007.
[2] 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 '00, pp. 585-594, 2000.
[3] R. Gandhi, A. Mishra, and S. Parthasarathy, “Minimizing Broadcast Latency and Redundancy in Ad Hoc Networks,” IEEE/ACM Trans. Networking, in press, 2008.
[4] A.E. Gamal and J. Mammen, “Optimal Hopping in Ad Hoc Wireless Networks,” Proc. IEEE INFOCOM '06, pp. 1-10, 2006.
[5] C. Ho, K. Obraczka, G. Tsudik, and K. Viswanath, “Flooding for Reliable Multicast in Multi-Hop Ad Hoc Networks,” Proc. Third Int'l Workshop Discrete Algorithms and Methods for Mobile Computing and Comm. (DialM '99), pp. 64-71, 1999.
[6] S.-Y. Ni, Y.-C. Tseng, Y.-S. Chen, and J.-P. Sheu, “The Broadcast Storm Problem in a Mobile Ad Hoc Network,” Proc. Fifth ACM/IEEE MobiCom '99, pp. 151-162, 1999.
[7] W. Lou and J. Wu, “On Reducing Broadcast Redundancy in Ad Hoc Wireless Networks,” IEEE Trans. Mobile Computing, vol. 1, no. 2, pp. 111-122, 2002.
[8] J. Wu and F. Dai, “A Generic Distributed Broadcast Scheme in AdHoc Wireless Networks,” IEEE Trans. Computers, vol. 53, no. 10, pp. 1343-1354, 2004.
[9] M. Cagalj, J.-P. Hubaux, and C. Enz, “Energy-Efficient Broadcasting in All-Wireless Networks,” Wireless Networks, vol. 11, pp.177-188, 2005.
[10] A. Ahluwalia and E.H. Modiano, “On the Complexity and Distributed Construction of Energy-Efficient Broadcast Trees in Wireless Ad Hoc Networks,” IEEE Trans. Wireless Comm., vol. 4, no. 5, pp. 2136-2147, 2005.
[11] 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 '03, pp. 1001-1010, 2003.
[12] T. Cormen, C. Leiserson, and R. Rivest, Introduction to Algorithms. MIT Press, 1991.
[13] Z.Y. Wang, B.X. Shi, and E. Zhao, “Bandwidth-Delay-Constrained Least-Cost Multicast Routing Based on Heuristic Genetic Algorithm,” Computer Comm., vol. 24, no. 7-8, pp. 685-692, 2001.
[14] I. Papadimitriou and L. Georgiadis, “Energy-Aware Broadcast Trees in Wireless Networks,” Mobile Networks and Applications, vol. 9, no. 6, pp. 567-581, 2004.
[15] R. Montemanni and L.M. Gambardella, “Exact Algorithms for the Minimum Power Symmetric Connectivity Problem in Wireless Networks,” Computers and Operations Research, vol. 32, no. 11, pp. 2891-2904, 2005.
[16] I. Stojmenovic, M. Seddigh, and J. Zunic, “Internal Nodes Based Broadcasting in Wireless Networks,” Proc. 34th Hawaii Int'l Conf. System Sciences (HICSS), 2001.
[17] R.J. Marks, A.K. Das, M. El-Sharkawi, P. Arabshahi, and A. Gray, “Minimum Power Broadcast Trees for Wireless Networks: Optimizing Using the Viability Lemma,” Proc. IEEE Int'l Symp. Circuits and Systems (ISCAS '02), vol. 1, pp. 273-276, 2002.
[18] J. Cartigny, D. Simplot-Ryl, and I. Stojmenovic, “An Adaptive Localized Scheme for Energy-Efficient Broadcasting in Ad Hoc Networks with Directional Antennas,” LNCS, vol. 3260, pp.399-413, 2004.
[19] A.K. Das, R.J. Marks, M. El-Sharkawi, P. Arabshahi, and A. Gray, “The Minimum Power Broadcast Problem in Wireless Networks: An Ant Colony System Approach,” Proc. IEEE CAS Workshop Wireless Comm. and Networking, 2002.
[20] B. Wang and S.K.S. Gupta, “S-REMIT: A Distributed Algorithm for Source-Based Energy Efficient Multicasting in Wireless AdHoc Networks,” Proc. IEEE Global Telecomm. Conf. (GLOBECOM '03), pp. 3519-3524, 2003.
[21] F. Li and I. Nikolaidis, “On Minimum-Energy Broadcasting in All-Wireless Networks,” Proc. 26th Ann. IEEE Conf. Local Computer Networks (LCN '01), pp. 193-202, 2001.
[22] I. Papadimitriou and L. Georgiadis, “Minimum-Energy Broadcasting in Multi-Hop Wireless Networks Using a Single Broadcast Tree,” Mobile Networks and Applications, vol. 11, pp. 361-375, 2006.
[23] S. Guo and O.W. Yang, “Energy-Aware Multicasting in Wireless Ad Hoc Networks: A Survey and Discussion,” Computer Comm., vol. 30, pp. 2129-2148, 2007.
[24] N. Li and J.C. Hou, “A Scalable, Power-Efficient Broadcast Algorithm for Wireless Networks,” Wireless Networks, vol. 12, pp. 495-509, 2006.
[25] Y. Li, M. Thai, F. Wang, and D.-Z. Du, “On the Construction of a Strongly Connected Broadcast Arborescence with Bounded Transmission Delay,” IEEE Trans. Mobile Computing, vol. 5, no. 10, pp. 1460-1470, Oct. 2006.
[26] W.L. Yang, “Constructing Energy-Efficient Multicast Trees with Delay Constraints in Wireless Ad Hoc Networks,” Proc. 19th IEEE Int'l Conf. Advanced Information Networking and Applications (AINA), 2005.
[27] 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, May 2007.
[28] 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, May 2007.
[29] P. Jacquet, “Geometry of Information Propagation in Massively Dense Ad Hoc Networks,” Proc. ACM MobiHoc '03, pp. 157-162, 2003.
[30] R. Catanuto, S. Toumpis, and G. Morabito, “Opti{c, m}al: Optical/Optimal Routing in Massively Dense Wireless Networks,” Proc. IEEE INFOCOM '07, pp. 1010-1018, 2007.
[31] R. Bellman, Dynamic Programming. Princeton Univ. Press, 1957.
18 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool