Results 161 to 170 of about 6,711 (206)
Some of the next articles are maybe not open access.

Cooperative-Diversity Slotted ALOHA

Second International Conference on Quality of Service in Heterogeneous Wired/Wireless Networks (QSHINE'05), 2005
We propose a cooperative-diversity technique for ad hoc networks based on the decode-and-forward relaying strategy. We develop a MAC protocol based on slotted ALOHA that allows neighbors of a transmitter to act as relays and forward a packet toward its final destination when the transmission to the intended recipient fails.
Wing-Hin Wong, John M. Shea, Tan F. Wong
openaire   +1 more source

On the instability of slotted aloha with capture

IEEE Transactions on Wireless Communications, 2004
We analyze the stability properties of slotted Aloha with capture for random access over fading channels with infinitely-many users. We assume that each user node knows only its own uplink channel gain, and uses this decentralized channel state information (CSI) to perform power control and/or probability control.
Yingqun Yu   +2 more
openaire   +1 more source

Cooperation and Fairness for Slotted Aloha

Wireless Personal Communications, 2006
Wireless access based on slotted Aloha with selfish users may result in very inefficient use of the system resources. To impose cooperation and fairness in such systems, we propose an optimal pricing strategy, based on which the service provider can regulate the overall network behavior.
Dandan Wang 0001   +2 more
openaire   +2 more sources

Mobile Slotted Aloha for Vanets

2009 IEEE 70th Vehicular Technology Conference Fall, 2009
Vanet literature is mainly focused on CSMA and CSMA-like access protocols. Actually a deep study on how a slotted approach could be adopted in Vanet is missing. This is mainly due to the lack of a distributed MAC able to guarantee a scalable resource reservation without involving a central poller.
Riccardo Scopigno   +1 more
openaire   +1 more source

A hierarchical slotted aloha game

2009 International Conference on Game Theory for Networks, 2009
We consider in this paper a wireless system composed of one central receiver and several selfish transmitters communicating via the slotted aloha protocol. We study a noncooperative hierarchical system based on the Stackelberg game concept. Each user of our game tends to maximize his own throughput or minimize his expected delay of backlogged packets ...
Essaid Sabir   +2 more
openaire   +1 more source

Slotted ALOHA with compute-and-forward

2015 IEEE International Symposium on Information Theory (ISIT), 2015
The benefit of applying compute-and-forward (C&F) to slotted ALOHA (S-ALOHA) systems is studied. A Markov chain model is introduced, and an approximate stability region is given. It is shown that the approximate region is asymptotically exact as the number of users tends to infinity.
Shwan Ashrafi   +3 more
openaire   +1 more source

Analysis of Age-Aware Slotted ALOHA

2020 IEEE Globecom Workshops (GC Wkshps, 2020
We present a steady-state analysis of threshold-ALOHA, a distributed age-aware modification of slotted ALOHA. Under threshold-ALOHA, each source remains passive until a certain age threshold $\Gamma$ is reached. Nodes whose ages exceed the threshold attempt transmission with a fixed probability $\tau$ in each slot.
Orhan Tahir Yavascan, Elif Uysal
openaire   +1 more source

On The Rate-Distance Adaptability of Slotted Aloha

2008 IEEE International Conference on Communications, 2008
In wireless communication systems, the signal strength/quality generally varies with the distances between transmitters and receivers. As a consequence, the throughput in the MAC layer (or the transmission data rate in the PHY layer) also varies accordingly.
Chih-Cheng Tseng   +3 more
openaire   +1 more source

MiSTA: Threshold-ALOHA with Mini Slots

2021 IEEE International Black Sea Conference on Communications and Networking (BlackSeaCom), 2021
We study a modification of the Threshold ALOHA policy that we refer to as Mini Slotted Threshold ALOHA (MiSTA). In MiSTA, as in Threshold ALOHA, sources with age of information (AoI) below a certain threshold Γ are inactive. In addition, each time slot is preceded by a mini slot during which active sources test the channel with a certain probability, $\
Mutlu Ahmetoglu   +2 more
openaire   +1 more source

Home - About - Disclaimer - Privacy