67 research outputs found

    All-IP wireless sensor networks for real-time patient monitoring

    Get PDF
    AbstractThis paper proposes the all-IP WSNs (wireless sensor networks) for real-time patient monitoring. In this paper, the all-IP WSN architecture based on gateway trees is proposed and the hierarchical address structure is presented. Based on this architecture, the all-IP WSN can perform routing without route discovery. Moreover, a mobile node is always identified by a home address and it does not need to be configured with a care-of address during the mobility process, so the communication disruption caused by the address change is avoided. Through the proposed scheme, a physician can monitor the vital signs of a patient at any time and at any places, and according to the IPv6 address he can also obtain the location information of the patient in order to perform effective and timely treatment. Finally, the proposed scheme is evaluated based on the simulation, and the simulation data indicate that the proposed scheme might effectively reduce the communication delay and control cost, and lower the packet loss rate

    Unified Theory of Relativistic Identification of Information in a Systems Age: Proposed Convergence of Unique Identification with Syntax and Semantics through Internet Protocol version 6

    Get PDF
    Unique identification of objects are helpful to the decision making process in many domains. Decisions, however, are often based on information that takes into account multiple factors. Physical objects and their unique identification may be one of many factors. In real-world scenarios, increasingly decisions are based on collective information gathered from multiple sources (or systems) and then combined to a higher level domain that may trigger a decision or action. Currently, we do not have a globally unique mechanism to identify information derived from data originating from objects and processes. Unique identification of information, hence, is an open question. In addition, information, to be of value, must be related to the context of the process. In general, contextual information is of greater relevance in the decision making process or in decision support systems. In this working paper, I shall refer to such information as decisionable information. The suggestion here is to utilize the vast potential of internet protocol version six (IPv6) to uniquely identify not only objects and processes but also relationships (semantics) and interfaces (sensors). Convergence of identification of diverse entities using the globally agreed structure of IPv6 offers the potential to identify 3.4x10[subscript 38] instances based on the fact that the 128-bit IPv6 structure can support 3.4x10[subscript 38] unique addresses. It is not necessary that all instances must be connected to the internet or routed or transmitted simply because an IP addressing scheme is suggested. This is a means for identification that will be globally unique and offers the potential to be connected or routed via the internet. In this working paper, scenarios offer [1] new revenue potential from data routing (P2P traffic track and trace) for telecommunication industries, [2] potential for use in healthcare and biomedical community, [3] scope of use in the semantic web structure by transitioning URIs used in RDF, [4] applications involving thousands of mobile ad hoc sensors (MANET) that demand dynamic adaptive auto-reconfiguration. This paper presents a confluence of ideas

    Internet protocol over wireless sensor networks, from myth to reality

    Get PDF
    Internet Protocol (IP) is a standard network layer protocol of the Internet architecture, allowing communication among heterogeneous networks. For a given network to be accessible from the Internet it must have a router that complies with this protocol. Wireless sensor networks have many smart sensing nodes with computational, communication and sensing capabilities. Such smart sensors cooperate to gather relevant data and present it to the user. The connection of sensor networks and the Internet has been realized using gateway or proxy- based approaches. Historically, several routing protocols were specifically created, discarding IP. However, recent research, prototypes and even implementation tools show that it is possible to combine the advantages of IP access with sensor networks challenges, with a major contribution from the 6LoWPAN Working Group. This paper presents the advantages and challenges of IP on sensor networks, surveys the state-of-art with some implementation examples, and points further research topics in this area

    VSRS: Variable Service Rate Scheduler for Low Rate Wireless Sensor Networks

    Get PDF
    This paper proposes a variable service rate scheduler VSRS for heterogeneous wireless sensor and actuator networks (WSANs). Due to recent advancement, various applications are being upgraded using sensor networks. Generally, traffic consists of delay sensitive and delay tolerant applications. Handling such traffic simultaneously is a critical challenge in IEEE 802.15.4 sensor network. However, the standard CSMA/CA does not focus on traffic-based data delivery. Therefore, this paper presents a solution for prioritybased traffic over no-priority i.e. regular traffic using CSMA/CA IEEE 802.15.4 MAC sublayer. The VSRS scheduler uses a queuing model for scheduling incoming traffic at an actor node using a dual queue. The scheduler updates priority of each incoming packet dynamically using network priority weight metric. The VSRS scheduler scans queues and picks the highest network priority packet. A packet weight is updated after selection from the respective queue. This core operation of an actor node offers good packet delivery ratio, throughput, and less delay experience of long distance traveled packets against no priority traffic. The work is validated using theoretical analysis and computer generated network simulators; proves that the priority based approach using weight factor works better over the First-Come-First-Serve (FCFS) mechanism

    A COMMUNICATION FRAMEWORK FOR MULTIHOP WIRELESS ACCESS AND SENSOR NETWORKS: ANYCAST ROUTING & SIMULATION TOOLS

    Get PDF
    The reliance on wireless networks has grown tremendously within a number of varied application domains, prompting an evolution towards the use of heterogeneous multihop network architectures. We propose and analyze two communication frameworks for such networks. A first framework is designed for communications within multihop wireless access networks. The framework supports dynamic algorithms for locating access points using anycast routing with multiple metrics and balancing network load. The evaluation shows significant performance improvement over traditional solutions. A second framework is designed for communication within sensor networks and includes lightweight versions of our algorithms to fit the limitations of sensor networks. Analysis shows that this stripped down version can work almost equally well if tailored to the needs of a sensor network. We have also developed an extensive simulation environment using NS-2 to test realistic situations for the evaluations of our work. Our tools support analysis of realistic scenarios including the spreading of a forest fire within an area, and can easily be ported to other simulation software. Lastly, we us our algorithms and simulation environment to investigate sink movements optimization within sensor networks. Based on these results, we propose strategies, to be addressed in follow-on work, for building topology maps and finding optimal data collection points. Altogether, the communication framework and realistic simulation tools provide a complete communication and evaluation solution for access and sensor 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

    Delay Contributing Factors and Strategies Towards Its Minimization in IoT

    Get PDF
    Internet of Things (IoT) refers to various interconnected devices, typically supplied with limited computational and communication resources. Most of the devices are designed to operate with limited memory and processing capability, low bandwidth, short range and other characteristics of low cost hardware. The resulting networks are exposed to traffic loss and prone to other vulnerabilities. One of the major concerns is to ensure that the network communication among these deployed devices remains at required level of Quality of Service (QoS) of different IoT applications. The purpose of this paper is to highlight delay contributing factors in Low Power and Lossy Networks (LLNs) since providing low end-to-end delay is a crucial issue in IoT environment especially for mission critical applications. Various research efforts in relevance to this aspect are then presente

    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
    corecore