- About this Journal ·
- Abstracting and Indexing ·
- Aims and Scope ·
- Annual Issues ·
- Article Processing Charges ·
- Articles in Press ·
- Author Guidelines ·
- Bibliographic Information ·
- Citations to this Journal ·
- Contact Information ·
- Editorial Board ·
- Editorial Workflow ·
- Free eTOC Alerts ·
- Publication Ethics ·
- Reviewers Acknowledgment ·
- Submit a Manuscript ·
- Subscription Information ·
- Table of Contents
Mathematical Problems in Engineering
Volume 2012 (2012), Article ID 281465, 14 pages
Energy-Aware Topology Evolution Model with Link and Node Deletion in Wireless Sensor Networks
School of Information Science and Engineering, East China University of Science and Technology, Shanghai 200237, China
Received 20 April 2011; Revised 10 June 2011; Accepted 6 July 2011
Academic Editor: Zidong Wang
Copyright © 2012 Xiaojuan Luo et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Based on the complex network theory, a new topological evolving model is proposed. In the evolution of the topology of sensor networks, the energy-aware mechanism is taken into account, and the phenomenon of change of the link and node in the network is discussed. Theoretical analysis and numerical simulation are conducted to explore the topology characteristics and network performance with different node energy distribution. We find that node energy distribution has the weak effect on the degree distribution that evolves into the scale-free state, nodes with more energy carry more connections, and degree correlation is nontrivial disassortative. Moreover, the results show that, when nodes energy is more heterogeneous, the network is better clustered and enjoys higher performance in terms of the network efficiency and the average path length for transmitting data.
Recently, complex networks have attracted considerable intention to investigate various real-world dynamic networks, such as scientific collaboration, the Internet, worldwide web, social networks, biological networks, transportation networks, e-mail networks, software engineering, and ad hoc networks; see [1–9] and the references therein. In the original theoretical description of these findings, the Watts-Strogatz (WS) model  provided a simple way to generate networks with the “small-world” properties. Barabási and Albert  proposed a “scale-free” network with a power-law degree distribution. Further studies show that real networked systems may undergo the more complex evolution process governed by multiple mechanisms on which the occurrence of network structures depends [12–15]. Therefore, to get a better understanding of the real-world system, it is necessary to describe such evolution processes of complex network in more detailed and realistic manner.
The motivation for considering dynamic networks comes, in part, from the recent interest in designing wireless sensor networks as a prime example. Sensor networks have recently received increasing interests due to their extensive application in areas such as information collection, environmental monitoring, industrial automation, health tracking, and military surveillance [16, 17]. Consequently, many critical techniques in sensor network have gained much research efforts [18–22]. The motivations of this work is to continue such efforts aimed at discovering new mechanism to construct optimal network structures and that might be useful in designing engineered senor networks.
Well-known examples of such dynamical network models are proposed including preferential attachment and its variants [11, 23, 24]. Very recently, Zhu et al.  have proposed two scale-free networks-based models for wireless sensor networks, named energy-aware evolution model (EAEM) and energy-balanced evolution model (EBEM) which can organize the networks in an energy-efficient way. Chen et al.  have proposed a topology control of wireless sensor networks under an average degree constraint. Actually, the above evolving models have considered energy efficiency of WSNs using by energy-aware mechanism. These mechanisms, however, model the dynamics WSN as a monotonously growing network, where the effect of node deletion is not considered to be significant. Sensor networks experience significant rates of links and nodes deletion for several kinds of cases as follows and beyond. Nodes join and depart from sensor networks in a random and rapid manner for artificial mobility. The links and nodes are probably removed for many factors such as environment deteriorated, hostile attack because the sensor nodes are usually deployed over some inaccessible and dangerous geographical area. Usually the energy of sensor node is limited and nonrecharged and would be exhausted after working for a period of time. Hence, developing a network dynamic model for the real-world sensor networks with a significant deletion component is necessary.
Several recently proposed models have addressed the link and node deletion process for dynamical sensor network. Kong and Roychowdhury  proposed an ad hoc network with node addition and removal, focusing on the compensatory process for node removal to preserve true scale-free state. Sarshar and Roychowdhury  investigated stable ad hoc network where nodes deletion is dominated by preferential survival mechanism. A local-world heterogeneous model of wireless sensor networks with node and link diversity was proposed in . Unfortunately, those works have not considered the node energy problem in the network. Energy efficiency is a critical factor for prolonging the life of the network system. If the topology is constructed based on the node energy, then the traffic load is properly adjusted, that is, nodes with more energy carry more connections and the node with less energy will carry few connections. The energy consumption is balanced in the whole network, and the network lifetime will be effectively extended.
Motivated by the above analysis, in this paper, we aim to investigate the topological evolving model for wireless sensor network, which is combined energy-aware mechanism with both addition and removal of link and node based on complex network theory. To the best of the authors’ knowledge, the proposed mechanism has not yet been addressed for WSNs. The main contributions of this paper are summarized as follows. (1) a new evolution model is proposed to describe dynamical sensor network. (2) a combination of two important mechanisms of energy preferential attachment for link and node addition and energy antipreferential attachment for link and deletion contributes to investigating the complexity of WSNs. (3) Degree distribution is solved by utilizing mean-field analysis and shows how the network evolves into the scale-free state. Numerical simulations of several critical topology characteristics are used to demonstrate the effectiveness of the proposed model in this paper.
The rest of this paper is organized as follows. In Section 2, we present our new energy-aware topology evolving model for wireless sensor networks. In Section 3, we give the numerical analysis and simulations experiments discussion about the network characteristics under the effect of different node energy distribution. Its effectiveness is analytically investigated by its topology properties, such as degree distribution, node degree, and the average degree of neighboring node, the average clustering coefficient, the average path length, and the network efficiency. The results are validated through numerical calculations and simulations. Finally in Section 4, we conclude the investigation and point out the further research direction.
2. The Proposed Model for WSNs
In this section, we present the following model to capture the particular features of such WSNs evolving networks. In the initial state, the network has a small number of connected nodes and small number of edges. Then, the iterative algorithm during the evolving process is outlined as follows.
(1) Preferential Attachment
At each time step, a new node is added to the system. And () new links from the new node are connected to existing nodes. We assume that the preferential probability of a new node will be connected to node depending on the connectivity and energy () of that node. In this paper, we use the definition of the function to present the relationship between the energy of a node and its ability to be linked just as in . Then
In real wireless sensor network, the node which has more connetivities will carry more traffic load and consume its energy more quickly. For the balance the energy consumption, we assume the more energy a node has, the strong ability it will have of being connected to the new coming nodes. Therefore, must be an increasing function here, and the form may be as , and so on. Here is the coefficient. In this paper, we just set , where . And the form of is expressed as
(2) Links Deletion
At each time step, with probability (), old links are removed. So the parameter denotes the deletion rate, which is defined as the rate of links removed divided by the rate of links addition. We first select a node as an end of a deleted link with the antipreferential probability as (2.2). The less energy the node has, the more probability it will have for being deleted:
Then node is then chosen from the linked neighborhood of node (denoted by ) with probability , where . Then the link connecting nodes and is removed; this process is repeated times. Once an isolated node appears, it should be removed from the network to maintain the connectivity of networks. The antipreferential removal mechanism is more reasonable for deleting links that are parallel with the preferential connection. It is consistent with the real wireless sensor networks environment. The wireless links that have not been active may be removed from the network when the energy of the connecting nodes falls down to a certain level. The particular antipreferential removal phenomenon is also reasonable for many real networks. For example, users’ e-mail networks can be constructed by considering user address books as nodes and addresses in the address books as links. Some old addresses that have become inactive below the threshold may be deleted in the evolving e-mail network . Furthermore, in the evolving words network, there will be link and node removals over time because some old expressions and sentences are no longer used and some words may become obsolete .
3. Network Analysis
Topological characterization is of great importance for network structure in reality. To have a better understanding of the complex dynamics in the considered model and of the influence of , in this section we give theoretical analysis and numerical simulation of these statistical properties parameters—the degree distribution , node degree (), the average nearest-neighbor connectivity , the average clustering coefficient (), the average path length (), and the network efficiency ().
3.1. Degree Distribution
The degree distribution , which indicates the probability that a randomly selected node has connections, is very important statistical character of large-scale complex network. In fact, has been suggested to be used as the first criterion to classify real-world networks. Now we adopt the mean field theory  to give a qualitative analysis of for our energy-aware evolving model with link and node deletions.
By the mean-field theory, let be the degree of the th node at time , then in the limit of large , the increasing rate of satisfies the following dynamical equation:
It is easy to know that the first term in (3.1) accounts for the increasing number of links of the th node by the preferential attachment due to the newly added node. The second term in (3.1) explains the losing of links by antipreferential attachment during the evolving process.
From the mean-field sense, we have where is the expected value of the node energy in the whole network; is the number of the nodes at time step ; is the average degree of the network at time . For large , ; with being the number of edges that were initially linked to nodes. Moreover we can have . Then, at time step , , which indicates that link deletion with the antipreferential probability is equivalent to deleting links with equal probability by mean-field sense. This phenomenon is also observed in .
Supposing that sensor networks which undergo a large number of time steps have sufficiently large scale, we obtain
It is obvious that, at every time step , . Since , the network cannot grow. We then consider two cases in the above proposed evolving network model: and , which are further discussed below.
Case A (). In this case, there are only link and node additions without link and node deletions in the evolving process as in . It is usually fit for topology discovery state of WSNs in which the all nodes have enough power in the ideal environment. So satisfies
With the initial condition , then we can get
The probability that a node has a connectivity which satisfy is
Assuming that we add the node to the network at equal time intervals in evolving process for WSNs, the probability density at the time is . Therefore, we get
The probability density function of the degree of a node with energy is
The overall probability density function is where is the probability density distribution of node energy in the whole network; and are the bounds of node energy values. Obviously, , where . The degree distribution follows the same power law as the Barabási-Albert scale-free model .
Case B (). In this case, links and nodes in the evolving network model are not monotonously growing. Instead, links and nodes can be added in some occasion and removed in other case. We rewrite (3.3) as follows:
With the initial condition that node at its introduction has , one can get where the dynamic exponent is and the coefficient is
We can get from (3.11) that
With the same about the probability density at the time , . Hence,
The probability density function of the degree of a node with energy is
To obtain the overall probability density function where , , and have the same definition as in (3.9). We compute numerical results and compare them with simulation as follows.
In this paper, we consider three kinds of node energy distribution in the whole network within the interval : (1) the same node energy with value with ; (2) uniform distribution with ; (3) exponential distribution () with , where is the standard deviation used to indicate the node energy heterogeneity. The nodes energy in the network becomes more and more heterogeneous as increases. So, the node energy with exponential distribution is the most heterogeneous among the three cases, while the node energy is homogeneous with for the first case.
In Figure 1, we make the simulations for and , where . We can find that the degree distributions are power law as B-A model. Moreover, it is easy to understand that the network makes higher connectivity as increases. We also can see that the network degree distribution curves obtained by the mathematic method and by simulation match very well.
In Figures 2, 3(a) and 3(b), we, respectively, give the simulations for , and , where , . We observe that the results of display a horse-head-like curve, with its middle section showing the expected scale-free state whatever the value of is. We can see that the network degree distribution curves obtained by the mean-field method and by simulation match very well for degree larger than . The figures also show that the mean-field solution cannot provide probabilities for degrees smaller than . The overall horse-head-like distribution curve has also been observed in  by Markov process. Thus, from Figures 1, 2, and 3, there is little distinction among the plots for three kinds of nodes energy distribution. So we think the different nodes energy distribution in the network has the weakest affect on the degree distribution.
3.2. Connectivity Correlation
To clearly understand the influence of on the network connectivity and uncover the internal complexity of the topological structure, it is worth investigating the connectivity correlation through (the average degree of node with energy ) and (the average degree of neighboring nodes of a given node with degree ). We find from Figure 4 that the node which has more energy has a larger degree. The node degree is linearly increased with node energy when is uniform distribution. But for the exponential distribution, there is an inward bend at the middle of the data curve that most high energy nodes carry much more links and a few of them keep relatively less links. It is because we can only perform a finite number of computation steps, and then possibly some nodes with high energy newly come into the network. There are a few hubs, that have much more links than the others nodes, emerging in the evolving process for the energy exponential distribution case. Thus the connectivity becomes more inhomogeneous when nodes energy is more heterogeneous.
Connectivity correlation is also quantified by reporting the numerical value of the slope of as a function of . We compute which is defined as in : where is the set of nodes with degree of the amount in the evolving WSNs. is the set of linked neighbors of node . In Figure 5, it is found that is independent of for nodes with large degree, that is, nodes with large show no obvious biases in their connections. But there is a short disassortative region when is relatively small, that is, nodes with low degree are more likely linked with the highly connected ones. Such phenomenon can be explained by the effect of network growth with energy preferential attachment and elements removals with antipreferential mechanism.
3.3. Clustering Coefficient
We investigate the effect of node energy distribution on network’s cluster coefficient, which quantifies the extent to which nodes adjacent to a given node are linked [15, 31]. Let denote the number of edges among the neighbor nodes of a selected node with degree in the network; is local clustering coefficient of node . Then the clustering coefficient of the whole network is the average of all individual . It is defined as follows:
In Figure 6, we give the clustering coefficient () changing by network size with three kinds of node energy distribution. keeps very small value of 0.005 when node energy is same in the network. But when is exponential distribution, keeps large value with the average value 0.185. The result indicates that nodes energy heterogeneity makes the network more clustering.
3.4. Average Shortest Path Length and Network Efficiency
In WSN, the sensor nodes forward the data by multihops. The average path length is defined to be the average length of the shortest paths between any two nodes in the network that is written as in (3.20). Usually we use it to measure the average hops among the nodes for data processing. Simultaneously we use the network efficiency to measure how efficiently the information is exchanged over the network. Let denote the length of the shortest path between node and node . The efficiency between node and is assumed to be inversely proportional to the shortest distance: . With this definition, when there is no path between and , . The global efficiency of the network is defined as the average of the efficiencies over all couples of nodes. Its calculation can be defined as (3.21):
Since and characterize the ability of two nodes to communicate with each other, the smaller and the larger mean fewer hops and less energy consumption for data processing. In Figures 7 and 8, we plot the average shortest path length () and network efficiency () with evolving time step , which denoted network size, for three kinds of node energy distribution. We observe that increases, and decreases with the network size increasing. We also find, by the same evolving time step , that the network obtains the smallest and the largest when is exponential distribution among the three kinds of . Conversely, is the largest and is the smallest when node energy is same in the network for the same network size. The results verify that nodes in energy inhomogeneous networks are more efficient to communicate with others.
In this paper, we have addressed a novel topology evolution model for wireless sensor networks. A notion of energy-aware mechanism combined with additions and removals of link and node has been first defined to characterize the evolution model of WSNs. Subsequently, by using mean-field approach, numerical calculation shows the network evolving into the scale-free state with a horse-head-like initial section. Finally, experimental simulations have been employed to demonstrate the effectiveness of the results derived in this paper. Node energy distribution has a weak effect on the degree distribution but it has much effect on the network internal topological characterizations. The node which has more energy will have more degrees for balancing energy consumption, and the model exhibits the nontrivial disassortative degree correlation as a natural property of network evolution. In addition, the connectivity is tighter and the network is higher clustering for the sensor network system in which node energy is more heterogeneous. Then, from the perspective of the average path length and the network efficiency, we find that, when node energy distribution is more heterogeneous, the network enjoys better performance in energy efficiency for transmitting data. The analysis of the robustness against the random failures and intentional attacks for the proposed model is beyond the scope of the current work and is left for future investigations.
This model articulates the topology dynamics of the real WSNs and provides some useful guidelines for constructing WSNs.
This work was partially supported by the NSF of China under Grants no. 60773094 and no. 50803016 and Shanghai Shuguang Program under Grant no. 07SG32.
- M. E. J. Newman, “The structure of scientific collaboration networks,” Proceedings of the National Academy of Sciences of the United States of America, vol. 98, no. 2, pp. 404–409, 2001.
- M. Faloutsos, P. Faloutsos, and C. Faioutsos, “On power-law relationships of the internet topology,” Computer Communication Review, vol. 29, no. 4, pp. 251–261, 1999.
- R. Albert, H. Jeong, and A. L. Barabási, “Diameter of the world-wide web,” Nature, vol. 401, no. 6749, pp. 130–131, 1999.
- B. A. Huberman, P. L. T. Pirolli, J. E. Pitkow, and R. M. Lukose, “Strong regularities in world wide web surfing,” Science, vol. 280, no. 5360, pp. 95–97, 1998.
- G. González-Parra, L. Acedo, R.-J. V. Micó, and A. J. Arenas, “Modeling the social obesity epidemic with stochastic networks,” Physica A, vol. 389, no. 17, pp. 3692–3701, 2010.
- V. Colizza, A. Flammini, A. Maritan, and A. Vespignani, “Characterization and modeling of protein-protein interaction networks,” Physica A, vol. 352, no. 1, pp. 1–27, 2005.
- J. R. Banavar, A. Maritan, and A. Rinaldo, “Size and form in efficient transportation networks,” Nature, vol. 399, no. 6732, pp. 130–132, 1999.
- J. Wang and P. De Wilde, “Properties of evolving e-mail networks,” Physical Review E, vol. 70, no. 6, Article ID 066121, 8 pages, 2004.
- L. Wen, R. G. Dromey, and D. Kirk, “Software engineering and scale-free networks,” IEEE Transactions on Systems, Man, and Cybernetics B, vol. 39, no. 3, pp. 648–657, 2009.
- D. J. Watts and S. H. Strogatz, “Collective dynamics of ‘small-world’ networks,” Nature, vol. 393, no. 6684, pp. 440–442, 1998.
- A.-L. Barabási and R. Albert, “Emergence of scaling in random networks,” American Association for the Advancement of Science, vol. 286, no. 5439, pp. 509–512, 1999.
- D. Shi, L. Liu, S. X. Zhu, and H. Zhou, “Degree distributions of evolving networks,” Europhysics Letters, vol. 76, no. 4, pp. 731–737, 2006.
- B. Shen, Z. Wang, and X. Liu, “Bounded synchronization and state estimation for discrete time-varying stochastic complex networks over a finite horizon,” IEEE Transactions on Neural Networks, vol. 22, no. 1, pp. 145–157, 2011.
- Q. Chen and D. Shi, “The modeling of scale-free networks,” Physica A, vol. 335, no. 1-2, pp. 240–248, 2004.
- Y. Gu and J. Sun, “A local-world node deleting evolving network model,” Physics Letters A, vol. 372, no. 25, pp. 4564–4568, 2008.
- I. F. Akyildiz, W. Su, Y. Sankarasubramaniam, and E. Cayirci, “A survey on sensor networks,” IEEE Communications Magazine, vol. 40, no. 8, pp. 102–114, 2002.
- G. Anastasi, M. Conti, M. Di Francesco, and A. Passarella, “Energy conservation in wireless sensor networks: a survey,” Ad Hoc Networks, vol. 7, no. 3, pp. 537–568, 2009.
- B. Shen, Z. Wang, Y. S. Hung, and G. Chesi, “Distributed filtering for polynomial nonlinear stochastic systems in sensor networks,” IEEE Transactions on Industrial Electronics, vol. 58, no. 5, pp. 1971–1979, 2011.
- J. Yick, B. Mukherjee, and D. Ghosal, “Wireless sensor network survey,” Computer Networks, vol. 52, no. 12, pp. 2292–2330, 2008.
- H. Dong, Z. Wang, D. W. C. Ho, and H. Gao, “Variance-constrained filtering for a class of nonlinear time-varying systems with multiple missing measurements: the finite-horizon case,” IEEE Transactions on Signal Processing, vol. 58, no. 5, pp. 2534–2543, 2010.
- B. Shen, Z. Wang, and Y. S. Hung, “Distributed -consensus filtering in sensor networks with multiple missing measurements: the finite-horizon case,” Automatica, vol. 46, no. 10, pp. 1682–1688, 2010.
- H. Dong, Z. Wang, and H. Gao, “Robust filtering for a class of nonlinear networked systems with multiple stochastic communication delays and packet dropouts,” IEEE Transactions on Signal Processing, vol. 58, no. 4, pp. 1957–1966, 2010.
- A. Vázquez, “Growing network with local rules: preferential attachment, clustering hierarchy, and degree correlations,” Physical Review E, vol. 67, no. 5, Article ID 056104, 15 pages, 2003.
- X. Li and G. Chen, “A local-world evolving network model,” Physica A, vol. 328, no. 1-2, pp. 274–286, 2003.
- H. Zhu, H. Luo, H. Peng, L. Li, and Q. Luo, “Complex networks-based energy-efficient evolution model for wireless sensor networks,” Chaos, Solitons and Fractals, vol. 41, no. 4, pp. 1828–1835, 2009.
- L. J. Chen, Y. C. Mao, D. X. Chen, and L. Xie, “Topology control of wireless sensor networks under an average degree constraint,” Chinese Journal of Computers, vol. 30, no. 9, pp. 1544–1550, 2007.
- J. S. Kong and V. P. Roychowdhury, “Preferential survival in models of complex ad hoc networks,” Physica A, vol. 387, no. 13, pp. 3335–3347, 2008.
- N. Sarshar and V. Roychowdhury, “Scale-free and stable structures in complex ad hoc networks,” Physical Review E, vol. 69, no. 2, Article ID 026101, 6 pages, 2004.
- S. Li, L. Li, and Y. Yang, “A local-world heterogeneous model of wireless sensor networks with node and link diversity,” Physica A, vol. 390, no. 6, pp. 1182–1191, 2011.
- A. L. Barabási, R. Albert, and H. Jeong, “Mean-field theory for scale-free random networks,” Physica A, vol. 272, no. 1, pp. 173–187, 1999.
- S. Boccaletti, V. Latora, Y. Moreno, M. Chavez, and D.-U. Hwang, “Complex networks: structure and dynamics,” Physics Reports, vol. 424, no. 4-5, pp. 175–308, 2006.