Jellyfish dynamic routing protocol with mobile sink for location privacy and congestion avoidance in wireless sensor networks

https://doi.org/10.1016/j.sysarc.2020.101840Get rights and content

Abstract

Recently, Wireless Sensor Network (WSN) is often viewed with an oversized range of sensors that are structured and collaborate to gather and transmit information around the targets. As sensors may be positioned in harsh surroundings, it is critical for secure data transmission. Therefore, a dynamic routing path should be essential for WSN applications. In this paper, a Jellyfish Dynamic Routing Protocol (JDRP) for preserving location privacy and congestion avoidance with less delay guaranteed is proposed. With this routing technique, the complete sensor field is divided into different subdivisions and each subdivision elects a target area by computing its transmission distance. The backbone of the dynamic routing protocol consists of a virtual ring called bell nodes and a radial line called tentacle nodes employs more nodes to construct the network. The amount of radial line and radius of the virtual ring in a network are conjointly determined to ease the communication path from the node to sink. In this structure, the radial line paths are routed directionally and bell nodes are routed with angular directions probabilistically. From the routing path, the tentacle nodes collect the data to dynamic sink which will assure that the information is going to be collected with less delay and attacker cannot guess their positions. The experimental results show that the proposed JDRP method accomplishes enhanced performance in terms of energy consumption, packet delivery delay and lifetime.

Introduction

In Wireless Sensor Network (WSN), anyone can access an appropriate wireless receiver to monitor and intercept network communications. This network can be utilized in safety-critical applications such as military, radiation, health care monitoring and forest fire detection. With respect to these applications, the need to ensure path location privacy is important for source to destination field networks. In this, the sensor nodes are composed of network field that senses and transmit the data to sink. On tolerating the information from the nodes, the sink either sends the data to the server or gathered via trusted routes [1]. The routing path from source node to destination leads to many security attacks. This is possible for the attacker to identify the source location and interrupt the path area to make an increase in energy efficiency with high delay. The networks are operated in transmitted path and route the data packets from source to destination through different topology and multi-hop communication. Meanwhile, different topology structure will defend a location-aware mechanism and multi-hop communication may solves the hot spot problem. To defeat the energy-hole issues, the current and next location information of sink node are used to forward the packet in the internal structure path to the destination [2]. This makes energy stable and expands the network lifetime. In routing protocol, the sink location is required for all source nodes to transmit the data in the current location. The coordinate of sensors are essential and hence location-aware sensors ease the hot spot problem [3]. In network structure, there are lots of routing approaches to transmit the data in a verified path. A virtual-grid based efficient routing approach joins the single grid structure to form a possible transmission source path related to Two-Tier Data Dissemination (TTDD) approach. For injecting the request, the position begins to initialize the current and next position to deliver the data to the sink [4], [5]. Also, in railroad structure, the sink forwards query to rail node way that notifies the path position among the nodes to the present and past station. Despite the fact, the predictable data delivery of railroad [6] is greater than Line based Data Dissemination (LBDD) approach [7]. The ring routing path is comprised of separate area where each node selects a new ring node path among its neighbours. Hence, the query path is too far to reach the sink throughout the structure [8]. The blackhole attack can stops the forwarding data packets towards the destination path. Likewise, the sinkhole attack is similar to that of blackhole attack. In these cases, the buffer slot have sufficient packets that actively implores malicious node from its neighbor nodes. Hence, the influence attacks are crucial to affect more damages to networks [9]. In these routing protocols, it is significant to keep the location of the data flow path to sink because, if the data is exposed to an adversary, it will permit the attacker to find the location of the packet route. Hence, to prevent the attacker from the source node, the route location must be imposed.

In WSN, the privacy is also an important concern to reach the destination in a secure way. It can be categorized into two types: content privacy and contextual privacy. Content privacy states to the confidentiality in data transferred between the nodes which can be verified using encryption and authentication schemes [10]. An authentication scheme is required for secure communication and avoid several security attacks in Wireless Body Area Network (WBAN). Due to the flow of data, an adversary can attack the communication path area to capture the target flow of information. So, an authentication process helps to find the unwanted users in the network for secure communication in all applications [11]. The adversaries discover the source data by powerful workstation and expensive radio transceivers. Regardless of whether the data is encrypted to provide confidentiality, the lack of location privacy may expose the congestion in the network [12]. The network privacy consists of three categories: Source Location (SL) privacy, route privacy and sink location privacy. In SL privacy, the location of the source data is covered by generating fake source nodes to confuse the adversary while in route privacy, the complete path information will not be predictable to any node and thus an attacker gets no clue to identify the source node. In sink location privacy, the adversary discovers the sink location dependent on the direction of data flow named traffic analysis attack [13].

A few methodologies achieves low security in location privacy area protection such as Redundant Fog Loop (RFL) based plan in which the routing way and network structure make the adversaries difficult to trace the source location [14], and the Preserve Location Anonymity through Uniform Distribution of Traffic (PLAUDIT) scheme [15] achieves high location privacy without affecting the network lifetime. To prevent the adversary against security attacks, a new routing algorithm has to be created which consumes less energy in the network as well as provide security against eavesdropping and other security attacks. Based upon the application, different system and architectural design restrictions have been considered in wireless networks. In existing methods, the energy-efficient protocols are designed to assist the sensor nodes and static sink. But, due to the technology development, there is a requirement for transmitting the node data to sink. Also, the problems that are faced in transferring the data to the mobile sink have been addressed in several existing protocols [[2], [3], [4], [5], [6], [7], [8], [10], [11], [12], [13], [14], [15]]. But, an enemy may try to forge the data by eavesdropping or traffic analysis attack. Hence, a dynamic routing protocol with privacy solution is required to solve the issues.

This paper addresses the path location privacy issue and congestion avoidance in WSN by proposing the JDRP scheme that uses a jellyfish structure positioned bell nodes at the midpoint center and tentacle nodes virtually located in radial lines to route the data packets from the target node to sink. In the first phase, the location of the target node is designed and the sensor node, sink node and distance information are initialized in the network field. In the second phase, the target nodes forward the data to sink using confusing routing strategy and congestion will be avoided by alternate path routing. This approach can create it hard for the attacker to guess the path routing.

The main contribution of this paper mainly includes the following aspects:

  • Due to the nature of WSN, an enemy can detect the flow of data to obtain the source node location and then attack the target node. To solve this problem, we proposed a Jellyfish Dynamic Routing Protocol (JDRP) for location-based privacy scheme must be intended to ensure the location of the routing path and data packets with less delay.

  • A new routing path is designed to assemble information from tentacle nodes routinely, which exhibits that the way data will be routed in a potential angular direction with less energy consumption and extend the lifespan.

  • We give a broad examination of data collection and Packet delay ensured to affirm the strong privacy preservation, energy utilization and network traffic of our scheme.

The remaining paper is sorted as follows. The overall introduction of mobile sink based routing protocols is described in Section 1. In Section 2, the related work is reviewed. Section 3, exhibits the proposed routing network model scheme and in short, reveals the proposed framework with security analysis. Similarly, the performance evaluation and simulation results are provided in Section 4. Lastly, the conclusion of our work is obtainable in Section 5.

Section snippets

Related works

Some of the recent works carried out in routing protocols and its drawbacks are discussed as follows:

Abo-Zahhad [16] mentioned a clustering protocol that deals with the energy hole issue and improves the consistent time of static sink expressed as Mobile Sink based adaptive Immune Energy-Efficient Clustering protocol (MSIEEP). During this approach, the location of the sink and number Cluster Heads (CH) is discovered using Adaptive Immune Algorithm (AIA). The locations are based on degenerated

Jellyfish dynamic routing protocol scheme

In this section, we introduce the Jellyfish Dynamic Routing Protocol (JDRP) to avoid congestion and traffic analysis attack in the wireless network. Here, we divide the network by adopting the structure of a jellyfish and classify the sensors as bell nodes and tentacle nodes. The area of the jellyfish protocol is composed of bell nodes enclosing its internal structure, from which the radial lines of tentacle nodes suspends. The bell nodes are formed at the midpoint in the form of a ring and the

Performance evaluation

To evaluate the efficiency of the JDRP, the following performance parameters are considered.

A. Energy consumption

Consider a nodek and distance h sends an Infpackage to sink. Then, the total energy consumption (ET) is computed as,ET={h[Eelec+Efs(kh)2]+(h1)Eelecifkh<D0h[Eelec+Emp(kh)4]+(h1)EelecifkhD0}Where Eelec denotes the energy consumption of transmitter, D0 is the threshold value and can be calculated asD0=Efs/Emp, Efsand  Empindicate the amplification coefficient at no cost area model

Conclusion

With the event of the crowd sensing network, location privacy will be a significant factor in the network domain. In this paper, a JDRP for data collection scheme is proposed for preserving location privacy and preventing the dispersal of congestion through alternative path routing in WSN. We first divide the network field into various sectors. At the point, when the nodes use angle based distance to choose the forwarder and threshold value to defend the nodes from dying too early. The routing

Funding

There is no funding for this study.

Ethical approval

This article does not contain any studies with human participants and/or animals performed by any of the authors.

Informed consent

There is no informed consent for this study.

Authors' contributions

All the authors have participated in writing the manuscript and have revised the final version. All authors read and approved the final manuscript.

Declaration of Competing Interest

Authors declares that they have no conflict of interest.

V Bibin Christopher was born in Kanyakumari, India, on April 5,1985. He received his B.E. degree in Electrical Engineering and M.E degree in Computer Science and Engineering from Anna University, Chennai, India, in 2006 and 2009. Currently he is working as an Assistant Professor in Ponjesly College of Engineering, Nagercoil, India. His current research interests include Wireless Sensor Networks, Mobile Computing, and Network Security . He is a Life Member of the Indian Society for Technical

References (37)

  • J. Wang et al.

    An empower hamilton loop based data collection algorithm with mobile agent for WSNs

    Hum.-Centr. Comput. Inf. Sci.

    (2019 Dec;)
  • J. Ben-Othman et al.

    Energy efficient and QoS based routing protocol for wireless sensor networks

    J. Parallel Distrib. Comput.

    (2010)
  • M. Nighot et al.

    GPS based distributed communication protocol for static sensor network (GDCP)

    Procedia Comput. Sci

    (2016)
  • S. Jain et al.

    QWRP: query-driven virtual wheel based routing protocol for wireless sensor networks with mobile sink

    J. Netw. Comput. Appl.

    (2019)
  • M.A. Habib et al.

    Starfish routing for sensor networks with mobile sink

    J. Netw. Comput. Appl.

    (2018)
  • M. Conti et al.

    Providing source location privacy in wireless sensor networks: a survey

    IEEE Commun. Surv. Tut.

    (2013)
  • Y. Gu et al.

    The evolution of sink mobility management in wireless sensor networks: a survey

    IEEE Commun. Surv. Tut.

    (2015)
  • E.C.H. Ngai et al.

    On providing location privacy for mobile sinks in wireless sensor networks

    Wirel. Netw.

    (2013)
  • Cited by (27)

    • An energy efficient cluster based hybrid optimization algorithm with static sink and mobile sink node for Wireless Sensor Networks

      2022, Expert Systems with Applications
      Citation Excerpt :

      In addition, scenario 7 analyses the load balancing over the sink node by using the proposed HBACS algorithm. The algorithms JDRP (Christopher & Jasper, 2021), QWRP and QDVGDD (Jain, Pattanaik, & Shukla, 2019) are considered by scenario 4 and scenario 5 for analysing the effect of network traffic and energy consumption of the proposed HBACM algorithm along with MSN. In addition, algorithms like GTAC-DG (Raj et al., 2020), IACO-MS (Wang, Cao, Sherratt and Park, 2018), RKM (Kaswan, Nitesh, & Jana, 2017) and REP (Alsaafin, Khedr, & Al Aghbari, 2018) are considered by scenario 6 for analysing the MSN travel time and simulation time in terms of different node densities.

    View all citing articles on Scopus

    V Bibin Christopher was born in Kanyakumari, India, on April 5,1985. He received his B.E. degree in Electrical Engineering and M.E degree in Computer Science and Engineering from Anna University, Chennai, India, in 2006 and 2009. Currently he is working as an Assistant Professor in Ponjesly College of Engineering, Nagercoil, India. His current research interests include Wireless Sensor Networks, Mobile Computing, and Network Security . He is a Life Member of the Indian Society for Technical Education (ISTE).

    Jasper.J was born on February 28, 1981. He received the B.E., M.E., and Ph.D degrees, all in Electrical Engineering from Manonmanium Sundaranar University, Annamalai University, and Anna University, India, in 2003, 2005 and 2014 respectively. His major research interest includes Artificial Intelligence, Wireless Communication in general and computational intelligent techniques.

    View full text