基于节点运动的机会网络路由算法

机会网络利用节点移动带来的接触机会传输数据，数据在节点运动过程中捎带转发，保证了节点独立性，但会给数据传输带来影响.以节点的运动特性为切入点，设计了基于运动的机会网络路由算法.综合考虑数据传输、数据内容以及应用需求等因素，设计了数据转发优先级评价模型，结合节点活动区间划分方案制定数据传输规则；设计了差异化副本传输策略，在数据传输效率和系统开销之间取得折衷；考虑了节点活动范围、中心度及能量水平，构建了运动自由度函数评估节点运动水平.在此基础上设计了效用函数，选择中继节点转发数据.仿真结果表明，该算法能够在满足传输要求的同时限制网络开销，提高分组投递率，降低传输时延.

Routing Algorithm in Opportunistic Networks Based on Node Mobility

Opportunistic networks utilize the contact opportunities created by node movement to forward data between node pairs. Data is piggybacked during its carrier''s movement, which guarantees node independence while imposes an impact on data transmission performance. This study designs a routing algorithm for opportunistic networks based on node movement characters. Considering the factors of data transmission, data content and application demands, a data forwarding priority evaluation model is developed and adopted to determine the data transmission rules combined with the division of node activity range. The transfer strategy of differential message replicas is proposed to achieve a tradeoff between transmission efficiency and system overhead. A node free motion degree function is constructed according to activity range distribution, centrality degree, and energy level to evaluate the node motion level. And then a utility function is deduced for relaying node selection. The simulation results demonstrate that the proposed algorithm achieves higher packet delivery ratio and less delivery latency while satisfying application demands and restraining network overhead.