Computer Science – Networking and Internet Architecture
Scientific paper
2009-06-02
IEEE/ACM Transactions on Networking, 2010
Computer Science
Networking and Internet Architecture
32 pages, 7 figures, 2 tables
Scientific paper
10.1109/TNET.2010.2050699
Many existing medium access control (MAC) protocols utilize past information (e.g., the results of transmission attempts) to adjust the transmission parameters of users. This paper provides a general framework to express and evaluate distributed MAC protocols utilizing a finite length of memory for a given form of feedback information. We define protocols with memory in the context of a slotted random access network with saturated arrivals. We introduce two performance metrics, throughput and average delay, and formulate the problem of finding an optimal protocol. We first show that a TDMA outcome, which is the best outcome in the considered scenario, can be obtained after a transient period by a protocol with (N-1)-slot memory, where N is the total number of users. Next, we analyze the performance of protocols with 1-slot memory using a Markov chain and numerical methods. Protocols with 1-slot memory can achieve throughput arbitrarily close to 1 (i.e., 100% channel utilization) at the expense of large average delay, by correlating successful users in two consecutive slots. Finally, we apply our framework to wireless local area networks.
der Schaar Mihaela van
Park Jaeok
No associations
LandOfFree
Medium Access Control Protocols With Memory does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Medium Access Control Protocols With Memory, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Medium Access Control Protocols With Memory will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-235631