In this work, we consider the channel assignment problem in single radio multi-channel mobile ad-hoc networks. Specifically, we investigate the granularity of channel assignment decisions that gives the best trade-off in terms of performance and complexity. We present a new granularity for channel assignment that we refer to as component level channel assignment. The strategy is relatively simple, and is characterized by several impressive practical advantages. We also show that the theoretical performance of the component based channel assignment strategy does not lag significantly behind the optimal possible performance, and perhaps more importantly we show that when coupled with its several practical advantages, it significantly outperforms other strategies under most network conditions.

We consider several related problems arising in geometric graphs. In particular, we investigate the computational complexity and approximability properties of several optimization problems in unit ball graphs and develop algorithms to find exact and approximate solutions. In addition, we establish complexity-based theoretical justifications for several greedy heuristics. Unit ball graphs, which are defined in the three dimensional Euclidian space, have several application areas such as computational geometry, facility location and, particularly, wireless communication networks. Efficient operation of wireless networks involves several decision problems that can be reduced to well known optimization problems in graph theory. For instance, the notion of a \virtual backbone" in a wire- less network is strongly related to a minimum connected dominating set in its graph theoretic representation. Motivated by the vastness of application areas, we study several problems including maximum independent set, minimum vertex coloring, minimum clique partition, max-cut and min-bisection. Although these problems have been widely studied in the context of unit disk graphs, which are the two dimensional version of unit ball graphs, there is no established result on the complexity and approximation status for some of them in unit ball graphs. Furthermore, unit ball graphs can provide a better representation of real networks since the nodes are deployed in the three dimensional space. We prove complexity results and propose solution procedures for several problems using geometrical properties of these graphs. We outline a matching-based branch and bound solution procedure for the maximum k-clique problem in unit disk graphs and demonstrate its effectiveness through computational tests. We propose using minimum bottleneck connected dominating set problem in order to determine the optimal transmission range of a wireless network that will ensure a certain size of "virtual backbone". We prove that this problem is NP-hard in general graphs but solvable in polynomial time in unit disk and unit ball graphs. We also demonstrate work on theoretical foundations for simple greedy heuristics. Particularly, similar to the notion of "best" approximation algorithms with respect to their approximation ratios, we prove that several simple greedy heuristics are "best" in the sense that it is NP-hard to recognize the gap between the greedy solution and the optimal solution. We show results for several well known problems such as maximum clique, maximum independent set, minimum vertex coloring and discuss extensions of these results to a more general class of problems. In addition, we propose a "worst-out" heuristic based on edge contractions for the max-cut problem and provide analytical and experimental comparisons with a well known "best-in" approach and its modified versions.

The emerging widespread use of real-time multimedia applications over wireless networks makes the support of Quality of Service (QoS) a key problem. In this paper, we focus on QoS support mechanisms for IEEE 802.11 Wireless ad-hoc networks. First, we review the IEEE 802.11 standard and other enhanced MAC schemes that have been proposed to support QoS for 802.11 ad hoc networks. Then we propose a new priority MAC scheme which uses the different initial contention window instead of CWmin in IEEE 802.11 MAC to reduce the collision rate, then reduces the average delay and increases the throughput.

This work studies application acceleration for wireless and mobile data networks. The problem of accelerating application can be addressed along multiple dimensions. The first dimension is advanced network protocol design, i.e., optimizing underlying network protocols, particulary transport layer protocol and link layer protocol. Despite advanced network protocol design, in this work we observe that certain application behaviors can fundamentally limit the performance achievable when operating over wireless and mobile data networks. The performance difference is caused by the complex application behaviors of these non-FTP applications. Explicitly dealing with application behaviors can improve application performance for new environments. Along this overcoming application behavior dimension, we accelerate applications by studying specific types of applications including Client-server, Peer-to-peer and Location-based applications. In exploring along this dimension, we identify a set of application behaviors that significantly affect application performance. To accommodate these application behaviors, we firstly extract general design principles that can apply to any applications whenever possible. These design principles can also be integrated into new application designs. We also consider specific applications by applying these design principles and build prototypes to demonstrate the effectiveness of the solutions. In the context of application acceleration, even though all the challenges belong to the two aforementioned dimensions of advanced network protocol design and overcoming application behavior are addressed, application performance can still be limited by the underlying network capability, particularly physical bandwidth. In this work, we study the possibility of speeding up data delivery by eliminating traffic redundancy present in application traffics. Specifically, we first study the traffic redundancy along multiple dimensions using traces obtained from multiple real wireless network deployments. Based on the insights obtained from the analysis, we propose Wireless Memory (WM), a two-ended AP-client solution to effectively exploit traffic redundancy in wireless and mobile environments. Application acceleration can be achieved along two other dimensions: network provision ing and quality of service (QoS). Network provisioning allocates network resources such as physical bandwidth or wireless spectrum, while QoS provides different priority to different applications, users, or data flows. These two dimensions have their respective limitations in the context of application acceleration. In this work, we focus on the two dimensions of overcoming application behavior and Eliminating traffic redundancy to improve application performance. The contribution of this work is as follows. First, we study the problem of application acceleration for wireless and mobile data networks, and we characterize the dimensions along which to address the problem. Second, we identify that application behaviors can significantly affect application performance, and we propose a set of design principles to deal with the behaviors. We also build prototypes to conduct system research. Third, we consider traffic redundancy elimination and propose a wireless memory approach.

Multi-hop wireless transmission, where radios forward the message of other radios, is becoming popular both in cellular as well as sensor networks. This research is concerned with the statistical modeling of multi-hop wireless networks that do cooperative transmission (CT). CT is a physical layer wireless communication scheme in which spatially separated wireless nodes collaborate to form a virtual array antenna for the purpose of increased reliability. The dissertation has two major parts. The first part addresses a special form of CT known as the Opportunistic Large Array (OLA). The second part addresses the signal-to-noise ratio (SNR) estimation for the purpose of recruiting nodes for CT. In an OLA transmission, the nodes from one level transmit the message signal concurrently without any coordination with each other, thereby producing transmit diversity. The receiving layer of nodes receives the message signal and repeats the process using the decode-and-forward cooperative protocol. The key contribution of this research is to model the transmissions that hop from one layer of nodes to another under the effects of channel variations, carrier frequency offsets, and path loss. It has been shown for a one-dimensional network that the successive transmission process can be modeled as a quasi-stationary Markov chain in discrete time. By studying various properties of the Markov chain, the system parameters, for instance, the transmit power of relays and distance between them can be optimized. This optimization is used to improve the performance of the system in terms of maximum throughput, range extensions, and minimum delays while delivering the data to the destination node using the multi-hop wireless communication system. A major problem for network sustainability, especially in battery-assisted networks, is that the batteries are drained pretty quickly during the operation of the network. However, in dense sensor networks, this problem can be alleviated by using a subset of nodes which take part in CT, thereby saving the network energy. SNR is an important parameter in determining which nodes to participate in CT. The more distant nodes from the source having least SNR are most suitable to transmit the message to next level. However, practical real-time SNR estimators are required to do this job. Therefore, another key contribution of this research is the design of optimal SNR estimators for synchronized as well as non-synchronized receivers, which can work with both the symbol-by-symbol Rayleigh fading channels as well as slow flat fading channels in a wireless medium.

<p>After more than two decades’ development, modern mobile cellular networks now have almost approached to the commercial level of fourth generation communication networks. For each of the mobile solutions, there are special attributes but also similarities compared to the other competitive solutions. We can also find relationships between the old generation solutions and the inheritors or innovations.</p><p>During the communicating session using any kind of existing mobile handset, the handover procedure is a very important one that may effect connection quality and also the phone call continuity. Nowadays, the mobile cellular networks have a trend to interact with LAN networks. They will co-exist and work together to support higher data rate over a wider coverage. Seamless handover proposals like Unlicensed Mobile Access (UMA) can support the heterogeneous handover between Global System for Mobile Communications (GSM) and Wireless (Wi-Fi) Network. Several Media Independent Handover (MIH) proposals can handle the vertical handover in the hybrid mobile data network environment such like between wireless local area network (WLAN) and Universal Mobile Telecommunications System (UMTS) by different solutions.</p>

<p>Internet Service Providers (ISP) har på senare år etablerat ett ökat antal Wi-Fi Hotspots på publika platser för att erbjuda Internettjänster så som e-post, Web och andra Internet-baserade program, till resande användare. Exempel på dessa platser är flygplatser, skolor, parker och städer. Växjö universitet har valt att bygga etttrådlöst nätverk på campus som man ska påbörja under sommaren 2005. Uppsatsen tar upp detta som fallstudie för diskussion av ämnet.</p> / <p>Lately Internet Service Providers (ISP) have established an increased amount of Wi-Fi Hotspots at public places to offer Internet based services like e-mail, web surfing etc to roaming users. Example of places like this are airports, schools, parks and cities. Växjö University has decided to implement a wireless network covering the university campus. This project is planned to start during summer of 2005. This project is the unicase for discussion in this bachelor thesis</p>

<p>As portable computers and wireless networks are becoming ubiquitous, it is natural to consider the user’s position as yet another aspect to take into account when providing services that are tailored to meet the needs of the consumers. Location aware systems could guide persons through buildings, to a particular bookshelf in a library or assist in a vast variety of other applications that can benefit from knowing the user’s position.</p><p>In indoor positioning systems, the most commonly used method for determining the location is to collect samples of the strength of the received signal from each base station that is audible at the client’s position and then pass the signal strength data on to a positioning server that has been previously fed with example signal strength data from a set of reference points where the position is known. From this set of reference points, the positioning server can interpolate the client’s current location by comparing the signal strength data it has collected with the signal strength data associated with every reference point.</p><p>Our work proposes the use of multiple successive received signal strength samples in order to capture periodic signal strength variations that are the result of effects such as multi-path propagation, reflections and other types of radio interference. We believe that, by capturing these variations, it is possible to more easily identify a particular point; this is due to the fact that the signal strength fluctuations should be rather constant at every position, since they are the result of for example reflections on the fixed surfaces of the building’s interior.</p><p>For the purpose of investigating our assumptions, we conducted measurements at a site at Växjö university, where we collected signal strength samples at known points. With the data collected, we performed two different experiments: one with a neural network and one where the k-nearest-neighbor method was used for position approximation. For each of the methods, we performed the same set of tests with single signal strength samples and with multiple successive signal strength samples, to evaluate their respective performances.</p><p>We concluded that the k-nearest-neighbor method does not seem to benefit from multiple successive signal strength samples, at least not in our setup, compared to when using single signal strength samples. However, the neural network performed about 17% better when multiple successive signal strength samples were used.</p>

Community Wireless Networks (CWNs) are a fairly new phenomenon. One of the first projects, NYC Wireless, started in 2001. These wireless initiatives are often a response to the lack of high-speed ubiquitous computing. Many of the first users, frustrated neighborhood “techies,” jerry rigged low cost WiFi antennas to rooftops and the side of buildings in order to access a high-speed broadband service. By doing this the wireless pioneers shared high speed wireless signals with neighbors and anyone within reach of their signal. As wireless computing became more popular, and it’s social and economic benefits more obvious, CWNs became an attractive alternative for many rural and low-income urban communities. Populations that had been overlooked by large cable and telephone service companies. The success of CWNs has paved the way for municipalities to build publicly supported wireless projects. Cable and telephone companies, major providers of broadband service, view municipal networks as unfair competition, and thus began the legislative battle over municipal wireless networks. The battle continues to wage. Cable and telephone companies have had some success at the state level and the federal debate is underway at this moment. Therefore, the purpose of this report is to understand the role Austin’s nonprofits play to ensure that high speed broadband access is made available for everyone and how lessons learned in Austin can be applied to other cities and locations around the country. The study found that Austin, compared to other cities of the same size, has a very small nonprofit community to addresses the issue of universal broadband access. Although the group is small, networking and mingling between community service organizations, the city government and wireless projects has created a community that effectively addresses the issue of high-speed access to the Internet. / text

Αντικείμενο αυτής της διπλωματικής εργασίας είναι η διερεύνηση των τεχνικών διαφορισμού στους ψηφιακούς δέκτες των σύγχρονων ασύρματων δικτύων. / Purpose of this paper is the examination of combining techniques at digital receivers of modern wireless networks.