Font Size: a A A

Research On Routing Algorithms With Rateless Code For Wireless Sensor Networks

Posted on:2022-01-24Degree:MasterType:Thesis
Country:ChinaCandidate:Z F LiuFull Text:PDF
GTID:2518306323978759Subject:Computer software and theory
Abstract/Summary:PDF Full Text Request
Wireless sensor networks have broad application prospects in environmental mon-itoring,safe operation,smart manufacturing,etc.High-efficiency routing algorithms in wireless sensor networks are research hotspots,and energy consumption and delay are two important indicators.The former affects the life time of wireless sensor networks,while the latter affects the real-time performance of data.However,because the quality of the wireless channel is unstable,the transmission may fail,and the retransmission will cost extra energy and time.Therefore,it is meaningful to improve the transmission success rate of the wireless sensor network.Rateless code has been proven to have good performance in transmission on low-quality links,so we use rateless codes in wireless sensor networks to obtain more efficient algorithms,but this will bring some new chal-lenges.The rateless code for single-hop transmission often does not consider the link quality,but the link information is needed in the routing in wireless sensor network.How to evaluate the link quality is a new problem.The complexity of existing cooper-ative transmission algorithms with rateless code is large,cooperative transmission for the mobile node is a new challenge.This paper designs different ways of using rateless codes for wireless sensor networks in different scenarios,and conducts research on the optimization of the routing algorithm's time delay and other objectives.The main work is as follows:1)In the wireless sensor network with low duty cycle sleep scheduling,when the far neighbor wakes up first or there is only one neighbor,the existing opportunistic routing algorithm will try to transmit on the low-quality link.To solve this problem,we designed an efficient opportunistic routing algorithm rateless code.When the transmis-sion fails,it is necessary to wait for the next neighbor to wake up,which consumes a lot of energy and time in a low duty cycle environment.Thus,using rateless code to im-prove the transmission success rate of single-hop transmission can effectively improve the efficiency of the algorithm.The experimental results show that the opportunistic routing algorithm with rateless code has lower delay and energy consumption.2)For the real-time communication between mobile robots and the cloud in the Industrial Internet of Things,we use nodes in the wireless sensor network as relays,and use the cooperative transmission with mutual information accumulation.With the help of rateless codes,nodes can accumulate information in advance to decode the original text.Due to the mobility of mobile robots,the planned routing path will soon fail.So we propose a dynamic mutual information accumulation and cooperative transmission al-gorithm.For the two situations of information transmission from the cloud to the robot and from the robot to the cloud,we use neighbor search and opportunistic transmis-sion to dynamically obtain routing paths.Experimental results show that our dynamic mutual information accumulation cooperative transmission algorithm has lower time complexity and delay.
Keywords/Search Tags:Wireless Sensor Networks, Rateless Code, Opportunistic Routing, Cooperative Transmission, Mutual Information Accumulation
PDF Full Text Request
Related items