论文标题
高架控制,并在临时社交网络中可靠地传输流行数据包
Overhead Control with Reliable Transmission of Popular Packets in Ad-Hoc Social Networks
论文作者
论文摘要
可靠的社交连通性和流行节点数据的数据传输对于多主临时社交网络(ASNET)至关重要。在此网络范式中,传输不可靠可能是由多个在单个节点上运行的社交应用程序引起的。这导致节点和连接路径之间的争议。此外,交通拥堵可能是多个发件人将数据传输到单个接收器的结果,每个发件人都等待积极的确认继续前进。因此,由于使用往返时间在节点之间共享可用的带宽,因此传统的传输控制协议(TCP)在ASNET中的性能很差,并且确认为每个数据包提供了确认。为了解决这些问题,我们提出了一种称为高间接控制的技术,在临时社交网络(RTPS)中可靠地传输流行数据包,该技术通过根据其受欢迎程度将带宽分配给用户来提高传输的可靠性:将带宽分配给节点及其较高的普及及其确认的提高。此外,RTP通过延迟确认数据包传输而进一步减少了论文和数据包损失。我们的详细研究表明,RTP在吞吐延迟和开销方面具有出色的表现,并具有不同的跳跃距离和不同数量的并发TCP流量。
Reliable social connectivity and transmission of data for popular nodes is vital in multihop Ad-hoc Social Networks (ASNETs). In this networking paradigm, transmission unreliability could be caused by multiple social applications running on a single node. This leads to contentions among nodes and connection paths. In addition, congestions can be the result of multiple senders transmitting data to a single receiver and every sender waiting for a positive acknowledgment to move on. Therefore, traditional Transmission Control Protocol (TCP) performs poorly in ASNETs, due to the fact that the available bandwidth is shared among nodes using round trip time and the acknowledgment is provided individually to every data packet. To solve these issues, we propose a technique, called Overhead Control with Reliable Transmission of Popular Packets in Ad-Hoc Social Networks (RTPS), which improves transmission reliability by assigning bandwidth to users based on their popularity levels: extra bandwidth is assigned to the nodes with higher popularity and their acknowledgments are sent with higher priority. In addition, RTPS further reduces contentions and packet losses by delaying acknowledgment packet transmissions. Our detailed investigations demonstrate the excellent performance of RTPS in terms of throughput latency and overhead with different hop-distances and different numbers of concurrent TCP flows.