To see the other types of publications on this topic, follow the link: Wireless sensor networks routing protocol.
Dissertations / Theses on the topic 'Wireless sensor networks routing protocol'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 50 dissertations / theses for your research on the topic 'Wireless sensor networks routing protocol.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.
1
Yang, Ying. "Routing protocols for wireless sensor networks: A survey." Thesis, Mittuniversitetet, Institutionen för informationsteknologi och medier, 2013. http://urn.kb.se/resolve?urn=urn:nbn:se:miun:diva-19700.
Full textAbstract:
Wireless sensor networks(WSNs) are different to traditional networks and are highly dependent on applications, thus traditional routing protocols cannot be applied efficiently to the networks. As the variability of both the application and the network architecture, the majority of the attention, therefore, has been given to the routing protocols. This work surveys and evaluates state-of-the-art routing protocols based on many factors including energy efficiency, delay andcomplexity, and presents several classifications for the various approaches pursued. Additionally, more attention is paid to several routing protocols and their advantages and disadvantages and, indeed, this work implements two of selected protocols, LEACH and THVRG, on the OPNET, and compares them in many aspects based on a large amount of experimental data. The survey also provides a valuable framework for comparing new and existing routing protocols. According to the evaluation for the performance of the routing protocols, this thesis provides assistance in relation to further improving the performance in relation to routing protocols. Finally, future research strategies and trends in relation to routing technology in wireless sensor networks are also provided.
2
Alfares, Mohammed S. I. "Novel hierarchical routing protocol in Wireless Sensor Networks." Thesis, University of Surrey, 2010. http://epubs.surrey.ac.uk/843288/.
Full textAbstract:
The Wireless Sensor Network (WSN) is one of the major research areas in computer network field today. It is considered as one of ten emerging technologies that will bring far- reaching impacts on the future of humanity lives. In addition, the importance is due to numerous applications that can benefit from the WSN. As a new challenging research field, WSNs are now undergoing intensive research to overcome complexity and constraints. Such constraints include limitation of processors perfomance, memory capacity, power source, and communication bandwidth, in addition to, mobility, network density, and data aggregation issues. According to the mentioned constrains, existing routing protocols cannot be efficiently deployed in WSN directly. The Wireless Sensor Network consists of small, limited resources, inexpensive (low cost), mobile or stationary, and heterogeneous devices deployed automatically at large numbers in areas of interest. The devices dynamically form a network to deliver requested sensed data to the base station (BS) and overcome any arising difficulties without human intervention. This thesis presents a novel hierarchical routing protocol named Self Organizing and Network Survivability (SONS) to provide network fault-tolerance and QoS in the presence of network mobility (mobility of both base station and sensor nodes) applied to the forest fire application. A survey of state of the art WSN routing protocols is presented with focus on network lifetime, reliability, and Quality of Service (QoS). A description of forest fire monitoring is presented as an application scenario. The proposed protocol can operate in heterogeneous networks (in terms of sensed data) and to provide quality of service in terms of packets End-to-End Delay (EED). Simulation studies are performed using open source Object Modular Network Testbed in C++ (OMNeT++) and results are produced. Analysis of the simulation results revealed the superiority of the proposed protocol over existing ones in terms of fault-tolerance, network lifetime, QoS, and scalability, In addition, these results confirm the suitability of SONS routing protocol to the fire forest monitoring application. Analyses of the main features of the proposed algorithm were also carried out. Finally conclusions are presented to draw the future work map. Key words: Wireless Sensor Network, Routing Protocol, Hierarchical, QoS, Fault-tolerance, Redundancy, Survivability, Heterogeneous, scalability.
3
Page, Jonathan Grant. "Energy efficient hybrid routing protocol for wireless sensor networks." Pretoria : [s.n.], 2007. http://upetd.up.ac.za/thesis/available/etd-09042008-130625/.
Full text
4
Krol, Michal. "Routin in wireless sensor networks." Thesis, Université Grenoble Alpes (ComUE), 2016. http://www.theses.fr/2016GREAM004/document.
Full textAbstract:
Le paradigme d’Internet des objets (IoT) envisage d’élargir Internet actuelle avec un grand nombre de dispositifs intelligents. Réseaux de Capteurs sans Fil (WSN) déploie les dispositifs fonctionnant sur des approvisionnements énergétiques maigres et mesurant de phénomènes environnementaux (comme la température, la radioactivité, ou CO 2). Des applications populaires de WSN comprennent la surveillance, le télémétrie, et la prévention des catastrophes naturelles. Des défis majeurs de WSN sont comment permettre à l’efficacité énergétique, surmonter les déficiences de support sans fil, et d’opérer dans à la manière auto-organisée. L’intégration de WSN dans IoT se posera sur des standards ouvertes efforçant d’offrir évolutivité et de fiabilité dans une variété de scénarios et conditions de fonctionnement. Néanmoins, l’état actuel des standards a les problèmes d’interopérabilité et peuvent bénéficier de certaines améliorations. Les contributions de la thèse sont :Nous avons effectué une étude approfondie des filtres de Bloom et de leur utilisation dans le stockage de caractéristiques de nœud dans l’adresse IP. Différentes techniques de compression et de variantes de filtres nous ont permisde développer un système efficace qui comble l’écart entre le routage de caractéristiques et l’approche classique compatible avec les réseaux IPv6.Nous proposons Featurecast, un protocole de routage / service de nommage pourWSN. Il permet d’interroger les réseaux de capteurs en utilisant un ensemble de caractéristiques tout raccord en entête de paquet IPv6. Nous intégrons notre protocole dans RPL et introduisons une nouvelle mesure, qui augmentent l’efficacité de routage. Nous vérifions sa performance contre dans des simulations approfondies et des test sur des capteurs réels dans un bancd’essai à grande échelle. Simulations approfondies démontrent les avantagesde notre protocole en termes d’utilisation de la mémoire, le surcharge de con-trôle, le taux de livraison de paquets et la consommation d’énergie.Nous introduisons WEAVE - un protocole de routage pour les réseaux avec géolo-calisation. Notre solution n’utilise pas de message de contrôle et apprend sesvoies seulement en observant le trafic. Plusieurs mécanismes sont introduitspour garder un en-tête de taille fixe, contourner à la fois les petits commeles grands obstacles et fournir une communication efficace entre les nœuds.Nous avons effectué des simulations à grande échelle impliquant plus de 19000noeuds et des expériences avec des capteurs réels sur banc d’essai IoT-lab.Nos résultats montrent que nous atteignons bien meilleures performances enparticulier dans les réseaux grands et dynamiques sans introduire de surcharge<br>Internet of Things (IoT) paradigm envisages to expand the current Internet witha huge number of intelligent communicating devices. Wireless Sensor Networks(WSN) deploy the devices running on meagre energy supplies and measuring environmental phenomena (like temperature, radioactivity, or CO 2 ). WSN popularapplications include monitoring, telemetry, and natural disaster prevention. Major WSN challenges are energy efficiency, overcome impairments of wireless medium, and operate in the self-organisation. The WSN integrating IoT will rely on a set of the open standards striving to offer scalability and reliability in a variety of the operating scenarios and conditions. Nevertheless, the current state of the standards have interoperability issues and can benefit from further improvements. The contributions of the thesis work are:We performed an extensive study of Bloom Filters and their use in storing nodetext-based elements in IP address. Different techniques of compression andvariants of filters allowed us to develop an efficient system closing the gapbetween feature-routing and classic approach compatible with IPv6 networks.We propose Featurecast, a routing protocol/naming service for WSN. It allowsto query sensor networks using a set of characteristics while fitting in anIPv6 packet header. We integrate our protocol in RPL and introduce a newmetric, which increase the routing efficiency. We check its performance inboth extensive simulations and experimentations on real sensors in a large-scale Senslab testbed. Large-scale simulations demonstrate the advantagesof our protocol in terms of memory usage, control overhead, packet deliveryrate and energy consumption.We introduce WEAVE - a routing protocol for networks with geolocation. Our so-lution does not use any control message and learn its paths only by observingthe traffic. Several mechanisms are introduce to keep a fixed-size header andbypass both small as well as large obstacles and provide an efficient communication between nodes. We performed simulations on large scale involvingmore than 19000 nodes and real-sensor experimentations on IoT-lab testbed. Our results show that we achieve much better performance especially in large and dynamic networks without introducing any control overhead
5
Cui, Qin. "TDMA-based Routing Protocol in Industrial Wireless Sensor Networks." Thesis, Mittuniversitetet, Avdelningen för informations- och kommunikationssystem, 2013. http://urn.kb.se/resolve?urn=urn:nbn:se:miun:diva-19748.
Full text
6
Lydon, Sean Michael. "General Direction Routing Protocol." DigitalCommons@CalPoly, 2009. https://digitalcommons.calpoly.edu/theses/97.
Full textAbstract:
The General Direction Routing Protocol (GDRP) is a Wireless Sensor Network (WSN)
multi-path routing protocol which abstracts localization information (commonly GPS
coordinates) into relative direction information in order to perform routing decisions. By
generating relative direction information GDRP is able to operate with fewer precision
requirements than other protocols. This abstraction also allows the integration of other emerging
hardware-based localization techniques, for example, Beamforming Sensor Arrays.
GDRP does not specifically address the next hop a packet should take, but instead specifies a
direction it should travel. This direction abstraction allows for multiple paths to be taken through
the network thus enhancing network robustness to node mobility and failures. This indirect
addressing scheme also provides a solution to sensor node unique identification.
GDRP is simulated in a custom simulator written in Java. This simulator supports interfaces
for multiple protocols for layers 1, 2, 3, and 7 of the OSI model. For performance comparisons,
GDRP is compared against multiple WSN routing protocols. GDRP operates with a significantly
lower setup cost in terms of bytes transmitted and a lower setup latency for networks of varying
sizes. It also demonstrates an exponentially lower routing cost when compared to another multi-
path routing protocol due to a more efficient packet propagation in the network.
7
Liu, Xidong. "Rate-aware Cost-efficient Multiratecasting Routing in Wireless Sensor Networks." Thèse, Université d'Ottawa / University of Ottawa, 2013. http://hdl.handle.net/10393/23893.
Full textAbstract:
In the multiratecasting problem in wireless sensor networks, the source sensor is usually required to report to multiple destinations at dif- ferent rates for each of them. We present a MST-based rate-aware cost-efficient multiratecast routing protocol (MSTRC). The proposed MSTRC examines only one set partition of destinations at each for- warding step. A message split occurs when the locally-built minimum spanning tree (MST) over the current node and the set of destina- tions has multiple edges originated at the current node. Destinations spanned by each of these edges are grouped together, and for each of these subsets the best neighbor is selected as the next hop. We also suggested a novel face recovery mechanism to deal with void ar- eas, when no neighbor provides positive progress toward destinations. It constructs a MST of current node and destinations without the progress via neighbors, and for each set partition of destinations cor- responding to an edge e in MST, the face routing keeps going until a node that is closer to one of these destinations is found, allowing for greedy continuation, while the process repeats for the remaining desti- nations similarly. Our experimental results demonstrate that MSTRC is highly rate-efficient in all scenarios, and unlike existing solutions, it is adaptive to destination rate deviations.
8
LeBeau, Andrew David. "HIERARCHICAL ROUTING PROTOCOLS IN WIRELESS SENSOR NETWORKS." DigitalCommons@CalPoly, 2012. https://digitalcommons.calpoly.edu/theses/858.
Full textAbstract:
In recent wireless sensor network research, using a mobile data center (sink) to collect data has shown the ability to decrease the overall energy expenditure of the sensor field. Before the introduction of mobile sinks, many different routing protocols were developed under the assumption of a stationary sink. This work compares three such routing protocols, one hierarchical and two non-hierarchical, under the assumption of a mobile sink to determine which is best. The three protocols are tested against varying sink speed, node communication radius, and sensor field node populations. Different sink movement strategies and modifications to the routing protocols are also evaluated. This work shows that a modified Directed Diffusion, a non-hierarchical routing protocol, performs slightly better on average than a modified TEEN, a hierarchical routing protocol.
9
Boyd, Alan W. F. "Node reliance : an approach to extending the lifetime of wireless sensor networks." Thesis, University of St Andrews, 2010. http://hdl.handle.net/10023/1295.
Full textAbstract:
A Wireless Sensor Network (WSN) consists of a number of nodes, each typically having a small amount of non-replenishable energy. Some of the nodes have sensors, which may be used to gather environmental data. A common network abstraction used in WSNs is the (source, sink) architecture in which data is generated at one or more sources and sent to one or more sinks using wireless communication, possibly via intermediate nodes. In such systems, wireless communication is usually implemented using radio. Transmitting or receiving, even on a low power radio, is much more energy-expensive than other activities such as computation and consequently, the radio must be used judiciously to avoid unnecessary depletion of energy. Eventually, the loss of energy at each node will cause it to stop operating, resulting in the loss of data acquisition and data delivery. Whilst the loss of some nodes may be tolerable, albeit undesirable, the loss of certain critical nodes in a multi-hop routing environment may cause network partitions such that data may no longer be deliverable to sinks, reducing the usefulness of the network. This thesis presents a new heuristic known as node reliance and demonstrates its efficacy in prolonging the useful lifetime of WSNs. The node reliance heuristic attempts to keep as many sources and sinks connected for as long as possible. It achieves this using a reliance value that measures the degree to which a node is relied upon in routing data from sources to sinks. By forming routes that avoid high reliance nodes, the usefulness of the network may be extended. The hypothesis of this thesis is that the useful lifetime of a WSN may be improved by node reliance routing in which paths from sources to sinks avoid critical nodes where possible.
10
Tshiningayamwe, Loini Nakadhilu Methimbo. "A Priority Rate-Based Routing Protocol for wireless multimedia sensor networks." Master's thesis, University of Cape Town, 2017. http://hdl.handle.net/11427/25489.
Full textAbstract:
The development of affordable hardware has made it possible to transmit multimedia data over a wireless medium using sensor devices. Deployed sensors span larger geographical areas, generating different kinds of traffic that need to be communicated either in real-time or non-real-time mode to the sink. The tiny sized design of sensor nodes has made them even more attractive in various environments as they can be left unattended for longer periods. Since sensor nodes are equipped with limited resources, newer energy-efficient protocols and architectures are required in order to meet requirements within their limited capabilities when dealing with multimedia data. This is because multimedia applications are characterized by strict quality of service requirements that distinctively differentiate them from other data types during transmission. However, the large volume of data produced by the sensor nodes can easily cause traffic congestion making it difficult to meet these requirements. Congestion has negative impacts on the data transmitted as well as the sensor network at large. Failure to control congestion will affect the quality of multimedia data received at the sink and further shorten the system lifetime. Next generation wireless sensor networks are predicted to deploy a different model where service is allocated to multimedia while bearing congestion in mind. Applying traditional wireless sensor routing algorithms to wireless multimedia sensor networks may lead to high delay and poor visual quality for multimedia applications. In this research, a Priority Rate-Based Routing Protocol (PRRP) that assigns priorities to traffic depending on their service requirements is proposed. PRRP detects congestion by using adaptive random early detection (A-RED) and a priority rate-based adjustment technique to control congestion. We study the performance of our proposed multi-path routing algorithm for real-time traffic when mixed with three non real-time traffic each with a different priority: high, medium or low. Simulation results show that the proposed algorithm performs better when compared to two existing algorithms, PCCP and PBRC-SD, in terms of queueing delay, packet loss and throughput.
11
Ayaz, Beenish. "Improving routing performance of underwater wireless sensor networks." Thesis, University of Aberdeen, 2016. http://digitool.abdn.ac.uk:80/webclient/DeliveryManager?pid=235433.
Full textAbstract:
In this research work we propose a 3D node deployment strategy by carefully considering the unique characteristics of underwater acoustic communication as well as 3D dynamic nature of UWSN. This strategy targets 3D UWSN and not only improves the routing protocol performance significantly in terms of end to end delay and energy consumption but also provides reliability in data transmission. This strategy has been developed step by step from a single line of vertical communication to an effective 3D node deployment for UWSN. Several simulation experiments were carried out after adding different features to the final design to observe their impact on the overall routing performance. Finally, it is verified that this design strategy improves the routing performance, provides reliability to the network and increases network lifetime. Furthermore, we compared our results to the random node deployment in 3D, which is commonly used for analysing the performance of UWSN routing protocols. The comparison results verified our effective deployment design and showed that it provides almost 150% less end-to-end delay and almost 25% less energy consumption to the random deployment. It also revealed that by increasing the data traffic, our 3D node deployment strategy has no loss of data due to several back-up paths available, which is in contrast to random node deployment, where the packet loss occurs by increasing the data traffic. Improving the routing performance by carefully analysing the impact of 3D node deployment strategy and ensuring full sensing, transmission and back-up coverage in a highly unpredictable underwater environment, is a novel approach. Embedding this strategy with any networking protocol will improve its performance significantly.
12
Ullah, Muhammad, and Waqar Ahmad. "Evaluation of Routing Protocols in Wireless Sensor Networks." Thesis, Blekinge Tekniska Högskola, Sektionen för datavetenskap och kommunikation, 2009. http://urn.kb.se/resolve?urn=urn:nbn:se:bth-2500.
Full textAbstract:
The evolution of wireless communication and circuit technology has enabled the development of an infrastructure consists of sensing, computation and communication units that makes administrator capable to observe and react to a phenomena in a particular environment. The building block of such an infrastructure is comprised of hundreds or thousands of small, low cost, multifunctional devices which have the ability to sense compute and communicate using short range transceivers known as sensor nodes. The interconnection of these nodes forming a network called wireless sensor network (WSN). The low cost, ease of deployment, ad hoc and multifunctional nature has exposed WSNs an attractive choice for numerous applications. The application domain of WSNs varies from environmental monitoring, to health care applications, to military operation, to transportation, to security applications, to weather forecasting, to real time tracking, to fire detection and so on. By considering its application areas WSN can be argue as a traditional wired or wireless network. But in reality, these networks are comprised of battery operated tiny nodes with limitations in their computation capabilities, memory, bandwidth, and hardware resulting in resource constrained WSN. The resource constrained nature of WSN impels various challenges in its design and operations degrading its performance. On the other hand, varying numbers of applications having different constraints in their nature makes it further challenging for such resources constrained networks to attain application expectations. These challenges can be seen at different layer of WSNs starting from physical layer up to application layer. At routing layer, routing protocols are mainly concerned with WSN operation. The presence of these challenges affects the performance of routing protocols resulting in overall WSN performance degradation. The aim of this study is to identify the performance challenges of WSN and analyze their impact on the performance of routing protocols. For this purpose a thorough literature study is performed to identify the issues affecting the routing protocols performance. Then to validate the impact of identified challenges from literature, an empirical study has been conducted by simulating different routing protocols, taking into consideration these challenges and results are shown. On the basis of achieved results from empirical study and literature review recommendations are made for better selection of protocol regarding to application nature in the presence of considered challenges.
13
Abusaimeh, Hesham. "Energy-aware routing protocols in Wireless Sensor Networks." Thesis, Loughborough University, 2009. https://dspace.lboro.ac.uk/2134/8141.
Full textAbstract:
Saving energy and increasing network lifetime are significant challenges in the field of Wireless Sensor Networks (WSNs). Energy-aware routing protocols have been introduced for WSNs to overcome limitations of WSN including limited power resources and difficulties renewing or recharging sensor nodes batteries. Furthermore, the potentially inhospitable environments of sensor locations, in some applications, such as the bottom of the ocean, or inside tornados also have to be considered. ZigBee is one of the latest communication standards designed for WSNs based on the IEEE 802.15.4 standard. The ZigBee standard supports two routing protocols, the Ad hoc On-demand Distance Vector (AODV), and the cluster-tree routing protocols. These protocols are implemented to establish the network, form clusters, and transfer data between the nodes. The AODV and the cluster-tree routing protocols are two of the most efficient routing protocols in terms of reducing the control message overhead, reducing the bandwidth usage in the network, and reducing the power consumption of wireless sensor nodes compared to other routing protocols. However, neither of these protocols considers the energy level or the energy consumption rate of the wireless sensor nodes during the establishment or routing processes.
14
Lukachan, George. "Scalable energy-efficient location aided routing (SELAR) protocol for wireless sensor networks." [Tampa, Fla] : University of South Florida, 2005. http://purl.fcla.edu/usf/dc/et/SFE0001366.
Full text
15
Garcia, Juliette. "Opportunistic data collection and routing in segmented wireless sensor networks." Thesis, Toulouse 3, 2020. http://www.theses.fr/2020TOU30153.
Full textAbstract:
La surveillance régulière des opérations dans les aires de manoeuvre (voies de circulation et pistes) et aires de stationnement d'un aéroport est une tâche cruciale pour son fonctionnement. Les stratégies utilisées à cette fin visent à permettre la mesure des variables environnementales, l'identification des débris (FOD) et l'enregistrement des statistiques d'utilisation de diverses sections de la surface. Selon un groupe de gestionnaires et contrôleurs d'aéroport interrogés, cette surveillance est un privilège des grands aéroports en raison des coûts élevés d'acquisition, d'installation et de maintenance des technologies existantes. Les moyens et petits aéroports se limitent généralement à la surveillance de quelques variables environnementales et des FOD effectuée visuellement par l'homme. Cette dernière activité impose l'arrêt du fonctionnement des pistes pendant l'inspection. Dans cette thèse, nous proposons une solution alternative basée sur les réseaux de capteurs sans fil (WSN) qui, contrairement aux autres méthodes, combinent les propriétés de faible coût d'installation et maintenance, de déploiement rapide, d'évolutivité tout en permettant d'effectuer des mesures sans interférer avec le fonctionnement de l'aéroport. En raison de la superficie d'un aéroport et de la difficulté de placer des capteurs sur des zones de transit, le WSN se composerait d'une collection de sous-réseaux isolés les uns des autres et du puits. Pour gérer cette segmentation, notre proposition s'appuie sur l'utilisation opportuniste des véhicules circulants dans l'aéroport considérés alors comme un type spécial de nœud appelé Mobile Ubiquitous LAN Extension (MULE) chargé de collecter les données des sous-réseaux le long de son trajet et de les transférer vers le puits. L'une des exigences pour le déploiement d'un nouveau système dans un aéroport est qu'il cause peu ou pas d'interruption des opérations régulières. C'est pourquoi l'utilisation d'une approche opportuniste basé sur des MULE est privilégiée dans cette thèse. Par opportuniste, nous nous référons au fait que le rôle de MULE est joué par certains des véhicules déjà existants dans un aéroport et effectuant leurs déplacements normaux. Et certains nœuds des sous- réseaux exploiteront tout moment de contact avec eux pour leur transmettre les données à transférer ensuite au puits. Une caractéristique des MULEs dans notre application est qu'elles ont des trajectoires structurées (suivant les voies de circulation dans l'aéroport), en ayant éventuellement un contact avec l'ensemble des nœuds situés le long de leur trajet (appelés sous-puits). Ceci implique la nécessité de définir une stratégie de routage dans chaque sous-réseau, capable d'acheminer les données collectées des nœuds vers les sous-puits et de répartir les paquets de données entre eux afin que le temps en contact avec la MULE soit utilisé le plus efficacement possible. [...]<br>The regular monitoring of operations in both movement areas (taxiways and runways) and non-movement areas (aprons and aircraft parking spots) of an airport, is a critical task for its functioning. The set of strategies used for this purpose include the measurement of environmental variables, the identification of foreign object debris (FOD), and the record of statistics of usage for diverse sections of the surface. According to a group of airport managers and controllers interviewed by us, the wide monitoring of most of these variables is a privilege of big airports due to the high acquisition, installation and maintenance costs of most common technologies. Due to this limitation, smaller airports often limit themselves to the monitoring of environmental variables at some few spatial points and the tracking of FOD performed by humans. This last activity requires stopping the functioning of the runways while the inspection is conducted. In this thesis, we propose an alternative solution based on Wireless Sensor Network (WSN) which, unlike the other methods/technologies, combines the desirable properties of low installation and maintenance cost, scalability and ability to perform measurements without interfering with the regular functioning of the airport. Due to the large extension of an airport and the difficulty of placing sensors over transit areas, the WSN might result segmented into a collection of subnetworks isolated from each other and from the sink. To overcome this problem, our proposal relies on a special type of node called Mobile Ubiquitous LAN Extension (MULE), able to move over the airport surface, gather data from the subnetworks along its way and eventually transfer it to the sink. One of the main demands for the deployment of any new system in an airport is that it must have little or no interference with the regular operations. This is why the use of an opportunistic approach for the transfer of data from the subnetworks to the MULE is favored in this thesis. By opportunistic we mean that the role of MULE will be played by some of the typical vehicles already existing in an airport doing their normal displacements, and the subnetworks will exploit any moment of contact with them to forward data to the sink. A particular characteristic of the MULEs in our application is that they move along predefined structured trajectories (given by the layout of the airport), having eventual contact with the set of nodes located by the side of the road (so-called subsinks). This implies the need for a data routing strategy to be used within each subnetwork, able to lead the collected data from the sensor nodes to the subsinks and distribute the data packets among them so that the time in contact with the MULE is used as efficiently as possible. In this thesis, we propose a routing protocol which undertakes this task. Our proposed protocol is named ACME, standing for ACO-based routing protocol for MULE-assisted WSNs.[...]
16
Biswas, Kamanashis. "Energy Efficient Secure Routing in Wireless Sensor Networks." Thesis, Griffith University, 2016. http://hdl.handle.net/10072/365658.
Full textAbstract:
Wireless Sensor Networks (WSNs) can contain thousands of small, inexpensive sensors that are randomly deployed in open and harsh environments to collect data. The short lifespan of the battery-operated sensors and the hostile environments necessitate the development of energy ecient and secure protocols in sensor networks. Among the wide variety of network protocols, routing plays the most signicant role in energy consumption since 70% of the total energy is consumed for data transmission in WSNs. Therefore, it is necessary to design energy ecient routing schemes to conserve energy and prolong the network lifetime. However, resource limited sensors, lack of a global addressing scheme, and application-specic design of WSNs make routing a challenge. Furthermore, security is another critical issue in WSNs since sensors are generally deployed in unprotected environments and vulnerable to security attacks. The security algorithms have to be integrated with routing protocols to provide authenticity, condentiality, and integrity of transmitted data. Most of the existing routing protocols implement dierent security mechanisms to achieve the security goals. Any conflict among these measures may create vulnerabilities in the network. Therefore, to ensure energy eciency and minimisation of the implementation gap, energy ecient secure routing protocols have to be designed using a common security framework.<br>Thesis (PhD Doctorate)<br>Doctor of Philosophy (PhD)<br>School of Information and Communication Technology<br>Science, Environment, Engineering and Technology<br>Full Text
17
Al-Mousa, Yamin Samir. "MAC/routing design for under water sensor networks /." Online version of thesis, 2007. http://hdl.handle.net/1850/4496.
Full text
18
Teo, Cheng Kiat Amos. "Performance evaluation of a routing protocol in wireless sensor network." Thesis, Monterey, Calif. : Springfield, Va. : Naval Postgraduate School ; Available from National Technical Information Service, 2005. http://library.nps.navy.mil/uhtbin/hyperion/05Dec%5FTeo.pdf.
Full textAbstract:
Thesis (M.S. in Electrical Engineering)--Naval Postgraduate School, December 2005.<br>Thesis Advisor(s): Gurminder Singh, John C. McEachen. Includes bibliographical references (p.57-60). Also available online.
19
Hayes, T. "Routing protocols for next generation mobile wireless sensor networks." Thesis, University of Sussex, 2016. http://sro.sussex.ac.uk/id/eprint/63977/.
Full textAbstract:
The recent research interest in wireless sensor networks has caused the development of many new applications and subsequently, these emerging applications have ever increasing requirements. One such requirement is that of mobility, which has inspired an entirely new array of applications in the form of mobile wireless sensor networks (MWSNs). In terms of communications, MWSNs present a challenging environment due to the high rate at which the topology may be changing. As such, the motivation of this work is to investigate potential communications solutions, in order to satisfy the performance demands of new and future MWSN applications. As such this work begins by characterising and evaluating the requirement of a large variety of these emerging applications. This thesis focuses on the area of routing, which is concerned with the reliable and timely delivery of data from multiple, mobile sensor nodes to a data sink. For this purpose the technique of gradient routing was identified as a suitable solution, since data can quickly be passed down a known gradient that is anchored at the sink. However, in a mobile network, keeping the gradient up-to-date is a key issue. This work proposes the novel use of a global time division multiple access (GTDMA) MAC as a solution to this problem, which mitigates the need for regularly flooding the network. Additionally, the concept of blind forwarding is utilised for its low overhead and high reliability through its inherent route diversity. The key contribution of this thesis is in three novel routing protocols, which use the aforementioned principles. The first protocol, PHASeR, uses a hop-count metric and encapsulates data from multiple nodes in its packets. The hop-count metric was chosen because it is simple and requires no additional hardware. The inclusion of encapsulation is intended to enable the protocol to cope with network congestion. The second protocol, LASeR, utilises location awareness to maintain a gradient and performs no encapsulation. Since many applications require location awareness, the communications systems may also take advantage of this readily available information and it can be used as a gradient metric. This protocol uses no encapsulation in order to reduce delay times. The third protocol, RASeR, uses the hop-count metric as a gradient and also does not perform encapsulation. The reduced delay time and the relaxed requirement for any existing method of location awareness makes this the most widely applicable of the three protocols. In addition to analytical expressions being derived, all three protocols are thoroughly tested through simulation. Results show the protocols to improve on the state-of-the-art and yield excellent performance over varying speeds, node numbers and data generation rates. LASeR shows the lowest overhead and delay, which comes from the advantage of having available location information. Alternatively, at the expense of increased overhead, RASeR gives comparatively high performance metrics without the need for location information. Overall, RASeR can be suitably deployed in the widest range of applications, which is taken further by including four additional modes of operation. These include a supersede mode for applications in which the timely delivery of the most recent data is prioritised. A reverse flooding mechanism, to enable the sink to broadcast control messages to the sensor nodes. An energy saving mode, which uses sleep cycles to reduce the networks power consumption, and finally a pseudo acknowledgement scheme to increase the reliability of the protocol. These additions enable RASeR to satisfy the needs of some of the most demanding MWSN applications. In order to assess the practicality of implementation, RASeR was also evaluated using a small testbed of mobile nodes. The successful results display the protocols feasibility to be implemented on commercially available hardware and its potential to be deployed in the real world. Furthermore, a key issue in the real world deployment of networks, is security and for this reason a fourth routing protocol was designed called RASeR-S. RASeR-S is based on RASeR, but introduces the use of encryption and suggests a security framework that should be followed in order to significantly reduce the possibility of a security threat. Whilst the main focus of this work is routing, alternative MAC layers are assessed for LASeR. Unlike the other two protocols, LASeR uses available location information to determine its gradient and as such, it is not reliant on the GTDMA MAC. For this reason several MAC layers are tested and the novel idea of dedicated sensing slots is introduced, as well as a network division multiple access scheme. The selected and proposed MACs are simulated and the GTDMA and two proposed protocols are shown to give the best results in certain scenarios. This work demonstrates the high levels of performance that can be achieved using gradient orientated routing in a mobile network. It has also shown that the use of a GTDMA MAC is an efficient solution to the gradient maintenance problem. The high impact of this work comes from the versatility and reliability of the presented routing protocols, which means they are able to meet the requirements of a large number of MWSN applications. Additionally, given the importance of security, RASeR-S has been designed to provide a secure and adaptable routing solution for vulnerable or sensitive applications.
20
Li, Weibo. "An Address-Based Routing Scheme for Static Applications of Wireless Sensor Networks." Thesis, University of Canterbury. Electrical and Computer Engineering, 2008. http://hdl.handle.net/10092/2110.
Full textAbstract:
Wireless sensor networks (WSNs), being a relatively new technology, largely employ
protocols designed for other ad hoc networks, especially mobile ad hoc networks (MANETs).
However, on the basis of applications, there are many differences between WSNs and
other types of ad hoc network and so WSNs would benefit from protocols which take
into account their specific properties, especially in routing. Bhatti and Yue (2006) proposed
an addressing scheme for multi-hop networks. It provides a systematic address
structure for WSNs and allows network topology to avoid the fatal node failure problem
which could occur with the ZigBee tree structure. In this work, a new routing strategy
is developed based on Bhatti and Yue’s addressing scheme. The new approach is to implement
a hybrid flooding scheme that combines flooding with shortest-path methods
to yield a more practical routing protocol for static WSN applications. The primary
idea is to set a flooding counter K as an overhead parameter of control messages which
are used to discover routes between any arbitrary nodes. These route request messages
are flooded for K hops and then oriented by shortest-path routing from multiple nodes
in the edge of the flooding area to the destination. The simulation results show that this
protocol under certain wireless circumstances is more energy conscious and produces
less redundancy than reactive ZigBee routing protocol. Another advantage is that the
routing protocol can adapt any dynamic environment in various WSN applications to
achieve a satisfactory data delivery ratio in exchange for redundancy.
21
Chalabianloo, Niaz. "Routing And Security In Wireless Sensor Networks, An Experimental Evaluation Of A Proposed Trust Based Routing Protocol." Master's thesis, METU, 2013. http://etd.lib.metu.edu.tr/upload/12615749/index.pdf.
Full textAbstract:
Satisfactory results obtained from sensor networks and the ongoing development in electronics and wireless communications have led to an impressive boost in the number of applications based on WSNs. Along with the growth in popularity of WSNs, previously implemented solutions need further improvements and new challenges arise which need to be solved.
One of the main concerns regarding WSNs is the existence of security threats against their routing operations. Likelihood of security attacks in a structure suffering from resource constraints makes it an important task to choose proper security mechanisms for the routing decisions in various types of WSN applications.
The main purpose of this study is to survey WSNs, routing protocols, security attacks against routing layer of a WSN, introduction of Trust based models which are an effective defense mechanism against security attacks in WSNs and finally, to implement a proposed Trust based routing protocol in order to overcome security attacks.
The study begins with a survey of Sensor Networks, after the introduction of WSNs and their related routing protocols, the issue of security attacks against the network layer of a Sensor Network is described with a presentation of different types of attacks and some of Trust based related works.
In the final chapters of this research, a novel Trust based AODV protocol will be proposed, implemented and examined in a simulation environment. For this purpose, multiple number of scenarios will be simulated on the AODV protocol with and without Trust mechanism, then the achieved results will be compared to derive a conclusion.
22
Ibrahim, Rwan. "An energy-efficient and load-balancing cluster-based routing protocol for wireless sensor networks." Thesis, McGill University, 2013. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=119428.
Full textAbstract:
Clustering is a popular routing technique in configuring Wireless Sensor Networks (WSNs). It can determine the communications between all nodes to collect data in an efficient manner. It handles the main challenge of energy-efficiency in WSNs, and can be used to re-configure the network according to changes in the nodes' conditions. This thesis contributes to the routing in WSNs by proposing an Energy-efficient and Load-balancing Cluster-based (ELC) routing algorithm for Carrier Sense Multiple Access (CSMA)-based WSNs. In particular, both distance and residual energy are taken into consideration in developing the cluster-head selection procedure while ensuring that the network has a desired number of cluster heads. In addition to distance, cluster size is also used in formulating the cost function for cluster forming in order to balance load and energy consumption among the nodes, and hence, enhancing the network lifetime. Besides, ELC employs multi-hop inter-cluster routing based on a lowest-cost path approach that considers both energy efficiency and load balancing. Illustrative simulation results show that ELC consumes less energy and offers longer network lifetime as compared to other existing cluster-based routing algorithms such as Low-Energy Adaptive Clustering Hierarchy-Centralized (LEACH-C) protocol and Central Base Station Controlled Density Aware Clustering Protocol (CBCDACP).<br>Le clustering est une technique de routage populaire utilisée dans la configuration d'un réseau de capteurs sans fil. Cette technique peutétablir les paramètres de communication entre tous les nœuds du réseau pour une collecte de données plus efficace. Elle traite l'obstacle principal à la performance des réseaux de capteurs sans fil, l'efficacité énergétique, et peut être utilisée dans la reconfiguration du réseau selon le changement de conditions des nœuds. La contribution de cette thèse au domaine de routage dans les réseaux de capteurs sans fil consiste dans la présentation d'un nouvel algorithme de routage à base de clustering écoénergétique et d'équilibrage de charge (en anglais, Energy-efficient and Load-balancing Cluster-based routing algorithm ou ELC) pour les réseaux de capteurs sans fil à base de accès multiple avec écoute de porteuse. Particulièrement, les critères de distance et énergie résiduelle sont pris en considération dans la formulation de la procédure de sélection des Cluster Heads (CHs) tout en garantissant que le réseau est formé en tout temps par un nombre désirable de CHs. Outre que la distance, la taille du cluster est de même utilisée dans la formulation de la fonction du coût de la formation des clusters. Ceci vise à équilibrer la répartition de charges et l'énergie des nœuds du réseau, et par conséquence, à aboutir à une plus longue durée de vie du réseau. En outre, ELC emploie une technique de routage inter-cluster avec sauts multiples qui se base sur une approche au moindre coût qui prend en considération l'efficacité énergétique et l'équilibrage de charge dans le réseau. Les simulations démontrent que ELC consomme moins d'énergie et aboutit à une plus longue durée de vie du réseau par rapport à d'autres algorithmes de routage à base de clustering comme LEACH-C et CBCDACP.
23
Al, Kiyumi Raja M. "Energy-aware MAC and routing protocol design for lifetime maximization in wireless sensor networks." Thesis, University of Surrey, 2018. http://epubs.surrey.ac.uk/846343/.
Full textAbstract:
WSN applications demand prolonged network operation in which manually replenishing the scarce battery resources of sensor nodes are not usually possible. When the limited energy of sensor nodes is completely exhausted, this leads to reduced coverage and may cause network partitioning, which dramatically reduces the network lifetime. In this respect, network lifetime enhancement is considered the most critical aspect of WSN performance. Prolonging network lifetime requires mechanisms that provide energy consumption balancing (ECB) in addition to energy efficiency (EE). This thesis investigates network lifetime maximization problem and proposes solutions to address both EE and ECB. The scope covers two separate but equally important fronts: duty cycling mechanisms and maximum lifetime routing strategies. Duty cycling significantly reduces the energy consumption of sensor nodes resulting from idle listening. Meanwhile, maximum lifetime routing schemes aim at balancing traffic loads and hence energy consumption among sensor nodes across the network. In this regard, our contributions are in three-folds. First, a distributed sleep mechanism is proposed for the non-beacon-enabled mode of the IEEE 802.15.4 MAC protocol, to support energy-efficient operation in WSNs. In addition to achieving energy savings, our mechanism helps reshape generated traffic so that the overall channel contention is reduced. This effect in turns improves packet delivery ratio at the data sink. Second, we propose a Control-theoretic Duty Cycle Adaptation algorithm (CDCA) to adapt nodes duty cycle based on time-varying and/or spatially non-uniform data traffic loads. The proposed mechanism is distributed; hence each node adjusts its duty cycle independently. We introduce a novel concept called virtual queue, which provides better insight into actual traffic conditions in comparison to existing schemes and prevents excessive packet drop. Using NS-3 simulation, we demonstrate the performance improvements obtained from CDCA in comparison to the state of the art. Furthermore, a stability analysis is conducted to investigate system stability conditions. Third, we formulate the maximum lifetime routing problem as a minimax optimization problem, and numerically obtain the upper bound network lifetime. Moreover, we propose a Distributed Energy-aware Fuzzy-Logic based routing algorithm (DEFL). DEFL makes an appropriate trade-off between energy efficiency and energy consumption balancing and successfully extends the network lifetime under different network conditions. The simulation results demonstrate that DEFL outperforms all tested algorithms and performs very close to the upper bound. Keywords: Network Lifetime Maximization, Energy Efficiency, Energy Consumption Balancing, MAC, Routing, Wireless Sensor Networks.
24
王祥宇. "Network Coding Routing Protocol for Wireless Sensor Networks." Thesis, 2011. http://ndltd.ncl.edu.tw/handle/45741112153218500940.
Full text
25
Lin, Zhi-Sheng, and 林志昇. "Cluster-Based Routing Protocol in Wireless Sensor Networks." Thesis, 2006. http://ndltd.ncl.edu.tw/handle/9mj44g.
Full textAbstract:
碩士<br>國立東華大學<br>資訊工程學系<br>94<br>Recent advances in hardware and wireless communication technologies have designed low-cost, low-power, multifunctional sensor devices. These hundreds or thousands of sensor nodes are spread across a geographical area to monitor ambient condition such as temperature, sound and light. These sensor nodes cooperate with each other to establish a sensing network that can provide access to surrounding information anytime, anywhere. Wireless sensor network has been adopted in various applications (e.g., health, military, security, factory automation, environmental monitoring). The sensor nodes are typically restricted by energy, storage capacity and computing ability. They have finite energy supplied by batteries which can not be recharged owing to the scale of sensor network. Therefore, reducing power consumption is a critical issue in sensor networks. The power consumption in wireless sensor networks can be categorized into two parts: communication and computation. Communication is the major consumer of power. A good routing protocol can reduce the power consumption of communication and prolong the lifetime of sensor network.
In this thesis, we introduce a new cluster-based routing protocol that combines the table-driven intra-cluster routing and on-demand inter-cluster routing by changing the relationship between clusters for sensor networks. The advantages of cluster-based routing are to reduce the communication traffic and information storage and avoid frequent network topology changes. The proposed routing protocol is primarily based on the net mask and gateway of traditional network subnet. In traditional network environment, while the packets are sent to the Internet, the computer compares each packet’s destination by comparing it with net mask to determine whether it is in the local subnet. If the destination is in outer subnet, then the computer forwards packets to the outer subnet passing through the responsible gateway. Accordingly, the sensor nodes are split into several clusters as subnets, and the border nodes in the adjacent clusters around the local cluster acting as border gateways are responsible for the route to other adjacent clusters.
Applying the protocol in sensor networks can reduce packets flooding throughout the network and improve the routing efficiency. Simulation results showed that about 40% of control overhead can be diminished compared to Dynamic Source Routing protocol (DSR) and Ad hoc On-demand Distance Vector routing protocol (AODV).
26
Tu, Ching, and 涂靖. "Anonymous Path Routing Protocol in Wireless Sensor Networks." Thesis, 2007. http://ndltd.ncl.edu.tw/handle/65479830301418086877.
Full textAbstract:
碩士<br>國立中央大學<br>資訊工程研究所<br>95<br>Since the transmitting medium of wireless sensor networks (WSNs) is the air, adversaries can easily overhear any packet “flying in the air”. In order to secure the data transmission, the general solutions are encrypting the packet payload with symmetric keys. But those algorithms only keep adversaries out of prying the content of packets and prevent the packets from being modified by adversaries. Adversaries still can learn networks topology by traffic analysis attack. In this paper, we propose an anonymous path routing (APR) protocol for WSNs. By APR protocol, the data is transmitted with anonymity between sensor nodes. Anonymous communications break the relative of the packets flying in the air. APR ensures that the adversaries cannot discover the real identities of local transmitters. The evaluation result shows that APR can achieve both anonymity and security properties of the routing protocol in WSNs. In addition, we implement our APR in the MICAz platform with TinyOS to demonstrate its applicability and communication capability in WSNs.
27
金芳瑋. "Small-world routing protocol in wireless sensor networks." Thesis, 2007. http://ndltd.ncl.edu.tw/handle/63989544501569552457.
Full textAbstract:
碩士<br>中華大學<br>資訊工程學系(所)<br>95<br>Wireless sensor networks are large-scale distributed sensing networks comprising many small and low cost sensing devices. Every sensor can communicate with each other which is in communicate radius, and detects different kinds of signals, such as temperatures, steam, luminosity, and voice. One of fundamental problems of wireless sensor networks is that an event can be detected by some sensors and the collected information should be delivered to the query devices. This kind of query and event could be happened anytime and anywhere. As a result, it becomes more important to design efficient and power saving routing protocols in such kind of sensor network. In this thesis, we design a new routing protocol: Small-World Routing, the idea behind which is from small-world concept, finding the paths between queries and events by weak links and strong links. We also conduct simulations to evaluate and compare the performance of Small-World Routing with Rumor Routing protocols. The simulation results indicate that the Small-World Routing Protocol can find shorter path than Rumor Routing does but with similar successful ratios and the same power consumption.
28
Liu, Chi-Chuan, and 劉啟全. "Intelligent Agent Routing Protocol For Wireless Sensor Networks." Thesis, 2007. http://ndltd.ncl.edu.tw/handle/88265517412356215561.
Full textAbstract:
碩士<br>輔仁大學<br>電子工程學系<br>95<br>This thesis studies the routing problem in wireless sensor networks. Since the energy of a wireless sensor node is limited and recharging is difficult, while designing the routing protocol, saving energy is a primary concern. This thesis proposes a routing scheme, denoted as intelligent agent routing, for wireless sensor network which mainly adopts the basic structure of agent routing to set up an abstract tree structure with the data center as the root. When an event happens, the information can be passed back to the root through the tree structure. Multiple agents’ concept is also proposed to shorten the setup time of tree structure. Since multiple agents develop many ways of routes, they can shorten the length of routes and save the cost that message passes on. In addition, a flexible agent, it determines agent's number dynamically according to the sensors’ distribution, is proposed. A shortcut mechanism is also designed for the intelligent agent routing to further reduce the routing. The simulation results show that the intelligence agent routing obtains better performance in terms of the average setup time, average length of route, and coverage rate. Among multiple agent schemes, flexible agent obtains the best performance.
29
Pretorius, Jacques Nicolaas. "Mobile tolerant hybrid network routing protocol for wireless sensor networks." Diss., 2010. http://hdl.handle.net/2263/27509.
Full textAbstract:
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<br>Dissertation (MEng)--University of Pretoria, 2010.<br>Electrical, Electronic and Computer Engineering<br>unrestricted
30
Gunasekaran, Raghul. "A Crosslayer Routing Protocol (XLRP) for Wireless Sensor Networks." 2007. http://etd.utk.edu/2007/Theses/GunasekaranRaghul.pdf.
Full text
31
Lin, Yi-Jhang, and 林奕漳. "Adaptive Coverage-Preserving Routing Protocol for Wireless Sensor Networks." Thesis, 2011. http://ndltd.ncl.edu.tw/handle/karw4w.
Full textAbstract:
碩士<br>國立臺北科技大學<br>電機工程系研究所<br>99<br>The practical application of wireless sensor nodes remains limited, due to the restrictions on hardware design, such as energy consumption, communication capability and computation capability. Many applications of wireless sensor networks – including medical healthcare, military surveillance and security systems – must meet the requirement of 100% coverage, but the issue of coverage is not addressed by studies on routing protocols.
Thus, this work proposes an adaptive coverage-preserving routing protocol (ACPRP) to deal with coverage. ACPRP can also reduce the possibility that a node with less overlapped coverage is selected as a relay node. Furthermore, the Particle Swarm Optimization (PSO) algorithm is used to find optimal weight parameters which are fed into the cluster head selection mechanism and the hierarchy routing selection mechanism proposed by this work. The best transmission route between nodes is calculated based on remaining energy, coverage and transmission distance of each node.
In terms of coverage, the simulation results show that the ACPRP is able to provide up to 134%~151% additional service time with a 100% coverage ratio, compared to the existing LEACH-Coverage-U protocol and the LEACH protocol, and generate up to 13.4% additional service time with a 100% coverage ratio, compared to the ECHR protocol. Therefore, the simulation results demonstrate that the ACPRP is able to provide a better service time for 100% coverage ratio.
32
Mao, Hung-Jen, and 毛宏仁. "TMRP：Tree-based Multipath Routing Protocol for Wireless Sensor Networks." Thesis, 2004. http://ndltd.ncl.edu.tw/handle/02960877032467919880.
Full textAbstract:
碩士<br>淡江大學<br>資訊工程學系碩士班<br>94<br>Wireless sensor networks consist of small nodes with sensing, computation and wireless communication capabilities. In many emerging application scenarios (e.g., battlefield surveillance, large-area and perimeter monitoring in agriculture, and autonomous ocean scientific sampling), a large number of such simple immobile nodes are deployed in a vast geographical area to monitor activities or environmental conditions.
The energy efficiency is a substantial key design issue in such networks. An efficient routing protocol is critical to prolong the life of sensor nodes. Several methods for transmitting data in randomly deployed sensor nodes have been proposed, including direct communication, flat and clustering protocols. In this paper, we propose a Tree-Based Multipath Routing Protocol (TMRP) for wireless sensor networks. According to the proposed TMRP, the wireless sensor network is initially constructed as a layered network. Based on the layered network, sensor nodes have multipath routes to the sink node through candidate parent nodes. In this paper, the verification simulation is also executed to prove the proposed TMRP can increase the lifetime of sensor networks better than other protocol
33
Huang, Chun-Wei, and 黃俊瑋. "An Enhanced Lifetime Routing Protocol for Wireless Sensor Networks." Thesis, 2006. http://ndltd.ncl.edu.tw/handle/75931874183961471460.
Full textAbstract:
碩士<br>元智大學<br>資訊工程學系<br>94<br>Wireless sensor networks (WSN) consist of thousands of tiny low cost nodes and are used in applications such as military, hospital, environment observation of scientific research. However, these small devices have many restrictions like limited energy, computing capability, and transmission range, etc. Most of these restrictions may result in the short lifetime of the whole sensor network, which means that even though some nodes still have powers, the whole WSN may lose the function for collecting data.
Therefore, how to enhance the lifetime of wireless sensor network has become an important issue. In DREAM [1] and SELAR[2] papers, the authors utilize the geographic and power consumption factors for choosing transmission path to improve the lifetime of wireless sensor network.
In this paper, we propose some mechanisms for further improvement. Our approach will divide the sensor nodes into two different roles & functions, and adopt a simple self-election algorithm. Through these mechanisms, the total powers for transmitting data could be shared by most nodes, and the lifetime of wireless sensor network will be enhanced much better than SELAR[2].
34
Page, Jonathan Grant. "Energy efficient hybrid routing protocol for wireless sensor networks." Diss., 2008. http://hdl.handle.net/2263/27724.
Full textAbstract:
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.<br>Dissertation (MEng)--University of Pretoria, 2008.<br>Electrical, Electronic and Computer Engineering<br>unrestricted
35
Hsu, Yu-chih, and 許有志. "A Minimum Hop Routing Protocol for Wireless Sensor Networks." Thesis, 2009. http://ndltd.ncl.edu.tw/handle/81159268147497214880.
Full textAbstract:
碩士<br>龍華科技大學<br>電機工程研究所<br>97<br>In the recent year, a variety of wireless sensor network (WSN) research and development has been applied to different areas. WSN is a data communication system that consists of from several to thousands of tiny wireless sensor nodes. These battery powered sensor nodes cooperate with each other to accomplish data transmission.
In this thesis, we design a data routing protocol, which is a minimum hop routing protocol. Due to the nodes depend entirely on the lifetime of the battery power, the proposed routing protocol chooses hop counts and battery energy levels as metrics, in order to conserve as much energy as possible in both computations and data communications. In addition, when some of the nodes fail or run out of battery, the routing protocol could effectively adapt the change and find an alternative path. The robustness and the performance of the proposed routing protocol were tested, and the results turned out to be successful.
36
Morton, Daniel H. "The Lusus Protocol." Thesis, 2005. http://hdl.handle.net/10125/10475.
Full text
37
Lee, Yung-tai, and 李永泰. "An Adjustable Cluster-based Routing Protocol for Wireless Sensor Networks." Thesis, 2007. http://ndltd.ncl.edu.tw/handle/k9r24c.
Full textAbstract:
碩士<br>國立中山大學<br>資訊工程學系研究所<br>95<br>Wireless sensor networks consist of many small sensor nodes with sensing, computation, and wireless communications capabilities. Recently, there have been numerous research results in the power consumption for routing protocol. Routing protocols in WSNs might difference depending on the application and network architecture. This paper focuses on reducing the power consumption for routing protocol of wireless sensor networks too. We present a routing protocol called ACRP. sensor nodes will organize many clusters voluntarily. Cluster heads will distribute time slot to the sensor nodes in the same cluster and sensor nodes will transmit data to cluster head in it’s time slot. After the data had been aggregated by cluster heads, they will send the aggregated data to base station through the routing path that had been established. In addition, in order to lengthen the living time of wireless sensor network, the base station will periodically adjust the amount of sensor nodes in all clusters according to the cluster information.
38
WEI, YUN-FANG, and 魏耘芳. "Improved Optimized Link State Routing Protocol in Wireless Sensor Networks." Thesis, 2017. http://ndltd.ncl.edu.tw/handle/z23wwq.
Full textAbstract:
碩士<br>國立臺中教育大學<br>資訊工程學系<br>105<br>In Wireless Sensor Networks (WSNs), a network system consists of one or more wireless data collection devices and numerous sensors. In order to achieve the purpose of massive deployment, WSNs must be with low cost and easy deployment. Because of the small volume of sensors, sensors battery capacity is limited. And sensors can not charge the battery or replace it, sensors must be low power consumption. Otherwise the battery depletion, sensors useless. When not transmitting or receiving data, sensors will enter into sleep mode, so efficient battery utilization and increased network life are important. In WSNs, the sensors have no routing mechanism, Optimized Link State Routing (OLSR) is a standard proactive routing protocol. Before sending a message, OLSR finds a good route in advance through Multipoint Relay (MPR) to reach all destinations. However, when selecting MPR, OLSR only considered being able to succeed to the destination, resulting in high delay, low throughput, large power consumption. This paper focus on extended sensor life, reduce transmission delay, improve the overall throughput. This paper proposes a cost function to optimize the improved OLSR algorithms to the MPRs, and compared to existing techniques.
We use NS3 simulator to compare OLSR and IOLSR. Compared with OLSR, the proposed cost function not only saves battery energy but also achieves low delay and high throughput.
39
Lin, Jian-Da, and 林建達. "Distributed Landmark Election and Routing Protocol in Wireless Sensor Networks." Thesis, 2010. http://ndltd.ncl.edu.tw/handle/74113221676727900421.
Full textAbstract:
碩士<br>中華大學<br>資訊工程學系碩士班<br>98<br>In wireless sensor networks, it is an important task to periodically collect data from an interesting area for time-critical applications, such as forest fire, military, etc. The sensed data must be gathered and transmitted to a base station for further processing to meet the end-user queries. If there are holes that the regions without any available sensor node in the environment, geographic routing can be efficient to deal with routing holes problem, but it needs sensor nodes to have location information, which is acquired from global positioning system (GPS). However, to make each sensor node equips a GPS device in a large-scale wireless sensor network is not applicable due to a GPS device is expensive in terms of size, cost and energy consumption compared with sensor node. Since sensor nodes are typically battery operated, extra GPS devices induce cost and energy consumption increase, it is challenging task to design an efficient routing scheme without GPS devices as well as provide hole avoiding solution.
In this thesis, we consider the problem about landmark-based routing in wireless sensor networks (WSNs). It is important how efficiently elect some landmarks in the network. Besides, we also consider the regular and irregular holes in the environment. Simulation results show that our scheme can not only deal with routing holes problem but also achieve a better solution in construction of scalability, feasibility and energy efficiency in a large-scale wireless sensor network.
40
Liao, Shao-Han, and 廖紹涵. "AN ENERGY-AWARE ROUTING PROTOCOL FOR ZIGBEE WIRELESS SENSOR NETWORKS." Thesis, 2010. http://ndltd.ncl.edu.tw/handle/30656355651951116274.
Full textAbstract:
碩士<br>大同大學<br>通訊工程研究所<br>98<br>ZigBee communication protocol has the characteristics of low cost, low power consumption, small volume, and easy to deployment, therefore it is suitable for wireless sensor networks. Wireless sensor network often need monitoring under the difficult environment for a long time. In these cases, when the sensor nodes are deployed, the batteries of sensor nodes are difficult to replace. In the research of wireless sensor network, how to reduce the power consumption and prolong the lifetime has become a very important issue.
In mesh topology, ZigBee route generally used a simplified version of Ad hoc On-demand Distance Vector (AODV), that is AODV Junior (AODVjr). AODVjr will only choose the fastest reaching path to the destination node, with no consideration of the traffic load, remaining energy and other factors. The data transmission often concentrate on only a small number of routes, with these nodes receiving and forwarding packets frequently and thus exhausting their energy faster than other nodes.
In this thesis, we propose two improved routing algorithms, Minimum Energy AODV (ME-AODV) and Average Energy AODV (AE-AODV). When data transmitting and route discovery are required, the node will consider the residual energy of every route, and choose the route with more residual energy and forward packets. Through the use of the NS-2 simulator, the results show that our protocol can increased the survival time of network nodes and effectively balance the energy consumption for network nodes, thus the network lifetime can be improved.
41
Lin, Yi-Chien, and 林亦謙. "REDRP:A Reactive Energy-Decision Routing Protocol for Wireless Sensor Networks." Thesis, 2004. http://ndltd.ncl.edu.tw/handle/79861447901559473422.
Full textAbstract:
碩士<br>淡江大學<br>資訊工程學系碩士班<br>94<br>The wireless sensor network (WSNs) was extensively deployed and researched for many applications in recently. By taking the advantage of smaller dimension, lower cost and simple structure of the sensor node, the more restrictions come together with sensors. Therefore, the limited power of sensor nodes is the most direct and difficult problem we meet. The limitation on the energy of sensor node makes the bottlenecks for designing the suitable routing protocols. In order to solve the problem of limited energy, the loading of nodes have to be distributed as possible as it can. If the energy consumption can be shared averagely by most nodes, then the lifetime of sensor networks will be enlarged. Thus we propose the routing protocol called Reactive Energy Decision Routing Protocol (REDRP) for sensor networking by considering several representative routing protocols in different structures. This protocol will create the routes in reactive routing method to transmit the data node gathered and the REDRP use the residual energy of nodes as the routing decision for energy-aware. As the results of simulation shows that the more fairness usage of sensor nodes, the total energy consumption of entire network will be distributed fairly by our protocol and the lifetime will also be increased.
42
Lai, Chien-Ku, and 賴建谷. "Cell-Based Data Collection Routing Protocol for Wireless Sensor Networks." Thesis, 2006. http://ndltd.ncl.edu.tw/handle/81227403256836318002.
Full textAbstract:
碩士<br>真理大學<br>數理科學研究所<br>94<br>In wireless sensor network protocols, energy efficiency and full sensing coverage are two important research issues. To prolong the lifetime of network operation, a large number of sensors are randomly deployed in a target area. In case all sensors operate simultaneously, the network will encounter serious collision problem and consume lots of energy. On the contrary, if only small number of sensors operate in a network, there may be some coverage holes exist in the target area. To solve these problems, a hierarchical cellular network architecture constructed based on location information is proposed in this paper, so that the objectives of both low power consumption and full sensing coverage can be achieved. In the proposed network architecture, advantages of intra-cell operations include low power consumption, load balance, and full sensing coverage within each cell. In applications of event detection and periodical report, the proposed inter-cell routing protocol has advantages of low transmission latency and low power consumption due to proper data aggregation operation. According to the simulation results, the proposed protocol outperforms GAF in terms of overall power consumption and transmission latency.
43
Wang, Guan-Ru, and 王冠儒. "Energy Efficient Routing Protocol in Cluster-Based Wireless Sensor Networks." Thesis, 2006. http://ndltd.ncl.edu.tw/handle/92874192378572311521.
Full textAbstract:
碩士<br>元智大學<br>資訊工程學系<br>94<br>Wireless sensor networks (WSNs) are utilized in environment monitoring, traffic surveillance and military situation awareness,...etc. Due to their broad varieties of applications, WSNs have received wide attentions in recent years. Basically, WSN consists of a base station (BS) and a large number of sensor nodes. BS usually provides powerful capabilities for data collection, processing and store. However, each sensor node is limited by its battery power, and is responsible for collecting & transmitting the sensed data only. In order to reduce the energy consumption of the sensor nodes and extend the whole network lifetime, many researchers have proposed the cluster-based routing protocols.
LEACH-C [2] is a well-known paper for cluster-based sensor network. Its routing protocol consists of several rounds, where each round includes the set-up and the steady-state phase. In set-up phase, base station will select the cluster heads (CHs) according to the energy and coordinate information of sensor nodes. In steady-state, each CH will collect the sensed data and transmit to BS directly. However, their methods may make the cluster heads far away from BS to exhaust the energy quickly.
In this paper, we propose an energy efficient routing architecture for WSNs. Our approaches are building 2-stage shortest path tree for routing algorithm, synchronizing the TDMA schedule and adjusting the cluster heads properly. Through simulation, the results show that our protocols are much better than the LEACH-C in terms of efficient energy usage, the network lifetime, and fairness of the energy consumption.
44
Huang, Shih-Kang, and 黃士剛. "A Fault-tolerant Multipath Routing Protocol in Wireless Sensor Networks." Thesis, 2004. http://ndltd.ncl.edu.tw/handle/48887149682505812784.
Full textAbstract:
碩士<br>國立成功大學<br>電機工程學系碩博士班<br>92<br>As the need for applying wireless sensors to military and civil applications increases, the design of a reliable routing protocol that provides robustness and scalability becomes an important issue in wireless sensor networks. Previously proposed approaches were concentrated on only power failures and crash faults. The thesis describes a routing scheme that not only handles crash failures but patterned faults and data processing errors. The fault-tolerant protocol can locally repair broken paths without invoking network-wide route discovery to tolerate failures. The techniques of multipath routing and majority voting are utilized to overcome data processing faults and to increase the reliability of data delivery. The experimental results show that the protocol can efficiently detect and correct errors with little execution overhead.
45
Chang, Chia-Hua, and 張家華. "An Improved Cluster-based Routing Protocol in Wireless Sensor Networks." Thesis, 2008. http://ndltd.ncl.edu.tw/handle/18633380753857834902.
Full textAbstract:
碩士<br>國立屏東科技大學<br>資訊管理系所<br>96<br>The wireless communication has experienced significant changes in the recent past and it will continue to evolve in the foreseeable future. Sensor network is a hot and popular research field in the wireless networks nowadays. Routing protocol is a critical research topic. Recently, a very successful framework named AIMRP (Address-Light Integrated MAC and Routing Protocol) regarding routing protocol in sensor network is proposed. Basically, the AIMRP can employ fewer routes than the other schemes and may obtain test responses very quickly. However, the AIMRP may generate the response on several nodes and must establish several routes individually. Moreover, it may confront with the problem of data burst. To solve this problem, this thesis presents a new cluster-based optimum design of routing protocol based on AIMRP named C-AIMRP. The proposed C-AIMRP algorithm has the advantages of AIMRP and cluster-based routing protocol in wireless sensor networks. According to the simulation results, the proposed routing protocol of C-AIMRP outperforms the existing well-known approaches, such as TTDD and AIMRP in energy consumption comparison for wireless sensor network.
46
Hu, Teng-Tai, and 胡登泰. "Designing a Hierarchy-Based Routing Protocol for Wireless Sensor Networks." Thesis, 2010. http://ndltd.ncl.edu.tw/handle/45756129668431135221.
Full textAbstract:
碩士<br>淡江大學<br>電機工程學系碩士在職專班<br>98<br>In this paper, we present Bidirectional Hierarchy-based Anycast Routing (BHAR), a routing protocol for collecting data over multi-hop. In comparative to HAR, BHAR speeds up and improve the mechanism to construct hierarchical trees and to repair the route. In BHAR, sinks and sources can initial to construct a hierarchical tree. By knowing only its own parent and neighbor, each node in BHAR can join a tree; a tree can learn the routes to a remote sink by exchanging its routes with its neighboring trees, and send data to the nearest sink by intermediate trees; each node can perform route repair without geographical information or being controlled remotely, and perform local network topology optimization simultaneously in order to prevent the impact to the network and to data communication by periodically and conditionally network reconstruction.
We evaluate the performance of BHAR by using VC++ and comparing with those of HAR. The simulation results demonstrate that the average waiting time for a node to join a tree decrease when the number of sinks and sources increase in BHAR. The impact of the increase of the node number and network size to the performance of BHAR is relatively small, which means the scalability is much better. BHAR can endure more nodes to be failed and maintain effective routing operation, which has improve the robustness of BHAR. BHAR achieves much higher performance on route repair in the situation of the unevenly distribution due to different factors.
47
Ju, Guo-Hung, and 朱國宏. "Adaptively Energy-Aware Routing Protocol in Mobile Wireless Sensor Networks." Thesis, 2008. http://ndltd.ncl.edu.tw/handle/74363449478519598706.
Full textAbstract:
碩士<br>元智大學<br>資訊工程學系<br>96<br>Wireless sensor networks are usually consisted of a base station and a large number of sensor nodes. In this research area, most researchers assume that the sensor nodes are static. However, in some applications such as wild animal observation, the sensor nodes may be moveable and such networks are called mobile wireless sensor networks. Due to the mobility, the routing path may be broken and the maintenance mechanisms are needed. Some researchers solve these problems by rerouting or using multipath and their overheads are quite high. In LRR, the authors utilize the broadcast feature and present the local repair mechanism to reduce the maintenance cost. However, they do not consider the balance for energy consumption. In this paper, for improving the LRR, we propose a mechanism for balancing the energy consumption in order to extend the network lifetime.
48
Pan, Guo-Feng, and 潘國豐. "An Energy-aware Backbone Routing Protocol in Wireless Sensor Networks." Thesis, 2007. http://ndltd.ncl.edu.tw/handle/82985181612327211846.
Full textAbstract:
碩士<br>國立屏東教育大學<br>資訊科學系碩士班<br>95<br>In wireless sensor networks, using backbone architecture can increase the routing efficiency, reduce the quantity of the broadcast message, avoid message packets competition and collision, and decrease energy consumption. Therefore, the lifetime of the sensor network can be prolonged by using backbone architecture.
In our thesis, we propose a backbone routing protocol for wireless sensor network. When the node density of the network is high, using backbone architecture can not only find an efficient routing path from a sensor node to the base station, but also reduce the path discovery time. We consider both residual energy and node degree to construct the backbone. By considering residual energy, we can avoid including dangerous nodes in our backbone node set. In order to decrease the number of backbone node, we use the node degree as another criteria. When the residual energy of a backbone node is below the threshold, a backbone reorganization process is executed. In this process, the backbone is only reorganized locally .By using our backbone routing protocol, we can improve the routing efficiency and extend the lifetime of the sensor network. Simulation result shows that our algorithm outperforms previously published results.
49
Juan, Wen-Cheng, and 阮文正. "A Power-saving Implicit Routing Protocol for Wireless Sensor Networks." Thesis, 2012. http://ndltd.ncl.edu.tw/handle/53891687926319371672.
Full textAbstract:
碩士<br>中原大學<br>電子工程研究所<br>100<br>Wireless sensor networks (WSNs) are used to detect environmental information. Then, sensor nodes transmit packets to the sink node by broadcast communication. In wireless sensor networks, flooding scheme is a well-known routing protocol for wireless sensor networks. In addition, flooding scheme can be applied to simplify data transmission in wireless sensor networks. It is not necessary to maintain route information using flooding scheme. Network topology does not affect the transmission scheme also. For high-density wireless sensor networks, redundant transmission is caused and wastes node power and channel bandwidth. This thesis proposes a multi-hop and energy-efficient routing protocol for wireless sensor networks, called Power-saving Implicit Routing Protocol (PSIRP). This protocol is a multi-hop implicit routing protocol. Packets are propagated without knowing the network topologies and establishing route prior, which saves the energy costing on next-hop selection and route establishment. PSIRP saving energy through tow mechanisms. First, sensor nodes can switch to the sleeping state. Second, it uses link-layer-relaying instead of network-layer-forwarding to propagate packets, which saving much energy from controller. The performance of the proposed protocol is simulated and compared with the flooding and gossiping protocol, the well-known implicit routing protocols using in WSNs. The result of analyzing is PSIRP has shorter packet-delay time and prolongs the lifetime more than 142% to the pure flooding and gossiping scheme in our simulation.
50
Fan, Chung-Shuo, and 范崇碩. "Energy Balancing Cluster-based Routing Protocol for Wireless Sensor Networks." Thesis, 2012. http://ndltd.ncl.edu.tw/handle/17706396512774535880.
Full textAbstract:
博士<br>國立中山大學<br>資訊工程學系研究所<br>101<br>Clustering schemes can reduce energy consumption, prolong network lifetime and improve scalability in wireless sensor networks (WSNs). In a typical cluster-based WSN, sensor nodes are organized into clusters. Each cluster elects a cluster head (CH) node. The CH is responsible for collecting the sensed data from cluster members, aggregating data and transmitting data to the sink node via a multi-hop path through intermediate CHs. Thus, the use of cluster techniques not only shortens the transmission distances for sensor nodes but also reduces energy consumption; however, each cluster imposes a larger load on the CH. Under this situation, CHs closer to the sink node tend to use up their batteries faster than those farther away from the sink node due to imbalanced traffics among CHs. To overcome this problem, we contribute to the energy balancing issues in WSNs from two aspects.
In the first work, we first analyze the corona model. Based on analysis results, we found that nearly balanced energy consumption of WSNs can be achieved with the additional help of arranging different initial conditions. We then propose the Energy-balanced Node Deployment with Balanced Energy (END-BE) scheme and Energy-balanced Node Deployment with Maximum Life-Time (END-MLT) scheme, which determine the cluster density for each corona according to the energy consumption of each CH. Simulation results show that energy consumption is nearly balanced by implementing END-BE, and the network lifetime is greatly improved by adopting END-MLT.
In the second work, we development a novel cluster-based routing protocol for corona-structured wireless sensor networks in order to balance the energy consumption among CHs. Based on the relaying traffic of each CH conveys, adequate radius for each corona can be determined through nearly balanced energy depletion analysis, which leads to balanced energy consumption among CHs. Simulation results demonstrate that our clustering approach effectively improves the network lifetime, residual energy and reduces the number of CH rotations in comparison with the Multi-Layer Clustering Routing Algorithm (MLCRA).