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

Topology Control algorithms for Wireless Sensor Networks: A Review

WIRELESS PERSONAL COMMUNICATIONS 2020年第4期113卷 2363-2385页

作者： Singla, Pallavi Munjal, Amit Thapar Inst Engn & Technol Patiala Punjab India

Wireless sensor networks (WSN) are widely used in various domains such as military, health applications, environmental applications, structural monitoring, agriculture sectors etc. In WSN Topology control is fundamental approach in which link establishment is in such a way that energy consumption is minimized. This helps in increasing the network lifetime. In this paper, we have attempted to present a review of different existing topology control algorithms in literature. We have summarized all these existing on the basis of different performance metrics such as energy consumption, network lifetime, delay, energy cost etc. Finally this paper supports the reader an idea to select the topology control for the desired application.

关键词： centralized algorithm Distributed algorithm Direction based Location based Topology control

来源：评论

学校读者我要写书评

暂无评论

On generalized max-min rate allocation and distributed convergence algorithm for packet networks

引用

IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS 2004年第5期15卷 401-416页

作者： Hou, YT Panwar, SS Tzeng, HHY Virginia Tech Bradley Dept Elect & Comp Engn Blacksburg VA 24061 USA Polytech Univ Dept Elect & Comp Engn Brooklyn NY 11201 USA Nokia Networks Div Mountain View CA 94043 USA

This paper considers the fundamental problem of bandwidth allocation among flows in a packet-switched network. The classical max-min rate allocation has been widely regarded as a fair rate allocation policy. But, for a flow with a minimum rate requirement and a peak rate constraint, the classical max-min policy no longer suffices to determine rate allocation since it is not capable of supporting either the minimum rate or the peak rate constraint from a flow. In this paper, we generalize the theory of the classical max-min rate allocation with the support of both the minimum rate and peak rate constraints for each flow. Additionally, to achieve generalized max-min rate allocation in a fully distributed packet network, we present a distributed algorithm that uses a feedback- based flow control mechanism. Our design not only offers a fresh perspective on flow marking technique, but also advances the state-of-the-art flow marking technique favored by other researchers. We provide proof that such a distributed algorithm, through asynchronous iterations, will always converge to the generalized max-min rate allocation under any network configuration and any set of link distances. We use simulation results to demonstrate the fast convergence property of the distributed algorithm.

关键词： max-min rate allocation minimum rate peak rate centralized algorithm distributed algorithm convergence flow control packet networks

来源：评论

学校读者我要写书评

暂无评论

Anomaly Detection in Discrete Manufacturing Systems by Pattern Relation Table Approaches

引用

SENSORS 2020年第20期20卷 5766页

作者： Sun, Xinmiao Li, Ruiqi Yuan, Zhen Univ Sci & Technol Beijing Sch Automat & Elect Engn Beijing 100083 Peoples R China Beijing Univ Chem Technol Coll Informat Sci & Technol Beijing 100029 Peoples R China

Anomaly detection for discrete manufacturing systems is important in intelligent manufacturing. In this paper, we address the problem of anomaly detection for the discrete manufacturing systems with complicated processes, including parallel processes, loop processes, and/or parallel with nested loop sub-processes. Such systems can generate a series of discrete event data during normal operations. Existing methods that deal with the discrete sequence data may not be efficient for the discrete manufacturing systems or methods that are dealing with manufacturing systems only focus on some specific systems. In this paper, we take the middle way and seek to propose an efficient algorithm by applying only the system structure information. Motivated by the system structure information that the loop processes may result in repeated events, we propose two algorithms-centralized pattern relation table algorithm and parallel pattern relation table algorithm-to build one or multiple relation tables between loop pattern elements and individual events. The effectiveness of the proposed algorithms is tested by two artificial data sets that are generated by Timed Petri Nets. The experimental results show that the proposed algorithms can achieve higher AUC and F1-score, even with smaller sized data set compared to the other algorithms and that the parallel algorithm achieves the highest performance with the smallest data set.

关键词： anomaly detection discrete manufacturing systems pattern relation table centralized algorithm parallel algorithm Timed Petri Net

来源：评论

学校读者我要写书评

暂无评论

Cooperative distributed target tracking algorithm in mobile wireless sensor networks

引用

控制理论与应用（英文版） 2011年第2期9卷 155-164页

作者： Chen, Wei Fu, Yinfei Department of Automation Hefei University of Technology Hefei Anhui 230009 China Department of Electrical Engineering Michigan Technology University Houghton Michigan 49931-1295 United States

The paper proposes a cooperative distributed target tracking algorithm in mobile wireless sensor *** are two main components in the algorithm:distributed sensor-target assignment and sensor motion *** the key idea of the sensor-target assignment,sensors are considered as autonomous agents and the defined objective function of each sensor concentrates on two fundamental factors:the tracking accuracy and the tracking *** with the centralized algorithm and the noncooperative distributed algorithm,the proposed approach will not only lead to reasonable measuring performance but also benefit system with low computational complexity and communication ***,a sensor motion algorithm based on gradient control is presented in the paper to trace the targets to reduce tracking *** results show that the cooperative distributed sensor assignment algorithm has advantages over the centralized algorithm without sacrificing much tracking performance.

关键词： Mobile wireless sensor networks Target tracking Sensor assignment Distribute algorithm centralized algorithm

来源：评论

学校读者我要写书评

暂无评论

Power efficient monitoring management in sensor networks

Power efficient monitoring management in sensor networks

引用

IEEE Wireless Communications and Networking Conference

作者： Berman, P Calinescu, G Shah, C Zelikovsky, A Penn State Univ Dept Comp Sci & Engn University Pk PA 16802 USA

ISBN: (纸本)0780383443

Optimizing the energy consumption in wireless sensor networks has recently become the most important performance objective. We assume the sensor network model in which sensors can interchange idle and active modes. Given monitoring regions, battery life and energy consumption rate for each sensor, we formulate the problem of maximizing sensor network lifetime, i.e., time during which the monitored area is (partially or fully) covered. Our contributions include (1) an efficient data structure to represent the monitored area with at most n(2) points guaranteeing the full coverage which is superior to the previously used approach based on grid points, (2) efficient provably good centralized algorithms for sensor monitoring schedule maximizing the total lifetime including (1 + ln (1 - q)(-1))-approximation algorithm for the case when a q-portion of the monitored area is required to cover, e.g., for the 90% area coverage our schedule guarantees to he at most 3.3 times shorter than the optimum, (4) a family of efficient distributed protocols with trade-off between communication and monitoring power consumption, (5) extensive experimental study of the proposed algorithms showing significant advantage in quality, scalability and flexibility.

关键词： wireless sensor networks telecommunication network management condition monitoring distributed algorithms protocols optimisation power efficient monitoring management wireless sensor network energy consumption optimization sensor mode battery life consumption network lifetime data structure grid point centralized algorithm sensor monitoring schedule distributed protocol power consumption

来源：评论

学校读者我要写书评

暂无评论

On Geometric Shape Construction via Growth Operations 1

引用

18th International Symposium on algorithmics of Wireless Networks

作者： Almalki, Nada Michail, Othon Univ Liverpool Dept Comp Sci Liverpool Merseyside England

ISBN: (数字)9783031220500

ISBN: (纸本)9783031220494;9783031220500

In this work, we investigate novel algorithmic growth processes. Our system runs on a 2-dimensional grid and operates in discrete time steps. The growth process begins with an initial shape of nodes S-I = S-0 and, in every time step t >= 1, by applying (in parallel) one or more growth operations of a specific type to the current shape-instance St-1, generates the next instance St, always satisfying vertical bar S-t vertical bar > vertical bar St-1 vertical bar. Our goal is to characterize the classes of shapes that can be constructed in O(log n) or polylog n time steps, n being the size of the final shape S-F, and determine whether a shape S-F can be constructed from an initial shape S-I using a finite sequence of growth operations of a given type, called a constructor of S-F. In particular, we propose three growth operations, full doubling, row and column doubling, which we call RC doubling, and doubling, and explore the algorithmic and structural properties of their resulting processes under a geometric setting. For full doubling, in which, in every time step, every node generates a new node in a given direction, we completely characterize the structure of the class of shapes that can be constructed from a given initial shape. For RC doubling, in which complete columns or rows double, our main contribution is a linear-time centralized algorithm that for any pair of shapes S-I, S-F decides if S-F can be constructed from S-I and, if the answer is yes, returns an O(log n)-time step constructor of S-F from S-I. For the most general doubling operation, where a subset of individual nodes can double, we show that some shapes cannot be constructed in sublinear time steps and give two universal constructors of any S-F from a singleton S-I, which are efficient (i.e., up to polylogarithmic time steps) for large classes of shapes. Both constructors can be computed by polynomial-time centralized algorithms for any shape S-F.

关键词： centralized algorithm Geometric growth operations Programmable matter Constructor

来源：评论

学校读者我要写书评

暂无评论

Method for cluster heads selection in wireless sensor networks

Method for cluster heads selection in wireless sensor networ...

引用

IEEE Aerospace Conference

作者： Tillapart, P Thumthawatworn, T Pakdeepinit, P Yeophantong, T Charoenvikrom, S DaenDej, J Assumption Univ Fac Sci & Technol St Gabriels Telecommun Lab Bangkok 10240 Thailand

ISBN: (纸本)0780381556

Recently wireless sensor networks have become one of the most interesting networking technologies since it can be deployed without the need of a communication infrastructure. Several applications such as wild life sensing, surveillance, premise monitoring and in space environment exploit the strengths of wireless sensor networks. In general, there is one major concern with this technology. That is, it should have a long lasting system lifetime. One of the key factors to achieve this is to resourcefully utilize sensor nodes' energy. Cluster-based sensor networks are one of a kind. In such systems node's energy, which is the main factor, is used to select cluster heads. However, node's energy should not be the primary factor to select cluster heads. A system called HYENAS which employs both centralized and distributed algorithm to form clusters is proposed in this paper. This system takes into consideration not only node's energy, but also node's location and movement to select cluster heads.

关键词： wireless sensor networks distributed algorithms case-based reasoning time division multiple access pattern clustering cluster heads selection communication infrastructure wild life sensing premise monitoring surveillance sensor nodes energy distributed algorithm centralized algorithm cluster based sensor networks case based reasoning hybrid energy aware sensor network HYENAS time division multiple access Wireless sensor networks distributed algorithms Case Based Reasoning Communications infrastructure Cluster Analysis Head

来源：评论

学校读者我要写书评

暂无评论

LINEAR SPEEDUP IN SADDLE-POINT ESCAPE FOR DEcentralized NON-CONVEX OPTIMIZATION

LINEAR SPEEDUP IN SADDLE-POINT ESCAPE FOR DECENTRALIZED NON-...

引用

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

作者： Vlaski, Stefan Sayed, Ali H. Ecole Polytech Fed Lausanne Sch Engn Lausanne Switzerland

ISBN: (纸本)9781509066315

Under appropriate cooperation protocols and parameter choices, fully decentralized solutions for stochastic optimization have been shown to match the performance of centralized solutions and result in linear speedup (in the number of agents) relative to noncooperative approaches in the strongly-convex setting. More recently, these results have been extended to the pursuit of first-order stationary points in non-convex environments. In this work, we examine in detail the dependence of second-order convergence guarantees on the spectral properties of the combination policy for non-convex multi agent optimization. We establish linear speedup in saddle-point escape time in the number of agents for symmetric combination policies and study the potential for further improvement by employing asymmetric combination weights. The results imply that a linear speedup can be expected in the pursuit of second-order stationary points, which exclude local maxima as well as strict saddle-points and correspond to local or even global minima in many important learning settings.

关键词： Non-convex optimization saddle-point second-order stationarity minima decentralized algorithm centralized algorithm diffusion strategy

来源：评论

学校读者我要写书评

暂无评论

Energy Efficient Cooperative Broadcasting in Wireless Networks

Energy Efficient Cooperative Broadcasting in Wireless Networ...

引用

IEEE International Conference on Communications (ICC 2009)

作者： Si, JiangBo Li, Zan Liu, ZengJi Chen, XiaoJun Xidian Univ State Key Lab Integrated Serv Networks Xian 710071 Peoples R China

ISBN: (纸本)9781424434343

Minimizing the total transmission power is one of the main objectives of efficient broadcast algorithms in wireless networks, where all nodes are powered by battery with limited energy supply. Cooperative transmission is an important way to make full use of the space diversity and can save the transmission power significantly, especially in the wireless broadcast transmission, where the nodes can accumulate the overheard information. In this paper, firstly a centralized cooperative broadcast algorithm, which permits multiple nodes to cooperate in transmitting the broadcast message, is proposed to save the total transmission power. Considering that the centralized algorithm requiring a global knowledge of the networks is impractical in large wireless networks, the distributed version of the centralized algorithm requiring only 1-hop neighborhood information is proposed under the assumption that limited frequency band is available. The distributed algorithm combines the physical (PHY) and medium-access-control (MAC) layer mechanisms to reach all the nodes in a cooperative way. Though the proposed distributed algorithm is inferior to the centralized algorithm in terms of total transmission power, it takes less resource to broadcast than the centralized algorithms. Simulation results show that both the centralized algorithm and distributed algorithm can get a better performance than the existing broadcast algorithms. Furthermore, the distributed algorithm can achieve the total transmission power close to the centralized algorithm.

关键词： Cooperative Broadcasting centralized algorithm Energy Efficient Distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

The Effect of Imperfect CSI in a Multi-Cell Multi-User MIMO System 79

The Effect of Imperfect CSI in a Multi-Cell Multi-User MIMO ...

引用

IEEE 79th Vehicular Technology Conference (VTC-Spring)

作者： Tervo, Oskari Komulainen, Petri Juntti, Markku Univ Oulu Ctr Wireless Commun FI-90014 Oulu Finland

ISBN: (纸本)9781479944828

One of the promising candidates for mitigating the inter-cell interference in multi-cell networks is coordinated beamforming (CB), where cells are allowed to cooperate such that the transmission from each cell takes into account the interference it would cause to the users of other cells. In this work, we study the performance of a centralized algorithm which enables beam coordination in multi-cell multi-user multiple-input multiple-output (MIMO) network. The algorithm aims at maximizing the weighted sum rate (WSR) via weighted sum mean squared error (WSMSE) minimization, taking into account the estimation noise of channel state information (CSI). The performance is studied in a seven-cell network and the numerical results show that also with inaccurate CSI, CB outperforms traditional orthogonal access (OA) scheme where the same frequency resources are not reused between cells.

关键词： MIMO communication array signal processing channel estimation intercarrier interference mean square error methods multiuser channels CSI WSMSE minimization WSR beam coordination centralized algorithm channel state information coordinated beamforming estimation noise frequency resources intercell interference multi-cell multiuser MIMO network multi-cell multiuser multiple-input multiple-output network multi-cell networks weighted sum mean squared error minimization weighted sum rate Base stations Channel estimation Interference MIMO Optimization Signal to noise ratio Uncertainty channel estimation Mean square error inter-cell interference multiple input multiple output systems multiuser channels signal to noise ratios MIMO communication intercarrier interference Channel state information BASE STATION array signal processing weight sums Biological neural networks interference

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：