自组织社会网络中的拥塞控制机制

发布时间：2018-07-07 09:30

  本文选题：拥塞避免 + 自组织社会网络　； 参考：《大连理工大学》2016年博士论文

【摘要】：传统的自组织网络在基础设施网络无法搭建的场景(如战场、自然灾害等恶劣环境)下可为用户提供快速的通信访问。自组织社会网络是传统自组织网络的一个分支,该网络在基础设施无关的分布式环境下,利用用户的社会属性,如社会图、社群、中心度、相似度、联系强度和人类移动模式等,为用户间提供更简单的通信方式,同时促进资源的高效利用。自组织社会网络在通信过程中通常交换两种类型的数据,分别为社会元数据和应用数据。其中,前者是为了获取节点间的相似兴趣或者分享节点的社会流行度,后者是为了在节点问传输文件或数据。但是,由于自组织社会网络处于无线通信环境下,其带宽十分有限,经常导致社会元数据和应用数据的传输拥塞。并且,当用户在单点运行多个社会应用时,很多情况下也会导致网络拥塞,具体包括：(ⅰ)源节点和中间节点的兴趣不匹配；(ⅱ)中间节点队列容量有限；(ⅲ)数据包调度不当；(ⅳ)目标节点链路容量不足；(ⅴ)不必要的确认消息等。通过研究移动设备用户间的社会联系,自组织社会网络已经成为移动网络的最重要的形式之一。由于社会网络用户的急剧增长,以及多个社会应用的同时运行,自组织社会网络的拥塞现象十分严重。因此,如何在资源稀缺的条件下最大限度的利用网络带宽是自组织社会网络最具挑战的任务之一。为了解决网络拥塞问题,传统的传输控制协议(TCP)采用往返时延机制使用户共享网络带宽。然而,该机制没有利用节点的社会属性,不能有效区分丢包类型。同时,应用的多样性和网络的动态性也将导致网络拥塞,进而大大降低中间节点的服务质量。因此,为了避免拥塞,中间节点经常采用弃尾或者随机早期丢弃技术来丢弃缓冲队列中的数据包。此外,为了控制中间节点的拥塞并最先获取最重要的数据,节点通信过程中的数据调度技术对于自组织社会网络是十分必要的。通常,自组织网络采用先进先出机制来进行数据包调度。最后,在多跳组织社会网络中,可靠的社会联系和流行节点的数据传输问题在拥塞控制中极其重要。由于数据包和确认包使用同一条路径,使得节点间竞争无线通信信道,导致数据包的碰撞,造成了多跳自组织社会网络的不可靠性。同时,不必要的确认消息和单节点的大量数据共享都会导致网络拥塞的发生。自组织社会网络中涉及到大量的用户,每位用户都希望高效的利用资源,与拥有相同兴趣的节点进行通信。因此,在这样的网络中,研究用户的社交属性是非常必要的,例如相似性、联系强度和社会图等。而且,为了更好的利用资源,中心度这一社会属性则是重中之重。所以,如何基于社会感知进行资源共享并且如何通过拥塞控制机制最大限度减少资源浪费是一个非常有意义的研究方向。为了解决自组织社会网络的资源浪费现象,首先要考虑网络拥塞问题,使得用户能在有效时间内获得所需的数据包。由于传统自组织网络没有考虑节点间的社会行为,所以现有的机制并不能满足自组织社会网络的需求,而且在拥塞的情况下性能表现不佳。为了更好的控制自组织社会网络的拥塞问题,本文从网络属性(如可用带宽、节点队列容量)和社会属性(如相似度、接近中心度、度中心度)两大方面出发,针对数据包的控制问题进行深入研究。本文主要解决了如下四个问题：(a)当中间节点带宽有限,且只愿意为拥有相同兴趣的发送方分享资源时,如何更好的在发送方之间分配带宽?(b)当中间节点接收到大量发送方传输过来的数据包,但自己的队列容量无法容纳所有的数据包时,哪种丢包机制和社会属性对于自组织社会网络更有意义?(c)中间节点如何最先传输具有社会优先权的数据包并保障服务公平性?并且,哪种社会属性有助于提高节点间的资源利用率,进而更高效的调度数据包?(d)哪种方法有助于解决拥塞控制机制中的可靠性问题?同时,当数据包经过多跳节点进行传输时,会遇到由于隐藏/暴露节点的问题和不必要的确认消息而造成目标节点和中间节点容量有限的困难,该方法如何保证资源的充分利用?首先,本文提出了一种基于社会感知的拥塞避免协议,称之为TIBIAS。该协议利用中间节点的相似度匹配,来提高自组织社会网络中的资源利用率,进而提升了整个网络的数据传输性能。在带宽资源分配的过程中,TIBIAS将高优先权赋予兴趣最相似的TCP连接,并且下层协议和接收节点都不需要做任何修改,保证了协议的独立性。实验结果表明,在链路利用率、拥塞窗口不必要的减小、吞吐量和重传率方面,TIBIAS协议比现有的拥塞控制协议表现的更好。其次,本文提出了一种基于生物启发的丢包算法(BPD)。该算法模拟免疫系统中受体和表位间的匹配过程来检测拥塞,基于节点的流行程度设置丢包概率。受到免疫系统中B细胞刺激过程的启发,BPD利用节点的两种社会属性,即相似度和接近中心度,来选择最优先的节点,并为数据包公平的赋权。大量的实验证明,在平均有效吞吐量、平均丢包率、总吞吐量、时延、获得带宽率和超载率方面,BPD算法胜过现有的方法。然后,为了解决自组织社会网络的拥塞问题,本文提出一种基于用户流行度的数据包调度算法,称为Pop-aware。该算法先计算中间节点的通信负载,接下来使用度中心度这一社会属性来计算发送方的社会流行度,进而对输入流进行优先权值排序。同时,Pop-aware通过计算主动服务率来保证数据流所获得服务的公平性。一系列仿真实验表明,在控制开销、总开销、平均吞吐量、丢包率、包交付率和平均时延方面,该算法性能优于现存的调度算法。最后,本文提出一种适用于自组织社会网络中流行数据的可靠传输控制协议,名为RTPS。该协议利用度中心度这一社会属性来计算发送节点的社会流行度,并以此为依据来分配带宽,从而提高了传输可靠性。同时,额外的带宽则分配给那些社会流行度更高的节点,且它们的确认消息也拥有更高的优先级。另外,通过延迟确认消息的传输,RTPS进一步减少了网络信道竞争和数据包丢失。RTPS是以接收方的角度工作的,不需要获取中间结点的确切信息。经过深入研究得出,在不同的跳距离和不同数量的TCP并发数据流的情况下,RTPS在吞吐量和传输延迟方面均具有明显的性能优势
[Abstract]:The traditional self-organizing network can provide rapid communication access for users under the unbuilt environment of infrastructure networks such as battlefield, natural disasters and so on. Self organizing social network is a branch of the traditional self-organizing network, which takes advantage of the social attributes of users, such as society under the unrelated infrastructure of infrastructure. Graph, community, community, centrality, similarity, connection intensity, and human mobility pattern, to provide a simpler way of communication among users, and to promote the efficient use of resources. In the process of communication, self organized social networks usually exchange two types of data for social meta data and applied data. Social popularity of similar interests or sharing nodes, which is designed to transmit files or data in nodes. However, since the self organized social network is in a wireless communication environment, its bandwidth is very limited and often leads to the transmission of social metadata and application data. And when users run multiple social applications at a single point, many of them are running. Network congestion can also lead to network congestion, including: the interests of the source node and the intermediate nodes are not matched; (II) the capacity of the intermediate nodes is limited; (III) the inadequacy of the packet scheduling; the insufficient link capacity of the target nodes; the unnecessary acknowledgement messages. Network has become one of the most important forms of mobile networks. Because of the rapid growth of social network users and the simultaneous operation of multiple social applications, the congestion of self organized social networks is very serious. Therefore, it is the most challenging to use the network bandwidth to maximize the use of network bandwidth under the condition of scarcity of resources. One of the tasks. In order to solve the network congestion problem, the traditional transmission control protocol (TCP) uses the round trip delay mechanism to make the user share the network bandwidth. However, the mechanism does not make use of the social attributes of the node, and can not effectively distinguish the type of packet loss. At the same time, the diversity of the application and the dynamics of the network will also cause the network congestion, and then greatly reduce the network congestion. In order to avoid congestion, in order to avoid congestion, the intermediate nodes often use abandoned tail or random early discard technology to discarding the data packets in the buffer queue. In addition, in order to control the congestion of the intermediate nodes and first obtain the most important data, the data scheduling technology in the node communication process is for the self-organized social network. It is very necessary. Generally, the self organizing network uses advanced first out mechanism to carry out packet scheduling. Finally, in the multi hop organizational social network, reliable social connections and data transmission problems of popular nodes are very important in congestion control. Because the data packets and confirmation packets use the same path, the nodes compete for wireless communication. Channels, resulting in the collision of packets, cause the unreliability of a multi hop self-organized social network. At the same time, unnecessary acknowledgement of messages and a large amount of data sharing of a single node will lead to network congestion. A large number of users are involved in the self organized social network, and each user wants to use the resources efficiently and have the same interest. In such a network, it is necessary to study the social attributes of the user in such a network, such as similarity, connection intensity and social map. Moreover, in order to make better use of resources, the social attribute of centrality is the most important. So, how to share resources based on social perception and how to control the congestion through congestion control. To minimize the waste of resources is a very meaningful research direction. In order to solve the waste of resources in the self organized social network, the problem of network congestion should be considered first, so that users can obtain the required data packets within the effective time. Because the traditional self-organizing network does not consider the social behavior among the nodes, the existing network has not taken into account the social behavior of the nodes. In order to better control the congestion of self organized social networks, this paper starts with two aspects of network attributes (such as available bandwidth, node queue capacity) and social attributes (such as similarity, proximity to centrality, degree centrality). The following four problems are discussed in this paper: (a) how to better allocate bandwidth between the sender when the intermediate node has limited bandwidth and is willing to share resources only for the sender with the same interest? (b) when the intermediate nodes receive a large number of packets sent by the sender, but themselves When the queue capacity cannot accommodate all packets, which packet loss mechanism and social properties are more meaningful for self organized social networks? (c) how does the intermediate node first transmit data packets with social priority and ensure service fairness? And which social attributes help to improve resource utilization among nodes and thus more efficient Scheduling packet? (d) which helps to solve the reliability problems in congestion control mechanisms? And when packets are transmitted through multiple hop nodes, it is difficult for the target node and the intermediate node capacity to be limited due to the problem of hidden / exposed nodes and unnecessary acknowledgement messages. To make full use of? First, a congestion avoidance protocol based on social perception is proposed, which is called TIBIAS., which uses the similarity matching of the intermediate nodes to improve the resource utilization in the self organized social network, and then improves the data transmission performance of the whole network. In the process of bandwidth allocation, the TIBIAS will have high priority. The TCP connection with the most similar interest is given, and both the lower layer protocol and the receiving node need no modification to ensure the independence of the protocol. The experimental results show that the TIBIAS protocol performs better than the existing congestion control protocol in the link utilization rate, the unnecessary reduction of congestion window, the throughput and retransmission rate. Secondly, this paper proposes A biologically inspired packet loss algorithm (BPD). The algorithm simulates the matching process between the receptor and the epitopes in the immune system to detect the congestion and sets the packet loss probability based on the popularity of the node. Inspired by the B cell stimulus process in the immune system, BPD uses two social attributes of the node, namely similarity and proximity to the centrality, to choose from the immune system. The BPD algorithm is better than the existing methods in terms of average effective throughput, average packet loss rate, total throughput, delay, bandwidth rate and overload rate. Then, in order to solve the congestion problem of the self organized social network, this paper proposes a user popularity based on this method. The packet scheduling algorithm, called Pop-aware., first calculates the communication load of the intermediate nodes, then uses the social attribute of the degree centrality to calculate the social popularity of the sender, and then prioritize the input stream. At the same time, Pop-aware ensures the fairness of the service by calculating the active service rate. A series of simulation experiments show that the performance of the algorithm is superior to the existing scheduling algorithm in the aspects of control overhead, total overhead, average throughput, packet loss rate, packet delivery rate and average delay. Finally, this paper proposes a reliable transmission control protocol which is suitable for popular data in self-organized social networks, named RTPS., which uses the degree centrality of the protocol. The social attribute is used to calculate the social popularity of the sending node, which is based on the allocation of bandwidth, thus improving the transmission reliability. At the same time, the additional bandwidth is allocated to those with higher social popularity, and their acknowledgement messages have higher priority. In addition, the RTPS is further reduced by delay acknowledgement of the transmission of messages. Less network channel competition and packet dropout.RTPS work on the receiver's point of view and do not have to obtain the exact information of the intermediate nodes. After in-depth study, the RTPS has obvious performance advantages in throughput and delay delay in the case of different jumps and different number of TCP concurrent data streams.
【学位授予单位】：大连理工大学
【学位级别】：博士
【学位授予年份】：2016
【分类号】：TN929.5
，

本文编号：2104538