2,725 research outputs found

    Hierarchical routing protocols for wireless sensor network: a compressive survey

    Get PDF
    Wireless Sensor Networks (WSNs) are one of the key enabling technologies for the Internet of Things (IoT). WSNs play a major role in data communications in applications such as home, health care, environmental monitoring, smart grids, and transportation. WSNs are used in IoT applications and should be secured and energy efficient in order to provide highly reliable data communications. Because of the constraints of energy, memory and computational power of the WSN nodes, clustering algorithms are considered as energy efficient approaches for resource-constrained WSNs. In this paper, we present a survey of the state-of-the-art routing techniques in WSNs. We first present the most relevant previous work in routing protocols surveys then highlight our contribution. Next, we outline the background, robustness criteria, and constraints of WSNs. This is followed by a survey of different WSN routing techniques. Routing techniques are generally classified as flat, hierarchical, and location-based routing. This survey focuses on the deep analysis of WSN hierarchical routing protocols. We further classify hierarchical protocols based on their routing techniques. We carefully choose the most relevant state-of-the-art protocols in order to compare and highlight the advantages, disadvantage and performance issues of each routing technique. Finally, we conclude this survey by presenting a comprehensive survey of the recent improvements of Low-Energy Adaptive Clustering Hierarchy (LEACH) routing protocols and a comparison of the different versions presented in the literature

    A Trustworthy and well-organized data disseminating scheme for ad-hoc wsns

    Full text link
    Wireless Sensor Networks (WSNs) generate massive amount of live data and events sensed through dispersedly deployed tiny sensors. This generated data needed to be disseminate to the sink with slight consumption of network resources. One of the ways to efficiently transmit this bulk data is gossiping. An important consideration in gossip-based dissemination protocols is to keep routing table up to date. Considering the inherent resource constrained nature of adhoc wireless sensor networks, we propose a gossip based protocol that consumes little resources. Our proposed scheme aims to keep the routing table size R as low as possible yet it ensures that the diameter is small too. We learned the performance of our proposed protocol through simulations. Results show that our proposed protocol attains major improvement in network reachability and connectivity.Comment: 12 Pages, IJCNC 201

    Design of implicit routing protocols for large scale mobile wireless sensor networks

    Get PDF
    Strathclyde theses - ask staff. Thesis no. : T13189Most developments in wireless sensor networks (WSNs) routing protocols address static network scenarios. Schemes developed to manage mobility in other mobile networking implementations do not translate effectively to WSNs as the system design parameters are markedly different. Thus this research focuses on the issues of mobility and scalability in order to enable the full potential of WSNs to self-organise and co-operate and in so doing, meet the requirements of a rich mix of applications. In the goal of designing efficient, reliable routing protocols for large scale mobile WSN applications, this work lays the foundation by firstly presenting a strong case supported by extensive simulations, for the use of implicit connections. Then two novel implicit routing protocols - Virtual Grid Paging (VGP) and Virtual Zone Registration and Paging (VZRP) - that treat packet routing from node mobility and network scalability viewpoints are designed and analysed. Implicit routing exploits the connection availability and diversity in the underlying network to provide benefits such as fault tolerance, overhead control and improvement in QoS (Quality of Service) such as delay. Analysis and simulation results show that the proposed protocols guarantee significant improvement, delivering a more reliable, more efficient and better network performance compared with alternatives.Most developments in wireless sensor networks (WSNs) routing protocols address static network scenarios. Schemes developed to manage mobility in other mobile networking implementations do not translate effectively to WSNs as the system design parameters are markedly different. Thus this research focuses on the issues of mobility and scalability in order to enable the full potential of WSNs to self-organise and co-operate and in so doing, meet the requirements of a rich mix of applications. In the goal of designing efficient, reliable routing protocols for large scale mobile WSN applications, this work lays the foundation by firstly presenting a strong case supported by extensive simulations, for the use of implicit connections. Then two novel implicit routing protocols - Virtual Grid Paging (VGP) and Virtual Zone Registration and Paging (VZRP) - that treat packet routing from node mobility and network scalability viewpoints are designed and analysed. Implicit routing exploits the connection availability and diversity in the underlying network to provide benefits such as fault tolerance, overhead control and improvement in QoS (Quality of Service) such as delay. Analysis and simulation results show that the proposed protocols guarantee significant improvement, delivering a more reliable, more efficient and better network performance compared with alternatives

    MSGR: A Mode-Switched Grid-Based Sustainable Routing Protocol for Wireless Sensor Networks

    Full text link
    © 2013 IEEE. A Wireless Sensor Network (WSN) consists of enormous amount of sensor nodes. These sensor nodes sense the changes in physical parameters from the sensing range and forward the information to the sink nodes or the base station. Since sensor nodes are driven with limited power batteries, prolonging the network lifetime is difficult and very expensive, especially for hostile locations. Therefore, routing protocols for WSN must strategically distribute the dissipation of energy, so as to increase the overall lifetime of the system. Current research trends from areas, such as from Internet of Things and fog computing use sensors as the source of data. Therefore, energy-efficient data routing in WSN is still a challenging task for real-Time applications. Hierarchical grid-based routing is an energy-efficient method for routing of data packets. This method divides the sensing area into grids and is advantageous in wireless sensor networks to enhance network lifetime. The network is partitioned into virtual equal-sized grids. The proposed mode-switched grid-based routing protocol for WSN selects one node per grid as the grid head. The routing path to the sink is established using grid heads. Grid heads are switched between active and sleep modes alternately. Therefore, not all grid heads take part in the routing process at the same time. This saves energy in grid heads and improves the network lifetime. The proposed method builds a routing path using each active grid head which leads to the sink. For handling the mobile sink movement, the routing path changes only for some grid head nodes which are nearer to the grid, in which the mobile sink is currently positioned. Data packets generated at any source node are routed directly through the data disseminating grid head nodes on the routing path to the sink

    Sink-oriented Dynamic Location Service Protocol for Mobile Sinks with an Energy Efficient Grid-Based Approach

    Get PDF
    Sensor nodes transmit the sensed information to the sink through wireless sensor networks (WSNs). They have limited power, computational capacities and memory. Portable wireless devices are increasing in popularity. Mechanisms that allow information to be efficiently obtained through mobile WSNs are of significant interest. However, a mobile sink introduces many challenges to data dissemination in large WSNs. For example, it is important to efficiently identify the locations of mobile sinks and disseminate information from multi-source nodes to the multi-mobile sinks. In particular, a stationary dissemination path may no longer be effective in mobile sink applications, due to sink mobility. In this paper, we propose a Sink-oriented Dynamic Location Service (SDLS) approach to handle sink mobility. In SDLS, we propose an Eight-Direction Anchor (EDA) system that acts as a location service server. EDA prevents intensive energy consumption at the border sensor nodes and thus provides energy balancing to all the sensor nodes. Then we propose a Location-based Shortest Relay (LSR) that efficiently forwards (or relays) data from a source node to a sink with minimal delay path. Our results demonstrate that SDLS not only provides an efficient and scalable location service, but also reduces the average data communication overhead in scenarios with multiple and moving sinks and sources
    corecore