Semi-Markov model for delivery delay prediction in multi-copy opportunistic networks with heterogeneous pairwise encounter rates

This paper investigates the two-user uplink non-orthogonal multiple access (NOMA) paired with the hybrid automatic repeat request (HARQ) in the finite blocklength regime, where the target latency of each user is the priority. To limit the packet delivery delay and avoid packet queuing of the users, we propose a novel NOMA-HARQ approach where the retransmission of each packet is served non-orthogonally with the new packet in the same time slot. We use a Markov model (MM) to analyze the dynamics of the uplink NOMA-HARQ with one retransmission and characterize the packet error rate (PER), throughput, and latency performance of each user. We also present numerical optimizations to find the optimal power ratios of each user. Numerical results show that the proposed scheme significantly outperforms the standard NOMA-HARQ in terms of packet delivery delay at the target PER.

Download Full-text

Research on the Express Delivery Delay Prediction Based on Neural Network in the Background of Big Data

Proceedings of the 6th International Conference on Electronic, Mechanical, Information and Management Society ◽

10.2991/emim-16.2016.294 ◽

2016 ◽

Cited By ~ 1

Author(s):

Bin Ye ◽

Jia Zuo ◽

Xin Zhao ◽

Lin Luo

Keyword(s):

Neural Network ◽

Big Data ◽

Delivery Delay ◽

Delay Prediction ◽

Express Delivery

Download Full-text

A Community-Based Message Transmission Algorithm for Opportunistic Networks

Applied Mechanics and Materials ◽

10.4028/www.scientific.net/amm.427-429.2333 ◽

2013 ◽

Vol 427-429 ◽

pp. 2333-2337

Author(s):

Zhi Ren ◽

Yan Wei Liu ◽

Shuang Peng ◽

Ji Bi Li

Keyword(s):

Routing Algorithm ◽

Opportunistic Networks ◽

Transmission Condition ◽

Routing Algorithms ◽

Delivery Ratio ◽

Community Based ◽

Delivery Delay ◽

Message Transmission ◽

Simulation Results ◽

Determination Mechanism

In opportunistic networks, routing algorithms based on community division have some redundant forwarding in the process of message transmission. In this paper, we propose a community-based message transmission algorithm (CMTA). CMTA makes fully use of the nodes within communication overlapping areas to forward messages and optimizes forwarding determination mechanism to carry message nodes, then CMTA redesigns the message transmission condition and reduces the number of message forwarding which improve the efficiency of forwarding messages and reduce the average end-end delivery delay. Theoretical analysis and simulation results show that CMTA outperforms an existing Epidemic routing algorithm and the Prophet algorithm and CHMTS in terms of delivery ratio, average end-end delivery delay, relay ratio, etc.

Download Full-text