Dynamic Flow Model for Borrowing Channel Assignment Scheme in Cellular Mobile System

A mathematical model that predicts the dynamic flows in cellular mobile networks that allocate channels using the Borrowing Channel Assignment (BCA) scheme is described in this paper. Two types of handoff procedures – the prioritized and non-prioritized schemes – will be considered in the model. Discrete event simulations were performed and the results were found to be comparable to the results obtained using the mathematical model. Application to comparative study of the dynamic behaviours of the BCA and the Fixed Channel Assignment (FCA) schemes is also presented.     

Efficient threshold public key encryption with full security based on dual pairing vector spaces

Most robust and noninteractive threshold public key encryption (PKE) schemes have only been proven secure against chosen‐ciphertext attacks under the static corruption model; yet, the dynamic corruption model is more reasonable. In this paper, on the basis of bilinear groups of prime order and dual pairing vector spaces, we propose a threshold PKE scheme that is noninteractive, robust and, secure against adaptive chosen‐ciphertext attacks under the dynamic corruption model without random oracles. Moreover, our scheme is shown to be more efficient than currently existing fully secure threshold PKE schemes. Copyright © 2013 John Wiley & Sons, Ltd.     

Adaptive channel allocation for wireless PCN

In cellular networks, forced call terminations due to handoff call blocking are generally more objectionable than new call blocking. In order to maintain an acceptable call dropping probability rate, we propose, in this paper, two new guard channel schemes: an adaptive one – New Adaptive Channel Reservation (NACR) – and a dynamic one – Predictive Reservation Policy (PRP). In NACR, for a given period of time, a given number of channels is guarded in each cell for handoff traffic. In PRP, the number of reserved channels depends on the actual number of calls in progress in the neighboring cells. An approximate analytical model of NACR is presented. A Tabu search method has been implemented in order to optimize the Grade of Service. Discrete event simulations of PRP and NACR were run. The effectiveness of the proposed methods is emphasized on a complex configuration.     

Distributed and Energy Efficient Self-Organization for On–Off Wireless Sensor Networks

In this paper, we utilize clustering to achieve energy efficiency for the on–off wireless sensor network, whose member nodes alternate between active and inactive states. In the proposed Distributed and Energy Efficient Self Organization (DEESO) scheme, the head election is adjusted adaptively to the remaining battery levels of local active nodes, which is a completely distributed approach compared to LEACH that relying on other routing schemes to access global information. Furthermore, we apply the Adaptive Channel Assignment (ACA) to address the on-off topology changes. Simulation results show that DEESO delivers 184% amount of data to the base station as LEACH for the same amount of energy consumption and the effective network lifetime is extended by around 50%.     

Dynamic Host-Group/Multi-Destination Routing for Multicast Sessions

Multicast routing research efforts have mostly focused on supporting the host-group model in which multicast packets are addressed to a host (or multicast) group. Another multicast routing approach uses multi-destination addressing, where a multicast packet carries a list of the unique (unicast) addresses of all the group members. This form of routing can be accomplished using limited or no additional state beyond the existing unicast routing tables. It, therefore, scales well with the number of multicast sessions but does not scale well with the size of the multicast group and, in fact, requires the size of the multicast group to be below a certain threshold. In this paper, we envision a future scenario in which both host-group and multi-destination addressing routing approaches coexist within the Internet. We develop a dynamic routing context for this future scenario wherein a multicast session can adapt among different routing configurations depending on the number of multicast group members and how this number changes over time. We consider three routing options: (1) A single multi-destination addressed flow – suitable for small-group sessions, (2) multiple multi-destination addressed flows – suitable for medium-group sessions and (3) a single host-group addressed flow – suitable for large-group sessions. For multicast sessions that vary in group membership over time, different routing protocols may be best at different points in time. Our work is concerned with the development and evaluation of protocols that allow a multicast session to dynamically switch among these three routing options as the size of the session changes.     

A case study of statistical process control on the prime process using PLASMASK 302U

In this paper, Statistical Process Control (SPC) and statistically designed experiments will be used to optimise a recently developed resist schemes i.e., PRIME (Positive Resist Image by dry Etching). Orthogonal experiments are designed and conducted in order to produce 0.2 μm lines repeatably in PLASMASK 302U resist. Design rules of 0.1 μm are used due to proximity effects. The data is then explored and analysed using surface plots, boxplots, analysis of variance (ANOVA) and linear regression. It was deduced that e-beam dose and 2nd step etch time were the most significant parameters in the process. Linewidth of 0.2 gm and below were achieved with low values of e-beam dose (250–350μC/cm²) and high values of silylation temperature (205–215°C). The optimum range for NUV flood dose was easily found.     

Computer simulation for the evaluation of static and dynamic priority schemes in an ATM multiplexer with multimedia traffic

This paper is concerned with the evaluation of static and dynamic priority schemes for ATM multiplexers using digital computer simulation and has three main parts. The first provides a basic computer simulation model of an ATM multiplexer with multimedia traffic streams that enables investigation of static and dynamic priority schemes. The second part uses the simulation model to study such schemes. The third part investigates combined dynamic space and dynamic time priorities to provide better performance for ATM multiplexers in comparison to using dynamic time priority only. Copyright © 1999 John Wiley & Sons, Ltd.     

A near-optimal routing and dimensioning algorithm for dynamic WDM rings

In this paper a novel algorithm which jointly solves the problems of routing and dimensioning in dynamic WDM rings is proposed. The algorithm is simple, very fast (processing time <1 s) and applicable to rings of any size. After applying the algorithm to rings of 6–20 nodes, it was found that it outperformed the best proposal to date. In the cases where the optimal solution could be obtained by solving an ILP (Integer Linear Programming) model, the algorithm proposed here obtained exactly the same results. These facts make the proposed method the best solution to date for the routing and dimensioning of dynamic WDM rings, the most popular topology in metropolitan networks.     

Delay analysis for interlan traffic using two suitable TDMA satellite access schemes

Two demand assignment time division multiple access (TDMA) satellite access schemes that are suitable for providing flexible interconnections of local area networks are compared by means of two simulations; Fifo Ordered Demand Assignment/Information Bit Energy Adaptive (FODA/IBEA) and Combined Fixed Reservation Assignment (CFRA). A unique simulation tool was used, a meshed network of very small aperture terminals (VSATs) under the control of a master station was considered and similar networking conditions were applied to both access schemes. The generated traffic had two components with different level of burstiness; bulk traffic and interactive traffic. The performance evaluated is the delay for each traffic component. We show that CFRA is best when connecting clusters of only a few stations and even individual stations exchanging light traffic. On the other hand, FODA/IBEA is better suited to interconnect networks, or within networks with many hosts, where heavy traffic is more likely. © 1997 John Wiley & Sons, Ltd.     

Transform domain inter-block interleaving schemes for robust image and video transmission in ATM networks

Data interleaving schemes have proven to be an important mechanism in reducing the impact of correlated network errors on image/video transmission. Current interleaving schemes fall into two main categories: (a) schemes that interleave pixel intensity values and (b) schemes that interleave JPEG/MPEG transform blocks. The schemes in the first category suffer in terms of lower compression ratio since highly correlated information in the spatial domain is de-correlated prior to compression. The schemes in the second category interleave DCT transformed blocks. In this case, in the absence of ARQ, if a packet is lost, an entire block may be lost thus yielding poor image quality and making the error concealment task difficult. Interleaving transform coefficients is tricky and error concealment in the presence of lost coefficients is challenging. In this paper, we develop three different interleaving schemes, namely Triangular, Quadrant, and Coefficient, that interleave frequency domain transform coefficients. The transform coefficients within each block are divided into small groups and groups are interleaved with the groups from other blocks in the image, hence they are referred to as inter-block interleaving schemes. The proposed schemes differ in terms of group size. In the Triangular interleaving scheme AC coefficients in each block are divided into two triangles and interleaving is performed among triangles from different blocks. In the Quadrant interleaving scheme, coefficients in each block are divided into four quadrants and quadrants are interleaved. In the Coefficient interleaving scheme, each coefficient in a block is a group and it is interleaved with the coefficients in other blocks. The compression ratio 3 of the proposed interleaving schemes is impressive ranging from 90 to 98% of the JPEG standard compression while providing much higher robustness in the presence of correlated losses. We also propose two new variable end-of-block (VEOB) techniques, one based on the number of AC coefficients per block (VAC-EOB) and the other based on the number of bits per block (VB–EOB). Our proposed interleaving techniques combined with VEOB schemes yield significantly better compression ratios compared to JPEG (2–11%) and MPEG-2 (3–6.7%) standards while at the same time improve the resilience of the coded data in the presence of transmission errors.     

Study of swing potential on deep submicron on-chip interconnect

The low energy limit of signal on deep submicron on-chip interconnect is deduced from Shannon's communication theorem considering the influence of noise. Based on this energy limit, the analytic model of minimum swing potential considering transmission line effects is constructed. Applying the analytic model to interconnect in deep submicron technology nodes from 0.18 to 0.05 μm, it is shown that the swing potential with present low-swing technique such as SDVST could be reduced further by 70–95% according to the analysis of this work. Correspondingly, by using the low-swing interconnect technique with the minimum swing potential obtained in this work, the decrement of interconnect dynamic power dissipation can be further decreased by about 10–20% of their original one by using SDVST technique, and that of interconnect propagation delay, by one third. Furthermore, the maximum interconnect length is evaluated with a minimum swing potential value in interconnect design. All the results are valuable for interconnect performance optimization, such as repeater insertion in deep submicron circuits. As an application, the design of low swing potential interconnect with interface circuit is introduced.     

Blocking of Dynamic Multicast Connections

Multicast connections have a bandwidth saving nature. This means that a multicast connection – in taking the form of a tree with streams merging at the nodes – requires much less capacity from the network links than a bunch of separate point-to-point connections providing the same connectivity. In this paper, we consider dynamic multicast connections that can be used to model, for example, TV or radio delivery on a telecommunications network, such as an ATM network with virtual circuits. We show how to calculate the blocking probabilities of requests to join such a tree. First, we consider the blocking probabilities occurring in a single link. The resulting model is able to capture heterogeneous capacity requirements for different multicast channels. Then we extend the results to a whole network using the reduced load approximation. The accuracy of the approximation method is studied by simulations.     

Provable secure identity‐based multi‐proxy signature scheme

Multi‐proxy signature is one of the useful primitives of the proxy signature. Till now, only a few schemes of identity‐based multi‐proxy signature (IBMPS) have been proposed using bilinear pairings, but most of the schemes are insecure or lack a formal security proof. Because of the important application of IBMPS scheme in distributed systems, grid computing, and so on, construction of an efficient and provable‐secure IBMPS scheme is desired. In 2005, Li & Chen proposed an IBMPS scheme from bilinear pairings, but their paper lacks a formal model and proof of the security. Further, in 2009, Cao & Cao presented an IBMPS scheme with the first formal security model for it. Unfortunately, their scheme is not secure against the Xiong et al's attack. In this paper, first, we present an IBMPS scheme, then we formalize a security model for the IBMPS schemes and prove that the presented scheme is existential unforgeable against adaptive chosen message and identity attack in the random oracle model under the computational Diffie–Hellman assumption. Also, our scheme is not vulnerable for the Xiong et al's attack. The presented scheme is more efficient in the sense of computation and operation time than the existing IBMPS schemes. Copyright © 2013 John Wiley & Sons, Ltd.     

Dynamic frame partitioning scheme for IEEE 802.16 mesh networks

The IEEE 802.16 mesh network is a promising next generation wireless backbone network. In the network, the allocation of minislots is handled by centralized scheduling and distributed scheduling, which are independently exercised. However, the standard does not specify how the frame can be partitioned among its centralized and distributed schedulers. Through efficient partitioning that dynamically adapts the partitioning based on demand, network can support more user applications. Although a dynamic frame partitioning scheme to use Markov model has been studied, the dynamic frame partitioning method has not been fully investigated. This paper proposes two novel and general dynamic frame partitioning scheme for IEEE 802.16 mesh networks so that the minislot allocation can be more flexible and the utilization is increased. The two schemes respectively use GM(1,1)‐Markov model and Grey–Verhulst–Markov model to predict efficient partitions for future frames according to the minislot utilization in current frames. Our study indicates that the two proposed schemes outperform the scheme of using Markov model. Copyright © 2012 John Wiley & Sons, Ltd.     

可变带宽光网络中多项式复杂度的频谱扫描路由算法

Optical Orthogonal Frequency Division Multiplexing (OOFDM) has been proposed as a highly spectrum-efficient modulation technique, which can provide flexible spectrum assignment with fine granularity. In OOFDM-based flexible optical networks, Routing and Spectrum Assignment (RSA) has become a key problem. However, widely used dynamic RSA schemes, such as Fixed Routing (FR) and K-shortest Paths (KSP) routing schemes, are not able to realize route computation based on the link state in-formation, thus leading to poor blocking performance and inefficient resource utilization. To solve this problem, Adaptive Routing (AR) schemes, e.g., the Entire Path Searching (EPS) scheme, have been proposed recently. These schemes have low blocking probability; however, since their computational complexities are factorial, they are not suitable for use in real networks. In this paper, we propose a novel Spectrum-Scan Routing (SSR) scheme in dynamic flexible optical networks. To the best of our knowledge, SSR is the first polynomial-time AR scheme that can realize adaptive shortest-route computation. Simulation results show that our proposed SSR scheme has lower blocking probability and higher resource utilization compared with FR and EPS. Moreover, the worst-case computational complexity of SSR increases linearly with the network scale of the torus topologies, making it applicable to real networks.     

The Mathematical Theory of Dynamic Load Balancing in Cellular Networks

While many interesting dynamic load balancing schemes have been proposed for efficient use of limited bandwidth and to increase the capacity of congested or hot spots (or cells) in wireless networks, to date, a comprehensive mathematical framework which encompasses all of these schemes does not exist. In this paper, we provide a unified mathematical framework for dynamic load balancing, which leads to closed-form performance expressions for evaluating the performance of some of the most important dynamic load balancing strategies proposed in the literature. To the best of our knowledge, this is the first generic theoretical framework that can be used to evaluate the performance of many different dynamic load balancing schemes with simple closed-form results. The accuracy of the results predicted by these analytical expressions derived from the theoretical framework is checked by comparing these results with simulation results provided in the literature for well-known schemes.     

基于混沌预测的宽带DVB-RCS卫星接入信道动态分配方案研究

该文概述了基于卫星数字视频广播-反向信道系统(DVB-RCS)标准的宽带卫星通信网的特点,并重点研究了多址接入信道的动态分配策略,在利用混沌理论对网络中的自相似业务流量进行预测的基础上,提出了一种新型混合按需分配多址接入方案。该文还利用OPNET软件建立了仿真系统,用于比较不同方案的性能。仿真结果表明,在高信道负载以及网络中业务流具有较高自相似程度的条件下,该文所提出方案具有更优越的性能。     

Diffusion of Nitrogen Atoms Implanted into Synthetic Diamonds

The effect of isothermal annealing on the depth profiles of nitrogen atoms implanted into synthetic diamonds is studied by secondary-ion mass spectrometry. The annealing is performed under vacuum at 1400°C for 1, 5, or 20 h. It is found that the depth profile broadens on a macroscopic scale with annealing time. The broadening is successfully represented by a mathematical model of diffusion. The diffusion coefficient is roughly estimated at 2.3 × 10^–15, 8.5 × 10^–16, and 3.7 × 10^–16 cm²/s for annealing times of 1, 5, and 20 h, respectively.     

A Power Control MAC Protocol for Ad Hoc Networks

This paper presents a power control MAC protocol that allows nodes to vary transmit power level on a per-packet basis. Several researchers have proposed simple modifications of IEEE 802.11 to incorporate power control. The main idea of these power control schemes is to use different power levels for RTS–CTS and DATA–ACK. Specifically, maximum transmit power is used for RTS–CTS, and the minimum required transmit power is used for DATA–ACK transmissions in order to save energy. However, we show that these schemes can degrade network throughput and can result in higher energy consumption than when using IEEE 802.11 without power control. We propose a power control protocol which does not degrade throughput and yields energy saving.     

Dynamic reallocation of capacity in logically fully‐connected networks

We study the benefits that can be realised when capacity reallocation schemes are implemented in telecommunications networks. Our basic model consists of a (possibly sparse) physical network above which is overlaid a logically fully‐connected network. This is achieved by reserving capacity on the physical links for exclusive use by each origin–destination pair. If the capacity allocated to the origin–destination pairs is fixed, then such a network is likely to produce poor performance due to restriction of multiplexing opportunities. However, this effect can be largely negated by employing a capacity reallocation scheme, where capacity is moved in a dynamic fashion to areas where congestion is occurring. For such a scheme to be scalable, it is essential that it be distributed in nature. In this paper, we present three distributed, dynamic capacity reallocation schemes and compare their performance using a simulation model. Copyright © 2004 John Wiley & Sons, Ltd.