Proceedings of the 10th international conference on Architectural support for programming languages and operating systems
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
A delay-tolerant network architecture for challenged internets
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
InterPlaNetary internet: state-of-the-art and research challenges
Computer Networks: The International Journal of Computer and Telecommunications Networking
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
Pocket switched networks and human mobility in conference environments
Proceedings of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking
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 epidemic routing under contention
Proceedings of the 2006 international conference on Wireless communications and mobile computing
CarTel: a distributed mobile sensor computing system
Proceedings of the 4th international conference on Embedded networked sensor systems
Opportunistic networking: data forwarding in disconnected mobile ad hoc networks
IEEE Communications Magazine
Multihop Ad Hoc Networking: The Reality
IEEE Communications Magazine
DTN: an architectural retrospective
IEEE Journal on Selected Areas in Communications
Hi-index | 0.00 |
Opportunistic networks have attracted attention due to their inherent characteristics, such as long latency, low data rate, and intermittent connectivity. Extensive research has been conducted on opportunistic networks, including the architecture, and routing. However, few in the literature report the performance of TCP in opportunistic networks, especially in the case of Epidemic Routing. In this paper, we first evaluate the performance of TCP in opportunistic networks with Epidemic Routing. Our results show that the Epidemic Routing in opportunistic networks degrades the performance of TCP because multicopy data packets cause duplicate ACKs, and in turn reduce the transmission rate of TCP. Then an enhanced algorithm for TCP, named A-TCP/Reno is proposed to solve the above problem. A-TCP/Reno avoids the duplicate ACK problem caused by Epidemic Routing. The simulation results show that A-TCP/Reno outperforms the TCP/Reno in opportunistic networks with Epidemic Routing protocol.