Abstract
In this paper we describe a (distributed) localized approximation algorithm for the MECBS (Minimum Energy Consumption Broadcast Subgraph) problem with asymmetric edge costs, called LMCA (Localized algorithm for energy-efficient broadcast based on Local Minimum Cost Arborescences). Given a directed weighted graph G = (V, E) with edge weight function w and a source node s, the MECBS problem consists of finding a range assignment to V such that the induced graph contains a spanning directed tree rooted at s with minimized cost. This problem can be efficiently solved for some specific cases, but it is NP-hard in the general case. To the best of our knowledge, LMCA is the first localized algorithm to the MECBS problem with asymmetric edge costs (without restricting the way how edge costs might be asymmetric). We compared LMCA with blind flooding and with two alternative solutions we designed for the problem, LMCP and LBIPAsym (a variation of LBIP for the case of asymmetric edge costs). In our experiments, LMCA outperformed these algorithms. We additionally present and evaluate two slight variations of LMCA, called LMCAc and LMCAfl.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Clementi, A.E.F., Crescenzi, P., Penna, P., Rossi, G., Vocca, P.: On the Complexity of Computing Minimum Energy Consumption Broadcast Subgraphs. In: Ferreira, A., Reichel, H. (eds.) STACS 2001. LNCS, vol. 2010, pp. 121–131. Springer, Heidelberg (2001)
Clementi, A.E.F., Crescenzi, P., Penna, P., Rossi, G., Vocca, P.: A worst-case analysis of an MST-based heuristic to construct energy-efficient broadcast trees in wireless networks. Technical Report 010, University of Rome ”Tor Vergata”, Math Department (2001)
Korte, B., Vygen, J.: Combinatorial Optimization - Theory and Algorithms, 4th edn. Springer (2008)
Ambühl, C., Clementi, A.E.F., Ianni, M., Rossi, G., Monti, A., Silvestri, R.: The range assignment problem in non-homogeneous static ad-hoc networks. In: Proc. of IPDPS 2004 (2004)
Ingelrest, F., Simplot-Ryl, D.: Localized broadcast incremental power protocol for wireless ad hoc networks. Wireless Networks 14 (2008)
Ingelrest, F., Simplot-Ryl, D., Stojmenović, I.: Optimal transmission radius for energy efficient broadcasting protocols in ad hoc and sensor networks. IEEE Trans. on Parallel and Distr. Systems 17(6) (June 2006)
Calinescu, G., Kapoor, S., Olshevsky, A., Zelikovsky, A.: Network Lifetime and Power Assignment in ad hoc Wireless Networks. In: Di Battista, G., Zwick, U. (eds.) ESA 2003. LNCS, vol. 2832, pp. 114–126. Springer, Heidelberg (2003)
Cartigny, J., Simplot-Ryl, D., Stojmenovic, I.: Localized minimum-energy broadcasting in ad-hoc networks. In: Procs. of INFOCOM (2003)
Cartigny, J., Ingelrest, F., Simplot-Ryl, D., Stojmenovic, I.: Localized LMST and RNG based minimum-energy broadcast protocols in ad hoc networks. Ad Hoc Networks 3 (2005)
Wieselthier, J.E., Nguyen, G.D., Ephremides, A.: Energy-efficient broadcast and multicast trees in wireless networks. Mobile Network and Applications 7(6), 481–492 (2002)
Čagalj, M., Hubaux, J.-P., Enz, C.: Minimum-energy broadcast in all-wireless networks: Np-completeness and distribution issues. In: MobiCom 2002, pp. 172–182. ACM, New York (2002)
Rappaport, T.S.: Wireless Communications: Principles and Practice, 2nd edn. Prentice-Hall (1996)
Ghosh, S.K.: Energy efficient broadcast in distributed ad-hoc wireless networks. In: Procs of the 11th IEEE Int. Conf. on Computational Science and Engineering (CSE 2008), São Paulo, Brazil (July 2008)
Misra, S., Mohanta, D.: Adaptive listen for energy-efficient medium access control in wireless sensor networks. Multimedia Tools and Applications 47(1), 121–145 (2010)
Calamoneri, T., Clementi, A., Monti, A., Rossi, G., Silvestri, R.: Minimum-energy broadcast in random-grid ad-hoc networks: Approximation and distributed algorithms. In: Procs. of MSWiM 2008. ACM Press (2008)
Wan, P.-J., Calinescu, G., Li, X.-Y., Frieder, O.: Minimum-energy broadcasting in static ad hoc wireless networks. Wireless Networks 8, 607–617 (2002)
Heinzelman, W.B., Chandrakasan, A.P., Balakrishnan, H.: An application-specific protocol architecture for wireless microsensor networks. IEEE Trans. on Wireless Comms 1(4), 660–670 (2002)
Liang, W.: Constructing minimum-energy broadcast trees in wireless ad hoc networks. In: Procs. of MOBIHOC 2002, Switzerland. ACM (June 2002)
Li, Y., Thai, M.T., Wang, F., Du, D.-Z.: On the construction of a strongly connected broadcast arborescence with bounded transmission delay. IEEE Transactions on Mobile Computing 5(10), 1460–1470 (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 ICST Institute for Computer Sciences, Social Informatics and Telecommunications Engineering
About this paper
Cite this paper
Barboza, F., Assis, F. (2012). A Localized Algorithm Based on Minimum Cost Arborescences for the MECBS Problem with Asymmetric Edge Costs. In: Simplot-Ryl, D., Dias de Amorim, M., Giordano, S., Helmy, A. (eds) Ad Hoc Networks. ADHOCNETS 2011. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 89. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-29096-1_16
Download citation
DOI: https://doi.org/10.1007/978-3-642-29096-1_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-29095-4
Online ISBN: 978-3-642-29096-1
eBook Packages: Computer ScienceComputer Science (R0)