机会网络中数据传输策略研究

发布时间：2018-01-11 12:17

本文关键词：机会网络中数据传输策略研究　出处：《哈尔滨工业大学》2017年博士论文　论文类型：学位论文

更多相关文章： 机会网络 路由策略 自私性 安全性

【摘要】：无线自组织网络是一种无需基础设施、以自组织和多跳的方式构成的无线网络,并且具有部署便捷、组网灵活等优点,所以得到了广泛的应用。但是,在一些实际应用环境中,由于节点移动、节点稀疏,以及节点通信能力受限等因素会造成无线自组织网络的传输链路出现间断性连通。为了在上述环境中实现有效的数据通信,机会网络应运而生。机会网络是一种特殊的自组织网络,它能够利用节点移动带来的相遇机会以“存储-携带-转发”的方式实现间断性连通环境下的数据通信。这种特殊的通信方式给机会网络中数据传输策略的设计带来极大的挑战。因此,本文主要围绕机会网络中数据传输所面临的一些挑战性问题展开研究,研究内容包括以下几个部分:第一,提出了一种基于接入控制的机会路由策略ORAC。传统路由策略在数据传输中无法有效利用无线网络的广播特性,一旦选定的链路中断必须重新寻路再次发送。因此,设计有效的传输策略为用户提供良好的服务质量是一个有意义但是富有挑战性的工作,尤其在多种业务流并存且资源受限的情况下。受此启发,本文提出了一种基于接入控制的机会路由传输策略ORAC,它采用一种新的考虑节点各种资源(带宽、缓存和能量)的接入控制策略来选择节点的候选集,并且改进了原有机会路由机制使其能有效地为多种类型的业务流服务。ORAC策略可以有效地解决由于网络拥塞造成的丢包,进而提高传输效率,为各种类型的业务流提供更好的服务质量。最后,通过仿真实验,比较了ORAC策略与经典的机会路由策略在三类不同业务流共存时的传输时延。此外,还比较了ORAC与基于接入控制的带宽感知机会路由在系统吞吐量、流接受率、平均时延、开销、节点平均能耗和网络寿命方面的性能,并通过仿真结果验证了ORAC策略在上述各方面具有较好的性能。第二,提出了一种基于合作博弈论的路由转发策略Game R。机会网络中现有的路由策略分为单拷贝策略和多拷贝策略。单拷贝策略可以节省网络资源,但具有较长的传输时延和较低的成功传输率。多拷贝策略可以增加网络的鲁棒性、减少数据传输时延,但消耗大量的网络资源、具有较大的开销。因此,在资源受限的情况下,如何在单拷贝和多拷贝之间做一个很好的折中显得非常重要。受此启发,本文提出一种基于纳什议价解(Nash bargaining solution)的路由策略Game R。它将分布式数据传输映射为一个多方议价博弈模型,通过构造合适的效用函数实现数据的有效传输。Game R策略结合了单拷贝和多拷贝策略的优点,可以有效利用网络资源,并提高了数据的成功传输率,减少网络开销。通过实验仿真,分别比较了Game R路由策略与经典的单拷贝路由、多拷贝路由,以及固定副本数的路由策略在消息的成功传输率、平均时延、开销、有效吞吐量,以及一个综合指标五个方面的性能。实验表明,Game R路由策略在成功传输率、有效吞吐量,以及综合性能方面明显优于其他所比较路由策略,并且其开销和平均时延也较小。第三,针对机会网络中节点自私的情况,提出了一种基于博弈论的激励感知路由策略IAR-GT。机会网络中的节点可能由于资源不足或意愿性等因素表现出一定的自私性,这种自私性又可分为个体自私和社会自私。现有的大部分研究工作都是分别考虑这两种自私性,但在机会网络中,这两种自私性可能同时存在。因此,在机会网络中,如何兼顾这两种自私性设计一种有效激励路由策略是一个非常有意义又具有挑战性的问题。针对此问题,本文提出了一种基于鲁宾斯坦恩-斯塔尔议价博弈的激励感知路由策略。它将两个自私节点之间的数据转发映射为鲁宾斯坦恩-斯塔尔议价博弈,并且利用虚拟货币和构建博弈双方的价格函数来实现自私节点间的数据传输。利用真实数据集的仿真实验,在网络中节点自私的情况下,分别比较了IAR-GT路由策略与三种经典机会网络路由策略以及一种基于激励的路由策略在消息的成功传输率、平均时延、开销、以及一个综合指标四个方面的性能。实验表明,IAR-GT策略在成功传输率、平均时延、以及综合性能方面都优于其他几种路由策略。第四,在机会网络中节点存在恶意攻击的情况下,提出了一种基于社会信任的安全路由协议,SSNCR。机会网络主要通过节点移动机会与相遇节点进行通信,它不存在一条端到端的路径,并且链路经常变化及具有延迟容忍特性,这将使恶意行为对网络有更大的机会进行攻击,从而损害了整个网络性能。因此,如何设计安全高效的路由策略显得尤为重要。针对此问题,本文提出了一种基于社会信任的安全路由策略。该策略采用一种新的基于节点状态信息和社会关系的安全路由度量标准,并且根据此标准所选信任节点进行数据转发,从而实现数据传输中对节点的预先答应而丢包,信任聚集和诽谤三种攻击的有效防护。同时,该策略采用网络编码技术将要发送的数据包进行编码操作,加快了可信节点的数据传输进程并减少数据冗余。最后,利用真实数据集的仿真实验,分别比较了所提安全路由SSNCR与两种经典路由以及一种安全路由策略在成功传输率、平均传输时延、传输开销,以及平均信任值方面的性能。仿真实验表明,随着网络中异常节点数比例的增加,所提策略可以有效阻止恶意节点攻击,并且其成功传输率,传输时延和开销方面都取得较优的结果。
[Abstract]:Wireless ad hoc network is an infrastructureless wireless network, composed of self-organizing and multi hop mode, and has the advantages of convenient deployment, flexible networking, so it has been widely used. However, in some practical applications, due to the mobility of nodes, node sparse, transmission link and node communication limited the ability factors of wireless ad hoc networks appear intermittently connected. In order to achieve efficient communication of data in the network environment, the opportunity came into being. The opportunity network is a special kind of self-organizing network, it can use the opportunity to meet the mobile node "store carry forward" approach to continuous data the communication connectivity environment. This special communication brought great challenges to the design of data transmission scheme in opportunistic networks. Therefore, this paper mainly focuses on the opportunity network number According to some of the challenges facing the problem of the transmission research, the research content includes the following parts: first, put forward a kind of radio access control characteristics of opportunistic routing strategy of ORAC. routing strategy based on the traditional data transmission can not effectively use the wireless network, once the selected link interruption must re routing sent again. Therefore, the transmission effective strategies for the user to provide a good quality of service is a meaningful but challenging work, especially in a variety of business flow and the coexistence of resource constrained situation. Inspired by this, this paper proposes an access control strategy of ORAC based on opportunistic routing transmission, it uses a new variety of nodes resources (bandwidth, buffer and energy) access control strategy to select the node of the candidate set, and improved routing mechanism can effectively make the original opportunities for a variety of types The service.ORAC strategy can effectively solve the packet loss due to network congestion, and improve the transmission efficiency, to provide better quality of service for various types of traffic flow. Finally, through the simulation experiment, compared with the classical ORAC strategy opportunity routing strategy flow transmission delay coexist in three different types of business. In addition, comparison of the ORAC and bandwidth aware access control based on chance routing in system throughput, average delay, flow rate of acceptance, cost, performance, average energy consumption of nodes and network lifetime, and the simulation results verified that the ORAC method has better performance in the above aspects. Second, proposed an existing routing forwarding strategy strategy Game R. chance of cooperative game theory based routing in the network is divided into single copy strategy and multi copy strategy. Single copy strategy can save cyber source but with longer transmission. Transmission delay and low delivery success rate. Multi copy strategy can increase the robustness of the network and reduce the data transmission delay, but consume a large amount of cyber source has a larger, overhead. Therefore, in the condition of limited resources, how in a single copy and multiple copies of a good compromise is very important. Inspired by this, this paper puts forward a kind of based on Nash bargaining solution (Nash bargaining solution) routing strategy Game R. it will be mapped to a data transmission of distributed multi-party bargaining game model, the utility function to construct appropriate implementation of effective transmission of.Game R data combined with the strategy of single copy and multiple copy strategy has effectively the use of cyber source, and improve the success rate of data transmission and reduce the network overhead. The simulation results were compared with the classical Game R routing strategy for single copy routing, multi copy routing, to The routing strategy and the number of copies of fixed rate, average delay, cost, throughput in the successful transmission of the message, and the performance of the five aspects of a comprehensive index. The experimental results show that the effective throughput of Game R routing strategy in the successful transmission rate, and the overall performance is better than other comparative routing strategy, and its cost and the average delay is small. Third, the opportunity to selfish nodes in the network, this paper proposes a node incentive aware IAR-GT. routing strategy opportunity of game theory in the network may be based on due to the lack of resources or other factors will show some selfish, the selfish and can be divided into individual selfish and social existing selfish. Most research work is considered the two selfish respectively, but in the opportunistic network, these two kinds of selfishness may exist at the same time. Therefore, the opportunity to network, how to balance the two Self designing an effective incentive routing strategy is a very meaningful and challenging problem. To solve this problem, this paper proposes a strategy of incentive Lubinsitanen - aware routing based on Starr bargaining game. It will be between two selfish nodes to forward data mapping for Lubinsitanen - Starr bargaining game, the price function and the use of virtual money and the construction of the game both sides to realize the data transmission between selfish nodes. Using simulation experiments on real data sets, in the case of selfish nodes in the network, respectively, compared with the three classical IAR-GT routing strategy opportunity network routing strategy and a routing strategy based on the excitation of the successful transmission of message rate. The average latency, overhead, and performance of the four aspects of a comprehensive index. The experimental results show that the average delay of IAR-GT strategy in the successful transmission rate, and comprehensive The performance is better than the other fourth. There are several routing strategies, nodes in opportunistic networks in the case of malicious attacks, proposes a security routing protocol based on social trust, SSNCR. network mainly through mobile nodes to meet opportunities and communication, it does not exist an end-to-end path, and often change link and with delay tolerant characteristics, which has a greater chance of network attacks malicious behavior, which impairs the performance of the network. Therefore, how to design a secure and efficient routing strategy is particularly important. To solve this problem, this paper proposes a secure routing strategy based on social trust. This strategy uses a new the measure of security routing node state information and based on the social relation, and according to the standard of the selected trusted nodes for data forwarding, so as to realize the data transmission of Promised and loss of nodes, trust aggregation and effective protection of three kinds of slander attacks. At the same time, using the network technology of the encoding strategy will send packet encoding operation, the speed of data transmission process of trusted nodes and reduce data redundancy. Finally, simulation experiments using real data sets, the proposed respectively. Secure routing SSNCR and two kinds of classic Routing and a secure routing strategy in the successful transmission rate, average transmission delay, transmission overhead, and the average trust value performance. Simulation results show that with the increase in the proportion of abnormal network nodes, the proposed strategy can effectively prevent malicious attacks, and the successful transmission rate. Get better results of transmission delay and overhead.

【学位授予单位】：哈尔滨工业大学
【学位级别】：博士
【学位授予年份】：2017
【分类号】：TN929.5

【相似文献】