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

distributed event-triggered path construction in wireless sensor networks

WIRELESS NETWORKS 2013年第1期19卷 1-16页

作者： Lee, Chunseok Choi, Sunghee Korea Adv Inst Sci & Technol Dept Comp Sci Taejon 305701 South Korea

We consider the problem of guiding mobile agents to visit a subset of sensor nodes called event nodes in wireless sensor networks without location information, where the set of event nodes is not known in advance. As the set of event nodes changes over time, a path needs to be updated on-line. We propose a novel distributed algorithm to construct and update such a dynamic path to visit a set of event nodes. To the best of our knowledge, this is the first work to solve this problem using a distributed algorithm without any location information. Our approach is to maintain the Voronoi diagram of the dynamic set of event nodes implicitly in sensor networks. Doing so, we overcome the lack of location information and implement scalable distributed dynamic navigation. For computing an optimal path is NP-Hard, we prove that the ratio of the length of the constructed path by our algorithm to that of the optimal path is bounded by O(log k), where k is the number of event nodes, under a reasonable assumption. Our approach can be used to compute both an event visiting tour which requires to return to a starting point and an event visiting path which does not return to a starting point. We also extend our method to navigate multiple agents so that they collectively visit a set of event nodes.

关键词： Wireless sensor networks distributed algorithm Traveling salesman path Navigation

来源：评论

学校读者我要写书评

暂无评论

A New distributed algorithm for Parametric Data Modeling in Wireless Sensor Networks

A New Distributed Algorithm for Parametric Data Modeling in ...

引用

10th IEEE Workshop on Signal Processing Advances in Wireless Communications

作者： Marechal, Nicolas Pierrot, Jean-Benoit Gorce, Jean-Marie CEA LETI MINATEC 17 Rue Martyrs F-38054 Grenoble France Univ Lyon 2 Inst Natl Sci Appl Lyon INRIA F-69621 Villeurbanne France

ISBN: (纸本)9781424436958

Sensor networks aim at monitoring events and phenomena occurring in their environment and providing useful information to one or several end users. When a global knowledge of sensed data is needed, techniques from data gathering, statistical estimation and parametric modeling can be used. While the two first methods require respectively a large amount of energy and a knowledge of statistical dependencies between measurements, a new simple algorithm for fitting a parametric model to sensed data is proposed in this article. The novelty and advantages of this approach stands in its intrinsic robustness to packet losses and asynchronous data exchanges. Moreover, this algorithm is intituively efficient as it uses the broadcasting nature of the wireless medium.

关键词： distributed algorithm sensor networks networked systems consensus algorithms data fusion

来源：评论

学校读者我要写书评

暂无评论

Improving the efficiency of the distributed stochastic algorithm 10

Improving the efficiency of the distributed stochastic algor...

引用

Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1

作者： Melanie Smith Roger Mailler University of Tulsa Oklahoma

ISBN: (纸本)9780982657119

The distributed Stochastic algorithm (DSA) is a distributed hill-climbing technique for solving large distributed Constraint Optimization Problems (DCOPs) such as distributed scheduling, resource allocation, and distributed route planning. The best known version of DSA, DSA-B, works by having agents change their assignments with probability p when making that change will improve their solution (a hill-climbing move). To escape local minima, DSA-B performs a lateral escape move by switching to another equally good value with the same probability p. It is unclear why hill climbing and escape moves are chosen with the same probability. We investigate the performance effects of making these moves with different probabilities, pH and pL. Through empirical evaluation, we discover that the efficiency of DSA can not only be considerably improved, but can be more specifically tuned to a particular domain or user's needs when these two move types are considered separately. Our work also shows that DSA can outperform both DBA and DPP when it is properly tuned.

关键词： local search DCOP DSA distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

A distributed Scheduling algorithm for Wireless Networks with Constant Overhead and Arbitrary Binary Interference 10

A Distributed Scheduling Algorithm for Wireless Networks wit...

引用

SIGMETRICS 2010

作者： Jean-Claude Bermond Dorian Mazauric Vishal Misra Philippe Nain Mascotte INRIA I3S(CNRS/Univ. of Nice-Sophia Antipolis) Sophia Antipolis France Maestro INRIA and Mascotte INRIA I3S(CNRS/Univ. of Nice-Sophia Antipolis) Sophia Antipolis France Columbia University New York USA Maestro INRIA Sophia Antipolis France

ISBN: (纸本)9781450300384

This work investigates distributed transmission scheduling in wireless networks. Due to interference constraints, "neighboring links" cannot be simultaneously activated, otherwise transmissions will fail. Hereafter, we consider any binary model of interference. We follow the model described by Bui, Sanghavi, and Srikant in [3]. We assume. There are two phases during each slot: first the control phase which determines what links will be activated next, followed by a transmission phase during which data is transmitted. We assume random arrivals of data (packets) on each link during each slot, so that a buffer (queue) is associated to each link. It takes exactly one time slot to transmit a packet on a link. Since nodes do not have a global knowledge of the network, our aim (like in [3]) is to design for the control phase a distributed algorithm which identifies a set of non-interfering links.

关键词： wireless network transmission scheduling interfer-ence distributed algorithm stability.

来源：评论

学校读者我要写书评

暂无评论

A trigger counting mechanism for ring topology 14

A trigger counting mechanism for ring topology

引用

Proceedings of the Thirty-Seventh Australasian Computer Science Conference - Volume 147

作者： Sushanta Karmakar Subhrendu Chattopadhyay Indian Institute of Technology Guwahati India

ISBN: (纸本)9781921770302

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 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 snapshot etc. In this paper, we propose an algorithm for the DTC problem in a ring topology with a message complexity of O(n2 log(w/n)) and each node in the system receives O(n log(w/n)) number of messages. We also discuss about the possible tuning of the algorithm which results better complexities.

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

来源：评论

学校读者我要写书评

暂无评论

Joint Resource Allocation for eICIC in Heterogeneous Networks

Joint Resource Allocation for eICIC in Heterogeneous Network...

引用

IEEE Global Communications Conference

作者： Weijun Tang Rongbin Zhang Yuan Liu Suili Feng School of Electronic and Information Engineering South China University of Technology

ISBN: (纸本)9781479935130

Interference coordination between high-power macros and low-power picos deeply impacts the performance of heterogeneous networks (HetNets). It should deal with three challenges: user association with macros and picos, the amount of almost blank subframe (ABS) that macros should reserve for picos, and resource block (RB) allocation strategy in each eNB. We formulate the three issues jointly for sum weighted logarithmic utility maximization while maintaining proportional fairness of users. A class of distributed algorithms are developed to solve the joint optimization problem. Our framework can be deployed for enhanced inter-cell interference coordination (eICIC) in existing LTE-A protocols. Extensive evaluation are performed to verify the effectiveness of our algorithms.

关键词： Long Term Evolution distributed algorithms optimisation picocellular radio protocols radiofrequency interference resource allocation ABS HetNets LTE-A protocol RB allocation strategy almost blank subframe distributed algorithm eICIC enhanced intercell interference coordination heterogeneous network high-power macro interference coordination low-power pico resource block allocation strategy sum weighted logarithmic utility maximization Downlink Interference Joints Macrocell networks Next generation networking Optimization Resource management

来源：评论

学校读者我要写书评

暂无评论

Dynamic spectrum management algorithm for green DSL

Dynamic spectrum management algorithm for green DSL

引用

2014 International Conference on Communication Technology and Application(CTA2014)

作者： Y.M.Li X.R.Lv Y.Zhu Institute of Communication Technology Ningbo University

ISBN: (纸本)9781845649302

Traditionally, Dynamic Spectrum Management（DSM） is an effective method for mitigating crosstalk and improving the data rate in multi-user DSL systems. In this paper, we will show how DSM can be efficiently used for energy. Firstly, with a constraint factor on all allocated power added to the traditional DSM formulation, a new DSM problem of the maximum data rate object is formulated;then a distributed feasibility algorithm consisting of local water-filling-like algorithms is implemented. Simulation results show that the consumed power can be reduced by higher percentage with just smaller sacrifice of data rate in DSL system. Furthermore, this sacrifice is smaller especially in higher crosstalk environment.

关键词： digital subscriber line green DSL dynamic spectrum management distributed algorithm water-filling-like

来源：评论

学校读者我要写书评

暂无评论

A Simple Broadcast algorithm for Recurrent Dynamic Systems

A Simple Broadcast Algorithm for Recurrent Dynamic Systems

引用

IEEE International Conference on Advanced Information Networking and Applications

作者： Michel Raynal Julien Stainer Jiannong Cao Weigang Wu Institut Universitaire de France IRISA Université de Rennes 35042 Rennes Cedex France Department of Computing Hong Kong Polytechnic University Kowloon Hong Kong Department of Computer Science Sun Yat-sen University Guangzhou Guangdong 510006 China

ISBN: (纸本)9781479936311

This paper presents a simple broadcast algorithm suited to dynamic systems where links can repeatedly appear and disappear. The algorithm is proved correct and a simple improvement is introduced, that reduces the number and the size of control messages. As it extends in a simple way a classical network traversal algorithm to the dynamic context, the proposed algorithm has also pedagogical flavor.

关键词： Bounded delay Broadcast distributed algorithm Dynamic network Mobile entity Unbounded recurrence Recurrent link

来源：评论

学校读者我要写书评

暂无评论

distributed SPARSE SIGNAL RECOVERY FOR SENSOR NETWORKS

DISTRIBUTED SPARSE SIGNAL RECOVERY FOR SENSOR NETWORKS

引用

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

作者： Patterson, Stacy Eldar, Yonina C. Keidar, Idit Technion Israel Inst Technol Dept Elect Engn IL-32000 Haifa Israel

ISBN: (纸本)9781479903566

We propose a distributed algorithm for sparse signal recovery in sensor networks based on Iterative Hard Thresholding (IHT). Every agent has a set of measurements of a signal x, and the objective is for the agents to recover x from their collective measurements at a minimal communication cost and with low computational complexity. A naive distributed implementation of IHT would require global communication of every agent's full state in each iteration. We find that we can dramatically reduce this communication cost by leveraging solutions to the distributed top-K problem in the database literature. Evaluations show that our algorithm requires up to three orders of magnitude less total bandwidth than the best-known distributed basis pursuit method.

关键词： compressed sensing distributed algorithm iterative hard thresholding top-K

来源：评论

学校读者我要写书评

暂无评论

A Framework for Supporting Tree-Like Indexes on the Chord Overlay

引用

Journal of Computer Science & Technology 2013年第6期28卷 962-972页

作者：朱命冬申德荣寇月聂铁铮于戈 CCF ACM College of Information Science and EngineeringNortheastern University IEEE

With the explosive growth of data, to support efficient data management including queries and updates, the database system is expected to provide tree-like indexes, such as R-tree, M-tree, B＋-tree, according to different types of data. In the distributed environment, the indexes have to be scattered across the compute nodes to improve reliability and scalability. Indexes can speed up queries, but they incur maintenance cost when updates occur. In the distributed environment, each compute node maintains a subset of an index tree, so keeping the communication cost small is more crucial, or else it occupies lots of network bandwidth and the scalability and availability of the database system are affected. Further, to achieve the reliability and scalability for queries, several replicas of the index are needed, but keeping the replicas consistent is not straightforward. In this paper, we propose a framework supporting tree-like indexes, based on Chord overlay, which is a popular P2P structure. The framework dynamically tunes the number of replicas of index to balance the query cost and the update cost. Several techniques are designed to improve the efficiency of updates without the cost of performance of the queries. We implement M-tree and R-tree in our framework, and extensive experiments on real- life and synthetic datasets verify the efficiency and scalability of our framework.

关键词： tree-like index Chord distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：