检索结果-内蒙古大学图书馆

15th IEEE Annual Consumer Communications and Networking Conference (CCNC)

作者： Bounceur, Ahcene Clavier, Laurent Combeau, Pierre Marc, Olivier Vauzelle, Rodolphe Masserann, Arnaud Soler, Julien Euler, Reinhardt Alwajeeh, Taha Devendra, Vyas Noreen, Umber Soret, Emilie Lounis, Massinissa Univ Bretagne Occidentale Lab STICC CNRS UMR 6285 Brest France IRCICA USR 3380 IEMN Lille France Univ Poitiers Xlim CNRS UMR 7252 Poitiers France Virtualys Brest France

ISBN: (纸本)9781538647905

The number of connected devices is growing and in the near future it is expected to become extremely large in cities. As a consequence, using simulators to study and prepare a project of installing new networks before their real deployment is of great importance. They can help to predict some important information like signal overload or the feasibility of the deployment in terms of location, interferences, communication and cost. In this paper we present a new architecture for the platform CupCarbon, developed within the research project PERSEPTEUR. The main objective of this platform is to design and simulate Wireless Sensor Networks dedicated to Smart-city and IoT applications. It allows to validate distributed algorithms in a 2D/3D environment, taking account of the city buildings in which to deploy the network, the mobiles, and using accurate models of radio propagation and interferences in that environment.

关键词： Wireless Sensor Networks IoT Simulation Design Propagation Interferences distributed algorithms

来源：评论

学校读者我要写书评

暂无评论

Energy saving and Collision-free Motion Planning for Oblivious Robots 32

Energy saving and Collision-free Motion Planning for Oblivio...

引用

32nd IEEE International Conference on Advanced Information Networking and Applications (IEEE AINA)

作者： Navarra, Alfredo Cacciagrano, Diletta Univ Perugia Dept Math & Comp Sci Via Vanvitelli 1 I-06123 Perugia Italy Univ Camerino Sch Sci & Technol Camerino Italy

ISBN: (纸本)9781538653951

In distributed computing, many tasks have been studied involving mobile entities - also called robots - with weak capabilities. A well-known scenario is that in which robots operate in Look-Compute-Move (LCM) cycles. During each cycle, a robot acquires a snapshot of the surrounding environment (Look phase), then executes an appropriate algorithm by using the obtained snapshot as input (Compute phase), and finally moves toward a desired destination, if any (Move phase). In this context, we consider robots that have to visit a partially ordered set of locations. A solution to the problem is the assignment to each robot of a trajectory to follow in order to visit the required locations. The resolution of the task is subject to two main constraints. Robots have to minimize the energy spent to accomplish an assigned trajectory, and they have to avoid collisions among each other. The minimization of the energy is expressed in terms of the number of turns a robot has to perform in between two different locations. This equals the number of bends the assigned trajectory contains in between such locations. In general, the problem is known to require Omega(n) bends per connection, with n being the number of locations, even if considering just two robots involved. We study the case where the locations that a single robot has to visit are represented as colored points in the Euclidean plane, and only two colors are provided. This means the partial order among the locations is just based on two colors per robot. In this case, we provide a constructive solution for two robots with five bends per connection.

关键词： distributed algorithms Mobile Robots Trajectory Complexity Energy Minimization

来源：评论

学校读者我要写书评

暂无评论

Achieving Stable and Optimal Passenger-Driver Matching in Ride-Sharing System 15

Achieving Stable and Optimal Passenger-Driver Matching in Ri...

引用

15th IEEE International Conference on Mobile Ad Hoc and Sensor Systems (MASS)

作者： Zhong, Yixuan Gao, Lin Wang, Tong Gong, Shimin Zou, Baitao Yu, Deliang Harbin Inst Technol Dept Elect & Informat Engn Shenzhen Peoples R China

ISBN: (纸本)9781538655801

Ride-sharing systems enable individual car owners with idle time to provide commercial taxi-like services via an online platform. By crowdsourcing a large population of individual car owners, it can provide more flexible services with a lower serving cost, comparing with the traditional taxi system. Due to the autonomous nature of car owners (drivers), a decentralized driver dispatching algorithm that can achieve a stable (self-motivated) and optimal passenger-driver matching is highly desired for a ride-sharing system. In this paper, we will study such a driver dispatching algorithm systematically. We first show that the optimal passenger-driver matching achieved by the centralized driver dispatching algorithm is often not stable, in the sense that some drivers and passengers may break with their matched partners and form new matching pairs. To this end, we introduce a virtual order fee on each passenger (which the platform will charge the drives who want to serve the passenger) to motivate the behaviors of drivers. Specifically, we propose a novel auction-based decentralized driver dispatching algorithm, where each driver proposes the most profitable passenger that he wants to serve, considering the potential profit that he can achieve and the order fee that he needs to pay from/ to serving each passenger. The virtual order fee on a passenger will be gradually increased when multiple drivers want to serve the passenger, until there exists only one driver who is willing to serve. We analytically show that such a decentralized driver dispatching algorithm will converge to an equilibrium (stable) outcome, which achieves the optimal passenger-driver matching (i.e., that maximizes the social income of the whole system). Simulation results further show how the converging speed and the achieved social income change with the system parameters such as the step size of order fee increasement. Moreover, it is easy to implement the proposed distributed algorithm in a practica

关键词： Public transportation distributed algorithms Dispatching Real-time systems Servers Automobiles

来源：评论

学校读者我要写书评

暂无评论

Broadcasting Real-Time Flows in Integrated Backhaul and Access 5G Networks

Broadcasting Real-Time Flows in Integrated Backhaul and Acce...

引用

International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)

作者： Aria HasanzadeZonuzy I-Hong Hou Srinivas Shakkottai Texas A&M University

ISBN: (数字)9783903176201

ISBN: (纸本)9781728130859

We study the problem of broadcasting realtime flows in multi-hop wireless networks. We assume that each packet has a stringent deadline, and each node in the network obtains some utility based on the number of packets delivered to it on time for each flow. We propose a distributed protocol called the delegated-set routing (DSR) that incurs virtually no overhead of coordination among nodes. We also develop distributed algorithms that aim to maximize the total timely utility under DSR. The utility of the DSR protocol and distributed algorithms are demonstrated by both theoretical analysis and simulation results. We show that our algorithms achieve higher timely throughput even when compared against centralized throughput optimal policies that do not consider deadline constraints.

关键词： Routing Broadcasting Spread spectrum communication Real-time systems Throughput Protocols distributed algorithms

来源：评论

学校读者我要写书评

暂无评论

Energy-Efficient Massive Content Delivery via Devices-to-Devices Communication

Energy-Efficient Massive Content Delivery via Devices-to-Dev...

引用

IEEE Global Telecommunications Conference (GC Wkshps)

作者： Yuan, Zhe Zhang, Xuguang Chen, Jianxin Zhou, Liang Nanjing Univ Posts & Telecommun NERCCN Nanjing Jiangsu Peoples R China

ISBN: (纸本)9781538649206

Conventionally, the D2D content sharing mode is "one-to-one" matching, i.e, one demander will select one provider to request files from it. Under this mode, it is hard to cope with the growing demand for multimedia services for mobile users due to limited battery capacity for mobile devices. In this work, we propose an energy-efficient content sharing system via a novel Devices-to-Devices Communication (Ds2Ds), which shares content among multiple users to reduce the power consumption per user device. The highlights of this work lie in three parts. Firstly, we model the match of providers to demanders as a maximum weighted matching problem, and find a distributed algorithm to solve it. Secondly, we design an optimal packet split algorithm for Ds2Ds under comprehensive consideration of two aspects of communication efficiency and energy consumption to solve the problem how many data packets each provider transfers. Thirdly, we model the file reconstruction problem of collaboration demanders as a NP-hard problem and develop a best-effort distributed greedy algorithm framework to find the shortest file reconstruction path. Finally, numerical results demonstrate that the proposed mechanism can greatly reduce the energy consumption of each device.

关键词： Device-to-device communication Frequency modulation Energy consumption Collaboration Artificial neural networks distributed algorithms NP-hard problem

来源：评论

学校读者我要写书评

暂无评论

Contact Ratio Aware Mobile Edge Computing for Content Offloading

Contact Ratio Aware Mobile Edge Computing for Content Offloa...

引用

International Conference on Parallel and distributed Systems (ICPADS)

作者： Peiyan Yuan Yunyun Cai School of Computer and Information Engineering Henan Normal University Big Data Engineering Laboratory for Teaching Resources & Assessment of Education Quality

ISBN: (纸本)9781728125848

Content offloading in mobile edge computing is one of the effective ways to alleviate network congestion. This paper studies the content offloading problem in buffer-constraint edge scenarios. First, the content offloading problem is transformed into the maximum delivery rate and minimum transmission delay problem integrating the heterogeneous contact rate between users and small base stations. Second, a Lagrangian multiplier method is employed to compute the optimal numbers of offloading copy for each file, and then a greedy algorithm which can achieve the optimality with a probability 1 - 1/e is proposed, followed by a distributed algorithm with the same performance as the greedy one. Finally, the proposed schemes are compared with the classical algorithms, and the simulation results show that they enhance the content delivery rate and reduce the transmission delay in different popularity distributions and buffer sizes.

关键词： Mobile edge computing Transmission delay Content offloading Submodule Greedy algorithm Transport delay greedy algorithm UNLOADING submodule Network Congestion distributed algorithms contact ratio Simulation results BASE STATION

来源：评论

学校读者我要写书评

暂无评论

A Real-time Alternating Direction Method of Multipliers Algorithm for Non-convex Optimal Power Flow Problem

A Real-time Alternating Direction Method of Multipliers Algo...

引用

Conference Record of the IEEE Industry Applications Society Annual Meeting (IAS)

作者： Hao Yin Zhaohao Ding Dongying Zhang Shiwei Xia Du Ting School of Electrical & Electronic Engineering North China Electric Power University Changping District Beijing China

The high penetration rate of smart devices like storages bring new challenge and complexity to the optimal power flow (OPF) problem. This problem is generally nonconvex and difficult to calculate in the real-time scenarios. This paper will introduce a fully distributed approach by combining the alternating direction method of multipliers and proximal alternating minimization method. This approach contains two parts, one is a basic distributed algorithm for the offline scheduling with constant network data. The another extended one is by using the short-term load forecast as its initial input, then when the real-time data is given, the solution of OPF problem can get converged faster than the basic algorithm. Both algorithms aim to provide a high feasible solution for the realtime grid operation. These algorithms are simulated on test network with batteries to analyze their performance and the effect of the changes in the parameters in these algorithms.

关键词： Real-time systems Load flow distributed algorithms Batteries Heuristic algorithms Smart devices

来源：评论

学校读者我要写书评

暂无评论

Performance Evaluation of an IoV-Based Intersection Traffic Control Approach 11

Performance Evaluation of an IoV-Based Intersection Traffic ...

引用

IEEE International Congress on Cybermatics / IEEE Conferences on Internet of Things, Green Computing and Communications, Cyber, Physical and Social Computing, Smart Data, Blockchain, Computer and Information Technology

作者： Saeed, Iman Elhadef, Mourad Abu Dhabi Univ Coll Engn Abu Dhabi U Arab Emirates

ISBN: (纸本)9781538679753

With the recent advances in Internet of vehicles (IoV), the traditional traffic control problem at intersections is being revisited to cope with the future intelligent transportation systems. In this paper, we introduce the performance evaluation of a distributed IoV-based intersection traffic control protocol. Extensive simulations have been conducted using various real traffic scenarios to evaluate the efficiency and the dynamics of the newly proposed traffic control approach that gives the intelligent vehicles full autonomous control of crossing intersections using vehicle-to vehicle and vehicle-to-infrastructure communications. Simulation results using the tools OMNet++, VEINS, and SUMO showed that the new approach is a viable alternative and addition to the existing traffic control approaches.

关键词： component distributed algorithms inVANETs intersection traffic control intelligent transportation systems distributed mutual exclusion

来源：评论

学校读者我要写书评

暂无评论

distributed ROBUST SUBSPACE RECOVERY

引用

SIAM JOURNAL ON SCIENTIFIC COMPUTING 2018年第5期40卷 A3067-A3090页

作者： Huroyan, Vahan Lerman, Gilad Univ Minnesota Sch Math Minneapolis MN 55455 USA

We propose distributed solutions to the problem of Robust Subspace Recovery (RSR). Our setting assumes a huge dataset in an ad hoc network without a central processor, where each node has access only to one chunk of the dataset. Furthermore, part of the whole dataset lies around a low-dimensional subspace and the other part is composed of outliers that lie away from that subspace. The goal is to recover the underlying subspace for the whole dataset, without transferring the data itself between the nodes. We first apply the Consensus Based Gradient method to the Geometric Median Subspace algorithm for RSR. For this purpose, we propose an iterative solution for the local dual minimization problem and establish its r-linear convergence. We then explain how to distributedly implement the Reaper and Fast Median Subspace algorithms for RSR. The proposed algorithms display competitive performance on both synthetic and real data.

关键词： distributed algorithms consensus-based algorithms principal component analysis (PCA) robust subspace recovery (RSR) geometric median

来源：评论

学校读者我要写书评

暂无评论

Computation time analysis of centralized and distributed optimization algorithms applied to automated irrigation networks

Computation time analysis of centralized and distributed opt...

引用

Australian Control Conference (AUCC)

作者： Alireza Farhadi Peter M. Dower Michael Cantoni Department of Electrical Engineering Sharif University of Technology Tehran Iran Department of Electrical and Electronic Engineering University of Melbourne Victoria Australia

This paper compares the computation time of two algorithms for solving a structured constrained linear optimal control problem with finite horizon quadratic cost within the context of automated irrigation networks. The first is a standard centralized algorithm based on the active set method that does not exploit problem structure. The second is distributed and is based on a consensus algorithm, not specifically tailored to account for system structure. It is shown that there is a significant advantage in terms of computation overhead (the time spent computing the optimal solution) in using the second algorithm in large-scale networks. Specifically, for a fixed horizon length the computation overhead of the centralized algorithm grows as O(n 5 ) with the number n of sub-systems. By contrast, it is observed via a combination of analysis and experiment that given n times resources for computation the computation overhead of the distributed algorithm grows as O(n) with the number n of sub-systems.

关键词： Optimization distributed algorithms Approximation algorithms Irrigation Algorithm design and analysis Polynomials Approximation methods

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：