Abstract
Many networks are used to transfer information or goods, in other words, they are navigated. The larger the network, the more difficult it is to navigate efficiently. Indeed, information routing in the Internet faces serious scalability problems due to its rapid growth, recently accelerated by the rise of the Internet of Things. Large networks like the Internet can be navigated efficiently if nodes, or agents, actively forward information based on hidden maps underlying these systems. However, in reality most agents will deny to forward messages, which has a cost, and navigation is impossible. Can we design appropriate incentives that lead to participation and global navigability? Here, we present an evolutionary game where agents share the value generated by successful delivery of information or goods. We show that global navigability can emerge, but its complete breakdown is possible as well. Furthermore, we show that the system tends to self-organize into local clusters of agents who participate in the navigation. This organizational principle can be exploited to favor the emergence of global navigability in the system.
Highlights
The rapid growth of the Internet of Things[1] is expected to lead to more than 50 billion connected devices by 2020, which implies challenges for the scalability of the digital infrastructure[2,3,4,5]
We introduce an incentive to participate in the navigation process and show that it can promote the emergence of global navigability
In the following we study an evolutionary game[22,23,24,25,26,27] that we call participatory greedy routing
Summary
The rapid growth of the Internet of Things[1] is expected to lead to more than 50 billion connected devices by 2020, which implies challenges for the scalability of the digital infrastructure[2,3,4,5]. Many real complex networks have shown to be navigable, where nodes efficiently route messages using the connectivity of the network without relying on knowledge about the global topology. This can be achieved by performing greedy routing[19, 20] in underlying geometric spaces[10,11,12,13,14,15]. If even a single node in a given message forwarding chain decides not to participate (defect), the entire delivery fails This vulnerability of the navigation process raises serious concerns about the feasibility of navigation in realistic environments. Building on this knowledge, we show how the initial minimal density of cooperators needed to drive the system to the navigable state can be reduced significantly by adopting an “act local” strategy
Sign-in/Register to view highlights & summary 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.
