Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
Integrating heterogeneous wireless technologies: a cellular aided mobile Ad Hoc network (CAMA)
Mobile Networks and Applications
Routing in a delay tolerant network
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
Capacity bounds for ad hoc and hybrid wireless networks
ACM SIGCOMM Computer Communication Review
Resource and performance tradeoffs in delay-tolerant wireless networks
Proceedings of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking
Optimal throughput-delay scaling in wireless networks: part I: the fluid model
IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
Degenerate delay-capacity tradeoffs in ad-hoc networks with Brownian mobility
IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
CarTel: a distributed mobile sensor computing system
Proceedings of the 4th international conference on Embedded networked sensor systems
Opportunistic spectral usage: bounds and a multi-band CSMA/CA protocol
IEEE/ACM Transactions on Networking (TON)
Delay and capacity trade-offs in mobile ad hoc networks: a global perspective
IEEE/ACM Transactions on Networking (TON)
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)
Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
Dynamic Programming and Optimal Control, Vol. II
Dynamic Programming and Optimal Control, Vol. II
Stationary Distributions for the Random Waypoint Mobility Model
IEEE Transactions on Mobile Computing
Optimal monotone forwarding policies in delay tolerant mobile ad-hoc networks
Performance Evaluation
Mobeyes: smart mobs for urban monitoring with a vehicular sensor network
IEEE Wireless Communications
The capacity of wireless networks
IEEE Transactions on Information Theory
Capacity and delay tradeoffs for ad hoc mobile networks
IEEE Transactions on Information Theory
Optimal Throughput–Delay Scaling in Wireless Networks—Part II: Constant-Size Packets
IEEE Transactions on Information Theory
Closing the Gap in the Capacity of Wireless Networks Via Percolation Theory
IEEE Transactions on Information Theory
Rethinking information theory for mobile ad hoc networks
IEEE Communications Magazine
HC-MAC: A Hardware-Constrained Cognitive MAC for Efficient Spectrum Management
IEEE Journal on Selected Areas in Communications
Convergence rate control for distributed multi-hop wireless mesh networks
Computers and Electrical Engineering
| Hi-index | 0.00 |
In delay tolerant Mobile Ad hoc Networks (MANETs) node mobility can be exploited in order to reduce the source-destination path lengths in the expense of higher packet delivery delays. This paper addresses the problem of minimizing the average source-destination path length under a maximum delay constraint for packet delivery which is desirable to certain applications. Imposing packet delivery deadlines results in a certain percentage of multi-hop packet transmissions and poses the practical problem of selecting the optimum moment for the transmission. We propose an Optimal Stopping Rule algorithm for solving this problem and show how this algorithm can be extended in the case that a source-destination route is not always available by relaxing the hard delay constraint to a soft (probabilistic) constraint. The performance of this algorithm is compared to the ideal case of scheduling with perfect knowledge of the future and the trade-off between higher allowable delay and lower average path length is illustrated through several Matlab and ns-2 simulation results. As an application of path length minimization we explain how this can lead to energy consumption minimization in a MANET with light traffic loads (low probability of collisions). Finally, we briefly discuss how this path length minimization algorithm can guide the development of cross-layer throughput maximization algorithms with soft maximum delay guarantees.