The Content Driven Mobile Internet

The development of future mobile networks will be driven, in large part, by content and web based services. In this paper, we examine several performance, scalability and architectural challenges faced by future mobile web applications and how advanced mobile content delivery techniques can address these challenges. We review existing content delivery using a taxonomy that consists of three categories: network scaling, end system acceleration, and content and protocol optimization. While wireline content delivery focuses on network and server scalability, mobile content delivery will likely benefit most from optimizing radio link usage. We also present our ongoing work in this area, which extends the functionality of edge caching to the terminal, uses user interest correlation information to maintain low terminal power consumption and adds a new dimension to radio resource management. This revised version was published online in August 2006 with corrections to the Cover Date.     

Thermal latency of novel chelating borate catalysts as latent catalysts for epoxy–phenolic resins

Novel quaternary ammonium bis(2‐oxybenzoyloxy)borate salts ( 1a – 1c ) or quaternary ammonium bis(1,2‐benzenedioxy)borate salts ( 2a and 2b ) with tetra‐n‐butylammonium (TBA⁺), tetra‐n‐octylammonium (TOA⁺), or bis(triphenylphosphoranylidene)ammonium (PNP⁺) cations were synthesized as latent catalysts of epoxy/phenol–novolac resins by the complexation between boric acid and salicylic acid or catechol, followed by neutralization with quaternary ammonium hydroxide. Polyaddition reactions of diglycidyl ether of bisphenol A (DGEBA) and 4,4′‐bisphenol F (44BPF) or bisphenol F (BPF‐D) with the ammonium borates were investigated as model reactions of epoxy/phenol–novolac resin systems with respect to the thermal latency and storage stability of the catalyst. The polyaddition of DGEBA/44BPF with 1a – 1c in diglyme at 150 °C for 6 h proceeded up to 85–96% conversions and gave polymers with number‐average molecular weights of 4180–10,500, whereas the polyaddition at 80 °C for 6 h gave less than 8% conversions. However, the polyaddition with 2a containing TBA⁺ cation proceeded to only a 32% conversion at 150 °C for 6 h in diglyme and to a 64% conversion even at 180 °C for 6 h in triglyme and only gave low molecular weight oligomers, and no reaction proceeded in the polyaddition at 80 °C. However, polyaddition with 2b containing PNP⁺ cation proceeded up to a 96% conversion at 150 °C for 6 h in diglyme and gave a higher molecular weight polymer with a number‐average molecular weight of 8050, whereas the polyaddition at 80 °C for 6 h gave only a 5% conversion. The catalytic activity of ammonium borates 1a – 1c and 2a and 2b depended on the borate anion structure: 1a and 1c with bis(2‐oxybenzoyloxy)borate anion revealed higher activity than 2a and 2b with bis(1,2‐benzenedioxy)borate anion, respectively. In comparison with tetra‐n‐butylammonium bromide (TBAB) as a conventional ammonium salt or tetra‐n‐butylammonium tetrakis(benzoyloxy)borate (TBA‐TBB), 1a – 1c and 2b revealed better thermal latency. The catalytic activity of ammonium borates also depended on the bulkiness of the ammonium cation, and the order of activity was 1c (PNP⁺) > 1b (TOA⁺) ≧ 1a (TBA⁺) and 2b (PNP⁺) > 2a (TBA⁺). The storage stability of DGEBA/BPF‐D with the ammonium borate catalysts 1a – 1c and 2a and 2b in bulk at 40 °C was much better than that with TBAB and TBA‐TBB. © 2002 Wiley Periodicals, Inc. J Polym Sci Part A: Polym Chem 40: 2702–2716, 2002     

Optimization of listening time of S-MAC for wireless sensor networks

In wireless sensor networks, sensor nodes are usually battery-operated computing and sensing devices, hence operations are limited by the initially equipped batteries, which are hard to be recharged or replaced. In this sense, saving energy consumption becomes significant. As most energy waste is from the always-on wireless interface, S-MAC is suggested to reduce energy consumption by introducing periodic listen/sleep scheme. However, when designing the listening time, S-MAC fails to consider the traffic distribution factor. In this article, an optimization for this scheme is proposed based on the distribution model. Evaluations show that the optimized S-MAC achieves considerable improvement in energy and latency.     

基于速度触发的提前切换算法在LTE-R中的应用研究

随着高铁的快速发展,铁路移动通信系统对切换时延、切换成功率等要求更为苛刻。该文针对铁路长期演进(LTE-R)系统提出基于速度触发的提前切换算法,通过提前进行信令交互、设置切换预承载点切换的方式抑制过早或过迟切换所带来的通信中断、掉话等问题。通过信令流程图进行理论分析,并对长期演进(LTE)各结构类型数据计算可知,该算法均可缩短切换时延,其中TDD帧结构类型2时效果最为显著。最后通过仿真对比得到提前切换算法相比传统切换算法有着更高且更稳定的切换成功率,验证算法的有效性,为LTE-R在未来铁路专网的应用提供技术支持。     

设备级OS中任务调度的IO抖动优化策略

 为了减小任务调度产生的抖动对设备级操作系统的稳定性和可靠性的影响,提出了一种带有抢占阈值的任务分割模型RJPS.根据抢占阈值对任务调度的抖动与延迟的影响及该模型下任务可调度性的分析,分别设计了基于固定优先级调度和动态优先级调度策略的最小阈值分配算法.仿真结果表明,该模型可以在保证任务集可调度的前提下明显减少任务的IO抖动.     

ON-CRP：机会网络缓存替换策略研究

提出了一种新的机会网络缓存替换策略(ON-CRP,opportunistic networking cache replacement policy).与现有策略不同,该策略基于节点与数据项的相关度来选择要替换的缓存数据,并利用人类移动模式提取了目标地址匹配概率这一关键因素来对相关度进行判定;同时结合数据项的访问与更新频率比值这一重要因素来对缓存数据替换标准进行设计.仿真实验结果表明ON-CRP能够有效降低数据的远程访问延迟,与其他缓存替换算法相比网络开销降低了约30%,而数据的缓存命中率性能有约10%～30%的提高.     

A branch-and-cut-and-price algorithm for the cumulative capacitated vehicle routing problem

In this paper we consider the Cumulative Capacitated Vehicle Routing Problem (CCVRP), which is a variation of the well-known Capacitated Vehicle Routing Problem (CVRP). In this problem, the traditional objective of minimizing total distance or time traveled by the vehicles is replaced by minimizing the sum of arrival times at the customers. We propose a branch-and-cut-and-price algorithm for obtaining optimal solutions to the problem. To the best of our knowledge, this is the first published exact algorithm for the CCVRP. We present computational results based on a set of standard CVRP benchmarks and investigate the effect of modifying the number of vehicles available.     

Optimal chunk caching in network coding-based qualitative communication

Network processing in the current Internet is at the entirety of the data packet, which is problematic when encountering network congestion. The newly proposed Internet service named Qualitative Communication changes the network processing paradigm to an even finer granularity, namely chunk level, which obsoletes many existing networking policies and schemes, especially the caching algorithms and cache replacement policies that have been extensively explored in Web Caching, Content Delivery Networks (CDN) or Information-Centric Networks (ICN). This paper outlines all the new factors that are brought by random linear network coding-based Qualitative Communication and proves the importance and necessity of considering them. A novel metric is proposed by taking these new factors into consideration. An optimization problem is formulated to maximize the metric value of all retained chunks in the local storage of network nodes under the constraint of storage limit. A cache replacement scheme that obtains the optimal result in a recursive manner is proposed correspondingly. With the help of the introduced intelligent cache replacement algorithm, the performance evaluations show remarkably reduced end-to-end latency compared to the existing schemes in various network scenarios.