Reducing power consumption in LEO satellite network

Current low earth orbit (LEO) satellite network display poor power efficiency, running network devices at full capacity all the time regardless of the traffic matrix and the distribution of the population over the Globe. Most of the research on energy efficiency of LEO satellites has focused on component level or link level. Therefore, this kind of research is not holistic to try to look at the satellite system as a single node. To enhance the energy efficiency. The solution should exploits multipath routing and load balancing. LEO network is overprovisioned, and hence selectively shutting down some satellite nodes and links during off-peaks hours seems like a good way to reduce energy consumption. In this paper, we exploit the fact that due to geographical and climatic conditions, some satellite links are expected to be loaded with data while others remain unused. Our approach is to power down satellite nodes and links during period of low traffic, while guaranteeing the connectivity and QoS. Finding the optimal solution is NP-problem and therefore, we explore in this work two heuristic algorithms. We evaluate our heuristics on a realistic LEO topology and real traffic matrices. Simulation results show that the power saving can be significant

Minimizing energy and maximizing network lifetime multicasting in wireless ad hoc networks

Abstract-Most mobile nodes in a wireless ad hoc network are powered by energy limited batteries, the limited battery lifetime imposes a constraint on the network performance. Therefore, energy efficiency is paramount of importance in the design of routing protocols for the applications in such a network, and efficient operations are critical to enhance the network lifetime. In this paper we consider energy-efficient routing for the minimizing energy and maximizing network lifetime multicast problem in ad hoc networks. We aim to construct a multicast tree rooted at the source and spanning the destination nodes such that the minimum residual battery energy (also referred to the network lifetime) among the nodes in the network is maximized and the total transmission energy consumption is minimized. Due to the NP-hardness of the concerned problem, all previously proposed algorithms for it are heuristic algorithms, and there is little known about the analytical performance of these algorithms in terms of approximation ratios. We here focus on devising approximation algorithms for the problem with provably guaranteed approximation ratios. Specifically, we present an approximation algorithm for finding a multicast tree such that the total transmission energy consumption is no more than γ times of the optimum, under the constraint that the network lifetime is no less than β times of the optimum, where γ is either 4 ln K or O(K ), depending on whether the network is symmetric or not, and β are constants with 0 < , β ≤ 1, and K is the number of destination nodes in a multicast session

Design of an energy-efficient geographic routing protocol for mobile ad-hoc networks

Mobile Ad-hoc networks extend communications beyond the limit of infrastructure based networks. Future wireless applications will take advantage of rapidly deployable, self-configuring multi-hop mobile Ad-hoc networks. In order to provide robust performance in mobile Ad-hoc networks and hence cope with dynamic path loss conditions, it is apparent that research and development of energy efficient geographic routing protocols is of great importance. Therefore various mobile Ad-hoc routing protocols have been studied for their different approaches. Forwarding strategies for geographic routing protocols are discussed and there is a particular focus on the pass loss model used by those routing protocols, the restriction and disadvantage of using such path loss model is then discussed. A novel geographic routing protocol which incorporates both the link quality and relay node location information has been developed to determine an energy efficient route from source to destination. The concepts of a gain region and a relay region to minimize the energy consumption have been proposed to define the area in where the candidate relay nodes will be selected with the minimized hop count. The signalling overhead required by the protocol has been analyzed in various scenarios with different traffic load, node densities and network sizes. Discrete event simulation models are therefore developed to capture the behaviour and characteristics of the operation of the developed routing protocol under different path loss conditions and network scenarios. A non-free space path loss model has been developed with a random loss between the nodes to simulate a realistic path loss scenario in the network. An enhanced signalling process has been designed in order to achieve advanced routing information exchange and assist routing determination. Comparison of simulated characteristics demonstrates the significant improvement of the new routing protocol because of its novel features, the gain region to ensure the deductiono f the energyc onsumptiont,h e relay region to ensuret he forward progress to the destination and hence maintain an optimised hop count. The simulation results showed that the energy consumption under the operation of the developed protocol is 30% of that with a conventionagl eographicarl outing protocol

Maximizing Battery Life Routing in Wireless Ad Hoc Networks

Most wireless ad hoc networks consist of mobile devices which operate on batteries. Power consumption in this type of network therefore is paramount important. To maximize the lifetime of an ad hoc network, it is essential to prolong each individual nod