Article

Constructing minimum-energy broadcast trees in wireless ad hoc networks

Author:

Weifa LiangAuthors Info & Claims

MobiHoc '02: Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing

Pages 112 - 122

https://doi.org/10.1145/513800.513815

Published: 09 June 2002 Publication History

Abstract

In this paper we assume that a multihop wireless network (also called a wireless ad hoc network) consists of nodes whose transmitting powers are finitely adjustable. We consider two fundamental problems related to power consumption in this kind of network. One is the minimum-energy broadcast tree problem, which broadcasts a message from a source node to all the other nodes in the network such that the summation of transmission powers at all nodes is minimized; and another is the minimum-energy multicast tree problem, which multicasts a message from a source node to the nodes in a given subset of nodes such that the summation of the transmission powers at all involved nodes is minimized.We first show the minimum-energy broadcast tree problem is NP-complete. We then present an approximate algorithm for the problem in a general setting, which delivers an approximate solution with a bounded performance guarantee. The algorithm takes O((k+1)^1/ϵn^3/ϵ time, where n is the number of nodes in the wireless network, k is the number of power levels at each node, and ϵ is constant with 0<ϵ≤ 1. For a special case of the problem where every node is equipped with the same type of battery, we propose an approximate algorithm which has a better performance ratio than that in the general case setting, and the algorithm takes O(kn² log n) time. We finally extend the technique for the minimum-energy broadcast tree problem to solve the minimum-energy multicast tree problem, which leads to a similar result. The technique adopted in this paper is to reduce the minimum-energy broadcast (multicast) tree problem on a wireless ad hoc network to an optimization problem on an auxiliary weighted graph, and solve the optimization problem on the auxiliary graph which in turn gives an approximate solution for the original problem.

References

[1]

D. J. Baker and A. Ephremides. The architectural organization of a mobile radio network via distributed algorithm. IEEE Trans. Commun, Vol. COM-29, pp. 56--73, 1981.]]

[2]

J-H Chang and L. Tassiulas. Fast approximate algorithms for maximum lifetime routing in wireless ad-hoc networks. IFIP-TC6/European Commission Int'l Conf., Lecture Notes in Computer Science, Vol. 1815, pp.702--713, Springer, 2000.]]

Digital Library

[3]

I. Chlamtac and A. Farago. A new approach to the design and analysis of peer-to-peer mobile networks. Wireless Networks, Vol. 5, pp. 149--156, 1999.]]

Digital Library

[4]

V. Chvátal. A greedy heuristic for the set-covering problem. Mathematics of Operations Research, Vol. 4(3), pp. 233--235, 1979.]]

Digital Library

[5]

M. Charikar, C. Chekuri, T-Y Cheung, Z. Dai, A. Goel, S. Guha and M. Li. Approximation algorithms for directed Steiner problems. J. Algorithms, Vol. 33(1): pp. 73--91, 1999.]]

Digital Library

[6]

C.-C Chiang, M. Gerla, and L Zhang. Forwarding group multicast protocol(FGMP) for multihop, mobile wireless networks. Cluster Computing, Vol. 1, pp. 187--196, 1998.]]

Digital Library

[7]

A. Ephremides, J. E. Wieselthier, and D. J. Baker. A design concept for reliable mobile radio networks with frequency hopping signaling. Proceedings of the IEEE, Vol. 75, pp. 56--58, 1987.]]

[8]

A. Farago, I. Chlamtac, and S. Bassagni. Virtual path network topology optimization using random graphs. Proc. of INFOCOM'99, pp. 491--496, 1999.]]

[9]

J.J. Garcia-Luna-Aceves and E. L. Madruga. A Multicast routing protocol for ad-hoc networks. Proc. of INFOCOM'99, New York, 1999.]]

[10]

S. Khanna and K. Kumaran. On wireless spectrum estimation and generalized graph coloring. Proc. of INFOCOM'98, pp. 1273--1283, 1998.]]

[11]

S.-J. Lee. Routing and Multicast Strategies in Wireless Mobile Networks. Dept. of Computer Sci., UCLA, Los Angeles, 2000.]]

Digital Library

[12]

M. Nagy and S. Singh. Multicast scheduling algorithms in mobile networks. Cluster Computing, Vol. 1, pp. 177--185, 1998.]]

Digital Library

[13]

K. Makki, N. Pissinou, and O. Frieder. Efficient solutions to multicast routing in communication networks. Mobile Networks and Applications, Vol. 1, pp. 221--232, 1996.]]

Digital Library

[14]

C. Perkins and E. M. Royer. Ad Hoc on Demand Distance Vector (AODV) routing. Internet Draft, http://www.ietf.org/internet-drafts/draft--ietf--manet--aodv--01.txt, Aug., 1998.]]

[15]

R. Ramanathan and R. Rosales-Hain. Topology control of multihop wireless networks using transmit power adjustment. Proc. of INFOCOM'00, 2000.]]

[16]

T. S. Rappaport. Wireless Communications, Principles and Practice. Prentice-Hall, 1996.]]

Digital Library

[17]

V. Rodoplu and T. H. Meng. Minimum energy mobile wireless networks. Proc. of ICC'98, Vol. 3, pp. 1633--1639, 1998.]]

[18]

S. Singh, M. Woo, and C.S. Raghavendra. Power-aware routing in mobile ad hoc networks. Proc. of MOBICOM'98, pp. 181--190, 1998.]]

Digital Library

[19]

J.E. Wieselthier, G. D Nguyen and A. Ephremides. On construction of energy-efficient broadcast and multicast trees in wireless networks. Proc. of INFOCOM'00, 2000.]]

Cited By

Sun DLi HKong ZZhu ZChen YLu ZWen X(2024)Multicast SFC Embedding in Software-Defined SAGIN with Heterogeneous Network Resources2024 IEEE Wireless Communications and Networking Conference (WCNC)10.1109/WCNC57260.2024.10571313(1-6)Online publication date: 21-Apr-2024
https://doi.org/10.1109/WCNC57260.2024.10571313
Xia JWu YWang KChen QCheng L(2023)Optimal Non-Order NFV Enabled Multicasting in Mobile Edge Clouds2023 IEEE 98th Vehicular Technology Conference (VTC2023-Fall)10.1109/VTC2023-Fall60731.2023.10333398(1-5)Online publication date: 10-Oct-2023
https://doi.org/10.1109/VTC2023-Fall60731.2023.10333398
Rajeswari MThirugnanasambandam KRaghav RPrabu USaravanan DAnguraj D(2021)Flower Pollination Algorithm with Powell’s Method for the Minimum Energy Broadcast Problem in Wireless Sensor NetworkWireless Personal Communications10.1007/s11277-021-08253-1Online publication date: 25-Feb-2021
https://doi.org/10.1007/s11277-021-08253-1
Show More Cited By

Index Terms

Constructing minimum-energy broadcast trees in wireless ad hoc networks
1. Networks
  1. Network architectures
  2. Network protocols
2. Theory of computation
  1. Design and analysis of algorithms

Recommendations

Approximate Minimum-Energy Multicasting in Wireless Ad Hoc Networks

A wireless ad hoc network consists of mobile nodes that are equipped with energy-limited batteries. As mobile nodes are battery-operated, an important issue in such a network is to minimize the total power consumption for each operation. Multicast is ...
Maximizing Battery Life Routing in Wireless Ad Hoc Networks
HICSS '04: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 9 - Volume 9

Most wireless ad hoc networks consist of mobile devices which operate on batteries. Power consumption in this type of network therefore is paramount important. To maximize the lifetime of an ad hoc network, it is essential to prolong each individual ...
A distributed broadcast algorithm for wireless mobile ad hoc networks
MMM'07: Proceedings of the 13th International conference on Multimedia Modeling - Volume Part II

In Wireless mobile ad hoc networks, many unicast and multicast protocols depend on broadcast mechanism to finish control and route establishment functionality. In a straightforward broadcast by flooding, each node will retransmit a message to all it ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

MobiHoc '02: Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing

June 2002

246 pages

ISBN:1581135017

DOI:10.1145/513800

General Chair:
Jean-Pierre Hubaux
EPFL (CH)
,
Program Chairs:
J. J. Garcia-Luna-Aceves
University of California at Santa Cruz (USA)
,
David B. Johnson
Rice University (USA)

Copyright © 2002 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

SIGMOBILE: ACM Special Interest Group on Mobility of Systems, Users, Data and Computing

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 09 June 2002

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Conference

MobiHoc02

Sponsor:

SIGMOBILE

MobiHoc02: ACM Symposium on Mobile Ad Hoc Networking and Networking

June 9 - 11, 2002

Lausanne, Switzerland

Acceptance Rates

MobiHoc '02 Paper Acceptance Rate 22 of 134 submissions, 16%;

Overall Acceptance Rate 296 of 1,843 submissions, 16%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

214
Total Citations
View Citations
1,939
Total Downloads

Downloads (Last 12 months)7
Downloads (Last 6 weeks)0

Reflects downloads up to 09 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

Sun DLi HKong ZZhu ZChen YLu ZWen X(2024)Multicast SFC Embedding in Software-Defined SAGIN with Heterogeneous Network Resources2024 IEEE Wireless Communications and Networking Conference (WCNC)10.1109/WCNC57260.2024.10571313(1-6)Online publication date: 21-Apr-2024
https://doi.org/10.1109/WCNC57260.2024.10571313
Xia JWu YWang KChen QCheng L(2023)Optimal Non-Order NFV Enabled Multicasting in Mobile Edge Clouds2023 IEEE 98th Vehicular Technology Conference (VTC2023-Fall)10.1109/VTC2023-Fall60731.2023.10333398(1-5)Online publication date: 10-Oct-2023
https://doi.org/10.1109/VTC2023-Fall60731.2023.10333398
Rajeswari MThirugnanasambandam KRaghav RPrabu USaravanan DAnguraj D(2021)Flower Pollination Algorithm with Powell’s Method for the Minimum Energy Broadcast Problem in Wireless Sensor NetworkWireless Personal Communications10.1007/s11277-021-08253-1Online publication date: 25-Feb-2021
https://doi.org/10.1007/s11277-021-08253-1
Mousavi MAl-Shatri HKlein A(2020)Cost Sharing Games for Energy-Efficient Multi-Hop Broadcast in Wireless NetworksIEEE Transactions on Wireless Communications10.1109/TWC.2019.294437419:1(310-324)Online publication date: Jan-2020
https://doi.org/10.1109/TWC.2019.2944374
Krishnaraj NKumar RRajeshwar DSanjay Kumar T(2020)Implementation of Energy Aware Modified Distance Vector Routing Protocol for Energy Efficiency in Wireless Sensor Networks2020 International Conference on Inventive Computation Technologies (ICICT)10.1109/ICICT48043.2020.9112532(201-204)Online publication date: Feb-2020
https://doi.org/10.1109/ICICT48043.2020.9112532
Chen CHsieh S(2020)An Efficient Approximation Algorithm for the Steiner Tree ProblemComplexity and Approximation10.1007/978-3-030-41672-0_15(238-251)Online publication date: 21-Feb-2020
https://doi.org/10.1007/978-3-030-41672-0_15
Chen C(2019)An Efficient Approximation Algorithm for the Steiner Tree ProblemProceedings of the 2nd International Conference on Information Science and Systems10.1145/3322645.3322649(179-184)Online publication date: 16-Mar-2019
https://dl.acm.org/doi/10.1145/3322645.3322649
Qiu CShen HYu L(2019)Towards Green Wireless Networking: Fading-Resistant Time Constraint Broadcasts Using Cooperative CommunicationIEEE Transactions on Network Science and Engineering10.1109/TNSE.2018.28297806:3(548-561)Online publication date: 1-Jul-2019
https://doi.org/10.1109/TNSE.2018.2829780
Xu ZLiang WHuang MJia MGuo SGalis A(2019)Efficient NFV-Enabled Multicasting in SDNsIEEE Transactions on Communications10.1109/TCOMM.2018.288143867:3(2052-2070)Online publication date: Mar-2019
https://doi.org/10.1109/TCOMM.2018.2881438
Ezhil Selvan TMalathi PEzhilin Freeda S(2019)An Efficient Method for Adjustable Load Equalization for Reducing Traffic in Routing for Mobile Ad Hoc NetworksWireless Personal Communications10.1007/s11277-019-06834-9Online publication date: 15-Oct-2019
https://doi.org/10.1007/s11277-019-06834-9
Show More Cited By

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Table of Conten