Failure of one or multiple critical nodes may partition wireless sensor networks into disjoint segments, and thus brings negative effect on the applications. We propose DCRS, a Distributed Connectivity Restoration Str...Failure of one or multiple critical nodes may partition wireless sensor networks into disjoint segments, and thus brings negative effect on the applications. We propose DCRS, a Distributed Connectivity Restoration Strategy to tolerate the failure of one critical node. Because of the energy restriction of sensor nodes, the energy overhead of the recovery process should be minimized to extend the lifetime of the network. To achieve it, we first design a novel algorithm to identify 2-critical nodes only relying on the positional information of 1-hop neighbors and some 2-hop neighbors, and then we present the criteria to select an appropriate backup for each critical node. Finally, we improve the cascaded node movement algorithm by determining whether a node can move to another non-adjacent node directly or not to reduce the number of nodes moved. The effectiveness of DCRS is validated through extensive simulation experiments.展开更多
In this paper,we study the dynamic evolution of friendship network in SNS(Social Networking Site).Our analysis suggests that an individual joining a community depends not only on the number of friends he or she has wi...In this paper,we study the dynamic evolution of friendship network in SNS(Social Networking Site).Our analysis suggests that an individual joining a community depends not only on the number of friends he or she has within the community,but also on the friendship network generated by those friends.In addition,we propose a model which is based on two processes:first,connecting nearest neighbors;second,strength driven attachment mechanism.The model reflects two facts:first,in the social network it is a universal phenomenon that two nodes are connected when they have at least one common neighbor;second,new nodes connect more likely to nodes which have larger weights and interactions,a phenomenon called strength driven attachment(also called weight driven attachment).From the simulation results,we find that degree distribution P(k),strength distribution P(s),and degree-strength correlation are all consistent with empirical data.展开更多
In this paper, the continuous-time independent edge-Markovian random graph process model is constructed. The authors also define the interval isolated nodes of the random graph process, study the distribution sequence...In this paper, the continuous-time independent edge-Markovian random graph process model is constructed. The authors also define the interval isolated nodes of the random graph process, study the distribution sequence of the number of isolated nodes and the probability of having no isolated nodes when the initial distribution of the random graph process is stationary distribution, derive the lower limit of the probability in which two arbitrary nodes are connected and the random graph is also connected, and prove that the random graph is almost everywhere connected when the number of nodes is sufficiently large.展开更多
文摘Failure of one or multiple critical nodes may partition wireless sensor networks into disjoint segments, and thus brings negative effect on the applications. We propose DCRS, a Distributed Connectivity Restoration Strategy to tolerate the failure of one critical node. Because of the energy restriction of sensor nodes, the energy overhead of the recovery process should be minimized to extend the lifetime of the network. To achieve it, we first design a novel algorithm to identify 2-critical nodes only relying on the positional information of 1-hop neighbors and some 2-hop neighbors, and then we present the criteria to select an appropriate backup for each critical node. Finally, we improve the cascaded node movement algorithm by determining whether a node can move to another non-adjacent node directly or not to reduce the number of nodes moved. The effectiveness of DCRS is validated through extensive simulation experiments.
基金Supported by Program for New Centurty Excellent Talents in University under Grant No. NCET-11-0597the Fundamental Research Funds for the Central Universities under Grant No. 2012RC1002
文摘In this paper,we study the dynamic evolution of friendship network in SNS(Social Networking Site).Our analysis suggests that an individual joining a community depends not only on the number of friends he or she has within the community,but also on the friendship network generated by those friends.In addition,we propose a model which is based on two processes:first,connecting nearest neighbors;second,strength driven attachment mechanism.The model reflects two facts:first,in the social network it is a universal phenomenon that two nodes are connected when they have at least one common neighbor;second,new nodes connect more likely to nodes which have larger weights and interactions,a phenomenon called strength driven attachment(also called weight driven attachment).From the simulation results,we find that degree distribution P(k),strength distribution P(s),and degree-strength correlation are all consistent with empirical data.
基金supported by the National Natural Science Foundation of China(Nos.60872060,11101265)the Shanghai Natural Science Foundation of China(No.12ZR1421000)the Shanghai Education Commission Innovation Project Fund(Nos.12ZZ193,14YZ152,15ZZ099)
文摘In this paper, the continuous-time independent edge-Markovian random graph process model is constructed. The authors also define the interval isolated nodes of the random graph process, study the distribution sequence of the number of isolated nodes and the probability of having no isolated nodes when the initial distribution of the random graph process is stationary distribution, derive the lower limit of the probability in which two arbitrary nodes are connected and the random graph is also connected, and prove that the random graph is almost everywhere connected when the number of nodes is sufficiently large.
