Refinery system, a typical example of process systems, is presented as complex network in this paper. The topology of this system is described by task-resource network and modeled as directed and weighted graph, in wh...Refinery system, a typical example of process systems, is presented as complex network in this paper. The topology of this system is described by task-resource network and modeled as directed and weighted graph, in which nodes represent various tasks and edges denote the resources exchanged among tasks. Using the properties of node degree distribution, strength distribution and other weighted quantities, we demonstrate the heterogeneity of the network and point out the relation between structural characters of vertices and the functionality of correspond- ing tasks. The above phenomena indicate that the design requirements and principles of production process contrib- ute to the heterogeneous features of the network. Besides, betweenness centrality of nodes can be used as an impor- tance indicator to provide additional information for decision making. The correlations between structure and weighted properties are investigated to further address the influence brought by production schemes in system con- nectivity patterns. Cascading failures model is employed to analyze the robustness of the network when targeted at- tack happens. Two capacity assignment strategies are compared in order to improve the robustness of the network at certain cost. The refinery system displays more reliable behavior when the protecting strategy considers heteroge- neous properties. This phenomenon further implies the structure-activity relationship of the refinery system and provides insightful suggestions for process system design. The results also indicate that robustness analysis is a _promising applicat!on of methodologies from complex networks to process system engineering..展开更多
The growth and evolution of the knowledge network in supply chain can be characterized by dynamic growth clustering and non-homogeneous degree distribution.The networks with the above characteristics are also known as...The growth and evolution of the knowledge network in supply chain can be characterized by dynamic growth clustering and non-homogeneous degree distribution.The networks with the above characteristics are also known as scale-free networks.In this paper,the knowledge network model in supply chain is established,in which the preferential attachment mechanism based on the node strength is adopted to simulate the growth and evolution of the network.The nodes in the network have a certain preference in the choice of a knowledge partner.On the basis of the network model,the robustness of the three network models based on different preferential attachment strategies is investigated.The robustness is also referred to as tolerances when the nodes are subjected to random destruction and malicious damage.The simulation results of this study show that the improved network has higher connectivity and stability.展开更多
In the harsh environment where n ode density is sparse, the slow-moving nodes cannot effectively utilize the encountering opportunities to realize the self-organized identity authentications, and do not have the chanc...In the harsh environment where n ode density is sparse, the slow-moving nodes cannot effectively utilize the encountering opportunities to realize the self-organized identity authentications, and do not have the chance to join the network routing. However, considering m ost of the communications in opportunistic networks are caused by forwarding operations, there is no need to establish the complete mutual authentications for each conversation. Accordingly, a novel trust management scheme is presented based on the information of behavior feedback, in order to complement the insufficiency of identity authentications. By utilizing the certificate chains based on social attributes, the mobile nodes build the local certificate graphs gradually to realize the web of "Identity Trust" relationship. Meanwhile, the successors generate Verified Feedback Packets for each positive behavior, and consequently the "Behavior Trust" relationship is formed for slow-moving nodes. Simulation result shows that, by implementing our trust scheme, the d elivery probability and trust reconstruction ratio can be effectively improved when there are large numbers of compromised nodes, and it means that our trust management scheme can efficiently explore and filter the trust nodes for secure forwarding in opportunistic networks.展开更多
In order to enhance the physical-layer security of wireless transmission in a wireless heterogeneous network (HetNet), a two-stage-based cooperative framework is advocated. To be specific, a source-destination (SD) pa...In order to enhance the physical-layer security of wireless transmission in a wireless heterogeneous network (HetNet), a two-stage-based cooperative framework is advocated. To be specific, a source-destination (SD) pair is opportunistically chosen at the beginning of the transmission slot, which can be used to assist the transmissions of other SD pairs. Under this framework, a transmit antenna selection assisted opportunistic SD pair scheduling (TAS-OSDS) scheme is proposed, and the intercept probability (IP) of the proposed TAS-OSDS, the conventional round-robin source-destination pair scheduling (RSDS) and the conventional non-cooperation (non-coop) schemes is also analyzed, where the RSDS and non-coop schemes are used for comparison with the proposed TAS-OSDS. Numerical results show that increasing the number of the SD pairs can effectively reduce the IP of the TAS-OSDS scheme, whereas the IP of the RSDS and the non-coop remain unchanged with an increasing number of the SD pairs. Furthermore, the TAS-OSDS scheme achieves a lower IP than that of the RSDS and the non-coop schemes, showing the superiority of the proposed TAS-OSDS.展开更多
This paper addresses the available capacity and robust connectivity of time division duplex based wireless mesh networks （TDD-based WMNs）. A stochastic model is presented for TDD-based WMNs. Considering the paramete...This paper addresses the available capacity and robust connectivity of time division duplex based wireless mesh networks （TDD-based WMNs）. A stochastic model is presented for TDD-based WMNs. Considering the parameters that affect the network performance like ratio of control slots number to data slots number, collision probability, node density and average hopcounts, the availa- ble capacity for each node is inferred. Meanwhile, the order of transmission range for robust connec- tivity of large scale WMNs is derived. With the stochastic model and inferred available capacity per node, the performance of TDD-based WMNs using IEEE 802.16 standard is analyzed under various conditions. Simulation results indicate that the available capacity of IEEE 802.16-based TDD-based WMNs and the theoretical result have the same increasing and decreasing trend as the node density increases. Simulation results also illustrate the optimal value of the ratio of control slots number to data slots number that maximizes the available capacity.展开更多
Most of existing works on complex network assumed that the nodes and edges were uncapacitated during the evolving process,and displayed "rich club" phenomenon.Here we will show that the "rich club"...Most of existing works on complex network assumed that the nodes and edges were uncapacitated during the evolving process,and displayed "rich club" phenomenon.Here we will show that the "rich club" could be changed to "common rich" if we consider the node capacity.In this paper,we define the node and edge attractive index with node capacity,and propose a new evolving model on the base of BBV model,with evolving simulations of the networks.In the new model,an entering node is linked with an existing node according to the preferential attachment mechanism defined with the attractive index of the existing node.We give the theoretical approximation and simulation solutions.If node capacity is finite,the rich node may not be richer further when the node strength approaches or gets to the node capacity.This is confirmed by analyzing the passenger traffic and routes of Chinese main airports.Due to node strength being function of time t,we can use the theoretical approximation solution to forecast how node strength changes and the time when node strength reaches its maximum value.展开更多
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.展开更多
基金Supported by the National High Technology Research and Development Program of China (2012AA041102)the State Key Development Program for Basic Research of China (2012CB720500)
文摘Refinery system, a typical example of process systems, is presented as complex network in this paper. The topology of this system is described by task-resource network and modeled as directed and weighted graph, in which nodes represent various tasks and edges denote the resources exchanged among tasks. Using the properties of node degree distribution, strength distribution and other weighted quantities, we demonstrate the heterogeneity of the network and point out the relation between structural characters of vertices and the functionality of correspond- ing tasks. The above phenomena indicate that the design requirements and principles of production process contrib- ute to the heterogeneous features of the network. Besides, betweenness centrality of nodes can be used as an impor- tance indicator to provide additional information for decision making. The correlations between structure and weighted properties are investigated to further address the influence brought by production schemes in system con- nectivity patterns. Cascading failures model is employed to analyze the robustness of the network when targeted at- tack happens. Two capacity assignment strategies are compared in order to improve the robustness of the network at certain cost. The refinery system displays more reliable behavior when the protecting strategy considers heteroge- neous properties. This phenomenon further implies the structure-activity relationship of the refinery system and provides insightful suggestions for process system design. The results also indicate that robustness analysis is a _promising applicat!on of methodologies from complex networks to process system engineering..
基金Supported by the National Natural Science Foundation of China(No.71172169)
文摘The growth and evolution of the knowledge network in supply chain can be characterized by dynamic growth clustering and non-homogeneous degree distribution.The networks with the above characteristics are also known as scale-free networks.In this paper,the knowledge network model in supply chain is established,in which the preferential attachment mechanism based on the node strength is adopted to simulate the growth and evolution of the network.The nodes in the network have a certain preference in the choice of a knowledge partner.On the basis of the network model,the robustness of the three network models based on different preferential attachment strategies is investigated.The robustness is also referred to as tolerances when the nodes are subjected to random destruction and malicious damage.The simulation results of this study show that the improved network has higher connectivity and stability.
基金supported by the Program for Changjiang Scholars and Innovative Research Team in University (IRT1078)the Key Program of NSFC-Guangdong Union Foundation (U1135002)+3 种基金the Major national S&T program(2012ZX03002003)the Fundamental Research Funds for the Central Universities(JY10000903001)the National Natural Sci ence Foundation of China (Grant No. 61363068, 61100233)the Natural Science Foundation of Shaanxi Province (Grant No. 2012JM8030, 2011JQ8003)
文摘In the harsh environment where n ode density is sparse, the slow-moving nodes cannot effectively utilize the encountering opportunities to realize the self-organized identity authentications, and do not have the chance to join the network routing. However, considering m ost of the communications in opportunistic networks are caused by forwarding operations, there is no need to establish the complete mutual authentications for each conversation. Accordingly, a novel trust management scheme is presented based on the information of behavior feedback, in order to complement the insufficiency of identity authentications. By utilizing the certificate chains based on social attributes, the mobile nodes build the local certificate graphs gradually to realize the web of "Identity Trust" relationship. Meanwhile, the successors generate Verified Feedback Packets for each positive behavior, and consequently the "Behavior Trust" relationship is formed for slow-moving nodes. Simulation result shows that, by implementing our trust scheme, the d elivery probability and trust reconstruction ratio can be effectively improved when there are large numbers of compromised nodes, and it means that our trust management scheme can efficiently explore and filter the trust nodes for secure forwarding in opportunistic networks.
基金The National Natural Science Foundation of China(No.91738201)the China Postdoctoral Science Foundation(No.2018M632347)+2 种基金the Natural Science Research of Higher Education Institutions of Jiangsu Province(No.18KJB510030)the Open Research Fund of National Mobile Communications Research Laboratory,Southeast University(No.2018D16)the Open Research Fund of Jiangsu Engineering Research Center of Communication and Netw ork Technology,NJUPT
文摘In order to enhance the physical-layer security of wireless transmission in a wireless heterogeneous network (HetNet), a two-stage-based cooperative framework is advocated. To be specific, a source-destination (SD) pair is opportunistically chosen at the beginning of the transmission slot, which can be used to assist the transmissions of other SD pairs. Under this framework, a transmit antenna selection assisted opportunistic SD pair scheduling (TAS-OSDS) scheme is proposed, and the intercept probability (IP) of the proposed TAS-OSDS, the conventional round-robin source-destination pair scheduling (RSDS) and the conventional non-cooperation (non-coop) schemes is also analyzed, where the RSDS and non-coop schemes are used for comparison with the proposed TAS-OSDS. Numerical results show that increasing the number of the SD pairs can effectively reduce the IP of the TAS-OSDS scheme, whereas the IP of the RSDS and the non-coop remain unchanged with an increasing number of the SD pairs. Furthermore, the TAS-OSDS scheme achieves a lower IP than that of the RSDS and the non-coop schemes, showing the superiority of the proposed TAS-OSDS.
基金Supported by the National Natural Science Foundation of China （ No. 60674009, 60830001 ）.
文摘This paper addresses the available capacity and robust connectivity of time division duplex based wireless mesh networks （TDD-based WMNs）. A stochastic model is presented for TDD-based WMNs. Considering the parameters that affect the network performance like ratio of control slots number to data slots number, collision probability, node density and average hopcounts, the availa- ble capacity for each node is inferred. Meanwhile, the order of transmission range for robust connec- tivity of large scale WMNs is derived. With the stochastic model and inferred available capacity per node, the performance of TDD-based WMNs using IEEE 802.16 standard is analyzed under various conditions. Simulation results indicate that the available capacity of IEEE 802.16-based TDD-based WMNs and the theoretical result have the same increasing and decreasing trend as the node density increases. Simulation results also illustrate the optimal value of the ratio of control slots number to data slots number that maximizes the available capacity.
基金supported by the National Natural Science Foundation of China (Grant Nos.71171111,70771046 and 71201081)the Colleges Graduate Research and Innovation Program of Jiangsu Province (Grant Nos.CXZZ11-0220 and CX10B-102Z)
文摘Most of existing works on complex network assumed that the nodes and edges were uncapacitated during the evolving process,and displayed "rich club" phenomenon.Here we will show that the "rich club" could be changed to "common rich" if we consider the node capacity.In this paper,we define the node and edge attractive index with node capacity,and propose a new evolving model on the base of BBV model,with evolving simulations of the networks.In the new model,an entering node is linked with an existing node according to the preferential attachment mechanism defined with the attractive index of the existing node.We give the theoretical approximation and simulation solutions.If node capacity is finite,the rich node may not be richer further when the node strength approaches or gets to the node capacity.This is confirmed by analyzing the passenger traffic and routes of Chinese main airports.Due to node strength being function of time t,we can use the theoretical approximation solution to forecast how node strength changes and the time when node strength reaches its maximum value.
基金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.
