• Journal of Internet Computing and Services
• /
• v.4 no.4
• /
• pp.15-25
• /
• 2003

Wireless ad-hoc networks are only composed with mobile devices. Unlike the traditional wired networks, those devices are mostly operated with battery power. Since the battery-operated power is limited, the efficient energy resource managements becomes an important issue in wireless ad-hoc networks and various studies that considered these characteristics are progressed. One of those studies is an energy efficient routing using coordinators. In this method. only devices elected as coordinator participate in data transmissions in ad-hoc networks, while other devices remain in sleep node. The overall energy consumption of a system can be reduced. In order to minimize energy consumption of a total network, previous results try to maximize the number of nodes in sleep mode. However, minimizing the number of coordinators does not ensure to increase the system lifetime. In this thesis, we propose an algorithm that can elect coordinators with considering the amount of necessary energy to transmit assigned data and a connectivity of nodes in the networks. The result of proposed coordinator election algorithm can increase the system lifetime of an Ad-hoc network from the results of existing coordinator election algorithms.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.44 no.10
• /
• pp.37-46
• /
• 2007

In wireless sensor networks, one of the most important goals of designing protocols is to extend the network lifetime. A node has lots of duplication in sensing and communication range with surrounding nodes after many of nodes are randomly scattered. Such a heavy duplication overhead affects on the network lifetime seriously so usually all nodes need not activated constantly to carry out sensing and communication operation. One of the optimal methods of prolonging the network lifetime is finding the number of surrounding nodes necessary to maintain the network coverage and connectivity. It has been studied till the current date in wireless networks. If the neighbor necessary can be acquired to satisfy the probability using the ideal number of neighbors necessary and the acquired number of neighbors m to guarantee network coverage and connectivity. We use the result that F. Xue et al and S. Song et al derive previously in finding the neighbor necessary to guarantee the network connectivity and cany out the computer simulation to verify the necessary number. We present that our scheme satisfy the network coverage and connectivity. We present the simulation results compared with constant probability scheme through computer simulation.

• The KIPS Transactions:PartC
• /
• v.14C no.7
• /
• pp.611-620
• /
• 2007

Distributing the routing path over the entire network is an important factor to maintain the lifetime of wireless sensor network as long as possible. This paper proposes a fuzzy routing protocol that decides a routing path based on the fuzzy control rules. The fuzzy controller receives the energy values, distances, and hop counts of possible route paths as input, and the inference engine produces the contribution factors for each of route paths. The route path with the largest contribution factor is elected as the final routing path. The nodes contained in the routing path reduce their energy after transmitting a data packet so as to prevent the same route path from being selected repeatedly. It makes the network traffic spreaded over the network resulting longer network lifetime. The computer simulations on TinyOS have shown that the fuzzy routing protocol is more energy efficient and has longer network lifetime compared to the existing routing protocols.

• Journal of KIISE:Databases
• /
• v.35 no.1
• /
• pp.84-95
• /
• 2008

Wireless sensor networks have recently emerged as a platform for several applications. By deploying wireless sensor nodes and constructing a sensor network, we can remotely obtain information about the behavior, conditions, and positions of objects in a region. Since sensor nodes operate on batteries, energy-efficient mechanisms for gathering sensor data are indispensable to prolong the lifetime of a sensor network as long as possible. In this paper, we propose a novel clustering algorithm that distributes the energy consumption of a cluster head. First, we analyze the energy consumption if cluster heads and divide each cluster into a collection layer and a transmission layer according to their roles. Then, we elect a cluster head for each layer to distribute the energy consumption of single cluster head. In order to show the superiority of our clustering algorithm, we compare it with the existing clustering algorithm in terms of the lifetime of the sensor network. As a result, our experimental results show that the proposed clustering algorithm achieves about $10%{\sim}40%$ performance improvements over the existing clustering algorithms.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39B no.9
• /
• pp.620-628
• /
• 2014

Various on-demand manner routing protocols have been proposed for efficient energy consumption in mobile ad-hoc networks. Some of the protocols tried to extend the network lifetime by periodically rerouting paths according to the energy consumption rate of nodes. However, those protocols suffer from frequent flooding and high overhead. This paper proposed a new routing protocol called ALPMR (Adaptive Local Path Modification Routing) that extends the network lifetime by using local path rerouting. The proposed ALPMR protocol performs local rerouting around nodes with little remaining energy as well as data congestion, thus reduces flooding and routing overhead and can extend the network lifetime. The performance of ALPMR protocol is observed using ns-2 simulator.

• The Journal of the Korea Contents Association
• /
• v.11 no.7
• /
• pp.38-50
• /
• 2011

For energy-efficiency in Wireless Sensor Networks (WSNs), when a sensor node detects events, the sensing period for collecting the detailed information is likely to be short. The lifetime of WSNs decreases because communication modules are used excessively on a specific sensor node. To solve this problem, the TARP decentralized network packets to neighbor nodes. It considered the average data transmission rate as well as the data distribution. However, since the existing scheme did not consider the energy consumption of a node in WSNs, its network lifetime is reduced. The proposed scheme considers the remaining amount of energy and the transmission rate on a single node in fitness evaluation. Since the proposed scheme performs an efficient congestion control it extends the network lifetime. The simulation result shows that our scheme enhances the data fairness and improves the network lifetime by about 27% on average over the existing scheme.

• Smart Structures and Systems
• /
• v.30 no.6
• /
• pp.583-599
• /
• 2022

In this paper, a multi-objective wireless sensor network configuration optimization method is proposed. The proposed method aims to determine the optimal information and lifespan wireless sensor network for structural health monitoring of large-scale infrastructures. In particular, cluster-based wireless sensor networks with multi-type of sensors are considered. To optimize the lifetime of the wireless sensor network, a cluster-based network optimization algorithm that optimizes the arrangement of cluster heads and base station is developed. On the other hand, based on the Bayesian inference, the uncertainty of the estimated parameters can be quantified. The coefficient of variance of the estimated parameters can be obtained, which is utilized as a holistic measure to evaluate the estimation accuracy of sensor configurations with multi-type of sensors. The proposed method provides the optimal wireless sensor network configuration that satisfies the required estimation accuracy with the longest lifetime. The proposed method is illustrated by designing the optimal wireless sensor network configuration of a cable-stayed bridge and a space truss.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.24 no.5
• /
• pp.666-669
• /
• 2020

Energy harvesting sensor networks have the ability to collect energy from the environment to overcome the power limitations of traditional sensor networks. The sensor network, which has a limited transmission range, delivers data to the destination node through a multi-hop method. The routing protocol should consider the power situation of nodes, which is determined by the residual power and energy harvesting rate. At this time, if only considering the magnitude of the power, power imbalance can occur among nodes and it can induce instantaneous power shortages and reduction of network lifetime. In this paper, we designed a routing protocol that considers the balance of power as well as the residual power and energy harvesting rate.

• Smart Media Journal
• /
• v.6 no.4
• /
• pp.24-31
• /
• 2017

In wireless sensor networks, sensor nodes are deployed in a remote, harsh environment. When the power of the sensor node is consumed in such a network, the sensor nodes become useless together with the deterioration of the quality and performance of the sensor network which may save human life. Although many clustering protocols have been proposed to improve the energy consumption and extend the life of the sensor network, most of the previous studies have shown that the overhead of the cluster head is quite large. It is important to design a routing protocol that minimizes the energy consumption of each node and maximizes the network lifetime because of the power limitations of the sensor nodes and the overhead of the cluster heads. Therefore, in this paper, we propose an efficient clustering scheme that reduces the burden of cluster heads, minimizes energy consumption, and uses algorithms that maximize network lifetime. Simulation results show that the proposed clustering scheme improves the energy balance and prolongs the network life when compared with similar techniques.

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