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

Introducing distributed gradient descent distance vector routing (DGDDVR)

ELECTRONICS LETTERS 2016年第23期52卷 1963-1965页

作者： Herbert, S. J. Univ Edinburgh Sch Engn Edinburgh Midlothian Scotland Blu Wireless Technol Bristol Avon England

A distributed algorithm is proposed which routes packets to minimise the expected latency in arbitrarily connected mesh networks, where each link has a set transmission rate. It is proven that the proposed algorithm converges to the global minimum. Initial simulations demonstrate the effectiveness of the proposed algorithm relative to current methods based on Dijkstra's algorithm.

关键词： telecommunication network routing gradient methods wireless mesh networks distributed algorithms distributed gradient descent distance vector routing DGDDVR algorithm Dijkstra's algorithm transmission rate arbitrarily connected mesh networks expected latency distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

An efficient distributed max-flow algorithm for Wireless Sensor Networks

引用

JOURNAL OF NETWORK AND COMPUTER APPLICATIONS 2015年 54卷 20-32页

作者： Homayounnejad, Saman Bagheri, Alireza Amirkabir Univ Technol Dept Comp Engn & Informat Technol Tehran Iran Islamic Azad Univ Tehran North Branch Dept Comp Engn Tehran Iran

The max-flow problem (MFP) is one of the most explored problems in the area of combinatorial optimization and it has a wide variety of potential applications in computer networks, especially in Wireless Sensor Networks (WSNs). In this paper, we propose a WSN-specific solution to MFP based on the well-known push-relabel method. In our solution we provide several techniques and heuristics to implement asynchronous communication, reduce message complexity, support adaptability, and satisfy soft real-time requirements. Because these heuristics are independent, we can adjust the algorithm by applying some heuristics and ignoring the others, according to the application requirements. Both theoretical analysis and simulation results show that the proposed algorithm makes a significant improvement in the case of message and time complexities in comparison with the best existing algorithms. (C) 2015 Elsevier Ltd. All rights reserved.

关键词： Wireless Sensor Networks Max-flow problem Adaptive algorithm distributed algorithm Asynchronous algorithm Near-optimal flow

来源：评论

学校读者我要写书评

暂无评论

distributed Resource Allocation in Virtualized Full-Duplex Relaying Networks

引用

IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY 2016年第10期65卷 8444-8460页

作者： Liu, Gang Yu, F. Richard Ji, Hong Leung, Victor C. M. Beijing Univ Posts & Telecommun Minist Educ Key Lab Universal Wireless Commun Beijing 100876 Peoples R China Southwest Jiaotong Univ Key Lab Informat Coding & Transmiss Chengdu 610031 Peoples R China Carleton Univ Dept Syst & Comp Engn Ottawa ON K1S 5B6 Canada Univ British Columbia Dept Elect & Comp Engn Vancouver BC V6T 1Z4 Canada

One significant challenge of wireless virtualization is how to allocate the virtual resources efficiently with various constraints and requirements. Most existing works have not considered relaying in wireless virtualization. However, relaying is regarded as one of the key components of future wireless networks. Furthermore, recent advances in self-interference cancelation techniques enable full-duplex relaying (FDR) systems, which transmit and receive simultaneously in the same frequency band with high spectrum efficiency. Different from existing works, we first introduce the idea of wireless virtualization into FDR networks and propose a virtual resource management architecture for virtualized FDR networks. Then, we formulate the virtual resource allocation as an optimization problem while taking the residual self-interference due to FDR and the requirements of wireless virtualization into account. Since the formulated problem is a mixed combinatorial and nonconvex optimization problem, it involves high computational complexity to solve it. To solve it efficiently, we transform the original problem to a convex optimization problem, and an efficient alternating direction method of multipliers (ADMM)-based distributed virtual resource allocation algorithm is developed to solve the convex problem. Extensive simulations are presented to show the effectiveness of the proposed scheme. It is demonstrated that the proposed virtualized FDR network is able to exploit the advantages of FDR and wireless virtualization.

关键词： Alternating direction method of multipliers (ADMM) distributed algorithm full duplex relaying resource allocation wireless virtualization

来源：评论

学校读者我要写书评

暂无评论

distributed differential admission control algorithm for delay-tolerant machine-to-machine devices

引用

IET COMMUNICATIONS 2015年第9期9卷 1230-1239页

作者： Li, Xiaohui Li, Dan Bai, Yan Xidian Univ State Key Lab Integrated Serv Networks Xian 710071 Shaanxi Peoples R China

Machine-to-machine (M2M) is a new type of communication which can be used in e-health, smart meters and so on. However a huge number of M2M devices will cause access congestion in third generation long-term evolution systems. It will bring access delays which cannot satisfy the requirements for the M2M deceives, especially for the devices with low tolerant delays. In this study, the authors investigate a distributed differential admission control algorithm that improves the access fairness for M2M devices with different tolerant delays. To maximise the access fairness while maintaining the throughput, an optimisation model is established by formulating a fairness-throughput payoff function. Then, a parallel and distributed algorithm, namely, Jacobi algorithm, is introduced to solve the optimisation problem. Furthermore, the constraint of the key parameters is given to guarantee that the algorithm can converge to the optimal solution. The simulation results show that the M2M devices with different tolerant delays have the maximum access fairness in their own tolerant delays by using the proposed method.

关键词： optimisation problem access congestion Optimisation techniques access fairness maximization telecommunication congestion control distributed algorithm Jacobi algorithm Mobile radio systems parallel algorithm optimisation delay tolerant networks fairness-throughput payoff function M2M devices low-tolerant delays distributed differential admission control algorithm 3G mobile communication access fairness improvement delay-tolerant machine-to-machine devices third generation Long-Term Evolution systems Long Term Evolution e-health optimisation model access delays smart meters

来源：评论

学校读者我要写书评

暂无评论

A distributed fuzzy logic-based root selection algorithm for wireless sensor networks

引用

COMPUTERS & ELECTRICAL ENGINEERING 2015年第C期41卷 216-225页

作者： Alaybeyoglu, Aysegul Izmir Katip Celebi Univ Dept Comp Engn Izmir Turkey

In this study, a distributed fuzzy logic (DFL) method with five input parameters namely, energy, centrality, distance to base station, number of hops and node density is proposed for efficient root election system. In order to prevent high energy consumption during message transmission, we made each node run fuzzy logic engine distributedly. We decrease the number of message transmissions from member nodes to root node by running DFL on intermediate nodes and by eliminating the messages of nodes that have less probability to be selected as a new root. The proposed system also includes fault tolerance, load balance, timeliness and the scalability mechanisms. To prove the efficiency of our algorithm, we compared it with the algorithms namely;Low Energy Adaptive Clustering Hierarchy (LEACH), Adaptive Clustering algorithm via Waiting Timer (ACAWT), Cluster Head Election mechanism using Fuzzy logic (CHEF) and Gupta's algorithm. (C) 2015 Published by Elsevier Ltd.

关键词： Wireless sensor networks Fuzzy logic Clustering distributed algorithm Root election

来源：评论

学校读者我要写书评

暂无评论

Cooperative topology control for low interference in wireless ad hoc networks

引用

INTERNATIONAL JOURNAL OF AD HOC AND UBIQUITOUS COMPUTING 2017年第4期24卷 213-224页

作者： Wang, Xinglong Huang, Liusheng Xu, Hongli Univ Sci & Technol China Sch Comp Sci & Technol Hefei 230027 Anhui Peoples R China Univ Sci & Technol China Suzhou Inst Adv Study Suzhou 215123 Jiangsu Peoples R China

Cooperative communication (CC) can exploit spatial diversity via neighbour's antennas, which may cause serious interference as well. However, previous works rarely consider guaranteeing the interference performance in the cooperative topology control problem for wireless ad hoc networks. In this paper, we first introduce a nodal interference model for the CC scheme. Based on this model, we formalise two critical problems: CTC-MMI which aims to obtain a strongly connected topology with min-max interference, and CTC-MAI which aims to construct a strongly connected topology with min-average interference. Then, we design DBS to solve CTC-MMI optimally. We also propose a distributed algorithm DBCT for CTC-MAI and prove that DBCT can reach the approximate factor of 4. Finally, extensive simulations show that the high efficiency of the proposed algorithms. For example, DBCT can construct the cooperative topology with low-average interference, and reduce the energy consumption by about 30% compared with traditional methods.

关键词： topology control strong connectivity cooperative communication low-interference energy efficiency approximation algorithm distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

A distributed algorithm for Power-Efficient Data Gathering in Randomly-distributed Wireless Sensor Networks

A Distributed Algorithm for Power-Efficient Data Gathering i...

引用

1st International Conference on Computer Science, Engineering and Information Technology (CCSEIT 2011)

作者： Di Stefano, Antonella Morana, Giovanni Univ Catania I-95125 Catania Italy

ISBN: (纸本)9783642240362

This article proposes a robust and power efficient technique for data gathering in randomly distributed wireless sensor networks. This solution, based on a self organized distributed algorithm, combines the benefits of the chain-based and cluster-based solutions to obtain, for each sensor, a particular arrangement of neighborhood relationship. This allows sensors to autonomously manage and balance the data flow (transmitted/received) with the other sensors obtaining, at the same time, a low power consumption and a high scalability.

关键词： WSN Power Consuming Sensors Tree organization distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

Self-Stabilizing Disconnected Components Detection and Rooted Shortest-Path Tree Maintenance in Polynomial Steps

引用

DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE 2017年第3期19卷

作者： Devismes, Stephane Ilcinkas, David Johnen, Colette Univ Grenoble Alpes Grenoble France Univ Bordeaux F-33400 Talence France CNRS LaBRI UMR 5800 F-33400 Talence France

We deal with the problem of maintaining a shortest-path tree rooted at some process r in a network that may be disconnected after topological changes. The goal is then to maintain a shortest-path tree rooted at r in its connected component, V-r, and make all processes of other components detecting that r is not part of their connected component. We propose, in the composite atomicity model, a silent self-stabilizing algorithm for this problem working in semi-anonymous networks, where edges have strictly positive weights. This algorithm does not require any a priori knowledge about global parameters of the network. We prove its correctness assuming the distributed unfair daemon, the most general daemon. Its stabilization time in rounds is at most 3n(maxCC) + D, where n(maxCC) is the maximum number of non-root processes in a connected component and D is the hop-diameter of V-r. Furthermore, if we additionally assume that edge weights are positive integers, then it stabilizes in a polynomial number of steps: namely, we exhibit a bound in O (W(max)n(maxCC) (3)n), where W-max is the maximum weight of an edge and n is the number of processes.

关键词： distributed algorithm self-stabilization routing algorithm shortest path disconnected network shortest-path tree

来源：评论

学校读者我要写书评

暂无评论

Serial-Parallel Combined distributed algorithm For High Speed Sampled Data Filter of Sensor Signal

Serial-Parallel Combined Distributed Algorithm For High Spee...

引用

International Conference on Advanced Design and Manufacturing Engineering (ADME 2011)

作者： Xie, Baozhong Chen, Tiequn S China Univ Technol Sch Mech & Automot Engn Guangzhou Guangdong Peoples R China

ISBN: (纸本)9783037852163

distributed algorithm (DA) has been applied widely because it doesn't need multiply operation. The serial structure DA takes less chip resource but more calculation time, while the full pipeline parallel structure DA is just the reverse. A Serial-Parallel combined DA is proposed in this paper to take full advantages of the above structures to realize sampled data filter from sensor signal. Through the verification by simulation and synthesization, it is shown that the proposed improved serial-parallel DA can realize real time high speed sampled data filter from sensor, and it can reach the best tradeoff of time and chip area.

关键词： distributed algorithm Serial-Parallel Combined Sampled Data Filter Real Time

来源：评论

学校读者我要写书评

暂无评论

distributed Load Shedding over Directed Communication Networks with Time Delays

Distributed Load Shedding over Directed Communication Networ...

引用

IEEE/PES Transmission and Distribution Conference and Exposition (T&D)

作者： Yang, Tao Wu, Di Pacific Northwest Natl Lab Richland WA 99354 USA

ISBN: (纸本)9781509021574

When generation is insufficient to support all loads in a power system under emergencies, effective and efficient load shedding needs to be deployed in order to prevent system collapse. This paper presents a ratio consensus based distributed algorithm to discover the system overload after disturbance. In the proposed algorithm, the agent at each bus only communicates with its neighboring agents via directed communication links possibly with arbitrarily large but bounded time-varying communication delays. Simulation results are used to validate the proposed method.

关键词： Directed graph distributed algorithm load shedding multi-agent systems ratio consensus time-varying delays

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：