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

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 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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Boundary node detection in wireless networks with uneven node distribution on open surfaces

引用

JOURNAL OF NETWORK AND COMPUTER APPLICATIONS 2023年 220卷

作者： Wei, Linna Huang, Wenlong Zhao, Wei Wu, Xuangou Zheng, Xiao Anhui Univ Technol Sch Comp Sci & Technol Maxiang Rd 1530 Maanshan 243032 Anhui Peoples R China Anhui Univ Technol Anhui Engn Ctr Intelligent Applicat & Secur Ind In Maxiang Rd 1530 Maanshan 243032 Anhui Peoples R China Anhui Univ Technol Anhui Prov Key Lab Digital Twin Technol Met Ind Maxiang Rd 1530 Maanshan 243032 Anhui Peoples R China

Boundary node detection is essential in various application scenarios of wireless networks. However, most previous solutions are only suitable for planar networks with densely and evenly distributed nodes. They cannot satisfy scenarios where nodes are unevenly deployed on open surfaces because the nodes may have different heights, densities, and inter-distances. In this work, we propose a scheme named Surrounding Triangle Validation to detect boundary nodes in wireless networks with uneven node distribution on open surfaces. This solution randomly generates triangles from the 1-hop neighbors of a testing node and validates these triangles. The triangle generation step accepts the triangles with their two endpoints connected by one or more relay nodes in the areas with uneven node density. Then, the generated triangles surrounding the testing node are picked out by point in triangle tests. In the last step, the selected triangles are compared according to the characteristics of a special kind of boundary node to ensure the results of our method. We test our solution in networks with different node densities on several open surfaces. Simulation results show that our method works effectively. It detects boundary nodes more correctly than previous solutions.

关键词： Boundary node detection localized algorithm Point in triangle test 1-hop neighbor Open surface

来源：评论

学校读者我要写书评

暂无评论

localized topology control and on-demand power-efficient routing for wireless ad hoc and sensor networks

引用

PEER-TO-PEER NETWORKING AND APPLICATIONS 2019年第1期12卷 189-208页

作者： Qin, Xu Zhang, Baoxian Li, Cheng Univ Chinese Acad Sci Res Ctr Ubiquitous Sensor Network 19A Yuquan Rd Beijing 100049 Peoples R China Tianjin Chengjian Univ Sch Comp & Informat Engn Tianjin Peoples R China Mem Univ Newfoundland Fac Engn & Appl Sci St John NF A1B 3X5 Canada

Power use is a crucial design concern in wireless ad hoc and sensor networks since it corresponds directly to the network operational time. In this paper, we study the issue of power-efficient use in the following two aspects: Selecting power-efficient routes and performing efficient localized topology control to assign reduced transmit powers at nodes while preserving the global optimal connectivity. We proposed a localized topology control algorithm using two-hop neighborhood knowledge, which works to build local shortest path tree at each node independently in order to generate a reduced topology while preserving the global optimal connectivity. We derive the energy stretch ratio and maximum degree performance of our proposed algorithm as well as several existing algorithms in this aspect. We then devise three power-efficient on-demand routing protocols on top of various localized topology control algorithms, which are to acquire minimum-power paths while minimizing the associated protocol overhead for route discovery by utilizing local network state information and also packet receipt status at neighbor nodes. We further derive the asymptotical performance of the routing strategy in our protocols in terms of energy stretch ratio and route acquisition latency when network nodes operate at limited discrete power levels. Simulation results are provided to demonstrate the high performance of our topology control algorithm and also the devised routing protocols.

关键词： Topology control localized algorithm Power-aware routing On-demand routing Wireless ad hoc and sensor networks

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

LASEC: A localized Approach to Service Composition in Pervasive Computing Environments

引用

IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS 2015年第7期26卷 1948-1957页

作者： Siebert, Joanna Cao, Jiannong Lai, Yi Guo, Peng Zhu, Weiping Hong Kong Polytech Univ Dept Comp Hong Kong Hong Kong Peoples R China

Pervasive computing environments (PvCE) are embedded with interconnected smart devices which provide users with services desired. To meet requirements of users, smart devices with different kinds of functions may need to be associated together to provide the service described in the user requirement, which is called service composition. As the service composition environment may be dynamic and large scale, centralized service composition algorithm is usually inefficient due to message cost. On the other hand, a decentralized approach, which employs pre-determined coordinators to search and compose service, may have high cost as well. In this paper, we discuss a localized approach for service composition based on the Ubiquitous Interacting Object (UIO) model we have proposed earlier. UIO is an abstraction of physical devices in PvCE with ability to find and collaborate with other devices through exposing their capabilities as services. In our localized service composition algorithm (LASEC), UIOs collaborate with each other in a bottom-up, localized manner to compose required service without requiring global knowledge. To solve the problem of blind compositions in LASEC, we propose a novel mechanism called Alien-information- based Acknowledging (A-Ack), in which a UIO decides on collaborating with another UIO only after obtaining some additional information from the collaboration candidate. Specifically, this information refers to ability of a given UIO to compose another part of the service. Proposed LASEC is message-efficient and quality-guaranteed. Extensive simulations of LASEC as well as existing decentralized and pull-based centralized algorithms have been conducted. The results show the relatively low communication cost and composition time of LASEC. Moreover, we demonstrate feasibility of our approach with a prototype implementation.

关键词： Pervasive computing environment ubiquitous interacting objects service composition localized algorithm

来源：评论

学校读者我要写书评

暂无评论

LBDP: localized Boundary Detection and Parametrization for 3-D Sensor Networks

引用

IEEE-ACM TRANSACTIONS ON NETWORKING 2014年第2期22卷 567-579页

作者： Li, Feng Zhang, Chi Luo, Jun Xin, Shi-Qing He, Ying Nanyang Technol Univ Sch Comp Engn Singapore 639798 Singapore

Many applications of wireless sensor networks involve monitoring a time-variant event (e. g., radiation pollution in the air). In such applications, fast boundary detection is a crucial function, as it allows us to track the event variation in a timely fashion. However, the problem becomes very challenging as it demands a highly efficient algorithm to cope with the dynamics introduced by the evolving event. Moreover, as many physical events occupy volumes rather than surfaces (e. g., pollution again), the algorithm has to work for 3-D cases. Finally, as boundaries of a 3-D network can be complicated 2-manifolds, many network functionalities (e. g., routing) may fail in the face of such boundaries. To this end, we propose localized Boundary Detection and Parametrization (LBDP) to tackle these challenges. The first component of LBDP is UNiform Fast On-Line boundary Detection (UNFOLD). It applies an inversion to node coordinates such that a "notched" surface is "unfolded" into a convex one, which in turn reduces boundary detection to a localized convexity test. We prove the correctness and efficiency of UNFOLD;we also use simulations and implementations to evaluate its performance, which demonstrates that UNFOLD is two orders of magnitude more time-and energy-efficient than the most up-to-date proposal. Another component of LBDP is localized Boundary Sphericalization (LBS). Through purely localized operations, LBS maps an arbitrary genus-0 boundary to a unit sphere, which in turn supports functionalities such as distinguishing interboundaries from external ones and distributed coordinations on a boundary. We implement LBS in TOSSIM and use simulations to show its effectiveness.

关键词： 3-D wireless sensor networks boundary detection convexity test inversion localized algorithm surface parametrization

来源：评论

学校读者我要写书评

暂无评论

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

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：