• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.9
• /
• pp.4145-4164
• /
• 2016

Energy harvesting is an increasingly attractive source of power for cellular networks, and can be a promising solution for green networks. In this paper, we consider a cellular network with power beacons powering multiple mobile terminals with microwave power transfer in energy beamforming. In this network, the power beacons are powered by grid and renewable energy jointly. We adopt a dual-level control architecture, in which controllers collect information for a core controller, and the core controller has a real-time global view of the network. By implementing the water filling optimized power allocation strategy, the core controller optimizes the energy allocation among mobile terminals within the same cluster. In the proposed green energy cooperation paradigm, power beacons dynamically share their renewable energy by locally injecting/drawing renewable energy into/from other power beacons via the core controller. Then, we propose a new water filling optimized green energy cooperation management strategy, which jointly exploits water filling optimized power allocation strategy and green energy cooperation in cellular networks. Finally, we validate our works by simulations and show that the proposed water filling optimized green energy cooperation management strategy can achieve about 10% gains of MT's average rate and about 20% reduction of on-grid energy consumption.

• Journal of the Korea Society of Computer and Information
• /
• v.13 no.4
• /
• pp.105-113
• /
• 2008

While the wireless sensor network has a strong point which does not have effect on whole activities of network even though neighboring sensor nods fail activities of some sensor nod or make some functions disappear by the characteristic of similar information detection, it has problems which is slowing down of wireless medium, transfer character with severe error, limited power supply, the impossibility of change by optional arrangement of sensor nods etc. This paper proposes PRML techniques which performs the fittest course searching process to reduce power consumption of entire nods while guarantees the scalability of network organizing sensor nods hierarchically. The proposed technique can scatter the load of cluster head by considering the connectivity with surplus energy of nod and reduce the frequency of communication among the nods. As a result of the analysis in comparison with LEACH-C and HEED technique, PRML technique get efficiency of average 6.4% in energy consuming respect of cluster head, efficiency of average 8% in entire energy consuming respect, and more efficiency of average 7.5% in other energy consuming distribution of network scalability than LEACH-C and HEED technique.

• Journal of Communications and Networks
• /
• v.17 no.2
• /
• pp.184-197
• /
• 2015

This paper builds on a recent method, chain routing with even energy consumption (CREEC), for designing a wireless sensor network with chain topology and for scheduling the communication to ensure even average energy consumption in the network. In here a new suboptimal design is proposed and compared with the CREEC design. The chain topology in CREEC is reconfigured after each group of n converge-casts with the goal of making the energy consumption along the new paths between the nodes in the chain as even as possible. The new method described in this paper designs a single near-optimal Hamiltonian circuit, used to obtain multiple chains having only the terminal nodes different at different converge-casts. The advantage of the new scheme is that for the whole life of the network most of the communication takes place between same pairs of nodes, therefore keeping topology reconfigurations at a minimum. The optimal scheduling of the communication between the network and base station in order to maximize network lifetime, given the chosen minimum length circuit, becomes a simple linear programming problem which needs to be solved only once, at the initialization stage. The maximum lifetime obtained when using any combination of chains is shown to be upper bounded by the solution of a suitable linear programming problem. The upper bounds show that the proposed method provides near-optimal solutions for several wireless sensor network parameter sets.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.10A
• /
• pp.823-829
• /
• 2011

Recently, wireless body area network (WBAN) has received much attention as an application for the ubiquitous healthcare system. In WBAN, each sensor nodes and a personal base station such as PDA have an energy constraint and computation overhead should be minimized due to node's limited computing power and memory constraint. The reliable data transmission also must be guaranteed because it handles vital signals. In this paper, we propose a systematic network coding scheme for WBAN to reduce the network coding overhead as well as total energy consumption for completion the transmission. We model the proposed scheme using Markov chain. To minimize the total energy consumption for completing the data transmission, we made the problem as a minimization problem and find an optimal solution. Our simulation result shows that large amount of energy reduction is achieved by proposed systematic network coding. Also, the proposed scheme reduces the computational overhead of network coding imposed on each node by simplify the decoding process.

• Proceedings of the Korea Society for Simulation Conference
• /
• 2000.11a
• /
• pp.97-101
• /
• 2000

Energy consumption is considered as a principal ingredient in mobile wireless ad-hoc networks. In such a network, most of mobile nodes takes a role in forwarding messages received from neighbor nodes. Energy of these nodes is consumed in different rates depending on message traffic routes. This paper proposes a scheme to balance routing energy consumption by transferring routing function from node with small residual energy to node with enough residual energy. This scheme requires additional local message transfer, increasing the energy consumption of nodes to transfer routing function, and increasing total energy consumption of ad-hoc network. But balancing of energy consumption make the system lifetime the longer and increase the average node lifetime.

• International Journal of Computer Science & Network Security
• /
• v.23 no.7
• /
• pp.119-130
• /
• 2023

Worldwide organizations use the benefits offered by Cloud Computing (CC) to store data, software and programs. While running hugely complicated and sophisticated software on cloud requires more energy that causes global warming and affects environment. Most of the time energy consumption is wasted and it is required to explore opportunities to reduce emission of carbon in CC environment to save energy. Many improvements can be done in regard to energy efficiency from the software perspective by considering and paying attention on the energy consumption aspects of software's that run on cloud infrastructure. The aim of the current research is to propose a framework with an additional phase called parameterized development phase to be incorporated along with the traditional Software Development Life cycle (SDLC) where the developers need to consider the suggested techniques during software implementation to utilize low energy for running software on the cloud and contribute in green computing. Experiments have been carried out and the results prove that the suggested techniques and methods has enabled in achieving energy consumption.

• 제어로봇시스템학회:학술대회논문집
• /
• 2001.10a
• /
• pp.169.5-169
• /
• 2001

This study proposes a neural network for solving optimization problems such as the TSP (Travelling Salesman Problem), scheduling, and line balancing. The Hopfield network has been used for solving such problems, but it frequently gives abnormal solutions or non-optimal ones. Moreover, the Hopfield network takes much time especially in solving large size problems. To overcome such disadvantages, this study adopts nodes whose outputs changes with a fixed value at every evolution. The proposed network is applied to solving a TSP, finding the shortest path for visiting all the cities, each of which is visted only once. Here, the travelling path is reflected to the energy function of the network. The proposed network evolves to globally minimize the energy function, and a ...

• Management Science and Financial Engineering
• /
• v.17 no.2
• /
• pp.39-62
• /
• 2011

In wireless sensor network, since each sensor is equipped with a limited power, efficient use of the energy is important. One possible network management scheme is to cluster the sensors into several sets, so that the sensors in each of the sets can completely perform the monitoring task. Then the sensors in one set become active to perform the monitoring task and the rest of the sensors switch to a sleep state to save energy. Therefore, we rotate the roles of the active set among the sensors to maximize the network lifetime. In this paper, we suggest an optimal algorithm for the maximum lifetime coverage problem which maximizes the network lifetime. For comparison, we implemented both the heuristic proposed earlier and our algorithm, and executed computational experiments. Our algorithm outperformed the heuristic concerning the obtained network lifetimes, and it found the solutions in a reasonable amount of time.

• Smart Media Journal
• /
• v.5 no.4
• /
• pp.41-48
• /
• 2016

In mobile ad hoc networks(MANETs), all the nodes in a network have limited resources. Therefore, communication topology which has long lifetime is suitable for nodes in MANETs. And MANETs are exposed to various threats because of a new node which can join the network at any time. There are various researches on security problems in MANETs and many researches have tried to make efficient schemes for reducing network power consumption. Power consumption is necessary to secure networks, however too much power consumption can be critical to network lifetime. This paper focuses on energy efficient monitoring node distribution for enhancing network lifetime in MANETs. Since MANETs cannot use centralized infrastructure such as security systems of wired networks, we propose an efficient IDS node distribution scheme using minimum spanning tree (MST) method to cover all the nodes in a network and enhance the network lifetime. Simulation results show that the proposed algorithm has better performance in comparison with the existing algorithms.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.5 no.1
• /
• pp.39-45
• /
• 2010

As wireless sensor network are being deployed in a wide variety of application areas, the number of sensor nodes in a sensor filed becomes larger and larger. In the past, ISP (In-System Programming) method have been generally used for code update but the large number of sensor nodes requires a new code update method called network reprogramming. There are many challenging issues for network reprogramming since it can make an impact on the network lifetime. In this paper, a new sender selection scheme for network reprogramming protocol is proposed to decrease energy consumption for code update by minimizing overlapped area between sender nodes and reducing data contention. Simulation results show that the proposed scheme can reduce the amount of message traffic and the overall data transmission time.