A synchronization framework for communication of pre-orchestratedmultimedia information

The authors propose a communication and presentation model called XOCPN, which can specify temporal relationships for the presentation of pre-orchestrated multimedia data, and communication requirements for the timely delivery of these data through multiple virtual circuits (MVCs). In particular, XOCPN contains connection set-up for guaranteeing required QoS parameters for efficient delivery of multimedia data, and various grains of stream synchronization (e.g., intra-stream synchronization, inter-object synchronization, and interstream pacing). The source and the destination interact in harmony and carry out different functions embedded in the transmitter and the receiver XOCPNs to accomplish synchronous playout of multimedia data. A protocol architecture and a set of service primitives have been proposed for the realization of the proposed model in a practical environment. Subsequently, the authors present a communication architecture that can be implemented using an ATM-based network, due to its flexibility in handling various types of traffic     

A multimedia synchronization model and its implementation intransport protocols

An implementation of a synchronization mechanism in transport protocol to support multimedia applications over a packet or cell switched network is proposed. In designing such a mechanism for practical use, ease of implementation and capability of handling random delay of packets are two key issues for success. Since the random delay of packet or cell switched networks makes synchronization among media more complicated after the transmission across the network, a model which considers the random transmission delay is hence required to specify the temporal relationship among media. Therefore, a real-time synchronization model is presented to satisfy this requirement in the paper. Based on the proposed synchronization model, a transport protocol, namely the multimedia synchronization transport protocol (MSTP), is designed and implemented. We have implemented a prototype system using the MSTP protocol and built a simulation system for the wide area network (WAN) environment in order to evaluate the performance of the MSTP protocol     

Flow synchronization protocol

Presents an adaptive flow synchronization protocol that permits synchronized delivery of data to and from geographically distributed sites. Applications include inter-stream synchronization, synchronized delivery of information in a multisite conference, and synchronization for concurrency control in distributed computations. The contributions of this protocol in the area of flow synchronization are the ability to synchronize over arbitrary topologies, the introduction of an adaptive synchronization delay, the flexibility to maintain multiple synchronization groups, and the use of a modular architecture that permits the application to tailor synchronization calculations to its service requirements. The authors take advantage of network protocols capable of maintaining network clock synchronization in the millisecond range     

On synchronization techniques: performance and impact on time metrics monitoring

The paper presents an experimental comparison of device synchronization strategies to monitor quality of service (QoS) time metrics, such as the one‐way delay and the delay variation. The compared strategies are based on global positioning system (GPS), public Internet network time protocol (NTP) servers and ad hoc GPS‐based NTP servers with different treatments of the NTP traffic. The presented experimental results allow to quantitatively evaluate the level of performance achievable using each synchronization technique. Finally, considering a satellite test bed, we focus our analysis on two relevant aspects of time metrics monitoring: the impact of the synchronization errors on the metrics observation and the different values that can be measured when a metric is monitored at the application or data link level. Copyright © 2003 John Wiley & Sons, Ltd.     

基于IEEE1588v2协议的光网络时间同步技术研究

分析了现有光网络中时间同步实现方法的不足,阐述了IEEE 1588v2协议的基本原理,提出了IEEE 1588v2协议在光通信网络中实现时间同步的方法,指出精确时间同步协议在光网络中的应用前景和发展方向.     

混沌同步新方法研究

从数字通信技术角度提出了混沌同步定义，指出混沌数字保密通信的应用研究重点是混沌严格同步技术。从网络通信协议的思路出发，在混沌脉冲同步的启发下，提出了一种新的混沌同步方法——混沌协议同步技术．并加以改进，从而解决了混沌数字保密通信的关键技术难题。最后构建了一个基于协议同步的网络混沌语音保密通信系统．验证了此方法的可行性。     

Internetworking based on cell switch router-architecture andprotocol overview

This paper describes an internetworking architecture and related protocol overview based on routers that have asynchronous transfer mode (ATM) cell switching capability in addition to conventional Internet protocol (IP) packet forwarding. The proposed architecture can provide high-throughput and low-latency switched paths for individual application flows or a group of application flows while retaining current router-based internetworking architecture. The proposed router is able to establish the switched path based on the characteristics of flows, e.g., arrival of a data packet with specific upper layer protocols or arrival of more than a certain amount of data packets in a predetermined period, as well as by the reception of an IP-layer resource reservation request, such as resource reservation protocol (RSVP). One important feature that is provided by the proposed router is interoperability with the emerging ATM network platform specified by the ATM Forum and the telecommunications sector of the International Telecommunications Union (ITU-T). The proposed routers can be interconnected with each other over the point-to-point synchronous optical network link as well as over the ATM network platform, which provides permanent virtual channel, virtual path, or switched virtual channel (SVC) services. That enables network carriers to provide Internet/intranet services as well as others, such as telephony, ATM/time division multiplexing leased line, or native ATM SVC services     

Multimedia group synchronization protocols for integrated servicesnetworks

Unlike traditional data traffic, real time multimedia traffic requires synchronization. Temporal relationships among media must be maintained. Yet delay jitter and the absence of a global clock may disrupt these temporal relationships. This paper introduces new group synchronization protocols for real-time, multimedia applications, including teleconference, teleorchestration and multimedia on demand services. The proposed protocols achieve synchronization for all configurations (one-to-one, one-to-many, many-to-one, and many-to-many), and does so without prior knowledge of the end-to-end delay distribution, or the distribution of the clock drift. The only a-priori knowledge the protocols require is an upper bound on the end-to-end delay. The paper concludes with simulation experiments showing that the protocols work effectively in both LAN and WAN environments     

A Clock Synchronization Algorithm for Multihop Wireless Ad Hoc Networks

In multihop wireless ad hoc networks, it is important that all mobile hosts are synchronized. Synchronization is necessary for power management and for frequency hopping spread spectrum (FHSS) operations. IEEE 802.11 standards specify a clock synchronization protocol but this protocol suffers from the scalability problem due to its inefficiency contention mechanism. In this paper, we propose an automatic self-time-correcting procedure (ASP) to achieve clock synchronization in a multihop environment. Our ASP has two features. First, a faster host has higher priority to send its timing information out than a slower one. Second, after collecting enough timing information, a slower host can synchronize to the faster one by self-correcting its timer periodically (which makes it becoming a faster host). Simulation results show that our ASP decreases 60% the average maximum clock drift as compared to the IEEE 802.11 and reduces 99% the number of asynchronism in a large-scale multihop wireless ad hoc networks.     

Self-correcting time synchronization using reference broadcast in wireless sensor network

Time synchronization is one of the most fundamental services for numerous wireless sensor network applications. In this article the definition and basic concepts of time synchronization are introduced, and the related work is summarized in brief. Through analyzing the characteristics of the existing typical synchronization protocols and making a comprehensive comparison of the performance of various algorithms, we present a common guideline for designing the time synchronization protocol in WSN. Following this guideline, we develop a new time synchronization protocol called Self-Correcting Time Synchronization (SCTS), which converts the time synchronization problem into an online dynamic self-adjusting optimizing process to make the offset compensation and drift compensation simultaneously. The time and space complexities of the algorithm implementation are very low. In addition, the SCTS protocol fully exploits the inherent broadcast property of wireless channel, so the communication overhead is rather low. Because the algorithm implementation is based on the phase locked loop principle, an equivalent digital PLL without an actual voltage controlled oscillator is also proposed to avoid introducing the extra hardware required by a traditional PLL circuit. Finally, we validate SCTS on the Berkeley Mica2 experimental platform, and the performance is evaluated and compared to the existing typical time synchronization protocol.     

Random Mobility and Heterogeneity-Aware Hybrid Synchronization for Wireless Sensor Network

Random mobility of a node in wireless sensor networks (WSNs) causes the frequent changes in the network dynamics with increased cost in terms of energy and bandwidth. During data collections and transmission, they need the additional efforts to synchronize and schedule the activities of nodes. A key challenge is to maintain the global clock scale for synchronization of nodes at different levels to minimize the energy consumption and clock skew. It is also difficult to schedule the activities for effective utilization of slots allocated for aggregated data transmission. The paper proposes the Random Mobility and Heterogeneity-aware Hybrid Synchronization Algorithm (MHS) for WSN. The proposed algorithm uses the cluster-tree for efficient synchronization of CH and nodes in the cluster and network, level-by-level. The network consists of three nodes with random mobility and are heterogeneous regarding energy with static sink. All the nodes and CH are synchronized with the notion of the global timescale provided by the sink as a root node. With the random mobility of the node, the network structure frequently changes causing an increase in energy consumption. To mitigate this problem, MHS aggregate data with the notion of a global timescale throughout the network. Also, the hierarchical structure along with pair-wise synchronization reduces the clock skews hence energy consumption. In the second phase of MHS, the aggregated data packets are passed through the scheduled and synchronized slots using TDMA as basic MAC layer protocol to reduce the collision of packets. The results are extended by using the hybrid approach of scheduling and synchronization algorithm on the base protocol. The comparative results show that MHS is energy and bandwidth efficient, with increased throughput and reduced delay as compared with state-of-the-art solutions.     

光网络接口信令系统容错设计的分析和验证

为实现动态指配光网络资源功能，提出了一种用户网络接口（UNI）信令协议系统，该协议系统基于层叠模型，支持多种类客户寻址，分析了协议系统设计的出错处理并采用时序逻辑描述和验证了其容错性质，验证结果表明，系统在网络正常和超时故障条件下均能确保对光通道的建立，修改、拆除和查询等操作无误。     

混沌协议同步技术研究与应用

首次从网络通信协议的思路出发,在混沌脉冲同步的启发下,提出了一种新型的混沌协议同步技术,并加以改进,从而解决了混沌数字保密通信的关键技术难题;然后应用混沌协议同步技术,构建成了一个基于协议同步的网络混沌语音保密通信系统,验证了此技术的可行性。     

基于首要信道的无线认知传感器网络多信道广播协议

针对无线认知传感器网络的资源有限性和频谱动态分配,提出了基于首要信道半双工的无线认知传感器网络广播协议。在没有公共信道和时钟同步的情况下,该协议通过单个收发机的收发状态转换和信道表的交换进行网络的初始化。经过网络初始化,节点由首要信道形成拓扑,节点通过首要信道以半双工数据传送方式进行广播。仿真实验表明,与完全广播相比,该协议降低了广播延迟和开销,更利于应用于无线认知传感器网络。     

An address-light, integrated MAC and routing protocol for wireless sensor networks

We propose an address-light, integrated MAC and routing protocol (abbreviated AIMRP) for wireless sensor networks (WSNs). Due to the broad spectrum of WSN applications, there is a need for protocol solutions optimized for specific application classes. AIMRP is proposed for WSNs deployed for detecting rare events which require prompt detection and response. AIMRP organizes the network into concentric tiers around the sink(s), and routes event reports by forwarding them from one tier to another, in the direction of (one of) the sink(s). AIMRP is address-light in that it does not employ unique per-node addressing, and integrated since the MAC control packets are also responsible for finding the next-hop node to relay the data, via an anycast query. For reducing the energy expenditure due to idle-listening, AIMRP provides a power-saving algorithm which requires absolutely no synchronization or information exchange. We evaluate AIMRP through analysis and simulations, and compare it with another MAC protocol proposed for WSNs, S-MAC. AIMRP outperforms S-MAC for event-detection applications, in terms of total average power consumption, while satisfying identical sensor-to-sink latency constraints.     

Synchronization and storage models for multimedia objects

A technique is presented for the formal specification and modeling of multimedia composition with respect to intermedia timing. The proposed model is based on the logic of temporal intervals and timed Petri nets. A strategy is evinced for constructing a database schema to facilitate data storage and retrieval of media elements based on the temporal relationship established by the proposed modeling tool. An algorithm which allows the retrieval of media elements from the constructed database in a manner which preserves the temporal requirements of the initial specification is presented. Using the proposed model, the synchronization requirements of complex structures of temporally related objects can be easily specified     

Synchronization of multimedia data for a multimedia news-on-demandapplication

We present a complete software control architecture for synchronizing multiple data streams generated from distributed media-storing database servers without the use of a global clock. Independent network connections are set up to remote workstations for multimedia presentations. Based on the document scenario and traffic predictions, stream delivery scheduling is performed in a centralized manner. Certain compensation mechanisms at the receiver are also necessary due to the presence of random network delays. A stream synchronization protocol (SSP) allows for synchronization recovery, ensuring a high quality multimedia display at the receiver. SSP uses synchronization quality of service parameters to guarantee the simultaneous delivery of the different types of data streams. In the proposed architecture, a priority-based synchronization control mechanism for MPEG-2 coded data streams is also provided. A performance modeling of the SSP is presented using the DSPN models. Relevant results such as the effect of the SSP, the number of synchronization errors, etc., are obtained     

Performance Evaluation of Wireless Controller Area Network (WCAN) Using Token Frame Scheme

In this paper, a proposed new wireless protocol so-called wireless controller area network is introduced. WCAN is an adaptation of its wired cousin, controller area network protocol. The proposed WCAN uses token frame scheme in providing channel access to nodes in the system. This token frame method follows the example used in wireless token ring protocol which is a wireless network protocol that reduces the number of retransmissions as a result of collisions. This scheme based on CAN protocol allows nodes to share a common broadcast channel by taking turns in transmitting upon receiving the token frame that circulates around the network for a specified amount of time. The token frame allows nodes to access the network one at a time, giving ‘fair’ chance to all nodes instead of competing against one another. This method provides high throughput in a bounded latency environment. The proposed WCAN protocol has been developed and simulated by means of QualNet simulator. The performances of this proposed protocol are evaluated from the perspective of throughput, end-to-end delay and packet delivery ratio, and are compared against the IEEE 802.11 protocol. Simulation results show that the proposed WCAN outperforms IEEE 802.11 based protocol by 62.5 % in terms of throughput with increasing network size. Also, it shows an improvement of 6 % compared to IEEE 802.11 standard at a higher data interval rate.