Current Issue

• 2010, No. 11　Published:25 November 2010 Last issue    Next issue
  Columns in this issue: 论文

• 论文

  An Algorithm of SelfOrganized Node Network for IPv6Based Wireless Sensor Networks

  JING Bo1,HAO Zhongbo2,ZHOU Yu1

  2010, 32(11): 1-5. doi: 10.3969/j.issn.1007130X.2010.

  Abstract ( 511 )   PDF (1131KB) ( 380 )   　　

  Beginning with the mode of interconnection of wireless sensor networks and the next generation network, the paper confirms that it is feasible to use the allIP access mode in a singlesoldier system,and proposes an algorithm of selforganized node network with the Internet protocol version six(IPv6) of stateless auto configuration and the mobile IPv6. We also make a simulation and validate the stateless auto configuration that is implemented in the sensor node.

  LPRMAC:A Low Power Parallel Rendezvous MAC Protocol

  QIN Shaohua1,2,CHEN Dongyan1,CHEN Guiyou1

  2010, 32(11): 6-9. doi: 10.3969/j.issn.1007130X.2010.

  Abstract ( 521 )   PDF (489KB) ( 399 )   　　

  In this paper the characteristics of various multichannel MAC protocols are analyzed, with a focus on the disappearing node and collision problems in parallel rendezvous MAC protocols. A new multichannel MAC protocol, Lowpower Parallel Rendezvous Medium Access Control (LPRMAC) protocol, is proposed. The power efficiency issues in wireless sensor networks are also considered in this protocol. With this protocol, time is divided into time slots with global time synchronization, and each node randomly selects one slot as its fixed receiving slot at the period of the network established, the node listens to the channel and receives incoming packets at the receiving slot. The nodes hop according to a pseudorandom hopping sequence of their choice among the available channels and parallel rendezvous, and switch to the low power sleep mode outside of their time slots. Simulation results show that this protocol can decrease the extent collision while consuming less energy per packet.

  A Cloud Model Based Multiple Ant Colony Algorithm for the Routing Optimization of WSN with a LongChain Structure

  LI Lifen,ZHU Yongli,ZHANG Junyan

  2010, 32(11): 10-14. doi: 10.3969/j.issn.1007130X.2010.

  Abstract ( 595 )   PDF (536KB) ( 655 )   　　

  The requirement of realtimeness and high reliability of data transmission in the WSN based monitoring systems with a long chain treelike topology , the network hotspots problem which is likely to occur around the sink node must be taken into account. This paper proposes a new crosslayer routing algorithm for wireless sensor networks, which is named Cloud model based Multiple Ant Colony routing Optimization (CMACO). Through the interaction of pheromones between populations, the routing algorithm searches for the feasible paths in parallel and updates the pheromones in time. In the pathfinding process, the routing metrics of singlehop delay, hop count, queue length and packet reception rate are regarded as heuristics correction factors. A multiple rules generator is used to optimize the residual factor ρ and the total pheromone information Q so as to update the pheromones adaptively. The simulation results demonstrate that the routing algorithm can guarantee the realtimeness, reliability and robustness of wireless sensor networks. It can also achieve the network load balancing and the congestion control mechanism.

  McCTRP:A MultiChannel CrossLayer Tree Routing Protocol

  JING Gang,CHEN Dongyan，JIA Lei

  2010, 32(11): 15-19. doi: 10.3969/j.issn.1007130X.2010.

  Abstract ( 521 )   PDF (579KB) ( 296 )   　　

  Single channel wireless sensor networks are known to be unreliable when the channel of choice is severely interfered. They also suffer from the low throughput problem when the network scale is large. While using multiple channels is a promising technique to solve these problems, the existing singlechannel based routing protocols are not readily applicable for multichannel scenarios due to the challenges brought forward by multichannel transmissions. In this paper, a tree routing protocol is proposed for multichannel WSNs based on the following ideas: First, beacon interval is adaptive to network topology; Second, link quality is estimated by the measure of beacondriven and datadriven Extra Expected Number of Transmission(EETX); Finally, the neighbor table insertion and removal process is synchronized across the MAC layer and routing layer to reduce the communication and power consumption overhead. This protocol is implemented on our testbed and the experimental results show that this protocol provides a fast convergence rate, a stable topology, and reliable data transmissions.

  An EnRoute Filtering Scheme with LowDelay and High Coverage for Sensor Networks

  YANG Feng,ZHOU Xuehai,ZHANG Qiyuan

  2010, 32(11): 20-24. doi: sensor networks;enroute filte

  Abstract ( 527 )   PDF (528KB) ( 370 )   　　

  Sensor nodes can be compromised by attackers and inject large amounts of bogus data to exhaust network resources. Enroute filtering is an effective way to defeat false data injection attacks. We consider two factors that often are overlooked before: coverage and realtimeness. A stepwise refinement distributed group joining method is proposed to improve the coverage performance. Enroute nodes dynamically determine whether first to verify a message or first to forward the message. If the network is attacked, the forwarding nodes will verify messages first; otherwise, forwarding nodes will forward message first. We compare the proposed scheme with the traditional ones, and show that the scheme can improve coverage and reduce delay efficiently.

  A Transmission Control Protocol for Urban Traffic Surveillance and Remote Control Based on the Internet

  ZHANG Wei,TAN Guozhen,DING Nan

  2010, 32(11): 25-28. doi: 10.3969/j.issn.1007130X.2010.

  Abstract ( 449 )   PDF (768KB) ( 764 )   　　

  This paper introduces a hardwareindependent, reliable and connectionoriented transportation control protocol for urban traffic surveillance based on the trend of urban traffic cyberphysical system and remote control. We uniform the structure of the traffic information data and the manipulation instructions of all traffic devices,and implement remote sensing and control via the Internet. We design the data format of mutual communication packet between the client and the server, and on the basis of the properties of data communication protocol: atomicity, ordering, realtimeness and fault tolerance, and implement the pivotal technical issues including connection establishment, link status maintenance, data transmission, packet loss detection and retransmitting, and congestion controlling. The feasibility and performance are analyzed through simulation and experiments.

  Design of a Node and System for Wireless Sensor Network Used in Agriculture Information Collection

  LI Hongliang1,2,3,CHEN Liping1,2,ZHANG Ruirui1,2

  2010, 32(11): 29-32. doi: 10.3969/j.issn.1007130X.2010.

  Abstract ( 615 )   PDF (793KB) ( 424 )   　　

  In this paper, we design a system to collect information in agriculture, which is based on wireless sensor networks. There is a hardware design of node using CC2430 at first, and then a system is built based on the actual application. In this system, nodes can collect data in three modes such as the mode of period collection, the mode of query on the fixed points and the mode of anomalies. Usually，nodes work in the mode of period collection, collect and send data to the coordinator in a fixed period, and the coordinator will send the data to a remote server to be stored or analyzed. When there is a special demand of query, users can send the command, which can make part of the network enter into the mode of query on the fixed points, and then the nodes concerned collect data at the fixed point. Additionally, nodes can enter into the mode of anomalies automatically, and notify the part of network of entering into the same mode when there are anomalies. We have designed the node and system, and have done experiments in this article. The results show that the system can work well to collect data effectively, and satisfy the demands of precision agriculture.

  A Target Detection Mechanism in Sensor Networks Based on Statistical Hypothesis Testing

  CUI Xunxue1,XING Lijun1,FANG Zhen2

  2010, 32(11): 33-35. doi: 10.3969/j.issn.1007130X.2010.

  Abstract ( 441 )   PDF (420KB) ( 341 )   　　

  It is a hot research topic in the current military field that target detection is executed with many sensors in a networking manner. Target detection is also the fundamental function of a sensor network. However it is difficult for the current mechanism to describe the target discovery event which is based on an output signal threshold of the target. According to the mathematical statistics theory, the problem of target detection is modeled as a statistical inference process in the paper. A target detection mechanism based on the hypothesis testing method is proposed. In this mechanism the testing parameters can be determined by a sample training process, and moreover a data fusion method is adopted for the detection result optimization. The experimental results show that this mechanism can avoid the noise interference in the detection process, and improve the exactness performance of target catch in sensor networks.

  A Data Approximation Method in Wireless Sensor Networks

  WEI Juwei,L Jianhua,ZHANG Baili

  2010, 32(11): 36-39. doi: 10.3969/j.issn.1007130X.2010.

  Abstract ( 478 )   PDF (429KB) ( 359 )   　　

  Wireless sensor networks usually have limited energy and transmission bandwidth, and restricted computing and storage capacity, which pose new challenges in data dissemination and data analyzing and mining. This paper proposes a data approximation method, discusses data compression and approximate recovery, and analyzes its corresponding similarity measure. Theoretically and experimentally, under the circumstance of guaranteeing data precision, this method can compress data efficiently to save storage space, and reduce the amount of data transmission. Moreover, it can also analyze the similarity measure based on the compressed data, which can improve the efficiency of cluster analysis of data.

  DRAD：A Data Collection Algorithm Based on Asynchronous DutyCycle in Wireless Sensor Networks

  LIU Weishan,CHEN Xiaojiang,DUAN Ren,CHEN Wenjuan,LIU Chen,FANG Dingyi

  2010, 32(11): 40-43. doi: 10.3969/j.issn.1007130X.2010.

  Abstract ( 530 )   PDF (588KB) ( 366 )   　　

  Data collection is one of the basic functions of wireless sensor networks and has been applied to environmental monitoring. How to reduce power consumption and prolong the network lifetime is the frontier issue. This paper proposes DRAD, a data collection routing algorithm based on asynchronous dutycycle in wireless sensor networks. The asynchronous dutycycle avoids the consumption caused by time synchronization. Nodes only maintain the time differences from neighbors. So the network lifetime can be significantly prolonged through the asynchronous dutycycle. The duty cycles is used to measure energy consumption in experiments. The results show that DRAD performs in a stable range of low duty cycles and is effective in minimizing energy consumption and prolonging network lifetime.

  Research on the PCABased Data Aggregation in Wireless Sensor Networks

  MA Shouming1，WANG Ruchuan1，YE Ning1,2

  2010, 32(11): 44-46. doi: 10.3969/j.issn.1007130X.2010.

  Abstract ( 463 )   PDF (368KB) ( 343 )   　　

  An important goal in the design of wireless sensor networks is to maximize the lifetime under limited energy because of the battery capacity is difficult to reinforce.Innetwork data aggregation is an effective approach to reducing the amount of data transfer and total energy consumption aiming at lifetime maximization in wireless sensor networks.This paper proposes an incluster data aggregation method by utilizing the technology of reducing dimensions in the principal component analysis theory.The main idea of this method is that the cluster head node executes lineal transformations to transform the practical correlative variables which transform the member nodes into a few of disrelated compositive indexes, and subsequently transmits these resultant data in order to minimize the data transfer and energy consumption.The theoretical analysis and the instance validation show that this method has considerable validity and practicability.

  RealTime Energy Consumption Monitoring for Wireless Sensor Nodes

  ZHANG Fan,LI Wenfeng,SONG Wei

  2010, 32(11): 47-51. doi: 10.3969/j.issn.1007130X.2010.

  Abstract ( 442 )   PDF (639KB) ( 426 )   　　

  Energy efficiency is a key design issue in wireless sensor networks (WSNs).It is necessary to know the power consumption of each component before optimization. However, different applications need different configurations which will lead to many different hardware platforms. We do some research on the energy efficiency monitoring of WSNs, and propose a portable and realtime energy consumption monitoring device for wireless sensor nodes, which measures the current and voltage information in the real world. Compared to simulation, this can be used to monitor the energy efficiency of WSNs in the real world. Furthermore, the experimental results on the wireless sensor network platform named MicaZ show that our design can well monitor the energy consumption of WSNs. Moreover, the energy dissipation of each component on a sensor node also shows that the power consumption of sensors can not be ignored.

  SAR2:Mitigating the Packet Lossin Wireless Sensor Networks with SelfAdaptive Repair and Regulation

  MO Lufeng1,GUO Zhenge2,XI Wei3,LIU Zhuo4

  2010, 32(11): 52-54. doi: 10.3969/j.issn.1007130X.2010.

  Abstract ( 516 )   PDF (780KB) ( 473 )   　　

  Packet loss is observed to be a familiar phenomenon with transmissions of wireless sensor networks (WSNs). Frequent undesired packet loss seriously degrades the network performance. Since the causes of packet loss include a variety of factors, the existing designs to resolve the packet loss problem appear to be either complicated or inefficient. The realworld observations in GreenOrbs, a longterm largescale WSN system in the forest, reveal that RSSI (Received Signal Strength Indication) is a significant indicator of packet loss. Packets with RSSI near the noise floor (called gray region in this paper) suffer remarkable loss at the receiving node. Based on such observations, we propose a lightweight selfadaptive approach called SAR2 to mitigate packet loss, which include transmission rate regulation, transmission power regulation, and dynamic parent switch, respectively. We have implemented SAR2 on the TelosB motes. The experimental results demonstrate that SAR2 mitigates packet loss and enhances the network throughput.

  A HighSecurity Scheme of Private Key Protection

  ZHU Jiandong1,2,ZHU Zhiting1

  2010, 32(11): 55-57. doi: 10.3969/j.issn.1007130X.2010.

  Abstract ( 488 )   PDF (366KB) ( 373 )   　　

  The security of the CA private key guarantees the credibility of a digital certificate and the validity of the signature. In order to enhance the security protection of the CA private key, we distribute the CA private key to t signature servers with (t,n) secret sharing, each having a different private key sharing, and the private key sharing is  periodically updated using the proactive secret scheme. A phasebased RSA signature mechanism is used, each server calculating part of the signature, and then the signed proxy gets the final signature. In the whole process, the CA private key never reconstructs, so it strengthens the safety of the CA private key and the signature. Finally, heterogeneous platforms are  used to store the CA secret. VC and OPENSSL are adopted to realize it.

  A Scheme of Proxy Multiple Blind Signature Based on Elliptic Curve Cryptosystem

  Li Xinyan1,LU Dianjun2

  2010, 32(11): 58-59. doi: 10.3969/j.issn.1007130X.2010.

  Abstract ( 543 )   PDF (300KB) ( 391 )   　　

  At present, the security of Elliptic Curve Cryptography is based on the elliptic curve discrete logarithm difficulty, and its safety index is full index. According to the safety, we design an Elliptic Curve Cryptosystem proxy multiple blind signature that combes with the proxy signature and the multiblindsignature features.This signature scheme has simple steps, highlevel security,and achieves the task of agency and the requirements of multisignature. And this signature scheme has blind signature characteristics, can verify the identity in the case of unknown authentication, and a rigorous proof proves this signature scheme is practical,safe and effective.

  An Improved Electronic Evidence Dispersing StorageMethod Based on the Integrity Indication Code

  CHEN Long,LI Peng

  2010, 32(11): 60-62. doi: 10.3969/j.issn.1007130X.2010.

  Abstract ( 507 )   PDF (452KB) ( 475 )   　　

  Finegrained data integrity check to forensic copies can mitigate the disaster effect on the data by some random errors or intentional forging modification. An electronic evidence dispersing storage method is designed with the extra ability of fault tolerance. The idea is to improve their fault tolerance under the premise of ensuring the integrity of electronic evidence. The method distributes the electronic evidence to (p + q) data blocks. It generates fewer hash data to check the integrity of subblocks using the integrity indication code. In the case of no more than q error data blocks, it makes validity assessment in a fast check and recovers the original data. In the case of (q +e) (0＜e＜p) error data blocks, if each column of the error mapping matrix is not less than e elements of the value of 0, the original data is also recovered. The basic performance of the method is analyzed. The conclusion shows that adding a little additional hash data is able to obtain better data recovery effect. The method further enhances the fault tolerance and reliability of electronic evidence.

  A Smoothed Contours Generating Algorithm for the MultiSegment Bezier Curve

  HAN Lina1,GENG Guohua2

  2010, 32(11): 63-65. doi: 10.3969/j.issn.1007 130X.2010.

  Abstract ( 580 )   PDF (378KB) ( 453 )   　　

  In the process of generating contours automatically, it generates a polyline type of contour map if we connect the tracked point with the line. This paper proposes using the multisegment Bezier curve model to fit the contours. At first we use three Bezier curves fitting formula and leastsquares to get the four control points of the first segment of the Bezier curve. Then based on the smooth conditions of the Bezier curve and the acquired control points, we get the four subsegment control points with leastsquares. According to above ideas, we get the smooth contours. In addition, this paper proposes building the special case of the multisegment Bezier curve model in the condition of a smaller grid. Experiments show the proposed method is easy and feasible, and it has good visual effect.

  On a Automation Testing Method for Military Symbol Plotting Based on Image Analysis

  ZHAO Xiaoqin,WANG Yumei

  2010, 32(11): 66-70. doi: 10.3969/j.issn.1007130X.2010.

  Abstract ( 622 )   PDF (780KB) ( 422 )   　　

  Military symbol is a basic graphic element in the situation picture, which has an important meaning in military command and control systems. The current military symbol testing mostly adopts manual testing methods, which has low efficiency. This paper focuses on this issue, designs and implements an automated testing method for military symbols. Firstly, it achieves the target of automatic military symbol plotting; and then mainly uses the technologies of morphological expansion, corner detection and image binarization for image analysis, which gives a design and implementation on the military symbol testing for three commonly used attributes of line width, softening and color. Finally, according to the testing results ,it automatically builds the testing reports. The experimental results show that, this paper provides a feasible, effective automated testing way for the validation of military symbol correct drawing, and implements a new applicable scene for image analysis in the automated testing domain.

  Fusion of the Multifocus Images Based on the Nonsubsampled Contourlet Transform

  ZHOU Aiping，LIANG Jiuzhen

  2010, 32(11): 71-74. doi: 10.3969/j.issn.1007130X.2010.

  Abstract ( 624 )   PDF (570KB) ( 426 )   　　

  For the fusion problem of the multifocus images with the same scene, a novel multifocus image fusion algorithm based on the nonsubsampled contourlet transform (NSCT) is proposed. Firstly, source images are decomposed at different scales and directions by NSCT, thus the low frequency subband coefficients and various bandpass directional subband coefficients are obtained. Secondly, for the low frequency subband coefficients, we present a fusion rule based on the directional vector normal combined with the weighted average; while for the bandpass directional subband coefficients, we present a fusion rule based on the improved directional contrast combined with the local area energy. Finally, the fusion image is obtained through the inverse NSCT. The experimental results illustrate that the proposed algorithm is effective for retaining the original images’ information and avoiding artifacts.

  A Fire Image Recognition Algorithm Based on the Niche Technology

  WANG Haizhen1，LIAN Zuozheng2，TENG Yanping1

  2010, 32(11): 75-78. doi: 10.3969/j.issn.1007130X.2010.

  Abstract ( 508 )   PDF (443KB) ( 396 )   　　

  Fire image recognition is an important part of the fire detection research. With a continuous deep development of the artificial intelligence application technology, genetic algorithms and neural networks have also been applied to fire image recognition. Aiming at the problem that network structure is not easy to determine in fire image recognition based on genetic and neural networks, a fire image recognition algorithm based on genetic algorithms by the niche technology and neural networks is proposed. According to the characteristics of fire image recognition, the algorithm firstly establishes the multilayer front neural network model, determines the number of input and output level nodes, and undecides the number of the concealed levels and the conceal level nodes in the model, and then codes the network structure and weight value, threshold value, and trains the network model using genetic algorithms by the niche technology and the classic genetic algorithms. The experimental results show that the algorithm can reduce the number of evaluation generations effectively and speed up the training process. And finally we perform fire image recognition by the trained neural network model, and obtain better results.