This thesis contributes to the study of the planning and optimisation of wireless metropolitan area networks, in particular to the access network design of OFDMAbased systems, where different parameters like base station position, antenna tilt and azimuth need to be configured during the early stages of the network life. A practical view for the solution of this problem is presented by means of the development of a novel design framework and the use of multicriteria optimisation. A further consideration of relaying and cooperative communications in the context of the design of this kind of networks is done, an area little researched. With the emergence of new technologies and services, it is very important to accurately identify the factors that affect the design of the wireless access network and define how to take them into account to achieve optimally performing and cost-efficient networks. The new features and flexibility of OFDMA networks seem particularly suited to the provision of different broadband services to metropolitan areas. However, until now, most existing efforts have been focused on the basic access capability networks. This thesis presents a way to deal with the trade-offs generated during the OFDMA access network design, and presents a service-oriented optimization framework that offers a new perspective for this process with consideration of the technical and economic factors. The introduction of relay stations in wireless metropolitan area networks will bring numerous advantages such as coverage extension and capacity enhancement due to the deployment of new cells and the reduction of distance between transmitter and receiver. However, the network designers will also face new challenges with the use of relay stations, since they involve a new source of interference and a complicated air interface; and this need to be carefully evaluated during the network design process. Contrary to the well known procedure of cellular network design over regular or hexagonal scenarios, the wireless network planning and optimization process aims to deal with the non-uniform characteristics of realistic scenarios, where the existence of hotspots, different channel characteristics for the users, or different service requirements will determine the final design of the wireless network. This thesis is structured in three main blocks covering important gaps in the existing literature in planning (efficient simulation) and optimisation. The formulation and ideas proposed in the former case can still be evaluated over regular scenarios, for the sake of simplicity, while the study of latter case needs to be done over specific scenarios that will be described when appropriate. Nevertheless, comments and conclusions are extrapolated to more general cases throughout this work. After an introduction and a description of the related work, this thesis first focuses on the study of models and algorithms for classical point-to-multipoint networks on Chapter 3, where the optimisation framework is proposed. Based on the framework, this work: - Identifies the technology-specific physical factors that affect most importantly the network system level simulation, planning and optimization process. - It demonstrates how to simplify the problem and translate it into a formal optimization routine with consideration of economic factors. - It provides the network provider, a detailed and clear description of different scenarios during the design process so that the most suitable solution can be found. Existing works on this area do not provide such a comprehensive framework. In Chapter 4: - The impact of the relay configuration on the network planning process is analysed. - A new simple and flexible scheme to integrate multihop communications in the Mobile WiMAX frame structure is proposed and evaluated. - Efficient capacity calculations that allow intensive system level simulations in a multihop environment are introduced. In Chapter 5: - An analysis of the optimisation procedure with the addition of relay stations and the derived higher complexity of the process is done. - A frequency plan procedure not found in the existing literature is proposed, which combines it with the use of the necessary frame fragmentation of in-band relay communications and cooperative procedures. - A novel joint two-step process for network planning and optimisation is proposed. Finally, conclusions and open issues are exposed.

The recent proliferation of sensors in inhospitable environments such as disaster or battle zones has not been matched by in situ data processing capabilities due to a lack of computing infrastructure in the field. We envision a solution based on small, low-altitude unmanned aerial vehicles (UAVs) that can deploy elastically-scalable computing infrastructure anywhere, at any time. This airborne compute cloud—essentially, micro-data centers hosted on UAVs—would communicate with terrestrial assets over a bandwidth-constrained wireless network with variable, unpredictable link qualities. Achieving high performance over this ground-to-air mobile radio channel thus requires making full and efficient use of every single transmission opportunity. To this end, this dissertation presents two system primitives that improve throughput and reduce network overhead by using recent distributed coding methods to exploit natural properties of the airborne environment (i.e., antenna beam diversity and anomaly sparsity). We first built and deployed an UAV wireless networking testbed and used it to characterize the ground-to-UAV wireless channel. Our flight experiments revealed that antenna beam diversity from using multiple SISO radios boosts reception range and aggregate throughput. This observation led us to develop our first primitive: ground-to-UAV bulk data transport. We designed and implemented FlowCode, a reliable link layer for uplink data transport that uses network coding to harness antenna beam diversity gains. Via flight experiments, we show that FlowCode can boost reception range and TCP throughput as much as 4.5-fold. Our second primitive permits low-overhead cloud status monitoring. We designed CloudSense, a network switch that compresses cloud status streams in-network via compressive sensing. CloudSense is particularly useful for anomaly detection tasks requiring global relative comparisons (e.g., MapReduce straggler detection) and can achieve up to 16.3-fold compression as well as early detection of the worst anomalies. Our efforts have also shed light on the close relationship between network coding and compressive sensing. Thus, we offer FlowCode and CloudSense not only as first steps toward the airborne compute cloud, but also as exemplars of two classes of applications—approximation intolerant and tolerant—to which network coding and compressive sensing should be judiciously and selectively applied. / Engineering and Applied Sciences

Localization is a fundamental operation for many wireless networks. While GPS is widely used for location determination, it is unavailable in many environments either due to its high cost or the lack of line of sight to the satellites (e.g., indoors, under the ground, or in a downtown canyon). The limitations of GPS have motivated researchers to develop many localization schemes to infer locations based on measured wireless signals. However, most of these existing schemes focus on localization in static wireless networks. As many wireless networks are mobile (e.g., mobile sensor networks, disaster recovery networks, and vehicular networks), we focus on localization in mobile networks in this thesis. We analyze real mobility traces and find that they exhibit temporal stability and low-rank structure. Motivated by this observation, we develop three novel localization schemes to accurately determine locations in mobile networks: 1. Low Rank based Localization (LRL), which exploits the low-rank structure in mobility. 2. Temporal Stability based Localization (TSL), which leverages the temporal stability. 3. Temporal Stability and Low Rank based Localization (TSLRL), which incorporates both the temporal stability and the low-rank structure. These localization schemes are general and can leverage either mere connectivity (i.e., range-free localization) or distance estimation between neighbors (i.e., range-based localization). Using extensive simulations and testbed experiments, we show that our new schemes significantly outperform state-of-the-art localization schemes under a wide range of scenarios and are robust to measurement errors. / text

The problem of designing scheduling algorithm for multi-channel (e.g., OFDM-based) wireless downlink networks is considered, where the system has a large bandwidth and proportionally large number of users to serve. For this system, while the classical MaxWeight algorithm is known to be throughput-optimal, its buffer-overflow performance is very poor (formally, it is shown that it has zero rate function in our setting). To address this, a class of algorithms called iHLQF (iterated Heaviest matching with Longest Queues First) is proposed. The algorithms in this class are shown to be throughput-optimal for a general class of arrival/channel processes, and also rate-function optimal (i.e., exponentially small buffer overflow probability) for certain arrival/channel processes, where the channel-rates are 0 or 1 packets per timeslot. iHLQF however has higher computational complexity than MaxWeight (n⁴ vs. n² computations per timeslot respectively). To overcome this issue, a new algorithm called SSG (Server-Side Greedy) is proposed. It is shown that SSG is throughput-optimal, results in a much better per-user buffer overflow performance than the MaxWeight algorithm (positive rate function for certain arrival/channel processes), and has a computational complexity (n²) that is comparable to the MaxWeight algorithm. Thus, it provides a nice trade-off between buffer-overflow performance and computational complexity. For multi-rate channel processes, where the channels can serve multiple packets per timeslot, new Markov chain-based coupling arguments are used to derive rate-function positivity results for the SSG algorithm. Finally, an algorithm called DMEQ is proposed and shown to be rate-function optimal for certain multi-rate channel scenarios, whose definition characterizes the sufficient conditions for rate-function optimality in this regime. These results are validated by both analysis and simulations. / text

Opportunistic spectrum reuse is a promising solution to the two main causes of spectrum scarcity: most of the radio frequency (RF) bands are allocated by static licensing, and many of them are underutilized. Frequency spectrum can be more efficiently utilized by allowing communication systems to find out unoccupied spectrum and to use it harmlessly to the licensed users. Reliable sensing of these spectral opportunities is perhaps the most essential element of this technology. Despite significant work on spectrum sensing, further performance improvement is needed to approach its full potential. In this dissertation, wireless spectrum sensing networks (WSSNs) are investigated for reliable detection of the primary (licensed) users, that enables efficient spectrum utilization and minimal power consumption in communications. Reliable spectrum sensing is studied in depth in two parts: a single sensor algorithm and then cooperative sensing are proposed based on a spectral covariance sensing (SCS). The first novel contribution uses different statistical correlations of the received signal and noise in the frequency domain. This detector is analyzed theoretically and verified through realistic simulations using actual digital television signals captured in the US. The proposed SCS detector achieves significant improvement over the existing solutions in terms of sensitivity and also robustness to noise uncertainty. Second, SCS is extended to a distributed WSSN architecture to allow cooperation between 2 or more sensors. Theoretical limits of cooperative white space sensing under correlated shadowing are investigated. We analyze the probability of a false alarm when each node in the WSSN detects the white space using the SCS detection and the base station combines individual results to make the final decision. The detection performance compared with that of the cooperative energy detector is improved and fewer sensor nodes are needed to achieve the same sensitivity. Third, we propose a low power source coding and modulation scheme for power efficient communication between the sensor nodes in WSSN. Complete analysis shows that the proposed scheme not only minimizes total power consumption in the network but also improves bit error rate (BER). / text

Wireless services have become an indispensable part of our social, economic, and everyday activities. They have facilitated and continue to facilitate rapid access to information and have created a highly-interconnected web of users who are untethered to particular locations. In fact, it is expected that in the very near future, the number of users that access the Internet through their mobile devices will surpass those access the Internet from the fixed infrastructure. Aside from mobile Internet access, wireless technologies enable many critical applications such as emergency response, healthcare and implantable medical devices, industrial automation, tactical communications, transportation networks, smart grids, smart homes, navigation, and weather services. The proliferation and wealth of wireless applications has created a soaring demand for ubiquitous broadband wireless access. This demand is further fueled by the richness of the information accessed by users. Low-bit rate voice communications and text have been replaced with graphics, high-definition video, multi-player gaming, and social networking. Meeting the growing traffic demand poses many challenges due to the spectrum scarcity, the cost of deploying additional infrastructure, and the coexistence of several competing technologies. These challenges can be addressed by developing novel wireless technologies, which can efficiently and securely manage multi-user access to the wireless medium. The multi-user access problem deals with the sharing of the wireless resource among contending users in an efficient, secure, and scalable manner. To alleviate contention and interference among the multiple users, contemporary wireless technologies divide the available spectrum to orthogonal frequency bands (channels). The availability of multiple channels has been demonstrated to substantially improve the performance and reliability of wireless networks by alleviating contention and interference. Multi-channel networks, whether cellular, sensor, mesh, cognitive radio, or heterogeneous ones, can potentially achieve higher throughput and lower delay compared to single-channel networks. However, the gains from the existence of orthogonal channels are contingent upon the efficient and secure coordination of channel access. Typically, this coordination is implemented at the medium access control (MAC) layer using a multi-channel MAC (MMAC) protocol. MMAC protocols are significantly more sophisticated than their single-channel counterparts, due to the additional operations of destination discovery, contention management across channels, and load balancing. A significant body of research has been devoted to designing MMAC protocols. The majority of solutions negotiate channel assignment every few packet transmissions on a default control channel. This design has several critical limitations. First, it incurs significant overhead due to the use of in-band or out-of-band control channels. Second, from a security standpoint, operating over a default control channel constitutes a single point of failure. A DoS attack on the control channel(s) would render all channels inoperable. Moreover, MMAC protocols are vulnerable to misbehavior from malicious users who aim at monopolizing the network resources, or degrading the overall network performance. In this dissertation, we improve the security and spectral efficiency of channel access mechanisms in multi-channel wireless networks. In particular, we are concerned with MAC-layer misbehavior in multi-channel wireless networks. We show that selfish users can manipulate MAC-layer protocol parameters to gain an unfair share of network resources, while remaining undetected. We identify possible misbehavior at the MAC-layer, evaluate their impact on network performance, and develop corresponding detection and mitigation schemes that practically eliminate the misbehavior gains. We extend our misbehavior analysis to MAC protocols specifically designed for opportunistic access in cognitive radio networks. Such protocols implement additional tasks such as cooperative spectrum sensing and spectrum management. We then discuss corresponding countermeasures for detecting and mitigating these misbehavior. We further design a low-overhead multi-channel access protocol that enables the distributed coordination of channel access over orthogonal channels for devices using a single transceiver. Compared with prior art, our protocol eliminates inband and out-of-band control signaling, increases spatial channel reuse, and thus achieves significant higher throughput and lowers delay. Furthermore, we investigate DoS attacks launched against the channel access mechanism. We focus on reactive jamming attacks and show that most MMAC protocols are vulnerable to low-effort jamming due to the utilization of a default control channel. We extend our proposed MMAC protocol to combat jamming by implementing cryptographic interleaving at the PHY-layer, random channel switching, and switching according to cryptographically protected channel priority lists. Our results demonstrate that under high load conditions, the new protocol maintains communications despite the jammer's effort. Extensive simulations and experiments are conducted to evaluate the impact of the considered misbehaviors on network performance, and verify the validity of the proposed mechanisms.

Η παρούσα εργασία ασχολείται με τη διερεύνηση των τεχνικών παραμέτρων των δικτύων 4ης γενιάς, των αυτοοργανούμενων ad-hoc δικτύων, και με τα RF μοντέλα εσωτερικού χώρου μικρής αλλά και μεγάλης τοπολογίας. Σκοπός της είναι η κατανόηση βασικών εννοιών ασύρματων δικτύων 4ης γενιάς και η εξοικείωση του αναγνώστη με αυτά. Παράλληλα η παρουσίαση διαφόρων μοντέλων εσωτερικών χώρων τον εισάγει σε θέματα κατανόησης της λειτουργίας του ασύρματου καναλιού και των φαινομένων που το διέπουν. / This work has a subject concerning the technical parameters of a 4th generation network,a self organised ad-hoc network and about RF modelling for small and wide indoor network topologies. It's purpose is the understanding of basic meanings for 4th generation wireless networks and the familarization of the reader with these networks.Alongside the presentation of various indoor models introduces him on understanding the operation of wireless channel and the underlying phenomena.

Η μερική αντικατάσταση των παραδοσιακών ενσύρματων επικοινωνιών από ασύρματες οδήγησε στην ανάγκη για κατάλληλη σχεδίαση των ασύρματων δικτύων, ώστε να υποστηρίζουν τα απαιτούμενα επίπεδα ποιότητας. Η προσφερόμενη ποιότητα περιορίζεται σίγουρα από φυσικά εμπόδια όπως τα όρια που έθεσε ο Shannon, αλλά και από την περιορισμένη γνώση μας στην εκπομπή και διάδοση κυμάτων. Η διαρκής βελτίωση της ικανότητας των ασύρματων δικτύων να προσφέρουν υψηλής ποιότητας υπηρεσίες είναι όμως γεγονός και οφείλεται σε δύο βασικούς ερευνητικούς άξονες, αυτόν που εφευρίσκει νέες μεθόδους επικοινωνίας (διαμόρφωση, κωδικοποίηση, πολυπλεξία, κεραίες κ.α.) και αυτόν που προσπαθεί να βελτιώσει τη διαχείριση των ήδη υπαρχόντων πόρων. Η παρούσα διατριβή προσφέρει επιστημονικές ιδέες και μοντέλα, που έχουν σαν σκοπό την καλύτερη διαχείριση των πόρων. Τα παραδοσιακά αλλά και τα μοντέρνα δίκτυα κινητής τηλεφωνίας έχουν κατακλύσει την αγορά. Η λειτουργία τους όμως, παραμένει να κινείται στα πλαίσια συμβιβασμών, προσφέροντας χαμηλή ποιότητα υπηρεσίας. Η είσοδος των ασύρματων δικτύων υπολογιστών στην αγορά, ως ανταγωνιστές παροχής κλασικών υπηρεσιών (υπηρεσία φωνής και υπηρεσία δεδομένων), δίνει μια ώθηση αναπροσαρμογής των στόχων των δικτύων κινητής τηλεφωνίας. Οι προτεινόμενοι αλγόριθμοι διαχείρισης των δικτύων αυτών προσφέρουν καλύτερη ποιότητα υπηρεσιών με αλλαγή μεμονωμένων μόνο τμημάτων του δικτύου, χωρίς την ασύμφορη ολική επανασχεδίασή του. Αποτελούν δηλαδή πρακτικές λύσεις για την αποδοτικότερη λειτουργία των ήδη εγκατεστημένων δικτύων. Από την άλλη πλευρά, η ανερχόμενη τεχνολογία των ασύρματων δικτύων υπολογιστών βρίσκεται περισσότερο σε ανταγωνισμό με τα κλασικά ενσύρματα δίκτυα υπολογιστών. Το πλεονέκτημα της ελεύθερης κίνησης μετατρέπεται σε δυσβάσταχτο περιορισμό όταν η σύγκριση ποιότητας των δύο δικτύων είναι αναπόφευκτη. Για το λόγο αυτό, υπάρχει η μεγάλη ανάγκη τα ασύρματα δίκτυα να γίνουν ανταγωνιστικά των ενσύρματων και κυρίως να παρέχουν ποιότητα ικανού επιπέδου, ώστε οι διάφορες υπηρεσίες να μπορούν να λειτουργήσουν ανεπηρέαστες από την χρήση του ασύρματου καναλιού. Οι προτεινόμενοι αλγόριθμοι σε αυτόν τον τομέα αποσκοπούν στην βελτίωση της λειτουργίας των ασύρματων δικτύων με τελικό σκοπό την εξασφάλιση επιπέδων ποιότητας. Για την μελέτη των ασύρματων δικτύων κινητής τηλεφωνίας και υπολογιστών και την εξαγωγή συμπερασμάτων απαιτούνται αναλυτικές μέθοδοι περιγραφής και εξομοιώσεις των δικτύων αυτών ώστε να γίνουν και οι κατάλληλες συγκρίσεις της προσφερόμενης ποιότητας. Ο τομέας αυτός της επιστήμης είναι διαρκώς ενεργός καθώς νέες τεχνικές και αναλύσεις προτείνονται συνεχώς. Με στόχο την ανάλυση και την εξομοίωση των προηγούμενα αναφερθέντων αλγορίθμων αναπτύχθηκε ένας αριθμός τεχνικών, που αποτελούν αναπόσπαστο τμήμα της διατριβής αυτής. Στα πλαίσια της διατριβής αυτής και συγκεκριμένα στο τμήμα μελέτης της επίδοσης των δικτύων, προτείνεται η μετατροπή μη γραμμικών αλυσίδων Markov σε γραμμικές, για χρήση σε προβλήματα κίνησης ταυτόχρονων πολλαπλών υπηρεσιών. Η προτεινόμενη μεθοδολογία οδηγεί σε ταχύτατο υπολογισμό της αλυσίδας με τη χρήση μιας προσέγγισης. Παράλληλα, αναλύεται ο χρόνος διαμονής και ο εναπομένων χρόνος διαμονής σε μια κυψέλη. Η ανάλυση γίνεται εκ του μηδενός και με χρήση βασικών στοχαστικών μοντέλων, ενώ το αποτέλεσμα καταλήγει σε κατανομή gamma, κάτι που είχε ήδη παρατηρηθεί από πειράματα στην βιβλιογραφία. Στη συνέχεια κατασκευάζεται ένα ντετερμινιστικό μοντέλο εξομοίωσης που μπορεί να εφαρμοστεί εύκολα μέσω ενός χάρτη σε κάθε πόλη με ορθογώνια δόμηση. Στο τμήμα των δικτύων κινητής τηλεφωνίας προτείνεται ένας αλγόριθμος διαχείρισης και αποδοχής κλήσεων που προκαλεί μεταπομπές συστήματος (system initiated handover). Η χρήση των μεταπομπών αυτών επιφέρει μεταβλητή χωρητικότητα (soft capacity) σε μια ομάδα κυψελών με αποτέλεσμα την αποδοτικότερη διαχείριση πόρων σε περιπτώσεις άνισης κατανομής κίνησης. Ένας άλλος αλγόριθμος προτείνεται για διαρκή διαπραγμάτευση (real-time negotiation) ποιότητας μεταξύ του δικτύου και του χρήστη με αποτέλεσμα την καλύτερη οργάνωση και διαχείριση των πόρων. Αποδεικνύονται η δυνατότητα χρήσης του αλγορίθμου σε πραγματικό χρόνο και τα οφέλη που αποκομίζονται από αυτήν. Στο τμήμα ασύρματων δικτύων υπολογιστών προτείνεται ένα νέο πρωτόκολλο πρόσβασης μέσου, για χρήση στα ασύρματα τοπικά δίκτυα. Το πρωτόκολλο αυτό είναι πλήρως κατανεμημένο (μπορεί να χρησιμοποιηθεί και σε αυτοοργανονούμενα δίκτυα - ad hoc), ενώ προσφέρει τη δυνατότητα παροχής διαφορετικών επιπέδων ποιότητας, από άριστη ποιότητα για κλήσεις πραγματικού χρόνου μέχρι ποιότητα καλύτερης δυνατής προσπάθειας (best effort). Επίσης προτείνονται αλγόριθμοι βελτίωσης των ασύρματων δικτύων αισθητήρων. Αναλύεται συγκεκριμένα ο αυτόματος εντοπισμός κόμβων με χρήση τριγωνισμού και μεταβλητής ισχύος σημάτων-φάρων και η εξοικονόμηση ενέργειας με χρήση συστημάτων πολλαπλών κεραιών (MIMO). / The trend of replacing the traditional wired communications with their wireless counterparts led to the need for better design and organization of wireless networks so as to provide the necessary Quality of Service (QoS) levels. The offered QoS is bounded by Shannon’s limit and from the limitation of human knowledge on the wireless channel matters. However, the constant improvement of network performance is a fact based on two parallel scientific axes, the one that provides new communication techniques (modulation, coding, multiple access, antennas, etc) and the one that handles the already invented methods in an optimized manner. This thesis offers new scientific ideas and models for better resource management of wireless networks. Traditional and modern mobile telephone networks have occupied the market. Nevertheless, their functionality is still based on compromising of offered quality with the needs of a two-way voice application. Wireless computer networks appear in the market as contenders of voice service, acting like a threat to telephone networks. The proposed models for the mobile telephone networks provide solutions for improving overall QoS by altering only minor parts of these already-installed networks. On the other hand, the advancement of the wireless technology gives rise to visions of the so called Broadband Wireless Access. Computer Networks are expected to offer global roaming and provide traditional services over the IP protocol. In this context, QoS is necessary for guaranteeing service levels of quality. The proposed models in this part are focused in offering acceptable quality levels over the wireless channel for these services. The performance analysis of wireless networks requires the use of analytical approaches and simulation of these networks in order to assess the final offered quality. This section of science is constantly developing since new methods and techniques are applied to different parts of research. Through the procedure of analyzing the wireless networks in this thesis, a number of new techniques have been invented which constitute an important part of it. In terms of network traffic description, a new transformation of nonlinear markov chain to linear is proposed. By means of this transformation, the calculation of unbalanced nonuniform traffic can be accelerated. In the section of performance analysis, the sojourn time and the remaining sojourn time are analytically calculated. These cell parameters are found to follow a gamma distribution, a result that is backed from simulations in bibliography. Moreover, a deterministic simulation model is derived to enable easy calculation of these parameters from a map. As regards the mobile telephone networks, a new call admission control scheme is proposed in order to simulate soft capacity functionality in 2G networks. This feature, organizes better the resources in a cluster in cases of inhomogeneous network traffic. Moreover, a QoS negotiation algorithm is proposed for use in 3G networks (e.g. UMTS). Real-time negotiation is proposed for better resource organization and management. The gain from these schemes is calculated and presented. A new Medium Access Control (MAC) protocol is proposed for use in 802.11 Wireless Local Area Networks. This protocol is backward compatible with the protocol 802.11e and offers better quality infrastructure for VoIP services. The proposed protocol is analyzed and simulated and the results are compared to the previously used protocols to showcase the improvements. A new analytical approach with better accuracy is proposed for this reason. Finally, two techniques are proposed for improving the quality of wireless sensor networks. Firstly, a technique for low cost real-time localization with a small number of GPS or other beacons is proposed and tested. Secondly, a means of energy conservatiοn by use of Multiple Input Multiple Output (MIMO) systems is proposed, and then the gain from a QoS scheme is derived.

Στο κεφάλαιο 1 της εργασίας αυτής γίνεται μια εισαγωγή στα ασύρματα δίκτυα με την περιγραφή της δομής του ασύρματου καναλιού. Στο κεφάλαιο 2 δίνονται τα χαρακτηριστικά, η δομή και η λειτουργία του συστήματος UMTS. Επίσης στο συγκεκριμένο κεφάλαιο θα παρουσιαστεί αναλυτικά η αρχιτεκτονική και οι λειτουργικότητες του συγκεκριμένου συστήματος. Στο 3ο κεφάλαιο γίνεται μια παρουσίαση του προτύπου WIMAX που δημιουργήθηκε για να ικανοποιήσει τις απαιτήσεις για ασύρματη πρόσβαση ευρείας ζώνης. Στο κεφάλαιο 4 γίνεται μια εκτενής ανάλυση του HSDPA (High Speed Downlink Packet Access) που βασικός του στόχος είναι η αύξηση των πακέτων δεδομένων στην έξοδο. Στο 5ο κεφάλαιο παρουσιάζονται διεξοδικά οι παρεμβολές και ο θόρυβος που μπορούν να εμφανιστούν κατά τη μετάδοση δεδομένων στα ασύρματα δίκτυα. Τέλος, στο 6ο κεφάλαιο γίνεται μια θεωρητική ανάλυση της παρεμβολής ενδοδιαμόρφωσης, ακολουθεί η πειραματική μελέτη της και καταλήγουμε με συμπεράσματα και σχόλια. / -

Στην παρούσα διδακτορική διατριβή ασχολούμαστε με ζητήματα ελαχιστοποίησης της κατανάλωσης ενέργειας που ανακύπτουν σε ασύρματα δίκτυα. Εξετάζουμε τόσο την περίπτωση ασυρμάτων δικτύων τύπου ad hoc όσο και την περίπτωση όπου υπάρχει ένα σταθερό ενσύρματο δίκτυο το οποίο συνδέει τους σταθμούς εκπομπής, οι οποίοι χρησιμοποιούν ασύρματα μέσα προκειμένου να μεταδώσουν μηνύματα στους χρήστες. Στην πρώτη κατηγορία, μελετούμε τόσο περιπτώσεις όπου η συνάρτηση κόστους στις ακμές είναι συμμετρική, όσο και περιπτώσεις όπου δεν ισχύει αυτή η υπόθεση. Εξετάζουμε επιπλέον προβλήματα που προκύπτουν όταν θεωρούμε ότι οι σταθμοί βρίσκονται σε κάποιον Ευκλείδειο χώρο και η απόσταση εξαρτάται από την Ευκλείδεια απόσταση. Παρουσιάζουμε αποτελέσματα υπολογιστικής δυσκολίας για την εύρεση τόσο της βέλτιστης λύσης όσο και μιας καλής προσεγγιστικής λύσης. Από την άλλη πλευρά, αποδεικνύουμε άνω φράγματα στον λόγο προσέγγισης διάφορων πολυωνυμικών αλγορίθμων. Στην περίπτωση που θεωρούμε πως οι σταθμοί μετάδοσης είναι συνδεδεμένοι με ένα ενσύρματο δίκτυο, έχουμε το πρόβλημα της συσταδοποίησης. Παρουσιάζουμε έναν βέλτιστο πολυωνυμικό αλγόριθμο για την περίπτωση όπου τα σημεία είναι συνευθειακά, ενώ αποδεικνύουμε αποτελέσματα υπολογιστικής δυσκολίας για την περίπτωση των δύο ή περισσοτέρων διαστάσεων. Τέλος, παρουσιάζουμε έναν προσεγγιστικό αλγόριθμο του οποίου ο λόγος προσέγγισης μπορεί να πλησιάσει αυθαίρετα κόντα το 1, με άλλα λόγια παρουσιάζουμε ένα προσεγγιστικό σχήμα πολυωνυμικού χρόνου. / In this dissertation we focus on issues related to energy consumption in wireless networks. We examine both ad hoc wireless networks, where we assume that there is no wired infrastructure, and networks where antennas are wired through a traditional, wired backbone network but they transmit messages to the users using wireless means. In the first case, we consider networks where the distance function can be symmetric or asymmetric; asymmetric edge cost functions can be used to model medium abnormalities or batteries with different energy levels. We prove results concerning the NP-hardness of computing the optimal solution or in some cases even an approximate solution, and also present upper bounds on the approximation ratio of several polynomial time algorithms. In the case where the antennas are connected through a wired backbone network, we consider a clustering problem. We present an optimal polynomial time algorithm for the special case when points are located on a line. We also present NP-hardness results concerning special cases of the problem in the case of 2 or more dimensions. Finally, we conclude with a polynomial time approximation scheme (PTAS).