We propose a unifying framework based on configuration linear programs and randomized rounding, for different energy optimization problems in the dynamic speed-scaling setting. We apply our framework to various scheduling and routing problems in heterogeneous computing and networking environments. We first consider the energy minimization problem of scheduling a set of jobs on a set of parallel speed-scalable processors in a fully heterogeneous setting. For both the preemptive-non-migratory and the preemptive-migratory variants, our approach allows us to obtain solutions of almost the same quality as for the homogeneous environment. By exploiting the result for the preemptive-non-migratory variant, we are able to improve the best known approximation ratio for the single processor non-preemptive problem. Furthermore, we show that our approach allows to obtain a constant-factor approximation algorithm for the power-aware preemptive job shop scheduling problem. Finally, we consider the min-power routing problem where we are given a network modeled by an undirected graph and a set of uniform demands that have to be routed on integral routes from their sources to their destinations so that the energy consumption is minimized. We improve the best known approximation ratio for this problem.

https://hal.archives-ouvertes.fr/hal-00946354/document

Energy Efficient Scheduling and Routing via Randomized Rounding

BTDS: Bayesian‐based trust decision scheme for intelligent connected vehicles in VANETs

We take management of public service vehicles in Chinese institutions of higher education as the research object. The present situation and shortcomings of the existing public service vehicle management system are thoroughly analyzed. An intelligent management system is designed and implemented for the institutions of higher education. A user can choose the driver and vehicle according to his/her needs and preferences. At the same time, it can query the position of the public vehicle in real time, master the vehicle dynamics, and the user can apply for a vehicle more accurate and faster. It provides more convenient and reasonable use of vehicle management, report management and leave management, which greatly improves the efficiency of the administrators, reduces the cost of management, and improves the usage rate of vehicles. In addition, in the management of vehicles, the method of near shunting is adopted to reduce the cost of vehicle use.

The Intelligent Management System of Motorcade in Colleges and Universities

Due to the ubiquitous use of wireless communication and enormous success of peer-to-peer (P2P) mode in wired networks, mobile P2P network (MP2P) attracts increasing attentions However, the selfishness of nodes caused by the P2P mode, the scarcity of resources, and the Quality of Service (QoS) requirements of various network applications make it difficult to design an appropriate routing scheme Thus, in this paper, we propose a trust energy-efficient QoS routing scheme in MP2P We evaluate a routing path from three different aspects, namely, trust, energy consumption and QoS respectively We apply interval forms to denote the network states and application requirements respectively for their difficulty to obtain and describe accurately, and calculate their matching by probability model and satisfaction degree as the evaluation value of a link Then a heuristic routing protocol is proposed to find satisfied routing paths Results from simulation experiments demonstrate that our proposed scheme has a better performance

A Trust Energy-Efficient QoS Routing Scheme for Mobile Peer-to-Peer Networks

For the situation where plenty of trust models are built to improve node cooperation in mobile peer-to-peer environments, node cooperation is analyzed in this paper. An Android APP is first developed to investigate users' satisfaction on cooperation degree based on their internal states, and then according to the investigation results, nodes' utility on cooperation degree based on internal states is designed. A node cooperation optimization model (COM) is built to maximize the utilities of all involved nodes and an intelligence algorithm is applied to solve this optimization problem. Because the results show that the cooperation degrees before and after optimization are very similar, each node can decide its cooperation degree only based on own information. Finally, the model is verified and applied to design a new routing protocol. The experiment results demonstrate that the proposed routing protocol can achieve higher routing success ratio and average node utility than other popular routing protocols.

Node Cooperation Analysis in Mobile Peer-to-peer Networks

In Named Data Networks, cache pollution, cache poisoning and interest flooding are three popular types of attacks that can drastically degrade the network performance. However, previous methods for mitigating these attacks are not sufficiently effective or efficient. Also, they cannot simultaneously handle the three attacks. To handle these problems, we propose an effective and lightweight countermeasure scheme. It consists of token-based router monitoring policy (TRM), hierarchical consensus-based trust management (HCT), and popularity-based probabilistic caching policy (PPC). In TRM, each edge router monitors and evaluates each data requester’s probability of launching the cache pollution attack and each data provider’s probability of launching the cache poisoning attack, and accordingly assigns, rewards and penalizes tokens to them to control their data request and data provision activities. In HCT, each core router manages its directly connected edge routers using TRM, and the core routers trust each other through adopting the concept of consensus in Blockchain. PPC uses probabilistic caching based on the popularity of received content to further mitigate the attacks and reduce caching and data verification overhead. Results from simulation experiments demonstrate that our proposed scheme has better performance, in terms of interest satisfaction ratio and average end-to-end delay than current mechanisms.

Dapeng Qu

Papers

A Trust Energy-Efficient QoS Routing Scheme for Mobile Peer-to-Peer Networks

Node Cooperation Analysis in Mobile Peer-to-peer Networks

An Effective and Lightweight Countermeasure Scheme to Multiple Network Attacks in NDNs