Node home location aware routing mechanism for social opportunistic networks
JI Fushen
Abstract
JI Fushen
Abstract
The nodes have strong social correlations in Opportunistic Networks,which are crucial to the design of routing mechanisms. By exploiting the social attributes of node,a node home location aware routing mechanism is proposed. Firstly,the relative geographic position is accurately indicated by the dynamically assigned node addresses according to the negotiation between community central nodes. Secondly,the relative distance between nodes can be reasonably determined according to the hamming distance. Lastly,the address assignment can be accomplished in a distributed manner to further provide decision-making basis for selecting suitable inter-cluster and intra-cluster routing strategies. Meanwhile,the address distance from the encountered node to the sink is considered to reasonably select relay nodes to successfully forward packets. Numerical results show that the proposed mechanism can dramatically improve the packet delivery ratio while reducing the transmission overhead.
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.
The nodes have strong social correlations in Opportunistic Networks,which are crucial to the design of routing mechanisms. By exploiting the social attributes of node,a node home location aware routing mechanism is proposed. Firstly,the relative geographic position is accurately indicated by the dynamically assigned node addresses according to the negotiation between community central nodes. Secondly,the relative distance between nodes can be reasonably determined according to the hamming distance. Lastly,the address assignment can be accomplished in a distributed manner to further provide decision-making basis for selecting suitable inter-cluster and intra-cluster routing strategies. Meanwhile,the address distance from the encountered node to the sink is considered to reasonably select relay nodes to successfully forward packets. Numerical results show that the proposed mechanism can dramatically improve the packet delivery ratio while reducing the transmission overhead.
Key concepts: Computer science, Computer network, Relay, Geographic routing, Node (physics), Network packet, Routing (electronic design automation), Distributed computing