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.展开更多
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.展开更多
The IEEE 1588 precision time protocol(PTP)is very important for many industrial sectors and applications that require time synchronization accuracy between computers down to microsecond and even nanosecond levels.Neve...The IEEE 1588 precision time protocol(PTP)is very important for many industrial sectors and applications that require time synchronization accuracy between computers down to microsecond and even nanosecond levels.Nevertheless,PTP and its underlying network infrastructure are vulnerable to cyber-attacks,which can stealthily reduce the time synchronization accuracy to unacceptable and even damage-causing levels for individual clocks or an entire network,leading to financial loss or even physical destruction.Existing security protocol extensions only partially address this problem.This paper provides a comprehensive analysis of strategies for advanced persistent threats to PTP infrastructure,possible attacker locations,and the impact on clock and network synchronization in the presence of security protocol extensions,infrastructure redundancy,and protocol redundancy.It distinguishes between attack strategies and attacker types as described in RFC7384,but further distinguishes between the spoofing and time source attack,the simple internal attack,and the advanced internal attack.Some experiments were conducted to demonstrate the impact of PTP attacks.Our analysis shows that a sophisticated attacker has a range of methodologies to compromise a PTP network.Moreover,all PTP infrastructure components can host an attacker,making the comprehensive protection of a PTP network against a malware infiltration,as for example exercised by Stuxnet,a very tedious task.展开更多
The contract net protocol has developed to specify problem solving communication for nodes in a distributed problem solving. Task distribution is affected by a negotiation process,a discussion carried on between node...The contract net protocol has developed to specify problem solving communication for nodes in a distributed problem solving. Task distribution is affected by a negotiation process,a discussion carried on between nodes with tasks to he executed and nodes that may be able to execute those tasks. In contract net protocol,once negotiation successes,tbe task execution is assumed to success. However,in real world,even though a task is awarded to successfully bidding nodes,it may be delayed. Such delay may badly propagate in whole system. Here,we introduce real-time constraints into contract net protocol to manage task execution for avoiding the, task's delay,or even though being delayed,the railure cannot propagate to whole system. In this paper,we first present a real-time contract net protocol which is an extension of contract net protocol with real-time constraints for distributed computing. Our proposition extends the basic negotiation protocol to negotiation and controlling execution or task. The controlling process is based on task deadline time,we also present an extension of the internode language of contract net protocol specification with real-time constraints.展开更多
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.展开更多
Considering characteristic of mHealth communication and problems of existing methods, this paper presents a real-time communication method for mHealth based on extended XMPP protocol. The method can maintain the role ...Considering characteristic of mHealth communication and problems of existing methods, this paper presents a real-time communication method for mHealth based on extended XMPP protocol. The method can maintain the role status efficiently and reduce data latency during the communication process. Meanwhile, it can be extended flexibly to meet increasing communication demands of mHealth services. Furthermore, a system framework is presented to support telemonitoring scene. Finally, system implementation and feasibility tests verify the effectiveness of the method and framework.展开更多
Interoperability testing is an important technique to ensure the quality of implementations of network communication protocol. In the next generation Internet protocol, real-time applications should be supported effec...Interoperability testing is an important technique to ensure the quality of implementations of network communication protocol. In the next generation Internet protocol, real-time applications should be supported effectively. However, time constraints were not considered in the related studies of protocol interoperability testing, so existing interoperability testing methods are difficult to be applied in real-time protocol interoperability testing. In this paper, a formal method to real-time protocol interoperability testing is proposed. Firstly, a formal model CMpTIOA （communicating multi-port timed input output automata） is defined to specify the system under test （SUT） in real-time protocol interoperability testing; based on this model, timed interoperability relation is then defined. In order to check this relation, a test generation method is presented to generate a parameterized test behavior tree from SUT model; a mechanism of executability pre-determination is also integrated in the test generation method to alleviate state space explosion problem to some extent. The proposed theory and method are then applied in interoperability testing of IPv6 neighbor discovery protocol to show the feasibility of this method.展开更多
Many existing real time commit protocols try to improve system performance by allowing a committing cohort to lend its data to an executing cohort, thus reducing data inaccessibility. They block the borrower from send...Many existing real time commit protocols try to improve system performance by allowing a committing cohort to lend its data to an executing cohort, thus reducing data inaccessibility. They block the borrower from sending WORKDONE/PREPARED message and restrict them from lending data so that transaction abort chain is limited to one. Thus, transaction execution time increases. This paper proposes a modified real time commit protocol for distributed real time database systems (DRTDBS), Allow Commit Dependent and in Time borrowers for Incredible Value added data lending without extended abort chain (ACTIVE), where borrower cohorts are categorized as commit and abort dependent. Further, the commit dependent borrowers can lend data to executing cohorts with still limiting the transaction abort chain to one only and reducing the data inaccessibility. Also, an incoming executing cohort having borrowing factor greater than one can only borrow the dirty data items from lender. This minimizes the fruitless borrowing by the cohort. The performance of ACTIVE is compared with PROMPT, 2SC and SWIFT protocols for both main memory resident and disk resident databases with and without communication delay. Simulation results show that the proposed protocol improves the system performance up to 4% as transaction miss percentage.展开更多
Graphic processing units （GPUs） have been widely recognized as cost-efficient co-processors with acceptable size, weight, and power consumption. However, adopting GPUs in real-time systems is still challenging, due ...Graphic processing units （GPUs） have been widely recognized as cost-efficient co-processors with acceptable size, weight, and power consumption. However, adopting GPUs in real-time systems is still challenging, due to the lack in framework for real-time analysis. In order to guarantee real-time requirements while maintaining system utilization ~in modern heterogeneous systems, such as multicore multi-GPU systems, a novel suspension-based k-exclusion real-time locking protocol and the associated suspension-aware schedulability analysis are proposed. The proposed protocol provides a synchronization framework that enables multiple GPUs to be efficiently integrated in multicore real-time systems. Comparative evaluations show that the proposed methods improve upon the existing work in terms of schedulability.展开更多
This paper investigates the fnite-time consensus problem of multi-agent systems with single and double integrator dynamics,respectively.Some novel nonlinear protocols are constructed for frst-order and second-order le...This paper investigates the fnite-time consensus problem of multi-agent systems with single and double integrator dynamics,respectively.Some novel nonlinear protocols are constructed for frst-order and second-order leader-follower multi-agent systems,respectively.Based on the fnite-time control technique,the graph theory and Lyapunov direct method,some theoretical results are proposed to ensure that the states of all the follower agents can converge to its leader agent s state in fnite time.Finally,some simulation results are presented to illustrate the efectiveness of our theoretical results.展开更多
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.展开更多
Background: A Randomized Controlled Trial (RCT) has been elaborated where goal directed fluid and hemodynamic therapy (GDFHT) will be realized with trans-thoracic echocardiographic aortic blood flow peak velocity vari...Background: A Randomized Controlled Trial (RCT) has been elaborated where goal directed fluid and hemodynamic therapy (GDFHT) will be realized with trans-thoracic echocardiographic aortic blood flow peak velocity variation (ΔVpeak) and distance minute (DM) to guide fluid therapy and hemodynamics in high risk pediatric surgical patients. This RCT will clarify the impact of GDFHT with ΔVpeak and DM on postoperative outcome in terms of morbidity, length of stay in the intensive care unit (LOSICU), length of mechanical ventilation (LMV) and length of hospital stay (LOS) in children. To determine values of ΔVpeak, DM and VTI predictive of these postoperative outcomes, an observational pilot study will be realized. This pilot study is described here. The primary objective of this study is to determine values of ΔVpeak, DM and ITV predictive of postoperative outcome in children in terms of morbidity. The secondary objectives are to determine values of ΔVpeak, DM and ITV predictive of LOSICU, LMV, LOS, intraoperative, postoperative fluid administration and vasoactive-inotropic therapy. Methods: 500 - 1000 children aged less than 18 years will be included prospectively. Statistic analysis will be realized with XLSTAT 2019.4.2 software or plus. Results and Conclusions: This trial protocol will determine values of ΔVpeak, DM and ITV with echocardiography predictive of postoperative outcome in children.展开更多
在CTCS-3(Chinese Train Control System Level 3)级列控系统中,RBC(Radio Block Center)切换是影响列车安全高效运行的重要环节,现阶段对RBC切换协议进行验证分析所使用的形式化方法还存在状态爆炸或描述性质单一等问题。基于Timed RA...在CTCS-3(Chinese Train Control System Level 3)级列控系统中,RBC(Radio Block Center)切换是影响列车安全高效运行的重要环节,现阶段对RBC切换协议进行验证分析所使用的形式化方法还存在状态爆炸或描述性质单一等问题。基于Timed RAISE的形式化方法,结合域的模型,在对RBC切换流程分析的基础上,构建状态转移图,得到切换协议的形式化模型,使用等价和推断的推理规则对模型的正确性和实时性进行推理验证,得到的结果表明,RBC切换协议满足规范标准对正确性与实时性的要求,将验证结果与其他文献的结论进行比较分析,说明该方法具有通用性,对于推广其在列控系统场景验证中的应用有一定的实际意义。展开更多
We investigate the finite-time consensus problem for heterogeneous multi-agent systems composed of first-order and second-order agents.A novel continuous nonlinear distributed consensus protocol is constructed,and fin...We investigate the finite-time consensus problem for heterogeneous multi-agent systems composed of first-order and second-order agents.A novel continuous nonlinear distributed consensus protocol is constructed,and finite-time consensus criteria are obtained for the heterogeneous multi-agent systems.Compared with the existing results,the stationary and kinetic consensuses of the heterogeneous multi-agent systems can be achieved in a finite time respectively.Moreover,the leader can be a first-order or a second-order integrator agent.Finally,some simulation examples are employed to verify the efficiency of the theoretical results.展开更多
The bad behaviors of some users and the drawbacks of public bicycles have hindered the promotion of public bicycles. The current problems include low utilization rate, uneven distribution, high loss rate and insecure ...The bad behaviors of some users and the drawbacks of public bicycles have hindered the promotion of public bicycles. The current problems include low utilization rate, uneven distribution, high loss rate and insecure lock. However, there is few feasible research in this new field. To address these issues of public bicycles, we propose a public bicycle operating system（PBOS）. PBOS involves three key technologies： 1） To acquire a dynamic password and realize bicycle self-rescue, we devise an intelligent lock that utilizes the Internet of Things（IoT） to establish Bluetooth connection with user＇s mobile phone. 2） To avoid bicycle loss and improve the security of data transmission, we design a space-time security protocol to work between bicycle＇s intelligent lock, mobile app, and server. 3） To increase the average utilization rate and distribution, we present a cooperative game model for bicycle scheduling. Finally, we evaluate the performance and validate the theoretical properties of PBOS through extensive simulations.展开更多
Distributed speech recognition (DSR) applications have certain QoS (Quality of service) requirements in terms of latency, packet loss rate, etc. To deliver quality guaranteed DSR application over wirelined or wireless...Distributed speech recognition (DSR) applications have certain QoS (Quality of service) requirements in terms of latency, packet loss rate, etc. To deliver quality guaranteed DSR application over wirelined or wireless links, some QoS mechanisms should be provided. We put forward a RTP/RSVP transmission scheme with DSR-specific payload and QoS parameters by modifying the present WAP protocol stack. The simulation result shows that this scheme will provide adequate network bandwidth to keep the real-time transport of DSR data over either wirelined or wireless channels.展开更多
This paper investigates the collective behavior of a class of dynamic agents with time delay in transmission networks. It is assumed that the agents are Lyapunov stable distributed on a plane and their location coordi...This paper investigates the collective behavior of a class of dynamic agents with time delay in transmission networks. It is assumed that the agents are Lyapunov stable distributed on a plane and their location coordinates are measured by some remote sensors with certain error and transmitted to their neighbors. The control protocol is designed on the transmitted information by a linear decentralized law. The coordination of dynamical agents is shown under the condition that the error is small enough. Numerical simulations demonstrate that our theoretical results are effective.展开更多
This paper is devoted to the study of the coordinate stability in undirected networks of dynamical agents with time-varying transmission delay. Neighbor-based rules are adopted to realize local control strategies for ...This paper is devoted to the study of the coordinate stability in undirected networks of dynamical agents with time-varying transmission delay. Neighbor-based rules are adopted to realize local control strategies for these continuous-time autonomous agents. Sufficient and necessary conditions in terms of linear matrix inequalities (LMIs) are given to guarantee the coordination of dynamical agents. Numerical simulations are given and demonstrate that our theoretical results are effective.展开更多
基金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.
文摘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.
基金the Technical and Vocational Training Corporation, Saudi Arabia.
文摘The IEEE 1588 precision time protocol(PTP)is very important for many industrial sectors and applications that require time synchronization accuracy between computers down to microsecond and even nanosecond levels.Nevertheless,PTP and its underlying network infrastructure are vulnerable to cyber-attacks,which can stealthily reduce the time synchronization accuracy to unacceptable and even damage-causing levels for individual clocks or an entire network,leading to financial loss or even physical destruction.Existing security protocol extensions only partially address this problem.This paper provides a comprehensive analysis of strategies for advanced persistent threats to PTP infrastructure,possible attacker locations,and the impact on clock and network synchronization in the presence of security protocol extensions,infrastructure redundancy,and protocol redundancy.It distinguishes between attack strategies and attacker types as described in RFC7384,but further distinguishes between the spoofing and time source attack,the simple internal attack,and the advanced internal attack.Some experiments were conducted to demonstrate the impact of PTP attacks.Our analysis shows that a sophisticated attacker has a range of methodologies to compromise a PTP network.Moreover,all PTP infrastructure components can host an attacker,making the comprehensive protection of a PTP network against a malware infiltration,as for example exercised by Stuxnet,a very tedious task.
文摘The contract net protocol has developed to specify problem solving communication for nodes in a distributed problem solving. Task distribution is affected by a negotiation process,a discussion carried on between nodes with tasks to he executed and nodes that may be able to execute those tasks. In contract net protocol,once negotiation successes,tbe task execution is assumed to success. However,in real world,even though a task is awarded to successfully bidding nodes,it may be delayed. Such delay may badly propagate in whole system. Here,we introduce real-time constraints into contract net protocol to manage task execution for avoiding the, task's delay,or even though being delayed,the railure cannot propagate to whole system. In this paper,we first present a real-time contract net protocol which is an extension of contract net protocol with real-time constraints for distributed computing. Our proposition extends the basic negotiation protocol to negotiation and controlling execution or task. The controlling process is based on task deadline time,we also present an extension of the internode language of contract net protocol specification with real-time constraints.
文摘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.
文摘Considering characteristic of mHealth communication and problems of existing methods, this paper presents a real-time communication method for mHealth based on extended XMPP protocol. The method can maintain the role status efficiently and reduce data latency during the communication process. Meanwhile, it can be extended flexibly to meet increasing communication demands of mHealth services. Furthermore, a system framework is presented to support telemonitoring scene. Finally, system implementation and feasibility tests verify the effectiveness of the method and framework.
基金the National Basic Research Program of China (973 Program) (Grant No. 2003CB314801)the National Natural Science Foundation of China (Grant No. 60572082)
文摘Interoperability testing is an important technique to ensure the quality of implementations of network communication protocol. In the next generation Internet protocol, real-time applications should be supported effectively. However, time constraints were not considered in the related studies of protocol interoperability testing, so existing interoperability testing methods are difficult to be applied in real-time protocol interoperability testing. In this paper, a formal method to real-time protocol interoperability testing is proposed. Firstly, a formal model CMpTIOA （communicating multi-port timed input output automata） is defined to specify the system under test （SUT） in real-time protocol interoperability testing; based on this model, timed interoperability relation is then defined. In order to check this relation, a test generation method is presented to generate a parameterized test behavior tree from SUT model; a mechanism of executability pre-determination is also integrated in the test generation method to alleviate state space explosion problem to some extent. The proposed theory and method are then applied in interoperability testing of IPv6 neighbor discovery protocol to show the feasibility of this method.
文摘Many existing real time commit protocols try to improve system performance by allowing a committing cohort to lend its data to an executing cohort, thus reducing data inaccessibility. They block the borrower from sending WORKDONE/PREPARED message and restrict them from lending data so that transaction abort chain is limited to one. Thus, transaction execution time increases. This paper proposes a modified real time commit protocol for distributed real time database systems (DRTDBS), Allow Commit Dependent and in Time borrowers for Incredible Value added data lending without extended abort chain (ACTIVE), where borrower cohorts are categorized as commit and abort dependent. Further, the commit dependent borrowers can lend data to executing cohorts with still limiting the transaction abort chain to one only and reducing the data inaccessibility. Also, an incoming executing cohort having borrowing factor greater than one can only borrow the dirty data items from lender. This minimizes the fruitless borrowing by the cohort. The performance of ACTIVE is compared with PROMPT, 2SC and SWIFT protocols for both main memory resident and disk resident databases with and without communication delay. Simulation results show that the proposed protocol improves the system performance up to 4% as transaction miss percentage.
基金supported by the National Natural Science Foundation of China under Grant No.61003032/F020207
文摘Graphic processing units （GPUs） have been widely recognized as cost-efficient co-processors with acceptable size, weight, and power consumption. However, adopting GPUs in real-time systems is still challenging, due to the lack in framework for real-time analysis. In order to guarantee real-time requirements while maintaining system utilization ~in modern heterogeneous systems, such as multicore multi-GPU systems, a novel suspension-based k-exclusion real-time locking protocol and the associated suspension-aware schedulability analysis are proposed. The proposed protocol provides a synchronization framework that enables multiple GPUs to be efficiently integrated in multicore real-time systems. Comparative evaluations show that the proposed methods improve upon the existing work in terms of schedulability.
基金supported by National Basic Research Program of China (973 Program) (No.2010CB731800)National Natural Science Foundation of China (Nos.60934003 and 61074065)Natural Science Foundation of Hebei Province (No.F2012203119)
文摘This paper investigates the fnite-time consensus problem of multi-agent systems with single and double integrator dynamics,respectively.Some novel nonlinear protocols are constructed for frst-order and second-order leader-follower multi-agent systems,respectively.Based on the fnite-time control technique,the graph theory and Lyapunov direct method,some theoretical results are proposed to ensure that the states of all the follower agents can converge to its leader agent s state in fnite time.Finally,some simulation results are presented to illustrate the efectiveness of our theoretical results.
基金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.
文摘Background: A Randomized Controlled Trial (RCT) has been elaborated where goal directed fluid and hemodynamic therapy (GDFHT) will be realized with trans-thoracic echocardiographic aortic blood flow peak velocity variation (ΔVpeak) and distance minute (DM) to guide fluid therapy and hemodynamics in high risk pediatric surgical patients. This RCT will clarify the impact of GDFHT with ΔVpeak and DM on postoperative outcome in terms of morbidity, length of stay in the intensive care unit (LOSICU), length of mechanical ventilation (LMV) and length of hospital stay (LOS) in children. To determine values of ΔVpeak, DM and VTI predictive of these postoperative outcomes, an observational pilot study will be realized. This pilot study is described here. The primary objective of this study is to determine values of ΔVpeak, DM and ITV predictive of postoperative outcome in children in terms of morbidity. The secondary objectives are to determine values of ΔVpeak, DM and ITV predictive of LOSICU, LMV, LOS, intraoperative, postoperative fluid administration and vasoactive-inotropic therapy. Methods: 500 - 1000 children aged less than 18 years will be included prospectively. Statistic analysis will be realized with XLSTAT 2019.4.2 software or plus. Results and Conclusions: This trial protocol will determine values of ΔVpeak, DM and ITV with echocardiography predictive of postoperative outcome in children.
文摘在CTCS-3(Chinese Train Control System Level 3)级列控系统中,RBC(Radio Block Center)切换是影响列车安全高效运行的重要环节,现阶段对RBC切换协议进行验证分析所使用的形式化方法还存在状态爆炸或描述性质单一等问题。基于Timed RAISE的形式化方法,结合域的模型,在对RBC切换流程分析的基础上,构建状态转移图,得到切换协议的形式化模型,使用等价和推断的推理规则对模型的正确性和实时性进行推理验证,得到的结果表明,RBC切换协议满足规范标准对正确性与实时性的要求,将验证结果与其他文献的结论进行比较分析,说明该方法具有通用性,对于推广其在列控系统场景验证中的应用有一定的实际意义。
基金Project supported by the National Basic Research Program of China (Grant No. 2010CB731800)the National Natural Science Foundation of China (Grant Nos. 60934003 and 61074065)the Natural Science Foundation of Hebei Province,China (Grant Nos. F2012203119 and 1208085MF111)
文摘We investigate the finite-time consensus problem for heterogeneous multi-agent systems composed of first-order and second-order agents.A novel continuous nonlinear distributed consensus protocol is constructed,and finite-time consensus criteria are obtained for the heterogeneous multi-agent systems.Compared with the existing results,the stationary and kinetic consensuses of the heterogeneous multi-agent systems can be achieved in a finite time respectively.Moreover,the leader can be a first-order or a second-order integrator agent.Finally,some simulation examples are employed to verify the efficiency of the theoretical results.
基金Supported by the National Key Research and Development Program of China(2016YFB0501805)the National Natural Science Foundation of China(61573262)
文摘The bad behaviors of some users and the drawbacks of public bicycles have hindered the promotion of public bicycles. The current problems include low utilization rate, uneven distribution, high loss rate and insecure lock. However, there is few feasible research in this new field. To address these issues of public bicycles, we propose a public bicycle operating system（PBOS）. PBOS involves three key technologies： 1） To acquire a dynamic password and realize bicycle self-rescue, we devise an intelligent lock that utilizes the Internet of Things（IoT） to establish Bluetooth connection with user＇s mobile phone. 2） To avoid bicycle loss and improve the security of data transmission, we design a space-time security protocol to work between bicycle＇s intelligent lock, mobile app, and server. 3） To increase the average utilization rate and distribution, we present a cooperative game model for bicycle scheduling. Finally, we evaluate the performance and validate the theoretical properties of PBOS through extensive simulations.
文摘Distributed speech recognition (DSR) applications have certain QoS (Quality of service) requirements in terms of latency, packet loss rate, etc. To deliver quality guaranteed DSR application over wirelined or wireless links, some QoS mechanisms should be provided. We put forward a RTP/RSVP transmission scheme with DSR-specific payload and QoS parameters by modifying the present WAP protocol stack. The simulation result shows that this scheme will provide adequate network bandwidth to keep the real-time transport of DSR data over either wirelined or wireless channels.
文摘This paper investigates the collective behavior of a class of dynamic agents with time delay in transmission networks. It is assumed that the agents are Lyapunov stable distributed on a plane and their location coordinates are measured by some remote sensors with certain error and transmitted to their neighbors. The control protocol is designed on the transmitted information by a linear decentralized law. The coordination of dynamical agents is shown under the condition that the error is small enough. Numerical simulations demonstrate that our theoretical results are effective.
文摘This paper is devoted to the study of the coordinate stability in undirected networks of dynamical agents with time-varying transmission delay. Neighbor-based rules are adopted to realize local control strategies for these continuous-time autonomous agents. Sufficient and necessary conditions in terms of linear matrix inequalities (LMIs) are given to guarantee the coordination of dynamical agents. Numerical simulations are given and demonstrate that our theoretical results are effective.
