%0 Journal Article %1 noauthororeditor %A Rolim, Carlos O. %D 2013 %E of UbiComp (IJU), International Journal %J SIX DEGREES OF SEPARATION TO IMPROVE ROUTING IN OPPORTUNISTIC NETWORKS %K Algorithm Data Dissemination Networks Opportunistic Routing %N 3 %P 1-11 %R 10.5121/iju.2013.4302 %T SIX DEGREES OF SEPARATION TO IMPROVE ROUTING IN OPPORTUNISTIC NETWORKS %U http://airccse.org/journal/iju/papers/4313iju02.pdf %V 4 %X Opportunistic Networks are able to exploit social behavior to create connectivity opportunities. This paradigm uses pair-wise contacts for routing messages between nodes. In this context we investigated if the “six degrees of separation” conjecture of small-world networks can be used as a basis to route messages in Opportunistic Networks. We propose a simple approach for routing that outperforms some popular protocols in simulations that are carried out with real world traces using ONE simulator. We conclude that static graph models are not suitable for underlay routing approaches in highly dynamic networks like Opportunistic Networks without taking account of temporal factors such as time, duration and frequency of previous encounters

@article{noauthororeditor, abstract = {Opportunistic Networks are able to exploit social behavior to create connectivity opportunities. This paradigm uses pair-wise contacts for routing messages between nodes. In this context we investigated if the “six degrees of separation” conjecture of small-world networks can be used as a basis to route messages in Opportunistic Networks. We propose a simple approach for routing that outperforms some popular protocols in simulations that are carried out with real world traces using ONE simulator. We conclude that static graph models are not suitable for underlay routing approaches in highly dynamic networks like Opportunistic Networks without taking account of temporal factors such as time, duration and frequency of previous encounters}, added-at = {2018-04-13T09:21:32.000+0200}, author = {Rolim, Carlos O.}, biburl = {https://www.bibsonomy.org/bibtex/26816542704b795b40fc14e96c59df4a0/sebastian09}, doi = {10.5121/iju.2013.4302}, editor = {of UbiComp (IJU), International Journal}, interhash = {89c4005ebb43afb42bbcb01aac3cab79}, intrahash = {6816542704b795b40fc14e96c59df4a0}, issn = {2200-0011}, journal = {SIX DEGREES OF SEPARATION TO IMPROVE ROUTING IN OPPORTUNISTIC NETWORKS}, keywords = {Algorithm Data Dissemination Networks Opportunistic Routing}, language = {english}, month = {july}, number = 3, pages = {1-11}, timestamp = {2018-04-13T09:21:32.000+0200}, title = {SIX DEGREES OF SEPARATION TO IMPROVE ROUTING IN OPPORTUNISTIC NETWORKS}, url = {http://airccse.org/journal/iju/papers/4313iju02.pdf}, volume = 4, year = 2013 }