检索结果-南通市图书馆

A General Pairwise Key Predistribution Scheme for Wireless sensor networks

在线全文

学校读者我要写书评

暂无评论

Wuhan University Journal of Natural Sciences 2008年第6期13卷 744-748页

作者： DING Xiaoyu LIU Zhiping SHAO Dingrong School of Electronics and Information Engineering Beihang University Beijing 100083 China Department of Basical Courses Zibo Vocational Institute Zibo 255314 Shandong China

This paper develops a general hypercube-based key predistribution scheme for establishing pairwise keys between sensor nodes using polynomials, which is parameterized by the dimension of hypercube and the Hamming distance threshold variables. The scheme addresses the weaknesses of existing key predistribution schemes, which have either worse security or lower efficiency. It exhibits a nice property--when the Hamming distance between any two neighboring sensor nodes is less than the pre-defined threshold, the pairwise key can be established directly. Extensive performance and security analysis shows that by increasing Hamming distance threshold value, we can trade off the resilience against node capture attack for higher probability of direct pairwise key establishment, so as to save the energy consumption which is the most important issue for sensor networks.

关键词： pairwise key establishment sensor networks hypercube-based key predistribution polynomial Hamming distance

NEAR OPTIMAL CLUSTER-HEAD SELECTION FOR WIRELESS sensor networks

在线全文

学校读者我要写书评

暂无评论

Journal of Electronics(China) 2007年第6期24卷 721-725页

作者： Zhu Xiaorong Shen Lianfeng National Mobile Comm. Research Lab Southeast University Nanjing 210096 China

Clustering in wireless sensor networks is an effective way to save energy and reuse bandwidth. To our best knowledge, most of the clustering protocols proposed in literature are of a dynamic type, where cluster heads are selected in each period, followed by cluster formation. In this paper, a new static type clustering method called Hausdorff clustering, which is based on the location of sensor nodes as well as communication efficiency and network connectivity, is proposed. The cluster head, however, is rotated within the cluster by a fuzzy logic algorithtn that optimizes the network lifetime. Simulation results show that this approach can significantly increase the lifetime of the sensor network.

关键词： sensor networks Hausdorff clustering Fuzzy logic

Stream Segmentation-A Data Fusion Approach for sensor networks

在线全文

学校读者我要写书评

暂无评论

自动化学报 2006年第6期32卷 856-866页

作者： WU Jian-Kang DONG Liang BAO Xiao-Ming Institute for Infocomm Research Singapore 119613 Singapore Graduate School Chinese Academy of Sciences Beijing 100049

sensor networks provide means to link people with real world by processing data in real time collected from real-world and routing the query results to the right people. Application examples include continuous monitoring of environment, building infrastructures and human health. Many researchers view the sensor networks as databases, and the monitoring tasks are performed as subscriptions, queries, and alert. However, this point is not precise. First, databases can only deal with well-formed data types, with well-defined schema for their interpretation, while the raw data collected by the sensor networks, in most cases, do not fit to this requirement. Second, sensor networks have to deal with very dynamic targets, environment and resources, while databases are more static. In order to fill this gap between sensor networks and databases, we propose a novel approach, referred to as 'spatiotemporal data stream segmentation', or 'stream segmentation' for short, to address the dynamic nature and deal with 'raw' data of sensor networks. Stream segmentation is defined using Bayesian networks in the context of sensor networks, and two application examples are given to demonstrate the usefulness of the approach.

关键词： sensor networks spatiotemporal data processing databases Bayesian networks

Cross-layer Enhancement to Multi-hop Routing in sensor networks: an Empirical Study

在线全文

学校读者我要写书评

暂无评论

自动化学报 2006年第6期32卷 875-880页

作者： SHANG Zhi-Jun WANG Jun YU Hai-Bin Shenyang Institute of Automation Chinese Academy of Sciences Shenyang 110016 Graduate School of the Chinese Academy of Sciences Beijing 100039

Lossy link is one of the unique characteristics in random-deployed sensor networks. We envision that robustness and reliability of routing cannot be ensured purely in network layer. Our idea is to enhance the performance of routing protocol by cross-layer interaction. We modified mint protocol, a routing protocol in TinyOS and proposed an enhanced version of mint called PA-mint. A transmission power control interface is added to network layer in PA-mint. When routing performance of the current network is not satisfied, PA-mint monotonically increases the transmission power via the interface we added. PA-mint is able to connect orphan nodes and robust to node mobility or key nodes failure. In the case that automatic request retransmission is employed, the number of retransmissions can be reduced by PA-mint. Results from experiments show that PA-mint increases the reliability and robustness of routing protocol by cross-layer interaction.

关键词： sensor networks routing cross-layer design

Beaconless Position-based Routing with Guaranteed Delivery for Wireless Ad hoc and sensor networks

在线全文

学校读者我要写书评

暂无评论

自动化学报 2006年第6期32卷 846-855页

作者： CHAWLA Mohit GOEL Nishith KALAICHELVAN Kalai NAYAK Amiya STOJMENOVIC Ivan Department of Computer Science & Engineering IIT GuwahatiGuwahati 781039India Cistel Technology Inc OttawaOntario K2E 7V7Canada EION Technology Inc OttawaOntario K1Y 2X5Canada SITE University of OttawaOttawaOntario K1N 6N5Canada

Existing position-based routing algorithms, where packets are forwarded in the geographic direction of the destination, normally require that the forwarding node should know the positions of all neighbors in its transmission range. This information on direct neighbors is gained by observing beacon messages that each node sends out periodically. Several beaconless greedy routing schemes have been proposed recently. However, none of the existing beaconless schemes guarantee the delivery of packets. Moreover, they incur communication overhead by sending excessive control messages or by broadcasting data packets. In this paper, we describe how existing localized position based routing schemes that guarantee delivery can be made beaconless, while preserving the same routes. In our guaranteed delivery beaconless routing scheme, the next hop is selected through the use of control RTS/CTS messages and biased timeouts. In greedy mode, the neighbor closest to destination responds first. In recovery mode, nodes closer to the source will select shorter timeouts, so that other neighbors, overhearing CTS packets, can eliminate their own CTS packets if they realize that their link to the source is not part of Gabriel graph. Nodes also cancel their packets after receiving data message sent by source to the selected neighbor. We analyze the behavior of our scheme on our simulation environment assuming ideal MAC, following GOAFR+ and GFG routing schemes. Our results demonstrate low communication overhead in addition to guaranteed delivery.

关键词： Beaconless routing geometric routing guaranteed delivery sensor networks

Simsync: A Time Synchronization Simulator for sensor networks

在线全文

学校读者我要写书评

暂无评论

自动化学报 2006年第6期32卷 1008-1014页

作者： XU Chao-Nong ZHAO Lei XU Yong-Jun LI Xiao-Wei Advanced Test Technology Lab Institute of Computing Technology Chinese Academy of Sciences Beijing 100080 Department of Computer Science Hefei University of Technology Hefei 230009 Graduate School of Chinese Academy of Sciences Beijing 100080

Time synchronization is a critical middleware service of wireless sensor networks. Researchers have already proposed some time synchronization algorithms. However, due to the demands for various synchronization precision, existing time synchronization algorithms often need to be adapted. So it is necessary to evaluate these adapted algorithms before use. Software simulation is a valid and quick way to do it. In this paper, we present a time synchronization simulator, Simsync, for wireless sensor networks. We decompose the packet delay into 6 delay components and model them separately. The frequency of crystal oscillator is modeled as Gaussian. To testify its effectiveness, we simulate the reference broadcast synchronization algorithm (RBS) and the timing-sync synchronization algorithm (TPSN) on Simsync. Simulated results are also presented and analyzed.

关键词： Time synchronization sensor networks simulator

Securing sensor networks Based on Optimization of Weighted Confidence

在线全文

学校读者我要写书评

暂无评论

China Communications 2012年第8期9卷 122-128页

作者： Hu Xiangdong Yu Pengqin Wei Qinfang College of Automation Chongqing University of Posts and Telecommunications Chongqing 400065 P. R. China School of Telecommunication and Information Engineering Chongqing University of Posts and Telecommunications Chongqing 400065 P. R. China

In this paper, an optimized rmlicious nodes detection algorithm, based on Weighted Confidence Filter （WCF）, is proposed to protect sensor networks from attacks. In this algorithm, each cluster head in a cluster-based hierarchical network figures out an average confidence degree by means of messages from its child nodes. The cluster head only accepts a message from the child node whose confidence degree is higher than the average. Meanwhile, it updates the confidence degrees for each of its child nodes by comparing the aggregation value and the received messages, and regards them as the weight of exactness of messages from nodes. A sensor node is judged to be rmlicious if its weight value is lower than the predefined threshold. Comparative simulation results verify that the proposed WCF algorithm is better than the Weighted Trust Evaluation （WTE） in terms of the detection ratio and the false alarm ratio. More specifically, with the WCF, the detection ratio is significantly improved and the false alarm ratio is observably reduced, especially when the malicious node ratio is 0.25 or greater. When 40% of 100 sensors are malicious, the detection accuracy is above 90% and the false alarm ratio is nearly only 1.8%.

关键词： sensor networks malicious nodes attack confidence detection sirrlation

ENERGY-EFFICIENT HEURISTIC METRIC FOR SCP IN sensor networks

在线全文

学校读者我要写书评

暂无评论

Transactions of Nanjing University of Aeronautics and Astronautics 2008年第1期25卷 51-60页

作者：黄如朱杰徐光辉上海交通大学电子工程系解放军理工大学通信工程学院

A heuristic metric is presented to achieve the optimal connected set covering problem （SCP） in sensor networks. The coverage solution with the energy efficiency can guarantee that all targets are fully covered. Among targets, the crucial ones are redundantly covered to ensure more reliable monitors. And the information collected by the above coverage solution can be transmitted to Sink by the connected data-gathering structure. A novel ant colony optimization （ACO） algorithm--improved-MMAS-ACS-hybrid algorithm （IMAH） is adopted to achieve the above metric. Based on the design of the heuristic factor, artificial ants can adaptively detect the coverage and energy status of sensor networks and find the low-energy-cost paths to keep the communication connectivity to Sink. By introducing the pheromone-judgment-factor and the evaluation function to the pheromone updating rule, the pheromone trail on the global-best solution is enhanced, while avoiding the premature stagnation. Finally, the energy efficiency set can be obtained with high coverage-efficiency to all targets and reliable connectivity to Sink and the lifetime of the connected coverage set is prolonged.

关键词： sensor networks energy efficiency set covering problem (SCP) connectivity ant colony optimization

Energy-efficient mechanism based on ACO for the coverage problem in sensor networks

在线全文

学校读者我要写书评

暂无评论

Journal of Southeast University(English Edition) 2007年第2期23卷 255-260页

作者：黄如朱杰徐光辉上海交通大学电子工程系上海200240 解放军理工大学通信工程学院南京210016

An energy-efficient heuristic mechanism is presented to obtain the optimal solution for the coverage problem in sensor networks. The mechanism can ensure that all targets are fully covered corresponding to their levels of importance at minimum cost, and the ant colony optimization algorithm （ACO） is adopted to achieve the above metrics. Based on the novel design of heuristic factors, artificial ants can adaptively detect the energy status and coverage ability of sensor networks via local information. By introducing the evaluation function to global pheromone updating rule, the pheromone trail on the best solution is greatly enhanced, so that the convergence process of the algorithm is speed up. Finally, the optimal solution with a higher coverage- efficiency and a longer lifetime is obtained.

关键词： sensor networks coverage problem ant colony optimization (ACO) energy-efficiency