Packet Reservation technology is frequently used in Media Access Control protocols. To increase the utilization of bandwidth, D.J. Goodman et al. presented the p-persistent algorithm, in which an access probability p ...Packet Reservation technology is frequently used in Media Access Control protocols. To increase the utilization of bandwidth, D.J. Goodman et al. presented the p-persistent algorithm, in which an access probability p is used to reduce collision. This idea is applied in many protocols. In this paper, the distribution of the number of accessing terminals is forecasted to determine the access probability dynamically. This method helps the protocol adaptive to various system environments automatically.展开更多
In this paper, a new MAC protocol for WLAN is proposed. The new protocol, which is called PRMA (Priority Rotation Multiple Access), is based on priority rotation theory. In PRMA, each access cycle consists of a conten...In this paper, a new MAC protocol for WLAN is proposed. The new protocol, which is called PRMA (Priority Rotation Multiple Access), is based on priority rotation theory. In PRMA, each access cycle consists of a contention period and a data transmission period. During contention period, a node competes for the right to control the channel according to its priority. The winner of contention can control the channel and can send data without collision in data transmission period. Analysis and simulation results show that PRMA is a stable protocol, which means that it can achieve high throughput both under high-load and under low-load conditions.展开更多
This paper introduces a packet reservation multiple access (PRMA) with random contention for fixed wireless access communications. The performance of PRMA scheme with random contention is compared with the performance...This paper introduces a packet reservation multiple access (PRMA) with random contention for fixed wireless access communications. The performance of PRMA scheme with random contention is compared with the performances of traditional PRMA under permission contention scheme. The proposed scheme is a simpler contention mechanism that does not depend on a pre-determined permission probability as PRMA under permission contention scheme. In this new method, terminals select the contention slot uniformly from the pool of remaining free slots in the current frame. We evaluate the performance of the new contention mechanism in terms of various metrics including maximum number of carried voice calls and packet delays for a given acceptable drop rate of voice packets. We show that the new mechanism is superior to that of PRMA under permission contention scheme for loaded systems and is expected to be insensitive for traffic source burstiness.展开更多
文摘Packet Reservation technology is frequently used in Media Access Control protocols. To increase the utilization of bandwidth, D.J. Goodman et al. presented the p-persistent algorithm, in which an access probability p is used to reduce collision. This idea is applied in many protocols. In this paper, the distribution of the number of accessing terminals is forecasted to determine the access probability dynamically. This method helps the protocol adaptive to various system environments automatically.
文摘In this paper, a new MAC protocol for WLAN is proposed. The new protocol, which is called PRMA (Priority Rotation Multiple Access), is based on priority rotation theory. In PRMA, each access cycle consists of a contention period and a data transmission period. During contention period, a node competes for the right to control the channel according to its priority. The winner of contention can control the channel and can send data without collision in data transmission period. Analysis and simulation results show that PRMA is a stable protocol, which means that it can achieve high throughput both under high-load and under low-load conditions.
文摘This paper introduces a packet reservation multiple access (PRMA) with random contention for fixed wireless access communications. The performance of PRMA scheme with random contention is compared with the performances of traditional PRMA under permission contention scheme. The proposed scheme is a simpler contention mechanism that does not depend on a pre-determined permission probability as PRMA under permission contention scheme. In this new method, terminals select the contention slot uniformly from the pool of remaining free slots in the current frame. We evaluate the performance of the new contention mechanism in terms of various metrics including maximum number of carried voice calls and packet delays for a given acceptable drop rate of voice packets. We show that the new mechanism is superior to that of PRMA under permission contention scheme for loaded systems and is expected to be insensitive for traffic source burstiness.
