Please wait a minute...

Current Issue

    25 November 2010, Volume 31 Issue 11
    Network and Security
    Investigation of technical thought and application str for the internet of things
    Hong-bo ZHU,Long-xiang YANG,Quan YU
    2010, 31(11):  2-9.  doi:1000-436X(2010)11-0002-08
    Asbtract ( 0 )   HTML ( 2)   PDF (117KB) ( 23 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    On the basis of integrated analysis of basic concept and key techniques of internet of things (IOT),a core idea of IOT,“the multifield combined share and ubiquitous integrated service”,was put forward;a technical system framework of smart multifunction service platform was studied and its corresponding theoretical model for testing was set up;a commercial application model for market applications,combined share,ubiquitous service,commercial mode,and industrial structure of future IOT was researched and established;a new concept of “smart service store”was thought up and a “smart service store of IOT valley”was brought into being;an application strategy of newly rising smart service industry for the “post internet era”was emerged which was marked by IOT and characterized d smart services.

    Geometry-covering based localization for Jamming attack in wireless sensor networks
    Yan-qiang SUN,Xiao-dong WANG,Xing-ming ZHOU
    2010, 31(11):  10-16.  doi:1000-436X(2010)11-0010-07
    Asbtract ( 0 )   HTML ( 2)   PDF (161KB) ( 8 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A geometry-covering based localization (GCL) algorithm was proposed with the purpose of localizing the jamming attacker in wireless sensor networks.The knowledge of the convex hull in computing geometry,especially the smallest circle covering,was utilized in the process of GCL.Simulation results showed that GCL is able to achieve higher accuracy than other comparable localization algorithms in most cases,and that has the time complexity of O(nlogn) which is proper for resource-constrained sensor networks.

    Cooperative ARQ protocol based on switch and stay node selection in WSN
    Ying-bo HU,Yue-ming CAI
    2010, 31(11):  17-24.  doi:1000-436X(2010)11-0017-08
    Asbtract ( 0 )   HTML ( 2)   PDF (160KB) ( 7 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A cooperative automatic repeat request (ARQ) protocol based on switch and stay node selection (SSNS-CARQ) was proposed,which could obtain high energy efficiency and reliable transmission at the same time.A Markov model for analyzing the system throughput was built,and system throughput performance of the proposed protocol and the traditional ARQ protocol were analyzed based on such model.Based on a widely used energy consumption model in WSN,the energy consumption performance of SSNS-CARQ protocol and the traditional ARQ protocol were discussed and compared in terms of energy efficiency,and the effects that positions of relay nodes imposed energy efficiency were also disscussed.Numerical and simulation results validated the Markov model effective for analyzing the system throughput.It is shown that SSNS-CARQ protocol could perform better in terms of throughput and energy efficiency when compared with the traditional ARQ protocol through simulations.

    Novel and lightweight digital signature scheme
    Hou-zhen WANG,Huan-guo ZHANG
    2010, 31(11):  25-29.  doi:1000-436X(2010)11-0025-05
    Asbtract ( 0 )   HTML ( 1)   PDF (83KB) ( 7 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Digital signatures have many applications in information security,ncluding authentication,data integrity and non-repudiation.However,the number theoretic-based schemes such as RSA and ECC are relatively slow ance.These schemes do not seem to be suitable for small computing devices with limited computing capacity,such as smart cards,wireless sensor networks,and active RFID tags.Based on the hash authentication technology,a novel lightweight digital signature scheme was proposed for achieving secure and efficient signature function.Security analysis and experimental results show that it can be used as a possible alternative to the current public key cryptosystems.

    Reliable cooperative data transmission mechanism for wireless sensor networks
    Shu-kui ZHANG,Jian-xi FAN,Zhi-ming CUI
    2010, 31(11):  30-40.  doi:1000-436X(2010)11-0030-11
    Asbtract ( 91 )   HTML ( 2)   PDF (266KB) ( 269 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    The efficient data transmission problem through cooperative communication was studied,a network coding was designed with random binning implements for wireless sensor networks,a cooperative data transmission scheme combined with the network coding was proposed,analyzed the end-to-end outage probability was analyzed.the usefulness of relaying was evaluated,and an ACK-less data transmission method based on the cooperative mechanism was developed.The theoretical analysis and experimental simulations show that they allowing for a more efficient use of resources.

    Wyner-Ziv spatial scalable video coding using compressive sensing in ubiquitous networks
    Zong-liang GAN,Li-na QI,Gui-jin TANG,Xiu-chang ZHU
    2010, 31(11):  41-48.  doi:1000-436X(2010)11-0041-08
    Asbtract ( 92 )   HTML ( 1)   PDF (147KB) ( 140 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A novel Wyner-Ziv spatial scalable video coding using compressive sensing was proposed for the ubiquitous networks.At the encoder,both the base layer and enhancement layer encode the video signal independent,in which down-sampling video was coded by H.264 in the based layer and original video was coded with adaptive compressive sensing measurement,quantization and entropy coding in the enhancement layer.At the decoder,the base layer and enhancement layer jointly recovered the video signal using compressive sensing approach based on joint sparse model of inter frames.Theoretical analysis and experimental results show that the proposed video coding method can flexibly adjust the bit stream,and has better rate-distortion performance and the robustness of transmission.

    Broadcast authentication algorithm for wireless sensor networks
    Xuan-xia YAO,Xue-feng ZHENG,Xian-wei ZHOU
    2010, 31(11):  49-55.  doi:1000-436X(2010)11-0049-07
    Asbtract ( 66 )   HTML ( 2)   PDF (83KB) ( 261 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    In order to authenticate the broadcast data in wireless sensor networks efficiently,a broadcast authentication algorithm based on the properties of one-way,quasi-commutative and absorbency in Nyberg’s fasting one-way accumulator was put forward.The MACs computed by hashing the broadcast data with the shared key between the broadcaster and each scheduled receiver were used to be the accumulative items in this algorithm.The detailed analyses in the aspects of the security,anti-captured and costs show that the proposed broadcast authentication algorithm can authenticate the random broadcast data immediately in small area and meet the essential requirements for broadcast authentication in wireless sensor networks.

    Hybird group key management scheme for wireless sensor networks
    Yan-li CHEN,Geng YANG
    2010, 31(11):  56-64.  doi:1000-436X(2010)11-0056-09
    Asbtract ( 70 )   HTML ( 1)   PDF (159KB) ( 84 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Since sensor nodes join or leave the wireless sensor networks frequently,it is necessary to build a secure and efficient group key management system.An efficient and secure group key management scheme was proposed.Private-key cryptosystems are used to encrypt multicast messages and rekey the group when new nodes join the group,while the technology of identity-based broadcast encryption is used to distribute the group key and rekey the group when nodes leave the group.The proposed scheme satisfies the desired security properties,such as forward secrecy,backward secrecy and collusion resistant.Compared with existing group key management schemes in wireless sensor networks,the scheme can efficiently reduce key storage and communication overhead of rekeying messages.As storage overhead and rekeying cost of nodes are not dependent of the scale of networks,the posed scheme is applicable to wireless sensor networks.

    Energy efficient optimal sink position selection algorithm for multi-sink wireless sensor networks
    Wei TANG,Wei GUO
    2010, 31(11):  65-72.  doi:1000-436X(2010)11-0065-08
    Asbtract ( 61 )   HTML ( 2)   PDF (168KB) ( 169 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    In combination with the energy efficient routing algorithm,the optimal sink position selection problem was studied,which aimed to minimize the overall network energy consumption.When the candidate set of sink positions is finite,the problem is shown to be an integer linear programming problem,when the candidate set is the whole space,the problem is shown to be a nonlinear programming problem.Due to the NP-completeness of the problems,several heuristic algorithms were designed accordingly.The proposed algorithms were examined by extensive simulation experiments,the results show that the performances of presented algorithms are close to the optimality.

    Framework for mobility model detection based on local information
    Min PENG,Pei-lin HONG,Han-cheng LU,Kai-ping XUE
    2010, 31(11):  73-79.  doi:1000-436X(2010)11-0073-07
    Asbtract ( 47 )   HTML ( 1)   PDF (103KB) ( 64 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    In order to get the real-time mobility model information which could be exploited to assist routing decision,a framework for mobility model detection based on local information (FMDL) was proposed.In FMDL,each node collected the local information on connectivity through neighbor discovery mechanism and generated the connectivity matrix.The changing rule of relative position could be extracted from the connectivity matrix,and then the real-time mobility model was detected.The simulation results show that FMDL achieves high detection rate without any auxiliary equipment.

    Congestion control scheme based on frame transmission utility in wireless ad hoc networks
    Jin YE,Jian-xin WANG,Qiu-li LIAO
    2010, 31(11):  80-86.  doi:1000-436X(2010)11-0080-07
    Asbtract ( 47 )   HTML ( 1)   PDF (158KB) ( 75 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A MAC layer congestion notification scheme was proposed by using frame transmission utility.The TCP sender would reduce the congestion window based on ECN when forwarding nodes detect that the frame transmission utility was smaller than the threshold.This congestion control mechanism was realized only at the link layer and need not modify the existing transport protocol.The simulation results show that this scheme can effectively improve the network efficiency,especially in the case of multi TCP flows.The TCP throughput is increased by 50% and the fairness is satisfactory in the mean time.

    Data fusion protocol with source security for sensor networks
    Peng ZHANG,Jian-ping YU,Hong-wei LIU
    2010, 31(11):  87-91.  doi:1000-436X(2010)11-0087-05
    Asbtract ( 40 )   HTML ( 2)   PDF (73KB) ( 66 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    For the source security need,a digital signature scheme with aggregate signatures,data fusion and batch verification was proposed.Based on the proposed signature scheme and the homomorphic encryption technology,a data fusion protocol with secure sources was advanced.Security analyses show that the proposed signature scheme is secure based on the CDH assumption,and the proposed protocol can provide the collected data end-to-end confidentiality and authentication.

    transmission technique
    Spectrum allocation of cognitive wireless network based on immune clone selection optimization
    Zheng-yi CHAI,Fang LIU
    2010, 31(11):  92-100.  doi:1000-436X(2010)11-0092-09
    Asbtract ( 76 )   HTML ( 3)   PDF (158KB) ( 206 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    The spectrum sensing process was described based on WRAN.By analyzing physical connection of cognitive wireless network,the mathematical model of spectrum a location was given,and then it was converted into a constrained optimization problem,whose goal was to maximum the profit of network.An immune clone selection algorithm was proposed to solve the problem,and the algorithm convergent with probability 1 was proved.Finally,the simulation experiments were done to test the algorithm.The results showed that compared with CSGC algorithm (color-sensitive graph coloring) and GA-SA (spectrum allocation based on genetic algorithm),t is algorithm could achieve maximization of network profits.Meanwhile,the system simulation resu on WRAN confirmed its effectiveness.

    Design concept of novel balanced multi-band antenna for sensor
    Wen-jun LV,Hong-bo ZHU
    2010, 31(11):  101-106.  doi:1000-436X(2010)11-0101-06
    Asbtract ( 42 )   HTML ( 1)   PDF (167KB) ( 78 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Design concept of a novel balanced multi-band tag antenna for Internet of things sensors applications was proposed.The antenna has a symmetrical structure so that it can be easily and directly integrated with differential driving RF front ends.The antenna’s surface current distribution,radiation patterns,impedance matching characteristics and gain,were numerically studied by using computer simulations,and the operating principle of the antenna was determined.Based on the numerically and basic experimental results,it is concluded that the antenna has a compact size and moderate gain,and can cover the bands of 2.4~2.5GHz/5.1~12GHz,which are for RFID and short-range wireless access applications.Thus the antenna can be used as tag antenna for wireless sensors in Internet of things.

    Backoff algorithm in MAC layer for wireless multimedia sensor networks
    Rui-fang LI,Juan LUO,Ren-fa LI
    2010, 31(11):  107-116.  doi:1000-436X(2010)11-0107-10
    Asbtract ( 53 )   HTML ( 1)   PDF (277KB) ( 278 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A new SDDB backoff algorithm in MAC layer for wireless multimedia sensor networks was proposed,which could use different backoff scheme to different priority flows.It can support different services and avoid second-collision effectively.SDDB is able to ensure the demand of real-time traffic transmission,which doesn’t reduce the throughput.Simulation results show that SDDB algorithm is more suitable for WMSN.

    Cognitive radio frequency sense solution based on traction
    Yi-ming WANG,Liu-lei ZHOU
    2010, 31(11):  117-122.  doi:1000-436X(2010)11-0117-06
    Asbtract ( 59 )   HTML ( 1)   PDF (160KB) ( 76 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A frequency sense solution based on the double-station cooperation and multi-hop tracing localization was presented for resolving the hidden and exposed problems in the dynamic spectrum resource management so as to improve reliability and efficiency of the frequency sense and increase the utilization of spectrum.In this scheme,the secondary user could detect primary user’s existing by an improved centroid localization algorithm cooperated with a known position user.The detailed steps were proposed,the simulation results were discussed and the performance of the tracing localization was analyzed.

    Channel width adaptation algorithm in multi-channel vehicular networks
    Xin PENG,Ren-fa LI,Liang-jiao LIU
    2010, 31(11):  123-129.  doi:1000-436X(2010)11-0123-07
    Asbtract ( 48 )   HTML ( 1)   PDF (139KB) ( 117 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Aiming at the low utilization of spectrum resource in icular networks,an algorithm base on semidefinite programming was presented,which could be utilized to l width adaptation of multi-channel vehicular networks.Firstly,the algorithm need to measure the distance with the surrounding vehicles to compute conflict graph.And then the semidefinite programming relaxation was employed to co the competition of spectrum resource.Finally,the ultimate channel width adaptation was computed based on the initial channel assignment and compression process.Simulation results demonstrated that the new algorithm not only can promote network throughput,but also perform well on extremely dynamic topology.

    Least entropy based randomized strategy for wideband spectrum sensing with cooperation
    Lei-xin MAI,Xiao-wei QIN,Xu-chu DAI
    2010, 31(11):  130-137.  doi:1000-436X(2010)11-0130-08
    Asbtract ( 45 )   HTML ( 1)   PDF (141KB) ( 63 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    To study the strategy for wideband spectrum sensing in cognitive radio system,the relation between the accuracy of channel state estimation and entropy was analyzed from the perspective of information entropy.And then a least entropy based randomized strategy(LERS) for wideband spectrum sensing with cooperation was proposed.By fully utilizing priori information and actually sensed results of channel states,the proposed strategy could select sensing channels to minimize total entropy,and the spectrum sensing interval of each channel was automatically regulated.Theoretic analyses and simulation results show that the least entropy based strategy effectively improves the accuracy of channel state estimation and the efficiency of spectrum sensing.

    routing algorithm
    Motion state-based data delivery scheme of delay tolerant mobile sensor networks
    Kui-wu YANG,Kang-feng ZHENG,Yi-xian YANG,Shi-ze GUO,Bin WU
    2010, 31(11):  139-146.  doi:1000-436X(2010)11-0138-09
    Asbtract ( 74 )   HTML ( 1)   PDF (238KB) ( 76 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A motion state-based data delivery scheme (MSD) was proposed for delay tolerant mobile sensor network.By using the broadcasting signal of base station on the frequency of f1,sensor nodes could compute their own motion stated and delivery probabilities which provided the bases for messages transmitting between nodes on the frequency of f2.In order to improved network performance,MSD employed the message survival time and prior forwarding mechanism of own messages to manage the message queue.Simulation results show that the proposed MSD data delivery scheme has a higher message delivery ratio with lower transmission cost and less data delivery delay than other DTMSN (delay tolerant mobile sensor networks) data delivering approaches.

    Multi-path transmission strategy and congestion control scheme for multimedia sensor networks
    Chao SHA,Li-juan SUN,Ru-chuan WANG,Hai-ping HUANG
    2010, 31(11):  147-157.  doi:1000-436X(2010)11-0147-11
    Asbtract ( 67 )   HTML ( 2)   PDF (302KB) ( 107 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A multi-path transmission method for multimedia sensor networks was proposed.By considering the transmission time,residual energy as well as transmission rate of the wireless links,three classes of paths are established with the help of metadata packets.Network congestion rate is reduced as well by adjusting time intervals of sampling.Experiments results show that this method is well performed packet loss,real-time transmission as well as congestion control.

    Energy efficient relay node fast selection algorithm for multi-hop wireless sensor networks
    Guo-qiang ZHENG,Jian-dong LI,Hong-yan LI,Zhi-li ZHOU
    2010, 31(11):  158-170.  doi:1000-436X(2010)11-0158-13
    Asbtract ( 56 )   HTML ( 1)   PDF (232KB) ( 152 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Aiming at the inefficiency of the relay selection of data gathering protocol for multi-hop wireless sensor networks(WSN),an energy efficient relay node fast selection (EERNFS)algorithm was proposed.In EERNFS,time-sharing channel was adopted to maintain time synchronization of WSN and periodically update the information of the neighbor network node.The network nodes could be activated synchronously in any network listening/sleeping cycle according to a certain probability,thus the real-time consistency and the stability of the nodes’ connectivity degree in WSN were guaranteed.Based on the geographic priority,the value of the nodes and the distribution estimation of the route-link quality,the relay node was selected through the competition method and the competing between the candidate relay nodes was reduced through gradually multiplying time window hod.Theoretical analysis and simulation results show that EERNFS outperforms FFS(forwarder fast selection) and GeRaF in terms of energy efficiency,delay of data delivery,and data delivery rate so that the network lifetime is greatly prolonged.

    Robust K nearest neighbor query processing algorithm in wireless sensor networks
    Liang LIU,Xiao-lin QIN,Ya-li LIU,Bo-han LI
    2010, 31(11):  171-179.  doi:1000-436X(2010)11-0171-09
    Asbtract ( 60 )   HTML ( 3)   PDF (185KB) ( 37 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A robust K nearest neighbor query processing algorithm called ROC-KNN was proposed.It divides the query region into several sub-regions according the network topology.Each sub-region has a cluster node which collects the sensory data in it,sends it to the cluster node in the next sub-region until traversing all the sub-regions.Two distributed heuristic sub-region size setting and cluster node election algorithms were proposed to reduce the energy consumption.A query processing recovery algorithm using the non-cluster nodes in each sub-region was designed to reduce the outage probability caused by cluster node failures.The experimental results show that the ROC-KNN outperforms the existing algorithms in terms of energy consumption and query success rate.

    Algorithm of route discovery based on distance prediction in MANET
    Shi-bao LI,Li HONG
    2010, 31(11):  180-187.  doi:1000-436X(2010)11-0180-08
    Asbtract ( 52 )   HTML ( 1)   PDF (149KB) ( 258 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A scheme of route discovery was provided based on the distance prediction to destination.Hops table was established to store historical records.The long-range information and instantaneous information were extracted from historical records.The distance to the destination was calculated by weight sum of both long-range information and instantaneous information.By aid of the distance predicted,the optimized parameters of ERS including the initial TTL value,broadcast threshold and step size of ERS were calculated.Simulation results showed that the new scheme significantly improved performance of the protocol under many kinds of simulation scenarios.The routing overhead was saved and the end-to-end delay of the packet was reduced.At the same time,the new scheme was also easy to implement.

    routing technology
    Opportunistic spectrum access algorithm based on cross-layer optimization
    Jing ZHANG,Hong-bo ZHU
    2010, 31(11):  188-194.  doi:1000-436X(2010)11-0188-07
    Asbtract ( 40 )   HTML ( 1)   PDF (160KB) ( 199 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Aiming at the opportunistic spectrum access (OSA) system with periodic channel sensing,sensing activity of secondary users was modeled and analyzed with Markov process.Combining physical layer index with MAC layer index,a cross-layer performance measure termed effective transmission capacity (ETC) was introduced.Under the criterion of maximizing ETC,a cross-layer optimal OSA algorithm was proposed and the achievable average ETC of opportunistic spectrum sharing was deduced.Theoretical analysis and simulation results indicate that the proposed algorithm is better than single-layer optimal schemes for it provides the secondary users with higher ETC.

    Node localization algorithm based on kernel function and Markov chains
    Fang ZHAO,Hai-yong LUO,Quan LIN,Yan MA
    2010, 31(11):  195-204.  doi:1000-436X(2010)11-0195-10
    Asbtract ( 69 )   HTML ( 3)   PDF (208KB) ( 119 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    To position indoor objects accurately and robustly,a node localization based on kernel function and Markov chains was presented,which employs Bayesian filter framework and radio fingerprinting technology.It uses kernel function to construct likelihood function to take full advantage of the similarity between observation and several training samples,which avoids the error brought by employing a priori determined distribution model.Furthermore,the proposed algorithm uses Markov chains to improve the localization accuracy and shorten the positioning ime.It limits the search space of the matching grids with object's previous state and the environment layout,and refuses the object’s impossible position jump during the moving process.Experiments confirm that the proposed localization outperforms the algorithm with Gaussian distribution model.

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: