37 research outputs found

    DYNAMIC ROUTING WITH CROSS-LAYER ADAPTATIONS FOR MULTI-HOP WIRELESS NETWORKS

    Get PDF
    In recent years there has been a proliferation of research on a number of wireless multi-hop networks that include mobile ad-hoc networks, wireless mesh networks, and wireless sensor networks (WSNs). Routing protocols in such networks are of- ten required to meet design objectives that include a combination of factors such as throughput, delay, energy consumption, network lifetime etc. In addition, many mod- ern wireless networks are equipped with multi-channel radios, where channel selection plays an important role in achieving the same design objectives. Consequently, ad- dressing the routing problem together with cross-layer adaptations such as channel selection is an important issue in such networks. In this work, we study the joint routing and channel selection problem that spans two domains of wireless networks. The first is a cost-effective and scalable wireless-optical access networks which is a combination of high-capacity optical access and unethered wireless access. The joint routing and channel selection problem in this case is addressed under an anycasting paradigm. In addition, we address two other problems in the context of wireless- optical access networks. The first is on optimal gateway placement and network planning for serving a given set of users. And the second is the development of an analytical model to evaluate the performance of the IEEE 802.11 DCF in radio-over- fiber wireless LANs. The second domain involves resource constrained WSNs where we focus on route and channel selection for network lifetime maximization. Here, the problem is further exacerbated by distributed power control, that introduces addi- tional design considerations. Both problems involve cross-layer adaptations that must be solved together with routing. Finally, we present an analytical model for lifetime calculation in multi-channel, asynchronous WSNs under optimal power control

    QoS BASED ENERGY EFFICIENT ROUTING IN WIRELESS SENSOR NETWORK

    Get PDF
    A Wireless Sensor Networks (WSN) is composed of a large number of low-powered sensor nodes that are randomly deployed to collect environmental data. In a WSN, because of energy scarceness, energy efficient gathering of sensed information is one of the most critical issues. Thus, most of the WSN routing protocols found in the literature have considered energy awareness as a key design issue. Factors like throughput, latency and delay are not considered as critical issues in these protocols. However, emerging WSN applications that involve multimedia and imagining sensors require end-to-end delay within acceptable limits. Hence, in addition to energy efficiency, the parameters (delay, packet loss ratio, throughput and coverage) have now become issues of primary concern. Such performance metrics are usually referred to as the Quality of Service (QoS) in communication systems. Therefore, to have efficient use of a sensor node’s energy, and the ability to transmit the imaging and multimedia data in a timely manner, requires both a QoS based and energy efficient routing protocol. In this research work, a QoS based energy efficient routing protocol for WSN is proposed. To achieve QoS based energy efficient routing, three protocols are proposed, namely the QoS based Energy Efficient Clustering (QoSEC) for a WSN, the QoS based Energy Efficient Sleep/Wake Scheduling (QoSES) for a WSN, and the QoS based Energy Efficient Mobile Sink (QoSEM) based Routing for a Clustered WSN. Firstly, in the QoSEC, to achieve energy efficiency and to prolong network/coverage lifetime, some nodes with additional energy resources, termed as super-nodes, in addition to normal capability nodes, are deployed. Multi-hierarchy clustering is done by having super-nodes (acting as a local sink) at the top tier, cluster head (normal node) at the middle tier, and cluster member (normal node) at the lowest tier in the hierarchy. Clustering within normal sensor nodes is done by optimizing the network/coverage lifetime through a cluster-head-selection algorithm and a sleep/wake scheduling algorithm. QoSEC resolves the hot spot problem and prolongs network/coverage lifetime. Secondly, the QoSES addressed the delay-minimization problem in sleep/wake scheduling for event-driven sensor networks for delay-sensitive applications. For this purpose, QoSES assigns different sleep/wake intervals (longer wake interval) to potential overloaded nodes, according to their varied traffic load requirement defined a) by node position in the network, b) by node topological importance, and c) by handling burst traffic in the proximity of the event occurrence node. Using these heuristics, QoSES minimizes the congestion at nodes having heavy traffic loads and ultimately reduces end-to-end delay while maximizing the throughput. Lastly, the QoSEM addresses hot spot problem, delay minimization, and QoS assurance. To address hot-spot problem, mobile sink is used, that move in the network to gather data by virtue of which nodes near to the mobile sink changes with each movement, consequently hot spot problem is minimized. To achieve delay minimization, static sink is used in addition to the mobile sink. Delay sensitive data is forwarded to the static sink, while the delay tolerant data is sent through the mobile sink. For QoS assurance, incoming traffic is divided into different traffic classes and each traffic class is assigned different priority based on their QoS requirement (bandwidth, delay) determine by its message type and content. Furthermore, to minimize delay in mobile sink data gathering, the mobile sink is moved throughout the network based on the priority messages at the nodes. Using these heuristics, QoSEM incur less end-to-end delay, is energy efficient, as well as being able to ensure QoS. Simulations are carried out to evaluate the performance of the proposed protocols of QoSEC, QoSES and QoSEM, by comparing their performance with the established contemporary protocols. Simulation results have demonstrated that when compared with contemporary protocols, each of the proposed protocol significantly prolong the network and coverage lifetime, as well as improve the other QoS routing parameters, such as delay, packet loss ratio, and throughput

    Information distribution and recharging dispatch strategy in large wireless networks

    Get PDF
    Large wireless networks are envisioned to play increasingly important roles as more and more mobile wireless devices and Internet of Things (IoT) devices are put in use. In these networks, it is often the case that some critical information needs to be readily accessible, requiring a careful design of the information distribution technique. In this work, we at first propose PeB, Periodic Broadcast, that takes advantage of periodic broadcast from the information server(s) to leave traces for nodes requesting for the information while maintaining a low overhead. Similar to swarm intelligence, PeB requires each node to keep track of traces, or past records of information flow, through itself toward information servers. We present our extensive investigation of the PeB scheme on cost and network dynamics as compared to other state-of-the-art techniques. When the devices run out of battery, they become static and need to be recharged by the wireless charging vehicles (WCVs). Often times, WCV receives a number of charging requests and form a Hamiltonian cycle and visit these nodes one-by-one. We also propose a heuristic algorithm, termed Quad, that generates a Hamiltonian cycle in a square plane. We then focus on the theoretical study of the length of the Hamiltonian cycles in such networks

    QoS BASED ENERGY EFFICIENT ROUTING IN WIRELESS SENSOR NETWORK

    Get PDF
    A Wireless Sensor Networks (WSN) is composed of a large number of low-powered sensor nodes that are randomly deployed to collect environmental data. In a WSN, because of energy scarceness, energy efficient gathering of sensed information is one of the most critical issues. Thus, most of the WSN routing protocols found in the literature have considered energy awareness as a key design issue. Factors like throughput, latency and delay are not considered as critical issues in these protocols. However, emerging WSN applications that involve multimedia and imagining sensors require end-to-end delay within acceptable limits. Hence, in addition to energy efficiency, the parameters (delay, packet loss ratio, throughput and coverage) have now become issues of primary concern. Such performance metrics are usually referred to as the Quality of Service (QoS) in communication systems. Therefore, to have efficient use of a sensor node’s energy, and the ability to transmit the imaging and multimedia data in a timely manner, requires both a QoS based and energy efficient routing protocol. In this research work, a QoS based energy efficient routing protocol for WSN is proposed. To achieve QoS based energy efficient routing, three protocols are proposed, namely the QoS based Energy Efficient Clustering (QoSEC) for a WSN, the QoS based Energy Efficient Sleep/Wake Scheduling (QoSES) for a WSN, and the QoS based Energy Efficient Mobile Sink (QoSEM) based Routing for a Clustered WSN. Firstly, in the QoSEC, to achieve energy efficiency and to prolong network/coverage lifetime, some nodes with additional energy resources, termed as super-nodes, in addition to normal capability nodes, are deployed. Multi-hierarchy clustering is done by having super-nodes (acting as a local sink) at the top tier, cluster head (normal node) at the middle tier, and cluster member (normal node) at the lowest tier in the hierarchy. Clustering within normal sensor nodes is done by optimizing the network/coverage lifetime through a cluster-head-selection algorithm and a sleep/wake scheduling algorithm. QoSEC resolves the hot spot problem and prolongs network/coverage lifetime. Secondly, the QoSES addressed the delay-minimization problem in sleep/wake scheduling for event-driven sensor networks for delay-sensitive applications. For this purpose, QoSES assigns different sleep/wake intervals (longer wake interval) to potential overloaded nodes, according to their varied traffic load requirement defined a) by node position in the network, b) by node topological importance, and c) by handling burst traffic in the proximity of the event occurrence node. Using these heuristics, QoSES minimizes the congestion at nodes having heavy traffic loads and ultimately reduces end-to-end delay while maximizing the throughput. Lastly, the QoSEM addresses hot spot problem, delay minimization, and QoS assurance. To address hot-spot problem, mobile sink is used, that move in the network to gather data by virtue of which nodes near to the mobile sink changes with each movement, consequently hot spot problem is minimized. To achieve delay minimization, static sink is used in addition to the mobile sink. Delay sensitive data is forwarded to the static sink, while the delay tolerant data is sent through the mobile sink. For QoS assurance, incoming traffic is divided into different traffic classes and each traffic class is assigned different priority based on their QoS requirement (bandwidth, delay) determine by its message type and content. Furthermore, to minimize delay in mobile sink data gathering, the mobile sink is moved throughout the network based on the priority messages at the nodes. Using these heuristics, QoSEM incur less end-to-end delay, is energy efficient, as well as being able to ensure QoS. Simulations are carried out to evaluate the performance of the proposed protocols of QoSEC, QoSES and QoSEM, by comparing their performance with the established contemporary protocols. Simulation results have demonstrated that when compared with contemporary protocols, each of the proposed protocol significantly prolong the network and coverage lifetime, as well as improve the other QoS routing parameters, such as delay, packet loss ratio, and throughput

    SRP-HEE: A Modified Stateless Routing Protocol based on Homomorphic Energy based Encryption for Wireless Sensor Network

    Get PDF
    Due to the wireless nature, the sensors node data are prone to location privacy of source and classification of the packet by unauthorized parties. Data encryption is one of the most effective ways to thwart unauthorized access to the data and trace information. Traditional wireless network security solutions are not viable for WSNs In this paper, a novel distributed forward aware factor based heuristics towards generating greedy routing using stateless routing is SRP-HEE for wireless sensor network. The model employs the homomorphic Energy based encryption technique. Energy based Encryption model is devoted as homomorphic mechanism due to their less computational complexity. Additionally, privacy constraint becoming a critical issue in the wireless sensor networks (WSNs) because sensor nodes are generally prone to attacks which deplete energy quickly as it is exposed to mobile sink frequently for data transmission. Through inclusion of the Forward aware factor on the Greedy routing strategies, it is possible to eliminate the attacking node which is depleting the energy of the source node. Heuristic conditions are used for optimizing the sampling rate and battery level for tackling the battery capacity constraints of the wireless sensor nodes. The Node characteristics of the propagating node have been analysed utilizing kalman filter and linear regression. The cooperative caching of the network information will enable to handle the fault condition by changing the privacy level of the network. The Simulation results demonstrate that SRP-HEE model outperforms existing technique on basis of Latency, Packet Delivery Ratio, Network Overhead, and Energy Utilization of nodes

    Design and stochastic analysis of emerging large-scale wireless-powered sensor networks

    Get PDF
    Undeniably, the progress in wireless networks during the last two decades is extraordinary. However, the ever-increasing upward trend in the numbers of wireless devices that will overwhelm every field of our everyday life, e.g., building automation, traffic management, health-care, etc., will introduce several issues in terms of communication and energy provision that need to be handled in advance. Regarding the communication issues, it is imperative to ensure the correct operation of the vast collection of nodes, especially for life-critical applications. Two well-known metrics that can characterize sufficiently the network reliability are the coverage and the connectivity probability that are derived by taking into account the network topology, the channel conditions between every transmitter-receiver pair, and the interference from other nodes. Nevertheless, considering all those factors is not straightforward. Lately, stochastic geometry has come into prominence, which is a mathematical tool to study the average network performance over many spatial realizations, while considering all aforementioned factors. Moreover, the other crucial issue for the large-scale dense network deployments of the future is their energy supply. Traditional battery charging or swapping for the wireless devices is both inconvenient and harms the environment, especially if we take into account the enormous numbers of nodes. Therefore, novel solutions have to be found using renewable energy sources to zero down the significant electricity consumption. Wireless energy harvesting is a convenient and environmentally-friendly approach to prolong the lifetime of networks by harvesting the energy from radio-frequency (RF) signals and converting it to direct current electricity through specialized hardware. The RF energy could be harvested from signals generated in the same or other networks. However, if the amount of harvested energy is not sufficient, solar-powered dedicated transmitters could be employed. In this way, we can achieve a favorable outcome by having both a zero-energy network operation and convenience in the charging of the wireless devices. Still, extensive investigation should be done in order to ensure that the communication performance is not affected. To that end, in this thesis, we study the communication performance in large-scale networks using tools from stochastic geometry. The networks that we study comprise wireless devices that are able to harvest the energy of RF signals. In the first part of the thesis, we present the effects of wireless energy harvesting from the transmissions of the cooperative network on the coverage probability and the network lifetime. In the second part of the thesis, we first employ batteryless nodes that are powered by dedicated RF energy transmitters to study the connectivity probability. Then, we assume that the dedicated transmitters are powered by solar energy to study the connectivity in a clustered network and investigate, for the first time, the reliability of zero-energy networks. Finally, we conclude the thesis by providing insightful research challenges for future works.Innegablemente, el progreso en las redes inalámbricas durante las últimas dos décadas es extraordinario. Sin embargo, la creciente tendencia al alza en el número de dispositivos inalámbricos que abarcarán todos los ámbitos de nuestra vida cotidiana, como la automatización de edificios, la gestión del tráfico, la atención sanitaria, etc., introducirá varias cuestiones en términos de comunicación y suministro de energía que se debe tener en cuenta con antelación. Respecto a los problemas de comunicación, es imprescindible asegurar el correcto funcionamiento de la vasta colección de nodos, especialmente para las aplicaciones vitales. Dos métricas bien conocidas que pueden caracterizar suficientemente la fiabilidad de la red son la probabilidad de cobertura y la de conectividad, que se derivan teniendo en cuenta la topología de la red, las condiciones del canal entre cada par transmisor-receptor y la interferencia de otros nodos. Sin embargo, considerar todos esos factores no es sencillo. Últimamente, la geometría estocástica ha llegado a la prominencia como un metodo de análisis, que es una herramienta matemática para estudiar el rendimiento promedio de la red sobre muchas realizaciones espaciales, teniendo en cuenta todos los factores mencionados. Además, la otra cuestión crucial para los despliegues de alta densidad de las redes futuras es su suministro de energía. La carga o el intercambio de baterías para los dispositivos inalámbricos es inconveniente y daña el medio ambiente, especialmente si tenemos en cuenta el enorme número de nodos utilizados. Por lo tanto, se deben encontrar nuevas soluciones utilizando fuentes de energía renovables para reducir el consumo de electricidad. La recolección de energía inalámbrica es un método conveniente y respetuoso con el medio ambiente para prolongar la vida útil de las redes recolectando la energía de las señales de radiofrecuencia (RF) y convirtiéndola en electricidad de corriente continua mediante un hardware especializado. La energía de RF podría ser obtenida a partir de señales generadas en la misma o en otras redes. Sin embargo, si la cantidad de energía obtenida no es suficiente, podrían emplearse transmisores de energía inalambricos que la obtuvieran mediante paneles fotovoltaicos. De esta manera, podemos lograr un resultado favorable teniendo tanto una operación de red de energía cero como una conveniencia en la carga de los dispositivos inalámbricos. Por lo tanto, una investigación exhaustiva debe hacerse con el fin de garantizar que el rendimiento de la comunicación no se ve afectada. En esta tesis se estudia el rendimiento de la comunicación en redes de gran escala utilizando técnicas de geometría estocástica. Las redes que se estudian comprenden dispositivos inalámbricos capaces de recoger la energía de las señales RF. En la primera parte de la tesis, presentamos los efectos de la recolección de energía inalámbrica de las transmisiones de la red cooperativa sobre la probabilidad de cobertura y la vida útil de la red. En la segunda parte de la tesis, primero empleamos nodos sin baterías que son alimentados por transmisores de energía de RF para estudiar la probabilidad de conectividad. A continuación, asumimos que los transmisores dedicados son alimentados por energía solar para estudiar la conectividad en una red agrupada (clustered network) e investigar, por primera vez, la fiabilidad de las redes de energía cero. Finalmente, concluimos la tesis aportando nuevas lineas de investigación para trabajos futuro

    Design and stochastic analysis of emerging large-scale wireless-powered sensor networks

    Get PDF
    Premi Extraordinari de Doctorat, promoció 2016-2017. Àmbit d’Enginyeria de les TICUndeniably, the progress in wireless networks during the last two decades is extraordinary. However, the ever-increasing upward trend in the numbers of wireless devices that will overwhelm every field of our everyday life, e.g., building automation, traffic management, health-care, etc., will introduce several issues in terms of communication and energy provision that need to be handled in advance. Regarding the communication issues, it is imperative to ensure the correct operation of the vast collection of nodes, especially for life-critical applications. Two well-known metrics that can characterize sufficiently the network reliability are the coverage and the connectivity probability that are derived by taking into account the network topology, the channel conditions between every transmitter-receiver pair, and the interference from other nodes. Nevertheless, considering all those factors is not straightforward. Lately, stochastic geometry has come into prominence, which is a mathematical tool to study the average network performance over many spatial realizations, while considering all aforementioned factors. Moreover, the other crucial issue for the large-scale dense network deployments of the future is their energy supply. Traditional battery charging or swapping for the wireless devices is both inconvenient and harms the environment, especially if we take into account the enormous numbers of nodes. Therefore, novel solutions have to be found using renewable energy sources to zero down the significant electricity consumption. Wireless energy harvesting is a convenient and environmentally-friendly approach to prolong the lifetime of networks by harvesting the energy from radio-frequency (RF) signals and converting it to direct current electricity through specialized hardware. The RF energy could be harvested from signals generated in the same or other networks. However, if the amount of harvested energy is not sufficient, solar-powered dedicated transmitters could be employed. In this way, we can achieve a favorable outcome by having both a zero-energy network operation and convenience in the charging of the wireless devices. Still, extensive investigation should be done in order to ensure that the communication performance is not affected. To that end, in this thesis, we study the communication performance in large-scale networks using tools from stochastic geometry. The networks that we study comprise wireless devices that are able to harvest the energy of RF signals. In the first part of the thesis, we present the effects of wireless energy harvesting from the transmissions of the cooperative network on the coverage probability and the network lifetime. In the second part of the thesis, we first employ batteryless nodes that are powered by dedicated RF energy transmitters to study the connectivity probability. Then, we assume that the dedicated transmitters are powered by solar energy to study the connectivity in a clustered network and investigate, for the first time, the reliability of zero-energy networks. Finally, we conclude the thesis by providing insightful research challenges for future works.Innegablemente, el progreso en las redes inalámbricas durante las últimas dos décadas es extraordinario. Sin embargo, la creciente tendencia al alza en el número de dispositivos inalámbricos que abarcarán todos los ámbitos de nuestra vida cotidiana, como la automatización de edificios, la gestión del tráfico, la atención sanitaria, etc., introducirá varias cuestiones en términos de comunicación y suministro de energía que se debe tener en cuenta con antelación. Respecto a los problemas de comunicación, es imprescindible asegurar el correcto funcionamiento de la vasta colección de nodos, especialmente para las aplicaciones vitales. Dos métricas bien conocidas que pueden caracterizar suficientemente la fiabilidad de la red son la probabilidad de cobertura y la de conectividad, que se derivan teniendo en cuenta la topología de la red, las condiciones del canal entre cada par transmisor-receptor y la interferencia de otros nodos. Sin embargo, considerar todos esos factores no es sencillo. Últimamente, la geometría estocástica ha llegado a la prominencia como un metodo de análisis, que es una herramienta matemática para estudiar el rendimiento promedio de la red sobre muchas realizaciones espaciales, teniendo en cuenta todos los factores mencionados. Además, la otra cuestión crucial para los despliegues de alta densidad de las redes futuras es su suministro de energía. La carga o el intercambio de baterías para los dispositivos inalámbricos es inconveniente y daña el medio ambiente, especialmente si tenemos en cuenta el enorme número de nodos utilizados. Por lo tanto, se deben encontrar nuevas soluciones utilizando fuentes de energía renovables para reducir el consumo de electricidad. La recolección de energía inalámbrica es un método conveniente y respetuoso con el medio ambiente para prolongar la vida útil de las redes recolectando la energía de las señales de radiofrecuencia (RF) y convirtiéndola en electricidad de corriente continua mediante un hardware especializado. La energía de RF podría ser obtenida a partir de señales generadas en la misma o en otras redes. Sin embargo, si la cantidad de energía obtenida no es suficiente, podrían emplearse transmisores de energía inalambricos que la obtuvieran mediante paneles fotovoltaicos. De esta manera, podemos lograr un resultado favorable teniendo tanto una operación de red de energía cero como una conveniencia en la carga de los dispositivos inalámbricos. Por lo tanto, una investigación exhaustiva debe hacerse con el fin de garantizar que el rendimiento de la comunicación no se ve afectada. En esta tesis se estudia el rendimiento de la comunicación en redes de gran escala utilizando técnicas de geometría estocástica. Las redes que se estudian comprenden dispositivos inalámbricos capaces de recoger la energía de las señales RF. En la primera parte de la tesis, presentamos los efectos de la recolección de energía inalámbrica de las transmisiones de la red cooperativa sobre la probabilidad de cobertura y la vida útil de la red. En la segunda parte de la tesis, primero empleamos nodos sin baterías que son alimentados por transmisores de energía de RF para estudiar la probabilidad de conectividad. A continuación, asumimos que los transmisores dedicados son alimentados por energía solar para estudiar la conectividad en una red agrupada (clustered network) e investigar, por primera vez, la fiabilidad de las redes de energía cero. Finalmente, concluimos la tesis aportando nuevas lineas de investigación para trabajos futurosAward-winningPostprint (published version

    The design of a simple energy efficient routing protocol to improve wireless sensor network lifetime

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

    Medium Access Control in Energy Harvesting - Wireless Sensor Networks

    Get PDF

    5. GI/ITG KuVS Fachgespräch "Drahtlose Sensornetze"

    Get PDF
    These are the proceedings of the 5th GI/ITG KuVS Fachgespräch “Drahtlose Sensornetze” (expert talk on wireless sensor networks) held at the Universität Stuttgart in July, 2006. The program included among others papers on sensor network hardware, routing, middleware, localization, programming abstractions and modelling. While the presentations were given in German most of the papers are in English.Dies sind die Proceedings des 5. GI/ITG KuVS Fachgespräch „Drahtlose Sensornetze“, welches im Juli 2006 an der Universität Stuttgart stattgefunden hat. Das Programm spannte einen Bogen von der Hardware über die Themen Routing, Middleware und Lokalisierung bis hin zu Programmierabstraktionen und Modellierung
    corecore