It is a need of the time to use renewable energy along with the efficient energy systems. In this paper, analysis of vector controlled induction motor drive without speed sensor is presented. For speed estimation, Model Reference Adaptive System (MRAS) scheme based on a rotor flux error is employed to obtain a close loop speed control operation. Two different controllers used in MRAS scheme for the adaptation of rotor speed are: fuzzy logic controller (FLC) and conventional fixed gain proportional-integral (PI) controller. A simple and accurate model is developed for each component of the system. System performance is analyzed for different operating conditions for induction motor drive and Photovoltaic array.

This paper introduces models and a system for designing 802.11 wireless LANs (WLANs) using flexible channelization— the choice of an appropriate channel width and center frequency for each transmission. In contrast to current 802.11 systems that use fixed width channels, the proposed system, FLUID, configures all access points and their clients using flexible channels. We show that a key challenge in designing such a system stems from managing the effects of interference due to multiple transmitters employing variable channel widths, in a network-wide setting. We implemented FLUID in an enterprise-like setup using a 50 node testbed (with off-the shelf wireless cards) and we show that FLUID improves the average throughput by 59 percent across all PHY rates, compared to existing fixed-width approaches.

While virtual machine (VM) migration is allowing data centers to rebalance workloads across physical machines, the promise of a maximally utilized infrastructure is yet to be realized. Part of the challenge is due to the inherent dependencies between VMs comprising a multi-tier application, which introduce complex load interactions between the underlying physical servers. For example, simply moving an overloaded VM to a (random) underloaded physical machine can inadvertently overload the network. We introduce AppAware-a novel, computationally efficient scheme for incorporating (1) inter-VM dependencies and (2) the underlying network topology into VM migration decisions. Using simulations, we show that our proposed method decreases network traffic by up to 81%compared to a well known alternative VM migration method that is not application-aware.

This paper introduces models and a system for designing 802.11 wireless LANs (WLANs) using flexible channelization -- the choice of an appropriate channel width and center frequency for each transmission. In contrast to current 802.11 systems that use fixed width channels, the proposed system, FLUID, configures all access points and their clients using flexible channels. We show that a key challenge in designing such a system stems from managing the effects of interference due to multiple transmitters employing variable channel widths, in a network-wide setting. We implemented FLUID in an enterprise-like setup using a 50 node testbed (with off-the shelf wireless cards) and we show that FLUID improves the average throughput by 59% across all PHY rates, compared to existing fixed-width approaches.

Enterprise WLANs have made a dramatic shift towards centralized architectures in the recent past. The reasons for such a change have been ease of management and better design of various control and security functions. The data path of WLANs, however, continues to use the distributed, random-access model, as defined by the popular DCF mechanism of the 802.11 standard. While theoretical results indicate that a centrally scheduled data path can achieve higher efficiency than its distributed counterpart, the likely complexity of such a solution has inhibited practical consideration. In this paper, we take a fresh, implementation and deployment oriented, view in understanding data path choices in enterprise WLANs. We perform extensive measurements to characterize the impact of various design choices, like scheduling granularity on the performance of a centralized scheduler, and identify regions where such a centralized scheduler can provide the best gains.Our detailed evaluation with scheduling prototypes deployed on two different wireless testbeds indicates that DCF is quite robust in many scenarios, but centralization can play a unique role in 1) mitigating hidden terminals - scenarios which may occur infrequently, but become pain points when they do and 2) exploiting exposed terminals - scenarios which occur more frequently, and limit the potential of successful concurrent transmissions. Motivated by these results, we design and implement CENTAUR - a hybrid data path for enterprise WLANs, that combines the simplicity and ease of DCF with a limited amount of centralized scheduling from a unique vantage point. Our mechanisms do not require client cooperation and can support legacy 802.11 clients.

We present a measurement study of a large-scale urban WiFi mesh network consisting of more than 250 Mesh Access Points (MAPs), with paying customers that use it for Internet access. Our study, involved collecting multi-modal data, e.g., through continuous gathering of SNMP logs, syslogs, passive traffic capture, and limited active measurements in different parts of the city. Our study is split into four components — planning and deployment of the mesh, success of mesh routing techniques, likely experience of users, and characterization of how the mesh is utilized. During our data collection process that spanned 8 months, the network changed many times due to hardware and software upgrades. Hence to present a consistent view of the network, the core dataset used in this paper comes from a two week excerpt of our dataset. This part of the dataset had more than 1.7 million SNMP log entries (from 224 MAPs) and more than 100 hours of active measurements. The scale of the study allowed us to make many important observations that are critical in planning and using WiFi meshes as an Internet access technology. For example, our study indicates that the last hop 2.4GHz wireless link between the mesh and the client is the major bottleneck in client performance. Further we observe that deploying the mesh access points on utility poles results in performance degradation for indoor clients that receive poor signal from the access points.

We present an experimental study of IEEE 802.11n (high throughput extension to the 802.11 standard) using commodity wireless hardware. 802.11n introduces a variety of new mechanisms including physical layer diversity techniques, channel bonding and frame aggregation mechanisms. Using measurements from our testbed, we analyze the fundamental characteristics of 802.11n links and quantify the gains of each mechanism under diverse scenarios. We show that the throughput of an 802.11n link can be severely degraded (up ≈85%) in presence of an 802.11g link. Our results also indicate that increased amount of interference due to wider channel bandwidths can lead to throughput degradation. To this end, we characterize the nature of interference due to variable channel widths in 802.11n and show that careful modeling of interference is imperative in such scenarios. Further, as a reappraisal of previous work, we evaluate the effectiveness of MAC level diversity in the presence of physical layer diversity mechanisms introduced by 802.11n.

A wide range of transmit power control (TPC) algorithms have been proposed in recent literature to reduce interference and increase capacity in 802.11 wireless networks. However, few of them have made it to practice. In many cases this gap is attributed to lack of suitable hardware support in wireless cards to implement these algorithms. In particular, many research efforts have indicated that wireless card vendors need to support power control mechanisms in a fine-grained manner - both in the number of possible power levels and the time granularity at which the controls can be applied. In this paper we claim that even if fine-grained power control mechanisms were to be made available by wireless card vendors, algorithms would not be able to properly leverage such degrees of control in typical indoor environments. We prove this claim through rigorous empirical analysis and then build a tunable empirical model (Model-TPC) that can determine the granularity of power control that is actually useful. To illustrate the importance of our solution, we conclude by demonstrating the impact of choice of power control granularity on Internet applications where wireless clients interact with servers on the Internet. We observe that the number of feasible power was found to be between 2-4 for most indoor environments. We believe that the results from this study can serve as the right set of assumptions to build practically realizable TPC algorithms in the future.

A radio frequency identifier (RFID) system consists of inexpensive, uniquely-identifiable tags that are mounted on physical objects, and readers that track these tags (and hence these physical objects) through RF communication. In this paper we, therefore, address this load balancing problem for readers - given a set of tags that are within range of each reader, which of these tags should each reader be responsible for such that the cost for monitoring tags across the different readers is balanced, while guaranteeing that each tag is monitored by at least one reader. We show that a generalized variant of the load balancing problem is NP-hard and hence present a 2-approximation centralized algorithm. We next present an optimal centralized solution for a specialized variant. Subsequently, we present a localized distributed algorithm that is probabilistic in nature and closely matches the performance of the centralized algorithms. Our results demonstrate that our schemes achieve very good performance even in highly dynamic large-scale RFID systems.

Wireless LANs are commonplace installations in enterprise environments. Their ease of use and deployment, however, are accompanied by a difficulty in their management and security. Proposed solutions to these problems are based on centralization; in the control plane through centralized authentication and allocation of channels and power levels, and in the data plane through time slotted medium access using centralized scheduling for interference mitigation. While centralization of some control plane tasks has been shown to be feasible, centralization on the data plane is significantly harder to realize. This is because it needs to take into account the inherent variability of the wireless medium while offering bounds on delay and jitter on the control paths. In this work, we present a study of the various problems that arise in centralization of the data plane in an enterprise WLAN. We believe that a pragmatic solution for data plane centralization is the key approachto provisioning an enterprise WLAN consisting of a dense deployment of APs.

Wireless 802.11 hotspots have grown in an uncoordinated fashion with highly variable deployment densities. Such uncoordinated deployments, coupled with the difficulty of implementing coordination protocols, has often led to conflicting configurations (e.g., in choice of transmission power and channel of operation) among the corresponding Access Points (APs). Overall, such conflicts cause both unpredictable network performance and unfairness among clients of neighboring hotspots. In this paper, we focus on the fairness problem for uncoordinated deployments. We study this problem from the channel assignment perspective. Our solution is based on the notion of channel-hopping, and meets all the important design considerations for control methods in uncoordinated deployments - distributed in nature, minimal to zero coordination among APs belonging to different hotspots, simple to implement, and interoperable with existing standards. In particular, we propose a specific algorithm called MAXchop, which works efficiently when using only non-overlapping wireless channels, but is particularly effective in exploiting partially-overlapped channels that have been proposed in recent literature. We also evaluate how our channel assignment approach complements previously proposed carrier sensing techniques in providing further performance improvements. Through extensive simulations on real hotspot topologies and evaluation of a full implementation of this technique, we demonstrate the efficacy of these techniques for not only fairness, but also the aggregate throughput, metrics.We believe that this is the first work that brings into focus the fairness properties of channel hopping techniques and we hope that the insights from this research will be applied to other domains where a fair division of a system's resources is an important consideration.

Success of peer-to-peer applications in many cases is attributed to user altruism, where a user contributes some of its own resources to facilitate performance of other users. This observation has been corroborated with some experimental evidence. In this paper we make a first attempt to demonstrate that there are many scenarios where peer-to-peer resource sharing is a natural behavior that selfish users can use to improve their own performance. In particular we examine such natural incentives that exist in a streaming media application which lead such greedy users to cooperate and share resources with each other in forming an efficient overlay multicast tree. We define a freestyle Bazaar environment in which streaming media receivers interact with each other and cooperatively construct an overlay tree for improving their perception of media streams from a single server. Through simulations we demonstrate the efficacy of our proposed environment.