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

A localized algorithm for Structural Health Monitoring using wireless sensor networks

INFORMATION FUSION 2014年第1期15卷 114-129页

作者： dos Santos, Igor Leao Pirmez, Luci Lemos, Erico T. Delicato, Flavia C. Vaz Pinto, Luiz A. Neuman de Souza, J. Zomaya, Albert Y. Univ Fed Rio de Janeiro INCE BR-21941916 Rio De Janeiro RJ Brazil Univ Fed Rio de Janeiro DCC BR-21941916 Rio De Janeiro RJ Brazil Univ Fed Rio de Janeiro Dept Engn Naval & Ocean BR-21941909 Rio De Janeiro RJ Brazil Univ Fed Ceara BR-60455760 Fortaleza Ceara Brazil Univ Sydney Sch Informat Technol Adv Networks Res Grp Sydney NSW 2006 Australia

Structural Health Monitoring (SHM) has been proving to be a suitable application domain for wireless sensor networks, whose techniques attempt to autonomously evaluate the integrity of structures, occasionally aiming at detecting and localizing damage. In this paper, we propose a localized algorithm supported by multilevel information fusion techniques to enable detection, localization and extent determination of damage sites using the resource constrained environment of a wireless sensor network. Each node partakes in different network tasks and has a localized view of the whole situation, so collaboration mechanisms and multilevel information fusion techniques are key components of this proposal to efficiently achieve its goal. Experimental results with the MICAz mote platform showed that the algorithm performs well in terms of network resources utilization. (C) 2012 Elsevier B.V. All rights reserved.

关键词： Wireless sensor networks Structural Health Monitoring Damage localization localized algorithm Information fusion Resource constrained networks

来源：评论

学校读者我要写书评

暂无评论

A fast localized algorithm for scheduling sensors

引用

JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING 2006年第4期66卷 507-514页

作者： Calinescu, G IIT Dept Comp Sci Chicago IL 60616 USA

Given n sensors and in targets, a monitoring schedule is a partition of the sensor set such that each subset of the partition can monitor all the targets. Monitoring schedules are used for maximizing the time all the targets are monitored when there is no possibility of replacing the batteries of the sensors. Each subset of the partition is used for one unit of time, and thus the goal is to maximize the number of subsets in the partition. We make the assumption that any two sensors for which there is a target both can monitor can communicate in one hop. The Monitoring Schedule problem is closely related to the domatic number in graphs and from previous work one can obtain a logarithmic approximation with one round of communication. We consider the special case when the targets are on a curve (such as a road) and each sensor can monitor an interval of the curve. For this case an optimum schedule can be computed in centralized manner. However, in the worst case a localized algorithm requires a linear number of communication rounds to compute a solution which is better than a 2-approximation. We present a (2 + epsilon)-approximate randomized localized algorithm with polylogarithmic number of communication rounds. (c) 2005 Elsevier Inc. All rights reserved.

关键词： sensor network lifetime maximization localized algorithm

来源：评论

学校读者我要写书评

暂无评论

A localized algorithm for finding disjoint paths in wireless sensor networks

引用

IEEE COMMUNICATIONS LETTERS 2006年第12期10卷 807-809页

作者： Hou, Ronghui Shi, Haoshan Northwestern Polytech Univ Sch Elect & Informat Xian 710072 Peoples R China

This letter presents a localized algorithm that finds multiple node-disjoint paths in wireless sensor networks. The algorithm needs only local topology knowledge and provides automatic path restoration. We describe the algorithm, give the proof of correctness, and evaluate its performance using simulation. We conclude that the proposed algorithm is more suitable for wireless sensor networks than the existing distributed algorithms.

关键词： disjoint paths localized algorithm wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

A localized algorithm for clustering in cognitive radio networks

引用

JOURNAL OF KING SAUD UNIVERSITY-COMPUTER AND INFORMATION SCIENCES 2021年第5期33卷 600-607页

作者： Kumar, Santosh Singh, Awadhesh Kumar Natl Inst Technol Dept Comp Engn Kurukshetra 136119 Haryana India

With the steep increase in wireless devices, the requirement of the spectrum has increased for communication. However, despite huge demand, the available spectrum is underutilized. The cognitive radio network (CRN) is more challenging environment as compared to conventional mobile ad hoc network because of node mobility and dynamic channel availability. Therefore, we propose a localized clustering scheme, which aims to provide better stability, scalability, efficient spectrum management, and reduce communication overhead. Each node computes its weight and shares with its one hop neighbours, and a node with maximal weight becomes the cluster head. Subsequently, the neighbour nodes sharing the channel(s) with a cluster head join it to form a cluster. To provide fault tolerance, vice-cluster head is also selected along with cluster head. We compare the performance of our protocol with competing protocols in the CRN. Finally, we present analytic as well as simulation study of our protocol and provide a method to handle the cluster dynamics. (c) 2018 The Authors. Production and hosting by Elsevier B.V. on behalf of King Saud University. This is an open access article under the CC BY-NC-ND license (http://***/licenses/by-nc-nd/4.0/).

关键词： Cognitive radio networks Cognitive radio Clustering Distributed algorithm localized algorithm

来源：评论

学校读者我要写书评

暂无评论

A localized algorithm for the Maximum Lifetime Broadcast Problem with Asymmetric Edge Costs

A Localized Algorithm for the Maximum Lifetime Broadcast Pro...

引用

11th IEEE International Symposium on Network Computing and Applications (NCA)

作者： Nunes, Bruno Barboza, Frederico Assis, Flavio UFBA Fed Univ Bahia DCC Dept Comp Sci LaSiD Distributed Syst Lab Salvador BA Brazil

ISBN: (纸本)9780769547732

In this paper we present an algorithm for the Maximum Lifetime Broadcast (MLB) problem, i.e. the problem of extending network lifetime when a series of broadcast operations is executed. The algorithm, called DLMCA, is localized (it uses only 2-hop information) and supports asymmetric edge costs, i.e. those scenarios where the cost of sending a message from a node u to node v might be different from the cost of sending a message from v to u. Addressing asymmetry of edge costs is an important issue, as it arises in different scenarios, such as in heterogeneous networks or when overhearing costs are taken into consideration. According to our experiments, DLMCA outperformed alternative solutions to the problem. As far as we know, DLMCA is the first localized algorithm to the MLB problem with asymmetric edge costs.

关键词： Maximum Lifetime Broadcast asymmetric edge costs localized algorithm

来源：评论

学校读者我要写书评

暂无评论

Connectivity preserving localized coverage algorithm for area monitoring using wireless sensor networks

引用

COMPUTER COMMUNICATIONS 2011年第12期34卷 1484-1496页

作者： Misra, Sudip Kumar, Manikonda Pavan Obaidat, Mohammad S. Indian Inst Technol Sch Informat Technol Kharagpur 721302 W Bengal India Monmouth Univ Dept Comp Sci W Long Branch NJ USA

Efficient network coverage and connectivity are the requisites for most Wireless Sensor Network (WSN) deployments, particularly those concerned with area monitoring. Due to the resource constraints of the sensor nodes, redundancy of coverage area must be reduced for effective utilization of the available resources. If two nodes have the same coverage area in their active state, and if both the nodes are activated simultaneously, it leads to redundancy in network and wastage of precious sensor resources. In this paper, we address the problem of network coverage and connectivity and propose an efficient solution to maintain coverage, while preserving the connectivity of the network. The proposed solution aims to cover the area of interest (AOI), while minimizing the count of the active sensor nodes. The overlap region of two sensor nodes varies with the distance between the nodes. If the distance between two sensor nodes is maximized, the overall coverage area of these nodes will also be maximized. Also, to preserve the connectivity of the network, each sensor node must be in the communication range of at least one other node. Results of simulation of the proposed solution indicate up to 95% coverage of the area, while consuming very less energy of 9.44J per unit time in the network, simulated in an area of 2500 m(2). (C) 2010 Elsevier B.V. All rights reserved.

关键词： Wireless sensor networks Coverage Connectivity localized algorithm

来源：评论

学校读者我要写书评

暂无评论

LDAC: A localized and decentralized algorithm for efficiently countering wormholes in mobile wireless networks

引用

JOURNAL OF COMPUTER AND SYSTEM SCIENCES 2014年第3期80卷 618-643页

作者： Giannetsos, Thanassis Dimitriou, Tassos KTH Royal Inst Technol Lab Commun Networks S-10044 Stockholm Sweden Comp Technol Inst Athens Greece Kuwait Univ Dept Comp Engn Safat 13060 Kuwait

Several protocols have been proposed to date to defend against wormhole attacks in wireless networks by adopting synchronized clocks, positioning devices, or directional antennas. These requirements and assumptions limit their applicability especially in the case of mobile networks where the degree of association and de-association between the nodes is relatively high. In this work, we present a novel lightweight countermeasure for the wormhole attack, called LDAC (localized-Decentralized algorithm for Countering wormholes). It is completely localized and works by looking for simple evidence that no attack is taking place, using only connectivity information, as implied by the underlying communication graph. LDAC is not confined to static networks but extends naturally to dynamic and even mobile ones. Rigorous arguments that prove the correctness of the algorithm are coupled with detailed performance evaluation along with an implementation on real sensor devices that demonstrates its efficiency in terms of memory requirements and processing overhead. (C) 2013 Elsevier Inc. All rights reserved.

关键词： Wireless sensor networks Neighbor discovery Wormhole attack Connectivity graph Path existence Decentralized wormhole detection localized algorithm

来源：评论

学校读者我要写书评

暂无评论

localized algorithms for Yao Graph-Based Spanner Construction in Wireless Networks Under SINR

引用

IEEE-ACM TRANSACTIONS ON NETWORKING 2017年第4期25卷 2459-2472页

作者： Zhang, Xiujuan Yu, Jiguo Li, Wei Cheng, Xiuzhen Yu, Dongxiao Zhao, Feng Qufu Normal Univ Sch Informat Sci & Engn Rizhao 276826 Peoples R China Georgia State Univ Dept Comp Sci Atlanta GA 30302 USA George Washington Univ Dept Comp Sci Washington DC 20052 USA Huazhong Univ Sci & Technol Sch Comp Sci & Technol Cluster & Grid Comp Lab Serv Comp Technol & Syst Lab Wuhan 430074 Peoples R China Guilin Univ Elect Technol Sch Comp Sci & Informat Secur Guilin 541004 Peoples R China

Spanner construction is one of the most important techniques for topology control in wireless networks. A spanner can help not only to decrease the number of links and to maintain connectivity but also to ensure that the distance between any pair of communication nodes is within some constant factor from the shortest possible distance. Due to the non-locality, constructing a spanner is especially challenging under the physical interference model signal-to-interference-and-noise-ratio (SINR). In this paper, we develop two localized randomized algorithms SINRdirected- YG and SINR-undirected-YG to construct a directed Yao graph (YG) and an undirected YG in O(log n) (n is the number of wireless nodes) time slots with a high probability, in which each node is capable of performing successful local broadcasts to gather neighborhood information within a certain region and the SINR constraint is satisfied at all the steps of the algorithms. The resultant graph of SINR-undirected-YG, which is based on SINR-directed-YG, possesses a constant stretch factor 1/1-2 sin(pi/c), where c > 6 is a constant. To the best of our knowledge, SINR-undirected-YG is the first spanner construction algorithm under SINR. We also obtain Yao-Yao graph under SINR. Extensive theoretical performance analysis and simulation study are carried out to verify the effectiveness and the efficiency of our proposed algorithms.

关键词： Wireless network localized algorithm Yao Graph Spanner SINR

来源：评论

学校读者我要写书评

暂无评论

localized algorithms for coverage boundary detection in wireless sensor networks

引用

WIRELESS NETWORKS 2009年第1期15卷 3-20页

作者： Zhang, Chi Zhang, Yanchao Fang, Yuguang Univ Florida Dept Elect & Comp Engn Gainesville FL 32611 USA New Jersey Inst Technol Dept Elect & Comp Engn Newark NJ 07102 USA

Connected coverage, which reflects how well a target field is monitored under the base station, is the most important performance metric used to measure the quality of surveillance that wireless sensor networks (WSNs) can provide. To facilitate the measurement of this metric, we propose two novel algorithms for individual sensor nodes to identify whether they are on the coverage boundary, i.e., the boundary of a coverage hole or network partition. Our algorithms are based on two novel computational geometric techniques called localized Voronoi and neighbor embracing polygons. Compared to previous work, our algorithms can be applied to WSNs of arbitrary topologies. The algorithms are fully distributed in the sense that only the minimal position information of one-hop neighbors and a limited number of simple local computations are needed, and thus are of high scalability and energy efficiency. We show the correctness and efficiency of our algorithms by theoretical proofs and extensive simulations.

关键词： Wireless sensor networks (WSNs) Connected coverage Computational geometry localized algorithm

来源：评论

学校读者我要写书评

暂无评论

An energy-efficient localized topology control algorithm for wireless ad hoc and sensor networks

引用

INTERNATIONAL JOURNAL OF COMMUNICATION SYSTEMS 2008年第11期21卷 1205-1220页

作者： Liu, Haitao Zhang, Baoxian Zheng, Jun Mouftah, Hussein T. Univ Ottawa Sch Informat Technol & Engn Ottawa ON K1N 6N5 Canada Chinese Acad Sci Shanghai Inst Microsyst & Informat Technol Key Lab Wireless Sensor Network & Commun Shanghai 200050 Peoples R China Chinese Acad Sci Grad Univ Coll Comp & Commun Engn Beijing 100049 Peoples R China

Topology control plays an important role in the design of wireless ad hoc and sensor networks and has demonstrated its high capability in constructing networks with desirable characteristics such as sparser connectivity, lower transmission power, and smaller node degree. However, the enforcement of a topology control algorithm in a network may degrade the energy-draining balancing capability of the network and thus reduce the network operational lifetime. For this reason, it is important to take into account energy efficiency in the design of a topology control algorithm in order to achieve prolonged network lifetime. In this paper, we propose of a localized energy-efficient topology control algorithm for wireless ad hoc and sensor networks with power control capability in network nodes. To achieve prolonged network lifetime, we introduce a concept called energy criticality avoidance and propose an energy criticality avoidance strategy in topology control and energy-efficient routing. Through theoretical analysis and simulation results. We prove that the proposed topolgy control algorithm can maintain the global network connectivity with low complexity and can significantly prolong the lifetime of a multi-hop wireless network as compared with existing topology control algorithms with little additional protocol ovehea. Copyright (C) 2008 John Wiley & Sons, Ltd.

关键词： topology control localized algorithm energy-efficient routing ad hoc and sensor networks

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：