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

Dynamic Barrier Coverage in a Wireless Sensor Network for Smart Grids

SENSORS 2019年第1期19卷 41-41页

作者： Fan, Fei Ji, Qiaoling Wu, Gongping Wang, Man Ye, Xuhui Mei, Quanjie Wuhan Univ Sch Power & Mech Engn Wuhan 430072 Hubei Peoples R China Wuhan Text Univ Sch Mech Engn & Automat Wuhan 430073 Hubei Peoples R China

The development of engineering technology such as inspection robots (IR) for transmission lines and wireless sensor networks (WSN) are widely used in the field of smart grid monitoring. However, how to integrate inspection robots into wireless sensor networks is still a great challenge to form an efficient dynamic monitoring network for transmission lines. To address this problem, a dynamic barrier coverage (DBC) method combining inspection robot and wireless sensor network (WSN) is proposed to realize a low-cost, energy-saving and dynamic smart grid-oriented sensing system based on mobile wireless sensor network. To establish an effective smart grid monitoring system, this research focuses on the design of an effective and safe dynamic network coverage and network nodes deployment method. Multiple simulation scenarios are implemented to explore the variation of network performance with different parameters. In addition, the dynamic barrier coverage method for the actual scene of smart grid monitoring considers the balance between network performance and financial costs.

关键词： barrier coverage wireless sensor network smart grid inspection robot delay-tolerant sensor network real-time network ordinal potential game distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

Time Reusing in D2D-Enabled Cooperative Networks

引用

IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS 2018年第5期17卷 3185-3200页

作者： Zhu, Zhaowei Jin, Shengda Yang, Yang Hu, Honglin Luo, Xiliang ShanghaiTech Univ Sch Informat Sci & Technol Shanghai 201210 Peoples R China Chinese Acad Sci Shanghai Inst Microsyst & Informat Technol Shanghai 201210 Peoples R China Shanghai Inst Fog Comp Technol Shanghai 201210 Peoples R China Chinese Acad Sci Shanghai Adv Res Inst Shanghai 201210 Peoples R China

Device-to-device (D2D) communication has become one important part of next-generation mobile networks particularly due to the booming of proximity-based services, e.g. the ProSe standardized in LTE. However, D2D communications may create strong interference to nearby users that are sharing the same spectrum. Thus, interference management in a D2D-enabled cooperative network is critical. In this paper, the time reuse problem and its distributed solution in a D2D-enabled cooperative network are investigated. Even though the total number of possible time reuse patterns increases exponentially with the quantity of the users, the authors first show that the optimal network performance can be achieved by only activating a limited number of time reuse patterns. The effects of the incentive mechanism on the reuse pattern selection are also investigated. Meanwhile, the set of active reuse patterns are determined efficiently with the Frank-Wolfe method. For a specific set of active time reuse patterns, the authors further show that the optimal resource allocation problem can be formulated as one consensus-building problem. Based on the alternating-direction method of multipliers, one low-complexity algorithm is proposed to determine the optimal resource allocations in a distributed fashion. Numerical simulations are carried out to corroborate our designs.

关键词： Cooperative network heterogeneous network distributed algorithm device-to-device D2D time reuse user association fog computing

来源：评论

学校读者我要写书评

暂无评论

k-Connectivity Estimation from Local Neighborhood Information in Wireless Ad hoc and Sensor Networks

<i>k</i>-Connectivity Estimation from Local Neighborhood Inf...

引用

IEEE International Black Sea Conference on Communications and Networking (BlackSeaCom)

作者： Akram, Vahid Khalilpour Dagdeviren, Orhan Ege Univ Int Comp Inst Izmir Turkey

ISBN: (纸本)9781538670910

A robust wireless ad hoc and sensor network tolerates the failures of nodes without losing its connectivity. A network is k-connected if it remains connected after failures in any k - 1 nodes. Finding the k value in a WSN provides useful information about its robustness and reliability. In this paper, we propose a distributed algorithm that provides more accurate estimations than the existing solutions by collecting the upper and lower bounds of local estimations in a single node and taking the average of selected bound. The comprehensive simulation results reveal that the proposed algorithm finds up to 10% more accurate estimations and up to 37% lower mean square error values with lower energy consumption than its closest competitor.

关键词： Wireless Sensor Networks Wireless Ad hoc Networks k-Connectivity Fault Tolerance distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

The Complexity of Leader Election: A Chasm at Diameter Two 18

The Complexity of Leader Election: A Chasm at Diameter Two

引用

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

作者： Chatterjee, Soumyottam Pandurangan, Gopal Robinson, Peter Univ Houston Dept Comp Sci Houston TX 77204 USA Royal Holloway Univ London Dept Comp Sci Egham Surrey England

ISBN: (纸本)9781450363723

Leader election is one of the fundamental problems in distributed computing. In its implicit version, only the leader must know who is the elected leader. This paper focuses on studying the message complexity of leader election in synchronous distributed networks, in particular, in networks of diameter two. Kutten et al. [JACM 2015] showed a fundamental lower bound of Omega (m) (m is the number of edges in the network) on the message complexity of (implicit) leader election that applied also to Monte Carlo randomized algorithms with constant success probability;this lower bound applies for graphs that have diameter at least three. On the other hand, for complete graphs (i.e., diameter 1), Kutten et al. [TCS 2015] established a tight bound of (Theta) over tilde(root n)(1) on the message complexity of randomized leader election (n is the number of nodes in the network). For graphs of diameter two, the complexity was not known. In this paper, we settle this complexity by showing a tight bound of (Theta) over tilde (n) on the message complexity of leader election in diameter two networks. We first give a simple randomized Monte-Carlo leader election algorithm that with high probability (i.e., probability at least 1 - n(-c), for some positive constant c) succeeds and uses O (n log(3) n) messages and runs in O(1) rounds;this algorithm works without knowledge of n (and hence needs no global knowledge). We then show that any algorithm (even Monte Carlo randomized algorithms with large enough constant success probability) needs Omega(n) messages (even when n is known), regardless of the number of rounds. We also present an O(n log n) messages deterministic algorithm that takes O(log n) rounds (but needs knowledge of n);we show that this message complexity is tight for deterministic algorithms. Our results show that leader election can be solved in diameter two graphs in (essentially) linear (in n) message complexity and thus the Omega(m) lower bound does not apply to diamete

关键词： distributed algorithm Leader Election Randomized algorithm Message Complexity Time Complexity Lower Bounds

来源：评论

学校读者我要写书评

暂无评论

Message Reduction in the LOCAL Model is a Free Lunch 19

Message Reduction in the LOCAL Model is a Free Lunch

引用

Proceedings of the 2019 ACM Symposium on Principles of distributed Computing

作者： Shimon Bitton Yuval Emek Taisuke Izumi Shay Kutten Technion - Israel Institute of Technology Haifa Israel Technion - Israel Institute of Technology Haifa Japan Nagoya Institute of Technology Nagoya Japan Nagoya Institute of Technology Haifa Israel

ISBN: (纸本)9781450362177

A new spanner construction algorithm is presented, working under the LOCAL model assuming unique edge IDs. Given an n-node communication graph, a spanner with a constant stretch and Õ(n1 + c) edges (for any small constant c > 0) is constructed efficiently --- i.e., in a constant number of rounds and a message complexity of Õ (n1 + 2c) *** of the many known applications of spanners is for reducing the number of messages of various algorithms. However, usually, one still needs to pay the cost of constructing the spanner. Due to the efficiency of the spanner construction here, we show that every t-round LOCAL algorithm can be transformed into a randomized one with the same asymptotic time complexity and Õ(t2n1 + O(1/log t)) message complexity. All previous message-reduction schemes for LOCAL algorithms incur either an O(log n)-multiplicative or an O(polylog (n))-additive blow-up of the round complexity.

关键词： local model distributed algorithm spanner

来源：评论

学校读者我要写书评

暂无评论

Applying the Delta Method in Metric Analytics: A Practical Guide with Novel Ideas 18

Applying the Delta Method in Metric Analytics: A Practical G...

引用

24th ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD)

作者： Deng, Alex Knoblich, Ulf Lu, Jiannan Microsoft Corp Redmond WA 98052 USA

ISBN: (纸本)9781450355520

During the last decade, the information technology industry has adopted a data-driven culture, relying on online metrics to measure and monitor business performance. Under the setting of big data, the majority of such metrics approximately follow normal distributions, opening up potential opportunities to model them directly without extra model assumptions and solve big data problems via closed-form formulas using distributed algorithms at a fraction of the cost of simulation-based procedures like bootstrap. However, certain attributes of the metrics, such as their corresponding data generating processes and aggregation levels, pose numerous challenges for constructing trustworthy estimation and inference procedures. Motivated by four real-life examples in metric development and analytics for large-scale A/B testing, we provide a practical guide to applying the Delta method, one of the most important tools from the classic statistics literature, to address the aforementioned challenges. We emphasize the central role of the Delta method in metric analytics by highlighting both its classic and novel applications.

关键词： A/B testing big data distributed algorithm large sample theory online metrics randomization quantile inference longitudinal study

来源：评论

学校读者我要写书评

暂无评论

Bilaterally Open Electricity Markets with High Penetration of Renewables 14

Bilaterally Open Electricity Markets with High Penetration o...

引用

14th IEEE International Conference on Control and Automation (ICCA)

作者： Liu, Xianglu You, Pengcheng Yang, Zaiyue Yang, Qinmin Zhejiang Univ Coll Control Sci & Engn State Key Lab Ind Control Technol Hangzhou Peoples R China Southern Univ Sci & Technol Dept Mech & Energy Engn Shenzhen Peoples R China

ISBN: (纸本)9781538660898

This paper investigates a multi-generator-multi-consumer scenario in a day-ahead electricity market with high penetration of renewable energy and price-sensitive consumers. The electricity generated by renewables will also be traded in the market. To take care of both the supply and demand sides as well as achieve a balance in between, we propose a two-folded clearing mechanism. Specifically, at the demand side, we adopt an evolutionary game to model the selection behavior of the population of consumers, while at the supply side, a distributed optimization approach is employed to maximize the profit of generators. Finally, simulation results show that the proposed mechanism converges fast to clear the market. In addition, sensitivity analyses are carried out to assess the impact from the risk tolerance of consumers.

关键词： Day-ahead market renewable generation evolutionary game pricing mechanism distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

Learning-based Acoustic Source Localization in Acoustic Sensor Networks using the Coherent-to-Diffuse Power Ratio 26

Learning-based Acoustic Source Localization in Acoustic Sens...

引用

European Signal Processing Conference (EUSIPCO)

作者： Brendel, Andreas Kellermann, Walter Friedrich Alexander Univ Erlangen Nurnberg Multimedia Commun & Signal Proc Cauerstr 7 D-91058 Erlangen Germany

ISBN: (纸本)9789082797015

A distributed learning-based algorithm for the localization of acoustic sources in an acoustic sensor network is proposed. It is based on estimates of the Coherent-to-Diffuse Power Ratio (CDR), which serve as feature for the source-microphone distance, i.e., the range. The relation between the estimated CDR and the range is learned by using Gaussian processes for non-parametric regression. The range estimates obtained from evaluating the regression function are fused by a weighted least squares estimation, which is implemented recursively, allowing for a distributed version of the algorithm. The resulting method is computationally efficient, works in highly reverberant and noisy scenarios and needs only a small amount of data shared over the network. The training phase of the algorithm requires only a few labeled observations. We show the efficacy of the approach with data obtained from image-source simulation.

关键词： Coherent-to-Diffuse Power Ratio Gaussian Process Regression Weighted Least Squares distributed algorithm Acoustic Sensor Network Localization

来源：评论

学校读者我要写书评

暂无评论

An Interest Shaping Mechanism in NDN: Joint Congestion Control and Traffic Management

An Interest Shaping Mechanism in NDN: Joint Congestion Contr...

引用

IEEE International Conference on Communications (ICC) / Workshop on Integrating UAVs into 5G

作者： Yang, Weihong Qin, Yang Yang, Yuanyuan Harbin Inst Technol Shenzhen Dept Comp Sci Shenzhen Peoples R China SUNY Stony Brook Dept Elect & Comp Engn Stony Brook NY 11794 USA SUNY Stony Brook Dept Comp Sci Stony Brook NY 11794 USA

ISBN: (纸本)9781538631805

Congestion control is one of the most critical issues in Named Data Networking (NDN). Compared to traditional Internet, NDN has some new features: receiver-driven, in-network caching, hop-by-hop forwarding, etc. These new features pose new challenges for designing congestion control mechanism. Congestion in NDN is mainly caused by Data packets, thus, shaping the transmission rate of Interest packet can regulate the returning rate of Data packet. In this paper, we propose an Interest shaping mechanism to tackle congestion in NDN by controlling Interest packet transmission rate in an optimized way. We formulate the rate allocation problem as a global optimization problem via jointly considering congestion control and traffic management. In order to achieve traffic management objective, we add an extra term in utility function to penalize over-loaded links. By applying partial dual decomposition, we solve the optimization problem with a gradient-based algorithm and we prove that gradient-based algorithm converges to optimality of optimization. Then, we present a practical implementation of this algorithm. Finally, we conduct simulation in ndnSIM to evaluate performance of the proposed mechanism by comparing with other existing methods. Simulation results show that our proposed mechanism can achieve high ratio of satisfied Interest, low delay and packet drop rate. The proposed mechanism can also achieve fairness among flows though the link utilization may not be high.

关键词： named data networking (NDN) congestion control traffic management convex optimization distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

Uniform Circle Formation by Mobile Robots 18

Uniform Circle Formation by Mobile Robots

引用

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

作者： Mondal, Moumita Chaudhuri, Sruti Gan Future Inst Technol Kolkata W Bengal India Jadavpur Univ Kolkata W Bengal India

This paper describes a distributed algorithm for swarm robots to form a uniform circle which can be required for guarding or covering an geographical boarder by a group of robots.

ISBN: (纸本)9781450363976

This paper describes a distributed algorithm for swarm robots to form a uniform circle which can be required for guarding or covering an geographical boarder by a group of robots.

关键词： Mobile Robots Uniform Circle Formation distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：