Paolo Penna
ABSTRACT
We investigate the problem of constructing a multicast tree in ad-hoc networks. In particular, we address the issue of the power consumption, that is, the overall energy that the stations must spend to implement such a tree. We focus on two extreme cases of multicast: broadcast (one-to-all) and unicast (one-to-one). Minimum Spanning Trees (MSTs) and Shortest-Path Trees (SPTs) yield optimal solutions for broadcast and unicast, respectively. Unfortunately, they do not guarantee any optimality for the "counterpart", that is, MSTs are non-optimal for unicast, while SPTs are non-optimal for broadcast.In this work, we experimentally evaluate the performances of an algorithm combining MST solutions with SPT ones. Our approach is based on the construction of Light Approximate Shortest-path Trees (LASTs) of a given directed weighted graph, introduced by Khuller et al [1995]. LASTs approximate simultaneously the cost of the MST and the distances of the SPT rooted at a source node, thus yielding, also in the worst case, optimal solutions for both unicast and broadcast.Rather surprisingly, this "compromise" between MSTs and SPTs, has a very good performance w.r.t the broadcast tree obtained from a MST. Indeed, for randomly-generated instances, the broadcast tree obtained with LASTs is in some cases better (and never much worse) than the broadcast tree obtained from MSTs. This important fact shows that LASTs are not only interesting in theory, but they have practical relevant applications. Indeed, their use in our experiments also provides new insights on the approximation ratio of the MST broadcast algorithm for randomly-generated instances.
- C. Ambuehl, A. Clementi, M. Di Ianni, N. Lev-Tov, A. Monti, D. Peleg, G. Rossi, and R. Silvestri. Efficient algorithms for low-energy bounded-hop broadcast in ad-hoc wireless networks. In Proc. of Annual Symposium on Theoretical Aspects of Computer Science (STACS), LNCS 2996, pages 418--427, 2004.]]Google Scholar
Cross Ref
- C. Ambuehl, A. Clementi, P. Penna, G. Rossi, and R. Silvestri. Energy Consumption in Radio Networks: Selfish Agents and Rewarding Mechanisms. In Proceedings of the 10th International Colloquium on Structural Information and Communication Complexity (SIROCCO), pages 1--16, 2003.]]Google Scholar
- L. Anderegg and S. Eidenbenz. Ad hoc-VCG: A Truthful and Cost-Efficient Routing Protocol for Mobile Ad Hoc Networks with Selfish Agents. In Proc. of the Annual ACM International Conference on Mobile Computing and Networking (MOBICOM), 2003.]] Google ScholarDigital Library
- A. Clementi, P. Crescenzi, P. Penna, G. Rossi, and P. Vocca. A Worst-case Analysis of a MST-based Heuristic to Construct Energy-efficient Broadcast Subtrees in Wireless Networks. TR 010, Univ. of Rome "Tor Vergata", http://www.mat.uniroma2.it/~penna/papers/stacs01-TR.ps.gz, 2001.]]Google Scholar
- A. Clementi, P. Crescenzi, P. Penna, G. Rossi, and P. Vocca. On the complexity of computing minimum energy consumption broadcast subgraphs. Proc. of the Annual Symposium on Theoretical Aspects of Computer Science (STACS), LNCS(2010):121--131, 2001. Full version in {4}.]] Google ScholarDigital Library
- A. Clementi, M. Di Ianni, and R. Silvestri. The minimum broadcast range assignment problem on linear multi-hop wireless networks. Theoretical Computer Science, Theor. Comput. Sci. 1-3(299): 751--761.]]Google Scholar
- A. Clementi, A. Ferreira, P. Penna, S. Perennes, and R. Silvestri. The minimum range assignment problem on linear radio networks. Algorithmica, 35:95--110, 2003.]]Google ScholarCross Ref
- A. Clementi, G. Huiban, P. Penna, G. Rossi, and Y.C. Verhoeven. Some recent theoretical advances and open questions on energy consumption in ad-hoc wireless networks. In Proceedings of the 3rd Workshop on Approximation and Randomization Algorithms in Communication Networks (ARACNE), pages 23--38, 2001.]]Google Scholar
- A. Clementi, G. Huiban, P. Penna, G. Rossi, and Y.C. Verhoeven. On the Approximation Ratio of the MST- based Heuristic for the Energy-Efficient Broadcast Problem in Static Ad-Hoc Radio Networks. In In Proc. of the 1st Workshop on Wireles, Mobile and Ad-Hoc Networks (WMAN), 2003.]] Google ScholarDigital Library
- A. Clementi, P. Penna, and R. Silvestri. The power range assignment problem in radio networks on the plane. In Proc. of the 17th Annual Symposium on Theoretical Aspects of Computer Science (STACS), number 1770 in LNCS, pages 651--660, 2000.]] Google ScholarDigital Library
- A. Clementi, P. Penna, and R. Silvestri. The Power Assignment Problem in Radio Networks. ACM Mobile Networks and Applications, 9(2):125--140, 2004.]] Google ScholarDigital Library
- A. Ephremides, G.D. Nguyen, and J.E. Wieselthier. On the Construction of Energy-Effficient Broadcast and Multicast Trees in Wireless Networks. In Proceedings of the 19th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM), pages 585--594, 2000.]]Google Scholar
- M.R. Garey and D.S. Johnson. Computers and intractability: a guide to the theory of NP-completeness. Freeman, 1979.]] Google ScholarDigital Library
- S. Khuller, B. Raghavachari, and N. Young. Balancing minimum spanning trees and shortest-path trees. Algorithmica, 14(4):305--321, 1995.]]Google ScholarDigital Library
- L.M. Kirousis, E. Kranakis, D. Krizanc, and A. Pelc. Power consumption in packet radio networks. Theoretical Computer Science, 243:289--305, 2000. Extended abstract in Proc. of STACS'97.]] Google ScholarDigital Library
- K. Pahlavan and A. Levesque. Wireless information networks. Wiley-Interscience, 1995.]] Google ScholarDigital Library
- P. Penna and C. Ventre. Energy-efficient broadcasting in ad-hoc networks: combining msts with shortest-path trees. Technical report, Technical Report of the European Project CRESCCO at www.ceid.upatras.gr/crescco, 2003.]]Google Scholar
- P. Penna and C. Ventre. Sharing the cost of multicast transmissions in wireless networks. In Proc. of the International Colloquium on Structural Information and Communication Complexity (SIROCCO), LNCS, 2004.]]Google ScholarCross Ref
- P.-J. Wan, G. Calinescu, X.-Y. Li, and O. Frieder. Minimum-energy broadcasting in static ad hoc wireless networks. Proc. of the Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM), 2001. Journal version in Wireless Networks, 8(6): 607--617, 2002.]] Google ScholarDigital Library
Index Terms
- Energy-efficient broadcasting in ad-hoc networks: combining MSTs with shortest-path trees
Recommendations
Determining a sequence of stable multicast Steiner trees in mobile ad hoc networks
ACM-SE 44: Proceedings of the 44th annual Southeast regional conferenceWe show that given the complete knowledge of future topology changes, it is possible to determine the sequence of stable multicast Steiner trees (called the stable mobile multicast Steiner tree) in a multicast session such that the number of tree ...
The investigation of delay-constrained multicasting with minimum-energy consumption in static ad hoc wireless networks
In this paper, we focus on the problem concerning how to construct a delay-constrained multicast tree with minimum-energy consumption in ad-hoc wireless networks. Based on link-replacing strategies, an algorithm called Energy-based Link Replacement (ELR)...
Building multicast trees in ad-hoc networks
Autonomics '08: Proceedings of the 2nd International Conference on Autonomic Computing and Communication SystemsMulticast trees are used in a variety of applications, such as publish/subscribe systems or content distribution networks. Existing algorithms for ad-hoc networks typically produce multicast trees requiring many nodes to act as relays even though they ...
Comments