1,052 research outputs found

    Routing efficiency in wireless sensor-actor networks considering semi-automated architecture

    Get PDF
    Wireless networks have become increasingly popular and advances in wireless communications and electronics have enabled the development of different kind of networks such as Mobile Ad-hoc Networks (MANETs), Wireless Sensor Networks (WSNs) and Wireless Sensor-Actor Networks (WSANs). These networks have different kind of characteristics, therefore new protocols that fit their features should be developed. We have developed a simulation system to test MANETs, WSNs and WSANs. In this paper, we consider the performance behavior of two protocols: AODV and DSR using TwoRayGround model and Shadowing model for lattice and random topologies. We study the routing efficiency and compare the performance of two protocols for different scenarios. By computer simulations, we found that for large number of nodes when we used TwoRayGround model and random topology, the DSR protocol has a better performance. However, when the transmission rate is higher, the routing efficiency parameter is unstable.Peer ReviewedPostprint (published version

    Performance evaluation of wireless sensor networks for mobile event and mobile sink

    Get PDF
    Extending lifetime and energy efficiency are important objectives and challenges in-Wireless Sensor Networks (WSNs). In large scale WSNs, when the nodes are near to the sink they consume much more energy than the nodes far from the sink. In our previous work, we considered that the sink node was stationary and only event node was moving in the observation field. In this work, we consider both cases when the sink node and event node are moving. For the simulations, we use TwoRayGround and Shadowing radio models, lattice topology and AODV protocol. We compare the simulation results for the cases when the sink node and event node are mobile and stationary. The simulation results have shown that the goodput of TwoRayGround is better than Shadowing in case of mobile event, but the depletion of Shadowing is better than TwoRayGround in case of mobile event. The goodput in case of mobile sink is better than stationary sink when the transmission rate is lower than 10pps. For TwoRayGround radio model, the depletion in case of mobile sink is better than stationary sink when the number of nodes is increasedPeer ReviewedPostprint (published version

    Performance Comparison of the RPL and LOADng Routing Protocols in a Home Automation Scenario

    Full text link
    RPL, the routing protocol proposed by IETF for IPv6/6LoWPAN Low Power and Lossy Networks has significant complexity. Another protocol called LOADng, a lightweight variant of AODV, emerges as an alternative solution. In this paper, we compare the performance of the two protocols in a Home Automation scenario with heterogenous traffic patterns including a mix of multipoint-to-point and point-to-multipoint routes in realistic dense non-uniform network topologies. We use Contiki OS and Cooja simulator to evaluate the behavior of the ContikiRPL implementation and a basic non-optimized implementation of LOADng. Unlike previous studies, our results show that RPL provides shorter delays, less control overhead, and requires less memory than LOADng. Nevertheless, enhancing LOADng with more efficient flooding and a better route storage algorithm may improve its performance

    Multi-hop optimal position based opportunistic routing for wireless sensor networks

    Get PDF
    Wireless sensor network is a collection of a group of sensors connected to monitor an area of interest. Installation flexibility, mobility, reduced cost and scalability have given popularity to wireless sensor networks. Opportunistic routing is a routing protocol that takes the advantage of broadcasting nature of wireless sensor network for multi-hop communication. Considering the importance of communication between source-destination pairs in a wireless sensor network a Multi-hop Optimal position based Opportunistic Routing (MOOR) protocol is proposed in this paper. The algorithm chooses the path with minimum distance and number of hops between source and destination for transmission of data in the network. It is illustrated by simulation experiments that the proposed protocol has a good effect on End-to-End delay and lifetime of the network. In addition, it is observed that the average End-to-End delay is lesser for different simulation times when compared with existing EEOR protocol

    Pheromone-based In-Network Processing for wireless sensor network monitoring systems

    Get PDF
    Monitoring spatio-temporal continuous fields using wireless sensor networks (WSNs) has emerged as a novel solution. An efficient data-driven routing mechanism for sensor querying and information gathering in large-scale WSNs is a challenging problem. In particular, we consider the case of how to query the sensor network information with the minimum energy cost in scenarios where a small subset of sensor nodes has relevant readings. In order to deal with this problem, we propose a Pheromone-based In-Network Processing (PhINP) mechanism. The proposal takes advantages of both a pheromone-based iterative strategy to direct queries towards nodes with relevant information and query- and response-based in-network filtering to reduce the number of active nodes. Additionally, we apply reinforcement learning to improve the performance. The main contribution of this work is the proposal of a simple and efficient mechanism for information discovery and gathering. It can reduce the messages exchanged in the network, by allowing some error, in order to maximize the network lifetime. We demonstrate by extensive simulations that using PhINP mechanism the query dissemination cost can be reduced by approximately 60% over flooding, with an error below 1%, applying the same in-network filtering strategy.Fil: Riva, Guillermo Gaston. Universidad Nacional de Córdoba. Facultad de Ciencias Exactas, Físicas y Naturales; Argentina. Universidad Tecnológica Nacional; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Córdoba; ArgentinaFil: Finochietto, Jorge Manuel. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Córdoba. Instituto de Estudios Avanzados en Ingeniería y Tecnología. Universidad Nacional de Córdoba. Facultad de Ciencias Exactas Físicas y Naturales. Instituto de Estudios Avanzados en Ingeniería y Tecnología; Argentin

    Time constrained fault tolerance and management framework for k-connected distributed wireless sensor networks based on composite event detection

    Get PDF
    Wireless sensor nodes themselves are exceptionally complex systems where a variety of components interact in a complex way. In enterprise scenarios it becomes highly important to hide the details of the underlying sensor networks from the applications and to guarantee a minimum level of reliability of the system. One of the challenges faced to achieve this level of reliability is to overcome the failures frequently faced by sensor networks due to their tight integration with the environment. Failures can generate false information, which may trigger incorrect business processes, resulting in additional costs. Sensor networks are inherently fault prone due to the shared wireless communication medium. Thus, sensor nodes can lose synchrony and their programs can reach arbitrary states. Since on-site maintenance is not feasible, sensor network applications should be local and communication-efficient self-healing. Also, as per my knowledge, no such general framework exist that addresses all the fault issues one may encounter in a WSN, based on the extensive, exhaustive and comprehensive literature survey in the related areas of research. As one of the main goals of enterprise applications is to reduce the costs of business processes, a complete and more general Fault Tolerance and management framework for a general WSN, irrespective of the node types and deployment conditions is proposed which would help to mitigate the propagation of failures in a business environment, reduce the installation and maintenance costs and to gain deployment flexibility to allow for unobtrusive installation
    corecore