Wireless network placement of transmitters, such as base stations for 2G and 3G, access points for WLAN, is a NP-hard problem, since many factors have to be considered, like QoS, coverage, cost, etc. In wireless network placement problem, the goal is to find a set of transmitters which achieves the widest coverage on a given map and spends the minimal cost. In this thesis, we propose a novel variable-length genetic algorithm for solving this problem. Most of existing methods for solving wireless network placement problem, to our best knowledge, users must assign an upper bound or a total number of transmitters for placement. Unlike these existing methods, the proposed algorithm can search the optimal number of transmitters automatically. In addition, the proposed algorithm can find near optimal solutions even in heterogeneous transmitters placement problem, i.e., transmitters with different power radius or cost. The results on several benchmarks are very close to the optimal solutions, which validate the capability of the proposed method in finding the numbers, the types, are the positions of transmitters in heterogeneous wireless network environment.

The aggregate interference distribution in cognitive radio networks is studied in a rigorous and analytical way using the popular Poisson point process model. While a number of results are available for this model for non-cognitive radio networks, cognitive radio networks present extra levels of difficulties for the analysis, mainly due to the exclusion region around the primary receiver, which are typically addressed via various ad-hoc approximations (e.g., based on the interference cumulants) or via the large-deviation analysis. Unlike the previous studies, we do not use here ad-hoc approximations but rather obtain the asymptotic interference distribution in a systematic and rigorous way, which also has a guaranteed level of accuracy at the distribution tail. This is in contrast to the large deviation analysis, which provides only the (exponential) order of scaling but not the outage probability itself. Unlike the cumulant-based analysis, our approach provides a guaranteed level of accuracy at the distribution tail. Additionally, our analysis provides a number of novel insights. In particular, we demonstrate that there is a critical transition point below which the outage probability decays only polynomially but above which it decays super-exponentially. This provides a solid analytical foundation to the earlier empirical observations in the literature and also reveals what are the typical ways outage events occur in different regimes. The analysis is further extended to include interference cancelation and fading (from a broad class of distributions). The outage probability is shown to scale down exponentially in the number of canceled nearest interferers in the below-critical region and does not change significantly in the above-critical one. The proposed asymptotic expressions are shown to be accurate in the non-asymptotic regimes as well.

In this thesis, we characterize the proprietary active scanning algorithm of several wireless network interface cards. Our experiments are the first of its kind to observe the complete scanning process as the wireless network interface cards probe all the channels in the 2.4GHz spectrum. We discuss the: 1) correlation of channel popularity during active scanning and access point channel deployment popularity; 2) number of probe request frames statistics on each channel; 3) channel probe order; and 4) dwell time. The knowledge gained from characterizing wireless network interface cards is important for the following reasons: 1) it helps one understand how active scanning is implemented in different hardware and software; 2) it can be useful in identifying a wireless rogue host; 3) it can help implement Active Scanning in network simulators; and 4) it can radically influence research in the familiar fields like link-layer handovers and effective deployment of access points.

With advances in hardware miniaturization and wireless communication technologies even small portable wireless devices have much communication bandwidth and computing power. These devices include smartphones, tablet computers, and personal digital assistants. Users of these devices expect to run software applications that they usually have on their desktop computers as well as the new applications that are being developed for mobile devices. Web browsing, social networking, gaming, online multimedia playing, global positioning system based navigation, and accessing emails are examples of a few popular applications. Mobile versions of thousands of desktop applications are already available in mobile application markets, and consequently, the expected operational time of smartphones is rising rapidly. At the same time, the complexity of these applications is growing in terms of computation and communication needs, and there is a growing demand for energy in smartphones. However, unlike the exponential growth in computing and communication technologies, in terms of speed and packaging density, battery technology has not kept pace with the rapidly growing energy demand of these devices. Therefore, designers are faced with the need to enhance the battery life of smartphones. Knowledge of how energy is used and lost in the system components of the devices is vital to this end. With this view, we focus on modeling and evaluating the energy performance of smartphones in this thesis. We also propose techniques for enhancing the energy efficiency and functionality of smartphones. The detailed contributions of the thesis are as follows: (i) we present a nite state machine based model to estimate the energy cost of an application running on a smartphone, and provide practical approaches to extract model parameters; (ii) the concept of energy cost pro le is introduced to assess the impact of design decisions on energy cost at an early stage of software design; (iii) a generic architecture is proposed and implemented for enhancing the capabilities of smartphones by sharing resources; (iv) we have analyzed the Internet tra c of smartphones to observe the energy saving potentials, and have studied the implications on the existing energy saving techniques; and nally, (v) we have provided a methodology to select user level test cases for performing energy cost evaluation of applications. All of our concepts and proposed methodology have been validated with extensive measurements on a real test bench. Our work contributes to both theoretical understanding of energy e ciency of software applications and practical methodologies for evaluating energy e ciency. In summary, the results of this work can be used by application developers to make implementation level decisions that affect the energy efficiency of software applications on smartphones. In addition, this work leads to the design and implementation of energy e cient smartphones.

Wireless Networks have been the topic of fundamental research in recent years with the aim of achieving reliable and efficient communications. However, due to their complexity, there are still many aspects of such configurations that remain as open problems. The focus of this thesis is to investigate some throughput limits of wireless networks. The network under consideration consists of $n$ source-destination pairs (links) operating in a single-hop fashion. In Chapters 2 and 3, it is assumed that each link can be active and transmit with a constant power P or remain silent. Also, fading is assumed to be the dominant factor affecting the strength of the channels between transmitter and receiver terminals. The objective is to choose a set of active links such that the throughput is maximized, where the rate of active links are either unconstrained or constrained. For the unconstrained throughput maximization, by deriving an upper bound and a lower bound, it is shown that in the case of Rayleigh fading: (i) the maximum throughput scales like $\log n$, (ii) the maximum throughput is achievable in a distributed fashion. The upper bound is obtained using probabilistic methods, where the key point is to upper bound the throughput of any random set of active links by a chi-squared random variable. To obtain the lower bound, a threshold-based link activation strategy (TBLAS) is proposed and analyzed. The achieved throughput of TBLAS is by a factor of four larger than what was obtained in previous works with centralized methods and with multihop communications. When the active links are constrained to transmit with a constant rate $\lambda$, an upper bound is derived that shows the number of active links scales at most like $\frac{1}{\lambda} \log n$. It is proved that TBLAS \emph{asymptotically almost surely(a.a.s.)} yields a feasible solution for the constrained throughput maximization problem. This solution, which is suboptimal in general, performs close to the upper bound for small values of $\lambda$. To improve the suboptimal solution, a double-threshold-based link activation strategy (DTBLAS) is proposed and analyzed based on some results from random graph theory. It is demonstrated that DTBLAS performs very close to the optimum. Specifically, DTBLAS is a.a.s. optimum when $\lambda$ approaches $\infty$ or $0$. The optimality results are obtained in an interference-limited regime. However, it is shown that, by proper selection of the algorithm parameters, DTBLAS also allows the network to operate in a noise-limited regime in which the transmission rates can be adjusted by the transmission powers. The price for this flexibility is a decrease in the throughput scaling law by a factor of $\log \log n$. In Chapter 4, the problem of throughput maximization by means of power allocation is considered. It is demonstrated that under individual power constraints, in the optimum solution, the power of at least one link should take its maximum value. Then, for the special case of $n=2$ links, it is shown that the optimum power allocation strategy for throughput maximization is such that either both links use their maximum power or one of them uses its maximum power and the other keeps silent.

The capacity of multiuser wireless network, unclear for many years, has always been a hot research topic. Many different operation schemes and coding techniques have been proposed to enlarge the achievable rate region. And omnidirectional relay scheme is one of them. This thesis mainly works on the achievable region of the all-source all-cast network with omnidirectional relay scheme. In order to better understand this problem, we first describe the half-duplex model on the one-dimensional and two-dimensional regular networks. And we present an optimal operation scheme for them to have the maximum achievable rate. For the one-dimensional general network, we proposed an achievable region that indicates valued improvement compared to the previous results. In the full-duplex model of the one-dimensional general network, the maximum achievable rate is presented with a simpler proof in comparison with the previous results. In this thesis, we also show some discussions on more general networks.

The goal of this Master's thesis was to solve resource allocation problems in wireless networks through the implementation of a lightweight simulation platform. The spectrum and power resources of wireless networks have to be efficiently used to accommodate the growing number of wireless terminals and the massive increase of data transferred by their applications. The major problem that needs to be tackled is interference, which significantly limits the performance of wireless systems. In this thesis, the resource allocation of interest was the joint problem of scheduling and power control with Quality of Service (QoS) constraints. The Signal-to-Interference-plus-Noise Ratio (SINR) was used to quantify QoS. This thesis studied the recently proposed mixed-integer linear programming (MILP) formulation of the problem. Due to the scheduling component, the problem is inherently combinatorial and NP-hard, therefore computationally expensive and difficult to solve in tractable time. A simulation platform was implemented in order to automate and facilitate the solving process.As a starting point, wireless channels and channel modeling issues were studied. Then, the platform was implemented to simulate random instances of multi-cellular wireless networks, with several mobile stations per cell, and generate the corresponding channels. Finally, the platform was extended to use the GNU Linear Programming Kit (GLPK) API in order to optimally solve the aforementioned formulated problem for various inputs of generated channels.Tests of the simulation platform were performed to check the consistency of the results. Indeed, the output results satisfied the initial expectations regarding the SINR constraints and the formulation. Moreover, they were produced in reasonable time. An analysis of the output results was presented.This thesis resulted in a configurable and lightweight simulation platform which is able to solve the MILP-formulated resource allocation problem. The simulation platform is basic and does not cover all the aspects of multi-cellular wireless networks and wireless channels. Due to its modularity, it can be extended in a future project.

Wireless Networks have been the topic of fundamental research in recent years with the aim of achieving reliable and efficient communications. However, due to their complexity, there are still many aspects of such configurations that remain as open problems. The focus of this thesis is to investigate some throughput limits of wireless networks. The network under consideration consists of $n$ source-destination pairs (links) operating in a single-hop fashion. In Chapters 2 and 3, it is assumed that each link can be active and transmit with a constant power P or remain silent. Also, fading is assumed to be the dominant factor affecting the strength of the channels between transmitter and receiver terminals. The objective is to choose a set of active links such that the throughput is maximized, where the rate of active links are either unconstrained or constrained. For the unconstrained throughput maximization, by deriving an upper bound and a lower bound, it is shown that in the case of Rayleigh fading: (i) the maximum throughput scales like $\log n$, (ii) the maximum throughput is achievable in a distributed fashion. The upper bound is obtained using probabilistic methods, where the key point is to upper bound the throughput of any random set of active links by a chi-squared random variable. To obtain the lower bound, a threshold-based link activation strategy (TBLAS) is proposed and analyzed. The achieved throughput of TBLAS is by a factor of four larger than what was obtained in previous works with centralized methods and with multihop communications. When the active links are constrained to transmit with a constant rate $\lambda$, an upper bound is derived that shows the number of active links scales at most like $\frac{1}{\lambda} \log n$. It is proved that TBLAS \emph{asymptotically almost surely(a.a.s.)} yields a feasible solution for the constrained throughput maximization problem. This solution, which is suboptimal in general, performs close to the upper bound for small values of $\lambda$. To improve the suboptimal solution, a double-threshold-based link activation strategy (DTBLAS) is proposed and analyzed based on some results from random graph theory. It is demonstrated that DTBLAS performs very close to the optimum. Specifically, DTBLAS is a.a.s. optimum when $\lambda$ approaches $\infty$ or $0$. The optimality results are obtained in an interference-limited regime. However, it is shown that, by proper selection of the algorithm parameters, DTBLAS also allows the network to operate in a noise-limited regime in which the transmission rates can be adjusted by the transmission powers. The price for this flexibility is a decrease in the throughput scaling law by a factor of $\log \log n$. In Chapter 4, the problem of throughput maximization by means of power allocation is considered. It is demonstrated that under individual power constraints, in the optimum solution, the power of at least one link should take its maximum value. Then, for the special case of $n=2$ links, it is shown that the optimum power allocation strategy for throughput maximization is such that either both links use their maximum power or one of them uses its maximum power and the other keeps silent.

In the present day, Ad Hoc wireless networks are quite convenient in a local area. But hidden terminal problems and exposed terminal problems exits in Ad Hoc networks. So how to avoid these problems and add channel bandwidth utilization efficiently in MAC (Medium Access Control) layer is a very critical topic. A number of MAC protocols have been presented to overcome these drawbacks, such as RTS / CTS ¡V based and busy tone ¡V based protocol. In this paper, we proposed a dynamic power control scheme, Adjustable Power Control Protocol (APC). APC is based on the concept of power level with broadcasted message. The basic idea is sender should not interfere with other hosts¡¦ going transmissions. Sender would use a suitable power level to send its data so as to overcome above problems. Our simulations show that the channel utilizations of APC is indeed increased in the same time.

Ad hoc wireless networks are constructed by several mobile hosts and have a property that its topology is changed as mobile hosts moved. There is no stationary infrastructure or based station to coordinate packets transmissions and advertise the information of network topology or something important. The special networks are used in temporal wireless networks, such as battlefield, disease rescue place, and so on. So without any stationary infrastructure supported, mobile hosts can communicate with others immediately or indirectly. Because topology is often changed while mobile hosts moving, mobile hosts must exchange information to deal with the changed conditions. Mobile hosts often utilize broadcasting to exchange information with their neighbor hosts, but there is high bit error ratio in wireless networks, packet corruption occurs frequently, so that mobile host might lost some important information sent from its neighboring host. In 802.11 standard, lack of acknowledgement, broadcasting is an unreliable transmission, because sender host do not know whether all of it neighboring hosts received broadcasting packets correctly or no. Many proposed papers of reliable broadcast assumed that links between mobile hosts are bidirectional links, but bidirectional link is an ideal assumption. In real environment, links are unidirectional, so host A could send packets to host B immediately, but host B could not because of their transmission range are different. In this paper, we propose a new reliable broadcast scheme, Highly Reliable Broadcast Scheme with Directional Antennas (HRBSDA). HRBSDA can reduce the influence of unidirectional links and reach for highly reliable broadcasting. HRBSDA uses directional antennas and concept of Time Division Multiple Access (TDMA)-like. HRBSDA divide DCF Inter-Frame Space (DIFS) into several minislots, and mobile hosts use these minislots to ask sender for retransmission of lost packets. By the way, HRBSDA can not only reach for highly reliable broadcasting, but also reduce Packet Loss Recovery Time, and avoid causing extra overhead. Using directional antennas HRBSDA can reduce collision, so that improving throughput and channel utilization.