The broadcast storm problem in a mobile ad hoc network
Wireless Networks - Selected Papers from Mobicom'99
Proceedings of the 10th international conference on Architectural support for programming languages and operating systems
Probabilistic routing in intermittently connected networks
ACM SIGMOBILE Mobile Computing and Communications Review
Link-level measurements from an 802.11b mesh 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
The message delay in mobile ad hoc networks
Performance Evaluation - Performance 2005
Introduction to Probability Models, Ninth Edition
Introduction to Probability Models, Ninth Edition
IEEE Transactions on Wireless Communications
Delay-tolerant networking: an approach to interplanetary Internet
IEEE Communications Magazine
Contention-aware analysis of routing schemes for mobile opportunistic networks
Proceedings of the 1st international MobiSys workshop on Mobile opportunistic networking
Efficient routing in intermittently connected mobile networks: the single-copy case
IEEE/ACM Transactions on Networking (TON)
Efficient routing in intermittently connected mobile networks: the multiple-copy case
IEEE/ACM Transactions on Networking (TON)
Infection spread in wireless networks with random and adversarial node mobilities
Proceedings of the 1st ACM SIGMOBILE workshop on Mobility models
Aging rules: what does the past tell about the future in mobile ad-hoc networks?
Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing
Optimal monotone forwarding policies in delay tolerant mobile ad-hoc networks
Proceedings of the 3rd International Conference on Performance Evaluation Methodologies and Tools
Probabilistic routing in on-body sensor networks with postural disconnections
Proceedings of the 7th ACM international symposium on Mobility management and wireless access
Static Replication Strategies for Content Availability in Vehicular Ad-hoc Networks
Mobile Networks and Applications
Optimal monotone forwarding policies in delay tolerant mobile ad-hoc networks
Performance Evaluation
Modeling on-body DTN packet routing delay in the presence of postural disconnections
EURASIP Journal on Wireless Communications and Networking - Special issue on opportunistic and delay tolerant networks
Cost-effective multiperiod spraying for routing in delay-tolerant networks
IEEE/ACM Transactions on Networking (TON)
Evolutionary reputation model for node selfishness resistance in opportunistic networks
Concurrency and Computation: Practice & Experience
Analysis and improvement of TCP performance in opportunistic networks
Wireless Networks
| Hi-index | 0.00 |
Epidemic routing has been proposed as a robust transmission scheme for sparse mobile ad hoc networks. Under the assumption of no contention, epidemic routing has the minimum end-to-end delay amongst all the routing schemes proposed for such networks. The assumption of no contention was justified by arguing that since the network is sparse, there will be very few simultaneous transmissions. Some recent papers have shown through simulations that this argument is not correct and that contention cannot be ignored while analyzing the performance of routing schemes, even in sparse networks.Incorporating contention in the analysis has always been a hard problem and hence its effect has been studied mostly through simulations only. In this paper, we find analytical expressions for the delay performance of epidemic routing with contention. We include all the three main manifestations of contention, namely (i) the finite bandwidth of the link which limits the number of packets two nodes can exchange, (ii) the scheduling of transmissions between nearby nodes which is needed to avoid excessive interference, and (iii) the interference from transmissions outside the scheduling area. The accuracy of the analysis is verified via simulations.