检索结果-南通市图书馆

An ellipse-guided routing algorithm in wireless sensor networks

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Digital Communications and networks 2022年第5期8卷 770-777页

作者： Jianjun Yang Department of Computer Science and Information Systems University of North GeorgiaOakwoodGA30566USA

In wireless sensor networks,sensor nodes are deployed to collect data,perform calculations,and forward information to either other nodes or sink ***,geographic routing has become extremely popular because it only requires the locations of sensor nodes and is very ***,the local minimum phenomenon,which hinders greedy forwarding,is a major problem in geographic *** phenomenon is attributed to an area called a hole that lacks active sensors,which either prevents the packet from being forwarded to a destination node or produces a long detour *** order to solve the hole problem,mechanisms to detect holes and determine landmark nodes have been *** on the proposed mechanisms,landmark-based routing was developed in which the source node first sends a packet to the landmark node,and the landmark node then sends the packet to the ***,this approach often creates a constant node sequence,causing nodes that perform routing tasks to quickly run out of energy,thus producing larger *** this paper,a new approach is proposed in which two virtual ellipses are created with the source,landmark,and destination *** guide the forwarding along the virtual ***,a recursive algorithm is designed to ensure a shortcut even if there are multiple holes or a hole has multiple ***,the proposed approach improves both geographic routing and energy efficiency *** experiments show that the proposed approach increases the battery life of sensor nodes,lowers the end-to-end delay,and generates a short path.

关键词： sensor networks Hole Landmark Ellipse Geographic routing Energy efficiency

Fully distributed variational Bayesian non-linear filter with unknown measurement noise in sensor networks

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Science China(Information Sciences) 2020年第11期63卷 24-37页

作者： Yu LIU Jun LIU Congan XU Gang LI You HE Research Institute of Information Fusion Naval Aviation University Department of Electronic Engineering Tsinghua University

In practical applications, the measurement noise statistics is usually unknown or may change over time. However, most existing distributed filtering algorithms for sensor networks are constructed based on exact knowledge of measurement noise statistics. Therefore, under situations with measurement uncertainty, the existing algorithms may result in deteriorated performance. To solve such problems, a distributed adaptive cubature information filter based on variational Bayesian(VB-DACIF) is proposed here. Firstly,the predicted estimates of interest from inclusive neighbours are fused by minimizing the weighted KullbackLeibler average, in which the cubature rule is utilized to tackle system nonlinearity. Then, the free form variational Bayesian approximation is applied to recursively update both the local estimate and the precision matrices of sensing nodes. Finally, the posterior Cram′er-Rao lower bound is exploited to evaluate performance of the proposed VB-DACIF. Simulation results with a maneuvering target tracking scenario validates the feasibility and superiority of the proposed VB-DACIF.

关键词： sensor networks distributed state estimation cubature Kalman filter variational Bayesian inference Kullback-Leibler divergence

Connected Key Node Set-Based Skyline Query Processing over Wireless sensor networks

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Chinese Journal of Electronics 2015年第4期24卷 717-724页

作者： XIE Zhijun YE Hongwu Department of Information Science and Engineering Ningbo University Zhejiang Fashion Institute of Technology

Skyline query has been applied widely in sensor networks. We propose a connected key node setbased skyline Efficient skyline query processing(EffiSky)algorithm to minimize communication traffic for resourceslimited sensor networks. In the EffiSky algorithm, we discover a Connected key node set(CKNS) used to transmit and collect queries and results among the sensor nodes, which can reduce the average communication cost of the networks significantly. We set up a two-level filtering scheme that prunes many useless dominated tuples. Both the theoretical analysis and experiment results demonstrate that EffiSky excels the existing work in terms of network traffic, scalability in network expansion, node density, and dimension change.

关键词： sensor networks Skyline query Key nodes discovery Energy efficiency Time efficiency

Information space of sensor networks:Lagrangian,energy-momentum tensor,and applications

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Chinese Journal of Aeronautics 2023年第3期36卷 271-284页

作者： Mo TAO Shaoping WANG Hong CHEN Han PAN Jian SHI Yuwei ZHANG School of Automation Science and Electrical Engineering Beihang UniversityBeijing 100083China Wuhan Second Ship Design and Research Institute Wuhan 430205China School of Aeronautics and Astronautics Shanghai Jiao Tong UniversityShanghai 200240China

It is a challenge to investigate the interrelationship between the geometric structure and performance of sensor networks due to the increasingly complex and diverse architecture of *** paper presents two new formulations for the information space of sensor networks,including Lagrangian and energy–momentum tensor,which are expected to integrate sensor networks target tracking and performance evaluation from a unified *** proposed method presents two geometric objects to represent the dynamic state and manifold structure of the information space of sensor *** on that,the authors conduct the property analysis and target tracking of sensor *** the best of our knowledge,it is the first time to investigate and analyze the information energy-momentum tensor of sensor networks and evaluate the performance of sensor networks in the context of target *** and examples confirm the competitive performance of the proposed method.

关键词： Energy-momentum tensor Information science Information space sensor networks Target tracking

NBgossip:An Energy-Efficient Gossip Algorithm for Wireless sensor networks

在线全文

学校读者我要写书评

暂无评论

Journal of Computer Science & Technology 2008年第3期23卷 426-437页

作者：陆峰谢良镇郑国良钟伟豪 Center for Multimedia and Network Technology School of Computer EngineeringNanyang Technological University

Gossip-based algorithms for information dissemination have recently received significant attention for sensor and ad hoc network applications because of their simplicity and robustness. However, a common drawback of many gossip-based protocols is the waste of energy in passing redundant information over the network. Thus gossip algorithms need to be re-engineered in order to become applicable to energy constrained networks. In this paper, we consider a scenario where each node in the network holds a piece of information （message） at the beginning, and the objective is to simultaneously disseminate all information （messages） among all nodes quickly and cheaply. To provide a practical solution to this problem for ad hoc and sensor networks, NBgossip algorithm is proposed, which is based on network coding and neighborhood gossip. In NBgossip, nodes do not simply forward messages they receive, instead, the linear combinations of the messages are sent out. In addition, every node exchanges messages with its neighboring nodes only. Mathematical proof and simulation studies show that the proposed NBgossip terminates in the optimal O（n）-order rounds and outperforms the existing gossip-based approaches in terms of energy consumption incurred in spreading all the information.

关键词： data dissemination gossip network coding sensor networks

Analysis on life model of large sensor networks

在线全文

学校读者我要写书评

暂无评论

Science China(Information Sciences) 2013年第4期56卷 40-49页

作者： ZHU XiaoRong WANG Yong ZHU HongBo Wireless Comminication Key Lab of Jiangsu Province Nanjing University of Posts and Telecommunications Department of Science PLA University of Science and Technology

A large sensor network needs multiple base stations(BSs) to collect data *** design effort often aims at maximizing the network *** lifetime of a network depends on,besides battery capacity,factors such as node density,sampling period and the partitioning of the network for the multiple base *** this paper,we propose a stochastic approach to finding the lifetime of large sensor networks with multiple BSs and randomly scattered *** begin by partitioning the network into regions by the Voronoi diagram method,one for each base *** then propose a method to find the minimum transmission range needed for guaranteeing network *** nodes connected,we derive the traffic rate of nodes at specific distance from the base *** on the traffic rate and energy consumption model,the lifetime distribution of a region is *** the results of individual regions,the network lifetime distribution is *** studies are presented and verified by computer simulation.

关键词： sensor networks lifetime distribution multiple base stations

Maximum Network Throughput Based on Cross-Technology Communication for sensor networks

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

China Communications 2021年第10期18卷 30-44页

作者： Demin Gao Zhihao Guan Shuo Zhang Bin Hu College of Information Science and Technology Nanjing Forestry UniversityNanjing 210037China Department of Computer Science and Engineering University of Minnesota55414USA College of Artificial Intelligence Nanjing Agriculture UniversityNanjing 210095China

The exponentially increasing number of heterogeneous Internet of Things(Io T)devices(e.g.,Wi Fi and Zig Bee)crowed in the same ISM band(2.4 G)and recent advances in CrossTechnology Communications(CTC)motivate us to explore more efficient data collection and maximize network *** enables Wi Fi and Zig Bee devices to communicate directly without any hardware changes or gateway equipment,which sheds light on a more efficient data collection *** this work,we propose a distributed algorithm,named Max Bee,to compute the maximum network throughput,which is formulated as a linear programming *** that the problem turns out to be non-convex and hard to solve exactly,we propose a distributed algorithm to solve nonlinear programming by using the dual decomposition method and gradient/subgradient *** extensive simulations on different sets of deployed Zig Bee and Wi Fi devices,we observe that the proposed algorithm significantly increases the network throughput based on CTC for sensor networks.

关键词： network throughput cross-technology communication sensor networks

Data Secure Storage Mechanism of sensor networks Based on Blockchain

在线全文

学校读者我要写书评

暂无评论

Computers, Materials & Continua 2020年第12期65卷 2365-2384页

作者： Jin Wang Wencheng Chen Lei Wang R.Simon Sherratt Osama Alfarraj Amr Tolba School of Information Science and Engineering Fujian University of TechnologyFuzhou350118China School of Computer&Communication Engineering Changsha University of Science&TechnologyChangsha410004China School of Civil Engineering Changsha University of Science&TechnologyChangsha410000China Department Biomedical Engineering University of ReadingReadingRG66AYUK Computer Science Department Community CollegeKing Saud UniversityRiyadh11437Saudi Arabia Mathematics and Computer Science Department Faculty of ScienceMenoufia UniversityShebin-El-Kom32511Egypt

As the number of sensor network application scenarios continues to grow,the security problems inherent in this approach have become obstacles that hinder its wide ***,it has attracted increasing attention from industry and *** blockchain is based on a distributed network and has the characteristics of non-tampering and traceability of block *** is thus naturally able to solve the security problems of the sensor ***,this paper first analyzes the security risks associated with data storage in the sensor networks,then proposes using blockchain technology to ensure that data storage in the sensor networks is *** the traditional blockchain,the data layer uses a Merkle hash tree to store data;however,the Merkle hash tree cannot provide non-member proof,which makes it unable to resist the attacks of malicious nodes in *** solve this problem,this paper utilizes a cryptographic accumulator rather than a Merkle hash tree to provide both member proof and non-member ***,the number of elements in the existing accumulator is limited and unable to meet the blockchain’s expansion *** paper therefore proposes a new type of unbounded accumulator and provides its definition and security ***,this paper constructs an unbounded accumulator scheme using bilinear pairs and analyzes its performance.

关键词： sensor networks blockchain unbounded accumulator storage mechanism

Non-interference topology scheme in wireless sensor networks

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

The Journal of China Universities of Posts and Telecommunications 2007年第2期14卷 7-13页

作者： MA Shu-hui JI Hong YUE Guang-xin School of Telecommunication Engineering Beijing University of Posts and Telecommunications Beijing 100876 China

A novel topology scheme, cell with multiple mobile sinks method （CMMSM）, is proposed in this article for the collection of information and for the environment monitoring in wireless sensor networks. The system consists of many static sensors, scattered in a large scale sensing field and multiple mobile sinks, cruising among the clusters. Conservation of energy and simplification of protocol are important design considerations in this scheme. The noninterference topology scheme largely simplifies the full-distributed communication protocol with the ability of collision avoidance and random routing. The total number of cluster heads in such a topology was analyzed, and then an approximate evaluation of the total energy consumption in one round was carded out. Simulation results show that CMMSM can save considerable energy and obtain higher throughput than low-energy adaptive clustering hierarchy （LEACH） and geographical adaptive fidelity （GAF）.

关键词： sensor networks energy consumption topology design multiple mobile sinks