Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
Ad-hoc On-Demand Distance Vector Routing
WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
A delay-tolerant network architecture for challenged internets
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Routing in a delay tolerant network
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
Inter-Regional Messenger Scheduling in Delay Tolerant Mobile Networks
WOWMOM '06 Proceedings of the 2006 International Symposium on on World of Wireless, Mobile and Multimedia Networks
When TCP Breaks: Delay- and Disruption- Tolerant Networking
IEEE Internet Computing
Transport layer issues in delay tolerant mobile networks
NETWORKING'06 Proceedings of the 5th international IFIP-TC6 conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications Systems
Delay tolerant mobile networks (DTMNs): controlled flooding in sparse mobile networks
NETWORKING'05 Proceedings of the 4th IFIP-TC6 international conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communication Systems
Hi-index | 0.00 |
While portable and wireless devices are pouring, a new network technology is needed as a breakthrough. The new network technology features large delays, intermittent connectivity, and absence of an end-to-end path from sources to destinations. A network which has one of those characteristics is called DTNs(Delay Tolerant Networks). The main 4 routing methods have been researched so far in extreme environment. In this paper, we look into the reliability of DTMNs(Delay Tolerant Mobile Networks) in several different situations, and propose an algorithm that selects a positive routine by sending the only information of its position when making a connection to a detected node. We simulate the proposed algorithm here in DTN using ONE simulator. As a result, it shows that the algorithm reduces the number of message transmission each node.