اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدRandom Access with Opportunity Detection in Wireless Networks
122
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
This letter proposes a novel random medium access control (MAC) based on a transmission opportunity prediction, which can be measured in a form of a conditional success probability given transmitter-side interference. A transmission probability depends on the opportunity prediction, preventing indiscriminate transmissions and reducing excessive interference causing collisions. Using stochastic geometry, we derive a fixed-point equation to provide the optimal transmission probability maximizing a proportionally fair throughput. Its approximated solution is given in closed form. The proposed MAC is applicable to full-duplex networks, leading to significant throughput improvement by allowing more nodes to transmit.
قيم البحث
اقرأ أيضاً
As low frequency band becomes more and more crowded, millimeter-wave (mmWave) has attracted significant attention recently. IEEE has released the 802.11ad standard to satisfy the demand of ultra-high-speed communication. It adopts beamforming technol
ogy that can generate directional beams to compensate for high path loss. In the Association Beamforming Training (A-BFT) phase of beamforming (BF) training, a station (STA) randomly selects an A-BFT slot to contend for training opportunity. Due to the limited number of A-BFT slots, A-BFT phase suffers high probability of collisions in dense user scenarios, resulting in inefficient training performance. Based on the evaluation of the IEEE 802.11ad standard and 802.11ay draft in dense user scenarios of mmWave wireless networks, we propose an enhanced A-BFT beam training and random access mechanism, including the Separated A-BFT (SA-BFT) and Secondary Backoff A-BFT (SBA-BFT). The SA-BFT can provide more A-BFT slots and divide A-BFT slots into two regions by defining a new `E-A-BFT Length field compared to the legacy 802.11ad A-BFT, thereby maintaining compatibility when 802.11ay devices are mixed with 802.11ad devices. It can also reduce the collision probability in dense user scenarios greatly. The SBA-BFT performs secondary backoff with very small overhead of transmission opportunities within one A-BFT slot, which not only further reduces collision probability, but also improves the A-BFT slots utilization. Furthermore, we propose a three-dimensional Markov model to analyze the performance of the SBA-BFT. The analytical and simulation results show that both the SA-BFT and the SBA-BFT can significantly improve BF training efficiency, which are beneficial to the optimization design of dense user wireless networks based on the IEEE 802.11ay standard and mmWave technology.
In this paper, we investigate the random access problem for a delay-constrained heterogeneous wireless network. As a first attempt to study this new problem, we consider a network with two users who deliver delay-constrained traffic to an access poin
t (AP) via a common unreliable collision wireless channel. We assume that one user (called user 1) adopts ALOHA and we optimize the random access scheme of the other user (called user 2). The most intriguing part of this problem is that user 2 does not know the information of user 1 but needs to maximize the system timely throughput. Such a paradigm of collaboratively sharing spectrum is envisioned by DARPA to better dynamically match the supply and demand in the future [1], [2]. We first propose a Markov Decision Process (MDP) formulation to derive a modelbased upper bound, which can quantify the performance gap of any designed schemes. We then utilize reinforcement learning (RL) to design an R-learning-based [3]-[5] random access scheme, called TSRA. We finally carry out extensive simulations to show that TSRA achieves close-to-upper-bound performance and better performance than the existing baseline DLMA [6], which is our counterpart scheme for delay-unconstrained heterogeneous wireless network. All source code is publicly available in https://github.com/DanzhouWu/TSRA.
The Fifth Generation (5G) wireless service of sensor networks involves significant challenges when dealing with the coordination of ever-increasing number of devices accessing shared resources. This has drawn major interest from the research communit
y as many existing works focus on the radio access network congestion control to efficiently manage resources in the context of device-to-device (D2D) interaction in huge sensor networks. In this context, this paper pioneers a study on the impact of D2D link reliability in group-assisted random access protocols, by shedding the light on beneficial performance and potential limitations of approaches of this kind against tunable parameters such as group size, number of sensors and reliability of D2D links. Additionally, we leverage on the association with a Geolocation Database (GDB) capability to assist the grouping decisions by drawing parallels with recent regulatory-driven initiatives around GDBs and arguing benefits of the suggested proposal. Finally, the proposed method is approved to significantly reduce the delay over random access channels, by means of an exhaustive simulation campaign.
An energy cooperation policy for energy harvesting wireless sensor networks (WSNs) with wireless power transfer is proposed in this paper to balance the energy at each sensor node and increase the total energy utilization ratio of the whole WSNs. Con
sidering the unbalanced spatio-temporal properties of the energy supply across the deployment terrain of energy harvesting WSNs and the dynamic traffic load at each sensor node, the energy cooperation problem among sensor nodes is decomposed into two steps: the local energy storage at each sensor node based on its traffic load to meet its own needs; within the energy storage procedure sensor nodes with excess energy transmit a part of their energy to nodes with energy shortage through the energy trading. Inventory theory and game theory are respectively applied to solving the local energy storage problem at each sensor node and the energy trading problem among multiple sensor nodes. Numerical results show that compared with the static energy cooperation method without energy trading, the Stackelberg Model based Game we design in this paper can significantly improve the trading volume of energy thereby increasing the utilization ratio of the harvested energy which is unevenly distributed in the WSNs.
We propose a new class of algorithms for randomly scheduling network transmissions. The idea is to use (discrete) determinantal point processes (subsets) to randomly assign medium access to various {em repulsive} subsets of potential transmitters. Th
is approach can be seen as a natural extension of (spatial) Aloha, which schedules transmissions independently. Under a general path loss model and Rayleigh fading, we show that, similarly to Aloha, they are also subject to elegant analysis of the coverage probabilities and transmission attempts (also known as local delay). This is mainly due to the explicit, determinantal form of the conditional (Palm) distribution and closed-form expressions for the Laplace functional of determinantal processes. Interestingly, the derived performance characteristics of the network are amenable to various optimizations of the scheduling parameters, which are determinantal kernels, allowing the use of techniques developed for statistical learning with determinantal processes. Well-established sampling algorithms for determinantal processes can be used to cope with implementation issues, which is is beyond the scope of this paper, but it creates paths for further research.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
