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

30th ACM Symposium on Parallelism in algorithms and Architectures (SPAA)

作者： Amiri, Saeed Akhoondian de Mendez, Patrice Ossona Rabinovich, Roman Siebertz, Sebastian Max Planck Inst Informat Saarbrucken Germany EHESS CAMS CNRS UMR 8557 Paris France Tech Univ Berlin Berlin Germany Univ Warsaw Warsaw Poland

ISBN: (纸本)9781450357999

We provide a new constant factor approximation algorithm for the (connected) distance-r dominating set problem on graph classes of bounded expansion. Classes of bounded expansion include many familiar classes of sparse graphs such as planar graphs and graphs with excluded (topological) minors, and notably, these classes form the most general subgraph closed classes of graphs for which a sequential constant factor approximation algorithm for the distance-r dominating set problem is currently known. Our algorithm can be implemented in the CONGEST(BC) model of distributed computing and uses O(r(2) log n) communication rounds. Our techniques, which may be of independent interest, are based on a distributed computation of sparse neighborhood covers of small radius on bounded expansion classes. We show how to compute an r-neighborhood cover of radius 2r and overlap f(r) on every class of bounded expansion in O(r(2) logn) communication rounds for some function f. Finally, we show how to use the greater power of the LOCAL model to turn any distance-r dominating set into a constantly larger connected distance-r dominating set in 3r + 1 rounds on any class of bounded expansion. Combining this algorithm, e.g., with the constant factor approximation algorithm for dominating sets on planar graphs of Lenzen et al. gives a constant factor approximation algorithm for connected dominating sets on planar graphs in a constant number of rounds in the LOCAL model, where the approximation ratio is only 6 times larger than that of Lenzen et al.'s algorithm.

关键词： distributed algorithm Dominating set Connected dominating set Bounded expansion

来源：评论

学校读者我要写书评

暂无评论

distributed TDOA-BASED INDOOR SOURCE LOCALISATION

DISTRIBUTED TDOA-BASED INDOOR SOURCE LOCALISATION

引用

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

作者： Yu, Wangyang Gaubitch, Nikolay D. Heusdens, Richard Delft Univ Technol EEMCS Mekelweg 4 NL-2628 CD Delft Netherlands Pindrop 167 City Rd London EC1V 1AW England

ISBN: (纸本)9781538646588

Indoor localisation is an important research topic with several possible applications. For example, knowing a user's location can be used as navigation aid in hospitals and malls, or for better targeted marketing. In this paper we consider the case where the environment of interest is equipped with several receivers (with known location) from which time-difference-of-arrival (TDOA) measurements are obtained and used to localise the source. We will present a distributed algorithm for localising the source. More specifically, we experimentally show that the distributed algorithm, which only uses time-of-arrival (TOA) measurements obtained from neighbouring receivers to calculate the TDOAs, performs as well as a centralised solution that has access to all TOA measurements in the network. In addition, we propose a method for discarding erroneous TOA measurements which considerably improves the performance in noisy and reverberant environments.

关键词： Indoor localisation time difference of arrival distributed algorithm pruning erroneous TOA measurements

来源：评论

学校读者我要写书评

暂无评论

distributed Lost-in-space Localization in Sensor Networks Using Range Measurements

Distributed Lost-in-space Localization in Sensor Networks Us...

引用

IEEE International Conference on Systems, Man, and Cybernetics (SMC)

作者： Wang, Xiaochu Sun, Changhao Sun, Ting Liu, Xiaoyun China Acad Space Technol Qian Xuesen Lab Space Technol Beijing Peoples R China Beijing Informat Sci & Technol Univ Sch Photoelect Informat & Communn Engn Beijing Peoples R China

ISBN: (纸本)9781538666500

Sensor location is important to sensor networks since many cooperative tasks depend on it. Focusing on the lost-in space localization problem without prior location knowledge, this paper describes a self-organized and fully distributed algorithm where nodes start from a random guessed coordinate assignment and converge to a consistent solution with actual locations using ranging measurements and neighboring interaction only. It is most likely for this algorithm to overcome local minima and result in the global optimum by introducing an improved interacting mechanism where nodes interact according to a simulated switching computational topology. Numerical simulations demonstrate the effectiveness and robustness of the algorithm.

关键词： Sensor networks node localization distributed algorithm coordinated optimization global optimum

来源：评论

学校读者我要写书评

暂无评论

distributed Energy management for Integrated Energy System Considering Multiple independent Operators

Distributed Energy management for Integrated Energy System C...

引用

IEEE-Power-and-Energy-Society General Meeting (PESGM)

作者： Chen, Qifang Xia, Mingchao Chen, Meifu Hu, Hao Beijing Jiaotong Univ Sch Elect Engn Beijing 100044 Peoples R China State Grid Zhenjiang Maintenance Co Zhenjiang 212001 Peoples R China

ISBN: (纸本)9781538677032

In this paper, an improved energy hub (EH) model integrating electric and heat energy storage and solar thermal collector is proposed for integrated energy system (IES). The IES is regarded as a multi-operator system in which all the EHs belong to different operators. Based on the multi-operator structure, an energy management model considering electric and heat energy storage operation cost is presented as a distributed framework. The results of two contrastive simulation cases have verified the performance in energy bill and transmission loss reducing and energy storage life prolonging.

关键词： Energy management energy hub distributed algorithm ADMM integrated energy system

来源：评论

学校读者我要写书评

暂无评论

NetDP: An Industrial-Scale distributed Network Representation Framework for Default Prediction in Ant Credit Pay

NetDP: An Industrial-Scale Distributed Network Representatio...

引用

IEEE International Conference on Big Data (Big Data)

作者： Lin, Jianbin Zhang, Zhiqiang Zhou, Jun Li, Xiaolong Fang, Jingli Fang, Yanming Yu, Quan Qi, Yuan Ant Financial Serv Grp Hangzhou Zhejiang Peoples R China

ISBN: (纸本)9781538650356

Ant Credit Pay is a consumer credit service in Ant Financial Service Group. Similar to credit card, loan default is one of the major risks of this credit product. Hence, effective algorithm for default prediction is the key to losses reduction and profits increment for the company. However, the challenges facing in our scenario are different from those in conventional credit card service. The first one is scalability. The huge volume of users and their behaviors in Ant Financial requires the ability to process industrial-scale data and perform model training efficiently. The second challenges is the cold-start problem. Different from the manual review for credit card application in conventional banks, the credit limit of Ant Credit Pay is automatically offered to users based on the knowledge learned from big data. However, default prediction for new users is suffered from lack of enough credit behaviors. It requires that the proposal should leverage other new data source to alleviate the cold-start problem. Considering the above challenges and the special scenario in Ant Financial, we try to incorporate default prediction with network information to alleviate the cold-start problem. In this paper, we propose an industrial-scale distributed network representation framework, termed NetDP, for default prediction in Ant Credit Pay. The proposal explores network information generated by various interaction between users, and blends unsupervised and supervised network representation in a unified framework for default prediction problem. Moreover, we present a parameter-server-based distributed implement of our proposal to handle the scalability challenge. Experimental results demonstrate the effectiveness of our proposal, especially in cold-start problem, as well as the efficiency for industrial-scale dataset.

关键词： Financial Application Network Representation distributed algorithm Industrial-Scale Application

来源：评论

学校读者我要写书评

暂无评论

When distributed Outperforms Centralized Scheduling in D2D-Enabled Cellular Networks 18

When Distributed Outperforms Centralized Scheduling in D2D-E...

引用

21st ACM International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems (MSWiM)

作者： Ibrahim, Rita Assaad, Mohamad Sayrac, Berna Gati, Azeddine Orange Labs Paris France TCL Chair 5G Lab Signaux & Syst Gif Sur Yvette France

ISBN: (纸本)9781450359603

Device-to-device (D2D) communications is a promising technique for improving the efficiency of 5G networks. Employing channel adaptive resource allocation can yield to a large enhancement in almost any performance metric of D2D communications (e.g. Energy Efficiency). Centralized approaches require the knowledge of D2D links' Channel State Information (CSI) at the BS level. However, CSI reporting suffers from the limited number of resources available for feedback transmission. Alternately, we propose a distributed algorithm for resource allocation that benefits from the users' knowledge of their local CSI in order to minimize the users' transmission power while maintaining predefined throughput constraint. The key idea is that users compute their local performance metrics (e.g. energy efficiency) and then use a new signaling mechanism to share these values between each other. Under some condition, the performance of this distributed algorithm achieves that of the ideal scheduling (i.e. with a global CSI knowledge of all the D2D links). We describe how this technique can be simply implemented by adapting existing CSI reporting (e.g. in Long-Term Evolution (LTE) systems). Furthermore, numerical results are presented to corroborate our claims and demonstrate the gain that the proposed distributed scheduling brings to cellular networks compared to the best centralized-limited feedback scheduling.(1)

关键词： Device-to-device Scheduling Resource allocation distributed algorithm CSI Feedback

来源：评论

学校读者我要写书评

暂无评论

distributed Graph Routing for WirelessHART Networks 18

Distributed Graph Routing for WirelessHART Networks

引用

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

作者： Modekurthy, Venkata P. Saifullah, Abusayeed Madria, Sanjay Wayne State Univ Dept Comp Sci Detroit MI 48202 USA Missouri Univ Sci & Tech Dept Comp Sci Rolla MO USA

ISBN: (纸本)9781450363723

Communication reliability in a Wireless Sensor and Actuator Network (WSAN) has a high impact on stability of industrial process monitoring and control. To make reliable and real-time communication in highly unreliable environments, industrial WSANs such as those based on WirelessHART adopt graph routing. In graph routing, each packet is scheduled on multiple time slots using multiple channels, on multiple links along multiple paths on a routing graph between a source and a destination. While high redundancy is crucial to reliable communication, determining and maintaining graph routing is challenging in terms of execution time and energy consumption for resource constrained WSAN. Existing graph routing algorithms use centralized approach, do not scale well in terms of these metrics, and are less suitable under network dynamics. To address these limitations, we propose the first distributed graph routing protocol for WirelessHART networks. Our distributed protocol is based on the Bellman-Ford algorithm, and generates all routing graphs together using a single algorithm. We prove that our proposed graph routing can include a path between a source and a destination with cost (in terms of hop-count) at most 3 times the optimal cost. We implemented our proposed routing algorithm on TinyOS and evaluated through experiments on TelosB motes and simulations using TOSSIM. The results show that it is scalable and consumes at least 40% less energy and needs at least 65% less time at the cost of 1kB of extra memory compared to the state-of-the-art centralized approach for generating routing graphs.

关键词： Graph Routing Wireless Sensor Actuator Networks WirelessHART distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

Maximum network lifetime with optimal power/rate and routing trade-off for Wireless Multimedia Sensor Networks

引用

COMPUTER COMMUNICATIONS 2018年 124卷 1-16页

作者： Khernane, Nesrine Couchot, Jean-Francois Mostefaoui, Ahmed Univ Bourgogne Franche Comte FEMTO ST Inst DISC Dept F-9000 Belfort France

Wireless Multimedia Sensor Networks (WMSN) are today considered as a promising technology, notably because of the availability of miniaturized multimedia hardware (e.g., CMOS cameras). Nevertheless, they do raise new research challenges;i.e., multimedia content is much more voluminous and rich in comparison to scalar one. Hence, multimedia data need pre-processing, namely coding, before they are delivered to the sink. In WMSN, meeting the required visual quality at the sink whilst taking into account the intrinsic network limitations, energy in particular, remains very challenging. In fact, higher visual quality of the data increases its volume, which in turn consumes more network resources and vice versa. The problem is more complex when including the data routing, especially when the routing is initially unknown. In this paper, we focus on the problem of simultaneously optimizing the video encoding at the source nodes and the routing of the generated data (i.e., the routing matrix is initially unknown) to the sink in order to maximize the network lifetime. This issue is tackled through the proposition of an analytic model. Based on the latter, two solutions have been studied. In the first one, of a static nature (i.e., network topology is static), the routes are calculated using the shortest path routing protocol toward the sink. The evaluation we made has shown that our proposed solution consumes less than 0.030% of the total battery while it increases the whole network lifetime nearly between 7 and 12 times, depending on the considered topologies, in comparison to the baseline approach (i.e., without optimization). Afterwards, in order to handle dynamic topology changes and to consider the link reliability, the work have been extended to the selection of routing paths, in a fully distributed fashion (i.e., using a local decision hop-by-hop routing protocol) with respect to both the shortest ones and their reliability. The second solution was evaluated through tw

关键词： WMSNs Video quality Routing Network lifetime distributed algorithm Encoding power Source rate Reliability

来源：评论

学校读者我要写书评

暂无评论

Analysis of Noise Impact on distributed Average Consensus 27

Analysis of Noise Impact on Distributed Average Consensus

引用

Conference on Signal Processing, Sensor/Information Fusion, and Target Recognition XXVII

作者： Li, Boyuan Leung, Henry Seneviratne, Chatura Univ Calgary Dept Elect & Comp Engn Calgary AB T2N 1N4 Canada

ISBN: (数字)9781510618046

ISBN: (纸本)9781510618046

This paper considers the problem of distributed average consensus in a noisy sensor network in which noise will cause error bits and detriment the accuracy of the results. We use a bit-flipping model to model the noise effect and show that it will lead to biased results. We propose here an unbiased average consensus algorithm for noisy networks with dynamic topologies. We analyze the convergence speed and the mean square error and show that the noise can be suppressed by our method. The proposed algorithm is found effective in a network simulation with and without perfect bit error rate information.

关键词： Sensor network distributed algorithm average consensus noise bit error convergence speed

来源：评论

学校读者我要写书评

暂无评论

DIFFERENTIALLY PRIVATE distributed PRINCIPAL COMPONENT ANALYSIS

DIFFERENTIALLY PRIVATE DISTRIBUTED PRINCIPAL COMPONENT ANALY...

引用

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

作者： Imtiaz, Hafiz Sarwate, Anand D. Rutgers State Univ Dept Elect & Comp Engn New Brunswick NJ 08901 USA

ISBN: (纸本)9781538646588

Differential privacy is a cryptographically-motivated formal privacy definition that is robust against strong adversaries. The principal component analysis (PCA) algorithm is frequently used in signal processing, machine learning, and statistics pipelines. In many scenarios, private or sensitive data is distributed across different sites: in this paper we propose a differentially private distributed PCA scheme to enable collaborative dimensionality reduction. We investigate the performance of the proposed algorithm on synthetic and real datasets and show empirically that our algorithm can reach the same level of utility as the non-private PCA for some parameter choices, which indicates that it is possible to have meaningful utility while preserving privacy.

关键词： principal component analysis differential privacy distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：