基于普及计算基础上的智能建筑未来展望

论述了智能建筑的发展概况，介绍了智能建筑的发展趋势，即普及计算与建筑密切结合，会促成自主管理和控制智能建筑的产生，并对可能出现的问题进行探讨。     

Impacts of user-selfishness on cooperative content caching in social wireless networks

Cooperative caching can be an effective mechanism for reducing electronic content provisioning cost in Social Wireless Networks (SWNETs). These networks are formed by a collection of mobile data enabled devices physically gathering in settings such as university campus, malls, airport and other public places. In this paper, we first propose an optimal collaborative object caching policy in order to minimize the object provisioning cost in SWNETs with homogenous user requests and a peer-rebate model for promoting collaboration. Then using an analytical model we study the impacts of user selfishness on the provisioning cost and the earned rebate when certain nodes in an SWNET selfishly deviate from the optimal policy. User selfishness is motivated in order to either increase individually earned rebate or to reduce content provisioning cost. The analytical model is validated by experimental results from simulated SWNETs using the network simulator ns2.     

基于OSGI的智能家庭系统的设计与实现

为了解决普适环境下智能家庭各类设备组网困难的问题,本系统采用OSGi(Open Service Gateway Initiative)服务框架和LonWorks现场总线技术,利用低压电力线载波手段来设计和实现智能家庭系统.利用上述方法可以极大地实现不同标准设备的组网,并且可以实现对智能家庭设备管理的灵活性和便捷性.     

An altruistic cross‐layer recovering mechanism for ad hoc wireless networks

Video streaming services have restrictive delay and bandwidth constraints. Ad hoc networks represent a hostile environment for this kind of real‐time data transmission. Emerging mesh networks, where a backbone provides more topological stability, do not even assure a high quality of experience. In such scenario, mobility of terminal nodes causes link breakages until a new route is calculated. In the meanwhile, lost packets cause annoying video interruptions to the receiver. This paper proposes a new mechanism of recovering lost packets by means of caching overheard packets in neighbor nodes and retransmit them to destination. Moreover, an optimization is shown, which involves a video‐aware cache in order to recover full frames and prioritize more significant frames. Results show the improvement in reception, increasing the throughput as well as video quality, whereas larger video interruptions are considerably reduced. Copyright © 2014 John Wiley & Sons, Ltd.     

异步传输的分布式铁路10 kV电力监控系统

为解决提速铁路10 kV电力系统运行参数变化快、海量实时数据传输和处理困难的问题,设计研发了实时异步传输的电力远动监控系统.对铁路10 kV电力系统的运行、录波数据的远程传输和海量实时数据的处理进行了分析设计.提出了利用发布/订阅原理进行异步数据传输的模式,考虑到实时数据点多、变化快的特点.建立了实时数据交换的二级缓存...     

A Game Theoretic Approach for Energy-Efficient In-Network Caching in Content-Centric Networks

Recently, content-centric networking （CCN） has become a hot research topic for the diffusion of contents over the Internet. Most existing works on CCN focus on the improvement of network resource utilization. Consequently, the energy consumption aspect of CCN is largely ignored. In this paper, we propose a distributed energyefficient in-network caching scheme for CCN, where each content router only needs locally available information to make caching decisions considering both caching energy consumption and transport energy consumption. We formulate the in-network caching problem as a non-cooperative game. Through rigorous mathematical analysis, we prove that pure strategy Nash equilibria exist in the proposed scheme, and it always has a strategy profile that implements the socially optimal configuration, even if the touters are self-interested in nature. Simulation results are presented to show that the distributed solution is competitive to the centralized scheme, and has superior performance compared to other popular caching schemes in CCN. Besides, it exhibits a fast convergence speed when the capacity of content routers varies.     

断接下移动终端的简单查询算法研究

提出了断接下移动终端简单查询算法SQPID,该算法通过合并与裁剪操作构建综合相关语义缓存项,且合并过程不涉及间接相关性判断,从而简化了以往算法的处理过程,提高了近似查询结果的导出速度。实验表明,SQPID算法在查询响应时间和精确度方面都更好地满足了用户的需求。     

Design of in-network caching scheme in CCN based on grey relational analysis

In-network caching is one of the most important issues in content centric networking （CCN）, which may extremely influence the performance of the caching system. Although much work has been done for in-network caching scheme design in CCN, most of them have not addressed the multiple network attribute parameters jointly during caching algorithm design. Hence, to fill this gap, a new in-network caching based on grey relational analysis （GRA） is proposed. The authors firstly define two newly metric parameters named request influence degree （RID） and cache replacement rate, respectively. The RID indicates the importance of one node along the content delivery path from the view of the interest packets arriving The cache replacement rate is used to denote the caching load of the node. Then combining hops a request traveling from the users and the node traffic, four network attribute parameters are considered during the in-network caching algorithm design. Based on these four network parameters, a GRA based in-network caching algorithm is proposed, which can significantly improve the performance of CCN. Finally, extensive simulation based on ndnSIM is demonstrated that the GRA-based caching scheme can achieve the lower load in the source server and the less average hops than the existing the betweeness （Betw） scheme and the ALWAYS scheme.     

Caching and optimized request routing in cloud-based content delivery systems

Geographically distributed cloud platforms enable an attractive approach to large-scale content delivery. Storage at various sites can be dynamically acquired from (and released back to) the cloud provider so as to support content caching, according to the current demands for the content from the different geographic regions. When storage is sufficiently expensive that not all content should be cached at all sites, two issues must be addressed: how should requests for content be routed to the cloud provider sites, and what policy should be used for caching content using the elastic storage resources obtained from the cloud provider. Existing approaches are typically designed for non-elastic storage and little is known about the optimal policies when minimizing the delivery costs for distributed elastic storage.In this paper, we propose an approach in which elastic storage resources are exploited using a simple dynamic caching policy, while request routing is updated periodically according to the solution of an optimization model. Use of pull-based dynamic caching, rather than push-based placement, provides robustness to unpredicted changes in request rates. We show that this robustness is provided at low cost. Even with fixed request rates, use of the dynamic caching policy typically yields content delivery cost within 10% of that with the optimal static placement. We compare request routing according to our optimization model to simpler baseline routing policies, and find that the baseline policies can yield greatly increased delivery cost relative to optimized routing. Finally, we present a lower-cost approximate solution algorithm for our routing optimization problem that yields content delivery cost within 2.5% of the optimal solution.