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

distributed location model and algorithm with position uncertainty

The Journal of China Universities of Posts and Telecommunications 2014年第2期21卷 48-56页

作者： SHI Yu-long CUI Qi-me CAO Si-qi TAO Xiao-feng Key Laboratory of Universal Wireless Communications Ministry of Education Beijing University of Posts and Telecommunications

The localization of multiple mobile terminals （MTs） is an encouraging paradigm of applications in wireless networks. Peer-to-peer communication between MTs facilitates the cooperative localization of multiple MTs. For sake of low complexity and high robustness, investigations often focus on the distributed algorithm in cooperative localization. However, the impact from position uncertainty of cooperative MT lacks of analysis in related works. A new distributed location model, as well as corresponding algorithm, is devised when considering both the distance measurement error and the position uncertainty of MTs, which is more judicious than the traditional model for distributed cooperative localization scenario. In addition, the performance of proposed algorithm is analyzed through Cramér-Rao lower bound （CRLB）. Simulations indicate that the algorithm outperforms traditional methods in terms of accuracy and robustness.

关键词： distributed algorithm cooperative localization position tmcertainty

来源：评论

学校读者我要写书评

暂无评论

(α,τ)-Monitoring for event detection in wireless sensor networks

引用

JOURNAL OF COMBINATORIAL OPTIMIZATION 2016年第4期32卷 985-1001页

作者： Bi, Ran Li, Jianzhong Gao, Hong Li, Yingshu Harbin Inst Technol Sch Comp Sci & Technol Harbin 150001 Peoples R China Georgia State Univ Dept Comp Sci Atlanta GA 30303 USA

Detecting abnormal events is one of the fundamental issues in wireless sensor networks (WSNs). In this paper, we investigate(,)-monitoring in WSNs. For a given monitored threshold, we prove that (i) the tight upper bound ofPr[S(t)=]isO(exp{-nl(/nsup,(t)/nsup)}), if(t)<;and (ii) the tight upper bound ofPr[S(t)=]isO(exp{-nl(/nsup,(t)/nsup)}), if(t)>, wherePr[X]is the probability of random eventX,S(t)is the sum of the monitored area at timet,nis the number of the sensor nodes,supis the upper bound of sensed data,(t)is the expectation ofS(t), andl(x1,x2)=x1ln(x1x2)+(1-x1)ln(1-x11-x2). An instant(,)-monitoring scheme is then developed based on the upper bound. Moreover, approximate continuous(,)-monitoring is investigated. We prove that the probability of false negative alarm isa, if the sample size isfor a given precision requirement, whereis thefractile of a standard normal distribution. Finally, the performance of the proposed algorithms is validated through experiments.

关键词： Monitoring distributed algorithm Sensor networks

来源：评论

学校读者我要写书评

暂无评论

An Improved algorithm for distributed Trigger Counting in Ring

引用

COMPUTER JOURNAL 2014年第7期57卷 980-986页

作者： Karmakar, Sushanta Reddy, A. Chandrakanth Indian Inst Technol Dept Comp Sci & Engn Gauhati 781039 India

Consider a distributed system with n processors, which receive triggers from the outside world. The distributed trigger counting (DTC) problem is to raise an alarm if the total number of triggers over the system reaches w, which is an user-specified input. DTC is used as a primitive operation in many applications, such as distributed monitoring, global snapshots, etc. Many of the earlier studies on DTC was done using non-deterministic algorithms. In this paper, we propose a deterministic algorithm for the DTC problem with a message complexity of O(n log w log n) and each node in the system receives O(n log w) number of messages, which is an improvement over earlier result for certain values of w. The distribution of triggers among the n nodes may be arbitrary. This paper gives insight into the deterministic algorithm for the DTC problem. Also to the best of our knowledge the overall message complexity and per node message complexity are better than earlier deterministic algorithms.

关键词： distributed algorithm distributed monitoring distributed trigger counting ring network

来源：评论

学校读者我要写书评

暂无评论

A distributed speed scaling and load balancing algorithm for energy efficient data centers

引用

PERFORMANCE EVALUATION 2014年第0期79卷 120-133页

作者： Ko, Young Myoung Cho, Yongkyu Pohang Univ Sci & Technol Dept Ind & Management Engn Pohang 790784 Gyeongbuk South Korea

Modern electronic communications rely on large-scale data centers to process and store the vast amounts of data produced by smart phones, tablets, and other mobile devices. Remarkably, most data centers are still not energy efficient, because they operate full speed around the clock regardless of demand. In this paper, we present a novel distributed algorithm that adjusts server speed and workload routing according to the demand of multiple (virtualized) applications. Unlike previous studies that use the mean response time of a simple M/M/1 queue, the proposed algorithm incorporates the response time distribution obtained from a G/G/1/PS queue. We explain the optimality of the proposed algorithm and discuss the impact of incorporating response time constraints. The numerical results show the effectiveness of the algorithm when implemented in a distributed manner. (C) 2014 Elsevier B.V. All rights reserved.

关键词： Data centers Energy efficiency distributed algorithm Speed scaling and load balancing G/G/1/PS queues

来源：评论

学校读者我要写书评

暂无评论

A distributed O(1)-Approximation algorithm for the Uniform Facility Location Problem

引用

algorithmICA 2014年第3期68卷 643-670页

作者： Gehweiler, Joachim Lammersen, Christiane Sohler, Christian Univ Paderborn Heinz Nixdorf Inst D-33095 Paderborn Germany Univ Paderborn Dept Comp Sci D-33095 Paderborn Germany Simon Fraser Univ Sch Comp Sci Burnaby BC V5A 1S6 Canada Tech Univ Dortmund Dept Comp Sci D-44221 Dortmund Germany

We investigate a metric facility location problem in a distributed setting. In this problem, we assume that each point is a client as well as a potential location for a facility and that the opening costs for the facilities and the demands of the clients are uniform. The goal is to open a subset of the input points as facilities such that the accumulated cost for the whole point set, consisting of the opening costs for the facilities and the connection costs for the clients, is minimized. We present a randomized distributed algorithm that computes in expectation an -approximate solution to the metric facility location problem described above. Our algorithm works in a synchronous message passing model, where each point is an autonomous computational entity that has its own local memory and that communicates with the other entities by message passing. We assume that each entity knows the distance to all the other entities, but does not know any of the other pairwise distances. Our algorithm uses three rounds of all-to-all communication with message sizes bounded to bits, where n is the number of input points. We extend our distributed algorithm to constant powers of metric spaces. For a metric exponent a""a parts per thousand yen1, we obtain a randomized -approximation algorithm that uses three rounds of all-to-all communication with message sizes bounded to bits.

关键词： Facility location distributed algorithm Randomized approximation algorithm Synchronous message passing model

来源：评论

学校读者我要写书评

暂无评论

Message Passing algorithm for distributed Downlink Regularized Zero-Forcing Beamforming with Cooperative Base Stations

引用

IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS 2014年第5期13卷 2920-2930页

作者： Wen, Chao-Kai Chen, Jung-Chieh Wong, Kai-Kit Ting, Pangan Natl Sun Yat Sen Univ Inst Commun Engn Kaohsiung 804 Taiwan Natl Kaohsiung Normal Univ Dept Optoelect & Commun Engn Kaohsiung 802 Taiwan UCL Dept Elect & Elect Engn London WC1E 7JE England ITRI Hsinchu 310 Taiwan

Base station (BS) cooperation can turn unwanted interference to useful signal energy for enhancing system performance. In the cooperative downlink, zero-forcing beamforming (ZFBF) with a simple scheduler is well known to obtain nearly the performance of the capacity-achieving dirty-paper coding. However, the centralized ZFBF approach is prohibitively complex as the network size grows. In this paper, we devise message passing algorithms for realizing the regularized ZFBF (RZFBF) in a distributed manner using belief propagation. In the proposed methods, the overall computational cost is decomposed into many smaller computation tasks carried out by groups of neighboring BSs and communication is only required between neighboring BSs. More importantly, some exchanged messages can be computed based on channel statistics rather than instantaneous channel state information, leading to significant reduction in computational complexity. Simulation results demonstrate that the proposed algorithms converge quickly to the exact RZFBF and much faster compared to conventional methods.

关键词： Base station cooperation belief-propagation distributed algorithm message passing zero-forcing beamforming massive MIMO

来源：评论

学校读者我要写书评

暂无评论

distributed algorithm for Self Organizing LTE Interference Coordination

Distributed Algorithm for Self Organizing LTE Interference C...

引用

1st International ICST Conference on Mobile Networks and Management (MONAMI)

作者： Karla, Ingo Alcatel Lucent Bell Labs D-70435 Stuttgart Germany

ISBN: (纸本)9783642118166

A novel generic distributed algorithm is presented, which assigns in a self organizing way resources to the cells in cellular networks under the constraints that resource restrictions need to be considered between the cells. The algorithm operates in a fully distributed way, running independently inside each base station without any central entity. It optimizes the resource assignment, is capable to resolve sub-optimal aspects as well as comprises methods to detect and resolve possible instabilities such as contradicting decisions like ping pongs of two neighbouring base stations. The algorithm is here applied for LTE inter-cell interference coordination and simulations have shown that this distributed algorithm is always capable to solve reliably the resource assignment task.

关键词： distributed algorithm Colouring Self Organizing Networks SON Self-X Inter-Cell Interference Coordination ICIC IFCO Cellular Network 3GPP Long Term Evolution LTE

来源：评论

学校读者我要写书评

暂无评论

distributed Computation of Sparse Cuts via Random Walks 15

Distributed Computation of Sparse Cuts via Random Walks

引用

16th International Conference on distributed Computing and Networking

作者： Das Sarma, Atish Molla, Anisur Rahaman Pandurangan, Gopal eBay Inc eBay Res Labs San Jose CA 95125 USA Univ Freiburg Dept Comp Sci Freiburg Germany Univ Houston Dept Comp Sci Houston TX 77204 USA Nanyang Technol Univ Div Math Sci Singapore 637371 Singapore Brown Univ ICERM Providence RI 02912 USA

ISBN: (纸本)9781450329286

A sparse cut of a graph is a partition of the vertices into two disjoint subsets such that the ratio of the number of edges across the two subsets divided by the sum of degrees of vertices in the smaller side is minimum. Finding sparse cuts is an important tool in analyzing large-scale distributed networks such as the Internet and Peer-to-Peer networks, as well as large-scale graphs such as the web graph, online social communities, and VLSI circuits. Sparse cuts are useful in graph clustering and partitioning among numerous other applications. In distributed communication networks, they are useful for topology maintenance and for designing better search and routing algorithms. In this paper, we focus on developing a fast distributed algorithm for computing sparse cuts in networks. Given an undirected n-node network G with conductance phi, the goal is to find a cut set whose conductance is close to phi. We present a distributed algorithm that finds a cut set with sparsity (O) over tilde (root phi) ((O) over tilde hides polylog n factors). Our algorithm works in the CONGEST distributed computing model and outputs a cut of conductance at most (O) over tilde (root phi) with high probability, in O (1/b (1/phi + n) log(2)n) rounds, where b is balance of the cut of given conductance. In particular, to find a sparse cut of constant balance, our algorithm takes O ((1/phi + n) log(2)n) rounds. Our algorithm can also be used to output a local cluster, i.e., a subset of vertices near a given source node, and whose conductance is within a quadratic factor of the best possible cluster around the specified node. Our distributed algorithm can work without knowledge of the optimal phi value (with only a log n factor slowdown) and hence can be used to find approximate conductance values both globally and with respect to a given source node. Our algorithm uses random walks as a key subroutine and is fully decentralized and uses lightweight local computations. We also give a lower boun

关键词： distributed algorithm Sparse Cut Conductance Random Walks algorithms Theory

来源：评论

学校读者我要写书评

暂无评论

distributed Resource Allocation in Virtualized Wireless Cellular Networks based on ADMM

Distributed Resource Allocation in Virtualized Wireless Cell...

引用

34th IEEE Conference on Computer Communications (INFOCOM)

作者： Liang, Chengchao Yu, F. Richard Carleton Univ Dept Syst & Comp Engn Ottawa ON Canada

ISBN: (纸本)9781467371315

In next generation wireless mobile networks, network virtualization will become an important key technology. In this paper, we firstly propose a resource allocation scheme for enabling efficient resource allocation in wireless network virtualization. Then, we formulate the resource allocation strategy as an optimization problem, considering not only the revenue earned by serving end users of virtual networks, but also the cost of leasing infrastructure from infrastructure providers. In addition, we develop an efficient alternating direction method of multipliers (ADMM)-based distributed virtual resource allocation algorithm in virtualized wireless networks. Simulation results are presented to show the effectiveness of the proposed scheme.

关键词： Wireless network virtualization virtual resource allocation distributed algorithm alternating direction method of multipliers

来源：评论

学校读者我要写书评

暂无评论

distributed Energy Efficient Adaptive Clustering Protocol with Data Gathering for Large Scale Wireless Sensor Networks 12

Distributed Energy Efficient Adaptive Clustering Protocol wi...

引用

12th IEEE International Conference on Programming and Systems (ISPS)

作者： Gherbi, Chirihane Aliouat, Zibouda Benmohammed, Mohammed Univ OEB Dept Math & Comp Sci Oum El Bouaghi Algeria Ferhat Abbes Univ Dept Sci Setif Algeria Mentouri Univ Dept Comp Sci Constantine Algeria

ISBN: (纸本)9781479977000

Hierarchical routing is an efficient way to lower energy consumption within a cluster, performing data aggregation and fusion in order decrease the number of transmitted messages to the BS. In this paper, a novel hierarchical approach called distributed energy efficient adaptive clustering protocol with Data Gathering (DEACP) is proposed for Wireless sensor network. Since nodes in a sensor network have limited energy, prolonging the network lifetime and improving scalability become important. we have proposed (DEACP) approach to reach the following objectives: reduce the overall network energy consumption, balance the energy consumption among the sensors and extend the lifetime of the network, the clustering must be completely distributed, the clustering should be efficient in complexity of message and time, the cluster-heads should be well-distributed across the network, the load balancing should be done well, the clustered WSN should be fully-connected. As a result transmission power of the node is reduce which subsequently reduces the energy consumption of the node. Our proposed work is simulated through Network Simulator (NS-2). We consider the problem of conserving energy in a single node in a wireless sensor network by turning off the node's radio for periods of a fixed time length. While packets may continue to arrive at the node's buffer during the sleep periods, the node cannot transmit them until it wakes up. The objective is to design sleep control laws that minimize the expected value of a cost function representing both energy consumption costs and holding costs for backlogged packets. The network scenario is established by considering 1000 X 1000 area and displaying randomly moving nodes using TCL. The resource reservation is used to decompose the total simulation time of network into smaller time slots depending upon number of nodes in the network using TDMA technique. Simulations show that (DEACP) clusters have good performance characteristics.

关键词： Energy saving distributed algorithm Cluster-based Routing Wireless Sensor Network

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：