Please wait a minute...

Current Issue

    25 November 2008, Volume 29 Issue 11
    Papers
    GSA:node failures tolerent spatial window query processing algorithm in wireless sensor networks
    Liang LIU,Xiao-lin QIN,Hua DAI,Jia-jia SHEN
    2008, 29(11):  2-11.  doi:1000-436X(2008)11-0002-10
    Asbtract ( 0 )   HTML ( 2)   PDF (2410KB) ( 7 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A node failures tolerent spatial window query processing algorithm called GSA was proposed.The grid size parameter was studied and a grid-based data collection schedule scheme to avoid the message collisions in the process of data collection was proposed.Finally,the influence of node density,the probability of node failure,query region size on the success rate of a query and the influence of node density,query message size,sensed data size,query region size,the probability of node failure on energy consumption were analysed.Analytical and experimental results show that in most cases GSA outperforms IWQE.

    Selection scheme of mobile sinks in wireless sensor networks
    Long CHENG,Can-feng CHEN,Jian MA
    2008, 29(11):  12-18.  doi:1000-436X(2008)11-0012-07
    Asbtract ( 0 )   HTML ( 1)   PDF (1118KB) ( 160 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Using mobile devices as sinks for efficient data collection in wireless sensor network (WSN),the architecture of multiple mobile sinks sparse wireless sensor network (M2S2N) was introduced.By taking the ubiquitous nature of mobile devices into consideration,different selection schemes of mobile sinks in M2S2N were compared,and an opportunistic transmission scheduling algorithm (OTSA) for M2S2N was further proposed.Simulation results indicate that the proposed sink selection scheme in OTSA-M2S2N is effective and can significantly improve the performance such as energy efficiency and successful transmission ratio.

    Novel high accuracy and coverage localization algorithm for wireless sensor networks
    Man-tian XIANG,Hao-shan SHI,Li-hong LI,Cheng-zhi LONG
    2008, 29(11):  19-23.  doi:1000-436X(2008)11-0019-05
    Asbtract ( 0 )   HTML ( 1)   PDF (1259KB) ( 7 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    In order to achieve the geographic positions of random nodes in wireless sensor networks more efficiently and aiming at the defect that poor accuracy and coverage of traditional bounding box approach,a new localization algorithm was proposed based on concentric triple-hop of node communication range.The result of simulation and analysis shows that the proposed algorithm can optimize the constraints on nodes’ positions prominently,increase the estimation accuracy and localization coverage significantly with sparse and non-uniform anchor distribution,decrease the energy consumption of sensor nodes accordingly.

    Distributed aggregate algorithm for average query based on WSN
    Cai-ping LIU,Ren-fa LI,Xi-ping LIU
    2008, 29(11):  24-30.  doi:1000-436X(2008)11-0024-07
    Asbtract ( 0 )   HTML ( 1)   PDF (1306KB) ( 64 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A distributed aggregate algorithm (DAA) for average query based on WSN was proposed.In DAA,the computation process of each node in WSN used the information gathered from just a few nearby neighbors.The algorithm offered a fundamentally distributed solution to analyze data locally without necessarily collected the information of whole nodes to a single central site,and did not require data fusion and long-distance communication.The algorithm could adaptively adjust query range according to query results as well.Analytical and experimental results show that the proposed algorithm has the advantages of good scalability、low power consumption,and is able to significantly prolong system life.

    Auto-negotiation time division MAC protocol for periodical data gathering in sensor networks
    Yi ZENG,Bo HU,Shun-jia LIU
    2008, 29(11):  31-39.  doi:1000-436X(2008)11-0031-09
    Asbtract ( 0 )   HTML ( 1)   PDF (1551KB) ( 6 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    On the analysis of data flow characteristics in periodical data gathering applications in wireless sensor networks,an auto-negotiation time division MAC protocol based on auto-negotiation slot allocation scheme was proposed.The slot allocation is carried out in the adaptive,distributed and localized manner.The simulation shows that power consumption in our protocol has been decreased to the one thirty of that in TAG protocol with extended ACK re-transmission scheme,while delivery ratio and maximum data latency suffer no deterioration.

    Diffusion-based time synchronization protocol for wireless sensor networks
    De-yun SUN,Jie SHEN,Hai-tao LIU
    2008, 29(11):  40-49.  doi:1000-436X(2008)11-0040-10
    Asbtract ( 87 )   HTML ( 2)   PDF (2389KB) ( 97 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    The lack of survivability in typical wireless sensor network (WSN) synchronization protocols leads to innovation in this hot topic,the diffusion-based time synchronization protocol (DTSP) makes nodes maintain themselves onto a global time consensus via local exchanges of timestamp information.DTSP cancels the synchronization root existing in most protocols which may cause security problems,by utilizing time-division and fault-tolerance technology,the survivability is enhanced further.Appling DTSP with typical WSN nodes,experiments give excellent results in survivability,precision and scalability.

    Study on capacity analytical model for multi-channel wireless sensor networks
    Ming-fei WANG,Lin-lin CI,Ping ZHAN,Yong-jun XU
    2008, 29(11):  50-61.  doi:1000-436X(2008)11-0050-12
    Asbtract ( 86 )   HTML ( 1)   PDF (1744KB) ( 237 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    An ideal packets pipeline operation scheme was used to set up the path-oriented capacity analytical model in single user multi-channel network.Then,through analyzing the essence of resource competition in multi-channel networks,the resource constraint model of node contention domain was constructed.Furthermore,the network capacity analytical model in multi-user multi-channel network was set up based on mathematical programming.The centralized and distributed computing methods and applications are studied.The model can describe the path capacity,the network capacity,and the contention relation of the flows in multi-hop multi-channel network.The model is simple,and it can direct the network deployment and the design of network protocols.

    Improved node localization algorithm for wireless sensor network
    Fan-zi ZENG,Zheng-zhang SUN,Juan LUO,Ren-fa LI
    2008, 29(11):  62-66.  doi:1000-436X(2008)11-0062-05
    Asbtract ( 88 )   HTML ( 3)   PDF (951KB) ( 243 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    An location algorithm called MCBN(Monte Carlo localization boxed using non-anchor) was proposed,which is based on the Monte Carlo localization algorithm.In this algorithm,the smallest anchor box is constructed by the anchor nodes within two hops in the network and the non-anchor nodes with minimum credit value and known coordinates,which leads to a shrank box where the sample and filter is more efficient to node location compared to the MCL and MCB.Simulation results show that MCBN has better performance than MCL and MCB in the node localization accuracy and energy consumption.

    Distributed algorithms for cooperative routing and power allocation in wireless sensor networks
    Jiang-bo SI,Zan LI,Lan-jun DANG,Zeng-ji LIU
    2008, 29(11):  67-76.  doi:1000-436X(2008)11-0067-10
    Asbtract ( 53 )   HTML ( 1)   PDF (2431KB) ( 81 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Based on the optimal power allocation in cooperative transmission,two distributed algorithms,distributed separate route and power allocation algorithm (D-SRPA) and distributed joint route and power allocation algorithm (D-JRPA),were proposed.The two algorithms combining the PHY (physical layer) and MAC (media-access control) protocol can get the similar performance as the corresponding centralized algorithms.Simulation results show that compared with D-JRPA,D-SRPA can save the total transmission power more efficiently.

    Comparison of error control schemes in wireless sensor networks
    Zhen TIAN,Dong-feng YUAN,Quan-quan LIANG
    2008, 29(11):  77-84.  doi:1000-436X(2008)11-0077-07
    Asbtract ( 138 )   HTML ( 1)   PDF (1650KB) ( 376 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Energy efficiency analyses of automatic repeat request (ARQ) and forward error correction (FEC) techniques were presented.Chase combining hybrid ARQ (HARQ) was proposed to achieve adaptive error control in wireless sensor networks.Moreover,Chase combining HARQ was compared with ARQ and FEC in terms of energy efficiency based on different communication distances and packet lengths.The simulation result shows that Chase combining HARQ is the optimal scheme on the whole.

    Smallest enclosing circle based localization approach for wireless sensor networks
    Quan ZHOU,Hong-song ZHU,Yong-jun XU,Xiao-wei LI
    2008, 29(11):  84-90.  doi:1000-436X(2008)11-0084-07
    Asbtract ( 102 )   HTML ( 3)   PDF (1025KB) ( 266 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A novel range-free localization approach-smallest enclosing circle based localization (SECL) has been proposed.This approach estimates the position of target by the center of smallest enclosing circle of neighboring anchor nodes.Comparing to centroid,SECL considers the geometrical coverage center of anchors rather than the geometrical mass center of them.Consequently,SECL is more robust when the topology of anchors is not uniform.Simulation results show that SECL outperforms centroid by an average of 10%,and even better when the topology is not uniform.

    Minimum connected dominating set algorithm based on directed diffusion
    Ke-qing LI,Jin-yi CHANG,Jia-nian WANG
    2008, 29(11):  91-97.  doi:1000-436X(2008)11-0091-07
    Asbtract ( 70 )   HTML ( 1)   PDF (1423KB) ( 281 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A new minimum connected dominating set algorithm based on directed diffusion MCDSDD was proposed,which attempted to improve the existed area coverage algorithms through introducing node’s gradient in wireless sensor networks.During built a directed tree rooted from sink node using directed diffusion routing algorithm,an ascending node’s gradient series could be constructed.Non-adjacent sensor nodes were picked out and made up a maximum dominator set during routing information diffusion gradient by gradient,and then some intermediate nodes are sought from those nodes,which were adjacent to both nodes unconnected in maximum dominator set and their gradients just between them yet,to “glue” the non-adjacent two nodes in maximum dominator set,and last,an approximate minimum connected dominator set was constructed.Simulation results show that MCDSDD can save time and multiple covers hot spot in the surveillance area,and prolong the life time of the WSN.

    Virtual backbone formation algorithm based on GBG for wireless sensor networks
    Yan-jing SUN,Jian-sheng QIAN
    2008, 29(11):  98-104.  doi:1000-436X(2008)11-0098-07
    Asbtract ( 63 )   HTML ( 1)   PDF (921KB) ( 92 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    An approximation algorithm of virtual backbone formation (VBF) based on a more generalized and realistic wireless network communication model of bounded growth graph (GBG) was proposed.This approach constructs an maximal independent set (MIS) by network decomposition scheme and a clustergraph by coloring,computes local minimum dominating sets in 2-separated collection of subnets to form a global optimal solution which is used to directly construct an approximation minimum connected dominating sets by adjusting transmission range of clusterheads and finally use marking process and self-pruning to reduce the virtual backbone,without additional gateways.The computed connected dominating set guarantees a constant stretch factor and constant degree while the nodes only require direct neighborhood information.The efficiency and correctness of the VBF is confirmed through theoretical analysis as well as comparison study in details.

    Trust based secure routing algorithm for wireless sensor networks
    Chao WANG,Xiang-yu JIA,Qiang LIN
    2008, 29(11):  105-113.  doi:1000-436X(2008)11-0105-08
    Asbtract ( 146 )   HTML ( 11)   PDF (1035KB) ( 427 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    In order to deal with the safety hidden trouble caused by that the nodes in wireless sensor networks were lack of fixed infrastructure and it was hard to check the malicious behavior of the nodes,so the conception of nodes’ trust was proposed combined with swarm intelligence optimization algorithm.It introduced nodes’ trust as a allocation strategy of pheromone,which was similar to a reliable and secure label of MPLS,so as to set up the reliable and secure route,remove the malicious nodes from the network,and provide reliable and secure wireless sensor network environment.Simulation experiments show that it can effectively resist the wormhole attack,which is lack of effective methods to resist at present.

    Robust estimator for indoor node localization
    Fang ZHAO,Yan MA,Hai-yong LUO,Quan LIN
    2008, 29(11):  113-120.  doi:1000-436X(2008)11-0113-08
    Asbtract ( 61 )   HTML ( 1)   PDF (1393KB) ( 183 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A novel indoor localization algorithm was presented,which employs robust estimator to identify and restrain ranging outliers or gross errors and uses DFP (davidon fletcher powell) method to majorize the global object function with a convergence within 2 steps.It first divides all the ranging measurements into three different domains (effective information,usable information and bad information) according to the corresponding residual errors,and then adopts different weighting scheme (maintaining,down-weighting,rejecting) through self-adaptation during iterative process.Extensive simulation results confirm that this proposed localization scheme outperforms remarkably traditional least squares (LS),which do not employ outlier identification and restraint.

    Effective strategy for hybrid sensor networks in an unknown environment
    Wei ZHUANG,Guang-ming SONG,Ai-guo SONG
    2008, 29(11):  121-127.  doi:1000-436X(2008)11-0121-07
    Asbtract ( 48 )   HTML ( 1)   PDF (1326KB) ( 112 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    An effective strategy for hybrid sensor networks was proposed.It is designed to be used in an unknown environment.The system contains two-tier networks,sensor network and ad-hoc network.The coordination of two networks could enhance abilities in sensing,task executing,communication,etc.Meanwhile,simultaneous localization and navigation acting as the important applications in hybrid sensor networks were illustrated in this paper.The flooding technique was adopted to deduce a path to the region of interest.A simple approach of video signal propagation as a significant application of the whole system was also presented.The received signal strength indicator was adopted to reflect the relationship between the sender and receiver.Also,the received signal strength of WiFi radio was employed to be a criterion for the movement of the robots.The real experimental results validate the feasibility and reliability of the proposed strategy.

    Energy-efficient and fast method on storage and querying in wireless sensor networks
    Shao-liang PENG,Shan-shan LI,Yu-xing PENG,Xiang-ke LIAO,Nong XIAO
    2008, 29(11):  128-138.  doi:1000-436X(2008)11-0128-11
    Asbtract ( 79 )   HTML ( 2)   PDF (2333KB) ( 449 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    This work,focuses on unstructured random data storage and query.Since the energy is one of the most precious resources,an MESQ optimization problem is formed whose aim is to select the optimum number of replicas and queries that minimize the total energy cost,subject to unrestrained or restrained storage.In order to make more practical,a localized data dissemination algorithm,called BubbleGeocast,is designed.It is made up of two components:adaptive accurate data diffusion in real-time and rejection-based uniform data diffusion.The first one can control the total number of replicas and branch adaptively to diffuse data as soon as possible.The second one can guarantee each node accepts a packet in the same probability according to the area of its own Voronoi cell.These two can diffuse replicas and queries accurately,fast,uniformly,and robust.Simulations show that BubbleGeocast provide reduced 30% communication costs,30% delay on replicas diffusion,and 50% delay on query on average,within the bound of successful query.

    Vehicle classification algorithm based on binary proximity sensors and neural networks
    Wei ZHANG,Guo-zhen TAN,Nan DING,Yao SHANG
    2008, 29(11):  139-144.  doi:1000-436X(2008)11-0139-06
    Asbtract ( 61 )   HTML ( 3)   PDF (1447KB) ( 239 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    To improve the classification accuracy,a new algorithm was developed with binary proximity magnetic sensors and back propagation neural networks.In this algorithm,use the low cost and high sensitive magnetic sensors to detect the magnetic field distortion when vehicle pass by them and estimate vehicle length with the geometrical characteristics of binary proximity networks,and finally classify vehicles via neural networks.The inputs to the neural networks include the vehicle length,velocity and the sequence of features vector set,and the output is predefined vehicle types.Simulation and on-road experiment obtains high recognition rate of 93.61%.It verified that this algorithm enhances the vehicle classification with high accuracy and solid robustness.

    Analysis of energy efficiency for cooperative beamforming in wireless sensor networks
    Jian-cun FAN,Qin-ye YIN,Wen-jie WANG,Ang FENG
    2008, 29(11):  145-151.  doi:1000-436X(2008)11-0145-07
    Asbtract ( 40 )   HTML ( 1)   PDF (1498KB) ( 133 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    The energy consumption of cooperative beamforming was studied under given requirements on the end-to-end bit error rate (BER),and the optimal numbers of cooperative node were obtained for different propagation environments and transmission distances.Considering both transmit and circuit energies,a practical energy consumption model of cooperative beamforming in WSN was first proposed,and then its closed-form approximate solution was obtained.Based on this model,the energy consumption of cooperative beamforming was minimized by optimizing the numbers of cooperative nodes.Analysis and simulations show that over some distance ranges,cooperative beamforming can achieve energy savings compared with non-cooperative and STBC-based cooperative systems.Moreover,it is showed that there are the optimal numbers of cooperative nodes to minimize the total energy consumption for different propagation environments and transmission distances.

    Iterative joint source channel decoding for WMSN
    Yang YANG,Yong-rui CHEN,Jun-lin ZHAO,Wei-dong YI
    2008, 29(11):  152-157.  doi:1000-436X(2008)11-0152-06
    Asbtract ( 54 )   HTML ( 1)   PDF (1311KB) ( 147 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    An iterative joint source channel decoding (ISCD) scheme for WMSN is proposed,based on a soft-input-soft-output (SISO) a posteriori probability decoding algorithm for variable-length coded sources,which leads to not only maximum likelihood (ML) sequence estimation but also the computation of bit-based reliability values which are necessary for ISCD.Another innovation is that the technique of scaling extrinsic information is brought into the field of ISCD,and the optimal constant scaling factors is obtained under the guide of extrinsic information transfer characteristic.This technique improves the ISCD performance with increasing neglectable complexity.The notable feature of the proposed technique is that it requires very low computational complexity and small memory space,and can be applied to WMSN nodes.Simulation results show that the proposed ISCD scheme provides a significant improvement on error protection capability for the variable-length coded data in WMSN.

    Technical Reports
    Construction of large-scale wireless sensor network using ZigBee specification
    Xiao-liang CHENG,Zhi-dong DENG
    2008, 29(11):  158-164.  doi:1000-436X(2008)11-0158-07
    Asbtract ( 177 )   HTML ( 9)   PDF (2268KB) ( 1024 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A new practicable and feasible networking policy was proposed,called one zone multi-PAN (personal area network[1]).A two-level abstract model of LS-WSN was proposed.Using BeeStack[2],which was a commercial network-ing protocol that complies with ZigBee specification[3],a prototype system of LS-WSN was constructed.Theoretically,a PAN can support 65 536 nodes.Thus,the size of our LS-WSN could be expanded up to 16 times compared to that of a PAN.Experiences show that the quality of service (QoS) of LS-WSN can be guaranteed.Furthermore,analysis shows that the network management,the data fusion,and the performance can be also improved.

    Unidirectional-link detection algorithms in wireless sensor networks
    Jun-jun SANG,Sheng-fei SHI,Jiang-zhong LI,Shu-guang XIONG
    2008, 29(11):  165-173.  doi:1000-436X(2008)11-0165-08
    Asbtract ( 47 )   HTML ( 2)   PDF (721KB) ( 118 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Three distributed approaches were presented to detect unidrectional-links and to support routing protocols to use them.The main idea of these approaches was using Beacon message to exchange some information between nodes.Real link data based experiments show that these approaches can reduce the average length of routing path by 37.8%~39.24%,and can improve the average deliver ratio by 23.82%.Simulation experiments show that these approaches are both efficient and scalable.

    RelicNet:highly reliable wireless sensor system for microclimate monitoring in wildland cultural heritage sites
    Ming XIA,Ya-bo DONG,Dong-ming LU,Ping XUE
    2008, 29(11):  173-185.  doi:1000-436X(2008)11-0173-13
    Asbtract ( 72 )   HTML ( 3)   PDF (3380KB) ( 344 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    RelicNet,highly reliable wireless sensor system for microclimate monitoring in wildland cultural heritage sites was proposed.RelicNet organized the whole system as a multi-tiered delay-tolerant network (DTN),and provided a cross-tier data reliability maintenance framework to ensure the reliability of each step of data delivery.The currently deployed system consists of 241 sensors covering 57 typical caves of the Mogao Grottoes,a well-known wildland cultural heritage site in the Gobi desert.The microclimate change patterns in caves were analyzed using the data collected by the system,and the reliability and long lifetime of the system were verified through network and battery performance evaluations.

    Adaptive data gathering mechanism in opportunistic mobile sensor networks
    Li-min SUN,Yong-ping XIONG,Jian MA
    2008, 29(11):  186-193.  doi:1000-436X(2008)11-0186-08
    Asbtract ( 55 )   HTML ( 1)   PDF (1362KB) ( 123 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    An adaptive data gathering scheme was proposed for the application which different transmission quality was needed for different kinds of data.In the scheme,every sensor was associated with a forwarding probability parameter;every message was associated with an importance factor parameter.The two parameters determined adaptively the count of replication of a message,while meeting the transmission quality requirement and minimizing the network overhead.Experiment results show that the proposed data gathering scheme can achieve the tradeoff between transmission performance and network overhead.

    Genetic algorithm-tabu search for mobile agents measurement scheduling in wireless sensor networks
    Sheng WANG,Xue WANG,Dao-wei BI
    2008, 29(11):  194-199.  doi:1000-436X(2008)11-0194-06
    Asbtract ( 39 )   HTML ( 1)   PDF (1022KB) ( 85 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A mixed strategy for mobile agents measurement scheduling in WSN was proposed,which was combined by genetic algorithm and tabu search.The proposed scheduling strategy takes the creation sequence,priority and energy consumption of mobile agents into consider,for reasonablely dispatching multiple mobile agents and ensuring the measurement performance of WSN.Simulation results demonstrate that the proposed algorithm can effectively arrange the order of mobile agents dispatching,where the energy consumption and time delay can be remarkablely decreased and the lifetime of WSN can be accordingly prolonged.

    Routing in multi-sink sensor networks based on gravitation field
    Shou-ling JI,Jin-bao LI,Hui XU,Li HUI
    2008, 29(11):  200-212.  doi:1000-436X(2008)11-0200-13
    Asbtract ( 66 )   HTML ( 1)   PDF (1885KB) ( 167 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    The process of data forwarding in sensor networks was analogy to electric charge moving in electrostatic field.By this analogy,a method which abstracted a sensor networks to a Gravitation Field was proposed.In this gravitation field,sinks had gravitation to the data and data could flow to sinks under this gravitation.Based on the gravitation field produced by sinks,a routing algorithm worked well in Multi-Sink sensor networks was proposed.This algorithm had a lower time and space complexity,and it could adapt to the variety of the network size dynamically.Theory analysis and experiments had proved that the method used less energy in communications,had a lower packet discard rate,and it could prolong the lifecycle of the networks effectively.

    Scalable and multi-application wireless sensor networks simulation based on node clustering
    Wen-jun LI,Hong-sheng LIN,Xiao-cong ZHOU,Yao-zhan ZHENG
    2008, 29(11):  213-219.  doi:1000-436X(2008)11-0213-07
    Asbtract ( 52 )   HTML ( 2)   PDF (932KB) ( 42 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A node clustering based approach was proposed to solve effectively the large scale WSN simulation with multiple applications by partitioning nodes into different clusters.Nodes in a single cluster running the same application were simulated with the same single entity.Interactions between nodes were simulated by entity communication,and a synchronous mechanism was also proposed to ensure the simulation events execute orderly.A node clustering based simulator ETMA was designed and implemented on top of TOSSIM.Empirical studies on ETMA show that the node clustering approach can support multi-application WSN simulation with high scalability.

    Concise Papers
    Low power data fusion for sensor node constrained by real time management in WSN
    Qin WANG,Chong LI,Ya-dong WAN,Lei LI
    2008, 29(11):  220-226.  doi:1000-436X(2008)11-0220-07
    Asbtract ( 53 )   HTML ( 1)   PDF (1242KB) ( 88 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Compared with general data fusion algorithms that fuse different space characteristics of data generated at the same time,a time series based node level data fusion algorithm constrained by real time management was proposed to study the different time features of the same space in industrial WSNs,which can meet real time management and is a efficient management way to these requirements.Theoretical analysis and experiments show that it has decreased the time of sending data,reduced 28% of the energy consumption,extended the network lifecycle,and saved the communication bandwidth.

    Integrated algorithm based on vectors in node localization for wireless sensor networks
    Yu-feng WANG,Yan WANG
    2008, 29(11):  227-231.  doi:1000-436X(2008)11-0227-05
    Asbtract ( 54 )   HTML ( 3)   PDF (1379KB) ( 172 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    An integrated algorithm based on DV-hop was designed and applied to mobile nodes.A location correction vector(LCV)was constructed by the differences between estimated distances and range measurements;an improved particle swarm optimization (PSO) was used to find correction steps of nodes;location correction equaled the value of LCV multiplying step.The algorithm and its complexity and validity had been approved through simulation,the results show that the localization error of DV-hop has been reduced by 75% using the algorithm,and it is also applicable to low-density networks.

    Analysis of link interruption characteristics in the DTN
    Yun LI,Xiao-ying WANG,Zhan-jun LIU,Ya-hui ZHOU
    2008, 29(11):  232-236.  doi:1000-436X(2008)11-0232-05
    Asbtract ( 75 )   HTML ( 1)   PDF (1267KB) ( 234 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    The characteristic of wireless link in the DTN has an important influence on the performance of networks.The deterministic and opportunistic events can lead to the link interruption in the DTN.The connection of wireless links was analyzed when deterministic interruption events exist.By finding common recovery time of two-node,the rules was gotten that connectivity characteristic of the wireless networks with changes over time.

    Distance estimating algorithm based on gradient neighbors in wireless sensor networks
    Ming-cai ZHENG,Da-fang ZHANG,Jin-qin ZHAO,Wen-wei LI
    2008, 29(11):  237-245.  doi:1000-436X(2008)11-0237-09
    Asbtract ( 54 )   HTML ( 1)   PDF (2029KB) ( 91 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A modified distance-estimating algorithm DV-GNN was presented to improve the precision of indirect distance measuring in wireless sensor networks,theoretical basis was analyzed,and implementing process was given.With the help of gradient neighbors,the resolving power of distance estimating was increased from effective radio range to the distance interval between nodes.Compared with the algorithm DV-hop,under the preservation of the low cost and overhead,the measuring accuracy was improved largely.The analysis and simulation validated that the method was quite effective in wireless sensor networks with dense nodes.

    Coverage quality measuring and optimization for moving target in sensor networks
    Xing-fa SHEN,Ji-ming CHEN,Zhi WANG,Guo-jun DAI
    2008, 29(11):  246-252.  doi:1000-436X(2008)11-0246-07
    Asbtract ( 72 )   HTML ( 1)   PDF (625KB) ( 233 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    The coverage quality measuring and optimization problems were studied using moving target tracking as the application background.Based on the idea of grid discretization,a graph-theory based algorithm was proposed to search minimal exposure path for the moving target barrier coverage problem using exposure as the performance metric.And a multi-step incremental barrier coverage optimization method was proposed based on the minimal exposure path.The proposed algorithms’ performance was validated by simulation experiments in the end.Experiments show the algorithms are applicable to the barrier coverage problems with arbitrary node distribution model,sensing model,network characteristics and moving path of the target,can decrease the number of nodes need to be deployed in order to meet the specific coverage quality requirement and accordingly cut the network cost significantly.

Copyright Information
Authorized by: China Association for Science and Technology
Sponsored by: China Institute of Communications
Editor-in-Chief: Zhang Ping
Associate Editor-in-Chief:
Zhang Yanchuan, Ma Jianfeng, Yang Zhen, Shen Lianfeng, Tao Xiaofeng, Liu Hualu
Editorial Director: Wu Nada, Zhao Li
Address: F2, Beiyang Chenguang Building, Shunbatiao No.1 Courtyard, Fengtai District, Beijing, China
Post: 100079
Tel: 010-53933889、53878169、
53859522、010-53878236
Email: xuebao@ptpress.com.cn
Email: txxb@bjxintong.com.cn
ISSN 1000-436X
CN 11-2102/TN
Visited
Total visitors:
Visitors of today:
Now online: