• Journal of the Institute of Convergence Signal Processing
• /
• v.24 no.3
• /
• pp.166-171
• /
• 2023

Efficient energy management is a very important factor in sensor networks with limited resources, and cluster techniques have been studied a lot in this respect. However, a problem may occur in which energy use of the cluster header is concentrated, and when the cluster header is not evenly distributed over the entire area but concentrated in a specific area, the transmission distance of the cluster members may be large or very uneven. The transmission distance can be directly related to the problem of energy consumption. Since the energy of a specific node is quickly exhausted, the lifetime of the sensor network is shortened, and the efficiency of the entire sensor network is reduced. Thus, balanced energy consumption of sensor nodes is a very important research task. In this study, factors for balanced energy consumption by cluster headers and sensor nodes are analyzed, and a balancing distribution clustering method in which cluster headers are balanced distributed throughout the sensor network is proposed. The proposed cluster method uses multi-hop routing to reduce energy consumption of sensor nodes due to long-distance transmission. Existing multi-hop cluster studies sets up a multi-hop cluster path through a two-step process of cluster setup and routing path setup, whereas the proposed method establishes a hierarchical cluster routing path in the process of selecting cluster headers to minimize the overhead of control messages.

• Journal of Communications and Networks
• /
• v.12 no.2
• /
• pp.122-129
• /
• 2010

Energy conservation is one of the most important issues for evaluating the performance of wireless sensor network (WSN) applications. Generally speaking, hierarchical clustering protocols such as LEACH, LEACH-C, EEEAC, and BCDCP are more efficient in energy conservation than flat routing protocols. However, these typical protocols still have drawbacks of unequal and high energy depletion in cluster heads (CHs) due to the different transmission distance from each CH to the base station (BS). In order to minimize the energy consumption and increase the network lifetime, we propose a new hierarchical routing protocol, distance aware intelligent clustering protocol (DAIC), with the key concept of dividing the network into tiers and selecting the high energy CHs at the nearest distance from the BS. We have observed that a considerable amount of energy can be conserved by selecting CHs at the nearest distance from the BS. Also, the number of CHs is computed dynamically to avoid the selection of unnecessarily large number of CHs in the network. Our simulation results showed that the proposed DAIC outperforms LEACH and LEACH-C by 63.28% and 36.27% in energy conservation respectively. The distance aware CH selection method adopted in the proposed DAIC protocol can also be adapted to other hierarchical clustering protocols for the higher energy efficiency.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.13 no.5
• /
• pp.1071-1078
• /
• 2018

In this paper, we implemented community driving system for auto-vehicles as a preceding research of drone's community flight. We used ultrasonic sensors in order to measure the distance between vehicles, and designed each vehicles to maintain specific distance to each other, by making the following vehicle to stop moving when the distance is closed to less than 20cm, to start moving when the distance increases to more than 30cm. We have also designed vehicle to accelerate until the distance is closed to 30cm when they are apart for more than 40cm due to contingencies during driving.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.3 no.6
• /
• pp.612-627
• /
• 2009

The high-level contribution of this paper is to illustrate the effectiveness of using graph theory tree traversal algorithms (pre-order, in-order and post-order traversals) to generate the chain of sensor nodes in the classical Power Efficient-Gathering in Sensor Information Systems (PEGASIS) data aggregation protocol for wireless sensor networks. We first construct an undirected minimum-weight spanning tree (ud-MST) on a complete sensor network graph, wherein the weight of each edge is the Euclidean distance between the constituent nodes of the edge. A Breadth-First-Search of the ud-MST, starting with the node located closest to the center of the network, is now conducted to iteratively construct a rooted directed minimum-weight spanning tree (rd-MST). The three tree traversal algorithms are then executed on the rd-MST and the node sequence resulting from each of the traversals is used as the chain of nodes for the PEGASIS protocol. Simulation studies on PEGASIS conducted for both TDMA and CDMA systems illustrate that using the chain of nodes generated from the tree traversal algorithms, the node lifetime can improve as large as by 19%-30% and at the same time, the energy loss per node can be 19%-35% lower than that obtained with the currently used distance-based greedy heuristic.

• Journal of information and communication convergence engineering
• /
• v.8 no.2
• /
• pp.228-233
• /
• 2010

In this paper, the iteration localization algorithm that NLOS signal is iteratively removed to get the exact location in the wireless sensor network is proposed. To evaluate the performance of the proposed algorithm, TDOA location estimation method is used, and readers are located on every 150m intervals with rectangular shape in $300m{\times}300m$ searching field. In that searching field, the error distance is analyzed according to increasing the number of iteration, sub-blink and the estimated sensor node locations which are located in the iteration range. From simulation results, the error distance is diminished according to increasing the number of the sub-blink and iteration with the proposed location estimation algorithm in NLOS environment. Therefore, to get more accurate location information in wireless sensor network in NLOS environments, the proposed location estimation algorithm removing NLOS signal effects through iteration scheme is suitable.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.16 no.6
• /
• pp.153-158
• /
• 2016

Broadcasting in multi-hop wireless sensor networks is a basic operation that supports many applications such as route search, setting up addresses and sending messages from the sink to sensor nodes. The broadcasting using flooding causes problems that can be mentioned as a broadcasting storm such as redundancy, contention and collision. A variety of broadcasting schemes using wireless sensor networks have been proposed to achieve superior performance rather than simple flooding scheme. Broadcasting algorithms in wireless sensor networks can be classified into six subcategories: flooding scheme, probabilistic scheme, counter-based scheme, distance-based scheme, location-based schemes, and neighbor knowledge-based scheme. This study analyzes a simple flooding scheme, probabilistic scheme, counter-based scheme, distance-based scheme, and neighbor knowledge-based scheme, and compares the performance and efficiency of each scheme through network simulation.

• The KIPS Transactions:PartC
• /
• v.14C no.5
• /
• pp.395-402
• /
• 2007

Wireless sensor networks have many sensor nodes which response sudden events in a sensor fields. Some efficient routing protocol is required in a sensor networks with mobile sink node. A data-path template is offered for the data announcement and data request from source node and sink node respectively. Sensed data are transferred from source node to sink node using short-distance calculation. Typical protocols for the wireless networks with mobile sink are TTDD(Two-Tier Data Dissemination) and CBPER(Cluster-Based Power-Efficient Routing). The porposed SPDR(Short-Path Data Routing) protocol in this paper shows more improved energy efficiencies from the result of simulations than the typical protocols.

• Journal of IKEEE
• /
• v.27 no.4
• /
• pp.679-682
• /
• 2023

In wireless sensor networks, communication failure between sensor nodes causes continuous connection attempts, which results in a large power loss. In this paper, an appropriate distance between the CH(Cluster Head) node and the communicating sensor nodes is limited so that a group of clusters of appropriate size is formed on a two-dimensional plane. To equalize the cluster size, sensor nodes in the shortest distance communicate with each other to form member nodes, and clusters are formed by gathering nearby nodes. Based on the proposed cluster uniformity algorithm, the improvement rate of cluster uniformity is shown by simulation results. The proposed method can improve the cluster uniformity of the network by about 30%.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.15 no.5
• /
• pp.133-138
• /
• 2015

In this paper, we propose a method for improving the lifetime of the sensor network SEP through the wireless sensor network divided into two spaces by reducing the transmission distance of the cluster head in the layer in the distance. With reference to the position information of the node, the base station divides the layer based on the midpoint of the nearest node and the furthest distance away from the base station node. And the cluster head in the outer layer far from the base station is transmitted the data to the base station via the cluster head in the inner layer base station to transmit data. That is, we are proposed the layered SEP by reducing the transmission distance of the cluster head in the outer layer for the energy consumption to a minimum. The proposed algorithm is verified by comparison with the existing SEP.

• Journal of Internet Computing and Services
• /
• v.9 no.4
• /
• pp.51-59
• /
• 2008

In wireless sensor networks, one of most common location detection methods that do not require additional devices such as GPS and ultrasonic sensor, is the location detection method based on received signal strength. However, measured received signal strength will fluctuate over time mainly due to physical radio channel characteristics between nodes, which subsequently will cause errors to measured distance between nodes. Since these contaminated distance data are utilized to detect the location of unknown node, there will be accumulated errors in the location of unknown node. In order to overcome the limitation of the location detection method based on received signal strength, we propose a location scheme in which reliability information of distance data as well as distance data between nodes are utilized to estimate the location of unknown node. Through simulation, it is shown that the proposed scheme can accomplish 30% capacity improvement.