Font Size: a A A

A Research On Optimization Of Energy Consumption And Delay Of Information Communication In Opportunistic Networks

Posted on:2019-04-11Degree:MasterType:Thesis
Country:ChinaCandidate:W J ChenFull Text:PDF
GTID:2348330563954342Subject:Software engineering
Abstract/Summary:PDF Full Text Request
In the area of opportunistic networks,there is no fixed transmission link between the nodes,and communication is mainly performed through random movement of nodes.Therefore,it is a common method to reduce the delay of information transmission by changing the information forwarding strategy.For the problem of the delay of the opportunistic network,in many routing algorithms,the user similarity between network nodes is used.User similarities are calculated by using the number of public neighbors between a pair of nodes,which ultimately results in higher information transmission delays and higher network traffic.In contrast,using the mutual contact information of nodes to calculate social similarity can more accurately select relay nodes.In addition,in some studies,energy consumption is reduced by limiting the number of duplicate data copies created in the network.In later studies,the energy consumption of periodic contact detection is reduced by optimizing the detection interval,or low-load cycle technology is used.In conjunction with the above issues,the following work has mainly been done in this article:1.This paper proposes a social dynamic feature calculating model that considers the activeness of nodes,and solve the problem that traditional frequency-based dynamic social features can not be distinguished.Making full use of active nodes can achieve the purpose of reducing transmission delays.2.Improve the calculation of social similarity in traditional algorithms.In this article,the social similarity of a node is measured by the Euclidean distance because it does not require additional weight values and performs better than Tanimoto and cosine distance in terms of transmission delay.3.A fusion routing algorithm I-PaSS combining social similarity and location similarity is proposed.The core of the algorithm is to reduce the information transmission delay and network traffic by accurately selecting relay nodes and reducing the total number of hops from the source node to the destination node.Through experiments,it is verified that the research in this paper is better than the classical algorithm of the existing opportunistic network in terms of information transmission delay and network traffic.4.Combining low duty cycle technology with energy-aware BUBBLE RAPalgorithm balances the energy between nodes.While avoiding a rapid decrease in the energy of a node with strong centrality,it also reduces information retention to extend the overall life cycle of the opportunity network.At the same time,information loss due to premature death of nodes is avoided.Finally,simulation experiments verify that the above strategies can prolong the overall network life cycle and perform better on information transmission delays.
Keywords/Search Tags:Opportunity Network, Balance of Node Energy Consumption, Social Similarity, Position Similarity
PDF Full Text Request
Related items