基于复制路由的机会网络节点休眠调度算法研究

发布时间：2018-07-14 14:51

【摘要】：作为移动自组织网络的一种重要演进方向,机会网络由于其在不连通的网络中也能实现消息投递的特点,成为未来网络组网的一种可选方式,受到国内外网络研究人员的广泛关注。路由算法是机会网络中最主要的研究热点之一。但是,当前机会网络大都采用便携的移动设备来进行路由算法的研究,而移动设备大多是能量受限的设备,处于复杂且恶劣环境之下的设备往往难以及时充电或更换电源,这就使得人们开始逐渐关注机会网络的节能算法。休眠调度算法是一种使网络中节点进入低功耗休眠状态保存能量并延长网络寿命的节能算法。将休眠调度算法与机会网络路由算法相结合将会大量节省机会网络的能量。针对这种思想,本文通过合理的设计策略,将节点休眠调度算法与机会网络复制路由算法结合在一起,在不影响网络性能的前提下,尽可能的降低节点能耗,延长节点寿命。首先,本文对机会网络的概念、特点及其应用进行了介绍,对当前存在的机会网络休眠调度算法进行了分类,并选取了若干典型复制路由算法和休眠调度算法进行了详细阐述。其次,针对现有采用固定时长的机会网络休眠调度算法中节点进入休眠状态或相遇时间较短导致消息传输中断降低消息投递成功率的问题,提出了一种基于自适应时间调整的可靠休眠调度算法——RSATA(a Reliable sleep Scheduling algorithm base on Adaptive Time Adjustment for opportunistic networks)。算法结合RSSI测距和消息通告机制,通过分析节点接触过程滤除节点不能够发送数据的相遇机会,然后对唤醒时间和休眠时间进行动态调整,避免消息收发被休眠中断。然后,针对采用接触预测机制的休眠调度算法中存在的相遇预测不准确和重叠时间移动后接触概率较低的问题,提出了一种基于接触概率的机会网络能量高效休眠调度算法——EESCP(an Energy Efficient sleep Scheduling algorithm base on Contact Probability for opportunistic networks)。算法通过精准预测机制向前后预测错失相遇的下次唤醒时间,保证了预测下次相遇的准确度,而且对重叠后的时间采用相遇概率最大化机制来提高相遇机会,减小消息投递时延。最后,对全文的研究内容进行了总结,并且提出了机会网络节点休眠调度算法的未来研究方向。
[Abstract]:As an important evolution direction of mobile ad hoc networks, opportunistic networks can also realize message delivery in disconnected networks, so it becomes an optional way to organize networks in the future. Network researchers at home and abroad are widely concerned. Routing algorithm is one of the most important research topics in opportunistic networks. However, most of the current opportunity networks use portable mobile devices to study routing algorithms, and most of the mobile devices are energy-constrained devices, which are often difficult to charge or replace power in a complex and harsh environment. This makes people begin to pay attention to the energy saving algorithm of opportunity network gradually. Sleep scheduling algorithm is an energy saving algorithm that enables nodes in the network to enter low power sleep state to save energy and prolong network life. The combination of sleep scheduling algorithm and opportunistic network routing algorithm will greatly save the energy of opportunistic network. Aiming at this idea, this paper combines the node sleep scheduling algorithm with the opportunistic network replication routing algorithm through a reasonable design strategy, and reduces the node energy consumption and prolongs the node life as far as possible without affecting the network performance. Firstly, this paper introduces the concept, characteristics and applications of opportunistic networks, classifies the existing scheduling algorithms of opportunistic networks, and introduces some typical replication routing algorithms and sleep scheduling algorithms in detail. Secondly, aiming at the problem that the nodes enter dormant state or encounter short time, which leads to the interruption of message transmission and reduces the success rate of message delivery, the existing opportunistic network sleep scheduling algorithms with fixed time are adopted. This paper presents a reliable sleep scheduling algorithm based on adaptive time adjustment RSATA (a reliable sleep scheduling algorithm base on Adaptive time Adjustment for opportunistic networks). Combined with RSSI ranging and message notification mechanism, the algorithm filters out the chance that the node can not send data by analyzing the node contact process, and then dynamically adjusts the wake-up time and the sleep time to avoid the interruption of message sending and receiving. Then, aiming at the problem of inaccurate encounter prediction and low contact probability after overlapping time moves in dormant scheduling algorithm with contact prediction mechanism, This paper presents an energy efficient sleep scheduling algorithm for opportunistic networks based on contact probability-EESCP (an Energy efficient sleep scheduling algorithm base on contact probability for opportunistic networks). The algorithm guarantees the accuracy of predicting the next encounter by accurate prediction mechanism to predict the next missed encounter time, and uses the maximum encounter probability mechanism to improve the chance of encounter. Reduce message delivery delay. Finally, the research content of this paper is summarized, and the future research direction of opportunistic network node sleep scheduling algorithm is proposed.
【学位授予单位】：重庆邮电大学
【学位级别】：硕士
【学位授予年份】：2016
【分类号】：TN929.5

【参考文献】