| Article ID: | iaor20073311 |
| Country: | South Korea |
| Volume: | 32 |
| Issue: | 1 |
| Start Page Number: | 1 |
| End Page Number: | 8 |
| Publication Date: | Jan 2006 |
| Journal: | Journal of the Korean Institute of Industrial Engineers |
| Authors: | Choi Woo-Yong, Lee Sang-Wan |
| Keywords: | programming: travelling salesman |
A modified PCF (Point Coordination Function) protocol with the optimal polling sequence is defined in detail and shown to improve the efficiency of the conventional PCF protocol in IEEE 802.11 wireless LAN standard. The problem for the optimal polling sequence is formulated as TSP (Traveling Salesman Problem) with the distance values of 1s or 0s. Numerical examples show that the optimal polling sequence increases the capacity of the real-time service such as VoIP (Voice over Internet Protocol).