Recently, attacks have become Denial-of-Service （DOS） the mainstream threat to the internet service availability. The filter-based packet filtering is a key technology to defend against such attacks. Relying on the ...Recently, attacks have become Denial-of-Service （DOS） the mainstream threat to the internet service availability. The filter-based packet filtering is a key technology to defend against such attacks. Relying on the filtering location, the proposed schemes can be grouped into Victim-end Filtering and Source-end Filtering. The first scheme uses a single filtering router to block the attack flows near the victim, but does not take the factor that the filters are scarce resource into account, which causes the huge loss of legitimate flows; considering each router could contribute a few filters, the other extreme scheme pushes the filtering location back into each attack source so as to obtain ample filters, but this may incur the severe network transmission delay due to the abused filtering routers. Therefore, in this paper, we propose a scalable filter-based packet filtering scheme to balance the number of filtering routers and the available filters. Through emulating DoS scenarios based on the synthetic and real-world Intemet topologies and further implementing the various filter-based packet filtering schemes on them, the results show that our scheme just uses fewer filtering routers to cut off all attack flows while minimizing the loss of legitimate flows.展开更多
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.展开更多
In Delay Tolerant Networks (DTNs), establishing routing path from a source node to a destination node may not be possible, so the opportunistic routings are widely used. The energy and buffer constraints are general i...In Delay Tolerant Networks (DTNs), establishing routing path from a source node to a destination node may not be possible, so the opportunistic routings are widely used. The energy and buffer constraints are general in DTNs composed of the mobile phones or Pads. This paper proposes a novel opportunistic routing protocol, denoted by Large Opporturioty (LAOP), for the energy and buffer constrained DTNs. The objective of LAOP is to reach many receivers of a message with a small number of transmissions. By LAOP, the sender floods a message when the number of its neighbors is not less than a threshold. We compare the delivery performance of LAOP with other four widely used Delay or Disruption Tolerant Network (DTN) routing protocols, Direct Delivery, Epidemic routing, SprayAndWait and PRoPHET and demonstrate that LAOP can improve the delivery performance and decrease the delivery latency simultaneously.展开更多
ISA100.11 a industrial wireless network standard is based on a deterministic scheduling mechanism.For the timeslot delay caused by deterministic scheduling,a routing algorithm is presented for industrial environments....ISA100.11 a industrial wireless network standard is based on a deterministic scheduling mechanism.For the timeslot delay caused by deterministic scheduling,a routing algorithm is presented for industrial environments.According to timeslot,superframe,links,channel and data retransmission of deterministic scheduling mechanisms that affect the design of the routing algorithm,the algorithm selects the link quality,timeslot delay and retransmission delay as the routing criteria and finds the optimum communication path by k shortest paths algorithm.Theoretical analysis and experimental verification show that the optimal paths selected by the algorithm not only have high link quality and low retransmission delay,but also meet the requirements of the deterministic scheduling.The algorithm can effectively solve the problem of packet loss and transmission delay during data transmission,and provide a valuable solution for efficient data transmission based on determinacy.展开更多
with the development of science and technology, smart home systems require better, faster to meet the needs of human. In order to achieve this goal, the human-machine-items all need to interact each other with underst...with the development of science and technology, smart home systems require better, faster to meet the needs of human. In order to achieve this goal, the human-machine-items all need to interact each other with understand, efficient and speedy. Cps could unify combination with the human-machine-items; realize the interaction between the physical nformation and the cyber world. However, information interaction and the control task needs to be completed in a valid time. Therefore, the transform delay control strategy becomes more and more important. This paper analysis Markov delay control strategy for smart home systems, which might help the system decrease the transmission delay.展开更多
The topological structure of a complex dynamical network plays a vital role in determining the network＇s evolutionary mecha- nisms and functional behaviors, thus recognizing and inferring the network structure is of ...The topological structure of a complex dynamical network plays a vital role in determining the network＇s evolutionary mecha- nisms and functional behaviors, thus recognizing and inferring the network structure is of both theoretical and practical signif- icance. Although various approaches have been proposed to estimate network topologies, many are not well established to the noisy nature of network dynamics and ubiquity of transmission delay among network individuals. This paper focuses on to- pology inference of uncertain complex dynamical networks. An auxiliary network is constructed and an adaptive scheme is proposed to track topological parameters. It is noteworthy that the considered network model is supposed to contain practical stochastic perturbations, and noisy observations are taken as control inputs of the constructed auxiliary network. In particular, the control technique can be further employed to locate hidden sources （or latent variables） in networks. Numerical examples are provided to illustrate the effectiveness of the proposed scheme. In addition, the impact of coupling strength and coupling delay on identification performance is assessed. The proposed scheme provides engineers with a convenient approach to infer topologies of general complex dynamical networks and locate hidden sources, and the detailed performance evaluation can further facilitate practical circuit design.展开更多
基金supported by the Doctoral Fund of Northeastern University of Qinhuangdao(No.XNB201410)the Fundamental Research Funds for the Central Universities(No.N130323005)+1 种基金the Natural Science Foundation of Hebei Province of China(No.F2015501122)the Doctoral Scientific Research Foundation of Liaoning Province(No.201501143)
文摘Recently, attacks have become Denial-of-Service （DOS） the mainstream threat to the internet service availability. The filter-based packet filtering is a key technology to defend against such attacks. Relying on the filtering location, the proposed schemes can be grouped into Victim-end Filtering and Source-end Filtering. The first scheme uses a single filtering router to block the attack flows near the victim, but does not take the factor that the filters are scarce resource into account, which causes the huge loss of legitimate flows; considering each router could contribute a few filters, the other extreme scheme pushes the filtering location back into each attack source so as to obtain ample filters, but this may incur the severe network transmission delay due to the abused filtering routers. Therefore, in this paper, we propose a scalable filter-based packet filtering scheme to balance the number of filtering routers and the available filters. Through emulating DoS scenarios based on the synthetic and real-world Intemet topologies and further implementing the various filter-based packet filtering schemes on them, the results show that our scheme just uses fewer filtering routers to cut off all attack flows while minimizing the loss of legitimate flows.
基金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.
基金This work was supported by the National Natural Science Foundation of China under Grants No. 61100208, No. 61100205 the Natural Science Foundation of Jiangsu under Grant No. BK2011169. Pietro lio was supported by the EU FP7 project RECOGNITION： Relevance and Cognition for Self-Awareness in a Content-Centric Intemet.
文摘In Delay Tolerant Networks (DTNs), establishing routing path from a source node to a destination node may not be possible, so the opportunistic routings are widely used. The energy and buffer constraints are general in DTNs composed of the mobile phones or Pads. This paper proposes a novel opportunistic routing protocol, denoted by Large Opporturioty (LAOP), for the energy and buffer constrained DTNs. The objective of LAOP is to reach many receivers of a message with a small number of transmissions. By LAOP, the sender floods a message when the number of its neighbors is not less than a threshold. We compare the delivery performance of LAOP with other four widely used Delay or Disruption Tolerant Network (DTN) routing protocols, Direct Delivery, Epidemic routing, SprayAndWait and PRoPHET and demonstrate that LAOP can improve the delivery performance and decrease the delivery latency simultaneously.
基金Supported by the National Natural Science Foundation of China(No.61301125)the National High Technology Research and Development Programme of China(No.0AA0401028003)+2 种基金National Science and Technology Major Project(No.2013ZX03005005)the Fundamental and Advanced Research Program of Chongqing(No.cstc2013jcyjA40008)the Youth Top-notch Talent Support Program of Chongqing(No.2013-139)
文摘ISA100.11 a industrial wireless network standard is based on a deterministic scheduling mechanism.For the timeslot delay caused by deterministic scheduling,a routing algorithm is presented for industrial environments.According to timeslot,superframe,links,channel and data retransmission of deterministic scheduling mechanisms that affect the design of the routing algorithm,the algorithm selects the link quality,timeslot delay and retransmission delay as the routing criteria and finds the optimum communication path by k shortest paths algorithm.Theoretical analysis and experimental verification show that the optimal paths selected by the algorithm not only have high link quality and low retransmission delay,but also meet the requirements of the deterministic scheduling.The algorithm can effectively solve the problem of packet loss and transmission delay during data transmission,and provide a valuable solution for efficient data transmission based on determinacy.
文摘with the development of science and technology, smart home systems require better, faster to meet the needs of human. In order to achieve this goal, the human-machine-items all need to interact each other with understand, efficient and speedy. Cps could unify combination with the human-machine-items; realize the interaction between the physical nformation and the cyber world. However, information interaction and the control task needs to be completed in a valid time. Therefore, the transform delay control strategy becomes more and more important. This paper analysis Markov delay control strategy for smart home systems, which might help the system decrease the transmission delay.
基金supported by the National Science and Technology Major Project of China(Grant No.2014ZX10004001-014)the National Natural Science Foundation of China(Grant Nos.61573262,61532020&11472290)the Fundamental Research Funds for the Central Universities(Grant No.2014201020206)
文摘The topological structure of a complex dynamical network plays a vital role in determining the network＇s evolutionary mecha- nisms and functional behaviors, thus recognizing and inferring the network structure is of both theoretical and practical signif- icance. Although various approaches have been proposed to estimate network topologies, many are not well established to the noisy nature of network dynamics and ubiquity of transmission delay among network individuals. This paper focuses on to- pology inference of uncertain complex dynamical networks. An auxiliary network is constructed and an adaptive scheme is proposed to track topological parameters. It is noteworthy that the considered network model is supposed to contain practical stochastic perturbations, and noisy observations are taken as control inputs of the constructed auxiliary network. In particular, the control technique can be further employed to locate hidden sources （or latent variables） in networks. Numerical examples are provided to illustrate the effectiveness of the proposed scheme. In addition, the impact of coupling strength and coupling delay on identification performance is assessed. The proposed scheme provides engineers with a convenient approach to infer topologies of general complex dynamical networks and locate hidden sources, and the detailed performance evaluation can further facilitate practical circuit design.
