Research on Opportunistic Network Routing Based on Community Structure
Qingwei Du
Abstract
Qingwei Du
Abstract
Currently,the study on opportunity network based on community structure remains to be improved,since the routing algorithm dose not take the transmission efficiency of the message into account between different communities,and in the community the routing it only use simple Spray and Wait routing algorithm,making opportunistic network based on community structure less efficient.To address these issues,the community model has been improved with the factors of node regression in mind,and a new routing algorithm called Node Back Routing under the improved community model is proposed.In the community,the routing algorithm uses the hybrid routing rules,and adds the positive feedback to recalculate the activity of the nodes.In different communities,the routing algorithm uses query routing table and considers the node regression method,making use of the attributes of the node regression to improve the efficiency of the message forwarding.Simulation results show that the improved community structure and routing algorithms improve the message transmission rate between different communities and in the same communities and effectively reduce network consumption.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Currently,the study on opportunity network based on community structure remains to be improved,since the routing algorithm dose not take the transmission efficiency of the message into account between different communities,and in the community the routing it only use simple Spray and Wait routing algorithm,making opportunistic network based on community structure less efficient.To address these issues,the community model has been improved with the factors of node regression in mind,and a new routing algorithm called Node Back Routing under the improved community model is proposed.In the community,the routing algorithm uses the hybrid routing rules,and adds the positive feedback to recalculate the activity of the nodes.In different communities,the routing algorithm uses query routing table and considers the node regression method,making use of the attributes of the node regression to improve the efficiency of the message forwarding.Simulation results show that the improved community structure and routing algorithms improve the message transmission rate between different communities and in the same communities and effectively reduce network consumption.
Key concepts: Policy-based routing, Routing table, Static routing, Computer science, Computer network, Dynamic Source Routing, Destination-Sequenced Distance Vector routing, Hierarchical routing