摘要： 根据数据分组扩散程度与投递状态具有直接关系的特点，提出一种带有数据分组扩散程度估计的机会网络分组调度机制。通过机会网传输机制估计每个数据分组的扩散程度，利用动态效用函数估算其效用值。在分组调度时删除效用值小的数据分组，以节点之间的相遇概率作为数据分组优先转发的依据。仿真结果显示，该机制能够提高数据分组的成功投递率，降低网络负载率及数据分组的传输时延。
关键词:
机会网络,
扩散程度,
分组调度,
投递机制,
动态效用函数,
相遇概率
Abstract: In opportunistic networks, spreading extent of packets has close relationship with packet delivery status. This paper proposes a packet scheduling mechanism with spreading extent estimation in opportunistic networks. It estimates the spreading extent of each packet according to delivery mechanism in opportunistic networks and their utilities by dynamic utility function. When it schedules the packets, the packet whose utility is smaller should be deleted first. And the nodes’ meeting probability is taken into account when packets are forwarded. Compared with the other traditional methods, simulation results show that the algorithm can improve the packet delivery probability effectively and reduce the network overhead and the latency of packet delivery.
Key words:
opportunistic network,
spreading extent,
packet scheduling,
delivery mechanism,
dynamic utility function,
meeting probability
中图分类号:
吕翊, 樊思龙, 吴大鹏, 孔晓龙. 带有扩散程度估计的机会网络分组调度机制[J]. 计算机工程, 2012, 38(06): 104-106.
LV Yi, FAN Sai-Long, TUN Da-Feng, KONG Xiao-Long. Packet Scheduling Mechanism with Spreading Extent Estimation in Opportunistic Network[J]. Computer Engineering, 2012, 38(06): 104-106.