In Hierarchical Mobile IPv6 (HMIPv6), most of existing MAP selection schemes is Mobile Node (MN) based, which implements MAP selection on MN side and supposes all MNs use the same selection algorithm. But in practical...
详细信息
In this paper, we propose and analyze DMAP-FR, a mobility and service management scheme with failure recovery control in Mobile IPv6systems. Vie basic idea behind DMAP-FR is to leverage access routers (ARs) as region...
详细信息
ISBN:
(纸本)9781424437702
In this paper, we propose and analyze DMAP-FR, a mobility and service management scheme with failure recovery control in Mobile IPv6systems. Vie basic idea behind DMAP-FR is to leverage access routers (ARs) as regional mobility anchor points (MAPs) as in HMIPv6 for mobility and service management for mobile nodes (MNs). However unlike HMIPv6, DMAP-FR allows the MAP of each MN to be determined dynamically based on the mobility and service characteristics of the MN and the failure behavior of ARs withthe goal to minimize the network traffic. DMAP-FR incorporates fault tolerance mechanisms to allow the system to quickly recover from AR and MAP failures. We identify the best dynamic regional area size for the selection of MAPs for each MN such that the overall network traffic due to servicing mobility, service and fault tolerance related operations is minimized. We demonstrate that DMAP-FR outperforms HMIPv6 for the same AR failure rate.
作者：
Spampinato, C.Univ Catania
Dept Informat & Telecommun Engn Viale Andrea Doria 6 I-95125 Catania Italy
We propose a novel method for object tracking using an adaptive algorithm based on statistical analysis of objects shape. To track objects in video sequence, we use a system that combines two algorithms: a histogram a...
详细信息
ISBN:
(纸本)9780769535203
We propose a novel method for object tracking using an adaptive algorithm based on statistical analysis of objects shape. To track objects in video sequence, we use a system that combines two algorithms: a histogram analysis algorithm and a statistical shape features modeling algorithm. the main improvement of the proposed system with respect to the others present in literature is that we do not use any a priori knowledge about how objects look like. this no a-priori model has been carried out by computing a model that takes into account the statistical behaviour of the most important objects features over the whole video frames. Moreover an adaptive mechanism allows us to reset the statistical model creation when such a model is too much dissimilar from the real blobs features. Experiments on some real-world difficult scenarios of low resolution videos and in unconstrained environments demonstrate the very promising results achieved.
In membrane computing, P system has proved to be a rich framework for handling a variety of problems arising in different areas. In this note we examine an array-rewriting P system for rectangular picture array genera...
详细信息
ISBN:
(纸本)9781424438655
In membrane computing, P system has proved to be a rich framework for handling a variety of problems arising in different areas. In this note we examine an array-rewriting P system for rectangular picture array generation. this system makes use of Pure 2D context-free grammar rules in its regions. We obtain certain comparison results that bring out the suitability of this P system model in increasing the generative power of picture generation.
this paper proposes a LDPC (Low Density Parity Check Codes) encoder architecture for DMB-th based on ASIP (Application Specific Instruction Set Processor) the encoding algorithm is first analyzed and optimized for the...
详细信息
ISBN:
(纸本)9781424447541
this paper proposes a LDPC (Low Density Parity Check Codes) encoder architecture for DMB-th based on ASIP (Application Specific Instruction Set Processor) the encoding algorithm is first analyzed and optimized for the ASIP encode, And then the special instruction sets are extracted according to the optimized algorithm the ASIP architecture uses main processor and coprocessor to get high throughput this ASIP encoder can support three different code rates (0 4, 0 6 and 0 8) just by different programs and thus is more flexible than other ASIC implementations Based on XC2V6000, at the max frequency of 117MHz, the max throughput of the encoder can deliver 187Mbps, 206Mbps and 232Mbps for 04, 0 6 and 0 8 code rates, respectively
Recent breakthroughs in cryptanalysis of standard hash functions like SHA-1 and MD5 raise the need for alternatives. the MD6 hash function is developed by a team led by Professor Ronald L. Rivest in response to the ca...
详细信息
ISBN:
(纸本)9780769536781
Recent breakthroughs in cryptanalysis of standard hash functions like SHA-1 and MD5 raise the need for alternatives. the MD6 hash function is developed by a team led by Professor Ronald L. Rivest in response to the call for proposals for a SHA-3 cryptographic hash algorithm by the National Institute of Standards and Technology. the hardware performance evaluation of hash chip design mainly includes efficiency and flexibility. In this paper, a RAM-based reconfigurable FPGA implantation of the MD6-224/256/384/512 hash function is presented. the design achieves a throughput ranges from 118 to 227 Mbps at the maximum frequency of 104MHz on low-cost Cyclone III device. the implementation of MD6 core functionality uses mainly embedded Block RAMs and small resources of logic elements in Altera FPGA, which satisfies the needs of most embedded applications, including wireless communication. the implementation results also show that the MD6 hash function has good reconfigurability.
In this paper, we propose an efficient method to solve polynomial systems whose equations are left invariant by the action of a finite group G. the idea is to simultaneously compute a truncated SAGBI-Grobner bases (a ...
详细信息
ISBN:
(纸本)9781605586090
In this paper, we propose an efficient method to solve polynomial systems whose equations are left invariant by the action of a finite group G. the idea is to simultaneously compute a truncated SAGBI-Grobner bases (a generalisation of Grobner bases to ideals of subalgebras of polynomial ring) and a Grobner basis in the invariant ring K[sigma(1),...,sigma(n)] where sigma(i) is the i-th elementary symmetric polynomial. To this end, we provide two algorithms: first, from the F-5 algorithm we can derive an efficient and easy to implement algorithm for computing truncated SAGBI-Grobner bases of the ideals in invariant rings. A first implementation of this algorithm in C enable us to estimate the practical efficiency: for instance, it takes only 92s to compute a SAGBI basis of Cyclic 9 modulo a small prime. the second algorithm is inspired by the FGLM algorithm: from a, truncated SAGBI-Grobner basis of a zero-dimensional ideal we can compute efficiently a Grobner basis in some invariant rings K[h(1),...,h(n)]. Finally, we will show how this two algorithms can be combined to find the complex roots of such invariant polynomial systems.
In optical burst switching networks, bursts arrive out-of-sequence due to contention resolution schemes as well as contention avoidance schemes. Out-of-sequence bursts may imply out-of-sequence packets, which affect t...
详细信息
ISBN:
(纸本)9789639799493
In optical burst switching networks, bursts arrive out-of-sequence due to contention resolution schemes as well as contention avoidance schemes. Out-of-sequence bursts may imply out-of-sequence packets, which affect the packet layer performance. Consequently, it is necessary to classify and investigate the resulting burst/packet out-of-sequence pattern. In our previous work, we presented an analytic model to evaluate the out-of-sequence pattern for deterministic traffic showing constant interarrival times using the IETF WG IPPM reordering metrics. this paper extents our previous work. If the amount of out-of-order arrivals is small, the performance impact may also be small. One indication of the amount of out-of-order arrivals is the reordering ratio. In this paper, we prove analytically that deterministic traffic with constant inter-arrival time generates the highest reordering ratio for our model with respect to any other traffic characteristic. Consequently, deterministic traffic serves as an upper bound for the estimation of the reordering ratio. It allows a quick estimation of the reordering ratio and indicates if further investigations on the reordering pattern are required.
In this paper we present local distributed algorithms for constructing spanners in wireless sensor networks modeled as unit ball graphs (shortly UBGs) and quasi-unit ball graphs (shortly quasi-UBGs), in the 3-dimensio...
详细信息
ISBN:
(纸本)9783642020841
In this paper we present local distributed algorithms for constructing spanners in wireless sensor networks modeled as unit ball graphs (shortly UBGs) and quasi-unit ball graphs (shortly quasi-UBGs), in the 3-dimensional Euclidean space. Our first contribution is a local distributed algorithm that, given a UBG U and a parameter alpha < pi/3, constructs a sparse spanner of U with stretch factor 1/(1 - 2 sin (alpha/2)), improving the previous upper bound of 1/(1 - alpha) by Althofer et al. which is applicable only when alpha < 1/(1 + 2 root-2) < pi/3. the second contribution of this paper is in presenting the first local distributed algorithm for the construction of bounded-degree lightweight spanners of UBGs and quasi-UBGs. the simulation results we obtained show that, empirically, the weight of the spanners, the stretch factor and locality of the algorithms, are much better than the theoretical upper bounds proved in this paper.
A class of network design problems, including the k-path/tree/cycle covering problems and some location-routing problems, can be modeled by downwards monotone functions [5]. We consider a class of network design probl...
详细信息
ISBN:
(纸本)9783642028816
A class of network design problems, including the k-path/tree/cycle covering problems and some location-routing problems, can be modeled by downwards monotone functions [5]. We consider a class of network design problems, called the p-constrained path/tree/cycle covering problems, obtained by introducing an additional constraint to these problems;i.e., we require that the number of connected components in the optimal solution be at most p for some integer p. the p-constrained path/tree/cycle covering problems cannot be modeled by downwards monotone functions. In this paper, we present a different analysis for the performance guarantee of the algorithm in [5]. As a result of the analysis, we are able to tackle p-constrained path/tree/cycle covering problems, and show the performance bounds of 2 and 4 for p-constrained tree/cycle problems and p-constrained path covering problems respectively.
暂无评论