A new cost function for improving Anypath routing performance of VANETs in highways

Wireless Networks - Instability of wireless networks and high mobility of vehicles make effective and reliable delivery of packets in VANETs a challenging issue. Anypath routing is proposed to...     

Asymptotic performance of vector quantizers with a perceptualdistortion measure

Gersho's (1979) bounds on the asymptotic performance of vector quantizers are valid for vector distortions which are powers of the Euclidean norm. Yamada, Tazaki, and Gray (1980) generalized the results to distortion measures that are increasing functions of the norm of their argument. In both cases, the distortion is uniquely determined by the vector quantization error, i.e., the Euclidean difference between the original vector and the codeword into which it is quantized. We generalize these asymptotic bounds to input-weighted quadratic distortion measures and measures that are approximately output-weighted-quadratic when the distortion is small, a class of distortion measures often claimed to be perceptually meaningful. An approximation of the asymptotic distortion based on Gersho's conjecture is derived as well. We also consider the problem of source mismatch, where the quantizer is designed using a probability density different from the true source density. The resulting asymptotic performance in terms of distortion increase in decibels is shown to be linear in the relative entropy between the true and estimated probability densities     

Packet scheduling algorithms and performance of a bufferedshufflenet with deflection routing

In a multihop network, packets go through a number of hops before they are absorbed at their destinations. In routing to its destination using minimum path, a packet at a node may have a preferential output link (the so-called “care” packet) or may not (the so-called “don't care” packet). Since each node in an optical multihop network may have limited buffer, when such buffer runs out, contention among packets for the same output link can be resolved by deflection. In this paper, we study packet scheduling algorithms and their performance in a buffered regular network with deflection routing. Using shufflenet as an example, we show that high performance (in terms of throughput and delay) can he achieved if “care” packets can be scheduled with higher priority than “don't care” packets. We then analyze the performance of a shufflenet with this priority scheduling given the buffer size per node. Traditionally, the deflection probability of a packet at a node is solved from a transcendental equation by numerical methods which quickly becomes very cumbersome when the buffer size is greater than one packet per node. By exploiting the special topological properties of the shufflenet, we are able to simplify the analysis greatly and obtain a simple closed-form approximation of the deflection probability. The expression allows us to extract analytically the performance trend of the shufflenet with respect to its buffer and network sizes. We show that a shufflenet indeed performs very well with only one buffer, and can achieve performance close to the store-and-forward case using a buffer size as small as four packets per node     

Ad hoc routing protocol's performance: a realistic simulation based study

Multiple wireless devices jointly create and maintain ad hoc networks; their employment is favored to happen in a variety of environments with distinct topological characteristics. Diversified environmental conditions are expected to vary network performance. In fact, obstacles, buildings and/or mountains may act as either barriers, or source of noise for the radio signals. Nevertheless, most of the previous performance evaluation studies based on simulation, neglected this consideration; they used simulation models that were too simplistic, and too narrow (i.e. idealistic) in their scopes. With this paper we propose a new, complete and realistic Urban Mobility Model (UMM). It models realistically users motion, and radio signals propagation in a city-like scenario. Our aim is to study the effects of realistic network simulation on routing performance. The results prove that a realistic scenario with roads and buildings has a significant impact on routing.     

Objective image fusion performance measure

A measure for objectively assessing the pixel level fusion performance is defined. The proposed metric reflects the quality of visual information obtained from the fusion of input images and can be used to compare the performance of different image fusion algorithms. Experimental results clearly indicate that this metric is perceptually meaningful     

Security and performance enhancement of AODV routing protocol

A mobile ad hoc networks (MANET) is a decentralized, self‐organizing, infrastructure‐less network and adaptive gathering of independent mobile nodes. Because of the unique characteristics of MANET, the major issues to develop a routing protocol in MANET are the security aspect and the network performance. In this paper, we propose a new secure protocol called Trust Ad Hoc On‐demand Distance Vector (AODV) using trust mechanism. Communication packets are only sent to the trusted neighbor nodes. Trust calculation is based on the behaviors and activities information of each node. It is divided in to trust global (TG) and trust local (TL). TG is a trust calculation based on the total of received routing packets and the total of sending routing packets. TL is a comparison between total received packets and total forwarded packets by neighbor node from specific nodes. Nodes conclude the total trust level of its neighbors by accumulating the TL and TG values. The performance of Trust AODV is evaluated under denial of service/distributed denial of service (DOS/DDOS) attack using network simulator NS‐2. It is compared with the Trust Cross Layer Secure (TCLS) protocol. Simulation results show that the Trust AODV has a better performance than TCLS protocol in terms of end‐to‐end delay, packet delivery ratio, and overhead. Next, we improve the performance of Trust AODV using ant algorithm. The proposed protocol is called Trust AODV + Ant. The implementation of ant algorithm in the proposed secure protocol is by adding an ant agent to put the positive pheromone in the node if the node is trusted. Ant agent is represented as a routing packet. The pheromone value is saved in the routing table of the node. We modified the original routing table by adding the pheromone value field. The path communication is selected based on the pheromone concentration and the shortest path. Trust AODV + Ant is compared with simple ant routing algorithm (SARA), AODV, and Trust AODV under DOS/DDOS attacks in terms of performance. Simulation results show that the packet delivery ratio and throughput of the Trust AODV increase after using ant algorithm. However, in terms of end‐to‐end delay, there is no significant improvement. Copyright © 2014 John Wiley & Sons, Ltd.     

使用系统总线性能计数器来测量和改善嵌入式系统的性能

了解系统总线的活动情况可帮助开发工程师显著改善嵌入式应用的性能。过去,由于嵌入式处理器缺乏复杂的软硬件结合特性,因此监测系统总线的活动情况是一项挑战性难题。在系统级了解应用程序的行为对于有效利用系统资源非常关键,这些资源包括外部存储器、DMA控制器、仲裁、系统总线互连等。     

QoS routing computation with path caching: a framework and network performance

We present a framework for QoS routing computation with path caching. The framework has three phases to allow different levels of information to be processed at different timescales to effectively meet QoS requirement of a newly arrived flow. Path caching is introduced in the first phase to allow selection and filtering in subsequent phases. We describe several routing schemes that can fit into this framework. Through simulation results, we show where and how the benefit of path caching can be exploited depending on the number of paths cached, and when to invoke other controls. Our results show that QoS routing by itself cannot improve the network and/or service performance unless controls such as trunk reservation and source-based admission control are also activated. The invocation of these functions can also allow maximum benefit from the path caching framework.     

Information measure for performance of image fusion

Mutual information is proposed as an information measure for evaluating image fusion performance. The proposed measure represents how much information is obtained from the input images. No assumption is made regarding the nature of the relation between the intensities in both input modalities. The results show that the measure is meaningful and explicit     

无线传感器网络路由协议性能研究

无线传感器网络是目前网络研究的热点,其路由协议的设计是最具挑战性的问题之一,对目前典型的无线传感器网络的路由协议进行分类研究和性能分析,设计并实现了在NS2环境下典型协议的仿真场景和性能分析比较。对无线传感器网络路由协议的研究和组网具有参考指导意义。     

Constrained and Unconstrained overspill routing in optical networks: a detailed performance evaluation

In this article, we present a detailed performance evaluation of a hybrid optical switching (HOS) architecture called Overspill Routing in Optical Networks (ORION). The ORION architecture combines (optical) wavelength and (electronic) packet switching, so as to obtain the individual advantages of both switching paradigms. In particular, ORION exploits the possible idle periods of established lightpaths to transmit packets destined to the next common node, or even directly to their common end-destination. Depending on whether all lightpaths are allowed to simultaneously carry and terminate overspill traffic or overspill is restricted to a sub-set of wavelengths, the architecture limits itself to constrained or un-constrained ORION. To evaluate both cases, we developed an extensive network simulator where the basic features of the ORION architecture were modeled, including suitable edge/core node switches and load-varying sources to simulate overloading traffic conditions. Further, we have assessed various aspects of the ORION architecture including two basic routing/forwarding policies and various buffering schemes. The complete network study shows that ORION can absorb temporal traffic overloads, as intended, provided sufficient buffering is present. We also demonstrate that the restriction of simultaneous packet insertions/extractions, to reduce the necessary interfaces, do not deteriorate performance and thus the use of traffic concentrators assure ORION’s economic viability.     

云计算平台生存性研究

本文主要研究云计算平台的生存性问题,设计并提出一种云计算平台生存性机制,利用虚拟化技术把硬件环境与运行系统进行强隔离后,通过把虚拟机迁移到稳定可靠的硬件设备上来保证虚拟机承载的服务的可用性,以提升云计算平台在大规模系统故障发生的情况下的存活能力。具体工作包括设计基于基础设施运行状况的实时监控、基于虚拟机的调度优化、云服务的自动迁移调度和服务自动恢复、以及在异常出现情况下的预警和告警的机制。本文的主要贡献包括确立了云计算平台的生存性需求,提出了基于虚拟资源迁移的生存性机制以及实现并整合生存性机制到现有的Vebula私有云基础设施平台。     

Objective measure of performance of voice activity detectors

A method for objectively measuring the subjective quality of speech clipped by voice activity detectors (VADs) is presented. This system is evaluated by comparing the output of a VAD to that obtained from subjective tests. The method is shown to produce an accurate prediction of the mean opinion score (MOS) determined by listening tests     

An objective performance measure in multiresolution signaldecomposition

Presents an analysis of band energies and evaluates the effects of aliasing in perfect reconstruction (PR) multirate systems. An objective performance measure called nonaliasing energy ratio (NER) is defined. The merit of the new measure is emphasized with performance comparisons of popular block transforms and 2-band PR-QMF based hierarchical filter banks. It is shown that the new measure complements the widely used energy compaction measure     

Survivability and scalability of space networks: a survey

Survivability and scalability are key terms for any network. The challenge is greater in space networks than in terrestrial networks. Satellites have various uses, some notable uses are communication, observation, meteorology, navigation etc. In future satellites will aid terrestrial users by providing Internet connectivity. With proliferation of Internet users, demand for satellite services will increase and soon we will suffer from bandwidth limitation. Hence, the scalability and survivability of space networks are very important issues to ensure smooth connectivity to all the users both mobile and immobile. Since, most of the existing works on network survivability and scalability are focused on terrestrial networks. We have categorized the existing works on survivability and scalability of terrestrial networks. In addition, we have performed a comprehensive survey on the popular products available in the market for network survivability and scalability. Finally, we have listed the major issues and challenges of space networks that needs to be considered before applying network scalability and survivability solutions on them. This work can help network engineers to select suitable solutions for space networks considering the available choices and challenges listed in this paper.     

Concerning mean packet delay as a performance measure in single channel networks

It is shown that, under certain conditions, it is possible to have mean packet delay greater than mean message delay in single channel networks. The analysis includes overheads and transmission interference. It is shown further that for exponential message lengths, under the same assumptions, mean packet delay is always greater than mean message delay.     

Planar clock routing for high performance chip and packageco-design

A new concept of chip and package co-design for the clock network is presented in this paper. We propose a two level clock distribution scheme which partitions the clock network into two levels. First, the clock terminals are partitioned into a set of clusters. For each cluster, a local on-chip clock tree is used to distribute the clock signal from a locally inserted buffer to terminals inside this cluster. The clock signal is then distributed from the main clock driver to each of local buffers by means of a global clock tree, which is a planar tree with equal path lengths. With the flip chip area I/O attachment, the planar global clock tree can be put on a dedicated package layer. The interconnect on the package layer has two to four order smaller resistance than that on the chip layer. The main contribution of this paper is a novel algorithm to construct a planar clock tree with equal path lengths-the length of the path from the clock source to each destination is exactly the same. In addition, the path length from the source to destinations is minimized     

Analysis of MANET dynamic source routing and its performance enhancements

Since the inception of the dynamic source routing (DSR) protocol for mobile ad hoc networks, several enhancements have been proposed, along with other competing routing protocols. All of them provide different degrees of throughput improvement under different scenarios. In this paper, we use DSR as a base, diagnose the contribution of its constituent components, and provide the reason why certain routing enhancements can increase the throughput and under what conditions. A major finding of the study is that the broadcast mechanism used in propagating route request and route error messages has a significant impact on how routing behaves. We also show that unicast route error report and preventive cache update improve throughput at different sides of the mobility spectrum. Finally, we show that aggressive buffer combined with route management provides the best performance improvement on the entire mobility and loading spectrum. Copyright © 2013 John Wiley & Sons, Ltd.     

多层网络的生存性技术

从适应多层网络发展的需要,分析了WDM网络的分层关系,提出了两种多层网络的生存性方案及具体实现方法。     

Efficiency measure of routing protocols in vehicular ad hoc network using freeway mobility model

To move packets among the vehicles mobility pattern of vehicles in a vehicular network performs an imperative factor for creating competent routing protocol. To reproduce the movement features of vehicles in VANET is the main purpose of the mobility model. Manhattan mobility model is conversed by a lot of researchers. Merely very limited research study is prepared on highway and freeway mobility models. In this document Cluster scheme, different routing protocols are used to the freeway mobility based vehicular architecture. The Ns2.34 simulation effect illustrates the effort of cluster scheme over different protocols and standard 802.11p. The competence of the routing protocols in the vehicular communication by means of freeway movement pattern is estimated by different network parameters.