The dense integration of residential distributed photovoltaic(PV)systems into three-phase,four-wire low-voltage(LV)distribution networks results in reverse power flow and three-phase imbalance,leading to voltage viola...The dense integration of residential distributed photovoltaic(PV)systems into three-phase,four-wire low-voltage(LV)distribution networks results in reverse power flow and three-phase imbalance,leading to voltage violations that hinder the growth of rural distributed PV systems.Traditional voltage droop-based control methods regulate PV power output solely based on local voltage measurements at the point of PV connection.Due to a lack of global coordination and optimization,their efficiency is often subpar.This paper presents a centralized coordinated active/reactive power control strategy for PV inverters in rural LV distribution feeders with high PV penetration.The strategy optimizes residential PV inverter reactive and active power control to enhance voltage quality.It uses sensitivity coefficients derived from the inverse Jacobian matrix to assign adjustment weights to individual PV units and iteratively optimize their power outputs.The control sequence prioritizes reactive power increases;if the coefficients are below average or the inverters reach capacity,active power is curtailed until voltage issues are resolved.A simulation based on a real 37-node rural distribution network shows that the proposed method significantly reduces PV curtailment.Typical daily results indicate a curtailment rate of 1.47%,which is significantly lower than the 15.4%observed with the voltage droop-based control method.The total daily PV power output(measured every 15 min)increases from 5.55 to 6.41 MW,improving PV hosting capacity.展开更多
In this paper, we propose a new centrality algorithm that can simultaneously rank the nodes and layers of multilayer networks, referred to as the MRFNL centrality. The centrality of nodes and layers are obtained by de...In this paper, we propose a new centrality algorithm that can simultaneously rank the nodes and layers of multilayer networks, referred to as the MRFNL centrality. The centrality of nodes and layers are obtained by developing a novel iterative algorithm for computing a set of tensor equations. Under some conditions, the existence and uniqueness of this centrality were proven by applying the Brouwer fixed point theorem. Furthermore, the convergence of the proposed iterative algorithm was established. Finally, numerical experiments on a simple multilayer network and two real-world multilayer networks(i.e., Pierre Auger Collaboration and European Air Transportation Networks) are proposed to illustrate the effectiveness of the proposed algorithm and to compare it to other existing centrality measures.展开更多
In this work we propose a centrality measure for networks, which we refer to as Laplacian centrality, that provides a general framework for the centrality of a vertex based on the idea that the importance (or centrali...In this work we propose a centrality measure for networks, which we refer to as Laplacian centrality, that provides a general framework for the centrality of a vertex based on the idea that the importance (or centrality) of a vertex is related to the ability of the network to respond to the deactivation or removal of that vertex from the network. In particular, the Laplacian centrality of a vertex is defined as the relative drop of Laplacian energy caused by the deactivation of this vertex. The Laplacian energy of network G with?n?vertices is defined as , where ?is the eigenvalue of the Laplacian matrix of G. Other dynamics based measures such as that of Masuda and Kori and PageRank compute the importance of a node by analyzing the way paths pass through a node while our measure captures this information as well as the way these paths are “redistributed” when the node is deleted. The validity and robustness of this new measure are illustrated on two different terrorist social network data sets and 84 networks in James Moody’s Add Health in school friendship nomination data, and is compared with other standard centrality measures.展开更多
Wireless Mesh Networks （WMNs） are vulnerable to various security threats because of their special infrastructure and communication mode, wherein insider attacks are the most challenging issue. To address this proble...Wireless Mesh Networks （WMNs） are vulnerable to various security threats because of their special infrastructure and communication mode, wherein insider attacks are the most challenging issue. To address this problem and protect innocent users from malicious attacks, it is important to encourage cooperation and deter malicious behaviors. Reputation systems constitute a major category of techniques used for managing trust in distributed networks, and they are effective in characterizing and quantifying a node＇s behavior for WMNs. However, conventional layered reputation mechanisms ignore several key factors of reputation in other layers; therefore, they cannot provide optimal performance and accurate malicious node identification and isolation for WMNs. In this paper, we propose a novel dynamic reputation mechanism, SLCRM, which couples reputation systems with a cross-layer design and node-security-rating classification techniques to dynamically detect and restrict insider attacks. Simulation results show that in terms of network throughput, packet delivery ratio, malicious nodes＇ identification, and success rates, SI_CRM imple- ments security protection against insider attacks in a more dynamic, effective, and efficient manner than the subjective logic and uncertainty-based reputation model and the familiarity-based reputation model.展开更多
To improve the robustness of the Low Earth Orbit(LEO) satellites networks and realise load balancing, a Cross-layer design and Ant-colony optimization based Load-balancing routing algorithm for LEO Satellite Networks(...To improve the robustness of the Low Earth Orbit(LEO) satellites networks and realise load balancing, a Cross-layer design and Ant-colony optimization based Load-balancing routing algorithm for LEO Satellite Networks(CAL-LSN) is proposed in this paper. In CALLSN, mobile agents are used to gather routing information actively. CAL-LSN can utilise the information of the physical layer to make routing decision during the route construction phase. In order to achieve load balancing, CALLSN makes use of a multi-objective optimization model. Meanwhile, how to take the value of some key parameters is discussed while designing the algorithm so as to improve the reliability. The performance is measured by the packet delivery rate, the end-to-end delay, the link utilization and delay jitter. Simulation results show that CAL-LSN performs well in balancing traffic load and increasing the packet delivery rate. Meanwhile, the end-to-end delay and delay jitter performance can meet the requirement of video transmission.展开更多
This paper introduces an ant colony routing and wavelength assignment algorithm based on cross-layer design(CL-ACRWA),which can overcome the adverse effects of Doppler wavelength shift on data transmission in optical ...This paper introduces an ant colony routing and wavelength assignment algorithm based on cross-layer design(CL-ACRWA),which can overcome the adverse effects of Doppler wavelength shift on data transmission in optical satellite networks. Firstly, a cross-layer optimization model is built, which considers the Doppler wavelength shift, the transmission delay as well as wavelength-continuity constraint. Then an ant colony algorithm is utilized to solve the cross-layer optimization model, resulting in finding an optimal light path satisfying the above constraints for every connection request. The performance of CL-ACRWA is measured by the communication success probability, the convergence property and the transmission delay. Simulation results show that CL-ACRWA performs well in communication success probability and has good global search ability as well as fast convergence speed. Meanwhile, the transmission delay can meet the basic requirement of real-time transmission of business.展开更多
With correlating with human perception, quality of experience(Qo E) is also an important measurement in evaluation of video quality in addition to quality of service(Qo S). A cross-layer scheme based on Lyapunov optim...With correlating with human perception, quality of experience(Qo E) is also an important measurement in evaluation of video quality in addition to quality of service(Qo S). A cross-layer scheme based on Lyapunov optimization framework for H.264/AVC video streaming over wireless Ad hoc networks is proposed, with increasing both Qo E and Qo S performances. Different from existing works, this scheme routes and schedules video packets according to the statuses of the frame buffers at the destination nodes to reduce buffer underflows and to increase video playout continuity. The waiting time of head-ofline packets of data queues are considered in routing and scheduling to reduce the average end-to-end delay of video sessions. Different types of packets are allocated with different priorities according to their generated rates under H.264/AVC. To reduce the computational complexity, a distributed media access control policy and a power control algorithm cooperating with the media access policy are proposed. Simulation results show that, compared with existing schemes, this scheme can improve both the Qo S and Qo E performances. The average peak signal-to-noise ratio(PSNR) of the received video streams is also increased.展开更多
We investigate the problem of how to minimize the energy consumption in multi-hop Wireless Sensor Network (WSN),under the constraint of end-to-end reliability Quality of Seervice (QoS) requirement.Based on the investi...We investigate the problem of how to minimize the energy consumption in multi-hop Wireless Sensor Network (WSN),under the constraint of end-to-end reliability Quality of Seervice (QoS) requirement.Based on the investigation,we jointly consider the routing,relay selection and power allocation algorithm,and present a novel distributed cross-layer strategy using opportunistic relaying scheme for cooperative communication.The results show that under the same QoS requirement,the proposed cross-layer strategy performs better than other cross-layer cooperative communication algorithms in energy efficiency.We also investigated the impact of several parameters on the energy efficiency of the cooperative communication in WSNs,thus can be used to provide guidelines to decide when and how to apply cooperation for a given setup.展开更多
This paper describes the deployment optimization technology and the cross-layer design of a surveil-lance WSN system applied in relic protection.Facing the typical technical challenges in the applicationcontext of rel...This paper describes the deployment optimization technology and the cross-layer design of a surveil-lance WSN system applied in relic protection.Facing the typical technical challenges in the applicationcontext of relic protection,we firstly propose a deployment technology based on ant colony optimization al-gorithm(DT-ACO)to overcome the difficulties in communication connectivity and sensing coverage.Meanwhile,DT-ACO minimizes the overall cost of the system as much as possible.Secondly we proposea novel power-aware cross-layer scheme(PACS)to facilitate adjustable system lifetime and surveillanceaccuracy.The performance analysis shows that we achieve lower device cost,significant extension of thesystem lifetime and improvement on the data delivery rate compared with the traditional methods.展开更多
Due to the fading characteristics of wireless channels and the burstiness of data traffic,how to deal with congestion in Ad-hoc networks with effective algorithms is still open and challenging.In this paper,we focus o...Due to the fading characteristics of wireless channels and the burstiness of data traffic,how to deal with congestion in Ad-hoc networks with effective algorithms is still open and challenging.In this paper,we focus on enabling congestion control to minimize network transmission delays through flexible power control.To effectively solve the congestion problem,we propose a distributed cross-layer scheduling algorithm,which is empowered by graph-based multi-agent deep reinforcement learning.The transmit power is adaptively adjusted in real-time by our algorithm based only on local information(i.e.,channel state information and queue length)and local communication(i.e.,information exchanged with neighbors).Moreover,the training complexity of the algorithm is low due to the regional cooperation based on the graph attention network.In the evaluation,we show that our algorithm can reduce the transmission delay of data flow under severe signal interference and drastically changing channel states,and demonstrate the adaptability and stability in different topologies.The method is general and can be extended to various types of topologies.展开更多
This paper presents a wireless sensor network (WSN) access control algorithm designed to minimize WSN node energy consumption. Based on slotted ALOHA protocol, this algorithm incorporates the power control of physical...This paper presents a wireless sensor network (WSN) access control algorithm designed to minimize WSN node energy consumption. Based on slotted ALOHA protocol, this algorithm incorporates the power control of physical layer, the transmitting probability of medium access control (MAC) layer, and the automatic repeat request (ARQ) of link layer. In this algorithm, a cross-layer optimization is preformed to minimizing the energy consuming per bit. Through theory deducing, the transmitting probability and transmitting power level is determined, and the relationship between energy consuming per bit and throughput per node is provided. Analytical results show that the cross-layer algorithm results in a significant energy savings relative to layered design subject to the same throughput per node, and the energy saving is extraordinary in the low throughput region.展开更多
A new centrality measure for complex networks, called resource flow centrality, is pro- posed in this paper. This centrality measure is based on the concept of the resource flow in net- works. It not only can be appli...A new centrality measure for complex networks, called resource flow centrality, is pro- posed in this paper. This centrality measure is based on the concept of the resource flow in net- works. It not only can be applied to the connected networks, but also the disconnected networks. Moreover, it overcomes some disadvantages of several common centrality measures. The perform- ance of the proposed measure is compared with some standard centrality measures using a classic dataset and the results indicate the proposed measure performs more reasonably. The statistical dis- tribution of the proposed centrality is investigated by experiments on large scale computer generated graphs and two networks from the real world.展开更多
Lossy link is one of the unique characteristics in random-deployed sensor networks. We envision that robustness and reliability of routing cannot be ensured purely in network layer. Our idea is to enhance the performa...Lossy link is one of the unique characteristics in random-deployed sensor networks. We envision that robustness and reliability of routing cannot be ensured purely in network layer. Our idea is to enhance the performance of routing protocol by cross-layer interaction. We modified mint protocol, a routing protocol in TinyOS and proposed an enhanced version of mint called PA-mint. A transmission power control interface is added to network layer in PA-mint. When routing performance of the current network is not satisfied, PA-mint monotonically increases the transmission power via the interface we added. PA-mint is able to connect orphan nodes and robust to node mobility or key nodes failure. In the case that automatic request retransmission is employed, the number of retransmissions can be reduced by PA-mint. Results from experiments show that PA-mint increases the reliability and robustness of routing protocol by cross-layer interaction.展开更多
In this paper,we study cross-layer scheduling scheme on multimedia application which considers both streaming traffic and data traffic over cognitive ad hoc networks.A cross-layer design is proposed to optimize SU'...In this paper,we study cross-layer scheduling scheme on multimedia application which considers both streaming traffic and data traffic over cognitive ad hoc networks.A cross-layer design is proposed to optimize SU's utility,which is used as an approach to balance the transmission efficiency and heterogeneous traffic in cognitive ad hoc networks.A framework is provided for utility-based optimal subcarrier assignment,power allocation strategy and corresponding modulation scheme,subject to the interference threshold to primary user(PU)and total transmit power constraint.Bayesian learning is adopted in subcarrier allocation strategy to avoid collision and alleviate the burden of information exchange on limited common control channel(CCC).In addition,the M/G/l queuing model is also introduced to analyze the expected delay of streaming traffic.Numerical results are given to demonstrate that the proposed scheme significantly reduces the blocking probability and outperforms the mentioned single-channel dynamic resource scheduling by almost 8%in term of system utility.展开更多
With the development of rural tourism, the cooperation of villages has become very important.Identifying the status and importance of each village can contribute to better understanding of the integrated rural tourism...With the development of rural tourism, the cooperation of villages has become very important.Identifying the status and importance of each village can contribute to better understanding of the integrated rural tourism management and sustainable rural tourism development. The research focused on 46 villages of Yesanpo scenic spot in China(39°35'-40°north latitude, and 115°16'- 115°30' east longitude). Integrating the method of Geographical Information System(GIS) and social network analysis, the spatial centrality and interrelation of each village in Yesanpo tourism destination were evaluated. The results showed that Xinggezhuang is the spatial core village of the whole 46 villages in Yesanpo tourism areas; Xinggezhuang, Nanzhuang, Zhenchang, Daze, Liujiahe and Zishikou are sub-core villages of the six tourism spots. Magezhuang, Ximagezhuang, Eyu, Zishikou, Daze, Shangzhuang, Zhenchang and Xiazhuang should be support of the core villages, which provide subsidiary services and connects with other nodes. The results also indicated that the study of the village centrality will contribute to build an integrated hierarchy structure and to provide sufficient basis for further development of rural tourism destination.展开更多
In this paper, a novel idea for rate allocation combining both vertical coupling and horizontal coupling constraints is proposed, and a unified utility function to balance two paradoxical issues: efficiency and fairne...In this paper, a novel idea for rate allocation combining both vertical coupling and horizontal coupling constraints is proposed, and a unified utility function to balance two paradoxical issues: efficiency and fairness, revenue and cost is elaborated in WCDMA networks. Then, the optimal rate allocation problem is formulated as a network utility maximization(NUM) model based on cross-layer design and end-to-end congestion control, aiming at exploring the impacts of wired networks and the characteristics of radio access networks(RANs) on rate allocation. Furthermore, a distributed algorithm is derived, which can effectively match load states between RANs and wired networks, followed by a detailed illustration of the practical implementations. Numerical results demonstrate a signifi cant performance improvement in the end-to-end throughput.展开更多
Nearly all real-world networks are complex networks and usually are in danger of collapse.Therefore,it is crucial to exploit and understand the mechanisms of network attacks and provide better protection for network f...Nearly all real-world networks are complex networks and usually are in danger of collapse.Therefore,it is crucial to exploit and understand the mechanisms of network attacks and provide better protection for network functionalities.Network dismantling aims to find the smallest set of nodes such that after their removal the network is broken into connected components of sub-extensive size.To overcome the limitations and drawbacks of existing network dismantling methods,this paper focuses on network dismantling problem and proposes a neighbor-loop structure based centrality metric,NL,which achieves a balance between computational efficiency and evaluation accuracy.In addition,we design a novel method combining NL-based nodes-removing,greedy tree-breaking and reinsertion.Moreover,we compare five baseline methods with our algorithm on ten widely used real-world networks and three types of model networks including Erd€os-Renyi random networks,Watts-Strogatz smallworld networks and Barabasi-Albert scale-free networks with different network generation parameters.Experimental results demonstrate that our proposed method outperforms most peer methods by obtaining a minimal set of targeted attack nodes.Furthermore,the insights gained from this study may be of assistance to future practical research into real-world networks.展开更多
A proactive routing protocol CL-OLSR （cross-layer based optimized link state routing） by using a brand-new routing metric CLM （cross-layer metric） is proposed. CL-OLSR takes into account four link quality impact f...A proactive routing protocol CL-OLSR （cross-layer based optimized link state routing） by using a brand-new routing metric CLM （cross-layer metric） is proposed. CL-OLSR takes into account four link quality impact factors in route calculation through the cross-layer operation mechanism： the node available bandwidth, the node load, the link delivery rate, and the link interference, and thus the effect of route selection is optimized greatly. The simulation results show that the proposed CL-OLSR protocol can not only improve the network throughput to a large extent, but also reduce the end-to-end delay, while achieving load balance route results.展开更多
We propose the spectrum allocation and resource scheduling algorithms in cognitive point to multipoint (PMP) networks with rapid changes of spectrum opportunities and present a media access control (MAC) protocol base...We propose the spectrum allocation and resource scheduling algorithms in cognitive point to multipoint (PMP) networks with rapid changes of spectrum opportunities and present a media access control (MAC) protocol based on these algorithms. The objective of spectrum allocation is to make efficient use of the spectrum while maintaining the transceiver synchronization on frequency and time in the network. The objective of resource scheduling is to guarantee the quality of service (QoS) requirements of different kinds of connections and to minimize the total energy consumption in the network as well. By sensing only a small set of possible channels in each slot based on the state transition probability of each channel, our spectrum allocation algorithm achieves high spectrum efficiency in the network. The resource scheduling problem is divided into three sub problems and we derive optimal solutions to these problems by greedy algorithm and convex optimization. The simulation results show that our algorithm can make efficient use of the spectrum and the network resources at a cost of low computational complexity.展开更多
Finding crucial vertices is a key problem for improving the reliability and ensuring the effective operation of networks,solved by approaches based on multiple attribute decision that suffer from ignoring the correlat...Finding crucial vertices is a key problem for improving the reliability and ensuring the effective operation of networks,solved by approaches based on multiple attribute decision that suffer from ignoring the correlation among each attribute or the heterogeneity between attribute and structure. To overcome these problems, a novel vertex centrality approach, called VCJG, is proposed based on joint nonnegative matrix factorization and graph embedding. The potential attributes with linearly independent and the structure information are captured automatically in light of nonnegative matrix factorization for factorizing the weighted adjacent matrix and the structure matrix, which is generated by graph embedding. And the smoothness strategy is applied to eliminate the heterogeneity between attributes and structure by joint nonnegative matrix factorization. Then VCJG integrates the above steps to formulate an overall objective function, and obtain the ultimately potential attributes fused the structure information of network through optimizing the objective function. Finally, the attributes are combined with neighborhood rules to evaluate vertex's importance. Through comparative analyses with experiments on nine real-world networks, we demonstrate that the proposed approach outperforms nine state-of-the-art algorithms for identification of vital vertices with respect to correlation, monotonicity and accuracy of top-10 vertices ranking.展开更多
基金supported by the Provincial Industrial Science and Technology Project of State Grid Jiangsu Electric Power Co.,Ltd.of China,grant number JC2024118.
文摘The dense integration of residential distributed photovoltaic(PV)systems into three-phase,four-wire low-voltage(LV)distribution networks results in reverse power flow and three-phase imbalance,leading to voltage violations that hinder the growth of rural distributed PV systems.Traditional voltage droop-based control methods regulate PV power output solely based on local voltage measurements at the point of PV connection.Due to a lack of global coordination and optimization,their efficiency is often subpar.This paper presents a centralized coordinated active/reactive power control strategy for PV inverters in rural LV distribution feeders with high PV penetration.The strategy optimizes residential PV inverter reactive and active power control to enhance voltage quality.It uses sensitivity coefficients derived from the inverse Jacobian matrix to assign adjustment weights to individual PV units and iteratively optimize their power outputs.The control sequence prioritizes reactive power increases;if the coefficients are below average or the inverters reach capacity,active power is curtailed until voltage issues are resolved.A simulation based on a real 37-node rural distribution network shows that the proposed method significantly reduces PV curtailment.Typical daily results indicate a curtailment rate of 1.47%,which is significantly lower than the 15.4%observed with the voltage droop-based control method.The total daily PV power output(measured every 15 min)increases from 5.55 to 6.41 MW,improving PV hosting capacity.
基金Project supported by the Postgraduate Research and Practice Innovation Program of Jiangsu Province,China(Grant No.AE91313/001/016)the National Natural Science Foundation of China(Grant No.11701097)the Natural Science Foundation of Jiangxi Province,China(Grant No.20161BAB212055)
文摘In this paper, we propose a new centrality algorithm that can simultaneously rank the nodes and layers of multilayer networks, referred to as the MRFNL centrality. The centrality of nodes and layers are obtained by developing a novel iterative algorithm for computing a set of tensor equations. Under some conditions, the existence and uniqueness of this centrality were proven by applying the Brouwer fixed point theorem. Furthermore, the convergence of the proposed iterative algorithm was established. Finally, numerical experiments on a simple multilayer network and two real-world multilayer networks(i.e., Pierre Auger Collaboration and European Air Transportation Networks) are proposed to illustrate the effectiveness of the proposed algorithm and to compare it to other existing centrality measures.
文摘In this work we propose a centrality measure for networks, which we refer to as Laplacian centrality, that provides a general framework for the centrality of a vertex based on the idea that the importance (or centrality) of a vertex is related to the ability of the network to respond to the deactivation or removal of that vertex from the network. In particular, the Laplacian centrality of a vertex is defined as the relative drop of Laplacian energy caused by the deactivation of this vertex. The Laplacian energy of network G with?n?vertices is defined as , where ?is the eigenvalue of the Laplacian matrix of G. Other dynamics based measures such as that of Masuda and Kori and PageRank compute the importance of a node by analyzing the way paths pass through a node while our measure captures this information as well as the way these paths are “redistributed” when the node is deleted. The validity and robustness of this new measure are illustrated on two different terrorist social network data sets and 84 networks in James Moody’s Add Health in school friendship nomination data, and is compared with other standard centrality measures.
基金supported by the Program for Changjiang Scholars and Innovative Research Team in University under Grant No.IRT1078the Key Program of NSFC-Guangdong Union Foundation under Grant No.U1135002+1 种基金Major National S&T Program under Grant No.2011ZX03005-002the Fundamental Research Funds for the Central Universities under Grant No.JY10000903001
文摘Wireless Mesh Networks （WMNs） are vulnerable to various security threats because of their special infrastructure and communication mode, wherein insider attacks are the most challenging issue. To address this problem and protect innocent users from malicious attacks, it is important to encourage cooperation and deter malicious behaviors. Reputation systems constitute a major category of techniques used for managing trust in distributed networks, and they are effective in characterizing and quantifying a node＇s behavior for WMNs. However, conventional layered reputation mechanisms ignore several key factors of reputation in other layers; therefore, they cannot provide optimal performance and accurate malicious node identification and isolation for WMNs. In this paper, we propose a novel dynamic reputation mechanism, SLCRM, which couples reputation systems with a cross-layer design and node-security-rating classification techniques to dynamically detect and restrict insider attacks. Simulation results show that in terms of network throughput, packet delivery ratio, malicious nodes＇ identification, and success rates, SI_CRM imple- ments security protection against insider attacks in a more dynamic, effective, and efficient manner than the subjective logic and uncertainty-based reputation model and the familiarity-based reputation model.
基金supported by the National Natural Science Foundation of China under Grant No.61271281the National High Technology Research and Development Program of China (863 Program) under Grant No.SS2013AA010503
文摘To improve the robustness of the Low Earth Orbit(LEO) satellites networks and realise load balancing, a Cross-layer design and Ant-colony optimization based Load-balancing routing algorithm for LEO Satellite Networks(CAL-LSN) is proposed in this paper. In CALLSN, mobile agents are used to gather routing information actively. CAL-LSN can utilise the information of the physical layer to make routing decision during the route construction phase. In order to achieve load balancing, CALLSN makes use of a multi-objective optimization model. Meanwhile, how to take the value of some key parameters is discussed while designing the algorithm so as to improve the reliability. The performance is measured by the packet delivery rate, the end-to-end delay, the link utilization and delay jitter. Simulation results show that CAL-LSN performs well in balancing traffic load and increasing the packet delivery rate. Meanwhile, the end-to-end delay and delay jitter performance can meet the requirement of video transmission.
基金supported by the National Natural Science Foundation of China(No.61675033,61575026,61675233)National High Technical Research and Development Program of China(No.2015AA015504)
文摘This paper introduces an ant colony routing and wavelength assignment algorithm based on cross-layer design(CL-ACRWA),which can overcome the adverse effects of Doppler wavelength shift on data transmission in optical satellite networks. Firstly, a cross-layer optimization model is built, which considers the Doppler wavelength shift, the transmission delay as well as wavelength-continuity constraint. Then an ant colony algorithm is utilized to solve the cross-layer optimization model, resulting in finding an optimal light path satisfying the above constraints for every connection request. The performance of CL-ACRWA is measured by the communication success probability, the convergence property and the transmission delay. Simulation results show that CL-ACRWA performs well in communication success probability and has good global search ability as well as fast convergence speed. Meanwhile, the transmission delay can meet the basic requirement of real-time transmission of business.
文摘With correlating with human perception, quality of experience(Qo E) is also an important measurement in evaluation of video quality in addition to quality of service(Qo S). A cross-layer scheme based on Lyapunov optimization framework for H.264/AVC video streaming over wireless Ad hoc networks is proposed, with increasing both Qo E and Qo S performances. Different from existing works, this scheme routes and schedules video packets according to the statuses of the frame buffers at the destination nodes to reduce buffer underflows and to increase video playout continuity. The waiting time of head-ofline packets of data queues are considered in routing and scheduling to reduce the average end-to-end delay of video sessions. Different types of packets are allocated with different priorities according to their generated rates under H.264/AVC. To reduce the computational complexity, a distributed media access control policy and a power control algorithm cooperating with the media access policy are proposed. Simulation results show that, compared with existing schemes, this scheme can improve both the Qo S and Qo E performances. The average peak signal-to-noise ratio(PSNR) of the received video streams is also increased.
基金Supported by the 100 Top-Talents Program of Chinese Academic of Sciences (No. 99M2008M02)
文摘We investigate the problem of how to minimize the energy consumption in multi-hop Wireless Sensor Network (WSN),under the constraint of end-to-end reliability Quality of Seervice (QoS) requirement.Based on the investigation,we jointly consider the routing,relay selection and power allocation algorithm,and present a novel distributed cross-layer strategy using opportunistic relaying scheme for cooperative communication.The results show that under the same QoS requirement,the proposed cross-layer strategy performs better than other cross-layer cooperative communication algorithms in energy efficiency.We also investigated the impact of several parameters on the energy efficiency of the cooperative communication in WSNs,thus can be used to provide guidelines to decide when and how to apply cooperation for a given setup.
基金Supported by the National High Technology Research and Development Programme of China ( No. 2006AA01Z215)the National Natural Science Foundation of China (No. 60572060+2 种基金 60533110)the National Basic Research Program of China (973)( No. 2006CB303000)the CAS Innovation Proiect (No. KGCX2-YW-110-3)
文摘This paper describes the deployment optimization technology and the cross-layer design of a surveil-lance WSN system applied in relic protection.Facing the typical technical challenges in the applicationcontext of relic protection,we firstly propose a deployment technology based on ant colony optimization al-gorithm(DT-ACO)to overcome the difficulties in communication connectivity and sensing coverage.Meanwhile,DT-ACO minimizes the overall cost of the system as much as possible.Secondly we proposea novel power-aware cross-layer scheme(PACS)to facilitate adjustable system lifetime and surveillanceaccuracy.The performance analysis shows that we achieve lower device cost,significant extension of thesystem lifetime and improvement on the data delivery rate compared with the traditional methods.
基金supported by Institute of Information & communications Technology Planning & Evaluation (IITP) grant funded by the Korea government(MSIT) (No.RS-2022-00155885, Artificial Intelligence Convergence Innovation Human Resources Development (Hanyang University ERICA))supported by the National Natural Science Foundation of China under Grant No. 61971264the National Natural Science Foundation of China/Research Grants Council Collaborative Research Scheme under Grant No. 62261160390
文摘Due to the fading characteristics of wireless channels and the burstiness of data traffic,how to deal with congestion in Ad-hoc networks with effective algorithms is still open and challenging.In this paper,we focus on enabling congestion control to minimize network transmission delays through flexible power control.To effectively solve the congestion problem,we propose a distributed cross-layer scheduling algorithm,which is empowered by graph-based multi-agent deep reinforcement learning.The transmit power is adaptively adjusted in real-time by our algorithm based only on local information(i.e.,channel state information and queue length)and local communication(i.e.,information exchanged with neighbors).Moreover,the training complexity of the algorithm is low due to the regional cooperation based on the graph attention network.In the evaluation,we show that our algorithm can reduce the transmission delay of data flow under severe signal interference and drastically changing channel states,and demonstrate the adaptability and stability in different topologies.The method is general and can be extended to various types of topologies.
文摘This paper presents a wireless sensor network (WSN) access control algorithm designed to minimize WSN node energy consumption. Based on slotted ALOHA protocol, this algorithm incorporates the power control of physical layer, the transmitting probability of medium access control (MAC) layer, and the automatic repeat request (ARQ) of link layer. In this algorithm, a cross-layer optimization is preformed to minimizing the energy consuming per bit. Through theory deducing, the transmitting probability and transmitting power level is determined, and the relationship between energy consuming per bit and throughput per node is provided. Analytical results show that the cross-layer algorithm results in a significant energy savings relative to layered design subject to the same throughput per node, and the energy saving is extraordinary in the low throughput region.
基金Supported by the National Natural Science Foundation of China(61272119,61203372)
文摘A new centrality measure for complex networks, called resource flow centrality, is pro- posed in this paper. This centrality measure is based on the concept of the resource flow in net- works. It not only can be applied to the connected networks, but also the disconnected networks. Moreover, it overcomes some disadvantages of several common centrality measures. The perform- ance of the proposed measure is compared with some standard centrality measures using a classic dataset and the results indicate the proposed measure performs more reasonably. The statistical dis- tribution of the proposed centrality is investigated by experiments on large scale computer generated graphs and two networks from the real world.
基金Supported by National Natural Science Foundation of P. R. China (60374072, 60434030)
文摘Lossy link is one of the unique characteristics in random-deployed sensor networks. We envision that robustness and reliability of routing cannot be ensured purely in network layer. Our idea is to enhance the performance of routing protocol by cross-layer interaction. We modified mint protocol, a routing protocol in TinyOS and proposed an enhanced version of mint called PA-mint. A transmission power control interface is added to network layer in PA-mint. When routing performance of the current network is not satisfied, PA-mint monotonically increases the transmission power via the interface we added. PA-mint is able to connect orphan nodes and robust to node mobility or key nodes failure. In the case that automatic request retransmission is employed, the number of retransmissions can be reduced by PA-mint. Results from experiments show that PA-mint increases the reliability and robustness of routing protocol by cross-layer interaction.
基金This work was supported by the National Natural Science Foundations of China(Grant No.61201143)the Fundamental Research Fund for the Central Universities(Grant No.HIT.NSRIF.2010091)+1 种基金the National Science Foundation for Post-doctoral Scientists of China(Grant No.2012M510956)the Post-doc-toral Fund of Heilongjiang Province(GrantNo.LBHZ11128).
文摘In this paper,we study cross-layer scheduling scheme on multimedia application which considers both streaming traffic and data traffic over cognitive ad hoc networks.A cross-layer design is proposed to optimize SU's utility,which is used as an approach to balance the transmission efficiency and heterogeneous traffic in cognitive ad hoc networks.A framework is provided for utility-based optimal subcarrier assignment,power allocation strategy and corresponding modulation scheme,subject to the interference threshold to primary user(PU)and total transmit power constraint.Bayesian learning is adopted in subcarrier allocation strategy to avoid collision and alleviate the burden of information exchange on limited common control channel(CCC).In addition,the M/G/l queuing model is also introduced to analyze the expected delay of streaming traffic.Numerical results are given to demonstrate that the proposed scheme significantly reduces the blocking probability and outperforms the mentioned single-channel dynamic resource scheduling by almost 8%in term of system utility.
基金supported by the Humanities and Social Science Research Foundation Project of Tianjin Higher Colleges and Universities (No.20142112)
文摘With the development of rural tourism, the cooperation of villages has become very important.Identifying the status and importance of each village can contribute to better understanding of the integrated rural tourism management and sustainable rural tourism development. The research focused on 46 villages of Yesanpo scenic spot in China(39°35'-40°north latitude, and 115°16'- 115°30' east longitude). Integrating the method of Geographical Information System(GIS) and social network analysis, the spatial centrality and interrelation of each village in Yesanpo tourism destination were evaluated. The results showed that Xinggezhuang is the spatial core village of the whole 46 villages in Yesanpo tourism areas; Xinggezhuang, Nanzhuang, Zhenchang, Daze, Liujiahe and Zishikou are sub-core villages of the six tourism spots. Magezhuang, Ximagezhuang, Eyu, Zishikou, Daze, Shangzhuang, Zhenchang and Xiazhuang should be support of the core villages, which provide subsidiary services and connects with other nodes. The results also indicated that the study of the village centrality will contribute to build an integrated hierarchy structure and to provide sufficient basis for further development of rural tourism destination.
基金supported by National Natural Science Foundation of China (61172079, 61231008, 61201141, 61301176)111 Project (B08038)+1 种基金National S&T Major Project (2010ZX03003001)Shaanxi Province Science and Technology Research and Development Program (2011KJXX-40)
文摘In this paper, a novel idea for rate allocation combining both vertical coupling and horizontal coupling constraints is proposed, and a unified utility function to balance two paradoxical issues: efficiency and fairness, revenue and cost is elaborated in WCDMA networks. Then, the optimal rate allocation problem is formulated as a network utility maximization(NUM) model based on cross-layer design and end-to-end congestion control, aiming at exploring the impacts of wired networks and the characteristics of radio access networks(RANs) on rate allocation. Furthermore, a distributed algorithm is derived, which can effectively match load states between RANs and wired networks, followed by a detailed illustration of the practical implementations. Numerical results demonstrate a signifi cant performance improvement in the end-to-end throughput.
基金the National Natural Science Foundation of China under Grants 61871209 and 61901210,in part by Artificial Intelligence and Intelligent Transportation Joint Technical Center of HUST and Hubei Chutian Intelligent Transportation Co.,LTD under project”Intelligent Transportation Operation Monitoring Network and System”.
文摘Nearly all real-world networks are complex networks and usually are in danger of collapse.Therefore,it is crucial to exploit and understand the mechanisms of network attacks and provide better protection for network functionalities.Network dismantling aims to find the smallest set of nodes such that after their removal the network is broken into connected components of sub-extensive size.To overcome the limitations and drawbacks of existing network dismantling methods,this paper focuses on network dismantling problem and proposes a neighbor-loop structure based centrality metric,NL,which achieves a balance between computational efficiency and evaluation accuracy.In addition,we design a novel method combining NL-based nodes-removing,greedy tree-breaking and reinsertion.Moreover,we compare five baseline methods with our algorithm on ten widely used real-world networks and three types of model networks including Erd€os-Renyi random networks,Watts-Strogatz smallworld networks and Barabasi-Albert scale-free networks with different network generation parameters.Experimental results demonstrate that our proposed method outperforms most peer methods by obtaining a minimal set of targeted attack nodes.Furthermore,the insights gained from this study may be of assistance to future practical research into real-world networks.
基金supported by the Fundamental Research Funds for the Central Universities under Grant No.ZYGX2009j006Foundation of Science & Technology Department of Sichuan Province under Grant No.2011GZ0192
文摘A proactive routing protocol CL-OLSR （cross-layer based optimized link state routing） by using a brand-new routing metric CLM （cross-layer metric） is proposed. CL-OLSR takes into account four link quality impact factors in route calculation through the cross-layer operation mechanism： the node available bandwidth, the node load, the link delivery rate, and the link interference, and thus the effect of route selection is optimized greatly. The simulation results show that the proposed CL-OLSR protocol can not only improve the network throughput to a large extent, but also reduce the end-to-end delay, while achieving load balance route results.
基金Project (No. 2006AA01Z273) supported by the National Hi-TechResearch and Development Program (863) of China
文摘We propose the spectrum allocation and resource scheduling algorithms in cognitive point to multipoint (PMP) networks with rapid changes of spectrum opportunities and present a media access control (MAC) protocol based on these algorithms. The objective of spectrum allocation is to make efficient use of the spectrum while maintaining the transceiver synchronization on frequency and time in the network. The objective of resource scheduling is to guarantee the quality of service (QoS) requirements of different kinds of connections and to minimize the total energy consumption in the network as well. By sensing only a small set of possible channels in each slot based on the state transition probability of each channel, our spectrum allocation algorithm achieves high spectrum efficiency in the network. The resource scheduling problem is divided into three sub problems and we derive optimal solutions to these problems by greedy algorithm and convex optimization. The simulation results show that our algorithm can make efficient use of the spectrum and the network resources at a cost of low computational complexity.
基金Project supported by the National Natural Science Foundation of China (Grant Nos.62162040 and 11861045)。
文摘Finding crucial vertices is a key problem for improving the reliability and ensuring the effective operation of networks,solved by approaches based on multiple attribute decision that suffer from ignoring the correlation among each attribute or the heterogeneity between attribute and structure. To overcome these problems, a novel vertex centrality approach, called VCJG, is proposed based on joint nonnegative matrix factorization and graph embedding. The potential attributes with linearly independent and the structure information are captured automatically in light of nonnegative matrix factorization for factorizing the weighted adjacent matrix and the structure matrix, which is generated by graph embedding. And the smoothness strategy is applied to eliminate the heterogeneity between attributes and structure by joint nonnegative matrix factorization. Then VCJG integrates the above steps to formulate an overall objective function, and obtain the ultimately potential attributes fused the structure information of network through optimizing the objective function. Finally, the attributes are combined with neighborhood rules to evaluate vertex's importance. Through comparative analyses with experiments on nine real-world networks, we demonstrate that the proposed approach outperforms nine state-of-the-art algorithms for identification of vital vertices with respect to correlation, monotonicity and accuracy of top-10 vertices ranking.
