• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.4
• /
• pp.1419-1436
• /
• 2020

For an energy harvesting sensor network, when the network lifetime is not the only primary goal, maximizing the network performance under environmental energy harvesting becomes a more critical issue. However, clustering protocols that aim at providing maximum information throughput have not been thoroughly explored in Energy Harvesting Wireless Sensor Networks (EH-WSNs). In this paper, clustering protocols are studied for maximizing the data transmission in the whole network. Based on a long short-term memory (LSTM) energy predictor and node energy consumption and supplement models, an uneven clustering protocol is proposed where the cluster head selection and cluster size control are thoroughly designed for this purpose. Simulations and results verify that the proposed scheme can outperform some classic schemes by having more data packets received by the cluster heads (CHs) and the base station (BS) under these energy constraints. The outcomes of this paper also provide some insights for choosing clustering routing protocols in EH-WSNs, by exploiting the factors such as uneven clustering size, number of clusters, multiple CHs, multihop routing strategy, and energy supplementing period.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.26 no.8
• /
• pp.1196-1204
• /
• 2022

In this paper, we propose an optimization algorithm that maximizes the network lifetime in wireless ad-hoc networks using the broadcast transmission method. The optimization algorithm proposed in this paper applies tabu search algorithm, a metaheuristic method that improves the local search method using the memory structure. The proposed tabu search algorithm proposes efficient encoding and neighborhood search method to the network lifetime maximization problem. By applying the proposed method to design efficient broadcast routing, we maximize the lifetime of the entire network. The proposed tabu search algorithm was evaluated in terms of the energy consumption of all nodes in the broadcast transmission occurring in the network, the time of the first lost node, and the algorithm execution time. From the performance evaluation results under various conditions, it was confirmed that the proposed tabu search algorithm was superior to the previously proposed metaheuristic algorithm.

• Journal of Internet Computing and Services
• /
• v.10 no.2
• /
• pp.153-160
• /
• 2009

One of the major challenges of designing a dissemination protocol for Wireless Sensor Networks(WSNs) is energy efficiency. Recently, this issue has received much attention from the research community, and SPMS, which outperforms the well-known protocol SPIN, specially is a representative protocol. In addition, one of many characters of SPMS is the use of the shortest path to minimize the energy consumption. However, since it repeatedly uses the same path as the shortest path, the maximizing of the network lifetime is impossible, though it reduces the energy consumption. In this paper, we propose a dissemination protocol using probability-based clustering which guarantees energy-efficient data transmission and maximizes network lifetime. The proposed protocol solves the network lifetime problem by a novel probability function, which is related to the residual energy and the transmission radius between nodes. The simulation results show that it guarantees energy-efficient transmission and moreover increases the network lifetime by approximately 78% than that of SPMS.

• ETRI Journal
• /
• v.39 no.3
• /
• pp.353-363
• /
• 2017

Recently, sink mobility has been shown to be highly beneficial in improving network lifetime in wireless sensor networks (WSNs). Numerous studies have exploited mobile sinks (MSs) to collect sensed data in order to improve energy efficiency and reduce WSN operational costs. However, there have been few studies on the effectiveness of MS operation on WSN closed operating cycles. Therefore, it is important to investigate how data is collected and how to plan the trajectory of the MS in order to gather data in time, reduce energy consumption, and improve WSN network lifetime. In this study, we combine two methods, the cluster-head election algorithm and the MS trajectory optimization algorithm, to propose the optimal MS movement strategy. This study aims to provide a closed operating cycle for WSNs, by which the energy consumption and running time of a WSN is minimized during the cluster election and data gathering periods. Furthermore, our flexible MS movement scenarios achieve both a long network lifetime and an optimal MS schedule. The simulation results demonstrate that our proposed algorithm achieves better performance than other well-known algorithms.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.17 no.12
• /
• pp.2826-2834
• /
• 2013

In mobile ad hoc networks (MANET), power-saving technology of mobile nodes is divided into transmit power control (TPC), power-saving mode (PSM), and routing. TPC and PSM are operated in physical layer but the routing is managed in network layer, so the design of a joint algorithm is needed to provide better performance. Therefore, in this paper, we propose a joint power-saving and routing algorithm for maximizing the network lifetime while satisfying the end-to-end data rate in ad hoc networks. The proposed algorithm first applies the TPC or PSM to reduce the power consumption of mobile nodes and then performs the routing by considering the decided node lifetime in order to maximize the path lifetime. Simulation results show that the proposed algorithm maximize the lifetime while satisfying the required rate according to the number of mobile nodes and the level of interference.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.9 no.11
• /
• pp.1241-1248
• /
• 2014

An efficient battery usage of sensor nodes is main goal in a sensor network, which is the substructure of Internet of Things. Maximizing the battery usage of sensor nodes makes the lifetime of sensor network increase as well as the reliability of the network improved. The previous solutions to solve these problems are mainly focused on the cluster head selection based on the remaining energy. In this paper, we consider both the head selection and the replacement interval which is determined by a threshold that is based on the remaining energy, density of alive nodes, and location. Our simulation results show that the proposed scheme has outstanding contribution in terms of maximizing the life time of the network and balancing energy consumption of all nodes.

• Journal of Advanced Navigation Technology
• /
• v.15 no.1
• /
• pp.54-60
• /
• 2011

The development of wireless sensor networks (WSN) can be motivated by several types of applications. However, these applications demand an energy-efficient WSN that can prolong the network lifetime and can provide high throughput, low latency and delay. Designing wireless sensor networks with the capability of prolonging network lifetime catch the attention of many researchers in wireless system and network field. Contrasts with Mobile Ad Hoc Network system, Wireless Sensor Networks designs focused more on survivability of each node in the network instead of maximizing data throughput or minimizing end-to-end delay. In this paper, we will study part of data link layer in Open Systems Interconnection (OSI) model, called medium access control (MAC) layer. Since the MAC development of energy aware MAC Protocol for wireless sensor layer controls the physical radio part, it has a large impact on the overall energy consumption and the lifetime of a node. This paper proposes a analytical approach that tries to reduce idle energy consumption, and shows the increasement of network end-to-end arrival rate due to efficiency in energy consumption from time slot management.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2010.11a
• /
• pp.1658-1661
• /
• 2010

유비쿼터스 시대가 도래하면서 인프라 중 하나인 센서네트워크에 대한 연구가 활발하게 진행되고 있다. 배터리를 사용하는 센서들의 특성상 네트워크 수명을 최대화하는 것이 주요 이슈 중 하나인데, 모바일 싱크를 이용하여 패킷 전송에 소비되는 에너지 로드 밸런싱을 통해 효율적인 결과를 얻을 수 있었다. 전체 센서들의 잔여 에너지와 그 평균과의 편차를 싱크를 움직이는 기준으로 하는 휴리스틱 알고리즘을 제안하였고 최적에 가까운 결과를 얻었다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.8A
• /
• pp.691-701
• /
• 2011

In rotatable directional sensor networks, maximizing network lifetime while covering all the targets and forwarding the sensed data to the sink is a challenge problem. In this paper, we address the Maximum Directional Cover Tree (MDCT) problem of organizing the directional sensors into a group of non-disjoint subsets to extend the network lifetime. Each subset in which the directional sensors cover all the targets and forward the sensed data to the sink is activated at one time. For the MDCT problem, we first present an energy consumption model which mainly takes into account the energy consumption for rotation work. We also develop the Directional Coverage and Connectivity (DCC)-greedy algorithm to solve the MDCT problem. To evaluate the algorithm, we conduct simulations and show that it can extend the network lifetime.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.42 no.1
• /
• pp.87-94
• /
• 2019

A wireless sensor network is emerging technology and intelligent wireless communication paradigm that is dynamically aware of its surrounding environment. It is also able to respond to it in order to achieve reliable and efficient communication. The dynamical cognition capability and environmental adaptability rely on organizing dynamical networks effectively. However, optimally clustering the cognitive wireless sensor networks is an NP-complete problem. The objective of this paper is to develop an optimal sensor network design for maximizing the performance. This proposed Ranking Artificial Bee Colony (RABC) is developed based on Artificial Bee Colony (ABC) with ranking strategy. The ranking strategy can make the much better solutions by combining the best solutions so far and add these solutions in the solution population when applying ABC. RABC is designed to adapt to topological changes to any network graph in a time. We can minimize the total energy dissipation of sensors to prolong the lifetime of a network to balance the energy consumption of all nodes with robust optimal solution. Simulation results show that the performance of our proposed RABC is better than those of previous methods (LEACH, LEACH-C, and etc.) in wireless sensor networks. Our proposed method is the best for the 100 node-network example when the Sink node is centrally located.