Wireless Sensor Network (WSN) Configuration Method to Increase Node Energy Efficiency through Clustering and Location Information

Abstract

Wireless Sensor Network (WSN) technology, for services that are difficult to access or which need to be continuously monitored regardless of location, needs further research and development due to an expansion of fields where it can be applied and due to increases in efficiency. In particular, in the field of defense, research on the latest IT technologies including sensor networks is being actively conducted as an alternative to the risky use of personnel in areas such as surveillance and surveillance reconnaissance. This paper experimented with analyzing the conditions necessary for increasing the energy efficiency of the nodes constituting a sensor network using a clustering routing technique and a location-based routing technique. The derived factors include a method for selecting a cluster head (CH), a method for establishing a path from each channel to a base station (BS), and a method for transmitting collected data. We experimented with the derived factors and proposed a WSN configuration method that increases the energy efficiency of each node by applying optimal results and methods that were verified experimentally.

1. Introduction

Wireless Sensor Network (WSN) technology is suitable for applications that are difficult to access or require continuous monitoring due to geographical and physical factors. Recently, the importance of this technology has been highlighted due to the development of related technologies, an expansion of fields where it can be applied, and increases in efficiency. In particular, various sensor-related technologies based on low power are expanding WSN applications to private sectors, including large-scale manufacturing, defense areas aimed at monitoring, natural disaster response, and social safety nets [1,2,3]. An example of a sensor network use case in the defense field is an unmanned boundary system using Ubiquitous Sensor Network (USN) technology. In this regard, research is being conducted on the Surveillance and Reconnaissance Sensor Network (SRSN) to build an unmanned boundary system [1]. SRSN is a system that applies sensor network technology to transmit sensing information in real-time according to the function of a sensor in the field of surveillance reconnaissance.

The general physical configuration of the sensor network system applied to SRSN consists of a sensor node, base station (BS) or sinkhole, and a database/web server that collects necessary data, as shown in Figure 1. The sensor node performs the function of transmitting data to the BS after obtaining information such as magnetic, acoustic, vibration, and temperature readings [2,3].

The physical configuration of a typical WSN system is as follows: Sensor nodes that transmit data directly to the BS are classified as routers or gateways, and sensor nodes that transmit data to the routers or gateways are classified as end nodes. Sensor nodes corresponding to routers or gateways can reduce transmission and reception of meaningless data by applying a function of integrating the data of end nodes when designing and implementing a routing protocol. Additionally, the BS performs the function of receiving data from the sensor node and transmits it to the database server. Unlike normal sensor nodes, the BS uses constant power, thus it operates without being affected by energy consumption during data transmission and reception. The database/web server analyzes the data received from the BS and derives the desired results from the corresponding service, such as boundary and surveillance reconnaissance information, and performs the function of providing it to the administrator through the web server.

In this study, we propose a method to reduce energy consumption when transmitting/receiving data between sensor nodes and BSs by reflecting the physical structure of the WSN, thereby increasing the lifespan of the nodes and the service life of the entire sensor network.

The composition of this paper is as follows. Section 2 reviews related research that examines routing methods to reduce the energy consumption of sensor nodes. Section 3 proposes routing methods to reduce the energy consumption of sensor nodes. In Section 4, the performance of the proposed method is verified through simulation. Section 5 provides conclusions and future tasks.

2. Related Work

WSN studies can be divided into methods for improving the performance of the WSN system through performance improvement of the sensor node, which is a major component, and methods for improving performance by reducing energy consumption during data transmission/reception, such as through improvements in routing. In this paper, we proposed a method to improve the lifetime of a WSN through improvements in routing. Accordingly, we compare and analyze various proposed routing protocols for a WSN.

WSN routing protocols can be divided into flat-based protocols, hierarchy-based protocols, and location-based protocols. The features of each configuration method have various advantages and disadvantages.

2.1. Flat-Based Protocol

In a flat-based protocol, each sensor node performs the same role and function and also includes the ability to collaborate with neighboring nodes to collect data. Data transmission to the BS exchanges control information with neighboring nodes to establish a transmission path and transmits the data through the established path. Typical protocols using a flat-based protocol include Sensor Protocols for Information via Negotiation (SPIN) [3,4] and Direct Diffusion [4,5,6].

SPIN adopts the concept of metadata and uses a negotiation technique that ensures that only useful data is transmitted when exchanging data between neighboring sensor nodes. This minimizes implosion and overlapping problems that occur in a flat-based protocol when flooding. SPIN has a drawback in that an individual sensor node needs only information about its immediate neighbor node, and if a very simple protocol or destination exists far away and a sensor node in the middle does not request data transmission, it may fail to transmit data to its destination. Figure 2 shows the process of transmitting to neighboring nodes using the above three types of messages when sensor node A collects new data in SPIN.

Direct Diffusion is a data-centric routing protocol that propagates requests using interest inquiries from the BS and sends data through reports from sensor nodes with events matching the interest. In this method, the path from the sensor node to the BS is established by applying an enhancement function of the path generated in the opposite direction to the gradient, which is the propagation path of interest. Therefore, if the requested content of the BS is continuous, it can be used properly because data is transmitted to the route set through route reinforcement. However, if the request is a one-time event, it is difficult to properly apply because it requires continuous interest inquiry and route reinforcement. Figure 3 shows the interest propagation process in the BS and the process of reporting an event to the BS from a sensor node that detects an event matching the interest.

2.2. Hierarchy-Based Protocol

In a hierarchy-based protocol, after dividing the entire network into several groups called clusters, a cluster head (CH) representing an individual cluster is selected, and then the CH transmits data on behalf of the cluster. The CH collects data and receives data collected by general sensor nodes in the cluster, and then performs data aggregation and transmits the data to the BS. Therefore, CH may have problems in terms of energy consumption compared to normal sensor nodes, and resolution requires the ability to change the CH by taking into account the selection of CH, the duration of the CH role, etc., as well as the derivation of the required number of clusters across the entire network and the scope of clusters. Typical examples of hierarchy-based protocols are Low-Energy Adaptive Clustering Hierarchy (LEACH) [7] and Energy-Efficient Uneven Clustering (EEUC) [8].

LEACH is the beginning of a hierarchy-based protocol for WSN, and clusters the entire network to create groups and then selects the CH for each cluster. At this time, the CH manages all sensor nodes in the cluster, and the data transmitted by the sensor nodes are integrated and transmitted to the BS. Therefore, CH consumes more energy than a general sensor node. To address this, a separate CH is selected for each round. When selecting a CH in LEACH, all sensor nodes in the cluster are eligible to be equally selected as CH, which causes all sensor nodes to consume energy evenly. However, a limitation of LEACH is that it does not reflect energy consumption according to the physical location of the sensor node when selecting CH.

Based on the distance between the BS and the sensor nodes, EEUC configures a cluster with a smaller range of clusters located closer to the BS than other clusters. This is because the CH in the cluster close to the BS performs a relay function of data transmitted from the other CH to the BS, so energy consumption is large. However, as shown in Figure 4, EEUC operates smoothly when sensor nodes close to the BS are evenly distributed. There is a disadvantage in this approach in that the energy of the sensor nodes adjacent to the BS is rapidly consumed.

2.3. Location-Based Protocol

A location-based protocol uses the location information of the sensor node and BS to set the transmission path of the collected data. Therefore, a location-based protocol does not require separate energy consumption for path setting or maintenance. Geographic and Energy-Aware Routing (GEAR) [9] is a representative example that can minimize bandwidth consumption.

GEAR is divided into a step that transmits a packet from a BS to a target region and another step to propagate a packet within a target region. When transmitting packets from the BS to the target area, gradual routing is used so that neighboring sensor nodes use energy evenly by applying the concept of learning cost and prediction cost. In the packet propagation stage within the region, a recursive transmission method using location information is applied instead of flooding, which consumes much energy. The recursive transmission technique is a method of dividing a target region into sub-regions and then copying and propagating packets to each sub-region. However, when the density of the sensor node in the target area is low and the communication range of the sensor node does not reach the entire sub-area, packet propagation is performed inside the area using limited flooding, which limits the hop count of packets to 1 or 2.

3. Suggested Techniques

3.1. WSN Operating Process

The proposed WSN routing method simultaneously applies a cluster-based protocol and location-based protocol. Figure 5 shows the detailed configuration and operation process of the WSN. Cluster selection can be preset in a grid pattern due to the introduction of a location-based protocol, and each node collects the cluster information based on the acquired location information and then sets the CH to transmit the collected information to the CH of the cluster. CH integrates this and transmits it to BS, and when transmitting data from CH to BS, a Shortest Path First (SPF) algorithm is applied to minimize energy consumption during long-distance transmission.

3.2. Performance Improvement Considerations for WSN Configuration

In this study, we pre-setup clusters based on location information and obtain cluster information to which the nodes belong to derive factors that affect the performance of WSN, such as shown in

Table 1. WSN performance improvement considerations.

Sortation	Considerations
CH Selection	- Residual energy of sensor node - Position of sensor node (distance from the center of cluster)
Choosing a route between CH and BS	- Energy consumption during direct communication between CH and BS by way of CH

, which include the following considerations.

3.3. Suggested Routing Protocol

The proposed routing protocol suggests the way to minimize energy consumption in an environment where each node acquires physical location and cluster information in advance. In addition, through this method, energy consumption is evenly distributed among nodes to improve network life and ensure smooth operation. The proposed protocol is divided into a CH selection step, a channel selection step between CH and BS, and a collection data transmission step.

3.3.1. CH Selection

The proposed protocol works for each round like LEACH. CH selection for each cluster is selected in consideration of the residual energy of each sensor node and the position of the sensor node derived from the WSN performance improvement considerations of Table 1. Each cluster selects a CH that transmits data to BS every round, and a score function is introduced for CH selection. The conditions of the node to be selected as CH are as follows:

• Nodes with high residual energy.
• Nodes close to the center of the cluster. It is possible to calculate the center of the cluster and the distance of the sensor nodes by using the Global Positioning System (GPS) installed by each sensor node.

The reason for introducing the weight is to determine which of the above conditions should be weighted. The following score function is introduced for this purpose:

$$\mathrm{Score}\left(C{H}_i\right)=\alpha E_i+\left(1-\alpha \right)\frac{1}{D_i^2}$$

(1)

In Equation (1), $E_i$ is the amount of remaining energy of sensor node i in a cluster, $D_i$ is the distance between sensor node i and the center of the cluster, and $\mathsf{\alpha }\left(0\le \mathsf{\alpha }\le 1\right)$ is the weight. By applying Equation (1), the node with the highest score in each cluster is selected as CH. When selecting the CH node, the selection of the weight ($\mathsf{\alpha }$) can affect the performance of the proposed routing protocol, so the optimal weight was selected by performing the following simulation.

Figure 6 shows that the results in a round with 100 nodes are down when weight (α) is 0.8. If 100 nodes go down in the 522nd round, it provides optimal results. Based on this result, this study applied 0.8 to weight (α).

3.3.2. Route Selection between CH and BS

After the CH is selected, a path setting step is required to transmit data to the BS. Transmitting data directly from CH to BS consumes a considerable amount of energy due to the relatively large transmission distance. To solve this problem, the shortest transmission path between CH and BS is selected by applying a Dijkstra algorithm [10]. To this end, the operation process is as follows:

• Nodes selected as CH transmit node location information to BS.
• BS calculates the shortest transmission path between BSs in individual CHs by using the location information of the aggregated CH nodes.
• BS transmits the calculated shortest path (next hop of individual CH) to the corresponding CH.

3.3.3. Collection Data Transmission

The nodes belonging to the cluster transmit the collected data to the CH of the corresponding cluster, and the CH performs the process of collecting and integrating the received data. According to Reference [11], more than 50% of the total energy consumed by WSN occurs during data transmission. Therefore, the process of integrating aggregated data to reduce the amount of data transmitted from CH to BS is recognized as an important function. The CH transmits the integrated data to the BS, and the BS collects the data received from each CH and sends it to the database/web server to perform the service.

4. Performance Evaluation

To evaluate the performance of the proposed routing protocol, we utilized LEACH, a representative routing protocol, and did performance analysis. The performance evaluation criteria considered the number of surviving nodes and the amount of energy consumed by the surviving nodes after each round of transmission.

4.1. Performance Evaluation Environment

The simulation was conducted using C language, and the WSN range was set to 200 × 200, and 16 clusters with a range of 50 × 50 were applied. The sensor node randomly placed 200 nodes, and the BS determined a fixed location to perform performance evaluation. In addition, to reduce the variation in data values caused by random node positioning, the performance evaluation results averaged the values performed in 100 topologies.

Table 2. Performance evaluation environment variables.

Environment Variable	Value
BS (Base Station)	(210, 210)
Number of Nodes	200
Initial energy/node	20 J
$E_{elec}$	50 nJ/bit
$E_{fs}$	7 nJ/bit/${\mathrm{m}}^2$
$E_{amp}$	100 pJ/bit/${\mathrm{m}}^2$
$E_{mp}$	0.0013 pJ/bit/${\mathrm{m}}^2$
Control Data Size	10 Byte (80 bit)
Packet Size	250 Byte (2000 bit)

shows the values of the main variables used in the performance evaluation.

4.2. Protocol Performance Evaluation Result and Analysis

To evaluate the performance of the proposed protocol, the number of surviving nodes per round was compared and analyzed for direct communication, LEACH protocol, and proposed technique. As shown in Figure 7, after performing 200 rounds, 39 nodes, 20% of all nodes, survive. In contrast, in the proposed protocol and LEACH, more than 95% of all nodes survive after 200 rounds. After 400 rounds, the proposed protocol shows that more than 90% of the 181 nodes survived, while for LEACH, 47% of the 94 nodes survived, indicating that the proposed protocol survived by 43% or more compared to LEACH. This is because the proposed protocol up to 400 rounds uses energy more evenly and efficiently at the sensor node compared to LEACH. Surviving nodes are the same number in the proposed protocol and LEACH at 700 rounds, where both measures cannot be significant because only 3% of the nodes survive and cannot perform the services of WSN.

The singularity is that after 700 rounds, the direct communication method survives with more nodes than LEACH or the proposed method. The reason is that as shown in Figure 8, a few sensor nodes located close to the BS do not consume much energy due to the relatively small distance when transmitting data to the BS. However, these are only 4.5% (9) of the surviving sensor nodes, and in this situation, the WSN service cannot be smoothly performed.

Figure 9 shows the average energy consumption of each node per round. After 50 rounds, the proposed protocol consumes 30–40% less energy than the average LEACH per node, and the trend continues, and after 300 rounds, the average consumes more than 30% less energy per node than LEACH. This means that the sensor nodes in the proposed protocol use energy more uniformly and efficiently than LEACH. After 700 rounds, the average energy consumption per node shows near-similar energy consumption in both the proposed protocol and LEACH. At this point, both protocols are alive with only sensor nodes of less than 5% and therefore WSN’s services cannot be performed and cannot be considered. In addition, the proposed protocol consumes 70% to 80% less energy than direct communication per node up to 200 rounds, and the difference gradually becomes smaller. This is because in direct communication, most nodes consume energy in the first 200 rounds, and more than 80% of the nodes afterwards do not work properly.

Figure 10 shows the residual energy distribution of all sensor nodes after 400 rounds of communication by applying the proposed protocol. When a cluster is located closer to the BS, the residual energy of the sensor nodes existing in the cluster decreases. In the proposed protocol, CHs located at a distance from the BS transmit data via a CH adjacent to the BS without transmitting data directly to the BS to reduce energy consumption due to long-distance data transmission. That is, nodes in the cluster adjacent to the BS consume a large amount of energy for relay transmission of data transmitted from the other different CHs to the BS.

5. Conclusions

In this paper, we proposed a method to extend the service life of WSN by improving the uniform energy use in sensor nodes by simultaneously applying the cluster-based protocol and the location-based protocol. The performance of the proposed protocol was evaluated and analyzed through simulation, and the proposed protocol showed improved results in terms of the number of surviving nodes per round and the average energy consumption per node per round compared to the comparative protocol, LEACH. Compared to LEACH, which sequentially selects CH, the proposed protocol selects CH based on the sensor node’s location information and residual energy, so that the energy of each sensor node can be used more evenly and efficiently. In addition, the simulation shows that LEACH sends data directly from all CH to BS, while the proposed protocol reduces energy consumption by allowing CH to pass if there is a CH in the middle of the path to reduce energy consumption when transmitting data from CH to BS.

However, looking at the energy consumption distribution of each node in the proposed protocol, as the distance from the base station increases, the energy consumption of the sensor node adjacent to the base station increases and the energy consumption decreases. This is a phenomenon that occurs when a channel of a clusters adjacent to the base station continuously relays data transmitted by another channel to the base station. To solve this problem, it is necessary to study how to set the optimal number of clusters and cluster range by using the total number of sensor nodes of the WSN and the location information of each sensor node. In addition, the BS’s location-based approach [12] can overcome the limitations revealed by the Restriction Protocol. In future research, we will continue to study two methods, how to determine the number of clusters to be set and how to transmit access depending on the location of the base station.