Το ζήτημα της κατανάλωσης ενέργειας σε ασύρματα ad hoc δίκτυα αποτελεί ένα ερευνητικό πεδίο το οποίο έχει λάβει ιδιαίτερη προσοχή τα τελευταία χρόνια. Οι σταθμοί σε ένα ασύρματο ad hoc δίκτυο λειτουργούν επί το πλείστον με μπαταρίες με αποτέλεσμα η εξοικονόμηση ενέργειας στο δίκτυο να αποτελεί πρώτιστο στόχο για την βιωσιμότητα των σταθμών του δικτύου και την αξιόπιστη παραλαβή των πακέτων δεδομένων από τους παραλήπτες τους. Μέχρι σήμερα, έχουν αναπτυχθεί διάφορα ενεργό-αποδοτικά πρωτόκολλα τα οποία μπορούν να υιοθετηθούν σε ένα ασύρματο ad hoc δίκτυo. Τα πρωτόκολλα αυτά λειτουργούν σε διαφορετικό επίπεδο το καθένα (ελέγχου πρόσβασης στο μέσο, δικτύου, υψηλότερα). Η παρούσα εργασία συντάχθηκε με σκοπό την μελέτη αυτών των ενεργό-αποδοτικών πρωτοκόλλων που μπορούν να υιοθετηθούν σε ασύρματα ad hoc δίκτυα, την καταγραφή των ιδιαίτερων χαρακτηριστικών κάθε πρωτοκόλλου καθώς και την ανάπτυξη ενός νέου πρωτοκόλλου ελέγχου της ισχύος μετάδοσης σε ασύρματα ad hoc δίκτυα με κύριο στόχο την περαιτέρω μείωση της κατανάλωσης ενέργειας στο δίκτυο με παράλληλη αύξηση του throughput του δικτύου. Συγκεκριμένα, στην παρούσα μελέτη, αναλύονται και παρουσιάζονται τα ακόλουθα ζητήματα. Στο Κεφάλαιο 1 παρουσιάζονται οι στόχοι της παρούσας εργασίας καθώς και η συνεισφορά της στο ζήτημα της κατανάλωσης ενέργειας στα ασύρματα ad hoc δίκτυα. Στο Κεφάλαιο 2 αρχικά πραγματοποιείται μία εισαγωγή στην αρχιτεκτονική των ασυρμάτων ad hoc δικτύων και ακολούθως παρουσιάζονται οι διάφορες κατηγορίες των ασυρμάτων ad hoc δικτύων, δίνοντας ιδιαίτερη έμφαση στην 802.11 τεχνολογία και πρωτόκολλα. Στο Κεφάλαιο 3 παρουσιάζονται υπάρχοντα ενεργό-αποδοτικά πρωτόκολλα τα οποία μπορούν να χρησιμοποιηθούν σε ασύρματα ad hoc δίκτυα. Τα πρωτόκολλα αυτά παρουσιάζονται ταξινομημένα ανάλογα με το επίπεδο στο οποίο το καθένα λειτουργεί (επίπεδο ελέγχου πρόσβασης στο μέσο, επίπεδο δικτύου, υψηλότερα επίπεδα). Στο Κεφάλαιο 4 περιγράφεται το προτεινόμενο MAC πρωτόκολλο ελέγχου της ισχύος μετάδοσης το οποίο μπορεί να χρησιμοποιηθεί σε ασύρματα ad hoc δίκτυα. Παρουσιάζεται η λειτουργία του πρωτοκόλλου, περιγράφοντας το χαρακτηριστικό της αργής εκκίνησης που το προτεινόμενο πρωτόκολλο υιοθετεί για την μετάδοση των RTS πλαισίων, καθώς και τον CTS μηχανισμό που χρησιμοποιείται. Στο τέλος του κεφαλαίου, πραγματοποιείται μια σύγκριση της λειτουργίας του προτεινόμενου ενεργό-αποδοτικού πρωτοκόλλου με υπάρχοντα πρωτόκολλα MAC επιπέδου που παρουσιάστηκαν στο Κεφάλαιο 3. Στο Κεφάλαιο 5 πραγματοποιείται αξιολόγηση της απόδοσης του προτεινόμενου πρωτοκόλλου. Η αξιολόγηση της απόδοσης του προτεινόμενου πρωτοκόλλου πραγματοποιείται μέσω της εκτέλεσης πειραμάτων με την βοήθεια του εξομοιωτή δικτύων network simulator 2. Η αξιολόγηση του προτεινόμενου πρωτοκόλλου πραγματοποιείται ως προς διάφορες παραμέτρους – κατανάλωση ενέργειας στο δίκτυο, διασπορά της καταναλόμενης ενέργειας, μέση καθυστέρηση παραλαβής των πακέτων, throughput του δικτύου, πλήθος συγκρούσεων RTS πλαισίων, λόγος ληφθέντων προς απεσταλμένα πακέτα – έχοντας ως βάση το πρόβλημα της εκκένωσης των πακέτων στο δίκτυο και για την περίπτωση δύο διαφορετικών προσεγγίσεων. Μία στην οποία κάθε σταθμός χρησιμοποιεί στατική ισχύ για τις μεταδόσεις του και μία στην οποία κάθε σταθμός ρυθμίζει την ισχύ μετάδοσής του στην ελάχιστη απαιτούμενη τιμή για την ορθή παραλαβή των πακέτων από τους παραλήπτες τους. Τέλος στο Κεφάλαιο 6 παρουσιάζονται τα συμπεράσματα που προκύπτουν από την παρούσα εργασία καθώς και διάφορα ανοιχτά ζητήματα προς περαιτέρω έρευνα. / Power consumption at wireless ad hoc networks has received last years much attention. Mobile stations in a wireless ad hoc network operate in the most cases with batteries, so power conservation at the network is a major objective for the viability of the mobile stations of the network and the reliable delivery of packets to their destinations. Till today, various power-aware protocols have been developed for wireless ad hoc networks. Each one of these protocols operates at different layer (medium access control, network, higher layers). The main objectives of this study are the review of the power-aware protocols that can be used at wireless ad hoc networks, the detection of the special characteristics of each protocol, and the development of a new power control MAC-layer protocol for wireless ad hoc networks. The main objective of this new protocol is the farther reduction of the power consumption in the network, with parallel increment at network throughput. More specifically speaking, in this study, the following points are represented and analyzed: in Chapter 1 the various objectives of this study are represented as the contribution of the study in point of power consumption at wireless ad hoc networks. In Chapter 2, initially an introduction at the architecture of wireless ad hoc networks is performed, while afterwards the various categories of wireless ad hoc networks are represented, by emphasizing the 802.11 technology and protocols. In Chapter 3 various energy-aware protocols for wireless ad hoc networks are represented. These protocols are represented categorized by the layer at which every one operates (medium access control layer, network layer and higher layers). In Chapter 4 the proposed power control MAC protocol for mobile ad hoc networks is represented. The operation of the protocol is represented, by describing the slow start mechanism used for RTS frames transmissions, and the CTS mechanism used. At the end of Chapter 4, a comparison between the operation of the proposed power-aware protocol and previous MAC-layer power aware protocols is performed. In Chapter 5, the performance evaluation of the proposed protocol is performed. The performance evaluation of the proposed protocol was done via execution of experiments with network simulator 2. The performance parameters that were measured are: the power consumption in the network, the variance of the consumed energy, the average delay for packets delivery, the network throughput, the number of RTS frames collisions and the received-to-sent packets ratio. The performance of the proposed protocol was evaluated in the setting of the evacuation problem and for two different approaches. One in which every node uses static power for its transmissions and one in which every node adjusts its transmission power at the minimum required value for coherent reception of the packets from the recipients. Finally in Chapter 6 are represented the results that are derived from this study and various open issues for further investigation.

Hop count, i.e., the number of wireless hops a packet has to go through to reach the destination, is a fundamental metric in multi-hop wireless ad-hoc networks. Network performance, such as throughput, end-to-end delay, energy consumption, and so on, depends critically on hop count. Previous work on modeling hop count is limited in making unrealistic simplifying assumptions either at the physical or network, or both layers of the communication protocol stack. A key contribution of this thesis is to present an analytical model to derive the probability distribution of hop count under realistic assumptions at both physical and network layers. Specifically, the model considers a log-normal shadowing radio propagation capable of accommodating the random signal fading observed in most wireless communication environments, and the widely used geographic routing at the network layer. Validation of the model is achieved by a comprehensive set of simulation experiments including a trace driven simulation of a real-word vehicular ad-hoc network. The model reveals that the presence of randomness in radio propagation reduces the required number of hops to reach a given destination significantly. To demonstrate the utility of the proposed hop count model, the thesis proposes three new applications which address some of the key challenges in multi-hop wireless networks. The first application derives the per-node packet forwarding load in multi-hop wireless sensor networks and reveals that the nodes in the vicinity of the base station has a significantly less forwarding load than previously thought under simplifying radio propagation and routing assumptions. The second application demonstrates that using hop count as a measure of distance traveled by a data packet, geocasting can be achieved in multi-hop wireless networks in situations when some of the network nodes do not have access to reliable location information. Finally, the proposed hop count model is used to evaluate the performance of the third application which demonstrates that the overhead of geographic routing can be reduced significantly by embracing a position update philosophy which adapts to the mobility and communication patterns of the underlying ad-hoc network.

Hop count, i.e., the number of wireless hops a packet has to go through to reach the destination, is a fundamental metric in multi-hop wireless ad-hoc networks. Network performance, such as throughput, end-to-end delay, energy consumption, and so on, depends critically on hop count. Previous work on modeling hop count is limited in making unrealistic simplifying assumptions either at the physical or network, or both layers of the communication protocol stack. A key contribution of this thesis is to present an analytical model to derive the probability distribution of hop count under realistic assumptions at both physical and network layers. Specifically, the model considers a log-normal shadowing radio propagation capable of accommodating the random signal fading observed in most wireless communication environments, and the widely used geographic routing at the network layer. Validation of the model is achieved by a comprehensive set of simulation experiments including a trace driven simulation of a real-word vehicular ad-hoc network. The model reveals that the presence of randomness in radio propagation reduces the required number of hops to reach a given destination significantly. To demonstrate the utility of the proposed hop count model, the thesis proposes three new applications which address some of the key challenges in multi-hop wireless networks. The first application derives the per-node packet forwarding load in multi-hop wireless sensor networks and reveals that the nodes in the vicinity of the base station has a significantly less forwarding load than previously thought under simplifying radio propagation and routing assumptions. The second application demonstrates that using hop count as a measure of distance traveled by a data packet, geocasting can be achieved in multi-hop wireless networks in situations when some of the network nodes do not have access to reliable location information. Finally, the proposed hop count model is used to evaluate the performance of the third application which demonstrates that the overhead of geographic routing can be reduced significantly by embracing a position update philosophy which adapts to the mobility and communication patterns of the underlying ad-hoc network.

Performance and security are two critical functions of wireless ad-hoc networks (WANETs). Network security ensures the integrity, availability, and performance of WANETs. It helps to prevent critical service interruptions and increases economic productivity by keeping networks functioning properly. Since there is no centralized network management in WANETs, these networks are susceptible to packet drop attacks. In selective drop attack, the neighboring nodes are not loyal in forwarding the messages to the next node. It is critical to identify the illegitimate node, which overloads the host node and isolating them from the network is also a complicated task. In this paper, we present a resistive to selective drop attack (RSDA) scheme to provide effective security against selective drop attack. A lightweight RSDA protocol is proposed for detecting malicious nodes in the network under a particular drop attack. The RSDA protocol can be integrated with the many existing routing protocols for WANETs such as AODV and DSR. It accomplishes reliability in routing by disabling the link with the highest weight and authenticate the nodes using the elliptic curve digital signature algorithm. In the proposed methodology, the packet drop rate, jitter, and routing overhead at a different pause time are reduced to 9%, 0.11%, and 45%, respectively. The packet drop rate at varying mobility speed in the presence of one gray hole and two gray hole nodes are obtained as 13% and 14% in RSDA scheme.

<p>A cognitive radio network is a multi-user system, in which different radio units compete for limited resources in an opportunistic manner, interacting with each other for access to the available resources. The fact that both users and spectrum holes (i.e., under-utilized spectrum sub-bands) can come and go in a stochastic manner, makes a cognitive radio network a highly non- stationary, dynamic and challenging wireless environment. Finding robust decentralized resource-allocation algorithms, which are capable of achieving reasonably good solutions fast enough in order to guarantee an acceptable level of performance, is crucial in such an environment. In this thesis, a novel dynamic spectrum management (DSM) scheme for cognitive radio networks, termed the self-organizing dynamic spectrum management (SO-DSM), is described and its practical validity is demonstrated using computer simulations. In this scheme, CRs try to exploit the primary networks’ unused bands and establish link with neighbouring CRs using those bands. Inspired by human brain, the CRs extract and memorize primary network’s and other CRs’ activity patterns and create temporal channel assignments on sub-bands with no recent primary user activities using self-organizing maps (SOM) technique. The proposed scheme is decentralized and employs a simple learning rule with low complexity and minimal memory requirements. A software testbed was developed to simulate and study the proposed scheme. This testbed is capable of simulating CR network alongside of a cellular legacy network. In addition to SO-DSM, two other DSM schemes, namely centralized DSM and no-learning decentralized DSM, can be used for CR networks in this software testbed. The software testbed was deployed on parallel high capacity computing clusters from Sharcnet to perform large scale simulations of CR network. The simulation results show, comparing to centralized DSM and minority game DSM (MG-DSM), the SO-DSM decreases the probability of collision with primary users and also probability of CR link interruption significantly with a moderate decrease in CR network spectrum utilization.</p> / Doctor of Philosophy (PhD)

Despite recent advances in wireless local area network (WLAN) technologies, today's WLANs still cannot offer the same data rates as their wired counterparts. The throughput problem is further aggravated in multi-hop wireless environments due to collisions and interference caused by multi-hop routing. Because all current IEEE 802.11 physical (PHY) standards divide the available frequency into several orthogonal channels, which can be used simultaneously within a neighborhood, increasing capacity by exploiting multiple channels becomes particularly appealing. To improve the capacity of wireless ad hoc networks by exploiting multiple available channels, I propose three principles that facilitate the design of efficient distributed channel assignment protocols. Distributed channel assignment problems have been proven to be <i>NP</i>-complete and, thus, computationally intractable. Though being a subject of many years of research, distributed channel assignment remains a challenging problem. There exist only a few heuristic solutions, none of which is efficient, especially for the mobile ad hoc environment. However, protocols that implement the proposed design principles are shown to require fewer channels and exhibit significantly lower communication, computation, and storage complexity, compared with existing approaches. As examples, I present two such protocols that build on standard reactive and proactive routing protocols. In addition, I prove the correctness of the algorithms and derive an upper bound on the number of channels required to both resolve collisions and mitigate interference. A new multi-channel medium access control (MC-MAC) protocol is also proposed for multi-hop wireless ad hoc networks. MC-MAC is compatible with the IEEE 802.11 medium access control (MAC) standard and imposes the minimum system requirements among all existing multi-channel MAC protocols. In addition, simulation results show that even with only a single half-duplex transceiver, MC-MAC, by exploiting multiple channels, can offer up to a factor of four improvement in throughput over the IEEE 802.11 MAC protocol. The reduction in delay is even more significant. Therefore, the MC-MAC protocol and the accompanying distributed channel assignment protocols constitute an effective solution to the aforementioned performance problem in a multi-hop wireless network. Finally, I generalize the cross-layer design principle to more general networking functions and present a network architecture to motivate and facilitate cross-layer designs in wireless networks. A literature survey is provided to validate the proposed cross-layer design architecture. Current cross-layer design research can be categorized into two classes: joint-layer design using optimization techniques, and adaptive techniques based on system-profile and/or QoS requirements. Joint-layer design based on optimization techniques can achieve optimal performance, but at the expense of complexity. Adaptive schemes may achieve relatively good performance with less complexity. Nevertheless, without careful design and a holistic view of the network architecture, adaptive schemes may actually cause more damage than benefit. / Ph. D.

As developments in wireless ad hoc networks continue, there is an increasing expectation with regard to supporting content-rich multimedia communications (e.g., video) in such networks, in addition to simple data communications. The recent advances in multiple description (MD) video coding have made it highly suitable for multimedia applications in such networks. In this thesis, we study three important problems regarding multiple description video communications in wireless ad hoc networks. They are multipath routing for MD video, MD video multicast, and joint routing and server selection for MD video in wireless ad hoc networks. In multipath routing for MD video problem, we follow an applicationcentric cross-layer approach and formulate an optimal routing problem that minimizes the application layer video distortion. We show that the optimization problem has a highly complex objective function and an exact analytic solution is not obtainable. However, we find that a metaheuristic approach such as Genetic Algorithms (GAs) is eminently effective in addressing this type of complex cross-layer optimization problems. We provide a detailed solution procedure for the GA-based approach, as well as a tight lower bound for video distortion. We use numerical results to compare this approach to several other approaches and demonstrate its superior performance. In MD video multicast problem, we take the similar application-centric, cross-layer approach as in the multipath routing problem. We propose an MD video multicast scheme where multiple source trees are used. Furthermore, each video description is coded into multiple layers in order to cope with diversity in wireless link bandwidths. Based on this multicast model, we formulate the multicast routing as a combinatorial optimization problem and apply Genetic Algorithm (GA)-based metaheuristic procedure to solove this problem. Performance comparisons with existing approaches show significant gains for a wide range of network operating conditions. In the last problem, we study the important problem of joint routing and server selection for MD video in ad hoc networks. We formulate the task as a combinatorial optimization problem and present tight lower and upper bounds for the achievable distortion. The upper bound also provides a feasible solution to the formulated problem. Our extensive numerical results show that the bounds are very close to each other for all the cases studied, indicating the near-global optimality of the derived upper bounding solution. Moreover, we observe significant gains in video quality achieved by the proposed approach over existing server selection schemes. This justifies the importance of jointly considering routing and server selection for optimal MD video streaming in wireless ad hoc networks. / Master of Science

Network coding is a technique used to increase the capacity of a network by combining messages sent over the network. The combined messages could be separated by using sufficient original messages which were used to combine the messages. Network coding can be implemented in different layers of the 051 stack, but to date a complete comparison between different implementations of network coding has not been done. The goal of this dissertation is to implement a wireless node model with network coding in the MAC layer and evaluate the performance characteristics of reference networks that implement the new node model. This will serve as the first step of a greater goal, namely finding the most favourable position in the 051 stack to implement network coding. The characteristics of the different implementations of network coding are presented in this dissertation. Simulations were done in OPNET® to find further attributes concerning the implementation of network coding in the MAC layer. The simulation process used is presented and explained, and the results from the simulations are analysed. Network coding in the simulations was implemented opportunistically. The results show that the more often different nodes send frames to the coding node, the better network coding performs. The work contributes to finding the best layer for implementing network coding for its increased throughput. A benchmark network was created so that network coding could be implemented in all the layers of the 051 stack, and then be compared to each other. An implementation of network coding in the MAC layer was simulated and analyzed. We conclude that, because there are so many different purposes for which networks are used, a single instance of network coding is unlikely to be similarly beneficial to all purposes. There still remains work to find the most favourable position for network coding in the 051 stack for all the different types of network coding. / Thesis (M. Ing. (Computer and Electronical Engineering))--North-West University, Potchefstroom Campus, 2011

Timeliness in delivering packets for delay-sensitive applications is an important QoS (Quality of Service) measure in many systems, notably those that need to provide real-time performance. In such systems, if delay-sensitive traffic is delivered to the destination beyond the deadline, then the packets will be rendered useless and dropped after received at the destination. Bandwidth that is already scarce and shared between network nodes is wasted in relaying these expired packets. This thesis proposes that a deterministic per-hop delay can be achieved by using a dynamic queue threshold concept to bound delay of each node. A deterministic per-hop delay is a key component in guaranteeing a deterministic end-to-end delay. The research aims to develop a generic approach that can constrain network delay of delay-sensitive traffic in a dynamic network. Two adaptive queue management schemes, namely, DTH (Dynamic THreshold) and ADTH (Adaptive DTH) are proposed to realize the claim. Both DTH and ADTH use the dynamic threshold concept to constrain queuing delay so that bounded average queuing delay can be achieved for the former and bounded maximum nodal delay can be achieved for the latter. DTH is an analytical approach, which uses queuing theory with superposition of N MMBP-2 (Markov Modulated Bernoulli Process) arrival processes to obtain a mapping relationship between average queuing delay and an appropriate queuing threshold, for queue management. While ADTH is an measurement-based algorithmic approach that can respond to the time-varying link quality and network dynamics in wireless ad hoc networks to constrain network delay. It manages a queue based on system performance measurements and feedback of error measured against a target delay requirement. Numerical analysis and Matlab simulation have been carried out for DTH for the purposes of validation and performance analysis. While ADTH has been evaluated in NS-2 simulation and implemented in a multi-hop wireless ad hoc network testbed for performance analysis. Results show that DTH and ADTH can constrain network delay based on the specified delay requirements, with higher packet loss as a trade-off.

In this thesis, research is described which leads to the proposal of a link-directionality-based dual channel MAC (Medium Access Control) protocol (DCP) for carrier sense wireless ad hoc networks. It attempts to double the capacities of such networks using an industrial standard (the single-channel IEEE 802.11 protocol) as a benchmark. Simulations show that the proposed scheme can increase the capacities to more than 1.7 times of the single-channel IEEE 802.11 protocol in large-scale random network topologies. The algorithm, however, requires extra radio spectrum resource which could be costly. In addition to DCP, a signal-to-interference ratio comparison algorithm (SCA) is proposed to further release the protocol constraints imposed by the virtual carrier-sensing mechanism. Interestingly, while the capacity of the pure DCP decreases when link lengths are short, the capacity of the pure SCA increases when link lengths are short. The two algorithms compensate for the downside of each other to bring about a more uniform capacity improvement. Simulations show that the integrated scheme can further increase the network throughputs to more than 2.13 times in random topologies. This thesis also clarifies inter-link interference in wireless ad-hoc networks by using link-directional interference graphs (l-graph). By colouring the l-graphs, independent data streams obtained by Multi-Carrier Code Division Multiple Access (MC-CDMA) are assigned for transmitting up-link and down-link traffic separately in order to eliminate the hidden-node and exposed-node problems in wireless local area networks (WLAN). Finally, a generic approach for capacity analysis is proposed to show that the concept of link-directionality can also be adopted with other network models, protocols and parameter settings. However, in certain scenarios where links are densely packed together, the advantage of using link-directionality could be diminished. Therefore, the proposed generic approach for capacity analysis allows one to determine whether channel allocations according to link-directionalities should be applied to a given network.