Spelling suggestions: "subject:"plans"" "subject:"wlan""
11 |
Optimizing dense wireless networks of MIMO linksCortes-Pena, Luis Miguel 27 August 2014 (has links)
Wireless communication systems have exploded in popularity over the past few decades. Due to their popularity, the demand for higher data rates by the users, and the high cost of wireless spectrum, wireless providers are actively seeking ways to improve the spectral efficiency of their networks. One promising technique to improve spectral efficiency is to equip the wireless devices with multiple antennas. If both the transmitter and receiver of a link are equipped with multiple antennas, they form a multiple-input multiple-output (MIMO) link.
The multiple antennas at the nodes provide degrees-of-freedom that can be used for either sending multiple streams of data simultaneously (a technique known as spatial multiplexing), or for suppressing interference through linear combining, but not both. Due to this trade-off, careful allocation of how many streams each link should carry is important to ensure that each node has enough degrees-of-freedom available to suppress the interference and support its desired streams. How the streams are sent and received and how interference is suppressed is ultimately determined by the beamforming weights at the transmitters and the combining weights at the receivers. Determining these weights is, however, made difficult by their inherent interdependency.
Our focus is on unplanned and/or dense single-hop networks, such as WLANs and femtocells, where each single-hop network is composed of an access point serving several associated clients. The objective of this research is to design algorithms for maximizing the performance of dense single-hop wireless networks of MIMO links. We address the problems of determining which links to schedule together at each time slot, how many streams to allocate to each link (if any), and the beamforming and combining weights that support those streams.
This dissertation describes four key contributions as follows:
- We classify any interference suppression technique as either unilateral interference suppression or bilateral interference suppression. We show that a simple bilateral interference suppression approach outperforms all known unilateral interference suppression approaches, even after searching for the best unilateral solution.
- We propose an algorithm based on bilateral interference suppression whose goal is to maximize the sum rate of a set of interfering MIMO links by jointly optimizing which subset of transmitters should transmit, the number of streams for each transmitter (if any), and the beamforming and combining weights that support those streams.
- We propose a framework for optimizing dense single-hop wireless networks. The framework implements techniques to address several practical issues that arise when implementing interference suppression, such as the overhead of performing channel measurements and communicating channel state information, the overhead of computing the beamforming and combining weights, and the overhead of cooperation between the access points.
- We derive the optimal scheduler that maximizes the sum rate subject to proportional fairness.
Simulations in ns-3 show that the framework, using the optimal scheduler, increases the proportionally fair aggregate goodput by up to 165% as compared to the aggregate goodput of 802.11n for the case of four interfering single-hop wireless networks with two clients each.
|
12 |
Wireless and Social Networks : Some Challenges and InsightsSunny, Albert January 2016 (has links) (PDF)
Wireless networks have potential applications in wireless Internet connectivity, battlefields, disaster relief, and cyber-physical systems. While the nodes in these networks communicate with each other over the air, the challenges faced by and the subsequent design criteria of these networks are diverse. In this thesis, we study and discuss a few design requirements of these networks, such as efficient utilization of the network bandwidth in IEEE 802.11 infrastructure networks, evaluating utility of sensor node deployments, and security from eavesdroppers.
The presence of infrastructure IEEE 802.11 based Wireless Local Area Networks (WLANs) allows mobile users to seamlessly transfer huge volumes of data. While these networks accommodate mobility, and are a cost-effective alternative to cellular networks, they are well known to display several performance anomalies. We study a few such anomalies, and provide a performance management solution for IEEE 802.11 based WLANs. On the other hand, in sensor networks, the absence of infrastructure mandates the use of adhoc network architectures. In these architectures, nodes are required to route data to gateway nodes over a multi-hop network. These gateway nodes are larger in size, and costlier in comparison with the regular nodes. In this context, we propose a unified framework that can be used to compare different deployment scenarios, and provide a means to design efficient large-scale adhoc networks.
In modern times, security has become an additional design criterion in wireless networks. Traditionally, secure transmissions were enabled using cryptographic schemes. However, in recent years, researchers have explored physical layer security as an alternative to these traditional cryptographic schemes. Physical layer security enables secure transmissions at non-zero data rate between two communicating nodes, by exploiting the degraded nature of the eavesdropper channel and the inherent randomness of the wireless medium. Also, in many practical scenarios, several nodes cooperate to improve their individual secrecy rates. Therefore, in this thesis, we also study scenarios, where cooperative schemes can improve secure end-to-end data transmission rates, while adhering to an overall power budget.
In spite of the presence of voluminous reservoirs of information such as digital libraries and the Internet, asking around still remains a popular means of seeking information. In scenarios where the person is interested in communal, or location-specific information, such kind of retrieval may yield better results than a global search. Hence, wireless networks should be designed, analyzed and controlled by taking into account the evolution of the underlying social networks. This alliance between social network analysis and adhoc network architectures can greatly advance the design of network protocols, especially in environments with opportunistic communications. Therefore, in addition to the above mentioned problem, in this thesis, we have also presented and studied a model that captures the temporal evolution of information in social networks with memory.
|
13 |
Topics On Security In Sensor Networks And Energy Consumption In IEEE 802.11 WLANsAgrawal, Pranav 12 1900 (has links) (PDF)
Our work focuses on wireless networks in general, but deals specifically with security in wireless sensor networks and energy consumption in IEEE 802.11 infrastructure WLANs.
In the first part of our work, we focus on secure communication among sensor nodes in a wireless sensor network. These networks consists of large numbers of devices having limited energy and memory. Public key cryptography is too demanding for these resource-constrained devices because it requires high computation. So, we focus on symmetric key cryptography to achieve secure communication among nodes. For this cryptographic technique to work, two nodes have to agree upon a common key. To achieve this, many key distribution schemes have been proposed in the literature. Recently, several researchers have proposed schemes in which they have used group-based deployment models and assumed predeployment knowledge of the expected locations of nodes. They have shown that these schemes achieve better performance than the earlier schemes, in terms of connectivity, resilience against node capture and storage requirements. But in many situations expected locations of nodes are not available. We propose a solution which does not use the group-based deployment model and predeployment knowledge of the locations of nodes, and yet performs better than schemes which make the aforementioned assumptions.
In our scheme, groups are formed after the deployment of sensor nodes on the basis of their physical locations. Nodes in different groups sample keys from disjoint key pools, so that compromise of a node affects secure links of its group only. Because of this reason, our scheme performs better than earlier schemes as well as the schemes using predeployment knowledge, in terms of connectivity, storage requirement, and security. Moreover, the post-deployment key generation process completes sooner than in schemes like LEAP+.
In the second part of our work, we develop analytical models for estimating the energy spent by stations (STAs) in infrastructure WLANs when performing TCP-controlled file downloads. We focus on the energy spent in radio communication when the STAs are in the Continuously Active Mode (CAM), or in the static Power Save Mode (PSM). Our approach is to develop accurate models for obtaining the fractions of times the STA radios spend in idling, receiving and transmitting. We discuss two traffic models for each mode of operation: (i) each STA performs one large file download, and (ii) the STAs perform short file transfers with think times (short duration of inactivity)between two transfers. We evaluate the rate of STA energy expenditure with long file downloads, and show that static PSM is worse than using just CAM. For short file downloads, we compute the number of file downloads that can be completed with a given battery capacity, and show that PSM performs better than CAM for this case. We provide a validation of our analytical models using the NS-2 simulator.
Although the PSM performs better than the CAM when the STAs download short files over TCP with think times, its performance degrades as the number of STAs associated to the access point (AP) increases. To address this problem, we propose an algorithm, which we call opportunistic PSM (OPSM). We show through simulations that OPSM performs better than PSM. The performance gain achieved by OPSM increases as the file size requested by the STAs or the number of STAs associated with the AP increases. We implemented OPSM in NS-2.33, and to compare the performance of OPSM and PSM, we evaluate the number of file downloads that can be completed with a given battery capacity and the average time taken to download a file.
|
14 |
Topics In Performance Modeling Of IEEE 802.11 Wireless Local Area NetworksPanda, Manoj Kumar 03 1900 (has links) (PDF)
This thesis is concerned with analytical modeling of Wireless Local Area Networks (WLANs) that are based on IEEE 802.11 Distributed Coordination Function (DCF). Such networks are popularly known as WiFi networks. We have developed accurate analytical models for the following three network scenarios: (S1) A single cell WLAN with homogeneous nodes and Poisson packet arrivals, (S2) A multi-cell WLAN (a) with saturated nodes, or (b) with TCP-controlled long-lived downloads, and (S3) A multi-cell WLAN with TCP-controlled short-lived downloads. Our analytical models are simple Markovian abstractions that capture the detailed network behavior in the considered scenarios. The insights provided by our analytical models led to two applications: (i) a faster “model-based'” simulator, and (ii) a distributed channel assignment algorithm. We also study the stability of the network through our Markov models.
For scenario (S1), we develop a new approach as compared to the existing literature. We apply a “State Dependent Attempt Rate'” (SDAR) approximation to reduce a single cell WLAN with non-saturated nodes to a coupled queue system. We provide a sufficient condition under which the joint queue length Markov chain is positive recurrent. For the case when the arrival rates into the queues are equal we propose a technique to reduce the state space of the coupled queue system. In addition, when the buffer size of the queues are finite and equal we propose an iterative method to estimate the stationary distribution of the reduced state process. Our iterative method yields accurate predictions for important performance measures, namely, “throughput'”, “collision probability” and “packet delay”. We replace the detailed implementation of the MAC layer in NS-2 with the SDAR contention model, thus yielding a ``model-based'' simulator at the MAC layer. We demonstrate that the SDAR model of contention provides an accurate model for the detailed CSMA/CA protocol in scenario (S1). In addition, since the SDAR model removes much of the details at the MAC layer we obtain speed-ups of 1.55-5.4 depending on the arrival rates and the number of nodes in the single cell WLAN.
For scenario (S2), we consider a restricted network setting where a so-called “Pairwise Binary Dependence” (PBD) condition holds. We develop a first-cut scalable “cell-level” model by applying the PBD condition. Unlike a node- or link-level model, the complexity of our cell-level model increases with the number of cells rather than with the number of nodes/links. We demonstrate the accuracy of our cell-level model via NS-2 simulations. We show that, as the “access intensity” of every cell goes to infinity the aggregate network throughput is maximized. This remarkable property of CSMA, namely, “maximization of aggregate network throughput in a distributed manner” has been proved recently by Durvy et al. (TIT, March, 2009) for an infinite linear chain of nodes. We prove it for multi-cell WLANs with arbitrary cell topology (under the PBD condition). Based on this insight provided by our analytical model we propose a distributed channel assignment algorithm.
For scenario (S3), we consider the same restricted network setting as for scenario (S2). For Poisson flow arrivals and i.i.d. exponentially distributed flow sizes we model a multi-cell WLAN as a network of processor-sharing queues with state-dependent service rates. The state-dependent service rates are obtained by applying the model for scenario (S2) and taking the access intensities to infinity. We demonstrate the accuracy of our model via NS-2 simulations. We also demonstrate the inaccuracy of the service model proposed in the recent work by Bonald et al. (SIGMETRICS 2008) and identify the implicit assumption in their model which leads to this inaccuracy. We call our service model which accurately characterizes the service process in a multi-cell WLAN (under the PBD condition) “DCF scheduling” and study the “stability region” of DCF scheduling for small networks with single or multiple overlapping “contention domains”.
|
15 |
Topics In Modeling, Analysis And Optimisation Of Wireless NetworksRamaiyan, Venkatesh 01 1900 (has links)
The work in this thesis is concerned with two complementary aspects of wireless networks research; performance analysis and resource optimization. The first part of the thesis focusses on the performance analysis of IEEE 802.11(e) wireless local area networks. We study the distributed coordination function (DCF) and the enhanced distributed channel access (EDCA) MAC of the IEEE 802.11(e) standard. We consider n IEEE 802.11(e) DCF (EDCA) nodes operating as a single cell; by single cell, we mean that every packet transmission can be heard by every other node. Packet loss is attributed only to simultaneous transmissions by the nodes (i.e., collisions). Using the well known decoupling approximation [19], we characterize the collision behaviour and the throughput performance of the WLAN with a set of fixed point equations involving the backoff parameters of the nodes. We observe that the fixed point equations can have multiple solutions, and in such cases, the system exhibits multistability and short-term unfairness of throughput. Also, the fixed point analysis fails to characterize the average system behaviour when the system has multiple solutions. We then obtain sufficient conditions (in terms of the backoff parameters of the nodes) under which the fixed point equations have a unique solution. For such cases, using simulations, we observe that the fixed point analysis predicts the long term time average throughput behaviour accurately. Then, using the fixed point analysis, we study throughput differentiation provided by the different backoff parameters, including minimum contention window (CWmin), persistence factor and arbitration interframe space (AIFS) of the IEEE 802.11e standard. Finally, we extend the above results to the case where the receiver supports physical layer capture.
In the second part of the thesis, we study resource allocation and optimization problems for a variety of wireless network scenarios. For a dense wireless network, deployed over a small area and with a network average power constraint, we show that single cell operation (the channel supports only one successful transmission at any time) is throughput efficient in the asymptotic regime (in which the network average power is made large). We show that, for a realistic path loss model and a physical interference model (SINR based), the maximum aggregate bit rate among arbitrary transmitter-receiver pairs scales only as Θ(log(¯P)), where¯P
is the network average power. Spatial reuse is ineffective and direct transmission between source destination pairs is the throughput optimal strategy. Then, operating the network with only a single successful transmission permitted at a time, and with CSMA being used to select the successful transmitter-receiver pair, we consider the situation in which there is stationary spatiotemporal channel fading. We study the optimal hop length (routing strategy) and power control (for a fading channel) that maximizes the network aggregate throughput for a given network power constraint. For a fixed transmission time scheme, we study the throughput maximizing schedule under homogeneous traffic and MAC assumptions. We also characterize the optimal operating point (hop length and power control) in terms of the network power constraint and the channel fade distribution.
It is now well understood that in a multihop network, performance can be enhanced if, instead of just forwarding packets, the network nodes create output packets by judiciously combining their input packets, a strategy that is called “network coding.” For a two link slotted wireless network employing a network coding strategy and with fading channels, we study the optimal power control and optimal exploitation of network coding opportunities that minimizes the average power required to support a given arrival rate. We also study the optimal power-delay tradeoff for the network.
Finally, we study a vehicular network problem, where vehicles are used as relays to transfer data between a pair of stationary source and destination nodes. The source node has a file to transfer to the destination node and we are interested in the delay minimizing schedule for the vehicular network. We characterize the average queueing delay (at the
source node) and the average transit delay of the packets (at the relay vehicles) in terms of the vehicular speeds and their interarrival times, and study the asymptotically optimal tradeoff achievable between them.
|
16 |
Cooperative Communication and QoS in Infrastructure WLANsNischal, S January 2014 (has links) (PDF)
IEEE 802.11 wireless LANs operating in the infrastructure mode are extremely popular and have seen widespread deployment because of their convenience and cost efficiency. A large number of research studies have investigated the performance of DCF, the default MAC protocol in 802.11 WLANs. Previous studies have pointed out several performance problems caused by the interaction of DCF in infrastructure-based WLANs. This thesis addresses a few of these issues.
In the first part of the thesis, we address the issue of head-of-line (HOL) blocking at the Access Point (AP) in infrastructure WLANs. We use a cooperative ARQ scheme to resolve the obstruction at the AP queue. We analytically study the performance of our scheme in a single cell IEEE 802.11 infrastructure WLAN under a TCP controlled file download scenario and validate our analysis by extensive simulations. Both analysis and simulation results show considerable increase in system throughput with the cooperative ARQ scheme. We further examine the delay performance of the ARQ scheme in the presence of both elastic TCP traffic and delay sensitive VoIP traffic. Simulations results show that our scheme decreases the delay in the downlink for VoIP packets significantly while simultaneously providing considerable gains in the TCP download throughput.
Next, we propose a joint uplink/downlink opportunistic scheduling scheme for maximising system throughput in infrastructure WLANs. We first solve the uplink/downlink unfairness that exists in infrastructure WLANs by maintaining a separate queue and a backoff timer at the AP for each mobile station (STA). We also increase the system throughput by making the backoff timer a function of the channel gains. We analyse the I performance of our scheme under symmetric UDP traffic with i. i. d. channel conditions.
Finally, we discuss several opportunistic scheduling policies which aim to increase the system throughput while satisfying certain Quality of Service (QoS) objectives. The standard IEEE 802.11 DCF protocol only offers best-effort services and does not provide any QoS guarantees. Providing QoS in 802.11 networks with time varying channel conditions has proven to be a challenge. We show by simulations that by an appropriate choice of the scheduling metric in our opportunistic scheduling scheme, different QOS objectives like maximizing weighted system sum throughput, minimum rate guarantees and throughput optimality can be attained.
|
Page generated in 0.0489 seconds