A study of HIPERLAN-type noncooperative medium access control setting in a wireless LAN

• Autorzy: Konorski J.
• Języki publikacji: EN

Abstrakty

EN

A single-hop wireless LAN is considered. Stations are contended for access to the shared radio channel using an elective-type MAC protocol whose two components are: a common scheduling policy that provides a framework for taking elective actions and defines winning elective actions, and contention strategies that dictate actions in successive protocol cycles. In a noncooperative setting the two components are logically separate: besides cooperative stations that use a standard HIPERLAN-type contention strategy, there are noncooperative stations that use self-optimising strategies at the bandwidth cost of the former, yet in order to conceal their nature and maintain proper synchronisation adhere to the scheduling policy. This paper proposes a self-regulatory solution whereby the scheduling policy and the contention strategy used by c-stations are jointly designed so as to invoke a noncooperative inter-station game with a fair outcome. A family of policies, termed EB/ECD-Monotone( Delta ), and contention strategies called the closed shop and best response are proposed and found satisfactory upon evaluation via simulation with a focus on bandwidth distribution under heavy-load.

Słowa kluczowe

EN

single-hop wireless LAN; elective-type MAC protocol; scheduling policy; HIPERLAN-type contention strategy; noncooperative stations; noncooperative game; self-optimising strategies; EB/ECD monotone; Closed Shop; Best Response

• Wydawca: Oficyna Wydawnicza Politechniki Wrocławskiej
• Czasopismo: Systems Science
• Rocznik: 2002
• Tom: Vol. 28, nr 1
• Strony: 71--84
• Opis fizyczny: Bibliogr. 15 poz.

Twórcy

autor

Konorski J.

• Technical University of Gdańsk, ul. Narutowicza 11/12, 80-952 Gdańsk, Poland

Bibliografia

• [1] Buttyan L., Hubaux J. P., Nuglets: A Virtual Currency to Stimulate Cooperation in Self-Organised Mobile Ad-hoc Networks, Tech. Rep. DSC/2001/001, Swiss Federal Institute of Technology 2001.
• [2] ETSI TC RES (Radio Eąuipment and Systems), High Performance Radio Local Area NetWork (HIPERLAN); Services and Facilities; Yersion 1.1, RES 10, Jan. 1995.
• [3] Friedman E. J., Shenker S., Synchronous and Asynchronous Learning by Responsive Leaming Automata, Mimeo 1996.
• [4] Heikkinen T., On Learning and thę Quality of Service in a Wireless NetWork, Proc. Networking 2000, Paris, LNCS, Vol. 1815, Springer-Yerla^ 2000, 679-688.
• [5] IEEE 802.11 Standard, Wireless Media Access Control (MAC) and Physical Layer (PHY) Specifications, 1999.
• [6] Kalai E., Lehrer E., Rational Leaming Leads to Nash Eguilibrium, Econometrica, Vol. 61, 1993, 1019-1045.
• [7] Konorski J., Nowicki K., Wozniak J., The Cooperative Random Token Protocol for High-speed Radio LANs, Proc. GLOBECOM'92, Orlando FL, Dec. 1992.
• [8] Konorski J., Packet Scheduling in Wireless LANs -A Framework for a Non-cooperative Paradigm, Proc. IFIP Int. Conf. on Personal Wireless Communications PWC'2000, Gdańsk, Poland, Kluwer Academic Publishers, 2000, 29-42.
• [9] Konorski J., Protection of Fairness for Multimedia Traffic Streams in a Non-cooperative Wireless LAN Setting, Proc. 6th Int. Conf. on Protocols for Multimedia Systems PROMS 2001, Enschede, The Netherlands, LNCS, Vol. 2213, Springer-Yerlag, 2001,116-129.
• [10] Korilis Y. a., Lazar A. A., Orda A., Architecting Noncooperative Networks, IEEE J. Selected AreasCommun., Yol. 13,1995, 1241-1251.
• [11] Lazar A.A., Semret N., Auctions for Network Resource Sharing, Tech. Rep. CU/CTR/TR 468-97- 02, Columbia Univ., 1997.
• [12] MacKenzie a. B., Wicker S. B., Gamę Theory and the Design of Self-Configuring, Adaptive Wireless Networks, IEEE Comm. Magazine, Yol. 39,'2001, 126-131.
• [13] Milgrom P., Roberts J., AdaptWe and Sophisticated Learning in Normal Form Games, Games and Economic Behaviour, Yol. 3, 1991, 82-100.
• [14] Sanders B. A., An Incentwe Compatible Flow Control Algorithm for Ratę Allocation in Computer Networks, IEEE Trans. Comput., Yol. 37,1988, 1067-1072.
• [15] Shenker S., Making Greed Work in Networks: A Game-Theoretic Analysis of Switch Service Disci- plines. Proc. SIGCOMM'94, London, UK.