main-content

Weitere Artikel dieser Ausgabe durch Wischen aufrufen

01.12.2016 | Research | Ausgabe 1/2016 Open Access

Wireless sensor network node optimal coverage based on improved genetic algorithm and binary ant colony algorithm

Zeitschrift:
EURASIP Journal on Wireless Communications and Networking > Ausgabe 1/2016
Autoren:
Jingwen Tian, Meijuan Gao, Guangshuang Ge
Wichtige Hinweise

Competing interests

The authors declare that they have no competing interests.

1 Introduction

A wireless sensor network is made up of a large number of sensor nodes which possess perceptual ability, calculation of capacity, and communication ability with self-organizing style. Sensor nodes complete the data collection and transmission together. It has wide application such as battlefield surveillance, environmental protection, intelligent home furnishing, and so on [16]. However, sensor nodes usually adopt limited-capacity battery to provide energy due to the limit of volume and cost. The energy cannot regenerate or supply. So the coverage and energy consumption are the key problems of wireless sensor network research.
At present, many scholars have done a lot of research for the node location and coverage optimization algorithm in wireless sensor network, and some feasible and effective algorithms were proposed such as Huang algorithm [7], TianD algorithm [8], CCP algorithm [9], and so on [1012]. Chi-Fu Huang and Yu-Chee Tseng proposed a polynomial time algorithm (polynomial-time algorithms) in the literature [4]; in the sensor network, it is a distributed protocol method, which has positioning capabilities, environmental monitoring capability, and fault tolerant capability. Liang Ying, Zeng Peng, and Yu Haibin, in reference [7], proposed using adaptive cluster head communication (cluster-heads communication) method. The method can ensure that energy consumption is balanced in the whole network and can improve the network life cycle. Mihaela Cardei and Ding-Zhu Du, in the literature [8], proposed a rule and method to establish a “maximum disjoint set cover problem.” The method is that nodes which are included in the maximum disjoint coverage area are at work, while other nodes are in a dormant state, which saves the system energy and prolongs the network life cycle. Jia Jie, Chen Jian, Chang Guiran, Zhao Linliang, and Wang Guangxing, in the literature [11], put forward the two based on weighted genetic algorithm and constraint genetic algorithm-based optimization coverage mechanism. According to generated fitness function to do genetic algorithm operation and calculate the sensor network, full coverage region is required for the approximation of the optimal set of nodes and complete working node selection, thereby reducing the redundant network and prolonging the survival time of the network. Xu et al. [1317] proposed a crowdsourcing-based framework for processing mobile network data. Joon-Min Gil and Youn-Hee Han, in the literature [10], proposed a goal based on genetic algorithm coverage scheduling scheme, using evolutionary global search techniques for monitoring all targets and that can find the optimal coverage set, prolonging the network life cycle. Mohamed Aadhil M. and Roselin M.E.J., in the literature [12], using the genetic algorithm to optimize the node placement method, the method can achieve the purpose of optimizing the node coverage.
However, these algorithms have some limitations. The complexity of Huang algorithm is too high, and it could easily lead to the blockage of the channel when the communication data is large. The computing complexity and communication complexity of the TianD algorithm are lower, but there are two problems: first, inability to make the redundant nodes of monitoring area boundary dormant and second, without consideration of the overlap between node coverage areas, which led to elected excessive working nodes, thus affecting the lifetime of the network. CCP algorithm is not suitable for high-density sensor networks.
Based on the above issues and the special predominance of genetic algorithm and ant colony algorithm possess, a WSN node optimal coverage method based on improved genetic algorithm and binary ant colony algorithm is proposed in this paper, based on the location information of the nodes to build node coverage optimization model and then using the improved genetic algorithm and binary ant colony algorithm to solve the optimization model. The optimal solution is used as the working nodes of wireless sensor networks, the remaining nodes sleep to save energy. The simulation results show that this algorithm proposed in this paper effectively improves the coverage rate of the wireless sensor network.

2 Wireless sensor network coverage optimization

2.1 Wireless sensor network coverage

The network coverage is the basic problem of the construction of wireless sensor networks. The network coverage needs to reach the maximum under the conditions that guarantee a certain quality of service (QoS) [1821], by measuring the network coverage to determine whether the presence of communication blind area and get the monitoring area of wireless sensor network coverage. The sensor node distribution can be adjusted or sensor nodes can be added according to the measurement condition. In addition, by changing the density of the network coverage, the more sensor nodes were deployed in some important areas in order to guarantee the reliability of measured data. Therefore, the network coverage is not only for communication coverage and monitoring area coverage but also for better meeting of the needs of certain applications. Generally speaking, quality of service is the measure of wireless sensor network coverage [22].
The wireless sensor network coverage is mainly divided into certainty coverage and the random covering. For the certainty coverage, the coverage area size is determined in order to cover the area using the minimum number of sensors. The certainty coverage is adopted to deploy the sensor nodes of a known region in this paper.
At present, a kind of widely used strategy is choosing part nodes which can be enough to cover the monitoring area as working nodes, at the same time, turn off redundant nodes [23]. A certain number of sensor nodes are deployed in the monitoring area, under the ensuring network connectivity in normal condition, letting part of the redundant nodes into low-power sleep state, while the rest of the active node is used to cover the whole region in the most likely small amount, which form the optimal coverage node set. In the wireless sensor network, the node number in the increased network not only means increased cost but also brings the limited bandwidth congestion because of the inter-node communication conflict. The optimal coverage node set is the minimum node set which does not affect the entire network coverage. This way does not only reduce potential conflicts in a wireless channel and reduce the possibility of competing for access to the media but also save energy in order to prolong the network lifetime [11].

2.2 Wireless sensor network optimization coverage model

Supposed that the target monitoring area A is a two-dimensional plane, and it will be divided into m × n grid, and each grid area is 1. The N sensor nodes are randomly distributed in the A, the sensor node set S can be expressed as S = (s 1s 2 , ⋯, s i  , ⋯, s N  ). The (x i , y i ) is the coordinate of sensor node s i in a target monitoring area A, each node coordinate is known, and effective perception radii are rand s i  = {x i  , y i  , r}. Perception range of node s i is a circular region with the coordinates (x i  , y i ) of node s i as the center and the r as the perception radius, to express with c i  = {p ∈ A|d(p, (x i , y i )) ≤ ri ∈ [1, N]}, where, p is an arbitrary point of area A, and d is the Euclidean distance. The perception range of the whole sensor network is C = ∪  i ∈ [1, N] c i , that all network nodes perceptual range are in union.
There is m × n target point. (a 1a 2, ⋯, a j , ⋯ a m × n  ) need to be monitored or sensed in target monitoring area A; suppose a j is s i perception then d( a j , s i  ) ≤ r; an arbitrary point of monitoring area A is at least perceived by a sensor node. Assume the communication range of sensor node s i is a circle with the coordinates (x i  , y i ) of node s i as the center and the r c as the radius; if d(s i  , s j ) ≤ r c , then the sensor node s i and s j can communicate directly.
Definition 1: given a sensor node set S, the communication network G = (VE) , { V = SL(s i , s j ) ∈ E} composed of S is an undirected graph, if there is a communication path between any two nodes in the communication diagram G derived from S then the communication diagram is connected, when d(s i  , s j ) ≤ r c .
Definition 2: for the sensor node set S and the target monitoring area A; if every point of A is perceived by a sensor node of S then the S is a covering set of A. If the communication diagram derived from S is connected then the S is a connected cover set of A.
Definition 3: for the connected cover set S and the target monitoring area A, the minimal connected cover set is looking for a minimal subset S′ ⊆ S, while the monitoring area A is covered by S′ completely and the communication diagram derived from S′ is connected.
On the basis of energy efficiency, this paper presents optimization goal of a connectivity covering set: ensuring that each target point in A is at least covered by a sensor node, at the same time, ensuring that a subset is a connected set.
In order to ensure connectivity, the communication radius r c is at least two times perception radius r, namely r c  ≥ 2 r. On this condition, the researchers only need to consider the coverage problem in the sensor network, if the network is covered then it is connected [24].
Let P cov(x, y, s i ) represent the probability that any point (x, y) of monitoring area A is covered by sensor node s i (x i , y i ) then
$${P}_{\mathrm{cov}}\left(x,y,{s}_i\right)=\Big\{\begin{array}{l}1,\kern1.3em {\left(x-{x}_i\right)}^2+{\left(y-{y}_i\right)}^2\le {r}^2\\ {}\kern0.2em 0,\kern1.2em \mathrm{else}\end{array}\kern0.4em \operatorname{}$$
(1)
As long as there is a sensor node, s i covers the monitoring point (x, y) then the monitoring point (x, y) is covered by the sensor node set S. So the regional coverage area of sensor node set k is expressed as follows:
$${A}_{\mathrm{area}}(S)={\displaystyle \sum_{x=1}^m{\displaystyle \sum_{y=1}^n{P}_{\mathrm{cov}}}}\left(x,y,S\right)\kern0.2em \varDelta x\kern0.2em \varDelta y$$
(2)
The area of monitoring area is A s , the working sensor node set is S′, the target function of network coverage of working node set is as follows:
$${f}_1\left({S}^{\prime}\right)={A}_{\mathrm{area}}\left({S}^{\prime}\right)/{A}_s$$
(3)
where A area(S′) is the cover area of working sensor node set S′.
The target function of nodes utilization rate is as follows:
$${f}_2\left({S}^{\prime}\right)=\kern0.3em \left|{S}^{\prime}\right|/N$$
(4)
where N is the total number of sensor nodes, |S′| is the number of working sensor nodes.
The aims of wireless sensor network node optimal coverage are to reduce the sensor node’s utilization and to ensure maximum network coverage at the same time, this is a multi-objective optimization problem. So the multi-objective optimization coverage model of wireless sensor network is expressed as follows:
$$\max \kern0.2em f\left({S}^{\prime}\right)= \max \kern0.1em \left({f}_1\left({S}^{\prime}\right),\kern0.4em 1-{f}_2\kern0.1em \left({S}^{\prime}\right)\kern0.2em \right)$$
(5)

3 Improved genetic algorithm and binary ant colony algorithm

3.1 Genetic algorithm

The genetic algorithm (GA) is a kind of self-adapting heuristic global search algorithm which was derived from imitating the thought of natural biological evolution. In nature, it is a cycle process made up of reproduction-crossover-mutation operators. In the process of searching for the global optimum solution, GA needs neither the information of gradient nor the calculus computing, it can find out the global optimum solution or near-optimal solution in the solution space with high probability only by operating the reproduction-crossover-mutation operators; thereby, it could reduce the probability of getting into the local minimum efficiently.
Adaptive genetic algorithm (AGA) is a kind of GA that has scale reproduction and self-adaptive crossover and mutation operations. In the process of searching for the optimum parameter, AGA changes the crossover probability and mutation probability adaptively according to the different conditions of individuals in order to keep the diversity of colony and prevent the premature convergence; further, it can enhance the calculating speed and precision of the algorithm.
$${P}_c=\Big\{\begin{array}{l}{k}_1\left({f}_{\max }-{f}^{\prime}\right)/\left({f}_{\max }-{f}_{\mathrm{avg}}\right)\kern2.5em if\kern1em {f}^{\prime }>{f}_{\mathrm{avg}}\\ {}{k}_3\kern12.10001em if\kern1em {f}^{\prime }<{f}_{\mathrm{avg}}\end{array}\operatorname{}$$
(6)
$${P}_m=\Big\{\begin{array}{l}{k}_2\left({f}_{\max }-f\right)/\left({f}_{\max }-{f}_{\mathrm{avg}}\right)\kern2.5em if\kern1em f>{f}_{\mathrm{avg}}\\ {}{k}_4\kern11.90001em if\kern1em f<{f}_{\mathrm{avg}}\end{array}\operatorname{}$$
(7)
where P c is exchanging probability, P m is mutation probability, f max is the biggest fitness of colony, f avg is the average fitness of colony, f′ is the bigger fitness of two strings used for crossover, f is the fitness of the individual to mutate.

3.2 Binary ant colony algorithm

The ant colony algorithm is a kind of new simulated evolutionary algorithm. Ants will release a peculiar pheromone in its path when they are searching for food, which make other ants feel the kind of peculiarity and tend towards the direction of high density [25]. Ant colony algorithm converge the optimal path through the accumulation and update of pheromone and achieve optimization through the appropriate times of iteration.
The binary ant colony algorithm denotes the parameters directly with binary-coding; thus, it can take up less storage space and reduce the complexity of the algorithm compared to decimal-coding. Moreover, the traversal search capability of binary-coding is better than that of decimal-coding.
Definition of the directed graph G = (VR), the vertex set V is: $$\begin{array}{l}\Big\{{v}_0\left({c}_s\right),\kern0.4em {v}_1\left({c}_N^0\right),\kern0.2em {v}_2\left({c}_N^1\right),\kern0.2em {v}_3\left({c}_{N-1}^0\right),\kern0.2em {v}_4\left({c}_{N-1}^1\right)\kern0.2em ,\cdots, \kern0.2em \\ {}{v}_{2N-3}\left({c}_2^0\right),\kern0.2em {v}_{2N-2}\left({c}_2^1\right),\kern0.2em {v}_{2N-1}\left({c}_1^0\right),\kern0.2em {v}_{2N}\left({c}_1^1\right)\Big\},\end{array}$$ where c s is the start vertex, $${c}_j^0\kern0.1em ,\kern0.3em {c}_j^1$$, respectively, stand for the 0 and 1 states of bit b j in binary-coding. For all vertex, when j = 2, 3, ⋯, N, there are only two directed arcs which point to $${c}_{j-1}^0$$ and $${c}_{j-1}^1$$, these two directed arcs respectively stand for the 0 and 1 states of each ant next step allowed, the N is the binary encoding length, this binary ant colony network is shown in Fig. 1. Each ant travels their own path and then get the solution of the problem by integrating each ant’s traversal solution [2631].
At the start, the information quantity of each path is equal, suppose τ i,j (0) = C (C is a constant), Δτ i,j  = 0 (i, j = 1, 2, ⋯, N). In the process of movement, the k (k = 1, 2, ⋯, M) ant determines the movement direction according to the information quantity of each path, and the movable probability is
$${p}_{i,j}^k=\left({\tau}_{i,j}^{\alpha }(t)\cdot {\eta}_{i,j}^{\beta }(t)\kern0.1em \right)/\left({\displaystyle \sum_{s\in {\mathrm{allowed}}_k}{\tau}_{i,s}^{\alpha }}(t)\cdot {\eta}_{i,s}^{\beta }(t)\kern0.1em \right)$$
(8)
where m is the number of ants, $${p}_{i,j}^k$$ is the probability that the k ant moves from the i position to the j position at the t moment. α (α ≥ 0) is the relative importance of a moving path. β (β ≥ 0) is the relative importance of visibility. τ i,j is the residual information amount in the i j connection at the t moment. η i,j is the visibility in the i j connection. allowed k  = {0, 1} is the next select status.
With the passage of time, the leaving information gradually disappear. ρ (0 ≤ ρ ≤ 1) is persistence of a moving path. 1 − ρ is the information loss degree. After n moment, the ant completes one cycle. The τ i,j is renewed as follows:
$${\tau}_{i,j}\left(t+1\right)=\rho \cdot \kern0.3em {\tau}_{i,j}(t)+\varDelta {\tau}_{i,j}$$
(9)
where Δτ i,j  = 1/f best(S), f best(S) is the iteration-best solution or global best solution, which can enhance the optimizing ability and improve the speed of solution.
Compared with the traditional ant colony algorithm, the biggest difference of binary ant colony algorithm is the ant’s path selection. The states of binary ant colony algorithm only have 0 and 1, the ant does not need to remember those nodes which have traveled, it selects only on the basis of prior to the two path pheromones. The traverse path in the binary ant colony algorithm is shown in Fig. 2.

3.3 Improved genetic algorithm and binary ant colony algorithm

The improved genetic algorithm and binary ant colony algorithm introduce a genetic operator into the binary ant colony algorithm, using the crossover and mutation operations to expand the search space and enhance the global property of solutions [26, 32]. The solution is formed by the binary ant colony algorithm as an initial population of genetic algorithm then a better solution is searched by iterative evolution. Thus, it can enhance the convergence speed of algorithm, improve efficiency for solution, and avoid the local optimal and precocious defects [32].
Randomly generated initial solution executes multiple evolutionary using the reproduction-crossover-mutation operators of genetic algorithm and, at the same time, using the solution obtained by genetic algorithm to initialize the information pheromones of a network. If the loop end conditions are met, then the algorithm ends; else, the researchers execute the ants’ traverse and pheromone update and reserve the optimal solution, execute the reproduction-crossover-mutation operation to the obtained solution set and reserve the optimal solution, and use the optimal update pheromone and determine whether the end condition is met.
The algorithm flow is shown in Fig. 3.

4 Wireless sensor networks nodes optimal coverage based on IGA-BACA

The wireless sensor network node optimal coverage is a typical multi-objective optimization problem, this problem can be expressed as follows: existing sensor set S = (s 1s 2 , ⋯, s i  , ⋯, s N  ), seeking the working set S′, which can obtain the maximum network coverage rate, and the minimum working node set. When the maximum network coverage rate is selected as the optimal objective, network sensor nodes with hexagon structure distributed in the monitoring area, the minimum working nodes set can be obtained [33].
From formula (5), we know that the maximum network coverage f 1(S′) and minimum working nodes set f 2(S′) are contradictory; compromising the two, the multi-objective optimization coverage model of wireless sensor network is changed into the maximum objective function f(S′).
$$f\left({S}^{\prime}\right)=\left({f}_1\left({S}^{\prime}\right)\cdot {f}_1\left({S}^{\prime}\right)\kern0.2em \right)/{f}_2\left({S}^{\prime}\right)$$
(10)
The algorithm implementation of wireless sensor network node optimal coverage based on improved genetic algorithm and binary ant colony algorithm is as follows [3439].

4.1 Code

It is a key problem to complete the mapping from the solution space of optimization problem to the coding space. Aiming at the random distribution nodes, the control vector (individual) L = (l 1l 2, ⋯, l i , ⋯, l N ) of wireless sensor node is expressed in a binary coded form, which stands for the position of all sensor nodes in the target monitoring area A, where the l i value is 1 or 0, which separately correspond to the active or sleep of the i sensor node. The selection of nodes and the gene of chromosome is one to one correspondence.

4.2 Initial solution and adaptation function

At random initialization, ten sensor nodes randomly distribute in the target monitoring area A, where the nodes of 1, 2, 3, 5, 7, 8, 10, 11, 12, 15 are working nodes and then the corresponding individual is { 1 1 1 0 1 0 1 1 0 1 1 1 0 0 1 }, this is shown in Fig. 4. A large number of individuals will be generated in the initialization phase, which is called a colony.
Use the formula (10) as the adaptation function, the higher is the adaptation function value, the higher is the selected probability of individual.

4.3 Operation operator

The operation operator of genetic algorithm and binary ant colony algorithm is composed of four operators that is reproduction operator, crossover operator, mutation operator, and pheromone update operator.
The reproduction operator reproduces the individuals to the new colony according to the probability in proportion as their adaptive value. After reproduction, the preponderant individuals are preserved and the inferior individuals are weeded out, and the average fitness degree of the colony is increased, but the variety of colony is lost at the same time. The action of reproducing an operator is to realize the principle of winner priority for preserving predominance and natural selection and making the colony converge on the optimum solution.
The crossover operator first selects two individuals stochastically according to the certain adaptive exchanging probability P c then it can produce two new individuals by exchanging parts of chromogene stochastically. The two-point crossover is adopted in this paper, randomly generating two crossover points is shown in Fig. 5. The genetic algorithm can generate filial generation colony which have higher average fitness and better individuals through the reproduction and crossover operators and can make the evolutionary process proceed to the optimum solution.
The mutation operator changes several bits of the chromosome string stochastically with a small probability P m , namely turning 0 to 1 and 1 to 0. The mutation operator is very important to recoup the loss of colony diversity.
The pheromone update operator (T g ) is a mapping of pheromone update for optimal individual which is selected from an ant sequence. According to the Max-Min rule, pheromone only be released in the path of optimal solution ant traverse, namely Δτ i,j  = 1/f best(S), f best(S) is the iteration-best solution or global best solution. The probability of pheromone update operator is shown as follows:
$$P\left\{{T}_g={x}_i\right\}=f\left({x}_i\right)/{\displaystyle \sum_{k=1}^Nf\left({x}_k\right)}$$
(11)
where, N is the number of individuals.

4.4 Ants traverse

When an ant travels, the path selection of different ants is mutual independence. Starting from the nest, every ant performs path selection with the movable probability formula (8) and according to Fig. 2; because of the binary-coding, the ants do not possess memory function, it selects only on the basis of prior to the two path pheromones. The path that has higher density pheromone will have higher selection probability. When an ant completes the path selection in an ant sequence, it arrives at the food source.

5 Simulation experiment

The set of the monitoring area A is 100 m × 100 m, the perception radius r of sensor nodes is 10 m. When the network sensor nodes with hexagon structure distributed in the monitoring area and the distance d between nodes are $$d=\sqrt{3}\cdot r$$, the coverage of target monitoring area A can achieve optimal. From this, we know that 45 nodes with a radius of 10 can completely cover the monitoring area A, this is shown in Fig. 6.
We write the corresponding algorithm program using C++. The improved genetic algorithm and binary ant colony algorithm adopt two-point crossover, scale reproduction, and self-adaptive crossover and mutation operations. Population size is 60. There was random distribution of 100 sensor nodes in monitoring area A, the perception radius of sensor nodes is 10 m then every individual is composed of 100 binary bits. Algorithm iterative number is 200. Figure 7 is the 100 nodes in the area A random distribution. Although the nodes can cover the target region, but there are a lot of redundant nodes. Figure 8ad shows the working nodes set coverage using the improved genetic algorithm and binary ant colony algorithm evolution 50, 100,150, 200 generations.
From Fig. 8ad, we can see that the algorithm search towards the global optimal solution direction. When the iterative number is 200, the sensor nodes is near to the optimal distribution, using less number of sensor nodes, obtaining more than 97% coverage.
In order to evaluate the performance of IGA-BACA algorithm, in the other parameters unchanged, we evaluate its performance using different random deployment scenarios. In different sensor node density experiments, the number of sensor nodes deployed is, respectively, 100, 120, 150, 180, and 200. From the network coverage rate and the convergence of the algorithm, the improved genetic algorithm and binary ant colony algorithm are compared with ACA algorithm and GA algorithm. The experimental results are the average of 30 experiments. Figure 9 is a network coverage rate comparison chart of different sensor nodes.
From Fig. 9, we can see that the coverage quality increases along with the increase of sensor node density. In the same iteration, coverage quality of IGA-BACA algorithm is higher than those of GA algorithm and ACA algorithm. After 200 generations of evolution, the number of network sensor node is 100, the network coverage rate of IGA-BACA algorithm is 97.5 %, the network coverage rate of GA algorithm is 96.2 %, and the network coverage rate of ACA algorithm is 96.5 %. The number of network sensor node is 150, the network coverage rate of IGA-BACA algorithm is 98.7 %, the network coverage rate of GA algorithm is 97.3 %, and the network coverage rate of ACA algorithm is 97.7 %. The number of network sensor node is 200, the network coverage rate of IGA-BACA algorithm is 99.5 %, the network coverage rate of GA algorithm is 98.1 %, and the network coverage rate of ACA algorithm is 98.6 %. These results show that the IGA-BACA algorithm is better than the ACA algorithm and GA algorithm in wireless sensor network coverage quality improvement.
Figure 10 is the convergence comparison chart of IGA-BACA algorithm, GA algorithm, and ACA algorithm in 200 generations of the evolutionary process. Figure 10a is the convergence comparison chart in the 100 sensor nodes deployed, and the Fig. 10b is the convergence comparison chart in the 200 sensor nodes deployed. Figure 10 shows the convergence of the three algorithms. From Fig. 10a, we can see that this figure clearly shows the convergence of the three algorithms’ performance. The IGA-BACA algorithm, GA algorithm, and ACA algorithm can converge, and the convergence of IGA-BACA algorithm is better than that of ACA algorithm and GA algorithm, the convergence of ACA algorithm is better than that of GA algorithm. From Fig. 10b, we can get the same conclusion, for the three algorithms, and the convergence of IGA-BACA is the best, followed by ACA, finally GA. So the performance of IGA-BACA is better than the GA algorithm and ACA algorithm under the same parameters.
In order to further illustrate the validity of the IGA-BACA, we adopt IGA-BACA and GA to realize the optimal coverage of wireless sensor network node in the same conditions. In the 100 sensor nodes deployed, the simulation results by IGA-BACA and GA are shown in Table 1.
Table 1
Simulation results by IGA-BACA and GA
Evolution generations
IGA-BACA
GA
Network coverage rate (%)
Working set node number
CPU-time (s)
Network coverage rate (%)
Working set node number
CPU-time (s)
100
45
100
45
50
93
63
11
93.1
65
13
100
95.2
56
21
94.3
59
25
150
96.5
51
31
95.6
53
37
200
97.5
48
42
96.2
50
49
From Table 1, we can see that the network coverage rate of IGA-BACA is greater than that of GA in the same evolution generation condition. Moreover, the working set node number of IGA-BACA is smaller than that of GA in the same evolution generation condition. We also can see that along with the evolution generation increase, the network coverage rate is gradually approaching the optimal solution; moreover, the working set sensor node number is gradually reduced, this will reduce energy loss of a wireless sensor network and prolong the network lifetime. From the CPU time, we can see the IGA-BACA algorithm to optimize the speed faster than the GA algorithm.
All of these show that the IGA-BACA is superior to the GA and ACA at the convergence of the optimal solution with less working nodes and high network coverage rate.

6 Conclusions

The coverage and energy consumption are the key problems of wireless sensor network research because the sensor node energy cannot regenerate or supply. This paper analyzes the characteristics of wireless sensor network limited node energy. With the network coverage and the number of working set nodes as the optimization object, research on the working node set selection optimization problem of nodes explore the high-density deployment in wireless sensor network.
The wireless sensor network node optimal coverage based on improved genetic algorithm and binary ant colony algorithm is proposed and applied to node optimal coverage. The aim at the disadvantages of the genetic algorithm and ant colony algorithm is introduce binary ant colony algorithm and combine it with genetic algorithm to form improved genetic algorithm and binary ant colony algorithm which has higher accuracy and faster convergence speed. Considering the relationship between network coverage and the number of working set nodes, the complex multi-objective problem is simplified into a single-objective fitness function in this paper, which can balance network coverage rate and energy consumption of the system.
The simulation results show that the improved genetic algorithm and binary ant colony algorithm can achieve the optimal working set with less working nodes and high network coverage rate, effectively reducing energy loss of a wireless sensor network and prolonging the network lifetime.

Acknowledgements

This work is supported in part by the National Natural Science Foundation of China under Grant No. 61271370, the National High Technology Research and Development Program of China (863 Program) under Grant No. 2013AA013202, and Funding Project for Academic Human Resources Development in Beijing Union University No. 11101501105.

Competing interests

The authors declare that they have no competing interests.

Unsere Produktempfehlungen

Sie erhalten uneingeschränkten Vollzugriff auf alle acht Fachgebiete von Springer Professional und damit auf über 45.000 Fachbücher und ca. 300 Fachzeitschriften.

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

• über 58.000 Bücher
• über 300 Zeitschriften

aus folgenden Fachgebieten:

• Bauwesen + Immobilien
• Finance + Banking
• Management + Führung
• Marketing + Vertrieb
• Versicherung + Risiko

Testen Sie jetzt 30 Tage kostenlos.

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

• über 50.000 Bücher
• über 380 Zeitschriften

aus folgenden Fachgebieten:

• Automobil + Motoren
• Bauwesen + Immobilien
• Elektrotechnik + Elektronik
• Energie + Umwelt
• Maschinenbau + Werkstoffe

Testen Sie jetzt 30 Tage kostenlos.

Weitere Produktempfehlungen anzeigen
Literatur
Über diesen Artikel

Zur Ausgabe