A zone co‐operation approach for efficient caching in mobile ad hoc networks

Mobile Ad hoc NETwork (MANET) presents a constrained communication environment due to fundamental limitations of client resources, insufficient wireless bandwidth and users' frequent mobility. Caching of frequently accessed data in such environment is a potential technique that can improve the data access performance and availability. Co‐operative caching, which allows the sharing and co‐ordination of cached data among clients, can further explore the potential of the caching techniques. In this paper, we propose a novel scheme, called zone co‐operative (ZC) for caching in MANETs. In ZC scheme, one‐hop neighbours of a mobile client form a co‐operative cache zone. For a data miss in the local cache, each client first searches the data in its zone before forwarding the request to the next client that lies along routing path towards server. As a part of cache management, cache admission control and value‐based replacement policy are developed to improve the data accessibility and reduce the local cache miss ratio. An analytical study of ZC based on data popularity, node density and transmission range is also performed. Simulation experiments show that the ZC caching mechanism achieves significant improvements in cache hit ratio and average query latency in comparison with other caching strategies. Copyright © 2006 John Wiley & Sons, Ltd.     

Impact of node distance on selfish replica allocation in a mobile ad-hoc network

Many data replication techniques have been proposed to minimize performance degradation caused by network partitioning in a mobile ad-hoc network. Most of them assume that all mobile nodes collaborate fully in terms of sharing their memory space. However, in reality, some nodes may selfishly decide to only cooperate partially, or not at all, with other nodes. Recently, a new approach to selfish replica allocation has been proposed to handle node selfishness. However, there is still much room for improvement. We empirically observe that the previous selfish replica allocation strategy suffers from long query delay and poor data accessibility, because it utilizes only non-selfish nodes that may be faraway nodes. In this paper, we propose a novel replica allocation strategy in the presence of selfish nodes, that takes into account both selfish behavior and node distance. Moreover, through a novel node leveling technique, we utilize the memory space of all connected nodes, including selfish nodes. The conducted simulations demonstrate that the proposed strategy outperforms existing replica allocation techniques in terms of data accessibility, query delay, and communication cost.     

车联网中基于MEC的V2X协同缓存和资源分配

针对车联网的多媒体业务快速增长,大量的数据交换为移动网络带来沉重负担的问题,构建了一种车联网中基于移动边缘计算的V2X协同缓存和资源分配框架。提出了V2X协同缓存与资源分配机制,实现网络内计算、缓存和通信资源的有效分配;利用图着色模型为卸载用户分配信道;采用拉格朗日乘子法对功率与计算资源进行分配。仿真结果表明,在不同的系统参数下,所提机制可以有效降低系统开销,减少任务完成时延。     

Adaptive Backbone Based Cooperative Caching in Mobile Ad hoc Networks

Existing cooperative caching algorithms for mobile ad hoc networks face serious challenges due to message overhead and scalability issues. To solve these issues, we propose an adaptive virtual backbone based cooperative caching that uses a connective dominating set (CDS) to find the desired location of cached data. Message overhead in cooperative caching is mainly due to cache lookup process used for cooperative caching. The idea in this scheme is to reduce the number of nodes involved in cache look up process, by constructing a virtual backbone adaptive to the dynamic topology in mobile ad hoc networks. The proposed algorithm is decentralized and the nodes in the CDS perform data dissemination and discovery. Simulation results show that the message overhead created by the proposed cooperative caching technique is very less compared to other approaches. Moreover, due to the CDS based cache discovery we applied in this work, the proposed cooperative caching has the potential to increase the cache hit ratio and reduce average delay.     

Dynamic cache invalidation scheme for wireless mobile environments

The caching of frequently accessed data items on the client side is an effective technique to improve performance in a mobile environment. Caching data in a wireless mobile computer can significantly reduce the bandwidth requirement. However, cache content needs to be validated; classical cache invalidation strategies are not suitable for mobile environments due to the disconnection frequency and mobility of the mobile clients. Attractive cache invalidation techniques are based on invalidation reports (IRs). But, IR-based cache invalidation schemes result in considerable consumption of uplink and download bandwidth. In this paper, we address these problems by presenting a new energy-efficient cache invalidation method for the wireless mobile environment. The new cache invalidation scheme is called Adaptive Energy Efficient Cache Invalidation Scheme (AEECIS). The algorithm is adaptive since it changes the data dissemination strategy based on the current conditions. To reduce the bandwidth requirement, the server transmits in one of three modes: slow, fast or super-fast. The mode is selected based on thresholds specified for time and the number of clients requesting updated objects. An efficient implementation of AEECIS is presented and simulations have been carried out to evaluate its caching effectiveness. The results demonstrate that it can substantially improve mobile caching by reducing the communication bandwidth (thus energy consumption) for query processing. Also, the reported results demonstrate that compared to previous IR-based schemes, AEECIS can significantly improve the bandwidth consumption and the number of uplink requests.

Metadata-guided evaluation of resource-constrained queries in content caching based wireless networks

Recent years have witnessed the emergence of data-centric storage that provides energy-efficient data dissemination and organization in mobile wireless environments. However, limited resources of wireless devices bring unique challenges to data access and information sharing. To address these challenges, we introduce the concept of content caching networks, in which the collected data will be stored by its contents in a distributed manner, while the data in the network is cached for a certain period of time before it is sent to a centralized storage space for backup. Furthermore, we propose a metadata-guided query evaluation approach to achieve query efficiency in content caching networks. By this approach, each cache node will maintain the metadata that summarizes the data content on itself. Queries will be evaluated first on the metadata before on the cached data. By ensuring that queries will only be evaluated on relevant nodes, the metadata-guided query evaluation approach can dramatically improve the performance of query evaluation. We design efficient algorithms to construct metadata for both numerical and categorical data types. Our theoretical and empirical results both show that our metadata-guided approach can accelerate query evaluation significantly, while achieving the memory requirements on wireless devices.     

GroCoca: group-based peer-to-peer cooperative caching in mobile environment

In a mobile cooperative caching environment, we observe the need for cooperating peers to cache useful data items together, so as to improve cache hit from peers. This could be achieved by capturing the data requirement of individual peers in conjunction with their mobility pattern, for which we realized via a GROup-based COoperative CAching scheme (GroCoca). In GroCoca, we define a tightly-coupled group (TCG) as a collection of peers that possess similar mobility pattern and display similar data affinity. A family of algorithms is proposed to discover and maintain all TCGs dynamically. Furthermore, two cooperative cache management protocols, namely, cooperative cache admission control and replacement, are designed to control data replicas and improve data accessibility in TCGs. A cache signature scheme is also adopted in GroCoca in order to provide information for the mobile clients to determine whether their TCG members are likely caching their desired data items and to perform cooperative cache replacement Experimental results show that GroCoca outperforms the conventional caching scheme and standard COoperative CAching scheme (COCA) in terms of access latency and global cache hit ratio. However, GroCoca generally incurs higher power consumption     

Cooperative cache consistency maintenance for pervasive internet access

Cooperative caching is an important technique to support pervasive Internet access. In order to ensure valid data access, the cache consistency must be maintained properly. However, this problem has not been sufficiently studied in mobile computing environments, especially those with ad hoc networks. There are two essential issues in cache consistency maintenance: consistency control initiation and data update propagation. Consistency control initiation not only decides the cache consistency provided to the users, but also impacts the consistency maintenance cost. This issue becomes more challenging in asynchronous and fully distributed ad hoc networks. To this end, we propose the predictive consistency control initiation (PCCI) algorithm, which adaptively initiates consistency control based on its online predictions of forthcoming data updates and cache queries. In order to efficiently propagate data updates through multi‐hop wireless connections, the hierarchical data update propagation (HDUP) algorithm is proposed. Theoretical analysis shows that cooperation among the caching nodes facilitates data update propagation. Extensive simulations are conducted to evaluate performance of both PCCI and HDUP. Evaluation results show that PCCI cost‐effectively initiates consistency control even when faced with dynamic changes in data update rate, cache query rate, node speed, and number of caching nodes. The evaluation results also show that HDUP saves cost for data update propagation by up to 66%. Copyright © 2009 John Wiley & Sons, Ltd.     

大规模无线通信网络移动边缘计算和缓存研究

面向未来6G移动通信的大规模网络移动边缘计算与缓存技术,首先,介绍了大规模无线网络下移动边缘计算和缓存的架构与原理,并阐释了移动边缘计算和缓存技术在大规模无线网络中的必要性和普适性。接着,从计算卸载、边缘缓存、多维资源分配、用户关联和隐私保护这5个关键问题出发,综述和分析了移动边缘计算和缓存赋能大规模无线网络时会引入的新型关键问题以及对应的解决方案研究,并进一步指出了未来的发展趋势和研究方向。最后,针对隐私保护问题,提出了一种基于联邦学习的隐私保护方案,并通过仿真结果表明所提方案能够同时保护用户数据隐私且改善系统服务质量。     

基于收益感知的信息中心网络缓存机制

针对信息中心网络（ICN）内置缓存系统中的海量内容块流行度获取和存储资源高效利用问题,以最大化节省内容访问总代价为目标,建立针对内容块流行度的缓存收益优化模型,提出了一种基于收益感知的缓存机制。该机制利用缓存对请求流的过滤效应,在最大化单点缓存收益的同时潜在地实现节点间协作和多样化缓存;使用基于布隆过滤器的滑动窗口策略,在检测请求到达间隔时间的同时兼顾从源服务器获取内容的代价,捕获缓存收益高的内容块。分析表明,该方法能够大幅压缩获取内容流行度的存储空间开销;仿真结果表明,该方法能够较为准确地实现基于流行度的缓存收益感知,且在内容流行度动态变化的情况下,在带宽节省和缓存命中率方面更具优势。     

A fully distributed replica allocation scheme for an opportunistic network

An opportunistic network (OPPNET) consists of diverse mobile nodes with various mobility patterns. Numerous mobility patterns and the resource constraints of mobile nodes lead to network partitioning that result in system performance degradation including low data accessibility. In a traditional mobile ad hoc network (MANET) which is similar to an OPPNET, replica allocation schemes have been proposed to increase data accessibility. Although the schemes are efficient in a MANET, they may not be directly applicable to an OPPNET because the schemes are based on a grouping of mobile nodes. It is very difficult to build groups based on network topology in an OPPNET because a node in an OPPNET does not keep its network topology information. In this paper, we propose a novel replica allocation scheme for an opportunistic network called the Snooping-based Fully Distributed replica allocation scheme. The proposed scheme allocates replicas in a fully distributed manner without grouping to reduce the communication cost, and fetches allocated replicas utilizing a novel candidate list concept to achieve high data accessibility. In the proposed scheme, a node can fetch replicas opportunistically based on the candidate list. Consequently, the proposed replica allocation scheme achieves high data accessibility while reducing the communication cost significantly. Extensive simulation results demonstrate that the proposed scheme reduces the communication cost and improves data accessibility over traditional schemes.     

Proactive content caching by exploiting transfer learning for mobile edge computing

To address the vast multimedia traffic volume and requirements of user quality of experience in the next‐generation mobile communication system (5G), it is imperative to develop efficient content caching strategy at mobile network edges, which is deemed as a key technique for 5G. Recent advances in edge/cloud computing and machine learning facilitate efficient content caching for 5G, where mobile edge computing can be exploited to reduce service latency by equipping computation and storage capacity at the edge network. In this paper, we propose a proactive caching mechanism named learning‐based cooperative caching (LECC) strategy based on mobile edge computing architecture to reduce transmission cost while improving user quality of experience for future mobile networks. In LECC, we exploit a transfer learning‐based approach for estimating content popularity and then formulate the proactive caching optimization model. As the optimization problem is NP‐hard, we resort to a greedy algorithm for solving the cache content placement problem. Performance evaluation reveals that LECC can apparently improve content cache hit rate and decrease content delivery latency and transmission cost in comparison with known existing caching strategies.     

Improving quality of service in WiMAX communication at vehicular speeds: a new call admission control solution

Call admission control (CAC) scheme serves as a useful tool for the WiMAX technology, which ensures that resources are not overcommitted and thereby, all existing connections enjoy guaranteed quality of service (QoS). CAC schemes largely rely on readily available information like currently available resources and bandwidth demand of the new call while making an acceptance or rejection decision once a new request arrives. Since wireless channels are not as reliable as wired communication, CAC scheme in WiMAX communication faces a serious challenge of making a right estimate of the usable channel capacity (i.e., effective throughput capacity) while computing the available resources in various communication scenarios. Existing CAC schemes do not consider the impact of mobility at vehicular speeds when computing the usable link capacity and available resources. The main limitation of such CAC scheme is that when a mobile node moves at a slower speed and makes a connection request to the base station (BS), the BS evaluates the situation based on the currently available information. The BS in such cases, is short‐sighted and often overestimates the available resources as it completely ignores the scenario when the SS reaches its top speed within a very short time after a CAC decision is made, causing a significant drop in usable throughput. In this paper, we address this limitation of existing WiMAX CAC schemes and propose a new CAC scheme that estimates the usable link capacity for WiMAX communication at vehicular speeds and uses this information while making a CAC decision. We also present a CAC scheme that takes the speed distribution model of a mobile node into account during the CAC decision making process. Simulation results confirm that the proposed scheme achieves lower dropping rate and improved QoS compared to existing schemes. Copyright © 2011 John Wiley & Sons, Ltd.     

Energy Efficient Four Level Cooperative Opportunistic Communication for Wireless Personal Area Networks (WPAN)

For wireless sensor networks (WSNs), energy is a scarce resource. Due to limited battery resources, the energy consumption is the critical issue for the transmission as well as reception of the signals in the wireless communication. WSNs are infrastructure-less shared network demanding more energy consumption due to collaborative transmissions. This paper proposes a new cooperative opportunistic four level model for IEEE 802.15.4 wireless personal area network. The average per node energy consumption is observed merely about 0.17 mJ for the cooperative wireless communication which proves the proposed mechanism to be energy efficient. This paper further proposes four levels of cooperative data transmission from source to destination to improve network coverage with energy efficiency.     

Hybrid layered video encoding and caching for resource constrained environments

Video playback on a mobile device is a resource-intensive task. Since the battery life of a mobile device decreases with time, it is desirable to have a video representation which adapts dynamically to the available battery life during the playback process. A novel Hybrid Layered Video (HLV) encoding scheme is proposed, which comprises of content-aware, multi-layer encoding of texture and a generative sketch-based representation of the object outlines. Different combinations of the texture- and sketch-based representations are shown to result in distinct video states, each with a characteristic power consumption profile. Further, a smart content-aware caching scheme is proposed which is suitable for low-latency dissemination of HLV over the Internet. The proposed HLV representation, combined with the proposed caching scheme, is shown to be effective for video playback and dissemination on power-constrained mobile devices.     

Replication enabled distributed cache invalidation method: replication enabled distributed cache management system for wireless mobile networks

This work proposes a replication scheme that is implemented on top of a previously proposed system for MANETs that cache submitted queries in special nodes, called query directories, and uses them to locate the data (responses) that are stored in the nodes that first request them, called caching nodes. The system, which was named distributed cache invalidation method (DCIM), includes client‐based mechanisms for keeping the cached data consistent with the data source. In this work, we extend DCIM to handle cache replicas inside the MANET. For this purpose, we utilize a push‐based approach within the MANET to propagate the server updates to replicas inside the network. The result is a hybrid approach that utilizes the benefits of pull approaches for client server communication and those of push approaches inside the network between the replicas. The approach is analyzed analytically, and the appropriate number of replicas is obtained, where it was concluded that full replication of the indices of data items at the query directory and two‐partial replication of the data items themselves makes most sense. Simulation results based on ns2 demonstrate the ability of the added replication scheme to lower delays and improve hit ration at the cost of mild increases in overhead traffic. Copyright © 2013 John Wiley & Sons, Ltd.     

Efficient WISH in an indoor environment

With the diffusion of wireless connections to Internet, the number of complex operations carried out from mobile users is increasing. To cope with bandwidth limitations and with disconnections, data caching is the most used technique. However for complex operation like dynamic searching a better solution is to take advantage of the multichannel property offered by CDMA protocol. In this case, cached documents can be allocated on distinguished channels in a dynamic way to obtain a better utilization of the radio communication links. We study a particular caching strategy suitable to be integrated with a radio-channel policy. We consider a semantic caching for intranet queries (or intranet searching) that takes advantage of data semantics by caching query answers instead of pages in order to exploit similarities between different queries. In fact, in a WLAN scenario, Internet activity is frequently composed by intranet searching operations characterized by local queries that aim to explore documents stored in a neighbor of the home site. We study benefits from a channel allocation strategy applied to intranet searching with semantic caching. Simulation experiments are carried out by considering an indoor scenario model where mobile clients perform keyword-based queries answered by local Web servers running application we refer to as WISH (Wireless Intranet SearcHing), an intranet searching tool based on semantic caching. The results show a 12% improvement in radio channel usage for 20% of users that share cached documents.     

CPW-fed triple high rejection notched UWB and X-band antenna on silicon for imaging and wireless applications

In this article, compact coplanar waveguide feed antenna covering ultra-wideband and X-band signals (2.98–13.34 GHz) is presented. Antenna also offers triple-notched band elimination (Wireless Interoperability for Microwave Access: 3.40–3.95 GHz, Wireless Local Area Network: 4.50–6.34 GHz and Downlink Satellite System: 7.11–7.802 GHz) which is due to insertion of stub and etching of slots. Antenna is fabricated and characterised on silicon for imaging and wireless applications having a fractional bandwidth of 133%. The antenna offers gain, radiation efficiency and group delay between 3.26 and 8.00 dBi, 84% and 92% and ≤±1.0 ns, respectively, for the entire bandwidth. Isolation of antenna in face-to-face and side-to-side orientations is <?25 dB with very less distortion presented in the transmission and reception of the signal. The radiations emitted by the antenna are observed as a dipole-like pattern in E-plane and omnidirectional in H-plane.