For mobile anchor node static path planning cannot accord the actual distribution of node for dynamic adjustment. We take advantage of the high localization accuracy and low computational complexity of ad-hoc localiza...For mobile anchor node static path planning cannot accord the actual distribution of node for dynamic adjustment. We take advantage of the high localization accuracy and low computational complexity of ad-hoc localization system( AHLos)algorithm. This article introduces mobile anchor nodes instead of the traditional fixed anchor nodes to improve the algorithm. The result shows that, through introduce the mobile anchor node, the information of initial anchor nodes can be configured more flexible.Meanwhile,with the use of the approximate location and the transition path,the distance and energy consumption of the mobile anchor node is greatly reduced.展开更多
The routing protocols play an important role for ad hoc networks performance.As some problems with DSR,SMR,and AMR protocols were analyzed,a new routing protocol suitable for UWB Ad hoc networks was proposed in this p...The routing protocols play an important role for ad hoc networks performance.As some problems with DSR,SMR,and AMR protocols were analyzed,a new routing protocol suitable for UWB Ad hoc networks was proposed in this paper.The new routing protocol utilize an act of orientation of UWB and tries to get sufficient route information and decrease the network load caused by route discovery at the same time.Simulation results show that the routing load of the new protocol is lower and throughput is higher than that of DSR.While the node’s mobility increases,these advantages become more obvious.展开更多
To improve the performance of Ad hoc on-demand multipath distance vector (AOMDV) protocol, we proposed NS-AOMDV which is short for “AOMDV based on node state”. In NS-AOMDV, we introduce node state to improve AOMDV’...To improve the performance of Ad hoc on-demand multipath distance vector (AOMDV) protocol, we proposed NS-AOMDV which is short for “AOMDV based on node state”. In NS-AOMDV, we introduce node state to improve AOMDV’s performance in selecting main path. In route discovery process, the routing update rule calculates the node weight of each path and sorts the path weight by descending value in route list, and we choose the path which has the largest path weight for data transmission. NS-AOMDV also uses the technology of route request (RREQ) packet delay forwarding and energy threshold to ease network congestion, limit the RREQ broadcast storm, and avoid low energy nodes to participate in the establishment of the path. The results of simulation show that NS-AOMDV can effectively improve the networks’packets delivery rate, throughput and normalized routing overhead in the situation of dynamic network topology and heavy load.展开更多
This paper proposes a new on-demand multi-alternate-path algorithm, called quickly switching routing algorithm(QSRA). It switches failure routing to an alternate path as quickly as the network can. Like a nervure shap...This paper proposes a new on-demand multi-alternate-path algorithm, called quickly switching routing algorithm(QSRA). It switches failure routing to an alternate path as quickly as the network can. Like a nervure shape, algorithm QSRA shapes disjoint-alternate-path structure, but is not limited to. It also contains another structure that every primary node has several links to alternate paths. This structure has two advantages, the first one is that primary nodes can select one alternate path immediately when primary routing is failure without going back to source node to re-discover a new routing or choose an alternate path; the second is that it guarantees primary nodes can select another alternate path as quickly as possible once one of alternate paths fails. Strongpoint of algorithm QSRA is reducing frequency of routing re-discovering. Besides, the structure occupies fewer resources than other routing algorithms due to its distributed structure. Simulation shows that QSRA has higher packets received ratio and lower control packet overhead and lower end-to-end delay.展开更多
多路径路由算法可以均衡负载、提高可靠性,但是A d Hoc网络的无线多播特性(WM A)使得多路径数据传输存在严重的冲突隐患,即便是节点不相交的多路径,以并发的方式来进行数据传输的效率并没有理论上的高.为此本文提出基于相关因子的节点...多路径路由算法可以均衡负载、提高可靠性,但是A d Hoc网络的无线多播特性(WM A)使得多路径数据传输存在严重的冲突隐患,即便是节点不相交的多路径,以并发的方式来进行数据传输的效率并没有理论上的高.为此本文提出基于相关因子的节点不相交的多路径路由算法(NDCF),该算法引入相关因子来衡量多条节点不相交路径以并发的方式进行数据传输时发生冲突的可能性的大小,从而选择冲突可能性最小的节点不相交路径.仿真结果表明,NDCF算法可明显提高数据包的投递率,降低端到端的传输时延.展开更多
基金National Natural Science Foundations of China(Nos.U1162202,61203157)the Fundamental Research Funds for the Central Universities and Shanghai Leading Academic Discipline Project,China(No.B504)
文摘For mobile anchor node static path planning cannot accord the actual distribution of node for dynamic adjustment. We take advantage of the high localization accuracy and low computational complexity of ad-hoc localization system( AHLos)algorithm. This article introduces mobile anchor nodes instead of the traditional fixed anchor nodes to improve the algorithm. The result shows that, through introduce the mobile anchor node, the information of initial anchor nodes can be configured more flexible.Meanwhile,with the use of the approximate location and the transition path,the distance and energy consumption of the mobile anchor node is greatly reduced.
基金National Nature Science Foundation of China (No. 60496311)Nature Science Foundation of Jiangsu Province (No. BK2004067&BK2005409)Foundation of Huawei Technology (No. YJCB2004018NP).
文摘The routing protocols play an important role for ad hoc networks performance.As some problems with DSR,SMR,and AMR protocols were analyzed,a new routing protocol suitable for UWB Ad hoc networks was proposed in this paper.The new routing protocol utilize an act of orientation of UWB and tries to get sufficient route information and decrease the network load caused by route discovery at the same time.Simulation results show that the routing load of the new protocol is lower and throughput is higher than that of DSR.While the node’s mobility increases,these advantages become more obvious.
文摘To improve the performance of Ad hoc on-demand multipath distance vector (AOMDV) protocol, we proposed NS-AOMDV which is short for “AOMDV based on node state”. In NS-AOMDV, we introduce node state to improve AOMDV’s performance in selecting main path. In route discovery process, the routing update rule calculates the node weight of each path and sorts the path weight by descending value in route list, and we choose the path which has the largest path weight for data transmission. NS-AOMDV also uses the technology of route request (RREQ) packet delay forwarding and energy threshold to ease network congestion, limit the RREQ broadcast storm, and avoid low energy nodes to participate in the establishment of the path. The results of simulation show that NS-AOMDV can effectively improve the networks’packets delivery rate, throughput and normalized routing overhead in the situation of dynamic network topology and heavy load.
文摘This paper proposes a new on-demand multi-alternate-path algorithm, called quickly switching routing algorithm(QSRA). It switches failure routing to an alternate path as quickly as the network can. Like a nervure shape, algorithm QSRA shapes disjoint-alternate-path structure, but is not limited to. It also contains another structure that every primary node has several links to alternate paths. This structure has two advantages, the first one is that primary nodes can select one alternate path immediately when primary routing is failure without going back to source node to re-discover a new routing or choose an alternate path; the second is that it guarantees primary nodes can select another alternate path as quickly as possible once one of alternate paths fails. Strongpoint of algorithm QSRA is reducing frequency of routing re-discovering. Besides, the structure occupies fewer resources than other routing algorithms due to its distributed structure. Simulation shows that QSRA has higher packets received ratio and lower control packet overhead and lower end-to-end delay.
文摘多路径路由算法可以均衡负载、提高可靠性,但是A d Hoc网络的无线多播特性(WM A)使得多路径数据传输存在严重的冲突隐患,即便是节点不相交的多路径,以并发的方式来进行数据传输的效率并没有理论上的高.为此本文提出基于相关因子的节点不相交的多路径路由算法(NDCF),该算法引入相关因子来衡量多条节点不相交路径以并发的方式进行数据传输时发生冲突的可能性的大小,从而选择冲突可能性最小的节点不相交路径.仿真结果表明,NDCF算法可明显提高数据包的投递率,降低端到端的传输时延.
