Abstract
Today, regardless of economic or environmental incentives, reducing energy consumption is of great importance when designing IT systems. In a multi-hop wireless network, taking into account energy usually consists in maximizing the lifetime of the network by uniformly distributing the traffic all over the nodes. In this paper, we propose a new routing paradigm which aggregates flows on a minimum number of nodes to maximize the number of nodes that can be turned off in the network. In this way, we intend to significantly reduce global energy consumption. To maintain the same quality of service while keeping the same network capacity, we combine flow aggregation with network coding. Our approach is particularly effective, in part because aggregation increases coding opportunities, as shown in the simulations in terms of global energy savings and network load compared to conventional routing algorithms.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
For sake of clarity, we don’t detail computations and utilization rates of cliques. Details can be seen at https://www.lri.fr/~laube/RA/cliques.pdf.
References
Kumar, P.R., Gupta, P.: The capacity of wireless networks. Trans. Inf. Theor. IEEE. 46(2), 388–404 (2000)
Walrand, J., Jia, Z., Gupta, R., Varaiya, P.: Bandwidth guaranteed routing for ad hoc networks with interference consideration. In: IEEE Symposium on Computers and Communications, June 2005
Gawedzki, I., Benfattoum, Y., Martin, S., AlAgha, K.: I2ASWP: routing with intra-flow interference consideration in adhoc network. Research report, CNRS-University of Paris Sud-LRI, December 2010
Gomez, J., Campbell, A.T.: Variable-range transmission power control in wireless ad hoc networks. IEEE Trans. Mob. Comput. 6, 87–99 (2006)
Martin, S., Al Agha, K., Pujolle, G.: Traffic-based topology control algorithm for energy savings in multi-hop wireless networks. Ann. Telecommun. 67, 181–189 (2012). Springer
Zhong, Z., Ni, B., Santhapuri, N., Nelakuditi, S.: Routing with opportunistically coded exchanges in wireless mesh networks. In: Wireless Mesh Networks. IEEE, September 2006
Martin, S., Benfattoum, Y., AlAgha, K.: IROCX: interference-aware routing with opportunistically coded exchanges in wireless mesh networks. In: Wireless Communication and Networking Conference. IEEE, March 2011
Rossi, D., Bianzino, A.P., Chaudet, C., Rougier, J.-L.: A survey of green networking research. IEEE Commun. Surv. Tutor. 14, 3–20 (2012)
Mills, M.P.: The cloud begings with coal, big data, big networks, big infrastructure, and big power. Digital Power Group, August 2013
Charu, V.A.: A quality of service analysis of energy aware routing protocols in mobile ad hoc networks. In: Contemporary Computing (IC3). IEEE, August 2013
Doig, A.G., Lang, A.H.: An automatic method for solving discrete programming problems. Econometrica 28, 497–520 (1960)
Ramathan, R., Rosales-Hain, R.: Topology control of multihop wireless networks using power adjustment. In: Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies, vol. 2, p. 404 (2006)
Bahl, P., Wang, Y.M., Li, L., Halpern, J.Y., Wattenhofer, R.: A cone-based distributed topology-control algorithm for wireless multi-hop networks. In: Wirless Communication. IEEE, May 2004
Sheth, A., Halperin, D., Wetheral, D.: Demystifying 802.11n power consumption. In: Proceedings of the 2010 International Conference on Power Aware Computing and Systems, HotPower 2010. ACM (2010)
Padmanabhan, V., Jain, K., Padhye, J., Qiu, L.: Impact of interference on multi-hop wireless network performance. In: MobiCom ACM, September 2003
Musacchio, J., Gupta, R., Walrand, J.: Sufficient rate constraint for QoS flows in ad-hoc networks. Ad hoc Netw. 5, 429–443 (2006). ACM
Luo, X., Chaporkar, P., Kar, K., Sakar, S.: Throughput and fairness guarantees through maximal scheduling in wireless networks. IEEE Trans. Inf. Theor. 54, 572–594 (2008)
Wolsey, A.: Integer Programming. Wiley, New York (1998)
Glover, F.: Improved linear integer programming formulations of nonlinear integer problems. Manag. Sci. 22(4), 455–460 (1975)
Tucker, A.W., Miller, C.E., Zemlin, R.A.: Integer programming formulation of traveling salesman problems. JACM 7, 326–329 (1960)
IBM: Cplex optimizer. www.ibm.com/software/commerce/optimization/cplex-optimizer/
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this paper
Cite this paper
Laube, A., Martin, S., Quadri, D., Alagha, K. (2016). Optimal Flow Aggregation for Global Energy Savings in Multi-hop Wireless Networks. In: Mitton, N., Loscri, V., Mouradian, A. (eds) Ad-hoc, Mobile, and Wireless Networks. ADHOC-NOW 2016. Lecture Notes in Computer Science(), vol 9724. Springer, Cham. https://doi.org/10.1007/978-3-319-40509-4_9
Download citation
DOI: https://doi.org/10.1007/978-3-319-40509-4_9
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-40508-7
Online ISBN: 978-3-319-40509-4
eBook Packages: Computer ScienceComputer Science (R0)