"We proposed a novel spectrum allocation approach for distributed cognitive radio networks. Cognitive radio systems are capable of sensing the prevailing environmental conditions and automatically adapting its operating parameters in order to enhance system and network performance. Using this technology, our proposed approach optimizes each individual wireless device and its single-hop communication links using the partial operating parameter and environmental information from adjacent devices within the wireless network. Assuming stationary wireless nodes, all wireless communication links employ non-contiguous orthogonal frequency division multiplexing (NC-OFDM) in order to enable dynamic spectrum access (DSA). The proposed approach will attempt to simultaneously minimize the bit error rate, minimize out-of-band (OOB) interference, and maximize overall throughput using a multi-objective fitness function. Without loss in generality, genetic algorithms are employed to perform the actual optimization. Two generic optimization approaches, subcarrier-wise approach and block-wise approach, were proposed to access spectrum. We also proposed and analyzed several approaches implemented via genetic algorithms (GA), such as quantizing variables, using adaptive variable ranges, and Multi-Objective Genetic Algorithms, for increasing the speed and improving the results of combined spectrum utilization/cross-layer optimization approaches proposed, together with several assisting processes and modifications devised to make the optimization to improve efficiency and execution time."

"In this thesis, a transmission frequency rendezvous approach for secondary users deployed in decentralized dynamic spectrum access networks is proposed. Frequency rendezvous is a critical step in bootstrapping a wireless network that does not possess centralized control. Current techniques for enabling frequency rendezvous in decentralized dynamic spectrum access networks either require pre-existing infrastructure or use one of several simplifying assumptions regarding the architecture, such as the use of regularly spaced frequency channels for communications. Our proposed approach is designed to be operated in a strictly decentralized wireless networking environment, where no centralized control is present and the spectrum does not possess pre-defined channels. In our proposed rendezvous algorithm, the most important step is pilot tone detection and receiver query. In order to realize a shortest search time for the target receiver, an efficient scanning rule should be employed. In this thesis, three scanning rules are proposed and evaluated, namely: frequency sequence scanning, pilot tone strength scanning, and cluster scanning. To validate our result, we test our scanning rules with actual paging band spectrum measurements. Previous research on security of network coding focuses on the protection of data dissemination procedures and the detection of malicious activities such as pollusion attacks. The capabilities of network coding to detect other attacks has not been fully explored. In this thesis, a new mechanism based on physical layer network coding to detect wormhole attacks is proposed. When two signal sequences collide at the receiver, the difference between the two received sequences is determined by its distances to the senders. Therefore, by comparing the differences between the received sequences at two nodes, we can estimate the distance between them and detect those fake neighbor connections through wormholes. While the basic idea is clear, we design many schemes at both physical and network layers to turn the idea into a practical approach. Simulations using BPSK modulation at the physical layer show that the wireless nodes can effectively detect fake neighbor connections without the adoption of any special hardware on them."

A primary challenge in wireless networks is to use available resources efficiently so that the Quality of Service (QoS) is satisfied while maximizing the throughput of the network. Among different resource allocation strategies, power and spectrum allocations have long been regarded as efficient tools to mitigate interference and improve the throughput of the network. Also, achieving a low transmission delay is an important QoS requirement in buffer-limited networks, particularly for users with real-time services. For these networks, too much delay results in dropping some packets. Therefore, the main challenge in networks with real-time services is to utilize an efficient power allocation scheme so that the delay is minimized while achieving a high throughput. This dissertation deals with these problems in distributed wireless networks.

A primary challenge in wireless networks is to use available resources efficiently so that the Quality of Service (QoS) is satisfied while maximizing the throughput of the network. Among different resource allocation strategies, power and spectrum allocations have long been regarded as efficient tools to mitigate interference and improve the throughput of the network. Also, achieving a low transmission delay is an important QoS requirement in buffer-limited networks, particularly for users with real-time services. For these networks, too much delay results in dropping some packets. Therefore, the main challenge in networks with real-time services is to utilize an efficient power allocation scheme so that the delay is minimized while achieving a high throughput. This dissertation deals with these problems in distributed wireless networks.

We address several problems that arise in a multihop wireless mesh network. First, we study the problem of joint congestion control, routing and MAC layer scheduling. We formulate the problem as an aggregate utility maximization problem and apply duality theory to decompose the problem into two sub-problems, namely, network layer congestion control and routing problem, and MAC layer scheduling problem. Given the link “prices", the source adjusts its rate based on the cost of the least-cost path to the destination, and sends traffic to the destination along the least-cost path, while link scheduling is carried out based on link prices. Optimal link scheduling for a wireless network is known to be NP-hard. We explore the use of a known centralized greedy heuristic, and develop a distributed algorithm that can schedule independent links based on local information. While the link scheduling algorithm above is for a given set of link prices, the solution to our problem depends on the sequence of price vectors generated by the price update algorithm. This leads us to study convergence issues related to the price update algorithm. Next, we develop a practical protocol which maximizes aggregate utility in a wireless mesh network. We simulate our protocol using Qualnet 4.5 and compare the result with a baseline protocol that uses IEEE 802.11 for link scheduling and AODV for routing. Our proposed protocol requires the durations of slots and subslots to be defined. We develop an approach in which given a single cell wireless mesh network using IEEE 802.11 as a reliable message delivery mechanism, one can find upper and lower bounds on the durations of slots. We employ stochastic ordering to compare distributions of random variables and using some properties of stochastic ordering along with the central limit theorem, we devise a way to compute the above mentioned bounds on the durations. In the second part, we shift our focus to model delays incurred by application packets sent over a WLAN. In this section we model the WLAN as a Random Polling System. The packet arrival process at each node i is assumed to be a stationary and independent increment random process with mean ai and second moment a(2)i . The packet lengths at node i are assumed to be i.i.d random variables Pi with finite mean and second moment. Utilizing available results, we obtain expressions for mean packet delay. Extensive simulations are conducted to verify the analytical results.

Το αντικείμενο της διατριβής αυτής είναι η μελέτη της διαστρωματικής (cross-layer) προσέγγισης ανάπτυξης ασύρματων δικτύων κατανεμημένης λειτουργίας με απαιτήσεις επικοινωνίας πραγματικού χρόνου και περιορισμένους διαθέσιμους πόρους. Επιπλέον βασικό στόχο αποτελεί και η σχεδίαση, πρόταση αντίστοιχης αρχιτεκτονικής η οποία στοχεύει στη βέλτιστη διαχείριση διαθεσίμων δικτυακών πόρων σε καταστάσεις συμφόρησης του δικτύου και κατά συνέπεια στην βελτίωση της απόδοσης αυτού. Μέσα από μελέτες στα πλαίσια της διατριβής αναδεικνύεται η σημασία του φαινομένου συμφόρησης ως κύριου παράγοντα σπατάλης δικτυακών πόρων καθώς και οδήγησης του δικτύου σε κατάσταση κορεσμού με αρνητική επίπτωση σε όλες τις παραμέτρους απόδοσης του δικτύου. Στόχος, λοιπόν, της προτεινόμενης επικοινωνιακής αρχιτεκτονικής είναι η αποφυγή του φαινομένου συμφόρησης έτσι ώστε το δίκτυο να οδηγείται δυναμικά σε ένα σταθερό σημείο απόδοσης (όσο αυτό είναι δυνατό) το οποίο θα επιτρέπει στο δίκτυο να αποδίδει όσο το δυνατόν καλύτερα αποφεύγοντας τη ίδια στιγμή άσκοπη σπατάλη πόρων. Βασική παράμετρος στη σχεδίαση αποτελεί η συμβατότητα τόσο ως προς σημαντικό εύρος διαθέσιμων πρωτοκόλλων σε διάφορα επίπεδα, όσο και ως προς τη δυνατότητα συνύπαρξης κόμβων που ενσωματώνουν την προτεινόμενη αρχιτεκτονική με κόμβους χωρίς αυτήν. Η προτεινόμενη αρχιτεκτονική υλοποιήθηκε στα πλαίσια γνωστού και αξιόπιστου δικτυακού εξομοίωση. Αξιολόγηση της υλοποίησης αυτής μέσα από μεγάλο αριθμό πειραμάτων έδειξε επίτευξη του στόχου καθώς το φαινόμενο της συμφόρησης αντιμετωπίστηκε σε όλες τις περιπτώσεις με σημαντικά οφέλη στην απόδοση του δικτύου και διαχείριση των πόρων. Επιπλέον, λόγω του μεγάλου βαθμού παραμετροποίησης αποτελεί ιδανική βάση για μελλοντικές προεκτάσεις. / This objective of this dissertation is the study of cross-layer approach applied on the development of distributed wireless networks with real-time response demands and scarce available resources. Furthermore, another main goal is the design and proposal of a respective network architecture aiming at optimum resource management under congestion scenarios and therefore maximization of network performance. Through various studies undertaken in the context of this dissertation the importance of the congestion problem is presented as a main factor leading the network to resource waste and saturation conditions negatively affecting all network performance metrics. Consequently, this dissertation aims in proposing a cross-layer architecture able to detect and tackle congestion phenomenon by dynamically retaining network performance at a steady state (as than is possible) where network performs optimally and resource waste in minimized. Among others, a main parameter is retaining compatibility with a wide range of widely used protocols of various layers as well compatibility concerning the coexistence in the same network of stations supporting with stations not supporting the proposed architecture. The proposed architecture is implemented in the context of widely known and used network simulator. Evaluation of this implementation through numerous simulations showed that the objectives are met since congestion phenomenon is tackled in most cases with significant benefits concerning network performance and resource management. Furthermore, due to the high parametrization degree it constitutes a very good base for future expansions.