Results 161 to 170 of about 27,971 (206)
Analysis of Slotted ALOHA With an Age Threshold [PDF]
IEEE Journal on Selected Areas in Communications, 2021 We present a comprehensive steady-state analysis of threshold-ALOHA, a distributed age-aware modification of slotted ALOHA proposed in recent literature. In threshold-ALOHA, each terminal suspends its transmissions until the Age of Information (AoI) of the status update flow it is sending reaches a certain threshold $Γ$.
Elif Uysal, Orhan Tahir Yavaşcan
exaly +6 more sources
Delay Distributions of Slotted ALOHA and CSMA [PDF]
IEEE Transactions on Communications, 2003 We derive the closed-form delay distributions of slotted ALOHA and nonpersistent carrier sense multiple access (CSMA) protocols under steady state. Three retransmission policies are analyzed. We find that under a binary exponential backoff retransmission policy, finite average delay and finite delay variance can be guaranteed for ...
T -S P Yum
exaly +3 more sources
Slotted Aloha as a Game With Partial Information [PDF]
Computer Networks, 2004 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Eitan Altman, Rachid El Azouzi
exaly +4 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Cooperative-Diversity Slotted ALOHA
Second International Conference on Quality of Service in Heterogeneous Wired/Wireless Networks (QSHINE'05), 2005We 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, 2004We 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 +2 more sources
Cooperation and Fairness for Slotted Aloha
Wireless Personal Communications, 2006Wireless 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 +3 more sources
Interference and SINR Coverage in Spatial Non-Slotted Aloha Networks
Annales Des Telecommunications/Annals of Telecommunications, 2015 arXiv admin note: substantial text overlap with arXiv:1002.1629International audienceIn this paper we propose two analytically tractable stochastic-geometric models of interference in ad-hoc networks using pure (non-slotted) Aloha as the medium access ...
Paul Mühlethaler
exaly +2 more sources
Mobile Slotted Aloha for Vanets
2009 IEEE 70th Vehicular Technology Conference Fall, 2009Vanet 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 +2 more sources
A hierarchical slotted aloha game
2009 International Conference on Game Theory for Networks, 2009We 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), 2015The 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