Proceedings of the 10th international conference on Architectural support for programming languages and operating systems
A delay-tolerant network architecture for challenged internets
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Routing using potentials: a dynamic traffic-aware routing algorithm
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
Adaptive Routing for Intermittently Connected Mobile Ad Hoc Networks
WOWMOM '05 Proceedings of the Sixth IEEE International Symposium on World of Wireless Mobile and Multimedia Networks
Spray and wait: an efficient routing scheme for intermittently connected mobile networks
Proceedings of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking
Performance analysis of mobility-assisted routing
Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing
Mobility profile based routing within intermittently connected mobile ad hoc networks (ICMAN)
Proceedings of the 2006 international conference on Wireless communications and mobile computing
Evaluating contacts for routing in highly partitioned mobile networks
Proceedings of the 1st international MobiSys workshop on Mobile opportunistic networking
PERCOMW '07 Proceedings of the Fifth IEEE International Conference on Pervasive Computing and Communications Workshops
DTN routing as a resource allocation problem
Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications
Study of a bus-based disruption-tolerant network: mobility modeling and impact on routing
Proceedings of the 13th annual ACM international conference on Mobile computing and networking
DTLSR: delay tolerant routing for developing regions
Proceedings of the 2007 workshop on Networked systems for developing regions
On-demand routing in disrupted environments
NETWORKING'07 Proceedings of the 6th international IFIP-TC6 conference on Ad Hoc and sensor networks, wireless networks, next generation internet
PWave: a multi-source multi-sink anycast routing framework for wireless sensor networks
NETWORKING'07 Proceedings of the 6th international IFIP-TC6 conference on Ad Hoc and sensor networks, wireless networks, next generation internet
Message routing on potential-fields in forwarding-based DTNs
Proceedings of the 3rd International Conference on Ubiquitous Information Management and Communication
DTIPN: delay tolerant IP networking for opportunistic network applications
MobiOpp '10 Proceedings of the Second International Workshop on Mobile Opportunistic Networking
Mobility identification and clustering in sparse mobile networks
MILCOM'09 Proceedings of the 28th IEEE conference on Military communications
Heuristic congestion control for message deletion in delay tolerant network
ruSMART/NEW2AN'10 Proceedings of the Third conference on Smart Spaces and next generation wired, and 10th international conference on Wireless networking
Independent DTNs message deletion mechanism for multi-copy routing scheme
Proceedings of the Sixth Asian Internet Engineering Conference
| Hi-index | 0.00 |
Many message routing schemes have been proposed in the context of delay tolerant networks (DTN) and intermittently connected mobile networks (ICMN). Those routing schemes are tested on specific environments that involve particular mobility complexity whether they are random-based or sociologically organized. We, in this paper, propose community structured environment (CSE) and mobility entropy to discuss the effect of node mobility complexity on message routing performance. We also propose potential-based entropy adaptive routing (PEAR) that adaptively carries messages over the change of mobility entropy. According to our simulation, PEAR has achieved high delivery rate on wide range of mobility entropy, while link-state routing has worked well only at small entropy scenarios and controlled replication-based routing only at large entropy environments.