论文标题
基于用户流行的基于临时社交网络中拥塞控制的数据包计划
User Popularity-based Packet Scheduling for Congestion Control in Ad-hoc Social Networks
论文作者
论文摘要
传统的临时网络数据包调度方案无法满足基于接近的临时社交网络（ASNET）的要求，并且在拥挤的环境中它们的行为不能正确。为了解决此问题，我们建议在称为POP-AWARE的ASNET中基于用户流行的数据包调度方案。拟议的算法利用了发送者节点的社会流行，以优先考虑所有传入流。流行意见还提供了每种流量收到的服务的公平性。我们通过一系列模拟评估了流行音乐的性能。与某些现有的调度算法相比，流行音乐在控制开销，总开销，平均吞吐量，数据包损耗率，数据包输送率和平均延迟方面的表现更好。
Traditional ad-hoc network packet scheduling schemes cannot fulfill the requirements of proximity-based ad-hoc social networks (ASNETs) and they do not behave properly in congested environments. To address this issue, we propose a user popularity-based packet scheduling scheme for congestion control in ASNETs called Pop-aware. The proposed algorithm exploits social popularity of sender nodes to prioritize all incoming flows. Pop-aware also provides fairness of service received by each flow. We evaluate the performance of Pop-aware through a series of simulations. In comparison with some existing scheduling algorithms, Pop-aware performs better in terms of control overhead, total overhead, average throughput, packet loss rate, packet delivery rate and average delay.
