• Journal of KIISE:Computing Practices and Letters
• /
• v.14 no.3
• /
• pp.281-285
• /
• 2008

Wireless sensor networks are closely related with the geometric environment in which they are deployed. We consider the probable case when a routing protocol runs on an environment with many complex obstacles like downtown surroundings. In addition, there are no unrealistic assumptions in order to increase practicality of the protocol. Our goal is to find a routing protocol for maximizing network lifetime by using only connectivity information in the complex sensor network environment. We propose a topology-based routing algorithm that accomplishes good performance in terms of network lifetime and routing complexity as measures. Our routing algorithm makes routing decision based on a weighted graph as topological abstraction of the complex network. The graph conduces to lifetime enhancement by giving alternative paths, distributing the skewed burden. An energy estimation method is used so as to maintain routing information without any additional cost. We show how our approach can be used to maximize network lifetime and by extensive simulation we prove that out approach gives good results in terms of both measures-network lifetime and routing complexity.

• International Journal of Internet, Broadcasting and Communication
• /
• v.10 no.1
• /
• pp.11-15
• /
• 2018

The application of Wireless Sensor Networks requires a wise utilization of limited energy resources. Therefore, a wide range of routing protocols with a motivation to prolong the lifetime of a network has been proposed in recent years. Hierarchical clustering based protocols have become an object of a large number of studies that aim to efficiently utilize the limited energy of network components. In this paper, the effect of mismatch in parameter estimation is discussed to evaluate the robustness of a distanced based algorithm called distributed clustering protocol in homogeneous and heterogeneous environment. For quantitative analysis, performance simulations for this protocol are carried out in terms of the network lifetime which is the main criteria of efficiency for the energy limited system.

• Journal of Sensor Science and Technology
• /
• v.19 no.5
• /
• pp.369-374
• /
• 2010

It is important to efficiently elect the cluster header in Hierarchical Sensor Network, because it largely affects on the lifetime of the network. Therefore, recent research is focused on the lifetime extension of the whole network for efficient cluster header election. In this paper, we propose the new Cluster Header Election Scheme in which the cluster is divided into Group considering Distance from Upper Node, and a cluster header will be elected by node density of the Group. Also, we evaluate the performance of this scheme, and show that this proposed scheme improves network lifetime in Zigbee environment.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.8
• /
• pp.2959-2973
• /
• 2021

In wireless sensor and actuator networks (WSANs), the network lifetime is an important criterion to measure the performance of the WSAN system. Generally, the network lifetime is mainly affected by the energy of sensors. However, the energy of sensors is limited, and the batteries of sensors cannot be replaced and charged. So, it is crucial to make energy consumption efficient. WSAN introduces multiple actuators that can be regarded as multiple collectors to gather data from their respective surrounding sensors. But how to deploy actuators to reduce the energy consumption of sensors and increase the manageability of the network is an important challenge. This research optimizes actuators deployment by a proposed probabilistic mutation multi-layer particle swarm optimization algorithm to maximize the coverage of actuators to sensors and reduce the energy consumption of sensors. Simulation results show that this method is effective for improving the coverage rate and reducing the energy consumption.

• Journal of Korea Multimedia Society
• /
• v.12 no.5
• /
• pp.728-736
• /
• 2009

We propose a method using the genetic algorithm to solve the maximum set cover problem. It is needed for scheduling the power of sensor nodes in extending the lifetime of the wireless sensor network with variable sensing range. The existing Greedy Heuristic method calculates the power scheduling of sensor nodes repeatedly in the process of operation, and so the communication traffic of sensor nodes is increased. The proposed method reduces the amount of communication traffic of sensor nodes, and so the energies of nodes are saved, and the lifetime of network can be extended. The effectiveness of this method was verified through computer simulation, and considering the energy losses of communication operations about 10% in the network lifetime is improved.

• Proceedings of the KIEE Conference
• /
• 1998.11c
• /
• pp.910-912
• /
• 1998

In this paper, we purpose automatic diagnosis in online, as the fundamental study to diagnose the partial discharge mechanism and to predict the lifetime, by introduction a neural network. In the proposed method, Ire use acoustic emission sensing system and calculate a fixed quantity statistic operator by pulse number and amplitude. Using statically operators such as the center of gravity(G) and the gradient of the discharge distribute(C), we analyzed the early stage and the middle stage. the fixed quantity statistic operators are learned by a neural network. The diagnosis of insulation degradation and a lifetime prediction by the early stage time are achieved. On the basis of revealed excellent diagnosis ability through the neural network learning for the patterns during degradation, it was proved that the neural network is appropriate for degradation diagnosis and lifetime prediction in partial discharge.

• International journal of advanced smart convergence
• /
• v.6 no.1
• /
• pp.57-67
• /
• 2017

In this paper, propose an algorithm to improve network lifetime by equally consuming energy of LEACH - Mobile sensor nodes. LEACH is one of energy efficient protocols. However, we did not consider the mobility of nodes. Therefore, the transmission reception success rate of the moving data is reduced. LEACH-Mobile is a protocol that has improved the drawbacks of these LEACH. However, since LEACH-Mobile has a larger number of data packets and consumes more energy than LEACH, it has a disadvantage that the lifetime of the network is short. In order to improvement these disadvantage, Based on the average of the remaining energy of the node, cluster heads are elected with a number of nodes whose energies are larger than the average of the remaining energy from the member nodes. After that, by trying to increase the lifetime of the network by equalizing the remaining energy. In to confirm whether improve the lifetime of the network, In this paper, the number of nodes and the position of all nodes are varied for each specific round, the rest energy is equalized, and the algorithm which uniformly selected the cluster head is compared with LEACH.

• 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.

• Journal of the Korea Society for Simulation
• /
• v.19 no.2
• /
• pp.119-125
• /
• 2010

In ad-hoc networks, dynamically reconfigurable and temporary wireless networks, all mobile devices cooperatively maintain network connectivity with no assistance of base stations while they have limited amounts of energy that is used in different rates depending on the power level. Since every node has to perform the functions of a router, if some nodes die early due to lack of energy, it will not be possible for other nodes to communicate with each other and network lifetime will be shortened. Consequently, it is very important to develop a technique to efficiently consume the limited amounts of energy resources so that the network lifetime is maximized. In this paper, geographical localized routing is proposed to help making smarter routing decision using only local information and reduce the routing overhead. The proposed localized routing algorithm selects energy-aware neighbors considering the transmission energy and error rate over the wireless link, and the residual energy of the node, which enables nodes to achieve balanced energy-consumption and the network lifetime to prolong.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.11 no.3
• /
• pp.31-39
• /
• 2012

In this paper, we propose an energy-aware source routing protocol for maximizing a network lifetime in mobile ad hoc network environments. The proposed routing protocol is based on the source routing and chooses a path that maximize the path lifetime, by considering both transmit/receive power consumption and residual battery power in the mobile nodes from the perspective of source-destination end-to-end. This paper proposes a new routing cost and designs a new routing protocol for minimizing the control packet overhead occurred during the route discovery. Simulation results show that the proposed scheme has similar performances to the conventional routing schemes in terms of the number of transmission hops, transmission rate and total energy consumption, but achieves the performance improvement of 20 percent with respect to the lifetime.