Resource Competition on Integral Polymatroids

We study competitive resource allocation problems in which players distribute their demands integrally on a set of resources subject to player-specific submodular capacity constraints. Each player has to pay for each unit of demand a cost that is a nondecreasing and convex function of the total allocation of that resource. This general model of resource allocation generalizes both singleton congestion games with integer-splittable demands and matroid congestion games with player-specific costs. As our main result, we show that in such general resource allocation problems a pure Nash equilibrium is guaranteed to exist by giving a pseudo-polynomial algorithm computing a pure Nash equilibrium.Comment: 17 page

Run-time Optimized Reconfiguration Using Instruction Forecasting

The extensive use of reconfigurable computing devices has imposed a new category of processors, the dynamic instruction set processors (DISPs) that customize their instruction sets dynamically to the application needs. One of the major drawbacks of DISPs is the reconfiguration time needed to alter the instruction set, which is directly added to the program execution time discouraging the use of DISPs especially for time critical processing applications. This paper introduces a methodology for optimizing reconfiguration time through instruction forecasting and presents the results obtained when applying this method to Medium Access processing systems that execute time critical network tasks

Efficient voice communications over IEEE 802.11 WLANs using improved PCF procedures

Copyright Notice: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted or mass reproduced without the explicit permission of the copyright holder

The Effect of Finite Population on IEEE802.11 Wireless LANs Throughput/Delay Performance

Copyright Notice: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted or mass reproduced without the explicit permission of the copyright holder

A Dynamically Adaptable Polling Scheme for Voice Support in IEEE802.11 Networks

This paper presents a new dynamically adaptable polling scheme for efficient support of voice communications over an IEEE802.11 network. The proposed Cyclic Shift and Station Removal polling scheme is implemented only on the Access Point of each Basic Service Set without requiring any modification on the existing access protocol. This polling scheme increases the number of conversations in case of silence detection, while maintains high voice quality. By considering constant bit rate digitized voice traffic, the paper presents a discretetime Markov chain model, that is, used to analyze the performance of the IEEE802.11 Point Coordination Function in terms of maximum number of supported conversations, when silence detection is used at the mobile terminals. The paper also determines how the parameters of the proposed polling scheme have to be related to the silence detector hangover

Relative Direction Determination in Mobile Computing Networks

A novel relative direction determination method is presented for stations of mobile computing networks. The method uses a switched beam array for determining the direction of arrival (DOA) of the incident electromagnetic field in a time efficient way, in order to confront the strict timing requirements of packet switching networks. Additionally, the method associates certain MAC layer functions with different radiation patterns of the switched antenna array, in order to determine the orientation of directional beams on both sides of a communication link. The application of the method to an IEEE802.11 wireless network is presented and it is shown how the use of the method optimizes the network performance without requiring any modifications to the existing MAC protocol