Network-Level Cooperation in Random Access IoT Networks with Aggregators

Παππάς, Νικόλαος; Dimitriou, Ioannis; Chen, Zheng

doi:10.1109/itc30.2018.00043

Cited by 10 publications

(7 citation statements)

References 26 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…(ii) Total expected queue length comparison: For the single server system, the total expected queue length goes to infinity as a ↓ λ and to zero as a ↑ 1. For the JSQR system, the total expected queue length goes to infinity as a → a + or a → a − , defined in Equation (47). Furthermore, for λ < 1/2, it is easy to show that a − < λ < 1/2 < a + .…”

Section: Comparison Of Jsrq To Other Routing Protocolsmentioning

confidence: 99%

“…In [42], by performing an appropriate truncation of the infinite Markov chain, the authors approximated the steady-state probability vector, within any desired degree of accuracy, whereas in [56], diffusion approximations were applied. In [17,41,47] the PGF of the joint (relay) queue length distribution was obtained in terms of the solution of a boundary value problems. In [13,62] fluid models were used to investigate the delay analysis of random access networks.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Analysis of the shortest relay queue policy in a cooperative random access network with collisions

2019

View full text Add to dashboard Cite

The scope of this work is twofold: On the one hand, strongly motivated by emerging engineering issues in multiple access communication systems, we investigate the performance of a slotted-time relay-assisted cooperative random access wireless network with collisions and with join the shortest queue relay-routing protocol. For this model, we investigate the stability condition, and apply different methods to derive the joint equilibrium distribution of the queue lengths. On the other hand, using the cooperative communication system as a vehicle for illustration, we investigate and compare three different approaches for this type of multi-dimensional stochastic processes, namely the compensation approach, the power series algorithm (PSA), and the probability generating function (PGF) approach. We present an extensive numerical comparison of the compensation approach and PSA, and discuss which method performs better in terms of accuracy and computation time. We also provide details on how to compute the PGF in terms of a solution of a Riemann-Hilbert boundary value problem.Cooperative communication is a new communication paradigm in which different terminals (i.e., nodes, devices) in a wireless network share their antennas and resources for distributed transmission and processing. Recent studies have shown that cooperative communications yield significant performance improvements for 5G networks, which need massive uncoordinated access, low latency, energy efficiency and ultra-reliability [45].The unprecedented growth of wireless networking, and the ever growing demand for higher data rates and capacity over the last decades, have already pushed the limits of current cellular systems [57]. By exploiting the spatial diversity inherent to wireless channels, which is an important tool to overcome the effects of fading (decrease in signal power due to path loss), shadowing and attenuation (decrease in signal strength), relay-based cooperative communications have been proposed as the appropriate solution to achieve the requirements of future needs; see e.g., [31,37]. * m.mayank@tue.nl † idimit@math.upatras.gr ‡ s.kapodistria@tue.nl arXiv:1810.00754v1 [math.PR] 1 Oct 2018 ContributionApplication oriented contribution. In this work, we consider a slotted-time relay-assisted cooperative communication system with a JSQ routing protocol at the relays and collisions. Such models have not been extensively analysed and very little is known regarding their delay performance. In particular, we provide insights on the characterisation of the delay and the performance of the system at hand. This is a particularly difficult task even in small scale systems, due to the strong interdependence/interaction between the queues. Furthermore, we demonstrate how to obtain the equilibrium distribution of the joint queue lengths and present an extensive numerical comparison of the techniques implemented, discussing which performs better in terms of accuracy and time complexity (computational time).

show abstract

Section: Comparison Of Jsrq To Other Routing Protocolsmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Analysis of the shortest relay queue policy in a cooperative random access network with collisions

2019

View full text Add to dashboard Cite

show abstract

“…Pappas et al [17] access the IoT wireless network in random manner by facilitating two data collectors. Nodes and aggregators are used in order to transmit data packets in random access fashion.…”

Section: Literature Reviewmentioning

confidence: 99%

Energy-Effective Cooperative and Reliable Delivery Routing Protocols for Underwater Wireless Sensor Networks

et al. 2019

View full text Add to dashboard Cite

Underwater deployed sensors nodes are energy-constrained. Therefore, energy efficiency becomes crucial in underwater wireless sensor networks (U-WSNs). The adverse channel corrupts the packets and challenges their reliability. To handle these challenges, two routing schemes are introduced in this paper. They are effective energy and reliable delivery (EERD) and cooperative effective energy and reliable delivery (CoEERD). In EERD, the packets follow single-path routing and the best forwarder node is selected using a weight function such that packets are transferred via the reliable paths with low energy usage. Packet transfer via a single route in EERD has, however, compromised reliability as the undersea links bear harshness and unpredictability. Therefore, the CoEERD scheme adds cooperative routing to EERD, in which a relay node is introduced between a source–destination pair. The destination requests the relay when the packets it gets from the source are corrupted beyond a threshold value. Selection of weight function is unique and considers many factors to ensure low energy usage with reliability while considering nodes for data transfer. This also helps in selecting a single relay node rather than many relays in the conventional cooperative routing model. Based on simulation results, the EERD and CoEERD protocols have improved performance in energy usage, reliable packet transfer and delay.

show abstract

“…Recently, the authors have performed considerable contribution both in the investigation of stable throughput region and in the delay analysis by considering sophisticated queue-aware transmission protocols in modern random access schemes [21,22,76,77], in IoT networks [12][13][14]80] and in network-level cooperative wireless networks [23,78].…”

Section: Stability and Delay Analysis In Ransmentioning

confidence: 99%

A Random Access G-Network: Stability, Stable Throughput, and Queueing Analysis

Dimitriou¹,

Παππάς²

2019

Prob. Eng. Inf. Sci.

Self Cite

View full text Add to dashboard Cite

The effect of signals on stability, throughput region, and delay in a two-user slotted ALOHA based random-access system with collisions is considered. This work gives rise to the development of random access G-networks, which can model virus attacks or other malfunctions and introduce load balancing in highly interacting networks. The users are equipped with infinite capacity buffers accepting external bursty arrivals. We consider both negative and triggering signals. Negative signals delete a packet from a user queue, while triggering signals cause the instantaneous transfer of packets among user queues. We obtain the exact stability region, and show that the stable throughput region is a subset of it. Moreover, we perform a compact mathematical analysis to obtain exact expressions for the queueing delay by solving a Riemann boundary value problem. A computationally efficient way to obtain explicit bounds for the queueing delay is also presented. The theoretical findings are numerically evaluated and insights regarding the system performance are derived.

show abstract

Network-Level Cooperation in Random Access IoT Networks with Aggregators

Cited by 10 publications

References 26 publications

Analysis of the shortest relay queue policy in a cooperative random access network with collisions

Analysis of the shortest relay queue policy in a cooperative random access network with collisions

Energy-Effective Cooperative and Reliable Delivery Routing Protocols for Underwater Wireless Sensor Networks

A Random Access G-Network: Stability, Stable Throughput, and Queueing Analysis

Contact Info

Product

Resources

About