Please wait a minute...

Current Issue

    25 October 2010, Volume 31 Issue 10
    Next Generation Network Architecture and Protocol Design
    Review of next generation network architecture
    Qing-guo SHEN,Zhen-wei YU,Jing GONG
    2010, 31(10):  3-17.  doi:1000-436X(2010)10-0003-15
    Asbtract ( 0 )   HTML ( 4)   PDF (965KB) ( 10 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Diversities in mobility,ambienty,trusty and virtuality of heterogenous networks lead to a lot of research and new design in network architecture.The problems and challenges of network architecture in control,security and data plane were analyzed,and some proposed solutions such as those for Internet,telecommunication and military networks were summerized.Based on the network evolution history,it is pointed that the future development direction of network architecture is to extend in the planes of control,management,security and service.The flexible application (e.g.adaptation or nesting) and smart implementation (e.g.object/service/role oriented) of layered network architecture will enrich the paradigms of networks.

    Discovery of internet topology knowledge and its applications
    Guo-qing ZHANG
    2010, 31(10):  17-25.  doi:1000-436X(2010)10-0018-08
    Asbtract ( 0 )   HTML ( 2)   PDF (508KB) ( 10 )   Knowledge map   
    References | Related Articles | Metrics

    At first the definition of network structure and the differences between analysis method to network structure and those in the traditional disciplines were introduced.Then the Internet was taken as example to review main properties in the internet topologies,point out some widely existing misunderstandings,and present some applications which used topology knowledge of the internet.Finally,from the perspectives of both practical and academic development,the significance of new findings in the network topologies was highlighted.

    End-to-end multipath transport layer architecture oriented the next generation network
    Miao XUE,De-yun GAO,Si-dong ZHANG,Hong-ke ZHANG
    2010, 31(10):  26-35.  doi:1000-436X(2010)10-0026-10
    Asbtract ( 0 )   HTML ( 4)   PDF (932KB) ( 10 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    To solve the problem of inefficient transmission using multiple interfaces of multihome terminal in the tradition network,an end-to-end multipath transport layer architecture—E2EMP oriented the next generation network was presented.Through distributing data adaptively following characters of the end-to-end paths,adopting dual sequence space,implementing smart path management policies,the performance of the multihome terminal using E2EMP has significant improvement.The simulation results show that E2EMP aggregates bandwidth of the multihome terminal interfaces efficiently,and meanwhile promotes the security and reliability of end-to-end multipath transport.

    Adaptive opportunistic routing protocol based on forwarding-utility for delay tolerant networks
    Bo WANG,Chuan-he HUANG,Wen-zhong YANG
    2010, 31(10):  36-47.  doi:1000-436X(2010)10-0036-12
    Asbtract ( 120 )   HTML ( 14)   PDF (991KB) ( 109 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    An adaptive opportunistic routing algorithm based on utility called URD was proposed,and then the effectiveness of this algorithm was analyzed.At last,this algorithm was implemented using Java by ONE simulation tool and its performance was verified with the classical algorithms:Epidemic,PRoPHET and SprayAndWait.Simulation results show that URD algorithm can increase the probability of encountering opportunity between nodes,improve the efficiency of forwarding packets and reduce the delay overhead of network.

    Link duration probability based cross-layer routing protocol for epoch-based movement
    Jie SUN,Wei GUO
    2010, 31(10):  48-57.  doi:1000-436X(2010)10-0048-10
    Asbtract ( 87 )   HTML ( 3)   PDF (841KB) ( 119 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    The end to end transmission performance is very poor because of routing failure caused by node movement in MANET.To solve this problem,an algorithm for the link duration probability of epoch-based movement was proposed,and based on which a link duration probability based cross-layer routing protocol for epoch-based movement(LPCP)was proposed.LPCP cross-layer interacts with transport layer,and considered both the maximum path availability and the minimum hops of an end to end connection.Three complementary mechanisms:routing switch,save then forward,ack reconfirm were proposed to prevent routing failure and the transmission efficiency reduction.It is shown by computer simulation that LPCP results in a significant improvement of the packet loss caused by routing failure,and increase the throughput much more.

    Hybrid optimal cluster routing protocol for mobile ad hoc network
    Xiao-guang NIU,Li CUI,Chang-cheng HUANG
    2010, 31(10):  58-67.  doi:1000-436X(2010)10-0058-10
    Asbtract ( 89 )   HTML ( 6)   PDF (895KB) ( 454 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Based on the analysis of the cluster stability and maintaining overhead of cluster routing protocols in mobile ad hoc networks,a optimized clustering strategy was designed and a corresponding optimal cluster based hybrid routing protocol was proposed namely HOCR(hybrid optimal cluster routing).Simulation results show that HOCR conduces to better scalability,robustness,lower network maintaining overhead and adapts to large scale mobile ad hoc networks.

    Network Management and Network Control
    Information exchange model of multi control nodes in trustworthy and controllable network
    Peng WANG,Jun-zhou LUO,Wei LI,Xiao ZHENG,Yan-sheng QU
    2010, 31(10):  68-78.  doi:1000-436X(2010)10-0068-11
    Asbtract ( 55 )   HTML ( 3)   PDF (757KB) ( 41 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A new model based on two-layer Chord was proposed to realize information exchange between multi control nodes in trustworthy and controllable network.It constructs the two-layer Chord by constructing Chord between control nodes in AS and between ASes respectively.It uses this two-layer Chord to generate a two-layer aggregation tree automatically in exchanging process,which is used to realize basic information communication services.It provides AS administrative isolation for security and availability by guaranteeing path convergence for the same information in AS,and improves efficiency of communication.Meanwhile,it guarantees load balance between control nodes.Experiments verify that IEM has good performance.

    Resource control conflict detection mechanism in trustworthy and controllable network
    Yan-sheng QU,Jun-zhou LUO,Wei LI,Peng WANG,Jing TAN
    2010, 31(10):  79-87.  doi:1000-436X(2010)10-0079-09
    Asbtract ( 75 )   HTML ( 3)   PDF (754KB) ( 90 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    In order to achieve consistent resource control,a novel conflict detection mechanism was presented in trustworthy and controllable network.It first modeled the resource control system by defining resource state and policy actions,and then detected policies conflicts by simulating policies enforcement.It solves the problem that the traditional conflict detection mechanisms add too much burden to the managers and could only be implemented to certain resource control mechanisms.Experiments verify this mechanism has good performance.

    Dynamic flow control mechanism in large-scale streaming media multicast systems
    Hui WANG,Zhi-gang SUN,Bin DAI,Jun-feng HE,Zheng-hu GONG
    2010, 31(10):  88-97.  doi:1000-436X(2010)10-0088-10
    Asbtract ( 61 )   HTML ( 3)   PDF (860KB) ( 110 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    An edge-to-edge dynamic flow control mechanism--e2e-DFCM was proposed.The main idea of e2e-DFCM is as follows:The QoS level of packets which had been labeled with quality level identifier(QLI) was gathered and remapped by sending video gateway(SVG); Receiving video gateway(RVG) periodically sent multicast flow status information,including delay,loss rate,etc.;SVGs dynamically remapped and classified packets according to QLI and flow status information feedback from RVG,and reassigned each QoS level flow rates based on their utilities.Once the QoS of receivers could not be satisfied(i.e.,average delay and loss rate exceed the tolerable range),RVG even requested to down-grade its level,and SVG would reduce the sending rate.In the end,simulation results demonstrate e2e-DFCM’s effectiveness.

    Research on new kind of parallel packet switch based on CICQ
    Tao REN,Ju-long LAN,Hong-chao HU,Dong-nian CHENG
    2010, 31(10):  98-107.  doi:1000-436X(2010)10-0098-10
    Asbtract ( 37 )   HTML ( 3)   PDF (838KB) ( 70 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A distributed CICQ based DiffServ supporting parallel packet switch(CDPPS) was proposed.By using multiple low speed switches to construct parallel packet switch,CDPPS made it possible to construct DiffServ supporting scheduling scheme in high speed environment.Because CICQ could be used as central plane without any modification,CDPPS increased the efficiency of existing resources.As a result of using distributed scheduling algorithm,CDPPS eliminates the communication overhead,and reduces the hardware implementation complexity.Theoretic analysis and simulation results show that CDPPS can provide satisfying QoS for different traffic classes.

    Path assessment based network admission control algorithm
    Gong-an QIU,Chen XU,Guo-an ZHANG,Zhi-hua BAO
    2010, 31(10):  108-114.  doi:1000-436X(2010)10-0108-07
    Asbtract ( 49 )   HTML ( 6)   PDF (732KB) ( 70 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    The local link state metrics were measured by scheduler.At the same time,the stale path state metrics could be got from the router.The basic probability assignment functions of above metrics were described by the fuzzy state variableness.The path situation and the corresponding probability could be computed through data fusion based on Dempster rule.Then the path situation with the maximum probability would be regarded as the quasi-real-time path state.Network admission decision was made based on the estimated path state.Simulations show that the link utility of proposed policy has twice as the budget based network admission control under the similar blocking rate.And the complexity of network mechanism can be decreased by adding pre-computed at the edge to achieve coreless status in multi-hop networks.

    Time slot-based RED algorithm on self-similar flows:SFRED
    Hui WANG,Zhen-zhou JI,Yan-dong SUN,Yuan-zheng WANG
    2010, 31(10):  115-120.  doi:1000-436X(2010)10-0115-06
    Asbtract ( 84 )   HTML ( 3)   PDF (766KB) ( 47 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Based on fractional Brownian motion (FBM),one calculation of the packet drop probability in the RED algorithm was derived under self-similar flows.Based on the self-similarity and the long-range dependence characteristics of Internet network traffics,a time slot-based RED algorithm on self-similar flows(SFRED)was proposed to the router queue management.The packet drop probability is calculated in every time-slot so that the burden is greatly reduced.It is simulated by NS2 and the experimental results show that the algorithm SFRED outperforms RED.SFRED can control the queue length under adaptive flows with a good throughput.

    Network Security and Network Surviability
    Research on network survivability of distance vector routing protocol
    Bin WANG,Yun-fei GUO,Ju-long LAN,Chun-ming WU
    2010, 31(10):  121-127.  doi:1000-436X(2010)10-0121-07
    Asbtract ( 38 )   HTML ( 3)   PDF (570KB) ( 72 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    The network survivability based on distance vector routing protocol of the network was studied,and the definition of network survivability and its calculation method were given.In order to effectively improve the network survivability of the distance vector routing protocol,A method to measure the authenticity of the update routing message was proposed.Analysis showes that the method can effectively resist false routing messages attacks which is launched by the attack nodes in the network,so it can improve the network survivability of the distance vector routing protocol.

    Anonymous access protocol for media independent information service
    Guang-song LI,Jian-feng MA,Qi JIANG
    2010, 31(10):  128-137.  doi:1000-436X(2010)10-0128-10
    Asbtract ( 54 )   HTML ( 3)   PDF (756KB) ( 131 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    For anonymous access requirements of media independent information service (MIIS) in heterogeneous networks,an access protocol with user anonymity was proposed.With the aid of the home server,the mobile user and the information server mutually authenticated each other while keeping the mobile user anonymous.Compared with other schemes,the proposed protocol has better performance,and it is provably secure in the CK model.

    Identity-based roaming protocol with anonymity for heterogeneous wireless networks
    Qi JIANG,Jian-feng MA,Guang-song LI,Hong-yue LIU
    2010, 31(10):  138-145.  doi:1000-436X(2010)10-0138-08
    Asbtract ( 68 )   HTML ( 9)   PDF (733KB) ( 120 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    The security flaws of an identity-based authentication model were analyzed.The scheme failed to achieve entity authentication due to identity impersonation attack.Then,an improved authentication scheme was proposed to realize anonymous roaming in heterogeneous wireless networks.The authentication scheme improves the original one in two aspects.Firstly,the scheme remedies the security flaws and is provably secure in the CK model.Secondly,the scheme simplifies the protocol interaction and it is more efficient.

    Secure topology protocol for mobile peer-to-peer networks
    Zhi-yuan LI,Ru-chuan WANG
    2010, 31(10):  146-157.  doi:1000-436X(2010)10-0146-12
    Asbtract ( 53 )   HTML ( 3)   PDF (1038KB) ( 107 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    For the security problem in mobile peer to peer (MP2P) networks,an adaptive mobile peer-to-peer secure topology protocol (AMPSTP) was proposed.Firstly,Fortune algorithm was used to divide a large geographical region into some small sub regions.Secondly,temporary anchor node selection and update strategies were given.Thirdly,MP2P overlay network topology construction and maintenance mechanisms were also given.Fourthly,MP2P overlay network routing discovery algorithm and node selection mechanism based on game theory for MP2P networks were successively proposed.Finally,the performance of the AMPSTP protocol was theoretically analyzed and simulated on the platform of NS-2.Theoretical analysis and simulation results show that compared with MADPastry protocol,AMPSTP protocol not only can guarantee the network security and improve network performance,but also greatly reduce the control overhead.

    Access mechanism of TMP under mobile network
    Zhen-qiang WU,Yan-wei ZHOU,Zi-rui QIAO
    2010, 31(10):  158-169.  doi:1000-436X(2010)10-0158-12
    Asbtract ( 58 )   HTML ( 3)   PDF (988KB) ( 232 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    The publication of TCG MTM standard ensured the safety of mobile terminal and its promotion results in the changes of communication on mobile terminals.An access mechanism to trusted mobile platform(mobile terminals with MTM chips,TMP)was proposed on mobile Internet.This mechanism defined an extended service set as a service field,introduced TMP and Internet ISP of strategy decider management field,and defined two visit mode of TMP on mobile Internet,self field service and cross field visit.The progress of each mode was described in details.Cross field visit mode was defined as roaming service and resource request.The trusted evaluation system of TMP access mechanism was specifically described.Universal combinational safe mode was used to analyze the safety of the two TMP access.The analysis shows that this mechanism brings about trusted TMP access on mobile Internet and is safe,practical and high efficient.

    Network Virtualization and Overlay Network
    Short path first overlay building
    Guo-fu WU,Gang HAN,Wen-hua DOU
    2010, 31(10):  170-179.  doi:1000-436X(2010)10-0170-10
    Asbtract ( 52 )   HTML ( 3)   PDF (729KB) ( 169 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Shorter path first strategy to build topology matching overlay was presented.First,passive landmark based network distance prediction method was presented,and the network distance between peers could be predicted correctly with low overload and deployment cost.Then,table based diagonal space-filling curve map algorithm was presented,which could accelerate topology information selection.Finally,the process of building overlay using shorter path firs(SPF) strategy was described in detail.Experiment results shown that the SPF overlay can improve the topology matching remarkably.

    Node heterogeneous degree-based consistency maintenance method for unstructured overlay networks
    Lei YANG,Ren-fa LI,Yi-ming HU,Ken-li LI
    2010, 31(10):  180-189.  doi:1000-436X(2010)10-0180-10
    Asbtract ( 52 )   HTML ( 3)   PDF (685KB) ( 72 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Replica strong consistency maintenance for unstructured overlay networks was studied.Current replica consistency maintenance algorithms was summarized,and a novel replica consistency maintenance algorithm:node heterogeneous degree-based of consistency maintenance algorithm (NHDCOM) was proposed.NHDCOM denoted the replica node capability by node heterogeneous degree (NHD).It managed replica nodes using Chord protocol and collected those nodes NHD along with a replica heterogeneous degree collection tree (HDCT) built through the finger table-based ring partition method.Moreover,a replica update problem model was abstracted in NHDCOM,and then a minimum delay update-content tree algorithm based on dynamic programming method was proposed to improve the update speed.Theoretical analysis and simulation results demonstrate that this method is more efficient in maintaining strong replica consistency and updating replica nodes for unstructured overlay network systems.

    Reconstructing application layer multicast trees based on back-path scheme
    Ji-jun CAO,Jing XIE,Jin-shu SU
    2010, 31(10):  190-202.  doi:1000-436X(2010)10-0190-13
    Asbtract ( 51 )   HTML ( 3)   PDF (739KB) ( 51 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Firstly,the proactive policy to ALM tree which is based on Chord DHT was extended and a back-path scheme with which each node pre-calculates a backup path for itself was proposed.When the non-leaf node leaves,all its child nodes can switch to the respective backup path immediately.Moreover,the ChordM-FR protocol which based on Chord and adopts the Back-Path scheme was developed.The simulations demonstrated that the ChordM-FR can reconstruct ALM tree about 2.5 times faster on average than the ChordM-SR which adopted the reactive policy in reconstructing multicast tree.

    Conjunct model of cloud&client computing based on multi-agent
    Xiao-long XU,Chun-ling CHENG,Jing-yi XIONG
    2010, 31(10):  203-211.  doi:1000-436X(2010)10-0203-09
    Asbtract ( 68 )   HTML ( 3)   PDF (707KB) ( 145 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    In order to utilize the resources of all nodes in networks fully,a novel conjunct model of cloud & client computing based on multi-agent was proposed,dividing the computing environment into three layers in accordance with the type of node and adopting agent to represent the behavior and resource of node to realize more efficient resource sharing and collaboration.The model takes full account of available resources owned by terminal nodes and deploys tasks in an orderly manner to the core nodes,servers and terminal nodes in order to maximize the efficiency of the resource utilization.To assure that tasks could be completed efficiently and reliably,a multi-agent-based collaborative multi-ring management mechanism was also presented,which is particularly suitable for the cloud & client conjunct computing environment and propitious to enhance the stability of resources sharing and nodes cooperation and relieve the load of core nodes.Finally,the construction method of experimental system and application demonstration based on the model was provided for reference.

    Wireless Mobile Network and Sensor Network
    Adaptive guaranteed time slots allocation policy in wireless sensor networks with mobility awareness
    Xiao-ji LI,Chen CHEN,Hong-bing QIU,Wei MO
    2010, 31(10):  212-220.  doi:1000-436X(2010)10-0212-09
    Asbtract ( 37 )   HTML ( 2)   PDF (794KB) ( 122 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    To improve the connectivity in mobile wireless sensor networks,an adaptive GTS (guaranteed time slot) allocation algorithm with nodal mobility awareness was proposed.At first,the nodal location in next state was given by Kalman filters forecasting model.Then,a method that considered velocity,direction and relative mobility was used to define mobility level,based on which the nodal priorities for GTS reservation could be determined initially.Subsequently,the priorities could be adjusted adaptively according to the usage status feedback from allocated slots.Finally,the priorities could be used to determine the order for using GTS and the right of use an extra reservation slot.Simulation results show that the proposed scheme could increase the success rate of random access and ensure a lower average packets transmission delay and higher delivery ratio.Furthermore,with the adaptive adjustment scheme for reservation priorities base on usage feedback,the rate of correct utilization of allocated slots is increased significantly in the overall networks.

    Geographic based maximum lifetime routing in data aggregated wireless sensor networks with multiple base stations
    Wei TANG,Wei GUO
    2010, 31(10):  221-228.  doi:1000-436X(2010)10-0221-08
    Asbtract ( 36 )   HTML ( 3)   PDF (844KB) ( 84 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Network lifetime maximization in data-aggregated wireless sensor networks with multiple base stations by using geographic routing scheme was studied.To reduce the transmission overhead and avoid routing loops,home base station set potential descendent(HBSPD)algorithm was proposed,and linear programming method was used to optimize the network lifetime.Geographic location based multiple base station tessellation (GLMBST)algorithm was presented,and subgradient method was adopted to design the distributed algorithm.Performances of the proposed algorithms were verified by simulation experiments.

    Optimal cluster head deployment in heterogeneous wireless sensor networks
    Lin LIU,Hai-bin YU
    2010, 31(10):  229-237.  doi:1000-436X(2010)10-0229-09
    Asbtract ( 46 )   HTML ( 3)   PDF (726KB) ( 189 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Cluster-based method has better adaptability and energy-efficiency to wireless sensor networks (WSN) used for environmental monitoring.If the cluster head is served by more powerful node,the performance of WSN will be improved greatly.In large scale WSN,high-power cluster head deployment is a kind of NP-hard problem.The optimal problem of cluster head deployment was formulated as an integer programming with the condition of restrictions of cluster head capacity and the maximal cluster radius.To satisfy the time effectiveness,a heuristic algorithm called KMSA was proposed which was a hybrid algorithm of K-mean and simulated annealing.The simulation results show that the KMSA can improve the performance of WSN on varieties of network size and cluster number.

    Node characteristics based LR-WPAN routing algorithm research for network energy optimization
    Zhi-hong QIAN,Xiao-fan ZHANG,Yi-jun WANG,Ting-yan GUAN
    2010, 31(10):  238-243.  doi:1000-436X(2010)10-0238-06
    Asbtract ( 49 )   HTML ( 3)   PDF (627KB) ( 91 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    An enhanced algorithm named F-ZBR was proposed considering the weakness of ZigBee hybrid routing algorithms and the energy consumption in LR-WPAN network.The proposed scheme reduced overall energy consumption of network by the definition of minimum routing energy and controlling the direction of RREQ packet as well as the number of hop,besides the introduction of energy flag in RREQ packet.The analysis on simulation result indicated that F-ZBR performs significantly better than ZBR in packet delivery ratio,available nodes ratio as well as remaining energy ratio.By the algorithm,therefore,it may be depleted that huge data transmission gives rise to over-consuming energy of RN+nodes or even collapse in ZigBee network.And the algorithm also prolongs the life span of network.

    Fast handover scheme based on redundant router information and pre-buffering strategy for mobile IPv6
    Jun TANG,Chang-xing PEI,Bo SU
    2010, 31(10):  244-252.  doi:1000-436X(2010)10-0244-15
    Asbtract ( 68 )   HTML ( 3)   PDF (898KB) ( 171 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    The issue of IP connectivity resumption in case of erroneous prediction was investigated in fast handovers for IPv6 (FMIPv6) protocol.Based on the redundant router information and pre-buffering strategy,a new scheme called RIRS (router information redundancy scheme) was proposed.The scheme constructed redundant router table for handover in order to assist the mobile node to re-formulate a new care of address quickly,and employed pre-buffering strategy to protect the packets destined for mobile node during handover.Simulation results indicate that RIRS can achieve better performance in terms of handover latency and packet loss compared with FMIPv6.

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: