Abstract
The minimization of expended energy for unicast and broadcast communication between nodes in a wireless network has been studied mostly as a path optimization problem without particular regard for the traffic load demands. In this paper, we consider the call admission problem whereby given a traffic load (described as source-destination rate demands) the required expended energy is minimized. In addition, we explicitly model bandwidth capacity constraints. The capacity constraints reflect the fact that, from the perspective of a single node, traffic includes data that the nodes originate and forward, as well as traffic they receive and is of no interest to them. This last class of traffic is unavoidable due to the transmission radius of nearby stations. Under the assumption that the MAC protocol behaves in an ideal fashion, we consider two centralized algorithms that attempt to admit the given load and we remark on their relative performance, especially with respect to their energy consumption and blocking (connection rejection) rate.
This is a preview of subscription content, log in via an institution to check access.
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
Gupta, P., Kumar, P.: Capacity of Wireless Networks. IEEE Transactions on Information Theory 46(2), 388–404 (2000)
Wieselthier, J.E., Nguygen, G., Ephremides, A.: On the Construction of Energy Efficient Broadcast and Multicast trees in Wireless Networks. In: Proc. of IEEE INFOCOM 2000, Tel-Aviv, Israel, March 2000, vol. 2, pp. 585–594 (2000)
Medina, A., Taft, N., Salamatian, K., Bhattacharyya, S., Diot, C.: Traffic Matrix Estimation: Existing Techniques and New Directions. In: Proc. of the 2002 conference on Applications, Technologies, Architectures, and Protocols for Computer Communications, Pittsburgh, Pennsylvania, USA, August 2002, pp. 161–174 (2002)
Marina, M., Kondylis, G., Kozat, U.C.: RBRP: A Robust Broadcast Reservation Protocol for Mobile Ad Hoc Networks. In: Proc. of IEEE/ICC-2001, Helsinki, Finland, June 2001, vol. 3, pp. 878–885 (2001)
Tang, Z., Garcia-Luna-Aceves, J.: A Protocol for Topology-Dependent Transmission Scheduling. In: Proc. of IEEE WCNC 1999, New Orleans, Las Angelas, USA, September 1999, vol. 3, pp. 1333–1337 (1999)
Cagalj, M., Hubaux, J.-P., Enz, C.: Minimum-Energy Broadcast in All-Wireless Networks: NP-Completeness and Distribution Issues. In: Proc. of 8th Annual International Conference on Mobile Computing and Networking, Atlanta, Georgia, USA, September 2002, pp. 172–182 (2002)
Guruswami, V., Khanna, S., Shepherd, B., Rajaraman, R., Yannakakis, M.: Near- Optimal Hardness Results and Approximation Algorithms for Edge-Disjoint Paths and Related Problems. In: Proc. of the 31stAnnual ACM Symposium on Theory of Computing, Atlanta, Georgia, USA, May 1999, pp. 19–28 (1999)
Tandon, V., Frank, A., Vegh, Z.: Node-capacitated Multicommodity Routing for a Ring. Math. of Operations Research 27(2), 372–383 (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chu, T., Nikolaidis, I. (2003). On the Interaction of Bandwidth Constraints and Energy Efficiency in All-Wireless Networks. In: Pierre, S., Barbeau, M., Kranakis, E. (eds) Ad-Hoc, Mobile, and Wireless Networks. ADHOC-NOW 2003. Lecture Notes in Computer Science, vol 2865. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39611-6_19
Download citation
DOI: https://doi.org/10.1007/978-3-540-39611-6_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20260-8
Online ISBN: 978-3-540-39611-6
eBook Packages: Springer Book Archive