The anatomy of a large-scale hypertextual Web search engine
WWW7 Proceedings of the seventh international conference on World Wide Web 7
A delay-tolerant network architecture for challenged internets
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Probabilistic routing in intermittently connected networks
ACM SIGMOBILE Mobile Computing and Communications Review
Routing in a delay tolerant network
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
Spray and wait: an efficient routing scheme for intermittently connected mobile networks
Proceedings of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking
Designing Urban Pervasive Systems
Computer
CNSR '07 Proceedings of the Fifth Annual Conference on Communication Networks and Services Research
Bubble rap: social-based forwarding in delay tolerant networks
Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
Social Network Analysis for Information Flow in Disconnected Delay-Tolerant MANETs
IEEE Transactions on Mobile Computing
The ONE simulator for DTN protocol evaluation
Proceedings of the 2nd International Conference on Simulation Tools and Techniques
Peoplerank: social opportunistic forwarding
INFOCOM'10 Proceedings of the 29th conference on Information communications
Opportunistic networking: data forwarding in disconnected mobile ad hoc networks
IEEE Communications Magazine
Opportunistic routing for wireless ad hoc and sensor networks: Present and future directions
IEEE Communications Magazine
Select&Spray: towards deployable opportunistic communication in large scale networks
Proceedings of the 11th ACM international symposium on Mobility management and wireless access
| Hi-index | 0.00 |
Communication in mobile opportunistic networks is primarily achieved through a variety of store-carry-and-forward techniques, where node mobility is exploited for end-to-end data delivery. The main routing challenges these networks face is determining when to forward a message and which nodes to forward it to, ultimately resulting in varying delay and cost trade-offs. Routing solutions to date heavily rely on assumptions regarding the underlying environment and node capabilities, which may be unrealistic in many cases. In this paper, we propose building upon Space Syntax in order to make forwarding decisions with more realistic assumptions about the underlying environment. Space Syntax metrics have long been used in the field of architecture to model natural mobility patterns by analyzing spacial configurations. To adapt Space Syntax to opportunistic routing, we propose our popularity index metric, which is based on core Space Syntax metrics. This popularity index depends on factors in the environment that do not frequently change, and therefore, can be more realistically adopted and deployed when compared to other opportunistic routing algorithms. We introduce two simple forwarding algorithms based on the popularity index and compare their performance to other approaches. Our initial evaluation shows that Space Syntax based routing performs relatively well compared to state-of-the-art solutions with the added advantage of being more realistic and as a result easier to deploy.