Abstract
Ability to find a low-energy broadcast routing quickly is vital to a wireless system’s energy efficiency. Directional antennae save power by concentrating the transmission towards the intended destinations. A routing is given by assigning a transmission power, angle, and direction to every networking unit, and the problem of finding such a power saving routing is called the Directional Minimum Energy Broadcast Problem (D-MEBP). In the well known Minimum Energy Broadcast Problem (MEBP), the transmission angle is fixed to 2π. Previous works suggested to adapt MEBP algorithms to D-MEBP by two procedures, Reduced Beam (RB) and Directional (D). As the running time of the routing algorithms is a critical factor, we reduce the time complexity of both by one order of magnitude.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
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)
Guo, S., Yang, O.: Energy-aware Multicasting in Wireless Ad Hoc Networks: A Survey and Discussion. Computer Communications 30(9), 2129–2148 (2007)
Guo, S., Yang, O.: Multicast Lifetime Maximization for Energy-constrained Wireless Ad-hoc Networks with Directional Antennas. In: Proceedings of the Globecom 2004 Conference, pp. 4120–4124. IEEE Computer Society Press, Dallas (2004)
Wieselthier, J.E., Nguyen, G.D., Ephremides, A.: Energy-Efficient Broadcast and Multicast Trees in Wireless Networks. ACM Mobile Networks and Applications Journal 7(6), 481–492 (2002)
Wieselthier, J.E., Nguyen, G.D., Ephremides, A.: Energy-limited Wireless Networking with Directional Antennas: The Case of Session-based Multicasting. In: Proceedings IEEE INFOCOM 2002, pp. 190–199. IEEE Press, New York (2002)
Guo, S., Yang, O.: Minimum-energy Multicast in Wireless Ad Hoc Networks with Adaptive Antennas: MILP Formulations and Heuristic Algorithms. IEEE Transactions on Mobile Computing 5(4), 333–346 (2006)
Guo, S., Yang, O.: A Dynamic Multicast Tree Reconstruction Algorithm for Minimum-energy Multicasting in Wireless Ad Hoc Networks. In: Hassanein, H., Oliver, R.L., Richard III, G.G., Wilson, L.F. (eds.) 23rd IEEE International Performance, Computing, and Communications Conference, pp. 637–642. IEEE Computer Society, Los Alamitos (2004)
Wieselthier, J.E., Nguyen, G.D., Ephremides, A.: Energy-aware Wireless Networking with Directional Antennas: The Case of Session-based Broadcasting and Multicasting. IEEE Transactions on Mobile Computing 1(3), 176–191 (2002)
New Results on the Time Complexity and Approximation Ratio of the Broadcast Incremental Power Algorithm. Under review (2008)
Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms. MIT Press, Cambridge (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bauer, J., Haugland, D. (2008). Improved Time Complexities of Algorithms for the Directional Minimum Energy Broadcast Problem. In: Le Thi, H.A., Bouvry, P., Pham Dinh, T. (eds) Modelling, Computation and Optimization in Information Systems and Management Sciences. MCO 2008. Communications in Computer and Information Science, vol 14. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-87477-5_52
Download citation
DOI: https://doi.org/10.1007/978-3-540-87477-5_52
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-87476-8
Online ISBN: 978-3-540-87477-5
eBook Packages: Computer ScienceComputer Science (R0)