The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.12 - Dec. (2012 vol.11)
pp: 2008-2019
Di Yuan , Linkoping University, Norrkoping
Dag Haugland , University of Bergen, Bergen
ABSTRACT
We consider the problem of constructing a shared broadcast tree (SBT) in wireless networks, such that the total power required for supporting broadcast initiated by all source nodes is minimal. In the well-studied minimum-energy broadcast (MEB) problem, the optimal tree varies by source. In contrast, SBT is source-independent, thus substantially reducing the overhead for information storage and processing. The SBT problem also differs from the range assignment problem (RAP), because the power for message forwarding in SBT, although being source-independent, depends on from which tree neighbor the message is received. We approach SBT from a computational optimization standpoint, and present a dual decomposition method applied to an optimization model that embeds multiple directed trees into a shared tree. For the dual decomposition method, some of the constraints in the model are preferably formulated implicitly. The dual decomposition scheme is coupled with a fast local search algorithm. We report computational results demonstrating the effectiveness of the proposed approach. In average, the performance gap to global optimality is less than three percent.
INDEX TERMS
Mathematical model, Wireless networks, Computational modeling, Optimization, Mathematical programming, Broadcasting, dual decomposition, Shared broadcast tree, wireless networks, discrete optimization
CITATION
Di Yuan, Dag Haugland, "Dual Decomposition for Computational Optimization of Minimum-Power Shared Broadcast Tree in Wireless Networks", IEEE Transactions on Mobile Computing, vol.11, no. 12, pp. 2008-2019, Dec. 2012, doi:10.1109/TMC.2011.231
REFERENCES
[1] 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.
[2] E. Althaus, G. Călinescu, I. Mandoiu, S. Prasad, N. Tchervenski, and A. Zelikovsky, “Power Efficient Range Assignment in Ad-Hoc Wireless Networks,” Wireless Networks, vol. 12, pp. 287-299, 2006.
[3] I.F. Akyildiz, W. Su, Y. Sankarasubramaniam, and E. Cayirci, “Wireless Sensor Networks: A Survey,” Computer Networks, vol. 38, pp. 393-422, 2002.
[4] K. Bulbul, O. Ercetin, and T. Ünlüyurt, “Hop Constrained Energy-Efficiency Broadcasting: Insights from Massively Dense Ad Hoc Networks,” IEEE Trans. Mobile Computing, vol. 8, no. 2, pp. 188-202, Feb. 2009.
[5] M. Conti and S. Giordano, “Multihop Ad Hoc Networks: The Reality,” IEEE Comm. Magazine, vol. 45, no. 4, pp. 88-95, Apr. 2007.
[6] C.E. Perkins, Ad Hoc Networking. Addison-Wesley Professional, 2001.
[7] A.K. Das, R.J. Marks, E. El-Sharkawi, P. Arabshahi, and A. Gray, “Minimum Power Broadcast Trees for Wireless Networks: Integer Programming Formulations,” Proc. IEEE INFOCOM, pp. 1001-1110, 2003.
[8] M. Čagalj, J.-P. Hubaux, and C. Enz, “Minimum-Energy Broadcast in All-Wireless Networks: NP-Completeness and Distribution Issues,” Proc. ACM MobiCom, pp. 172-182, 2002.
[9] S. Guo and O. Yang, “Minimum-Energy Multicast in Wireless Ad Hoc Networks with Adaptive Antennas: MILP Formulations and Heuristic Algorithms,” IEEE Trans. Mobile Computing, vol. 5, no. 4, pp. 333-346, Apr. 2006.
[10] P.-J. Wan, G. Călinescu, X.-Y. Li, and O. Frieder, “Minimum-Energy Broadcast Routing in Static Ad Hoc Wireless Networks,” Proc. IEEE INFOCOM, pp. 1162-1171, 2001.
[11] 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.
[12] R. Montemanni, L.M. Gambardella, and A.K. Das, “Models and Algorithms for the MPSCP: An Overview,” Handbook on Theoretical and Algorithmic Aspects of Sensor, Ad Hoc Wireless, and Peer-to-Peer Networks, J. Wu, ed., pp. 133-146, Auerbach, 2006.
[13] R. Ramanathan and R. Rosales-Hain, “Topology Control of Multihop Wireless Networks Using Transmit Power Adjustment,” Proc. IEEE INFOCOM, pp. 404-413, 2000.
[14] J.E. Wieselthier, G.D. Nguyen, and A. Ephremides, “Energy-Efficient Broadcast and Multicast Trees in Wireless Networks,” Mobile Networks and Applications, vol. 7, pp. 481-492, 2002.
[15] C. Ambühl, “An Optimal Bound for the MST Algorithm to Compute Energy Efficient Broadcast Trees in Wireless Networks,” Proc. 32nd Int'l Conf. Automata, Languages and Programming, vol. 3580, pp. 1139-1150, 2005.
[16] J. Bauer, D. Haugland, and D. Yuan, “New Results on the Time Complexity and Approximation Ratio of the Broadcast Incremental Power Algorithm,” Information Processing Letters, vol. 109, pp. 615-619, 2010.
[17] M. Flammini, R. Klasing, A. Navarra, and S. Perennes, “Improved Approximation Results for the Minimum Energy Broadcasting Problem,” Algorithmica, vol. 49, pp. 318-336, 2007.
[18] M. Flammini, R. Klasing, A. Navarra, and S. Perennes, “Tightening the Upper Bound for the Minimum Energy Broadcasting,” Wireless Networks, vol. 14, pp. 659-669, 2008.
[19] R. Klasing, A. Navarra, A. Papadopoulos, and S. Pérennes, “Adaptive Broadcast Consumption (ABC), A New Heuristic and New Bounds for the Minimum Energy Broadcast Routing Problem,” Proc. Networking Conf., vol. 2042, pp. 866-877, 2004.
[20] A. Navarra, “Tighter Bounds for the Minimum Energy Broadcasting Problem,” Proc. Third Int'l Symp. Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt), pp. 313-322, 2005.
[21] I. Caragiannis, M. Flammini, C. Kaklamanis, R. Klasing, and A. Navarra, “Energy Consumption Minimization in Ad Hoc Wireless and Multi-Interface Networks,” Graphs and Algorithms in Communication Networks, A. Koster and X. Munoz, eds., pp. 335-355, Springer-Verlag, 2010.
[22] J. Bauer, D. Haugland, and D. Yuan, “A Fast Local Search Method for Minimum Energy Broadcast in Wireless Ad Hoc Networks,” Operations Research Letters, vol. 37, pp. 75-79, 2009.
[23] I. Caragiannis, C. Kaklamanis, and P. Kanellopoulos, “Power Consumption Problems in Ad-Hoc Wireless Networks,” Proc. First Workshop Approximation and Online Algorithms (WAOA), pp. 252-255, 2004.
[24] I. Kang and R. Poovendran, “Iterated Local Optimization for Minimum Energy Broadcast,” Proc. Third Int'l Symp. Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt), pp. 332-341, 2005.
[25] W. Liang, “Constructing Minimum-Energy Broadcast Trees in Wireless Ad Hoc Networks,” Proc. ACM MobiHoc, pp. 112-122, 2002.
[26] G.D. Nguyen, “General Algorithms for Construction of Broadcast and Multicast Trees with Applications to Wireless Networks,” J. Comm. and Networks, vol. 7, pp. 263-277, 2005.
[27] D. Yuan, J. Bauer, and D. Haugland, “Minimum-Energy Broadcast and Multicast in Wireless Networks: An Integer Programming Approach and Improved Heuristic Algorithms,” Ad Hoc Networks, vol. 6, pp. 696-717, 2008.
[28] J. Bauer, D. Haugland, and D. Yuan, “Analysis and Computational Study of Several Integer Programming Formulations for Minimum-Energy Multicasting in Wireless Ad Hoc Networks,” Networks, vol. 52, pp. 57-68, 2008.
[29] M. Min, O.A. Prokopyev, and P.M. Pardalos, “Optimal Solutions to Minimum Total Energy Broadcasting Problem in Wireless Ad Hoc Networks,” J. Combinatorial Optimization, vol. 11, pp. 59-69, 2006.
[30] A. Clementi, P. Penna, and R. Silvestri, “Hardness Results for the Power Range Assignment Problem in Packet Radio Networks,” Proc. Third Int'l Workshop Approximation Algorithms for Combinatorial Optimization Problems: Randomization, Approximation, and Combinatorial Algorithms and Techniques, vol. 1671, pp. 197-208, 1999.
[31] L.M. Kirousis, E. Kranakis, D. Krizanc, and A. Pelc, “Power Consumption in Packet Radio Networks,” Theoretical Computer Science, vol. 1200, pp. 363-374, 1997.
[32] A. Clementi, M.D. Ianni, and R. Silvestri, “The Minimum Broadcast Range Assignment Problem on Linear Multi-Hop Wireless Networks,” Theoretical Computer Science, vol. 299, pp. 751-761, 2003.
[33] G.K. Das, S. Das, and S.C. Nandy, “Range Assignment for Energy Efficient Broadcasting in Linear Radio Networks,” Theoretical Computer Science, vol. 352, pp. 332-341, 2006.
[34] R. Montemanni and L.M. Gambardella, “Exact Algorithms for the Minimum Power Symmetric Connectivity Problem in Wireless Networks,” Computers and Operations Research, vol. 32, pp. 2891-2904, 2005.
[35] D. Bein and S.Q. Zheng, “Energy Efficient All-to-All Broadcast in All-Wireless Networks,” Information Sciences, vol. 180, pp. 1781-1792, 2010.
[36] G. Calinescu, S. Kapoor, and M. Sarwat, “Bounded-Hops Power Assignment in Ad Hoc Wireless Networks,” Discrete Applied Math., vol. 154, pp. 1358-1371, 2006.
[37] A. Clementi, P. Penna, and R. Silvestri, “On the Power Assignment Problem in Radio Networks,” Mobile Networks and Applications, vol. 9, pp. 125-140, 2004.
[38] G.K. Das, S. Ghosh, and S.C. Nandy, “An Efficient Heuristic Algorithm for 2D H-Hops Range Assignment Problem,” Proc. IEEE GlobeCom, pp. 1051-1055, 2004.
[39] C. Burt, Y.-B. Chan, and N. Sonenberg, “Exact Models for the K-Connected Minimum Energy Problem,” Social Informatics and Telecomm. Eng., vol. 28, pp. 392-406, 2010.
[40] L.A. Wolsey, Integer Programming. John Wiley & Sons, 1998.
[41] R.K. Ahuja, T.L. Magnanti, and J.B. Orlin, Network Flows, Theory, Algorithms, and Applications. Princeton Hall, 1993.
[42] ILOG CPLEX 10.1 User's Manual, 2006.
[43] D. Haugland and D. Yuan, “Compact Integer Programming Models for Optimal Tress in Wireless Networks,” Wireless Network Design: Optimization Models and Solution Procedure, J. Kennington, E. Olinick, and D. Rajan, eds., pp. 219-246, Springer, 2011.
24 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool