메뉴 건너뛰기




Volumn 11, Issue 12, 2012, Pages 2008-2019

Dual decomposition for computational optimization of minimum-power shared broadcast tree in wireless networks

Author keywords

discrete optimization; dual decomposition; Shared broadcast tree; wireless networks

Indexed keywords

BROADCAST TREE; COMPUTATIONAL OPTIMIZATION; COMPUTATIONAL RESULTS; DIRECTED TREES; DISCRETE OPTIMIZATION; DUAL DECOMPOSITION; FAST LOCAL SEARCHES; GLOBAL OPTIMALITY; MESSAGE FORWARDING; OPTIMIZATION MODELS; PERFORMANCE GAPS; RANGE ASSIGNMENT; SHARED TREE; SOURCE NODES; TOTAL POWER;

EID: 84867859090     PISSN: 15361233     EISSN: None     Source Type: Journal    
DOI: 10.1109/TMC.2011.231     Document Type: Article
Times cited : (7)

References (43)
  • 1
    • 0033894011 scopus 로고    scopus 로고
    • On the construction of energy-efficient broadcast and multicast trees in wireless networks
    • 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.
    • (2000) Proc. IEEE INFOCOM , pp. 585-594
    • Wieselthier, J.E.1    Nguyen, G.D.2    Ephremides, A.3
  • 4
    • 79960586594 scopus 로고    scopus 로고
    • Hop constrained energy-efficiency broadcasting: Insights from massively dense ad hoc networks
    • Feb.
    • 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.
    • (2009) IEEE Trans. Mobile Computing , vol.8 , Issue.2 , pp. 188-202
    • Bulbul, K.1    Ercetin, O.2    Nlüyurt, T.Ü.3
  • 5
    • 34247636066 scopus 로고    scopus 로고
    • Multihop ad hoc networks: The reality
    • Apr.
    • M. Conti and S. Giordano, "Multihop Ad Hoc Networks: The Reality," IEEE Comm. Magazine, vol. 45, no. 4, pp. 88-95, Apr. 2007.
    • (2007) IEEE Comm. Magazine , vol.45 , Issue.4 , pp. 88-95
    • Conti, M.1    Giordano, S.2
  • 7
    • 0042941430 scopus 로고    scopus 로고
    • Minimum power broadcast trees for wireless networks: Integer programming formulations
    • 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.
    • (2003) Proc. IEEE INFOCOM , pp. 1001-1110
    • Das, A.K.1    Marks, R.J.2    El-Sharkawi, E.3    Arabshahi, P.4    Gray, A.5
  • 8
    • 0036948878 scopus 로고    scopus 로고
    • Minimum-energy broadcast in all-wireless networks: NP-completeness and distribution issues
    • M. Cagalj, 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.
    • (2002) Proc. ACM MobiCom , pp. 172-182
    • Cagalj, M.1    Hubaux, J.-P.2    Enz, C.3
  • 9
    • 33644660483 scopus 로고    scopus 로고
    • Minimum-energy multicast in wireless ad hoc networks with adaptive antennas: MILP formulations and heuristic algorithms
    • Apr.
    • 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.
    • (2006) IEEE Trans. Mobile Computing , vol.5 , Issue.4 , pp. 333-346
    • Guo, S.1    Yang, O.2
  • 10
    • 0035013180 scopus 로고    scopus 로고
    • Minimum-energy broadcast routing in static ad hoc wireless networks
    • 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.
    • (2001) Proc. IEEE INFOCOM , pp. 1162-1171
    • Wan, P.-J.1    Calinescu, G.2    Li, X.-Y.3    Frieder, O.4
  • 11
    • 33646542365 scopus 로고    scopus 로고
    • Minimum-energy broadcasting in multi-hop wireless networks using a single broadcast tree
    • 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.
    • (2006) Mobile Networks and Applications , vol.11 , pp. 361-375
    • Papadimitriou, I.1    Georgiadis, L.2
  • 13
    • 0033893765 scopus 로고    scopus 로고
    • Topology control of multihop wireless networks using transmit power adjustment
    • R. Ramanathan and R. Rosales-Hain, "Topology Control of Multihop Wireless Networks Using Transmit Power Adjustment," Proc. IEEE INFOCOM, pp. 404-413, 2000.
    • (2000) Proc. IEEE INFOCOM , pp. 404-413
    • Ramanathan, R.1    Rosales-Hain, R.2
  • 15
    • 26444440419 scopus 로고    scopus 로고
    • An optimal bound for the mst algorithm to compute energy efficient broadcast trees in wireless networks
    • 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.
    • (2005) Proc. 32nd Int'l Conf. Automata, Languages and Programming , vol.3580 , pp. 1139-1150
    • Ambü Hl, C.1
  • 16
    • 60749135711 scopus 로고    scopus 로고
    • New results on the time complexity and approximation ratio of the broadcast incremental power algorithm
    • 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.
    • (2010) Information Processing Letters , vol.109 , pp. 615-619
    • Bauer, J.1    Haugland, D.2    Yuan, D.3
  • 17
    • 36949012032 scopus 로고    scopus 로고
    • Improved approximation results for the minimum energy broadcasting problem
    • 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.
    • (2007) Algorithmica , vol.49 , pp. 318-336
    • Flammini, M.1    Klasing, R.2    Navarra, A.3    Perennes, S.4
  • 18
    • 46749120189 scopus 로고    scopus 로고
    • Tightening the upper bound for the minimum energy broadcasting
    • 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.
    • (2008) Wireless Networks , vol.14 , pp. 659-669
    • Flammini, M.1    Klasing, R.2    Navarra, A.3    Perennes, S.4
  • 19
    • 35048829269 scopus 로고    scopus 로고
    • Adaptive broadcast consumption (abc), a new heuristic and new bounds for the minimum energy broadcast routing problem
    • 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.
    • (2004) Proc. Networking Conf. , vol.2042 , pp. 866-877
    • Klasing, R.1    Navarra, A.2    Papadopoulos, A.3    Pérennes, S.4
  • 22
    • 60749112602 scopus 로고    scopus 로고
    • A fast local search method for minimum energy broadcast in wireless ad hoc networks
    • 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.
    • (2009) Operations Research Letters , vol.37 , pp. 75-79
    • Bauer, J.1    Haugland, D.2    Yuan, D.3
  • 25
    • 0242443803 scopus 로고    scopus 로고
    • Constructing minimum-energy broadcast trees in wireless ad hoc networks
    • W. Liang, "Constructing Minimum-Energy Broadcast Trees in Wireless Ad Hoc Networks," Proc. ACM MobiHoc, pp. 112-122, 2002.
    • (2002) Proc. ACM MobiHoc , pp. 112-122
    • Liang, W.1
  • 26
    • 26844449890 scopus 로고    scopus 로고
    • General algorithms for construction of broadcast and multicast trees with applications to wireless networks
    • 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.
    • (2005) J. Comm. and Networks , vol.7 , pp. 263-277
    • Nguyen, G.D.1
  • 27
    • 41549120514 scopus 로고    scopus 로고
    • Minimum-energy broadcast and multicast in wireless networks: An integer programming approach and improved heuristic algorithms
    • 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.
    • (2008) Ad Hoc Networks , vol.6 , pp. 696-717
    • Yuan, D.1    Bauer, J.2    Haugland, D.3
  • 28
    • 51349152828 scopus 로고    scopus 로고
    • Analysis and computational study of several integer programming formulations for minimum-energy multicasting in wireless ad hoc networks
    • 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.
    • (2008) Networks , vol.52 , pp. 57-68
    • Bauer, J.1    Haugland, D.2    Yuan, D.3
  • 29
    • 32944470495 scopus 로고    scopus 로고
    • Optimal solutions to minimum total energy broadcasting problem in wireless ad hoc networks
    • 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.
    • (2006) J. Combinatorial Optimization , vol.11 , pp. 59-69
    • Min, M.1    Prokopyev, O.A.2    Pardalos, P.M.3
  • 32
    • 0037453346 scopus 로고    scopus 로고
    • The minimum broadcast range assignment problem on linear multi-hop wireless networks
    • 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.
    • (2003) Theoretical Computer Science , vol.299 , pp. 751-761
    • Clementi, A.1    Ianni, M.D.2    Silvestri, R.3
  • 33
    • 32644439763 scopus 로고    scopus 로고
    • Range assignment for energy efficient broadcasting in linear radio networks
    • 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.
    • (2006) Theoretical Computer Science , vol.352 , pp. 332-341
    • Das, G.K.1    Das, S.2    Nandy, S.C.3
  • 34
    • 13844299446 scopus 로고    scopus 로고
    • Exact algorithms for the minimum power symmetric connectivity problem in wireless networks
    • 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.
    • (2005) Computers and Operations Research , vol.32 , pp. 2891-2904
    • Montemanni, R.1    Gambardella, L.M.2
  • 35
    • 77549088744 scopus 로고    scopus 로고
    • Energy efficient all-to-all broadcast in all-wireless networks
    • D. Bein and S.Q. Zheng, "Energy Efficient All-to-All Broadcast in All-Wireless Networks," Information Sciences, vol. 180, pp. 1781-1792, 2010.
    • Information Sciences , vol.180 , Issue.2010 , pp. 1781-1792
    • Bein, D.1    Zheng, S.Q.2
  • 36
    • 33646021569 scopus 로고    scopus 로고
    • Bounded-hops power assignment in ad hoc wireless networks
    • 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.
    • (2006) Discrete Applied Math. , vol.154 , pp. 1358-1371
    • Calinescu, G.1    Kapoor, S.2    Sarwat, M.3
  • 38
    • 18144412331 scopus 로고    scopus 로고
    • An efficient heuristic algorithm for 2d h-hops range assignment problem
    • 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.
    • (2004) Proc. IEEE GlobeCom , pp. 1051-1055
    • Das, G.K.1    Ghosh, S.2    Nandy, S.C.3
  • 43
    • 84975687636 scopus 로고    scopus 로고
    • Compact integer programming models for optimal tress in wireless networks
    • J. Kennington, E. Olinick, and D. Rajan, eds. Springer
    • 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.
    • (2011) Wireless Network Design: Optimization Models and Solution Procedure , pp. 219-246
    • Haugland, D.1    Yuan, D.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.