Accurate time synchronization is fundamental to the correct and efficient operation of Wireless Sensor Networks(WSNs),especially in security-critical,time-sensitive applications.However,most existing protocols degrade...Accurate time synchronization is fundamental to the correct and efficient operation of Wireless Sensor Networks(WSNs),especially in security-critical,time-sensitive applications.However,most existing protocols degrade substantially under malicious interference.We introduce iSTSP,an Intelligent and Secure Time Synchronization Protocol that implements a four-stage defense pipeline to ensure robust,precise synchronization even in hostile environments:(1)trust preprocessing that filters node participation using behavioral trust scoring;(2)anomaly isolation employing a lightweight autoencoder to detect and excise malicious nodes in real time;(3)reliability-weighted consensus that prioritizes high-trust nodes during time aggregation;and(4)convergence-optimized synchronization that dynamically adjusts parameters using theoretical stability bounds.We provide rigorous convergence analysis including a closed-form expression for convergence time,and validate the protocol through both simulations and realworld experiments on a controlled 16-node testbed.Under Sybil attacks with five malicious nodes within this testbed,iSTSP maintains synchronization error increases under 12%and achieves a rapid convergence.Compared to state-ofthe-art protocols like TPSN,SE-FTSP,and MMAR-CTS,iSTSP offers 60%faster detection,broader threat coverage,and more than 7 times lower synchronization error,with a modest 9.3%energy overhead over 8 h.We argue this is an acceptable trade-off for mission-critical deployments requiring guaranteed security.These findings demonstrate iSTSP’s potential as a reliable solution for secure WSN synchronization and motivate future work on large-scale IoT deployments and integration with energy-efficient communication protocols.展开更多
This paper presents a novel real-time routing protocol, called CBRR, with less energy consumption for wireless sensor networks (WSNs). End-to-End real-time requirements are fulfilled with speed or delay constraint at ...This paper presents a novel real-time routing protocol, called CBRR, with less energy consumption for wireless sensor networks (WSNs). End-to-End real-time requirements are fulfilled with speed or delay constraint at each hop through integrating the contention and neighbor table mechanisms. More precisely, CBRR maintains a neighbor table via the contention mechanism being dependent on wireless broadcast instead of beacons. Comprehensive simulations show that CBRR can not only achieve higher performance in static networks, but also work well for dynamic networks.展开更多
The authors propose a new persistent transmission based real time Ethernet MAC protocol that provides a predictable upper bound for the delivery delay of real time frames. Moreover, it is compatible with the protocol ...The authors propose a new persistent transmission based real time Ethernet MAC protocol that provides a predictable upper bound for the delivery delay of real time frames. Moreover, it is compatible with the protocol used by the existing Ethernet controllers for conventional datagram traffic and thus standard Ethernet stations can be used in the system without any modification. The paper describes the protocol in detail and analyses the maximum delivery delay for real time traffic and the efficiency of the channel.展开更多
Coverage holes often appear in wireless sensor networks due to sensor failure or the inheritance of sensor＇s random distribution. In the hybrid model, mobile sensors in the network are acquired to heal coverage holes...Coverage holes often appear in wireless sensor networks due to sensor failure or the inheritance of sensor＇s random distribution. In the hybrid model, mobile sensors in the network are acquired to heal coverage holes by their mobifity. When multiple coverage holes appear in the sensor network and each of them has a time requirement （in which the coverage hole has to be healed）, conflicts for the requests of the same mobile sensor may arise. A distributed multiple mobile sensor schedufing protocol （DMS） is proposed in this paper to solve this problem by finding mobile sensors in the time response zone defined by the time requirement of each coverage hole. Simulation results show that DMS can well schedule the mobile sensors to move to multiple coverage holes within the time requirement.展开更多
Based on a media access and control（MAC）protocol,an arrangement of channels and transceivers in optical packet switching dense wavelength division multiplexing（DWDM）networks is proposed in this paper.In order to r...Based on a media access and control（MAC）protocol,an arrangement of channels and transceivers in optical packet switching dense wavelength division multiplexing（DWDM）networks is proposed in this paper.In order to reduce the cost of nodes,fixed transmitters and receivers are used instead of tunable transmitters and receivers.Two fixed transmitters and many fixed receivers are used in each node in the scheme.The average waiting delay of this scheme is analyzed through mathematics and computer simulation.The result shows that the property of the scheme is almost the same as using tunable transmitter and receiver.Furthermore,if the tuning time of tunable transmitters is taken into account,the performance of the tunable transmitter scheme is poor than this scheme at the average waiting delay and throughput of the network.展开更多
Mobile ad hoc networking （MANET） has become an exciting and important technology in recent years, because of the rapid proliferation of wireless devices. Mobile ad hoc networks is highly vulnerable to attacks due to...Mobile ad hoc networking （MANET） has become an exciting and important technology in recent years, because of the rapid proliferation of wireless devices. Mobile ad hoc networks is highly vulnerable to attacks due to the open medium, dynamically changing network topology, cooperative algorithms, and lack of centralized monitoring and management point. The traditional way of protecting networks with firewalls and encryption software is no longer sufficient and effective for those features. A distributed intrusion detection approach based on timed automata is given. A cluster-based detection scheme is presented, where periodically a node is elected as the monitor node for a cluster. These monitor nodes can not only make local intrusion detection decisions, but also cooperatively take part in global intrusion detection. And then the timed automata is constructed by the way of manually abstracting the correct behaviours of the node according to the routing protocol of dynamic source routing （DSR）. The monitor nodes can verify the behaviour of every nodes by timed automata, and validly detect real-time attacks without signatures of intrusion or trained data. Compared with the architecture where each node is its own IDS agent, the approach is much more efficient while maintaining the same level of effectiveness. Finally, the intrusion detection method is evaluated through simulation experiments.展开更多
Time Sensitive Networking(TSN)will be an integral component of industrial networking.Time synchronization in TSN is provided by the IEEE-1588,Precision Time Protocol(PTP)protocol.The standard,dating back to 2008,margi...Time Sensitive Networking(TSN)will be an integral component of industrial networking.Time synchronization in TSN is provided by the IEEE-1588,Precision Time Protocol(PTP)protocol.The standard,dating back to 2008,marginally addresses security aspects,notably not encompassing the frames designed for management purposes(Type Length Values or TLVs).In this work we show that the TLVs can be abused by an attacker to reconfigure,manipulate,or shut down time synchronization.The effects of such an attack can be serious,ranging from interruption of operations to actual unintended behavior of industrial devices,possibly resulting in physical damages or even harm to operators.The paper analyzes the root causes of this vulnerability,and provides concrete examples of attacks leveraging it to de-synchronize the clocks,showing that they can succeed with limited resources,realistically available to a malicious actor.展开更多
A reasonable parameter configuration helps improve the data transmission performance of the Licklider Transmission Protocol(LTP).Previous research has focused mainly on parameter optimization for LTP in simplified sce...A reasonable parameter configuration helps improve the data transmission performance of the Licklider Transmission Protocol(LTP).Previous research has focused mainly on parameter optimization for LTP in simplified scenarios with one to two hops or multihop scenarios with a custody mechanism of the Bundle Protocol(BP).However,the research results are not applicable to communications in Complex Deep Space Networks(CDSNs)without the custody mechanism of BP that are more suitable for deep space communications with LTP.In this paper,we propose a model of file delivery time for LTP in CDSNs.Based on the model,we propose a Parameter Optimization Design Algorithm for LTP(LTP-PODA)of configuring reasonable parameters for LTP.The results show that the accuracy of the proposed model is at least 6.47%higher than that of the previously established models based on simple scenarios,and the proposed model is more suitable for CDSNs.Moreover,the LTP parameters are optimized by the LTP-PODA algorithm to obtain an optimization plan.Configuring the optimization plan for LTP improves the protocol transmission performance by at least 18.77%compared with configuring the other parameter configuration plans.展开更多
Efficient multi-machine cooperation and network dynamics still remain open that jeopardize great applications in largescale machine-to-machine(M2M) networks. Among all possible machine cooperation controls, to synchro...Efficient multi-machine cooperation and network dynamics still remain open that jeopardize great applications in largescale machine-to-machine(M2M) networks. Among all possible machine cooperation controls, to synchronize tremendous machines in a timing-efficient brings one of the greatest challenge and serves as the foundation for any other network control policies. In this paper, we propose a linear-time synchronization protocol in large M2M networks. Specifically, a closed-form of synchronization rate is provided by developing the statistical bounds of the second smallest eigenvalue of the graph Laplacian matrix. These bounds enable the efficient control of network dynamics, facilitating the timing synchronization in networks. Through a practical study in Metropolis, simulation results confirm our theoretical analysis and provide effective selection of wireless technologies, including Zigbee, Wi-Fi, and cellular systems, with respect to the deployed density of machines. Therefore, this paper successfully demonstrates a practical timing synchronization, to make a breakthrough of network dynamic control in real-world machine systems, such as Internet of Things.展开更多
This paper proposes second-order consensus protocols and gives a measure of the robustness of the protocols to the time-delays existing in the dynamics of agents with second-order dynamics. By employing a frequency do...This paper proposes second-order consensus protocols and gives a measure of the robustness of the protocols to the time-delays existing in the dynamics of agents with second-order dynamics. By employing a frequency domain method, it is proven that the information states achieve second-order consensus asymptotically for appropriate time-delay if the topology of the network is connected. Particularly, a nonconservative upper bound on the fixed time-delay that can be tolerated is found. The consensus protocols are distributed in the sense that each agent only needs information from its neighboring agents, which makes the proposed protocols scalable. It reduces the complexity of connections among agents significantly. Simulation results are provided to verify the effectiveness of the theoretical results for second-order consensus in networks in the presence of time-delays existing in the dynamics of agents.展开更多
Nodes in the communication network mainly depend on the Media Access Control(MAC)layer protocol design.To ensure the MAC protocol achieves high throughput,low latency,and high service quality,this paper designed a“ce...Nodes in the communication network mainly depend on the Media Access Control(MAC)layer protocol design.To ensure the MAC protocol achieves high throughput,low latency,and high service quality,this paper designed a“centralized-distribution”system MAC protocol combined with a slot allocation algorithm.This allows it to quickly adapt to the topology changes in the network and the overall network frame structure.For the centralized time slot allocation,since the system’s frame structure changes across the entire network,the root node must gather information from other nodes.This ensures that the root node can collect the latest topology information when the network topology changes and subsequently adjust the frame structure of the whole network for the distributed time slot allocation.The simulation results show that the adaptive time-division multiple access mechanism can quickly adapt to changes in topology and the network’s frame structure.It enables adaptive changes in node transmission times,ensures the rapid transmission and circulation of large-capacity data between nodes,and improves transmission efficiency.展开更多
基金this project under Geran Putra Inisiatif(GPI)with reference of GP-GPI/2023/976210。
文摘Accurate time synchronization is fundamental to the correct and efficient operation of Wireless Sensor Networks(WSNs),especially in security-critical,time-sensitive applications.However,most existing protocols degrade substantially under malicious interference.We introduce iSTSP,an Intelligent and Secure Time Synchronization Protocol that implements a four-stage defense pipeline to ensure robust,precise synchronization even in hostile environments:(1)trust preprocessing that filters node participation using behavioral trust scoring;(2)anomaly isolation employing a lightweight autoencoder to detect and excise malicious nodes in real time;(3)reliability-weighted consensus that prioritizes high-trust nodes during time aggregation;and(4)convergence-optimized synchronization that dynamically adjusts parameters using theoretical stability bounds.We provide rigorous convergence analysis including a closed-form expression for convergence time,and validate the protocol through both simulations and realworld experiments on a controlled 16-node testbed.Under Sybil attacks with five malicious nodes within this testbed,iSTSP maintains synchronization error increases under 12%and achieves a rapid convergence.Compared to state-ofthe-art protocols like TPSN,SE-FTSP,and MMAR-CTS,iSTSP offers 60%faster detection,broader threat coverage,and more than 7 times lower synchronization error,with a modest 9.3%energy overhead over 8 h.We argue this is an acceptable trade-off for mission-critical deployments requiring guaranteed security.These findings demonstrate iSTSP’s potential as a reliable solution for secure WSN synchronization and motivate future work on large-scale IoT deployments and integration with energy-efficient communication protocols.
文摘This paper presents a novel real-time routing protocol, called CBRR, with less energy consumption for wireless sensor networks (WSNs). End-to-End real-time requirements are fulfilled with speed or delay constraint at each hop through integrating the contention and neighbor table mechanisms. More precisely, CBRR maintains a neighbor table via the contention mechanism being dependent on wireless broadcast instead of beacons. Comprehensive simulations show that CBRR can not only achieve higher performance in static networks, but also work well for dynamic networks.
基金TheNationalNaturalScienceFoundationofChina (No .6 9984 0 0 3)
文摘The authors propose a new persistent transmission based real time Ethernet MAC protocol that provides a predictable upper bound for the delivery delay of real time frames. Moreover, it is compatible with the protocol used by the existing Ethernet controllers for conventional datagram traffic and thus standard Ethernet stations can be used in the system without any modification. The paper describes the protocol in detail and analyses the maximum delivery delay for real time traffic and the efficiency of the channel.
基金supported by the National Natural Science Foundation of China under Grant No. 61133016
文摘Coverage holes often appear in wireless sensor networks due to sensor failure or the inheritance of sensor＇s random distribution. In the hybrid model, mobile sensors in the network are acquired to heal coverage holes by their mobifity. When multiple coverage holes appear in the sensor network and each of them has a time requirement （in which the coverage hole has to be healed）, conflicts for the requests of the same mobile sensor may arise. A distributed multiple mobile sensor schedufing protocol （DMS） is proposed in this paper to solve this problem by finding mobile sensors in the time response zone defined by the time requirement of each coverage hole. Simulation results show that DMS can well schedule the mobile sensors to move to multiple coverage holes within the time requirement.
文摘Based on a media access and control（MAC）protocol,an arrangement of channels and transceivers in optical packet switching dense wavelength division multiplexing（DWDM）networks is proposed in this paper.In order to reduce the cost of nodes,fixed transmitters and receivers are used instead of tunable transmitters and receivers.Two fixed transmitters and many fixed receivers are used in each node in the scheme.The average waiting delay of this scheme is analyzed through mathematics and computer simulation.The result shows that the property of the scheme is almost the same as using tunable transmitter and receiver.Furthermore,if the tuning time of tunable transmitters is taken into account,the performance of the tunable transmitter scheme is poor than this scheme at the average waiting delay and throughput of the network.
基金the National High Technology Development "863" Program of China (2006AA01Z436, 2007AA01Z452)the National Natural Science Foundation of China(60702042).
文摘Mobile ad hoc networking （MANET） has become an exciting and important technology in recent years, because of the rapid proliferation of wireless devices. Mobile ad hoc networks is highly vulnerable to attacks due to the open medium, dynamically changing network topology, cooperative algorithms, and lack of centralized monitoring and management point. The traditional way of protecting networks with firewalls and encryption software is no longer sufficient and effective for those features. A distributed intrusion detection approach based on timed automata is given. A cluster-based detection scheme is presented, where periodically a node is elected as the monitor node for a cluster. These monitor nodes can not only make local intrusion detection decisions, but also cooperatively take part in global intrusion detection. And then the timed automata is constructed by the way of manually abstracting the correct behaviours of the node according to the routing protocol of dynamic source routing （DSR）. The monitor nodes can verify the behaviour of every nodes by timed automata, and validly detect real-time attacks without signatures of intrusion or trained data. Compared with the architecture where each node is its own IDS agent, the approach is much more efficient while maintaining the same level of effectiveness. Finally, the intrusion detection method is evaluated through simulation experiments.
文摘Time Sensitive Networking(TSN)will be an integral component of industrial networking.Time synchronization in TSN is provided by the IEEE-1588,Precision Time Protocol(PTP)protocol.The standard,dating back to 2008,marginally addresses security aspects,notably not encompassing the frames designed for management purposes(Type Length Values or TLVs).In this work we show that the TLVs can be abused by an attacker to reconfigure,manipulate,or shut down time synchronization.The effects of such an attack can be serious,ranging from interruption of operations to actual unintended behavior of industrial devices,possibly resulting in physical damages or even harm to operators.The paper analyzes the root causes of this vulnerability,and provides concrete examples of attacks leveraging it to de-synchronize the clocks,showing that they can succeed with limited resources,realistically available to a malicious actor.
基金supported by the Strategic Leading Project of the Chinese Academy of Sciences(No.XDA15014603).
文摘A reasonable parameter configuration helps improve the data transmission performance of the Licklider Transmission Protocol(LTP).Previous research has focused mainly on parameter optimization for LTP in simplified scenarios with one to two hops or multihop scenarios with a custody mechanism of the Bundle Protocol(BP).However,the research results are not applicable to communications in Complex Deep Space Networks(CDSNs)without the custody mechanism of BP that are more suitable for deep space communications with LTP.In this paper,we propose a model of file delivery time for LTP in CDSNs.Based on the model,we propose a Parameter Optimization Design Algorithm for LTP(LTP-PODA)of configuring reasonable parameters for LTP.The results show that the accuracy of the proposed model is at least 6.47%higher than that of the previously established models based on simple scenarios,and the proposed model is more suitable for CDSNs.Moreover,the LTP parameters are optimized by the LTP-PODA algorithm to obtain an optimization plan.Configuring the optimization plan for LTP improves the protocol transmission performance by at least 18.77%compared with configuring the other parameter configuration plans.
基金supported by the Major Research plan of the National Natural Science Foundation of China 9118008National Key Technology R&D Program of the Ministry of Science and Technology 2014BAC16B01
文摘Efficient multi-machine cooperation and network dynamics still remain open that jeopardize great applications in largescale machine-to-machine(M2M) networks. Among all possible machine cooperation controls, to synchronize tremendous machines in a timing-efficient brings one of the greatest challenge and serves as the foundation for any other network control policies. In this paper, we propose a linear-time synchronization protocol in large M2M networks. Specifically, a closed-form of synchronization rate is provided by developing the statistical bounds of the second smallest eigenvalue of the graph Laplacian matrix. These bounds enable the efficient control of network dynamics, facilitating the timing synchronization in networks. Through a practical study in Metropolis, simulation results confirm our theoretical analysis and provide effective selection of wireless technologies, including Zigbee, Wi-Fi, and cellular systems, with respect to the deployed density of machines. Therefore, this paper successfully demonstrates a practical timing synchronization, to make a breakthrough of network dynamic control in real-world machine systems, such as Internet of Things.
基金Supported by the National Natural Science Foundation of China (60574088, 60274014)
文摘This paper proposes second-order consensus protocols and gives a measure of the robustness of the protocols to the time-delays existing in the dynamics of agents with second-order dynamics. By employing a frequency domain method, it is proven that the information states achieve second-order consensus asymptotically for appropriate time-delay if the topology of the network is connected. Particularly, a nonconservative upper bound on the fixed time-delay that can be tolerated is found. The consensus protocols are distributed in the sense that each agent only needs information from its neighboring agents, which makes the proposed protocols scalable. It reduces the complexity of connections among agents significantly. Simulation results are provided to verify the effectiveness of the theoretical results for second-order consensus in networks in the presence of time-delays existing in the dynamics of agents.
文摘Nodes in the communication network mainly depend on the Media Access Control(MAC)layer protocol design.To ensure the MAC protocol achieves high throughput,low latency,and high service quality,this paper designed a“centralized-distribution”system MAC protocol combined with a slot allocation algorithm.This allows it to quickly adapt to the topology changes in the network and the overall network frame structure.For the centralized time slot allocation,since the system’s frame structure changes across the entire network,the root node must gather information from other nodes.This ensures that the root node can collect the latest topology information when the network topology changes and subsequently adjust the frame structure of the whole network for the distributed time slot allocation.The simulation results show that the adaptive time-division multiple access mechanism can quickly adapt to changes in topology and the network’s frame structure.It enables adaptive changes in node transmission times,ensures the rapid transmission and circulation of large-capacity data between nodes,and improves transmission efficiency.
