 Research
 Open Access
 Published:
Research on the energy balance algorithm of WSN based on topology control
EURASIP Journal on Wireless Communications and Networking volume 2018, Article number: 292 (2018)
Abstract
Topology control is a key energysaving technology in the wirelesssensor networking. In this paper, networkingassociated algorithm named local minimum spanning tree (LMST) employed while compromising on energy balance issues, leading to the short lifetime of the network, and proposes an energy balance algorithm. The algorithm fully investigates the energy utilization to link the data communication and the remaining energy of the communication node, to achieve the balanced energy, and to avoid the complexities associated with excessive consumption of energy when the intermediate node acts as a data forwarding task, thus extending the network life cycle. The simulated experimental outcomes showed a great potential of the proposed algorithm that can efficiently prolong the network lifetime and guarantee the longterm reliable operation of the network while ensuring other network performance indicators, such as throughput and delivery rate.
Introduction
As a new type of network information acquisition system, wireless sensor networks have extremely broad application prospects in civilian and military fields. It has the characteristics of huge scale selforganized, random distribution, and multifaceted circumstances with just few sensor node resources and frequent network topology changes [1]. This depicts the significance of controlling topology in the field of wireless sensor network. The research of controlling topology is to improve the life of the network life as the main target and with the foundation of ensuring the communication degree and coverage of the network, taking into account the communication interference, network delay, load balancing, simplicity, reliability, scalability, and so on, thus forming an optimized network topology [2]. Currently, several classification methods to control the topology algorithms, which are subdivided into two algorithms such as “global topology control” algorithms and “distributed topology control” according to whether the algorithm needs global network information or local network information.
The “global topology control” is an algorithm that performs topology modification according to the worldwide topology statistics, performs network topology structure work on a particular node, and serves as algorithms named “relative neighborhood graph” (RNG) [3], “minimum spanning tree” (MST), connect algorithm [4], and so on. While the other algorithm called “distributed topology control” links the local statistics to maintain the association of the network, such as “local information no topology (LINT) algorithm [4] distributed relative neighborhood graph (distRNG) algorithm [5], LMSTtype algorithm [6], and mobile grid algorithm [7].
Because the wireless sensor network belongs to a distributed network, there is no central node in the network, and it is not suitable to use a global topology control algorithm. In document [6], a popular control topologybased “local minimum spanning tree” (LMST) has been proposed. It has a common purpose which is to control power on adjacent graph. This algorithm mainly contains each node that computes by the minimum spanning tree method according to the locally associated topology, which can successfully reduce the global communication energy utilization. However, the network topology constructed by local spanning tree algorithm has little connectivity and very less noisy link. Moreover, the algorithm does not include the issues of balance energy. The middle node of the whole network communication link beside the sinknode controlling the task of accelerating a large amount of information. While the larger load increases the energy losses greater than the leaf node, and any middlenode is invalid, that will ultimately lead to network topology interruption. As a result, network connectivity is affected and network lifetime is shortened. Therefore, concerning the solution of energy balance complications, this research work aims to propose an LMST algorithm grounded on energy stability. In the construction of the topology, the energy utilization because of nodes communications and the remaining energy for communication nodes are comprehensively considered. Because the middlenode consumes more energy for sending information packets. The other leaf nodes are not accountable for information packets forwarding by minimizing energy utilization. As the service time increases, it leads to gradual increase of link weight among the middle node and supplementary nodes, and the intermediate node may become a leaf node, and it is no longer responsible for the data forwarding work and saves energy.
Energybalanced network topology control algorithm
LMST algorithm
LMST algorithm [8,9,10] is a typical control algorithm grounded on neighborhood graph. Such type of graph control algorithm sets the topology graph G formed when all the nodes transmit using the maximum transmit power. According to a certain neighbor judgment condition q, the neighboring graph G’ of the graph is obtained. Finally, each node in G’ determines the transmit power by its nearest communication node. The main algorithms include RNG, MST, LMST, and so on. The LMST algorithm [11,12,13,14] is to send Hello packets to any node in the plane with the maximum statement radius d_{max}, accumulate all the info from closer nodes, and starts greedy algorithm to construct the local minimum spanning tree which takes itself as the root node.
The communication power of the node is set, and the communication radius is adjusted to reach all the onehop neighbors on its LMST to attain the goal of evaluating the total energy consumption by local minimum communication. The system is in fact a distributed approximate optimal implementation of the global minimum spanning tree algorithm. By adjusting the locally independent minimum spanning tree, the local minimum spanning tree algorithm can recognize the double connectivity of the topology, and it successfully lessen the transmit power of maintaining the comprehensive global connection and improve the collision of the MAClayer. Furthermore, this algorithm constructs the local accumulated informationbased topology to minimize the number of interactive packets and the time delay required. This local topology repair can be carried out in a definite direction to the node movement problem. Compared with other neighbor graph methods (such as UDG), it reduces energy consumption, contains fewer links, reduces interference in the network, and improves performance provided in Fig. 1.
Although the LMST type algorithm constructs a network topology efficiently by locally minimum total energy consumption, ignoring the problem of energy balance. The middle node bears too much load in the network, which consumes a lot of energy and easily leads to poor network connectivity.
Network model
There are some assumptions included in this article such as (1) every node has uniform maximum transmit power capability, that includes a section having a radius of d_{max}, and can modify that radius by regulating the transmit power. (2) Each node has the same preliminary energy, and the position info can be acquired through localization algorithm. (3) A relationship between energy utilization and communication gap in wireless communication is [15, 16]:
Where E = consumed energy, k = a constant associated with the working system, d = communication gap, and C = working system constant and its value is taken as “0.” Here, n has a value of 3. That is, energy consumption for communication is related to the third power of communication space.
Furthermore, LMST algorithm based on energy balance considers the remaining energy of the communication node while taking into account the node communication energy consumption. Therefore, the algorithm link weight [17, 18] is
Where k_{1} + k_{2} = 1, and d (r, t) = space between the transferring node and accepting nodes, E_{0} = the node’s initial energy, E_{t} = remaining energy of the transferring node. E_{r} = remaining energy of the accepting node; k_{1} and k_{2} are variable parameters. However, if the remaining energy of two nodes after transferring or accepting is high, the weight of link parameter (R) becomes lower. While if the remaining energy of nodes is lower, the weight (R) value becomes relatively high and the intermediate node is less likely to be responsible for the task of data forwarding, which saves its own energy and prolongs the life of the node. The whole network gradually reaches the state of energy balance during operation.
Description of network topology control algorithm based on energy balance
This algorithm takes balancing energy consumption as the goal. When the topology is constructed, the energy utilization and the remaining energy of the nodes for communication are considered, and the effect of energy balance is achieved [19, 20].

(1)
Collect node information. The node “u” periodically transmits a Hello packet to other node in the valid range at the d_{max}, and the subsequent acceptor node feeds back the response packet to the sender node u, so that the node u can acquire the response of all the nodes in its visible neighboring area NVu(G).

(2)
Constructing topology graph. The node u works on the basis of the greedy algorithm to obtain the LMST in perspective of the visible neighbor node information and calculates the link weight coefficient R according to the formula (2). With the increase of service time, the gradual increase of weight between the intermediate node and other neighbor nodes has been observed, and there is a greater probability in topology construction from intermediate node to leaf node, which is no longer responsible for data forwarding and saves energy.

(3)
Determine the transmit power. Based on the determined structure of the LMST, the node u determines its own transmit power and regulates the communication radius d_{max} to grasp all onehop neighbors.

(4)
Bidirectional processing. The node u directs a check packet for whole onehop neighbors in the tree and waits for receiving the response packet from the neighbor node. After the timelag, the received response packet defines a link between the node u and neighbor node is bidirectional. If not, the edge is deleted.

(5)
Broadcast topology. The node u broadcasts its own reasonable neighbor node, and the advised node stores information into the data construction Info_Root Node, marking the considered node as the reasonable neighbor node of the node u and receiving the information packet from the u. After accepting a data packet by each node, it requires to examine the Info_Root Node to determine the receiving of the data packet. If it cannot be received, it is discarded.

(6)
Reconstruct the topology. Due to energy consumed by the node or may be dead node, every network node needs to operate the algorithm periodically, to perform topology reconstruction based on the existing visible information by the neighbor node, to obtain a new LMST, and to determine the transmit power.
Simulation experiment
This paper uses software “Atarrays” to simulate the LMST algorithm to evaluate the performance of the employed algorithm from the network lifetime, throughput, delivery rate, and other related performance indicators. The network lifetime is less than 60% of the duration until the dead node, and the throughput is the ratio of the amount of data received by the end node to the time used. While the delivery rate refers to the percentage of the packets received and sent by the end node. Table 1 shows the setting of relevant input parameters used for simulation experiments.
Simulation analysis
Experiment 1 compares the network lifetime of wireless sensor networks under the two algorithms. In Fig. 2, the node failure under the LMST algorithm is fast, and the node failure starts at about 123 s. The effective node number decreases to less than 60% at about 220 s. In this algorithm, the node can work for a long time, the node failure occurs at about 180 s, and the effective number of nodes decreases to less than 60% at about 280 s. In this thorough network lifetime, the effective nodes used in this algorithm are more than the number of effective nodes under the LMST algorithm.
Experiment 2 compares the throughput under the two algorithms. Because the number of packets sent is evaluated by the number of effective nodes, it can be perceived from Fig. 3 that when the time is 120 s, the number of packets under the LMST algorithm has a significant decline, and the drop speed of the number of packets is faster than that of the algorithm in this paper. There are more effective node points in this algorithm than in the LMST algorithm in the lifetime of whole network.
Experiment 3 compares the delivery rate of network nodes under the two algorithms. As shown in Fig. 4, the delivery rate curve under the two algorithms is basically similar, but after 80 s, the drop speed of delivery rate curve based on LMST algorithm is much faster than that of original algorithm. The smaller the delivery rate of network nodes is, the more data packets are lost. In the later stage of the operation, the delivery rate under both algorithms decreased significantly because the number of effective nodes decreased.
Conclusion
The LMST algorithm can excellently construct a network topology employing local minimum total energy consumption, but the algorithm ignores the problematic energy balance. The intermediate node bears too much load in the network, which consumes a lot of energy and easily leads to poor network connectivity. This algorithm fully ponders the energy consumed by the communication link of the provided data and the remaining energy of the communication node to attain the outcome of energy balance, avoiding the complexities of excessive energy consumed, while the intermediate node acts as a data forwarding task, thereby extending the life cycle of the whole network. The simulation experiment illustrated that the proposed algorithm will effectively elongate the life span of the network and guarantee the longterm reliable operation of the network while ensuring other network performance indicators, such as throughput and delivery rate.
Abbreviations
 LINT:

Local Information No Topology
 LMTS:

Local minimum spanning tree algorithm
 MAC:

Media access control
 MST:

Minimum spanning tree
 RNG:

Relative neighborhood graph algorithm
 UDG:

Unit disk graph
References
 1.
I.F. Akyildiz, W. Su, Y. Sankarasubramanias, et al., A survey on sensor networks[J]. IEEE Commun. Mag. 40(8), 102–114 (2002).
 2.
X. Zhang, S.L. Lu, G.H. Chen, et al., Topology control of wireless sensor networks[J]. Journal of Software 18(4), 943–954 (2007).
 3.
J.A.R.O.M.C.Z.Y.K. JW, T.O.U.S.S.A.I.N.T. GT, The relative neighbourhood graphs and their relatives[C]//Proceedings of the IEEE. [S.l.]: IEEE (1992).
 4.
R. RAMANATHAN, R. ROSALESHAIN, Topology control of multihop wireless networks using transmit power adjustment[C]//Proc of IEEE INFOCOM. [S.l.]: IEEE (2000).
 5.
B.O.R.B.A.S.H. SA, J.E.N.N.I.N.G.S. EH, Distributed topology control algorithm for multihop wireless networks[C]//Proc 2002 World Congress on Computational Intelligence. [S.l.]: [s.n.] (2002), pp. 355–360.
 6.
L.I. Ning, H.O.U. JC, L. SHA, Design and analysis of an MSTbased topology control algorithm[C]//Proc of TwentySecond Annual Joint Conference of the IEEE Computer and Communications Societies (INFORCOM 2003) (IEEE Press, Sanfrancisco, CA, 2003), pp. 1702–1712.
 7.
J. LIU, B. LI, Mobile grid: Capacityaware topology control in mobile Adhoc networks[C]//Proceedings of the 11th International Conference on Computer Communications and Networks. [S.l.]: [s.n.] (2002), pp. 570–574.
 8.
H.A.N. Hongquan, Z.H.U. Hongsong, M.E.N.G. Jun, The wireless sensor network[J]. Applications of the Computer Systems 8(2), 16–19 (2005).
 9.
J. DENG, Y.S. HAN, W.B. HEINZELMAN, et al., Scheduling sleeping nodes in high density clusterbased sensor networks[J]. ACM/Kluwer Mobile Networks and Applications (MONET) 10(6), 825–835 (2005).
 10.
O. Younis, F.S. Heed, A hybrid,energyefficient, distributed clustering approach for ad hoc sensor networks[ J]. IEEE Transactions on Mobile Computing 3(4), 660–669 (2004).
 11.
Y. Xu, J. Heidemann, D. Estrin, Geographyinformed energy conservation for ad hoc routing[C]∥ Rose C,ed.Proceedings of the ACM International Conference on Mobile Computing and Net working(MobiCom) (ACM Press, New York, 2001), pp. 70–84.
 12.
B. Deb, S. Bhatnagar, B. Nath, A topology discovery algorithm for sensor networks with applications to network management[ R].DCSTR441 (Department of Computer Science, Rutgers University, 2001).
 13.
W. Zhang, P. Passow, E. Jovanov, R. Stoll, K. Thurow, A secure and scalable telemonitoring system using ultralowenergy wireless sensor interface for longterm monitoring in life science applications, 2013 IEEE International Conference on Automation Science and Engineering. CASE 2013, 617622 (2013).
 14.
G.L. Xing, C.Y. Lu, Y. Zhang, et al., in Proceedings of the ACM International Symposium on Mobile Ad Hoc Networking and Computing(MobiHoc), ed. by P. R. Kumar, A. T. Campbell, R. Wattenhofer. Minimum power configuration in wireless sensor networks[ C]∥ (ACM Press, New York, 2005), pp. 390–401.
 15.
Y.E. Chi, S.U.N. Limin, L.I.A.O. Yong, Overview of energy management in sensor networks[J]. Computer Engineer and Application 40(8), 196–198 (2004).
 16.
V. Kawadia, Protocols and architecture for wireless ad hoc networks[D].University of Illinois at UrbanaChampaign (2004).
 17.
B. Chen, K. Jamieson, H. Balakrishnan, et al., SPAN:An energy efficient coordination algorithm for topology maintenance in adhoc wireless networks[ J]. ACM Wirel Netw 8(5), 481–494 (2002).
 18.
S. Kumar, T.H. Lai, J. Balogh, in Proceedings of the ACM International Conference on Mobile Computing and Networking (MobiCom), ed. by Z. J. Haas. On kcoverage in a mostly sleeping sensor network[C] (ACM Press, New York, 2004), pp. 144–158.
 19.
N. Li, J.C. Hou, Topology control in heterogeneous wireless networks:Problems and solutions[ C]∥ proceedings of the IEEE conference on computer communications(INFOCOM) (IEEE Press, New York, 2004), pp. 232–243.
 20.
P. Santi, Topology control in wireless ad hoc and sensor networks[J]. ACM Comput. Surv. 37(2), 164–194 (2005).
Funding
This work was supported by the National Natural Science Foundation of China (61662045, 61762045) and the Special Program of talents Development for Excellent Youth Scholars in Tianjin.
Availability of data and materials
The materials and data are true and reliable in this paper.
Author information
Author notes
Affiliations
Contributions
TQ (550533905@qq.com) is the corresponding author. WZ and YH conceived the proposed scheme. WZ and MW conducted the detailed derivation of the proposed algorithm and carried out most of the experiments and data analysis. MK carried out some parts of the experiments and data analysis. MW helped to improve the experimental simulation. All authors have read and approved the final manuscript.
Corresponding author
Correspondence to Taorong Qiu.
Ethics declarations
Competing interests
The authors declare that they have no competing interests.
Publisher’s Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Open Access This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.
About this article
Received
Accepted
Published
DOI
Keywords
 Energy balance
 Topology control
 Wireless sensor network
 CLC: TP918.91