A Highly Reusable Code Assignment Approach with Modified Busy Tone Signaling for CDMA-Based Ad Hoc Networks

Medium access control (MAC) protocol is among the most active topics of research in ad hoc networks. With the CDMA-based MAC protocol the code allocation plays an important role and has significant impact on the protocol performance. In this paper, we propose a distributed CDMA code assignment protocol for the mobile ad hoc networks (MANETs). The protocol is mainly composed of (1) a modified busy tone signaling mechanism that protects on-going data transmission as well as distributes code usage information, and (2) a set of specially designed code selection rules that work by taking into consideration whether relevant nodes are in the transmitting or receiving state. By combining the two proposed schemes with the conventional request-to-send (RTS)/clear-to-send (CTS) dialogue and power control mechanism, our protocol is able to increase CDMA code reusability. The simulation results indicate that the proposed protocol indeed performs better than the static and dynamic code assignment methods (either with or without power control) in terms of successful transmission rate and successful code assignment rate. And instead of sending continuously, the proposed modified busy tone mechanism only issues busy tone signal in randomly selected cycles, which may save battery energy as compared to conventional busy tone implementations. Moreover, the proposed code selection rules and the modified busy tone signaling may also be integrated into existing MAC protocols, either separately or in combination.     

光互联网体系结构及其关键技术

光互联网络的典型特征是高速宽带、灵活可控、资源高效利用。光突发交换（OBS）结合了光电路交换和光分组交换的优点,又克服了二者的不足,将成为下一代光互联网的一种典型的核心支撑技术。文章分析和讨论了OBS网络增强型通用多协议标记交换（GMPLS）控制面技术、多粒度光交换技术,以及光网络节点结构模型、波长资源预留与调度机制、竞争解决机制、OBS网络故障监测技术等关键技术;还分析和讨论了下一代光互联网络的光虚拟专用网（OVPN）关键技术问题。文章指出为了增强目前光网络在资源分配、服务发现、服务质量保障等方面缺乏与上层IP网络的协同支持,需要对网络控制面体系结构、流量工程和业务管理等方面加强研究。     

Saliency model-based face segmentation and tracking in head-and-shoulder video sequences

In this paper, a novel face segmentation algorithm is proposed based on facial saliency map (FSM) for head-and-shoulder type video application. This method consists of three stages. The first stage is to generate the saliency map of input video image by our proposed facial attention model. In the second stage, a geometric model and an eye-map built from chrominance components are employed to localize the face region according to the saliency map. The third stage involves the adaptive boundary correction and the final face contour extraction. Based on the segmented result, an effective boundary saliency map (BSM) is then constructed, and applied for the tracking based segmentation of the successive frames. Experimental evaluation on test sequences shows that the proposed method is capable of segmenting the face area quite effectively.     

Clustering‐based scheduling: A new class of scheduling algorithms for single‐hop lightwave networks

In wavelength division multiplexing (WDM) star networks, the construction of the transmission schedule is a key issue, which essentially affects the network performance. Up to now, classic scheduling techniques consider the nodes' requests in a sequential service order. However, these approaches are static and do not take into account the individual traffic pattern of each node. Owing to this major drawback, they suffer from low performance, especially when operating under asymmetric traffic. In this paper, a new class of scheduling algorithms for WDM star networks, which is based on the use of clustering techniques, is introduced. According to the proposed Clustering‐Based Scheduling Algorithm (CBSA), the network's nodes are organized into clusters, based on the number of their requests per channel. Then, their transmission priority is defined beginning from the nodes belonging to clusters with higher demands and ending to the nodes of clusters with fewer requests. The main objective of the proposed scheme is to minimize the length of the schedule by rearranging the nodes' service order. Furthermore, the proposed CBSA scheme adopts a prediction mechanism to minimize the computational complexity of the scheduling algorithm. Extensive simulation results are presented, which clearly indicate that the proposed approach leads to a significantly higher throughput‐delay performance when compared with conventional scheduling algorithms. We believe that the proposed clustering‐based approach can be the base of a new generation of high‐performance scheduling algorithms for WDM star networks. Copyright © 2008 John Wiley & Sons, Ltd.     

Analysis of blocking probability in optical burst switched networks

In this article, we study the blocking probability in a wavelength division multiplexing (WDM) based asynchronous bufferless optical burst switched (OBS) network, equipped with a bank of wavelength converters. Our analysis encloses two wavelength reservation schemes JIT (just-in-time) and JET (just-enough-time), and two-class data rate. The contribution of our work includes: (i) derivation of an accurate model for blocking probability of lower priority bursts in case of a non-preempted model; (ii) provision of the analytical model for blocking probability calculation in the OBS network, which includes these variables: two signaling schemes, partial wavelength conversion, two-class data, traffic intensity, cross-connect speed, number of wavelengths in WDM fiber, number of fibers in the node, number of wavelength converters, and number of nodes in the path; (iii) simulation results, which show that partial wavelength conversion provide quite satisfactory quality of service. We compare performance in a single OBS node, under various sets of parameter values. The OBS network shows great flexibility in terms of used multiclass data, and there is no dependence on the used higher layer protocol.     

A novel simplified tone reservation combined with cross antenna rotation and inversion to reduce PAPR for MIMO‐OFDM system

In this paper, we first propose a simplified tone reservation (STR) method with low computational complexity which is based on the Fourier series expansion. Then, we analyze how to combine the STR method with the cross antenna rotation and inversion method to reduce the peak‐to‐average power ratio (PAPR) for multi‐input multi‐output orthogonal frequency division multiplexing (MIMO‐OFDM) system. To validate the analytical results, extensive simulations are conducted and the numerical results show the efficiency of the proposed schemes including the PAPR reduction and low computational complexity for MIMO‐OFDM system. Copyright © 2010 John Wiley & Sons, Ltd.     

Survivability using traffic balancing and backup resource reservation in multi‐domain optical networks

Survivability in the geographically distributed backbone multi‐domain optical networks (MDONs) is critical because of issues related to its size, usage of resources, and domain management policies of the comprising domains. In MDONs, the emerging scheduled traffic is increasingly multivendor, multimedia, and periodic. It is high during the office (working) hours and low during the non‐office (non‐working) hours in a day. A connection failure during the office hours may result in huge amount of information being lost. Towards providing an acceptable level of service even when a connection fails, we first provide traffic balancing (TB) based solutions where the intra/inter‐domain traffic is slided (S1‐TB), shifted (S2‐TB), or slided as well as shifted (S3‐TB) based on the service level agreement between the client and domain service provider. Of the above solutions, the solution based on sliding as well as shifting (S3‐TB) performs best, and hence for further improvement in S3‐TB, we incorporate backup multiplexing with advance backup resource reservation (BRR) and evaluate the performance of the strategy and report results. The performance evaluation of the above strategies is compared with the existing extended path shared protection (EPSP) by a simulator developed in MATLAB and tested on three‐domain and five‐domain standard network topologies, on the metrics of blocking probability, network resource utilization ratio, network capacity utilized by backup route, wavelength link used per backup lightpath, and a newly introduced metric, network resource utilization index. As compared with the existing strategy EPSP, the S3‐TB and S3‐TB with BRR showed improved performance on all the metrics.     

联合星座扩展的预留子载波OFDM信号峰均比抑制算法

针对现有预留子载波TR技术对无线OFDM信号峰均比（PAPR）抑制性能效率低,且难以同时兼顾峰均比抑制、误码率（BER）性能损失及带外频谱分量扩展的问题,提出一种联合智能梯度映射主动星座扩展ACE的预留子载波峰均比抑制ACE-TR算法,能以较低的复杂度同时对信号峰均比和接收端误码率性能进行联合优化,并在迭代过程中消除因限幅处理所导致的信号带外频谱分量再生;特别是,由于在优化迭代过程中可以对迭代参数进行自适应调整,能够有效提高算法的适用灵活性。对算法进行了全面深入的理论分析,推导了其可获得的PAPR抑制增益理论界和接收信号误码率性能理论值。理论分析与仿真表明,ACE-TR算法能以更快的收敛速度产生所需的削峰信号,并同时获得优异的峰均比抑制、误码率及带外功率谱性能。     

时分双工环境下的分组预约多址(PRMA/TDD)协议及其性能

在分析标准分组预约多址（PRMA／FDD）协议的基础上,提出了时分双工环境下的分组预约多址（PRMA／TDD）协议,理论分析和计算机仿真均表明,PRMA／TDD与PRMA／FDD的性能相近,可以较大幅度地提高系统的容量。     

用灰阶编码掩模实现邻近效应精细校正的研究

提出了用灰阶编码的二元掩模代替灰阶掩模实现邻近效应精细校正的新方法,并阐述了新方法的特点,讨论了灰阶编码掩模与灰阶掩模的等效关系,给出了灰阶编码掩模实现光学邻近效应校正的模拟结果,校正后的综合面积偏差比较正前减少了１０％。