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

TOSSIM and distributed binary consensus algorithm in wireless sensor networks

JOURNAL OF NETWORK AND COMPUTER APPLICATIONS 2014年第May期41卷 451-458页

作者： Abdaoui, Abderrazak El-Fouly, Tarek M. Univ London Imperial Coll Sci Technol & Med London SW7 2AZ England Qatar Univ Coll Engn Dept Comp Sci Doha Qatar

In this paper, we present distributed binary consensus algorithm over the wireless sensor networks (WSN) in the presence of faulty nodes. We assume that each fault occurs during the execution of an algorithm on a sensor node. With binary consensus, each sensor node, initially, observes one of two states TRUE and FALSE and the aim is to decide which one of the two states was held by the majority of the nodes. The nodes exchange their measurements and each one updates its state according to the state communicated by the last contacted node. We propose the implementation of the distributed binary consensus algorithm in WSN when the network contains t faulty nodes. The implementation was tested on sensor nodes using the TinyOSSimulator (TOSSIM) for a WSN with a large number of nodes. This ensures that the simulation is more close to the real environment. It also guarantees that the code performs correctly when deployed on the physical nodes. In order to evaluate the performance of the distributed system, we consider the analysis of the average convergence time over a simulated environment such as TOSSIM and considering the presence of malicious nodes. These results are presented for a WSN with different topologies such as fully connected, path, ring, Erdos Reny random, and star-shaped. (C) 2014 Elsevier Ltd. All rights reserved.

关键词： Binary consensus algorithm distributed computation TinyOS IRIS motes TOSSIM Wireless sensor network Faulty node

来源：评论

学校读者我要写书评

暂无评论

Functional Forwarding of Channel State Information

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2014年第2期60卷 1008-1018页

作者： Zhan, Jiening Gastpar, Michael Univ Calif Berkeley Dept Elect Engn & Comp Sci Wireless Fdn Ctr Berkeley CA 94709 USA Ecole Polytech Fed Lausanne Sch Comp & Commun Sci CH-1015 Lausanne Switzerland

Based on the recent compute-and-forward technique [1], a novel communication strategy is proposed under which functions of the channel state information are forwarded along the network. Those functions are chosen such that on the one hand, they can be efficiently forwarded, and on the other hand, they are maximally useful to the final decoder of the message. It is illustrated that there is generally a tension between these two requirements. The strategy is shown to perform well for certain classes of multilayer networks where channel state information is acquired locally at each receiver. For example, for a two-stage Gaussian relay network with local channel state information, it is shown that the proposed strategy performs optimally in a scaling-law sense, as the number of relays increases.

关键词： Channel state information (CSI) relay networks distributed computation lattices

来源：评论

学校读者我要写书评

暂无评论

Secure Mining of Association Rules in Horizontally distributed Databases

引用

IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING 2014年第4期26卷 970-983页

作者： Tassa, Tamir Open Univ Dept Math & Comp Sci IL-43537 Raanana Israel

We propose a protocol for secure mining of association rules in horizontally distributed databases. The current leading protocol is that of Kantarcioglu and Clifton [18]. Our protocol, like theirs, is based on the Fast distributed Mining (FDM) algorithm of Cheung et al. [8], which is an unsecured distributed version of the Apriori algorithm. The main ingredients in our protocol are two novel secure multi-party algorithms-one that computes the union of private subsets that each of the interacting players hold, and another that tests the inclusion of an element held by one player in a subset held by another. Our protocol offers enhanced privacy with respect to the protocol in [18]. In addition, it is simpler and is significantly more efficient in terms of communication rounds, communication cost and computational cost.

关键词： Privacy preserving data mining distributed computation frequent item sets association rules

来源：评论

学校读者我要写书评

暂无评论

distributed Estimation and Control of Algebraic Connectivity Over Random Graphs

引用

IEEE TRANSACTIONS ON SIGNAL PROCESSING 2014年第21期62卷 5615-5628页

作者： Di Lorenzo, Paolo Barbarossa, Sergio Univ Roma La Sapienza Dept Informat Elect & Telecommun I-00184 Rome Italy

In this paper, we propose a distributed algorithm for the estimation and control of the connectivity of ad-hoc networks in the presence of a random topology. First, given a generic random graph, we introduce a novel stochastic power iteration method that allows each node to estimate and track the algebraic connectivity of the underlying expected graph. Using results from stochastic approximation theory, we prove that the proposed method converges almost surely (a.s.) to the desired value of connectivity even in the presence of imperfect communication scenarios. The estimation strategy is then used as a basic tool to adapt the power transmitted by each node of a wireless network, in order to maximize the network connectivity in the presence of realistic medium access control (MAC) protocols or simply to drive the connectivity toward a desired target value. Numerical results corroborate our theoretical findings, thus illustrating the main features of the algorithm and its robustness to fluctuations of the network graph due to the presence of random link failures.

关键词： Algebraic connectivity distributed computation Fiedler vector random graph spectral graph theory stochastic approximation stochastic power iteration topology control

来源：评论

学校读者我要写书评

暂无评论

Secure and efficient anonymization of distributed confidential databases

引用

INTERNATIONAL JOURNAL OF INFORMATION SECURITY 2014年第6期13卷 497-512页

作者： Herranz, Javier Nin, Jordi Univ Politecn Cataluna BarcelonaTech Dept Matemat Aplicada 4 ES-08034 Barcelona Spain Univ Politecn Cataluna BarcelonaTech BSC ES-08034 Barcelona Spain

Let us consider the following situation: t entities (e.g., hospitals) hold different databases containing different records for the same type of confidential (e.g., medical) data. They want to deliver a protected version of this data to third parties (e.g., pharmaceutical researchers), preserving in some way both the utility and the privacy of the original data. This can be done by applying a statistical disclosure control (SDC) method. One possibility is that each entity protects its own database individually, but this strategy provides less utility and privacy than a collective strategy where the entities cooperate, by means of a distributed protocol, to produce a global protected dataset. In this paper, we investigate the problem of distributed protocols for SDC protection methods. We propose a simple, efficient and secure distributed protocol for the specific SDC method of rank shuffling. We run some experiments to evaluate the quality of this protocol and to compare the individual and collective strategies for solving the problem of protecting a distributed database. With respect to other distributed versions of SDC methods, the new protocol provides either more security or more efficiency, as we discuss through the paper.

关键词： Statistical disclosure control distributed computation Database security ElGamal cryptosystem

来源：评论

学校读者我要写书评

暂无评论

Bilevel multiobjective packaging optimization for automotive design

引用

STRUCTURAL AND MULTIDISCIPLINARY OPTIMIZATION 2014年第4期50卷 663-682页

作者： Dandurand, Brian Guarneri, Paolo Fadel, Georges M. Wiecek, Margaret M. Clemson Univ Dept Math Sci Clemson SC 29634 USA Clemson Univ Dept Mech Engn Clemson SC USA

The successful application of multiobjective optimization to engineering problems has motivated studies of more complex systems involving multiple subsystems and design disciplines, each with multiple design criteria. Complex system design requires participation of different teams that are highly specialized within each discipline and subsystem. Such a high differentiation results in limited sharing of information among the design teams. The mathematical modeling and the solution algorithm proposed in this paper address the issue of coordinating multiple design problems that negotiate according to conflicting criteria. The design of the layout of hybrid vehicles is formulated as a bilevel decomposed problem including a vehicle level and a battery level in concert with the specialization of the respective design teams required at each level. An iterative algorithm, the Multiobjective Decomposition Algorithm (MODA) is proposed, whose generated sequences are shown to converge to efficient designs for the overall design problem under certain conditions examined in the context of the block coordinate descent method and the method of multipliers. MODA applied to the hybrid electric design problem captures the bilevel tradeoffs originating by the conflicting objectives at the vehicle and battery levels.

关键词： distributed computation Efficient designs Pareto equitable Block coordinate descent Morphing components

来源：评论

学校读者我要写书评

暂无评论

distributed Source Localization under Anchor Position Uncertainty

引用

Chinese Journal of Electronics 2014年第1期23卷 93-96页

作者： LIU Hongqing WU Yuntao Department of Electronic and Computer Engineering National University of Singapore Key Laboratory of Intelligent Robot in Hubei Province Wuhan Institute of Technology

In this work, a distributed source positioning approach is developed based on Alternating direction method of multipliers(ADMM). First, a centralized positioning method is developed under case of the anchor uncertainty. And then, the method is realized in a distributed way using ADMM. Simulation results show that the centralized one is robust to the anchor errors and distributed one has similar performance as the centralized one.

关键词： Target positioning Anchor uncertainty distributed computation

来源：评论

学校读者我要写书评

暂无评论

Open source verification in an anonymous volunteer network

引用

SCIENCE OF COMPUTER PROGRAMMING 2014年第PartB期91卷 161-187页

作者： Breuer, Peter T. Pickin, Simon Univ Birmingham Sch Comp Sci Birmingham B15 2TT W Midlands England Univ Complutense Madrid Fac Inf Dpto Sist Inf & Comp Madrid Spain

An 'open' certification process is characterised here that is not based on any central agency, but rather on the option for any party to confirm any part of the certification process at will. The model for this paradigm has been a distributed, piece-wise, semantic audit carried out on the Linux kernel source code using a lightweight formal method. Our goal is a technology that allows open source developers to receive formally backed certifications for their project, in quid pro quo exchanges of resources and expertise with other developers within an amorphous and anonymous cloud of volunteers. To help ensure the integrity of the results, identifying details such as subroutine and variable names are not included in the data sent for analysis, each part of the computation is repeated many times at different sites, and checkpoint information is generated that enables independent checks to be carried out without starting from scratch each time. (C) 2013 Elsevier B.V. All rights reserved.

关键词： Formal methods Software verification Static analysis Open source distributed computation

来源：评论

学校读者我要写书评

暂无评论

Co-evolutional genetic algorithm for workflow scheduling in heterogeneous distributed environment 8

Co-evolutional genetic algorithm for workflow scheduling in ...

引用

8th IEEE International Conference on Application of Information and Communication Technologies (AICT)

作者： Butakov, Nikolay Nasonov, Denis ITMO Univ St Petersburg Russia

ISBN: (纸本)9781479941209

Flexible and efficient workflow scheduling is a key feature for modern distributed heterogeneous computational environments to satisfy requirements of scientific community. In this paper, we propose novel co-evolutional scheduling algorithm which demonstrates with conducted experiments how nature inspired concept can improve existing schedulers and help to generate better schedules oriented on makespan minimization.

关键词： Co-evolution workflow scheduling distributed computation genetic algorithm

来源：评论

学校读者我要写书评

暂无评论

A distributed Reactive Power Optimization Method for Multi-area Interconnected Power Grid

A Distributed Reactive Power Optimization Method for Multi-a...

引用

IEEE Innovative Smart Grid Technologies - Asia (ISGT Asia)

作者： Zhao, Jinquan Ji, Yuejin Dai, Zemei Hohai Univ Coll Energy & Elect Engn Nanjing 210098 Jiangsu Peoples R China

ISBN: (纸本)9781479913008

This paper presents a distributed optimization method to solve the optimal reactive power flow (ORPF) problem of multi-area interconnected power grid. An external network reduced equivalent model is used to implement the ORPF calculation of each sub-grid. And the inter-area coupling constraint can be transformed into the injection power modified equation of external boundary bus afterwards. Therefore, the distributed solution of multi-area ORPF problem can be realized through updating of boundary bus equivalent injection power and voltage phasors. The proposed method avoids the tedious process of network equivalence and reduces the dependence on the coordination layer. Furthermore, it accords with the local feature of reactive power optimization and control properly as well. The numerical simulation results of several IEEE cases show that the proposed method is effective and suitable for online application.

关键词： Reactive Power Optimization distributed computation Simplified equivalent network model Equivalent Injection Power

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：