Adaptive Probabilistic Medium Access in MPR-Capable Ad-Hoc Wireless Networks

Ghanbarinejad, Majid; Schlegel, Christian; Gburzyński, Paweł

doi:10.1109/glocom.2009.5425228

Cited by 18 publications

(14 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The number of active devices follows a Poisson distribution with mean N , and we adopt the adaptive random access scheme in [20]. Moreover, we assume a time-slotted system, where all active devices attempt to transmit a packet with a probability at the beginning of each time slot.…”

Section: The Validity Of the Adaptive Mpr Capability Optimization Algmentioning

confidence: 99%

See 1 more Smart Citation

A MPR optimization algorithm for FSO communication system with star topology

Zhao

Chi

Guan

2015

Optics Communications

View full text Add to dashboard Cite

Section: The Validity Of the Adaptive Mpr Capability Optimization Algmentioning

confidence: 99%

“…Ref. [20] proposed an adaptive probabilistic medium access for MPR-capable ad hoc network to maximize the network throughput. Ref.…”

Section: Introductionmentioning

confidence: 99%

A MPR optimization algorithm for FSO communication system with star topology

Zhao

Chi

Guan

2015

Optics Communications

View full text Add to dashboard Cite

“…The network throughput S is defined as the average number of the successfully received packets in one cluster, and it satisfies S = GP p [19]. Considering that the spreadspectrum networks occupy extra spectrum resources, we introduce a spread gain into S during the network performance evaluation.…”

Section: Normalized Network Throughputmentioning

confidence: 99%

Carrier Sense Random Packet CDMA Protocol in Dual-Channel Networks

Du¹,

Quan²,

Pei-zhang³

et al. 2015

RADIOENGINEERING

View full text Add to dashboard Cite

show abstract

“…While this model provides a useful abstraction for a general multi-packet reception network, it does not accurately capture the underlying mechanisms of SIC-based networks such as selection of the transmission rates. Other works on multi-packet reception, such as [9] and [10], assume even a simpler model in which a receiver is capable of receiving up to k packets simultaneously regardless of the transmission rates and channel conditions. The closest work to ours is due to Kumaran and Qian [11] where the authors consider the uplink scheduling problem with SIC.…”

Section: Introductionmentioning

confidence: 99%

Fair and efficient scheduling in wireless networks with successive interference cancellation

Mollanoori

Ghaderi

2011

2011 IEEE Wireless Communications and Networking Conference

View full text Add to dashboard Cite

Abstract-This paper considers the problem of uplink scheduling in wireless networks supporting successive interference cancellation (SIC) at the physical layer. By allowing concurrent interfering transmissions, SIC enables multi-packet reception at the receiver resulting in increased network throughput. Specifically, we consider maximum throughput scheduling and proportional fair scheduling problems and study optimal and heuristic algorithms for these problems. We prove that the maximum throughput scheduling problem is NP-hard and develop a throughput efficient polynomial time greedy algorithm for the problem. While being throughput efficient, the maximum throughput scheduling can lead to highly unfair rates among the users. The proportional fair scheduling, on the other hand, is not throughput optimal but achieves proportional fairness among the users. For scheduling multiple users in a single time-slot, we show that there exists an algorithm that solves the proportional fair scheduling problem in polynomial time. For scheduling in multiple time-slots, we develop a greedy algorithm that computes a highly fair schedule in polynomial time. Numerical results are also provided to show the utility and efficiency of the proposed scheduling algorithms in various simulated networks.

show abstract

Adaptive Probabilistic Medium Access in MPR-Capable Ad-Hoc Wireless Networks

Cited by 18 publications

References 10 publications

A MPR optimization algorithm for FSO communication system with star topology

A MPR optimization algorithm for FSO communication system with star topology

Carrier Sense Random Packet CDMA Protocol in Dual-Channel Networks

Fair and efficient scheduling in wireless networks with successive interference cancellation

Contact Info

Product

Resources

About