Resource and performance tradeoffs in delay-tolerant wireless networks
Proceedings of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking
The message delay in mobile ad hoc networks
Performance Evaluation - Performance 2005
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 multiple-copy case
IEEE/ACM Transactions on Networking (TON)
Simple models for the performance evaluation of a class of two-hop relay protocols
NETWORKING'07 Proceedings of the 6th international IFIP-TC6 conference on Ad Hoc and sensor networks, wireless networks, next generation internet
IEEE Journal on Selected Areas in Communications
On delay constrained multicast capacity of large-scale mobile ad-hoc networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
Impact of correlated mobility on delay-throughput performance in mobile ad-hoc networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
Scheduling heterogeneous real-time traffic over fading wireless channels
INFOCOM'10 Proceedings of the 29th conference on Information communications
EasyMANET: an extensible and configurable platform for service provisioning in MANET environments
IEEE Communications Magazine
Pareto boundary of utility sets for multiuser wireless systems
IEEE/ACM Transactions on Networking (TON)
The capacity of wireless networks
IEEE Transactions on Information Theory
A deterministic approach to throughput scaling in 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 I: the fluid model
IEEE Transactions on Information Theory
Degenerate delay-capacity tradeoffs in ad-hoc networks with Brownian mobility
IEEE Transactions on Information Theory
Throughput and Delay in Random Wireless Networks With Restricted Mobility
IEEE Transactions on Information Theory
Optimal Delay–Throughput Tradeoffs in Mobile Ad Hoc Networks
IEEE Transactions on Information Theory
Application-driven cross-layer optimization for video streaming over wireless networks
IEEE Communications Magazine
Performance Optimizations for Deploying VoIP Services in Mesh Networks
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
The available two-hop relay protocols with out-of-order or strictly in-order reception cannot provide a flexible control for the packet delivery delay, which may significantly limit their applications to the future mobile ad hoc networks (MANETs) with different delay requirements. This paper extends the conventional two-hop relay and proposes a general group-based two-hop relay algorithm with packet redundancy. In such an algorithm with packet redundancy limit f and group size g (2HR-(f,g) for short), each packet is delivered to at most f distinct relay nodes and can be accepted by its destination if it is a fresh packet to the destination and also it is among g packets of the group the destination is currently requesting. The 2HR-(f,g) covers the available two-hop relay protocols as special cases, like the in-order reception ones (f ≥ 1, g = 1), the out-of-order reception ones with redundancy (f 1, g = ∞), or without redundancy (f = 1, g = ∞). A Markov chain-based theoretical framework is further developed to analyze how the mean value and variance of packet delivery delay vary with the parameters f and g, where the important medium contention, interference, and traffic contention issues are carefully incorporated into the analysis. Extensive simulation and theoretical results are provided to illustrate the performance of the 2HR-(f, g) algorithm and the corresponding theoretical framework, which indicate that the theoretical framework is efficient in delay analysis and the new 2HR-(f, g algorithm actually enables both the mean value and variance of packet delivery delay to be flexibly controlled in a large region.