Wireless Sensor Networks (WSNs) consist of Sensor Nodes (SNs) spatially removed from one another, that can monitor a variety of environmental conditions. SNs then collaboratively communicate the collected information to a central location, by passing along the data in a multi-hop fashion. SN energy resources are limited and energy monitoring and preservation in WSNs are therefore very important. Since multi-hop communication takes place, the routing protocol used may have a significant effect on the balanced use and preservation of energy in the WSN. A significant amount of research has been performed on energy efficient routing in WSNs, but the majority of these studies were only implemented in simulation. The simulation engines used to perform these studies do not take into account all of the relevant environmental factors affecting energy efficiency. In order to comment on the feasibility of a routing protocol meant to improve the energy efficiency of a WSN, it is important to test the routing scheme in a realistic environment. In this study, a SN specifically designed to be used in an energy consumption ascertaining WSN testbed was developed. This SN has a unique set of features which makes it ideal for this application. Each SN is capable of recording its own power consumption. The design also features a lithium battery charging circuit which improves the reusability of the SN. Each node has a detachable sensor module and transceiver module which enables the researcher to conduct experiments using various transceivers and sensors. Twenty of these SNs were then used to form an energy consumption ascertaining WSN testbed. This testbed was used to compare the energy consumption of a Minimum Total Transmission Power Routing (MTTPR) scheme to a shortest hop path routing scheme. The results show that each SN’s transmission power setting dependant efficiency has a significant effect on the overall performance of the MTTPR scheme. The MTTPR scheme might in some cases use more energy than a shortest hop path routing scheme because the transmission power setting dependant efficiency of the transceiver is not taken into account. The MTTPR scheme as well as other similar routing schemes can be improved by taking the transceiver efficiency at different transmission power settings into account. Simulation environments used to evaluate these routing schemes can also be improved by considering the transceiver efficiency at different transmission power settings. / MIng (Computer and Electronic Engineering), North-West University, Potchefstroom Campus, 2014

Wireless Sensor Networks (WSNs) consist of Sensor Nodes (SNs) spatially removed from one another, that can monitor a variety of environmental conditions. SNs then collaboratively communicate the collected information to a central location, by passing along the data in a multi-hop fashion. SN energy resources are limited and energy monitoring and preservation in WSNs are therefore very important. Since multi-hop communication takes place, the routing protocol used may have a significant effect on the balanced use and preservation of energy in the WSN. A significant amount of research has been performed on energy efficient routing in WSNs, but the majority of these studies were only implemented in simulation. The simulation engines used to perform these studies do not take into account all of the relevant environmental factors affecting energy efficiency. In order to comment on the feasibility of a routing protocol meant to improve the energy efficiency of a WSN, it is important to test the routing scheme in a realistic environment. In this study, a SN specifically designed to be used in an energy consumption ascertaining WSN testbed was developed. This SN has a unique set of features which makes it ideal for this application. Each SN is capable of recording its own power consumption. The design also features a lithium battery charging circuit which improves the reusability of the SN. Each node has a detachable sensor module and transceiver module which enables the researcher to conduct experiments using various transceivers and sensors. Twenty of these SNs were then used to form an energy consumption ascertaining WSN testbed. This testbed was used to compare the energy consumption of a Minimum Total Transmission Power Routing (MTTPR) scheme to a shortest hop path routing scheme. The results show that each SN’s transmission power setting dependant efficiency has a significant effect on the overall performance of the MTTPR scheme. The MTTPR scheme might in some cases use more energy than a shortest hop path routing scheme because the transmission power setting dependant efficiency of the transceiver is not taken into account. The MTTPR scheme as well as other similar routing schemes can be improved by taking the transceiver efficiency at different transmission power settings into account. Simulation environments used to evaluate these routing schemes can also be improved by considering the transceiver efficiency at different transmission power settings. / MIng (Computer and Electronic Engineering), North-West University, Potchefstroom Campus, 2014

Three-Dimensional (3D) integration of circuits based on die and wafer stacking using through-silicon-via is a critical technology in enabling "more-than-Moore", i.e. functional integration of devices beyond pure scaling ("more Moore"). In particular, the scaling from multi-core to many-core architecture is an excellent candidate for such integration. 3D systems design follows is a challenging and a complex design process involving integration of heterogeneous technologies. It is also expensive to prototype because the 3D industrial ecosystem is not yet complete and ready for low-cost mass production. Networks-on-Chip (NoCs) efficiently facilitates the communication of massively integrated cores on 3D many-core architecture. In this thesis scalability and performance issues of NoCs are explored in terms of architecture, organization and functionality of many-core systems. First, we evaluate on-chip network performance in massively integrated many-core architecture when network size grows. We propose link and channel models to analyze the network traffic and hence the performance. We develop a NoC simulation framework to evaluate the performance of a deflection routing network as the architecture scales up to 1000 cores. We propose and perform comparative analysis of 3D processor-memory model configurations in scalable many-core architectures. Second, we investigate how the deflection routing NoCs can be designed to maximize the benefit of the fast TSVs through clock pumping techniques. We propose multi-rate models for inter-layer communication. We quantify the performance benefit through cycle-accurate simulations for various configurations of 3D architectures. Finally, the complexity of massively integrated many-core architecture by itself brings a multitude of design challenges such as high-cost of prototyping, increasing complexity of the technology, irregularity of the communication network, and lack of reliable simulation models. We formulate a zero-load average distance model that accurately predicts the performance of deflection routing networks in the absence of data flow by capturing the average distance of a packet with spatial and temporal probability distributions of traffic. The thesis research goals are to explore the design space of vertical integration for many-core applications, and to provide solutions to 3D technology challenges through architectural innovations. We believe the research findings presented in the thesis work contribute in addressing few of the many challenges to the field of combined research in many-core architectural design and 3D integration technology. / <p>QC 20151221</p>

The Quality of Service (QoS) is a profound concept which is gaining increasing attention in the Internet industry. Best-effort applications are now no longer acceptable in certain situations needing high bandwidth provisioning, low loss and streaming of multimedia applications. New emerging multimedia applications are requiring new levels of quality of services beyond those supported by best-effort networks. Quality of service routing is an essential part in any QoS architecture in communication networks. QoS routing aims to select a path among the many possible choices that has sufficient resources to accommodate the QoS requirements. QoS routing can significantly improve the network performance due to its awareness of the network QoS state. Most QoS routing algorithms require maintenance of the global network's state information to make routing decisions. Global state information needs to be periodically exchanged among routers since the efficiency of a routing algorithm depends on link-state information accuracy. However, most QoS routing algorithms suffer from scalability due to the high communication overhead and the high computation effort associated with maintaining accurate link state information and distributing global state information to each node in the network. The ultimate goal of this thesis is to contribute towards enhancing the scalability of QoS routing algorithms. Towards this goal, the thesis is focused on Localised QoS routing algorithms proposed to overcome the problems of using global network state information. Using such an approach, the source node makes routing decisions based on the local state information for each node in the path. Localised QoS routing algorithms avoid the problems associated in the global network state, like high communication and processing overheads. In Localised QoS routing algorithms each source node maintains a predetermined set of candidate paths for each destination and avoids the problems associated with the maintenance of a global network state by using locally collected flow statistics and flow blocking probabilities.

Localised QoS routing is a relatively new, alternative and viable approach to solve the problems of traditional QoS routing algorithms which use global state information resulting in the imposition of a large communication overhead and route flapping. They make use of a localised view of the network QoS state in source nodes to select paths and route flows to destination nodes. Proportional Sticky Routing (PSR) and Credit Based Routing (CBR) have been proposed as localised QoS routing schemes and these can offer comparable performances. However, since network state information for a specific path is only updated when the path is used, PSR and CBR operate with decision criteria that are often stale for paths that are used infrequently. The aim of this thesis is to focus on localised QoS routing and contribute to enhancing the scalability of QoS routing algorithms. In this thesis we have developed three new localised QoS routing schemes which are called Score Based QoS Routing (SBR), Bandwidth Based QoS Routing (BBR) and Delay Based Routing (DBR). In some of these schemes, the path setup procedure is distributed and uses the current network state to make decisions thus avoiding problems of staleness. The methods also avoid any complicated calculations. Both SBR and BBR use bandwidth as the QoS metric and mean delay is used as the QoS metric in DBR. Extensive simulations are applied to compare the performance of our proposed algorithms with CBR and the global Dijkstra's algorithm for different update intervals of link state, different network topologies and using different flow arrival distributions under a wide range of traffic loads. It is demonstrated by simulation that the three proposed algorithms offer a superior performance under comparable conditions to the other localised and global algorithms.

No description available.

A mobile ad hoc network (MANET) is a collection of mobile platforms or nodes that come together to form a network capable of communicating with each other, without the help of a central controller. To avail the maximum potential of a MANET, it is of great importance to devise a routing scheme, which will optimize upon the performance of a MANET, given the high rate of random mobility of the nodes. In a MANET individual nodes perform the routing functions like route discovery, route maintenance and delivery of packets from one node to the other. Existing routing protocols flood the network with broadcasts of route discovery messages, while attempting to establish a route. This characteristic is instrumental in deteriorating the performance of a MANET, as resource overhead triggered by broadcasts is directly proportional to the size of the network. Bounded-dynamic source routing (B-DSR), is proposed to curb this multitude of superfluous broadcasts, thus enabling to reserve valuable resources like bandwidth and battery power. B-DSR establishes a bounded region in the network, only within which, transmissions of route discovery messages are processed and validated for establishing a route. All route discovery messages reaching outside of this bounded region are dropped, thus preventing the network from being flooded. In addition B-DSR also guarantees loop-free routing and is robust for a rapid recovery when routes in the network change.

Mobile Ad-Hoc Network (MANET) facilitates the creation of dynamic reconfigurable networks, without centralized infrastructure. MANET routing protocols have to face high challenges like link instability, node mobility, frequently changing topologies and energy consumption of node, due to these challenges routing becomes one of the core issues in MANETs. This Thesis mainly focuses on the reactive routing protocol such as Ad-Hoc On-Demand Distance Vector (AODV) routing protocol. Reliable and Efficient Reactive Routing Protocol (RERRP) for MANET has been proposed to reduce the link breakages between the moving nodes. This scheme selects a reliable route using Reliability Factor (RF); the RF considers Route Expiration Time and Hop Count to select a routing path with high reliability and have less number of hops. The simulation result shows that RERRP outperforms AODV and enhance the packet delivery fraction (PDF) by around 6% and reduces the network routing load (NRL) by around 30%. Broadcasting in MANET could cause serious redundancy, contention, and collision of the packets. A scheme, Effective Broadcast Control Routing Protocol (EBCRP) has been proposed for the controlling of broadcast storm problem in a MANET. The EBCRP is mainly selects the reliable node while controlling the redundant re-broadcast of the route request packet. The proposed algorithm EBCRP is an on-demand routing protocol, therefore AODV route discovery mechanism was selected as the base of this scheme. The analysis of the performance of EBCRP has revealed that the EBCRP have controlled the routing overhead significantly, reduces it around 70% and enhance the packet delivery by 13% as compared to AODV. An Energy Sensible and Route Stability Based Routing Protocol (ESRSBR) have also been proposed that mainly focuses on increasing the network lifetime with better packet delivery. The ESRSBR supports those nodes to participate in the data transfer that have more residual energy related to their neighbour nodes. The proposed protocol also keeps track of the stability of the links between the nodes. Finally, the ESRSBR selects those routes which consist of nodes that have more residual energy and have stable links. The comparative analysis of ESRSBR with AODV and recently proposed routing protocol called Link Stability and Energy Aware (LSEA) routing protocol revealed that the proposed protocol ESRSBR has a significantly affect the network lifetime, increases it around 10% and 13% as compared to LSEA and AODV protocols respectively. The ESRSBR also decreases the routing overhead by 22% over LSEA and by 38% over AODV.

In this research, we investigate and propose new operators to improve Genetic Algorithm’s performance to solve the multi-stop routing problem. In a multi-stop route, a user starts at point x, visits all destinations exactly once, and then return to the same starting point. In this thesis, we are interested in two types of this problem. The first type is when the distance among destinations is fixed. In this case, it is called static traveling salesman problem. The second type is when the cost among destinations is affected by traffic congestion. Thus, the time among destinations changes during the day. In this case, it is called time-dependent traveling salesman problem. This research proposes new improvements on genetic algorithm to solve each of these two optimization problems. First, the Travelling Salesman Problem (TSP) is one of the most important and attractive combinatorial optimization problems. There are many meta-heuristic algorithms that can solve this problem. In this paper, we use a Genetic Algorithm (GA) to solve it. GA uses different operators: selection, crossover, and mutation. Sequential Constructive Crossover (SCX) and Bidirectional Circular Constructive Crossover (BCSCX) are efficient to solve TSP. Here, we propose a modification to these crossovers. The experimental results show that our proposed adjustment is superior to SCX and BCSCX as well as to other conventional crossovers (e.g. Order Crossover (OX), Cycle Crossover (CX), and Partially Mapped Crossover (PMX)) in term of solution quality and convergence speed. Furthermore, the GA solver, that is improved by applying inexpensive local search operators, can produce solutions that have much better quality within reasonable computational time. Second, the Time-Dependent Traveling Salesman Problem (TDTSP) is an interesting problem and has an impact on real-life applications such as a delivery system. In this problem, time among destinations fluctuates during the day due to traffic, weather, accidents, or other events. Thus, it is important to recommend a tour that can save driver’s time and resources. In this research, we propose a Multi-Population Genetic Algorithm (MGA) where each population has different crossovers. We compare the proposed MG against Single-Population Genetic Algorithm (SGA) in terms of tour time solution quality. Our finding is that MGA outperforms SGA. Our method is tested against real-world traffic data [1] where there are 200 different instances with different numbers of destinations. For all tested instances, MGA is superior on average by at least 10% (for instances with size less than 50) and 20% (for instances of size 50) better tour time solution compared to SGA with OX and SGA with PMX operators, and at least 4% better tour time compared toga with SCX operator.

<p>There is a seemingly endless miniaturization of electronic components, which has enabled designers to build sophisticated computing structureson silicon chips. Consequently, electronic systems are continuously improving with new and more advanced functionalities. Design complexity ofthese Systems on Chip (SoC) is reduced by the use of pre-designed cores. However, several problems related to the interconnection of coresremain. Network on Chip (NoC) is a new SoC design paradigm, which targets the interconnect problems using classical network concepts. Still,SoC cores show large variance in size and functionality, whereas several NoC benefits relate to regularity and homogeneity.</p><p>This thesis studies some network aspects which are characteristic to NoC systems. One is the issue of area wastage in NoC due to cores of varioussizes. We elaborate on using oversized regions in regular mesh NoC and identify several new design possibilities. Adverse effects of regions oncommunication are outlined and evaluated by simulation.</p><p>Deadlock freedom is an important region issue, since it affects both the usability and performance of routing algorithms. The concept of faultyblocks, used in deadlock free fault-tolerant routing algorithms has similarities with rectangular regions. We have improved and adopted one suchalgorithm to provide deadlock free routing in NoC with regions. This work also offers a methodology for designing topology agnostic, deadlockfree, highly adaptive application specific routing algorithms. The methodology exploits information about communication among tasks of anapplication. This is used in the analysis of deadlock freedom, such that fewer deadlock preventing routing restrictions are required.</p><p>A comparative study of the two proposed routing algorithms shows that the application specific algorithm gives significantly higher performance.But, the fault-tolerant algorithm may be preferred for systems requiring support for general communication. Several extensions to our work areproposed, for example in areas such as core mapping and efficient routing algorithms. The region concept can be extended for supporting reuse ofa pre-designed NoC as a component in a larger hierarchical NoC.</p>