Proposal and performance analysis of a multiple-access protocol for high-speed wireless LANs

Sobrinho, J.L.; Brazio, J.M.

doi:10.1016/0169-7552(95)00106-9

Cited by 8 publications

(3 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The first set that we checked is (OH1, OH2, OH3) (14,4,5). This set represents for example a channel of 500 kb/s, 500-bit information packets, 50-bit control packets, a processing time of 40 s and a detection time of 10 s. The detection time is relatively long.…”

Section: Simulation Resultsmentioning

confidence: 99%

“…The first is related to the mobility of stations, which prohibits the BS from always knowing which stations are under its coverage. The other drawback is related to the situation in which only a small number of stations have packets to transmit [5]. Since the BS polls every station, it can happen that many stations are polled only to learn that they O. Sharon is with the Department of Mathematics, Haifa University, Haifa, Israel (e-mail: oran@mathcs11.haifa.ac.il).…”

mentioning

confidence: 99%

See 1 more Smart Citation

An efficient polling MAC for wireless LANs

Sharon

Altman

2001

IEEE/ACM Trans. Networking

View full text Add to dashboard Cite

Abstract-Polling schemes are an important class of medium access control (MAC) protocols for wireless local area networks (WLANs). A major drawback of these schemes is their inefficiency when only a small number of mobile stations have packets to transmit. This inefficiency is due to the polling of mobile stations with no packets to transmit, which delays the transmissions of mobile stations with packets. In this paper, we suggest a new polling MAC which exploits the capture phenomena and enables simultaneous polling and transmissions of information packets. Mathematical analysis and simulation results show that the new MAC overcomes the above inefficiency considerably, and thus it is more efficient in the sense that it enables higher throughput and a lower access delay. For example, we show scenarios in which the average access delay is reduced by about 30% and the throughput increases by 66%-75%.

show abstract

Section: Simulation Resultsmentioning

confidence: 99%

mentioning

confidence: 99%

An efficient polling MAC for wireless LANs

Sharon

Altman

2001

IEEE/ACM Trans. Networking

View full text Add to dashboard Cite

show abstract

“…Time is divided in windows of duration A seconds. (In [13] we give criteria to dimension A.) At the end of wihdow n the base station schedules the transmission of command TRY?).…”

Section: B Multiple Access Protocol For Data Trafficmentioning

confidence: 99%

A multiple access protocol for integrated voice and high-speed data in wireless networks

Sobrinho

Brazio²

5th IEEE International Symposium on Personal, Indoor and Mobile Radio Communications, Wireless Networks - Catching the Mobile F

View full text Add to dashboard Cite

An asynchronous multiple access protocol is presented for integrated voice/data communications in wireless networks, whereby the base station coordinates the uplink access of terminals within its cell with short controlling messages. Voice terminals are given access rights to the channel in a round-robin order, and transmit variable length packets to adapt to congestion. On the other hand, data terminals have to contend for air-time with minipackets, on invitation from the base station. Minipacket conflicts, whenever they occur, are expeditiously resolved with a binary splitting tree algorithm. The protocol is developed to allow downlink and uplink traffic to time-share a common radio channel. Voice and data access procedures are multiplexed by t h e base station with a (T,, Td)-scheme, whereby voice and data traffic are served alternately for a maximum of T, and Td seconds, respectively. The resulting multiple access protocol lends itself to flexible access procedures, while providing an efficient use of the available bandwidth. In addition, very low data packet delays can be achieved without deteriorating the performance of voice traffic.

show abstract

A load awareness medium access control protocol for single‐hop wireless ad hoc networks

Chao

Sheu

Chou

2006

Wireless Communications

View full text Add to dashboard Cite

A contention‐based wireless ad hoc medium access control (MAC) protocol, such as carrier sense multiple access with collision avoidance (CSMA/CA), has excellent efficiency when the system is light loaded. The main drawback of such protocols is their inefficiency and unbounded delay when the system load is heavy. On the other hand, a contention‐free MAC protocol, such as token passing, has a better and fair throughput when the system is heavy loaded. The main drawback of such protocols is their inefficiency when only a small amount of users want to transmit. In this paper, we propose a new load awareness single‐hop wireless ad hoc MAC protocol (which is called the LA protocol) that exploits the benefits of both contention‐based and contention‐free protocols. A contention‐based MAC protocol is used when the system is light loaded and a contention‐free one is used otherwise. Our LA protocol, which operates in a distributed fashion and is fully compatible with the IEEE 802.11 wireless local area network (WLAN) standard, can switch smoothly between the contention‐based protocol and the contention‐free one. Simulation results show that our protocol indeed extracts the better part of two kinds of protocols. Copyright © 2006 John Wiley & Sons, Ltd.

show abstract

Proposal and performance analysis of a multiple-access protocol for high-speed wireless LANs

Cited by 8 publications

References 20 publications

An efficient polling MAC for wireless LANs

An efficient polling MAC for wireless LANs

A multiple access protocol for integrated voice and high-speed data in wireless networks

A load awareness medium access control protocol for single‐hop wireless ad hoc networks

Contact Info

Product

Resources

About