A wireless sensor network is designed to monitor events and report this information to a central location, or sink node. The information is required to efficiently travel through the network. It is the job of the routing protocol to officiate this process. With transmissions consuming the majority of the energy available to a sensor node, it becomes important to limit their usage while still maintaining reliable communication with the sink node. The aim of the research covered in this dissertation was to adapt the flat and hierarchical architectures to create a new hybrid that draws on current protocol theories. The designed and developed protocol, Hybrid Energy Efficient Routing (HEER) protocol, builds upon the initial groundwork laid out by the previously developed Simple Energy Efficient Routing (SEER) protocol designed by C.J. Leuschner. Another aspect of the work was to focus on the current lack of credibility that is present in the WSN research community. The validity of SEER was examined and tested and this led to the main focus of this research, ensuring that HEER proves to be valid. The HEER protocol for wireless sensor networks is designed such that it is computationally simple, limits the number of transmissions, employs a cross-layer approach, is reliable, is energy-aware, has limited support for mobile nodes, is energy efficient, and most importantly is credible. Sensor nodes are extremely limited when it comes to their available energy resources. To maximise the node and network lifetimes requires the designed algorithm to be energy aware and as efficient as possible. A cross-layer design approach is followed which allows for the different layers of the OSI model to interact. The HEER protocol limits the number of transmissions that are used for network operation. This is achieved by using a minimal amount of messages for network setup and by selecting the optimal route. Route selection is calculated using hop count, current energy available, energy available on the receiving node, and lastly the energy required to reach the destination node. HEER combines and expands upon the method used by SEER for route selection. Network lifetime for networks of large sizes is increased, mainly due to more efficient routing of messages. The protocol was kept computationally simple and energy efficient, thus maintaining network survivability for as long as possible. / Dissertation (MEng)--University of Pretoria, 2008. / Electrical, Electronic and Computer Engineering / unrestricted

The routing strategy used in today's Internet is best-effort service, where all data packets are treated equally. This type of service is not suited for applications such as video conferencing, and video on demand, that requires the availability of certain resources (such as bandwidth) to be guaranteed for them to function properly. The routing in this context, called Quality-of-Service (QoS) Routing, is the problem of finding suitable paths that meet the application's resource requirements. The majority of proposed QoS routing schemes operate by maintaining the global state of the network, and using this knowledge to compute the QoS route. However, all these schemes suffer from the inherent drawback of scalability, because of the need for each node to collect state information about the complete network. The other type of QoS routing schemes do not maintain network state information, but instead flood the network with QoS connection establishment requests. This type of scheme suffers from excessive message overhead during QoS connection establishment. In this thesis, we present a new QoS routing algorithm that is a combination of the above-mentioned two schemes (i.e., global state and flooding based). The algorithm aims at minimizing the message overhead associated with these two schemes and still maintaining the positive aspects of both of them. The basic idea of the algorithm is: to reach to a destination, the path(s) will always pass through a specific set of intermediate nodes. The algorithm discovers such intermediate nodes (limited by a hop count threshold value needed to reach there). When a QoS connection request arrives at a node, it selects the feasible path leading to the intermediate node for the requested destination. The QoS connection establishment message (or routing message) is forwarded along this path. When the message arrives at the intermediate node, the further path is decided through same logic. To decide the path that leads to the intermediate node, the algorithm maintains the link state related to these intermediate nodes, and link state updates are restricted only with regard to these intermediate nodes. Because of this restriction in link state updation, one has less message overhead, compared to the global state based routing scheme. Further, the algorithm tries to group these intermediate nodes in such a way that the routing message need be sent to only one of the grouped intermediate nodes, and still makes sure that all the possible paths are covered. Therefore, one has a reduced message overhead because of grouping.

La multiplication de l'usage des équipements connectables à un réseau sans fil tels que les smartphones ou les objets connectés peut être mise à profit pour construire des réseaux reposant sur des communications de proximité : les appareils communiquent directement entre eux, sans le support d'une infrastructure centrale. On parle de réseau ad hoc. Ce type de réseau sans infrastructure est exploité dans de nombreux domaines comme le militaire ou la gestion de catastrophes naturelles. Pour certains cas d'utilisation, le passage à l'échelle, c'est-à-dire la capacité à fonctionner avec la croissance de la taille du réseau, est une propriété indispensable. Dans cette thèse, nous nous intéressons à la problématique du routage sous l'aspect du passage à l'échelle. Le routage est la fonction responsable de l'acheminement des données au sein du réseau. Pour cela, des informations de contrôle sont échangées entre les nœuds du réseau. Mais le trafic associé à ces échanges peut être un frein pour passer à l'échelle. Afin de le réduire, nous proposons d'agréger les informations concernant des nœuds géographiquement proches. Dans un premier temps, nous mettons en place une structuration de la zone de déploiement du réseau en régions hiérarchiques. Ces régions servent d'agrégateur de nœuds à travers un adressage de ces derniers selon les régions auxquelles ils appartiennent. Par la suite, nous proposons un protocole de routage combinant les approches topologique et géographique. Il s'agit, pour un nœud donné, de maintenir des routes menant, d’une part, vers d'autres nœuds dans un voisinage proche et, d'autre part, vers des zones géographiques de plus en plus étendues au fur et à mesure de l'éloignement. Cette dernière propriété est obtenue en profitant de la structuration hiérarchique précédente des zones d'agrégation. Les résultats montrent la faculté de notre proposition à monter à grande échelle par rapport aux protocoles de routage ad hoc classique et aussi sa capacité à adresser les problèmes propres aux protocoles de routage purement géographique. / The widespread use of wireless devices such as smartphones and connected objects leads to an increasing emergence of infrastructure-less networks relying on device-to-device communication: ad hoc networks. Applications of this type of network vary widely from military operations to emergency situations. Scalability is a key property for some use cases involving a large number of devices, also called nodes. We mean by scalability, the ability of the network to increase in size without drastic loss of performance and with a cost-effective network maintenance. In this thesis, we focus on the scalability from a routing perspective. Routing handles the delivery of data packets from a source to a destination across the network. This is achieved by the exchange of information between nodes. The corresponding traffic may represent a break for scalability in presence of numerous nodes. In this work, we propose an aggregation of routing information. First, we partition the deployment area into smaller hierachical regions based on geographical coordinates. Nodes are assigned hierachical address depending on the regions they are located in. Then, we propose a mixed topological and geographical-based routing protocol. A node maintains precise routing information to other nodes in close proximity and geographically aggregate information for nodes at greater distances. Regions are the units of nodes aggregation. The further the nodes are, the larger the regions referring to them are. The results show that our proposition outperforms regular ad hoc routing in terms of scalability and addresses more efficiently geographical routing-related issues compared to classical geographical routing.

The number of potential applications for wireless sensor networks is immense. These networks may consist of large numbers of low cost, low power, disposable sensor nodes that can be deployed inside or close to phenomena to be monitored. The nature of these networks necessitates specific design requirements, of which energy efficiency is paramount. The limited available energy of sensor nodes is mainly drained during communication and computational processing. An energy efficient routing protocol can limit the number of message transmissions and the computational complexity of finding routing paths. Many routing protocols have been proposed for wireless sensor networks. Most of them are computationally complex, require a large number of messages to be transmitted or require that sensor nodes possess certain hardware capabilities in order to function. The objective of this dissertation was to develop a Simple Energy Efficient Routing (SEER) protocol for wireless sensor networks that is computationally simple, reduces the number of transmitted messages and does not impose any hardware prerequisites. The new routing protocol, which was developed during this research, uses a flat network structure for scalability and source initiated communication along with event-driven reporting to reduce the number of message transmissions. Computational simplicity is achieved by using a simple method for routing path selection. The SEER protocol selects the next hop for a message by choosing a neighbour that has a smaller or equal hop count to the current node. If multiple neighbours satisfy this requirement, the neighbour with the highest remaining energy is chosen as the next hop. Each node in the network has a table containing the hop count and remaining energy of each of its neighbours. Periodic messages sent through the network update these neighbour tables. SEER uses a novel approach to select the next hop of a message during routing. The protocol increases the lifetime of the network dramatically, compared to other similar routing protocols. This improvement is directly related to the reduction in the number of transmissions made by each node. The simplicity of the protocol reduces the required computational processing compared to other protocols, and at the same time makes this one of the few available protocols that does not impose hardware requirements on nodes in order to function. / Dissertation (MEng (Computer Engineering))--University of Pretoria, 2007. / Electrical, Electronic and Computer Engineering / unrestricted

Recent development has lead to the emergence of distributed Wireless Sensor and Actor Networks (WSAN), which are capable of observing the physical environment, processing the data, making decisions based on the observations and performing appropriate actions. WSANs represent an important extension of Wireless Sensor Networks (WSNs) and may comprise a large number of sensor nodes and a smaller number of actor nodes. The sensor nodes are low-cost, low energy, battery powered devices with restricted sensing, computational and wireless communication capabilities. Actor nodes are resource richer with superior processing capabilities, higher transmission powers and a longer battery life. A basic operational scenario of a typical WSAN application follows the following sequence of events. The physical environment is periodically sensed and evaluated by the sensor nodes. The sensed data is then routed towards an actor node. Upon receiving sensed data, an actor node performs an action upon the physical environment if necessary, i.e. if the occurrence of a disturbance or critical event has been detected. The specific characteristics of sensor and actor nodes combined with some stringent application constraints impose unique requirements for WSANs. The fundamental challenges for WSANs are to achieve low latency, high energy efficiency and high reliability. The latency and energy efficiency requirements are in a trade-off relationship. The communication and coordination inside WSANs is managed via a Communication Protocol Stack (CPS) situated on every node. The requirements of low latency and energy efficiency have to be addressed at every layer of the CPS to ensure overall feasibility of the WSAN. Therefore, careful design of protocol layers in the CPS is crucial in attempting to meet the unique requirements and handle the abovementioned trade-off relationship in WSANs. The traditional CPS, comprising the application, network, medium access control and physical layer, is a layered protocol stack with every layer, a predefined functional entity. However, it has been found that for similar types of networks with similar stringent network requirements, the strictly layered protocol stack approach performs at a sub-optimal level with regards to network efficiency. A modern cross-layer paradigm, which proposes the employment of interactions between layers in the CPS, has recently attracted a lot of attention. The cross-layer approach promotes network efficiency optimization and promises considerable performance gains. It is found that in literature, the adoption of this cross-layer paradigm has not yet been considered for WSANs. In this dissertation, a complete cross-layer enabled WSAN CPS is developed that features the adoption of the cross-layer paradigm towards promoting optimization of the network efficiency. The newly proposed cross-layer enabled CPS entails protocols that incorporate information from other layers into their local decisions. Every protocol layer provides information identified as beneficial to another layer(s) in the CPS via a newly proposed Simple Cross-Layer Framework (SCLF) for WSANs. The proposed complete cross-layer enabled WSAN CPS comprises a Cross-Layer enabled Network-Centric Actuation Control with Data Prioritization (CL-NCAC-DP) application layer (APPL) protocol, a Cross-Layer enabled Cluster-based Hierarchical Energy/Latency-Aware Geographic Routing (CL-CHELAGR) network layer (NETL) protocol and a Cross-Layer enabled Carrier Sense Multiple Access with Minimum Preamble Sampling and Duty Cycle Doubling (CL-CSMA-MPS-DCD) medium access control layer (MACL) protocol. Each of these protocols builds on an existing simple layered protocol that was chosen as a basis for development of the cross-layer enabled protocols. It was found that existing protocols focus primarily on energy efficiency to ensure maximum network lifetime. However, most WSAN applications require latency minimization to be considered with the same importance. The cross-layer paradigm provides means of facilitating the optimization of both latency and energy efficiency. Specifically, a solution to the latency versus energy trade-off is given in this dissertation. The data generated by sensor nodes is prioritised by the APPL and depending on the delay-sensitivity, handled in a specialised manor by every layer of the CPS. Delay-sensitive data packets are handled in order to achieve minimum latency. On the other hand, delay-insensitive non critical data packets are handled in such a way as to achieve the highest energy efficiency. In effect, either latency minimization or energy efficiency receives an elevated precedence according to the type of data that is to be handled. Specifically, the cross-layer enabled APPL protocol provides information pertaining to the delay-sensitivity of sensed data packets to the other layers. Consequently, when a data packet is detected as highly delay-sensitive, the cross-layer enabled NETL protocol changes its approach from energy efficient routing along the maximum residual energy path to routing along the fastest path towards the cluster-head actor node for latency minimizing of the specific packet. This is done by considering information (contained in the SCLF neighbourhood table) from the MACL that entails wakeup schedules and channel utilization at neighbour nodes. Among the added criteria, the next-hop node is primarily chosen based on the shortest time to wakeup. The cross-layer enabled MACL in turn employs a priority queue and a temporary duty cycle doubling feature to enable rapid relaying of delay-sensitive data. Duty cycle doubling is employed whenever a sensor node’s APPL state indicates that it is part of a critical event reporting route. When the APPL protocol state (found in the SCLF information pool) indicates that the node is not part of the critical event reporting route anymore, the MACL reverts back to promoting energy efficiency by disengaging duty cycle doubling and re-employing a combination of a very low duty cycle and preamble sampling. The APPL protocol conversely considers the current queue size of the MACL and temporarily halts the creation of data packets (only if the sensed value is non critical) to prevent a queue overflow and ease congestion at the MACL By simulation it was shown that the cross-layer enabled WSAN CPS consistently outperforms the layered CPS for various network conditions. The average end-to-end latency of delay-sensitive critical data packets is decreased substantially. Furthermore, the average end-to-end latency of delay-insensitive data packets is also decreased. Finally, the energy efficiency performance is decreased by a tolerable insignificant minor margin as expected. The trivial increase in energy consumption is overshadowed by the high margin of increase in latency performance for delay-sensitive critical data packets. The newly proposed cross-layer CPS achieves an immense latency performance increase for WSANs, while maintaining excellent energy efficiency. It has hence been shown that the adoption of the cross-layer paradigm by the WSAN CPS proves hugely beneficial with regards to the network efficiency performance. This increases the feasibility of WSANs and promotes its application in more areas. / Dissertation (MEng)--University of Pretoria, 2009. / Electrical, Electronic and Computer Engineering / unrestricted

Thesis (Ph.D. (Statistics)) -- University of Limpopo, 2017 / Operations Research (OR) is a scientific method for developing quantitatively well-grounded recommendations for decision making. While it is true that it uses a variety of mathematical techniques, OR has a much broader scope. It is in fact a systematic approach to solving problems, which uses one or more analytical tools in the process of analysis. Over the years, OR has evolved through different stages. This study is motivated by new real-world challenges needed for efficiency and innovation in line with the aims and objectives of OR – the science of better, as classified by the OR Society of the United Kingdom. New real-world challenges are encountered on a daily basis from problems arising in the fields of water, energy, agriculture, mining, tourism, IT development, natural phenomena, transport, climate change, economic and other societal requirements. To counter all these challenges, new techniques ought to be developed. The growth of global markets and the resulting increase in competition have highlighted the need for OR techniques to be improved. These developments, among other reasons, are an indication that new techniques are needed to improve the day-to-day running of organisations, regardless of size, type and location. The principal aim of this study is to modify and develop new OR techniques that can be used to solve emerging problems encountered in the areas of linear programming, integer programming, mixed integer programming, network routing and travelling salesman problems. Distribution models, resource allocation models, travelling salesman problem, general linear mixed integer ii programming and other network problems that occur in real life, have been modelled mathematically in this thesis. Most of these models belong to the NP-hard (non-deterministic polynomial) class of difficult problems. In other words, these types of problems cannot be solved in polynomial time (P). No general purpose algorithm for these problems is known. The thesis is divided into two major areas namely: (1) network models and (2) resource allocation and distribution models. Under network models, five new techniques have been developed: the minimum weight algorithm for a non-directed network, maximum reliability route in both non-directed and directed acyclic network, minimum spanning tree with index less than two, routing through 0k0 specified nodes, and a new heuristic to the travelling salesman problem. Under the resource allocation and distribution models section, four new models have been developed, and these are: a unified approach to solve transportation and assignment problems, a transportation branch and bound algorithm for the generalised assignment problem, a new hybrid search method over the extreme points for solving a large-scale LP model with non-negative coefficients, and a heuristic for a mixed integer program using the characteristic equation approach. In most of the nine approaches developed in the thesis, efforts were done to compare the effectiveness of the new approaches to existing techniques. Improvements in the new techniques in solving problems were noted. However, it was difficult to compare some of the new techniques to the existing ones because computational packages of the new techniques need to be developed first. This aspect will be subject matter of future research on developing these techniques further. It was concluded with strong evidence, that development of new OR techniques is a must if we are to encounter the emerging problems faced by the world today. Key words: NP-hard problem, Network models, Reliability, Heuristic, Largescale LP, Characteristic equation, Algorithm.

Philosophiae Doctor - PhD / Wireless sensor networks (WSNs) have become a popular research area that is widely gaining the attraction from both the research and the practitioner communities due to their wide area of applications. These applications include real-time sensing for audio delivery, imaging, video streaming, and remote monitoring with positive impact in many fields such as precision agriculture, ubiquitous healthcare, environment protection, smart cities and many other fields. While WSNs are aimed to constantly handle more intricate functions such as intelligent computation, automatic transmissions, and in-network processing, such capabilities are constrained by their limited processing capability and memory footprint as well as the need for the sensor batteries to be cautiously consumed in order to extend their lifetime. This thesis revisits the issue of the energy efficiency in sensor networks by proposing a novel clustering approach for routing the sensor readings in wireless sensor networks. The main contribution of this dissertation is to 1) propose corrective measures to the traditional energy model adopted in current sensor networks simulations that erroneously discount both the role played by each node, the sensor node capability and fabric and 2) apply these measures to a novel hierarchical routing architecture aiming at maximizing sensor networks lifetime. We propose three energy models for sensor network: a) a service-aware model that account for the specific role played by each node in a sensor network b) a sensor-aware model and c) load-balancing energy model that accounts for the sensor node fabric and its energy footprint. These three models are complemented by a load-balancing model structured to balance energy consumption on the network of cluster heads that forms the backbone for any cluster-based hierarchical sensor network. We present two novel approaches for clustering the nodes of a hierarchical sensor network: a) a distance-aware clustering where nodes are clustered based on their distance and the residual energy and b) a service-aware clustering where the nodes of a sensor network are clustered according to their service offered to the network and their residual energy. These approaches are implemented into a family of routing protocols referred to as EOCIT (Energy Optimization using Clustering Techniques) which combines sensor node energy location and service awareness to achieve good network performance. Finally, building upon the Ant Colony Optimization System (ACS), Multipath Routing protocol based on Ant Colony Optimization approach for Wireless Sensor Networks (MRACO) is proposed as a novel multipath routing protocol that finds energy efficient routing paths for sensor readings dissemination from the cluster heads to the sink/base station of a hierarchical sensor network. Our simulation results reveal the relative efficiency of the newly proposed approaches compared to selected related routing protocols in terms of sensor network lifetime maximization.

This thesis dissertation addresses the problem of providing video streaming services over mobile wireless ad hoc networks. This sort of network represents a hostile environment for this kind of realtime data transmission to the extent that obtaining a good quality of viewer experience is challenging and still under study. Besides the research point of view, providing high-quality multimedia services is decisive for the practical usability and feasibility of wireless ad hoc networks so that service providers can broaden the range of services offered. So far, mobile wireless ad hoc networks have been used to provide network connection among users who could not have connectivity otherwise. However, quality expectations and requirements have been increased notably, fostered by the advent of real-time multimedia applications over mobile devices. Due to the considerable processing and bandwidth constraints underlying these types of devices, coupled with their ability to move freely, it becomes a difficult task to achieve an acceptable quality of service throughout the entire video transmission. Thus, the contribution of this thesis work is twofold. On the one hand, the main problems and limitations that may be encountered and should be faced when deploying real-time services over mobile wireless ad hoc networks are analyzed and discussed. Bandwidth constraints and node mobility are portrayed as the major causes that prevent good quality of service and smooth video playback. On the other hand, following then the aim of improving video streaming quality, this thesis proposes practical solutions that involve diverse routing and cross-layer techniques. One of the proposed approaches focuses on hierarchical routing. Hierarchical arrangement of network nodes may reduce packet interference as well as offer a structured architecture that reduces control traffic overhead. Particularly, the proposed hierarchical routing protocol aims at providing scalability when the number of nodes grows, while maintaining complexity as low as possible. The resulting reduction in packet losses and video playback interruptions finally enhances the quality of received video streams. Furthermore, on the basis that the nodes in an ad hoc network are willing to perform routing tasks, every node could become essential for the proper network operation and routing performance. In tune with this philosophy, a new cross-layer mechanism for recovering lost packets is proposed. By overhearing packets over the wireless shared medium, any node in the surrounding area of the destination endpoint can altruistically retransmit those video packets that have not been correctly received at destination. Moreover, due to the video awareness and frame prioritization algorithm considered in this proposal, it becomes very convenient for real-time video streaming services. The results show that the presented mechanism succeeds in improving video quality and user experience, especially when packet losses are caused due to the mobility of the destination node. / Arce Vila, P. (2014). Hierarchical routing and cross-layer mechanisms for improving video streaming quality of service over mobile wireless ad hoc networks [Tesis doctoral]. Editorial Universitat Politècnica de València. https://doi.org/10.4995/Thesis/10251/36538 / Alfresco

Wireless Sensor Networks (WSN) may consist of hundreds or even thousands of nodes and could be used for a multitude of applications such as warfare intelligence or to monitor the environment. A typical WSN node has a limited and usually irreplaceable power source and the efficient use of the available power is of utmost importance to ensure maximum lifetime of each WSN application. Each of the nodes needs to transmit and communicate sensed data to an aggregation point for use by higher layer systems. Data and message transmission among nodes collectively consume the largest amount of the energy available in a WSN. The network routing protocols ensure that every message reaches the destination and has a direct impact on the amount of transmissions to deliver a messages successfully. To this end the transmission protocol within the WSN should be scalable, adaptable and optimized to consume the least possible amount of energy to suite different network architectures and application domains. This dissertation proposes a Mobile Tolerant Hybrid Energy Efficient Routing Protocol (MT-HEER), where hybrid refers to the inclusion of both flat and hierarchical routing architectures as proposed by Page in the Hybrid Energy Efficient Routing Protocol (HEER). HEER was previously developed at the University of Pretoria and forms the starting point of this research. The inclusion of mobile nodes in the WSN deployment proves to be detrimental to protocol performance in terms of energy efficiency and message delivery. This negative impact is attributable to assuming that all nodes in the network are statically located. In an attempt to adapt to topological changes caused by mobile nodes, too much energy could be consumed by following traditional network failure algorithms. MT-HEER introduces a mechanism to pro-actively track and utilise mobile nodes as part of the routing strategy. The protocol is designed with the following in mind: computational simplicity, reliability of message delivery, energy efficiency and most importantly mobility awareness. Messages are propagated through the network along a single path while performing data aggregation along the same route. MT-HEER relies on at least 40% of the nodes in the network being static to perform dynamic route maintenance in an effort to mitigate the risks of topological changes due to mobile nodes. Simulation results have shown that MT-HEER performs as expected by preserving energy within acceptable limits, while considering the additional energy overhead introduced by dynamic route maintenance. Mobile node tolerance is evident in the protocol's ability to provide a constant successful message delivery ratio at the sink node with the introduction and increase in the number of mobile nodes. MT-HEER succeeds in providing tolerance to mobile nodes within a WSN while operating within acceptable energy conservation limits. AFRIKAANS : Koordlose Sensor Netwerke mag bestaan uit honderde of selfs duisende nodes en kan gebruik word vir 'n legio van toepassings soos oorlogs intellegensie of om die omgewing te monitor. 'n Tipiese node in so 'n netwerk het 'n beperkte en soms onvervangbare energie bron. Die effektiewe gebruik van die beskikbare energie is dus van uiterste belang om te verseker dat die maksimum leeftyd vir 'n koordlose sensor network behaal kan word. Elkeen van die nodes in the network moet die waargeneemde data aanstuur oor die netwerk na 'n versamelings punt vir latere gebruik deur applikasie vlak stelsels. Informasie en boodskap transmissie tussen die nodes is wel een van die aktiwiteite wat die meeste energie verbruik in the netwerk. Die roeterings protokol verseker dat die boodskappe die eindbestemming behaal en het 'n direkte impak op die hoeveelheid transmissies wat kan plaas vind om dit te bewerkstellig. Die roeterings protokol moet dus skaleerbaar, aanpasbaar en verfyn word om die minste moontlike energie te verbruik in verskillende toepassings velde. Hierdie verhandeling stel 'n Bewegings Tolerante Hybriede Netwerk Roeterings Protokol vir Koordlose Sensor Netwerke (“MT-HEER”) voor. In hierdie konteks verwys hybried na die samesmelting van beide plat en hierargiese roeterings beginsels soos voor gestel deur Page in Hybriede Netwerk Roeterings Protokol (“HEER”). HEER was ontwikkel by die Universiteit van Pretoria en vorm die begin punt van hierdie navorsing. Die insluiting van bewegende nodes in 'n Koordlose Sensor Netwerk toon 'n negatiewe tendens in terme van energie effektiwiteit en suksesvolle boodskap aflewerings by die eindbestemming. Die grootste rede vir hierdie negatiewe tendens is die aanname deur gepubliseerde werke dat alle nodes in die netwerk staties is. Te veel energie sal vermors word indien tradisionele fout korregerende meganismes gevolg word om aan te pas by die bewegende nodes. MT-HEER stel 'n meganisme voor om die bewegende nodes te gebruik as deel van die roetering strategie en gevolglik ook hierdie nodes te volg soos hulle beweeg deur die netwerk. Die protokol is ontwikkel met die volgende doelstellings: rekenkundig eenvoudigheid, betroubare boodskap aflewering, energie effektiwiteit en bewustheid van bewegende nodes. Boodskappe word langs 'n enkele pad gestuur deur die netwerk terwyl boodskap samevoeging bewerkstellig word om die eind bestemming te bereik. MT-HEER vereis wel dat ten minste 40% van die netwerk nodes staties bly om die dienamiese roeterings instandhouding te bewerkstellig. Simulasie toetse en resultate het bewys dat MT-HEER optree soos verwag in gevalle waar daar bewegende nodes deel uit maak van die netwerk. Energie bewaring is binne verwagte parameters terwyl die addisionele energie verbruik binne rekening gebring word om te sorg vir bewegende nodes. Die protokol se toleransie teen bewegende nodes word ten toon gestel deur die vermoë van die protokol om konstant 'n hoë suksesvolle bookskap aflewerings verhouding te handhaaf. MT-HEER behaal die uitgesette doel om 'n toleransie teen bewegende nodes beskikbaar te stel, terwyl die protokol steeds funksioneer binne verwagte energie besparings limiete. Copyright / Dissertation (MEng)--University of Pretoria, 2010. / Electrical, Electronic and Computer Engineering / unrestricted