• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.17 no.7
• /
• pp.1715-1724
• /
• 2013

The maximum lifetime data aggregation problem is to maximize the network lifetime as minimizing the transmission energy of all deployed nodes in wireless sensor networks. In this paper, we propose a simulated annealing algorithm to solve efficiently the maximum lifetime data aggregation problem on the basis of meta-heuristic approach in wireless sensor networks. In order to make a search more efficient, we propose a novel neighborhood generating method and a repair function of the proposed algorithm. We compare the performance of the proposed algorithm with other existing algorithms through some experiments in terms of the network lifetime and algorithm computation time. Experimental results show that the proposed algorithm is efficient for the maximum lifetime data aggregation problem in wireless sensor networks.

• Journal of Communications and Networks
• /
• v.18 no.2
• /
• pp.227-237
• /
• 2016

Data collection is a key function for wireless sensor networks. There has been numerous data collection scheduling algorithms, but they fail to consider the deep and complex relationship among network lifetime, sink aggregated information and sample cycle for wireless sensor networks. This paper gives the upper bound on the sample period under the given network topology. An optimal schedule algorithm focusing on aggregated information named OSFAI is proposed. In the schedule algorithm, the nodes in hotspots would hold on transmission and accumulate their data before sending them to sink at once. This could realize the dual goals of improving the network lifetime and increasing the amount of information aggregated to sink. We formulate the optimization problem as to achieve trade-off among sample cycle, sink aggregated information and network lifetime by controlling the sample cycle. The results of simulation on the random generated wireless sensor networks show that when choosing the optimized sample cycle, the sink aggregated information quantity can be increased by 30.5%, and the network lifetime can be increased by 27.78%.

• Journal of KIISE:Information Networking
• /
• v.36 no.6
• /
• pp.505-513
• /
• 2009

In some wireless sensor networks, each wireless sensor network has its own target lifetime (desired lifetime after deployment). However, satisfying the target lifetime is not a trivial problem since the nodes in wireless sensor networks often rely on batteries as their power source. In this paper, we propose an energy efficient routing algorithm that satisfies the target-lifetime requirement of a wireless sensor network. The proposed routing algorithm not only finds energy efficient paths but also optimizes the sensing rate of each sensor node. Through simulation, we compare the performance of the proposed scheme with several other existing algorithms.

• Journal of information and communication convergence engineering
• /
• v.16 no.3
• /
• pp.135-141
• /
• 2018

Wireless sensor networks (WSN) are composed of a large number of sensor nodes. Battery-powered sensor nodes have limited coverage; therefore, it is more efficient to transmit data via multi-hop communication. The network lifetime is a crucial issue in WSNs and the multi-hop routing protocol should be designed to prolong the network lifetime. Prolonging the network lifetime can be achieved by minimizing the power consumed by the nodes, as well as by balancing the power consumption among the nodes. A power imbalance can reduce the network lifetime even if several nodes have sufficient (battery) power. In this paper, we propose a routing protocol that prolongs the network lifetime by balancing the power consumption among the nodes. To improve the balance of power consumption and improve the network lifetime, the proposed routing scheme adaptively controls the transmission range using a power control according to the residual power in the nodes. We developed a routing simulator to evaluate the performance of the proposed routing protocol. The simulation results show that the proposed routing scheme increases power balancing and improves the network lifetime.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.35 no.2
• /
• pp.53-69
• /
• 2010

This paper proposes an ant-based routing algorithm, Ant System-Routing in wireless Senor Networks(AS-RSN), for wireless sensor networks. Using a transition rule in Ant System, sensors can spread data traffic over the whole network to achieve energy balance, and consequently, maximize the lifetime of sensor networks. The transition rule advances one of the original Ant System by re-defining link cost which is a metric devised to consider energy-sufficiency as well as energy-efficiency. This metric gives rise to the design of the AS-RSN algorithm devised to balance the data traffic of sensor networks in a decentralized manner and consequently prolong the lifetime of the networks. Therefore, AS-RSN is scalable in the number of sensors and also robust to the variations in the dynamics of event generation. We demonstrate the effectiveness of the proposed algorithm by comparing three existing routing algorithms: Direct Communication Approach, Minimum Transmission Energy, and Self-Organized Routing and find that energy balance should be considered to extend lifetime of sensor network and increase robustness of sensor network for diverse event generation patterns.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.7A
• /
• pp.660-668
• /
• 2010

In energy resource constrained networks, the network lifetime can be enhanced by optimally allocating energy resource among users based on the available channel state information and the residual energy information at each node. In this paper, we propose the relay selection scheme and power allocation scheme to maximize the network lifetime in wireless relay networks with capacity constraint. The computer simulation results show that the proposed scheme increase the network lifetime in comparison to the conventional schemes.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.16 no.3
• /
• pp.113-117
• /
• 2021

The data gathering delay and the network lifetime are important indicators to measure the service quality of wireless sensor and actuator networks (WSANs). This study proposes a dynamically cluster head (CH) selection strategy and automatic scheduling scheme of collectors for prolonging the network lifetime and shorting data gathering delay in WSAN. First the monitoring region is equally divided into several subregions and each subregion dynamically selects a sensor node as CH. These can balance the energy consumption of sensor node thereby prolonging the network lifetime. Then a task allocation method based on genetic algorithm is proposed to uniformly assign tasks to actuators. Finally the trajectory of each actuator is optimized by ant colony optimization algorithm. Simulations are conducted to evaluate the effectiveness of the proposed method and the results show that the method performs better to extend network lifetime while also reducing data delay.

• Proceedings of the IEEK Conference
• /
• 2003.11c
• /
• pp.140-144
• /
• 2003

A sensor network consists of many low-cost, low-power, and multi-functional sensor nodes. One of most important issues in of sensor networks is to increase network lifetime, and there have been researches on the problem. In this paper, we propose a routing mechanism to prolong network lifetime, in which each node adjusts its transmission power to send data to its neighbors. We model the energy efficient routing with power control and present an algorithm to obtain the optimal flow solution for maximum network lifetime. Then, we derive an upper bound on the network lifetime for specific network topologies.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2008.05a
• /
• pp.465-468
• /
• 2008

Clustering techniques in wireless sensor networks is developed to minimize the energy consumption of node, show the effect that increases the network lifetime. Existing clustering techniques proposed the method that increases the network lifetime equalizing each node's the energy consumption by rotating the role of CH(Cluster Head), but these algorithm did not present the resolution that minimizes the energy consumption of neighboring nodes with sink. In this paper, we propose the clustering algorithm that prolongs the network lifetime by not including a part of nodes in POS(Personal Operating Space) of the sink in a cluster and communicating with sink directly to reduce the energy consumption of CH closed to sink.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.12 no.6
• /
• pp.1107-1112
• /
• 2008

Clustering techniques, which are algorithm to increase the network lifetime in wireless sensor networks, is developed to minimize the energy consumption of nodes. Existing clustering techniques by to increase the network lifetime with equalizing each node's the energy consumption by rotating the role of CH(Cluster Head), but these algorithms did not present the solution that minimizes the energy consumption of neighboring nodes with sink. In this paper, we propose the clustering algorithm that prolongs the network lifetime by not including a part of nodes in POS(Personal Operating Space) of the sink in a cluster and communicating with sink directly to reduce the energy consumption of CH closed to sink.