TKP: Three level key pre-distribution with mobile sinks for wireless sensor networks

Wireless Sensor Networks are by its nature prone to various forms of security attacks. Authentication and secure communication have become the need of the day. Due to single point failure of a sink node or base station, mobile sinks are better in many wireless sensor networks applications for efficient data collection or aggregation, localized sensor reprogramming and for revoking compromised sensors. The existing sytems that make use of key predistribution schemes for pairwise key establishment between sensor nodes and mobile sinks, deploying mobile sinks for data collection has drawbacks. Here, an attacker can easily obtain many keys by capturing a few nodes and can gain control of the network by deploying a node preloaded with some compromised keys that will be the replica of compromised mobile sink. We propose an efficient three level key predistribution framework that uses any pairwise key predistribution in different levels. The new framework has two set of key pools one set of keys for the mobile sink nodes to access the sensor network and other set of keys for secure communication among the sensor nodes. It reduces the damage caused by mobile sink replication attack and stationary access node replication attack. To further reduce the communication time it uses a shortest distance to make pair between the nodes for comunication. Through results, we show that our security framework has a higher network resilience to a mobile sink replication attack as compared to the polynomial pool-based scheme with less communication tim

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

© 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

Strengths and Weaknesses of Prominent Data Dissemination Techniques in Wireless Sensor Networks

Data dissemination is the most significant task in a Wireless Sensor Network (WSN). From the bootstrapping stage to the full functioning stage, a WSN must disseminate data in various patterns like from the sink to node, from node to sink, from node to node, or the like. This is what a WSN is deployed for. Hence, this issue comes with various data routing models and often there are different types of network settings that influence the way of data collection and/or distribution. Considering the importance of this issue, in this paper, we present a survey on various prominent data dissemination techniques in such network. Our classification of the existing works is based on two main parameters: the number of sink (single or multiple) and the nature of its movement (static or mobile). Under these categories, we have analyzed various previous works for their relative strengths and weaknesses. A comparison is also made based on the operational methods of various data dissemination schemes

Surveying Position Based Routing Protocols for Wireless Sensor and Ad-hoc Networks

A focus of the scientific community is to design network oriented position-based routing protocols and this has resulted in a very high number of algorithms, different in approach and performance and each suited only to particular applications. However, though numerous, very few position-based algorithms have actually been adopted for commercial purposes. This article is a survey of almost 50 position-based routing protocols and it comes as an aid in the implementation of this type of routing in various applications which may need to consider the advantages and pitfalls of position-based routing. An emphasis is made on geographic routing, whose notion is clarified as a more restrictive and more efficient type of position-based routing. The protocols are therefore divided into geographic and non-geographic routing protocols and each is characterized according to a number of network design issues and presented in a comparative manner from multiple points of view. The main requirements of current general applications are also studied and, depending on these, the survey proposes a number of protocols for use in particular application areas. This aims to help both researchers and potential users assess and choose the protocol best suited to their interest

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

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

Architecture for Mobile Heterogeneous Multi Domain Networks

Multi domain networks can be used in several scenarios including military, enterprize networks, emergency networks and many other cases. In such networks, each domain might be under its own administration. Therefore, the cooperation among domains is conditioned by individual domain policies regarding sharing information, such as network topology, connectivity, mobility, security, various service availability and so on. We propose a new architecture for Heterogeneous Multi Domain (HMD) networks, in which one the operations are subject to specific domain policies. We propose a hierarchical architecture, with an infrastructure of gateways at highest-control level that enables policy based interconnection, mobility and other services among domains. Gateways are responsible for translation among different communication protocols, including routing, signalling, and security. Besides the architecture, we discuss in more details the mobility and adaptive capacity of services in HMD. We discuss the HMD scalability and other advantages compared to existing architectural and mobility solutions. Furthermore, we analyze the dynamic availability at the control level of the hierarchy

DESIGN OF MOBILE DATA COLLECTOR BASED CLUSTERING ROUTING PROTOCOL FOR WIRELESS SENSOR NETWORKS

Wireless Sensor Networks (WSNs) consisting of hundreds or even thousands of nodes, canbe used for a multitude of applications such as warfare intelligence or to monitor the environment. A typical WSN node has a limited and usually an irreplaceable power source and the efficient use of the available power is of utmost importance to ensure maximum lifetime of eachWSNapplication. 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 energy available in WSNs. The network routing protocols ensure that every message reaches thedestination and has a direct impact on the amount of transmissions to deliver messages successfully. To this end, the transmission protocol within the WSNs should be scalable, adaptable and optimized to consume the least possible amount of energy to suite different network architectures and application domains. The inclusion of mobile nodes in the WSNs deployment proves to be detrimental to protocol performance in terms of nodes energy efficiency and reliable message delivery. This thesis which proposes a novel Mobile Data Collector based clustering routing protocol for WSNs is designed that combines cluster based hierarchical architecture and utilizes three-tier multi-hop routing strategy between cluster heads to base station by the help of Mobile Data Collector (MDC) for inter-cluster communication. In addition, a Mobile Data Collector based routing protocol is compared with Low Energy Adaptive Clustering Hierarchy and A Novel Application Specific Network Protocol for Wireless Sensor Networks routing protocol. The protocol is designed with the following in mind: minimize the energy consumption of sensor nodes, resolve communication holes issues, maintain data reliability, finally reach tradeoff between energy efficiency and latency in terms of End-to-End, and channel access delays. Simulation results have shown that the Mobile Data Collector based clustering routing protocol for WSNs could be easily implemented in environmental applications where energy efficiency of sensor nodes, network lifetime and data reliability are major concerns

Quality-of-service in wireless sensor networks: state-of-the-art and future directions

Wireless sensor networks (WSNs) are one of today’s most prominent instantiations of the ubiquituous computing paradigm. In order to achieve high levels of integration, WSNs need to be conceived considering requirements beyond the mere system’s functionality. While Quality-of-Service (QoS) is traditionally associated with bit/data rate, network throughput, message delay and bit/packet error rate, we believe that this concept is too strict, in the sense that these properties alone do not reflect the overall quality-ofservice provided to the user/application. Other non-functional properties such as scalability, security or energy sustainability must also be considered in the system design. This paper identifies the most important non-functional properties that affect the overall quality of the service provided to the users, outlining their relevance, state-of-the-art and future research directions