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

A distributed and Energy-Efficient algorithm for Event K-Coverage in Underwater Sensor Networks

SENSORS 2017年第1期17卷 186-186页

作者： Jiang, Peng Xu, Yiming Liu, Jun Hangzhou Dianzi Univ Coll Automat Hangzhou 310018 Zhejiang Peoples R China

For event dynamic K-coverage algorithms, each management node selects its assistant node by using a greedy algorithm without considering the residual energy and situations in which a node is selected by several events. This approach affects network energy consumption and balance. Therefore, this study proposes a distributed and energy-efficient event K-coverage algorithm (DEEKA). After the network achieves 1-coverage, the nodes that detect the same event compete for the event management node with the number of candidate nodes and the average residual energy, as well as the distance to the event. Second, each management node estimates the probability of its neighbor nodes' being selected by the event it manages with the distance level, the residual energy level, and the number of dynamic coverage event of these nodes. Third, each management node establishes an optimization model that uses expectation energy consumption and the residual energy variance of its neighbor nodes and detects the performance of the events it manages as targets. Finally, each management node uses a constrained non-dominated sorting genetic algorithm (NSGA-II) to obtain the Pareto set of the model and the best strategy via technique for order preference by similarity to an ideal solution (TOPSIS). The algorithm first considers the effect of harsh underwater environments on information collection and transmission. It also considers the residual energy of a node and a situation in which the node is selected by several other events. Simulation results show that, unlike the on-demand variable sensing K-coverage algorithm, DEEKA balances and reduces network energy consumption, thereby prolonging the network's best service quality and lifetime.

关键词： event K-coverage distributed algorithm energy-efficient sensing radius adjusting

来源：评论

学校读者我要写书评

暂无评论

Sparse Spectrum Reuse in HetNets with Relays

Sparse Spectrum Reuse in HetNets with Relays

引用

IEEE Global Conference on Communications (GLOBECOM) / Workshop on Wireless Networking and Control for UAV

作者： Jin, Shengda Zhu, Zhaowei Shen, Cong Ali, Sadiq Qian, Hua Luo, Xiliang ShanghaiTech Univ Shanghai Peoples R China Univ Sci & Technol China Hefei Anhui Peoples R China Univ Engn & Technol Peshawar Pakistan Chinese Acad Sci Shanghai Adv Res Inst Shanghai Peoples R China

ISBN: (纸本)9781538647271

In-band relay nodes (RNs) can be utilized to enhance the coverage of heterogeneous networks (HetNets) in a costeffective way. However, the in-band RNs also consume the limited spectrum resources. Appropriate spectrum resource management/cooperation is necessary to ensure the balanced resource usages between the macro base stations (BSs) and the RNs. In this paper, we study the sparse spectrum reuse strategy in a HetNet with in-band RNs to maximize the overall proportional fairness metric. Although limiting the number of active reuse patterns will degrade the performance and render the resulting problem non-convex, we first show that there must exist one solution achieving the optimum when the upper bound on the number of active reuse patterns is not less than the total number of mobile stations (MSs) and RNs. We also put forth one active pattern identification scheme based on the re-weighted f 1 -norm algorithm to deal with the non-convex problem and refine the set of active reuse patterns in a soft manner. Furthermore, in order to offload the heavy computation burden from the central server, one distributed resource allocation algorithm based on the alternating direction method of multipliers (ADMM) algorithm is developed. Numerical simulations demonstrate the superiority and effectiveness of our proposed algorithm.

关键词： Sparse optimization heterogeneous network relay node spectrum reuse distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

Offloading Channel Allocation to Terminals in High-Density IoTs for Next Generation Networks 12

Offloading Channel Allocation to Terminals in High-Density I...

引用

12th IEEE International Conference on Communications (COMM)

作者： Zhao, Haitao Dong, Qiangjian Chen, Luo Liu, Yongxiang Hua, Honghu Natl Univ Def Technol Coll Elect Sci Changsha Hunan Peoples R China

ISBN: (纸本)9781538623503

Machine-to-Machine (M2M) communications in high-density Internet of Things (IoTs) pose significant challenges in accessing the wireless channel for concurrent transmissions. In this scenario, the channel allocation plays a crucial role, which usually involves a centralized coordination (such as a base station). With the increasing number of edge terminals as well as the dynamic network environment, the computation and information exchange for the centralized channel allocation would be a big burden for the coordination. In this paper, we tackle this challenging problem by proposing a distributed channel allocation method with blind rendezvous to enable collision-free concurrent transmission over multiple channels. Specifically, we first present a receiver-oriented channel allocation algorithm to reduce interference and then focus on a receiver-wait sender-jump blind channel rendezvous algorithm based on channel hopping techniques. The proposed channel allocation method allows each sender-receiver pair to obtain an appropriate channel for transmission without interfering other pairs, in a distributed manner. This study may help network researchers to contribute in the development of next generation high-density IoTs.

关键词： Multi-channel network Machine-to-Machine (M2M) communication channel allocation distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

A P2P algorithm for a Smart Information System 6th

A P2P Algorithm for a Smart Information System

引用

World Conference on Information Systems and Technologies (WorldCIST)

作者： Forestiero, Agostino Papuzzo, Giuseppe Inst High Performance Comp & Networking CNR ICAR Via P Bucci 7-11 C Arcavacata Di Rende CS Italy

ISBN: (纸本)9783319777023;9783319777030

Last generation applications, often, generate a huge amount of data also characterized by high variety and velocity, like those Internet of Things (IoT) paradigm based. Big data analytics increasingly drive decision making in several fields and, then, new approaches and methodologies are needed to improve management operations. Mobile, social and ubiquitous services, comprising data sources and middleware, can be considered a dynamic content, and an effective solution to manage contents are the Content Delivery Networks (CDNs). However, CDNs show limits in dynamic and large systems in which a large amount of data is managed. To deal with these weaknesses and exploit their benefits, new algorithms and approaches have to be designed and employed. This paper introduces RadixOne, a distributed and self-organizing algorithm, to build an information system in pervasive and dynamic environments. Thanks to autonomous and local operations performed by hosts of a distributed system, a logically organized overlay network emerges and the resource discovery operations faster and efficient. Preliminary experimental results show the effectiveness of our approach.

关键词： distributed algorithm Self-organization Overlay network Content delivery networks

来源：评论

学校读者我要写书评

暂无评论

Game-Theoretic Approach to Self-stabilizing Minimal Independent Dominating Sets 1

引用

11th International Conference on Internet and distributed Computing Systems (IDCS)

作者： Yen, Li-Hsing Sun, Guang-Hong Natl Chiao Tung Univ Dept Comp Sci Hsinchu Taiwan

ISBN: (数字)9783030027384

ISBN: (纸本)9783030027384;9783030027377

An independent dominating set (IDS) is a set of vertices in a graph that ensures both independence and domination. The former property asserts that no vertices in the set are adjacent to each other while the latter demands that every vertex not in the set is adjacent to at least one vertex in the IDS. We extended two prior game designs, one for independent set and the other for dominating set, to three IDS game designs where players independently determine whether they should be in or out of the set based on their own interests. Regardless of the game play sequence, the result is a minimal IDS (i.e., no proper subset of the result is also an IDS). We turned the designs into three self-stabilizing distributed algorithms that always end up with an IDS regardless of the initial configurations. Simulation results show that all the game designs produce relatively small IDSs with reasonable convergence rate in representative network topologies.

关键词： Independent dominating set Self-stabilization distributed algorithm Game theory

来源：评论

学校读者我要写书评

暂无评论

distributed Power Profile Tracking for Heterogeneous Charging of Electric Vehicles

引用

IEEE TRANSACTIONS ON SMART GRID 2017年第5期8卷 2090-2099页

作者： Malhotra, Akshay Binetti, Giulio Davoudi, Ali Schizas, Ioannis D. Univ Texas Arlington Dept Elect Engn Arlington TX 76010 USA Polytech Univ Bari Dept Elect & Informat Engn I-70125 Bari Italy

Coordinated charging of plug-in electric vehicles (PEVs) can effectively mitigate the negative effects imposed on the power distribution grid by uncoordinated charging. Simultaneously, coordinated charging algorithms can accommodate the PEV user's needs in terms of desired state-of-charge and charging time. In this paper, the problem of tracking an arbitrary power profile by coordinated charging of PEVs is formulated as a discrete scheduling process, while accounting for the heterogeneity in charging rates and restricting the charging to only the maximum rated power. Then, a novel distributed algorithm is proposed to coordinate the PEV charging and eliminate the need for a central aggregator. It is guaranteed to track, and not exceed, the power profile imposed by the utility, while maximizing the user convenience. A formal optimality analysis is provided to show that the algorithm is asymptotically optimal in case of Homogeneous charging, while it has a very small optimality gap for the heterogeneous case. Numerical simulations considering realistic charging scenarios with different penetration levels and tracking of a valley-filing profile are presented to validate the proposed charging algorithm.

关键词： Coordinated charging distributed algorithm power profile tracking plug-in electric vehicle

来源：评论

学校读者我要写书评

暂无评论

Evacuating Two Robots from Two Unknown Exits on the Perimeter of a Disk with Wireless Communication 18

Evacuating Two Robots from Two Unknown Exits on the Perimete...

引用

19th International Conference on distributed Computing and Networking (ICDCN)

作者： Pattanayak, Debasish Ramesh, H. Mandal, Partha Sarathi Schmid, Stefan IIT Guwahati Gauhati India Univ Vienna Vienna Austria

ISBN: (纸本)9781450363723

The evacuation of mobile robots is an interesting emerging application in distributed computing. This paper considers the fundamental problem of how to evacuate two robots from a unit disk. The robots, initially located at the center of the disk, need to exit the disk through two unknown exits, at known distance d from each other, located at the perimeter of the disk. The robots can coordinate when exploring the disk, using wireless communication. The objective is to minimize the evacuation time, i.e., the time until the last robot exits the disk. We consider two different model variants, where exits can either be labeled or unlabeled. We complement our analysis with simulations.

关键词： Mobile Robots Evacuation distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

Electing an Approximate Center in a Huge Modular Robot with the k-BFS SumSweep algorithm

Electing an Approximate Center in a Huge Modular Robot with ...

引用

25th IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS)

作者： Naz, Andre Piranda, Benoit Bourgeois, Julien Goldstein, Seth Copen Univ Bourgogne Franche Comte CNRS FEMTO ST Inst Montbeliard France Carnegie Mellon Univ Sch Comp Sci Pittsburgh PA 15213 USA

ISBN: (纸本)9781538680940

Among the diversity of the existing modular robotic systems, we consider in this paper the subset of distributed modular robotic ensembles composed of resource-constrained identical modules that are organized in a lattice structure and which can only communicate with neighboring modules. These modular robotic ensembles form asynchronous distributed embedded systems. In many algorithms dedicated to distributed system coordination, a specific role has to be played by a leader, i.e., a single node in the system. This leader can be elected using various criteria. A possible strategy is to elect a center node, i.e., a node that has the minimum distance to all the other nodes. Indeed, this node is ideally located to communicate with all the others and this leads to better performance in many algorithms. The contribution of this paper is to propose the k-BFS SumSweep algorithm designed to elect an approximate-center node. We evaluated our algorithm both on hardware modular robots and in a simulator for large ensembles of robots. Experimental results show that k-BFS SumSweep is often the most accurate approximation algorithm (with an average relative accuracy between 90% to 100%) while using the fewest messages in large-scale systems, requiring only a modest amount of memory per node, and converging in a reasonable length of time.

关键词： distributed algorithm Modular robots Center election

来源：评论

学校读者我要写书评

暂无评论

NON-NEGATIVE ONLINE ESTIMATION FOR HAWKES PROCESS NETWORKS

NON-NEGATIVE ONLINE ESTIMATION FOR HAWKES PROCESS NETWORKS

引用

IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)

作者： Piggott, Marc Solo, Victor Univ New South Wales Sch Elect Engn & Telecommun Sydney NSW Australia

ISBN: (纸本)9781538646588

Networks of interacting Hawkes processes have emerged as useful models in neuroscience, geophysics, high frequency finance, and social network analysis. The Hawkes process is of fundamental importance, being a point process analog of an autoregression. Here we develop a fixed gain adaptive (aka online) distributed estimator for the parameters of a Hawkes process model. The stochastic intensity is modeled by a causal Laguerre basis expansion. The natural recursive structure of this basis is exploited to derive a new two time scale adaptive algorithm based on exponentially weighted least squares which preserves non-negativity constraints. Simulations illustrate the results.

关键词： Hawkes process adaptive algorithm NMF distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

Low Complexity distributed Max-Throughput algorithm for User Association in Heterogeneous Network

引用

WIRELESS PERSONAL COMMUNICATIONS 2016年第4期87卷 1147-1156页

作者： Luan, Zhirong Qu, Hua Zhao, Jihong Chen, Badong Xi An Jiao Tong Univ Sch Elect & Informat Engn Xian 710049 Peoples R China Xian Univ Posts & Telecommun Sch Telecommun & Informat Engn Xian Peoples R China

This letter presents a distributed user association algorithm for the load balancing in heterogeneous networks. In this new method, we formulate the load balancing problem as a max min throughput problem. To solve this problem, we propose a distributed max-throughput algorithm. The main advantages of this algorithm include low computational complexity and few free parameters. Analysis and simulation results show that the proposed algorithm is very practical due to its simplicity.

关键词： Load balancing User association distributed algorithm Heterogeneous network

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：