A new real-time ethernet MAC protocol for time-critical applications

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.

Trans-Thoracic Echocardiographic Aortic Blood Flow Peak Velocity Variation, Distance Minute, Aortic Velocity Time Integral and Postoperative Outcome in Pediatric Surgical Patients—An Observational Pilot Study Protocol

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.

Distributed In-Time Multiple Coverage Holes Healing Protocol

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.

An Extension of Contract Net Protocol With Real Time Constraints

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.

ACTIVE-A Real Time Commit Protocol

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.

Verification of Session Initiation Protocol Using Timed Colored Petri Net

In this work, Session Initiation Protocol model is established by using Timed Colored Petri Nets (TCPN). SIP (Session Initiation Protocol) is a protocol developed to assist in providing advanced telephony services across the Internet. The Session Initiation Protocol (SIP) has become the quasi-standard for Voiceover-Internet Protocol (VoIP) communications. SIP is based on a client–server infrastructure in which user agents represent the end-terminals as clients, proxy servers handle SIP message routing between the user agents, and registrar servers store the client’s contact information into a location service. By use of timed color set and useful time attributes in tokens defined in CPN tools, timer and time-related problems of SIP are modeled and analyzed. Timer is an important part for SIP, especially the INVITE transaction.

Designing Proportional-Integral Consensus Protocols for Second-Order Multi-Agent Systems Using Delayed and Memorized State Information

This paper is concerned with consensus of a secondorder linear time-invariant multi-agent system in the situation that there exists a communication delay among the agents in the network.A proportional-integral consensus protocol is designed by using delayed and memorized state information.Under the proportional-integral consensus protocol,the consensus problem of the multi-agent system is transformed into the problem of asymptotic stability of the corresponding linear time-invariant time-delay system.Note that the location of the eigenvalues of the corresponding characteristic function of the linear time-invariant time-delay system not only determines the stability of the system,but also plays a critical role in the dynamic performance of the system.In this paper,based on recent results on the distribution of roots of quasi-polynomials,several necessary conditions for Hurwitz stability for a class of quasi-polynomials are first derived.Then allowable regions of consensus protocol parameters are estimated.Some necessary and sufficient conditions for determining effective protocol parameters are provided.The designed protocol can achieve consensus and improve the dynamic performance of the second-order multi-agent system.Moreover,the effects of delays on consensus of systems of harmonic oscillators/double integrators under proportional-integral consensus protocols are investigated.Furthermore,some results on proportional-integral consensus are derived for a class of high-order linear time-invariant multi-agent systems.

Real-Time Communication Method for mHealth Base on Extended XMPP Protocol

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.

Partitioned k-Exclusion Real-Time Locking Protocol Motivated by Multicore Multi-GPU Systems

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.

Contention-Based Beaconless Real-Time Routing Protocol for Wireless Sensor Networks

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.

Protocol Buffers在即时通讯系统中的应用研究

即时通讯系统已经广泛应用在人们的生活中,随着用户数量的增长,计算机设备在网络中传输的数据量越来越大。由于网络中的数据传输是非结构化的,因此需要数据的序列化与逆序列化方法来实现网络数据到可读数据的转换。基于即时通讯系统对于数据的实时性需求,提出了使用Protocol Buffers作为系统的序列化与逆序列化的手段,并且将Protocol Buffers与目前几种比较主流的数据序列化方法进行了对比。

一种分析Timed-Release公钥协议的扩展逻辑

在Coffey和Saidha提出的CS逻辑 (CS逻辑将时间与逻辑结构相结合 ,可用于形式化分析Timed release公钥协议的时间相关性秘密的安全性 )的基础上 ,提出了CS逻辑的扩展逻辑 ,它更好地反映了Timed release公钥协议的特性 ,并对一个协议实例进行了有效的形式化分析 .

基于Timed RAISE的高速列车RBC切换协议形式化建模及验证

在CTCS-3(Chinese Train Control System Level 3)级列控系统中,RBC(Radio Block Center)切换是影响列车安全高效运行的重要环节,现阶段对RBC切换协议进行验证分析所使用的形式化方法还存在状态爆炸或描述性质单一等问题。基于Timed RAISE的形式化方法,结合域的模型,在对RBC切换流程分析的基础上,构建状态转移图,得到切换协议的形式化模型,使用等价和推断的推理规则对模型的正确性和实时性进行推理验证,得到的结果表明,RBC切换协议满足规范标准对正确性与实时性的要求,将验证结果与其他文献的结论进行比较分析,说明该方法具有通用性,对于推广其在列控系统场景验证中的应用有一定的实际意义。

Finite-time consensus of heterogeneous multi-agent systems

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.

Consensus of a Kind of Dynamical Agents in Network with Time Delays

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.

Research and Optimization of GPSR Routing Protocol for Vehicular Ad-Hoc Network

Security is one of the most critical issues to Vehicular Ad-hoc Networks (VANETs) since the information transmitted is asynchronous and distributed. Vulnerability and instability are two of the challenges remain to be addressed by the research community and the industry. In this paper, we first proposed a trust reliability based model and extended the GPSR protocol to TM-GPSR protocol. Then, we improved the LET-GPSR protocol based on the link connection time prediction. On this basis, combined the decision index of the TM-GPSR and LET-GPSR protocols, we proposed the RC-GPSR routing protocol. We built the standard testing platform on the NS2 and SUMO, the average end-to-end delay and packet delivery rate of GPSR protocol and the three updates protocols under different node density, node speed, and malicious node ratio are simulated and evaluated. The results showed that under the same conditions, compared with GPSR protocol, RC-GPSR protocol has a lower average end-to-end delay and a higher packet delivery rate, which effectively improves the link stability and security.

The Overload Reduction in SIP Servers through Exact Regulation of the Retransmission Timer of the Invite Message

To initiate voice, image, instant messaging and general multimedia communication, the Session communication must initiate between two participants. SIP (Session initiation protocol) is an application layer control, which task is creating management, and terminating this kind of Sessions. With regard to the independence of SIP from the Transport layer protocols, the SIP messages can be transferred on a variety of Transport layer protocols such as TCP or UDP. The mechanism of Retransmission, which has been embedded in SIP, is able to compensate the missing Packet loss, if needed. The application of this mechanism is when SIP messages are transmitted on an unreliable transmission layer protocol such as UDP. This mechanism, while facing with SIP proxy with overload, causes excessive filling of proxy queue, delays the increase of other contacts and adds the amount of the proxy overload. We in this article, while using UDP, as the Transport layer protocol, by regulating the Invite Retransmission Timer appropriately (T1), have improved the SIP functionality. Therefore, by proposing an Adaptive Timer of Invite message retransmission, we have tried to improve the time of Session initiation and as a result, improving the performance. The performance of the proposed SIP, by the SIPP software in a real network environment has been implemented and evaluated and its accuracy and performance has been demonstrated.

A new protocol for concurrently allocating licensed spectrum to underlay cognitive users

Cognitive radio technology makes efficient use of the valuable radio frequency spectrum in a non-interfering manner to solve the problem of spectrum scarcity. This paper aims to design a scheme for the concurrent use of licensed frequencies by Underlay Cognitive Users （UCUs）. We develop a new receiver-initiated Medium Access Control （MAC） protocol to facilitate the selections of alternative reliable carrier frequencies. A circuit is designed to establish reliable carrier selections based on the Received Signal Strength Indicator （RSSI） at the receiving end. Based on both packet-level simulations and various performance parameters, a comparison is carried out among conventional techniques, including the Multiple Access with Collision Avoidance （MACA） and MACA by invitation（MACA-BI） techniques, and our scheme. The simulated results demonstrate that when conventional techniques are used, the system overhead time increases from 0.5 s on the first attempt to 16.5 s on the sixth attempt. In the proposed scheme under the same failure condition, overhead time varies from 0.5 s to 2 s. This improvement is due to the complete elimination of the exponential waiting time that occurs during failed transmissions. An average efficiency of 60% is achieved with our scheme while only 43% and 34% average efficiencies are achieved with the MACA and MACA-BI techniques, respectively. The throughput performance of our scheme on the fourth attempt is 7 Mbps, whereas for the MACA and MACA-BI protocols, it is 1.9 Mbps and 2.2 Mbps respectively.

Transmission Considerations with QoS Support to Deliver Real-Time Distributed Speech Recognition Applications

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.

Research on Time-Synchronization-Based Test and Control System of Aeroengine

This paper presents a method of NTP-based time synchronization and a strategy of master-slave server structured time synchronization to ensure the test and control system of aeroengine to be time-synchronized. Based on time synchronization, the hierarchy and the integration of the measurement and control system of aeroengine are investigated. In result, our method is successfully applied for multiple front-end tests in a simulative altitude test facility of aeroengine.