Abstract
In opportunistic networks, centrality characterizes a node's capability to act as a communication hub. In this paper, we provide an in-depth study of choosing effective centrality metrics for message forwarding in bandwidth-limited opportunistic networks. Based on this study, we propose a destination-unaware forwarding algorithm that accounts for the popularity of a node and the contact durations between nodes. We evaluate the algorithm on two experimental human mobility traces. The simulation results show that the proposed algorithm achieves higher system throughput while maintaining a lower forwarding cost compared with several known destination-unaware forwarding schemes.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
