Joint optimal resource allocation and probabilistic caching design is conceived for device-to-device (D2D) communications in a heterogeneous wireless network (HetNet) relying on full-duplex (FD) relays. In particular,...
详细信息
Joint optimal resource allocation and probabilistic caching design is conceived for device-to-device (D2D) communications in a heterogeneous wireless network (HetNet) relying on full-duplex (FD) relays. In particular, popular contents can be cached at user devices and at relays that are located close to users. A user may request the contents of interest from another user via D2D communications and also from a nearby relay equipped with FD radios. If the requested contents are not found in the buffers of other users/relays within the coverage range, users may opt for connecting to the macro base station (MBS) via a relay by using an FD communication. Furthermore, we propose a beneficial mobility-aware coded caching philosophy for D2D communications in the HetNet considered. Especially, we model the mobility pattern of users as discrete random jumps and exploit coded caching for improving the throughput attained. Subsequently, we develop mathematical models for analyzing the throughput in the presence of edge caching, where both the system-level co-channel interference and the FD self-interference are considered. We circumvent the high complexity of stochastic optimization by developing low-complexity optimization. Finally, numerical results are presented to illustrate the theoretical findings developed in this paper and quantify the throughput gains attained.
Blockchain technologies emerging for healthcare support secure health data sharing with greater interoperability among different heterogeneous systems. However, the collection and storage of data generated from Body A...
详细信息
ISBN:
(纸本)9781728136790
Blockchain technologies emerging for healthcare support secure health data sharing with greater interoperability among different heterogeneous systems. However, the collection and storage of data generated from Body Area Sensor Networks(BASN) for migration to high processing power computing services requires an efficient BASN architecture. We present a decentralized BASN architecture that involves devices at three levels;1) Body Area Sensor Network- medical sensors typically on or in patient's body transmitting data to a Smartphone, 2) Fog/Edge, and 3) Cloud. We propose that a Patient Agent(PA) replicated on the Smartphone, Fog and Cloud servers processes medical data and execute a task offloading algorithm by leveraging a Blockchain. Performance analysis is conducted to demonstrate the feasibility of the proposed Blockchain leveraged, distributed Patient Agent controlled BASN.
In previous research, it has been demonstrated that there is enough variation within the truck population in terms of axle spacings and vehicle lengths, which enable anonymous vehicle re-identification between two mea...
详细信息
In previous research, it has been demonstrated that there is enough variation within the truck population in terms of axle spacings and vehicle lengths, which enable anonymous vehicle re-identification between two measurement stations (e.g., two weigh-in-motion (WIM) sites). Matching trucks between two sites can support various applications, such as calibration of WIM equipment and estimation of travel times and origin-destination flows. In this paper, several modeling approaches to solve the re-identification problem are explored including Naive Bayes (NB), Bayesian Models (BM) fitted by mixture models, and the formulation of the re-identification problem as a mathematical assignment problem. In addition, the influence of selecting a similarity measure is evaluated through numerical experiments conducted on real-world data from six pairs of upstream-downstream WIM stations. The results demonstrate that solving the re-identification problem with BMs fit by mixture distributions outperforms solving with NB models, while both are outperformed by the mathematical assignment formulation of the same problem, especially when vehicle-pairs exceeding a high threshold of similarity are matched. In addition, expressing the similarity between measurements from two stations as a percentage difference is found to be relatively more advantageous. For the presented pairs of WIM stations, up to 90% matching accuracy can be achieved when the best combination of re-identification method and similarity measure are implemented, and only those vehicle-pairs exceeding a high threshold of similarity are matched.
In this article, it is investigated the impact of different parameters and which parameters to use by the power series routing methodology adapted for reducing the call request blocking probability in transparent elas...
详细信息
In this article, it is investigated the impact of different parameters and which parameters to use by the power series routing methodology adapted for reducing the call request blocking probability in transparent elastic optical networks. Some of the used parameters are specifically related to elastic optical networks, such as: slot contiguity, transmission bit rate and modulation format. The amplified spontaneous emission noise generated by optical amplifiers (booster, in-line and pre-amplifier) as well as the losses and gains observed by optical signals along the lightpaths are considered in our simulations. We verified that, depending on the considered parameters and their quantity, there is a perceivable impact on the network performance in terms of blocking probability of call requests. The results revealed the most important parameters and their combinations that shall be considered by the cost function of the power series routing algorithm in our simulated scenarios of elastic optical networks.
This paper considers multirobot task allocation problems where the estimated costs for performing tasks are interrelated, and the overall team objective need not be a standard sum-of-costs (or utilities) model, enabli...
详细信息
This paper considers multirobot task allocation problems where the estimated costs for performing tasks are interrelated, and the overall team objective need not be a standard sum-of-costs (or utilities) model, enabling straightforward treatment of the additional costs incurred by resource contention. In the model we introduce, a team may choose one of a set of shared resources to perform a task (e.g., several routes to reach a destination), and interference is modeled when multiple robots use the same resource. We show that the general problem is NP-hard, and investigate specialized subinstances with particular cost structures. For the general problem, we describe an exact algorithm which finds an optimal assignment in a reasonable time on small instances. Aiming at larger problems, we turn two particular subinstances, introducing an two algorithms that find assignments quickly even for problems of considerable size, the first being optimal, the second being an approximation algorithm but also producing high-quality solutions with bounded suboptimality. Note to Practitioners-An idealization is made in the vast majority of the task allocation literature: the presumption of task independence. Tasks are never performed in perfect isolation in practice and this paper shows that computing task costs independently, although a prevalent modeling simplification, may be detrimental. Whenever robots use shared resources (e.g., narrow passages, limited communication bandwidth), resource contention and physical interference may cause performance to degrade. These aspects can be thought of as interrelationships between tasks costs and this article introduces an augmented model that expresses such interrelationships by capturing resource-based interactions among robots which change task execution costs. This paper describes optimization methods which allowing different models of contention (e.g., linear or convex) giving the practitioner flexibility for their specific applicatio
An n - L(k, k-1, ..., 1) labeling of a simple graph G is a mapping f: V(G) → {0, 1, ..., n} such that |f(u) - f(v)| ≥ k+1 - d(u,v), for all u,v∈V(G), where d(u,v) is the length of the shortest path connecting u and...
详细信息
To discovery right service from service library quickly and precisely is a meaningful research topic. However,the performance of current semantic service discovery methods remains to be improved. This paper proposes a...
详细信息
ISBN:
(纸本)9781424463473
To discovery right service from service library quickly and precisely is a meaningful research topic. However,the performance of current semantic service discovery methods remains to be improved. This paper proposes an improved semantic web service discovery method based on assignment algorithm,which can convert service discovery problem into assignment problem. A serial experiments illustrate the proposed method can improve precision and recall rate of service discovery.
To reduce the static power of the circuit, a dual-threshold voltage assignment algorithm has been proposed in this paper. This algorithm uses static timing analysis to get the timing information of all nodes by double...
详细信息
ISBN:
(纸本)9780769550169
To reduce the static power of the circuit, a dual-threshold voltage assignment algorithm has been proposed in this paper. This algorithm uses static timing analysis to get the timing information of all nodes by double traverse and assigns the threshold voltage of each node through initial optimization and accurate optimization. Under given timing constraint, the goal of our algorithm is to replace a maximum number of high-Vt gates from low-Vt in the circuit and maximize the reduction of the static power. Our dual-threshold voltage assignment algorithm and traditional method are compared based on the embedded CPU CK610 of TSMC 55nm process. The results show that our algorithm can reduce the static power of the chip by 60.07%.
Multiple dynamic supply voltage (MDSV) designs can be used to reduce power consumption. However, switching of power modes may cause increasing of the clock skew because some modules operate with different voltages. In...
详细信息
ISBN:
(纸本)9781467330374;9781467330367
Multiple dynamic supply voltage (MDSV) designs can be used to reduce power consumption. However, switching of power modes may cause increasing of the clock skew because some modules operate with different voltages. In this paper, the adjustable delay buffers (ADBs) is used to minimize clock skew under different power modes. We first construct a clock tree to assign positions of adjustable delay buffers. Because adjustable delay buffers can increase additional delays, the clock skew can be optimized. It is unlikely to add an unlimited number of ADBs in real world so the number of ADBs must be limited. If the number of ADBs is not satisfied with the constraints in the previous solution, a bottom-up method is then used to remove some adjustable delay buffers. Finally, the experimental results show that the presented algorithms generate effective improvements.
暂无评论