scholarly journals Providing Different Quality of Service Levels by Routing Protocol for Virtualized Wireless Sensor Networks

Author(s):  
Ngo Quynh Thu

Virtualization  of  Wireless  Sensor  Networks (WSN)  is  a  new  concept  that  can  provide  a  common platform  upon  which  new  federated  sensor architectures can be built, experimented and evaluated. A  Virtualized  Sensor  Network  (VSN)  is  formed  by  a subset  of  sensor  nodes  of  a  physical  WSN  that  is dedicated to a certain task or an application at a given time.  In  this  paper,  we  investigate  the  requirements that virtualization imposes on the routing procedure of the  involved  WSNs  and  propose  a  routing  scheme: Virtualized-EMRP  (based  on  EMRP  [1]).  In  addition, over the same WSN, different applications may require different  QoS  levels  but  satisfying  this  is  not  always  a straightforward  task.  In  the  context  of  VSN,  this  task can  be  resolved  by  initializing  different  instances  of Virtualization-EMRP  routing  protocol  and  adjusting its  routing  metrics.  We  use  OMNET++  simulator  for different  scenarios  of  Virtualized-EMRP  associated with  different  routing  metrics  and  simulation  results show that QoS differentiation for different applications can be achieved.

Author(s):  
V. Balaji ◽  
A. Ravi Kumar

In recent years, there has been a winged generation of research relating to wireless sensor networks (WSN), due to large-scale range of potential utilization there can be used for several applications such as, surveillance, hostile monitoring, target tracking, and security management. Sensor nodes can be defined as typically powered by batteries so it is having a limited amount of lifetime, and another problem can be considering is batteries cannot be recharged. The energy problem is extreme difficulty in wireless sensor networks. So we proposed advanced routing protocol PDORP, reduced the energy consumption as well as improving the quality of service (QoS), and better throughput which compared to another routing such as, LEACH, PEGASIS, DSR, and OLSR.


Author(s):  
A. Radhika ◽  
D. Haritha

Wireless Sensor Networks, have witnessed significant amount of improvement in research across various areas like Routing, Security, Localization, Deployment and above all Energy Efficiency. Congestion is a problem of  importance in resource constrained Wireless Sensor Networks, especially for large networks, where the traffic loads exceed the available capacity of the resources . Sensor nodes are prone to failure and the misbehaviour of these faulty nodes creates further congestion. The resulting effect is a degradation in network performance, additional computation and increased energy consumption, which in turn decreases network lifetime. Hence, the data packet routing algorithm should consider congestion as one of the parameters, in addition to the role of the faulty nodes and not merely energy efficient protocols .Nowadays, the main central point of attraction is the concept of Swarm Intelligence based techniques integration in WSN.  Swarm Intelligence based Computational Swarm Intelligence Techniques have improvised WSN in terms of efficiency, Performance, robustness and scalability. The main objective of this research paper is to propose congestion aware , energy efficient, routing approach that utilizes Ant Colony Optimization, in which faulty nodes are isolated by means of the concept of trust further we compare the performance of various existing routing protocols like AODV, DSDV and DSR routing protocols, ACO Based Routing Protocol  with Trust Based Congestion aware ACO Based Routing in terms of End to End Delay, Packet Delivery Rate, Routing Overhead, Throughput and Energy Efficiency. Simulation based results and data analysis shows that overall TBC-ACO is 150% more efficient in terms of overall performance as compared to other existing routing protocols for Wireless Sensor Networks.


2011 ◽  
Vol 474-476 ◽  
pp. 828-833
Author(s):  
Wen Jun Xu ◽  
Li Juan Sun ◽  
Jian Guo ◽  
Ru Chuan Wang

In order to reduce the average path length of the wireless sensor networks (WSNs) and save the energy, in this paper, the concept of the small world is introduced into the routing designs of WSNs. So a new small world routing protocol (SWRP) is proposed. By adding a few short cut links, which are confined to a fraction of the network diameter, we construct a small world network. Then the protocol finds paths through recurrent propagations of weak and strong links. The simulation results indicate that SWRP reduces the energy consumption effectively and the average delay of the data transmission, which leads to prolong the lifetime of both the nodes and the network.


2019 ◽  
Vol 20 (4) ◽  
pp. 653-662 ◽  
Author(s):  
Suresh Kumar ◽  
Kiran Dhull ◽  
Deepak Sharma ◽  
Payal Arora ◽  
Sandeep Dahiya

Adhoc Wireless Sensor Networks (AWSN’s) have found an increasing utility in various applications. In AWSN, sensor nodes are arranged in a topology which is suitable to the requirement of the nature of task. As the sensors are not connected in a fixed manner, their networking, location and functioning keeps on changing based on the situation due to which these are called Adhoc networks. The biggest challenge is to keep the sensors working for longer life by conserving their energy. Therefore, a suitable routing protocol needs to be selected to meet the energy conservation requirement at different nodes. In the present paper, we have evaluated the three energy conservation models i.e. Generic, Micaz and Micamotes for AODV and DYMO routing protocol. The evaluation is carried out using the parameter metrices: (i) Average End-to-End Delay (AEED), (ii) Throughput (iii) Energy consumed in Transmit mode and Receive mode. Based on the simulation results, it has been observed that Micamotes energy model using AODV routing protocol performs better in terms of energy consumption upto 42.99% and 29.90 % in transmit and upto 59.24% and 33.96 % in receive mode respectively as compared to Generic and Micaz energy model.


2020 ◽  
Author(s):  
Ademola Abidoye ◽  
Boniface Kabaso

Abstract Wireless sensor networks (WSNs) have been recognized as one of the most essential technologies of the 21st century. The applications of WSNs are rapidly increasing in almost every sector because they can be deployed in areas where cable and power supply are difficult to use. In the literature, different methods have been proposed to minimize energy consumption of sensor nodes so as to prolong WSNs utilization. In this article, we propose an efficient routing protocol for data transmission in WSNs; it is called Energy-Efficient Hierarchical routing protocol for wireless sensor networks based on Fog Computing (EEHFC). Fog computing is integrated into the proposed scheme due to its capability to optimize the limited power source of WSNs and its ability to scale up to the requirements of the Internet of Things applications. In addition, we propose an improved ant colony optimization (ACO) algorithm that can be used to construct optimal path for efficient data transmission for sensor nodes. The performance of the proposed scheme is evaluated in comparison with P-SEP, EDCF, and RABACO schemes. The results of the simulations show that the proposed approach can minimize sensor nodes’ energy consumption, data packet losses and extends the network lifetime


Sensor nodes are exceedingly energy compelled instrument, since it is battery operated instruments. In wsn network, every node is liable to the data transmission through the wireless mode [1]. Wireless sensor networks (WSN) is made of a huge no. of small nodes with confined functionality. The essential theme of the wireless sensor network is energy helpless and the WSN is collection of sensor. Every sensor terminal is liable to sensing, store and information clan and send it forwards into sink. The communication within the node is done via wireless network [3].Energy efficiency is the main concentration of a desining the better routing protocol. LEACH is a protocol. This is appropriate for short range network, since imagine that whole sensor node is capable of communication with inter alia and efficient to access sink node, which is not always correct for a big network. Hence, coverage is a problem which we attempt to resolve [6]. The main focus within wireless sensor networks is to increase the network life-time span as much as possible, so that resources can be utilizes efficiently and optimally. Various approaches which are based on the clustering are very much optimal in functionality. Life-time of the network is always connected with sensor node’s energy implemented at distant regions for stable and defect bearable observation [10].


The fundamental issue is framing the sensor nodes and steering the information from sender node to receiver node in wireless sensor networks (WSN). To resolve this major difficulty, clustering algorithm is one of the accessible methods employed in wireless sensor networks. Still, clustering concept also faces some hurdles while transmitting the data from source to destination node. The sensor node is used to sense the data and the source node helps to convey the information and the intended recipient receives the sensed information. The clustering proposal will choose the cluster head depending on the residual energy and the sensor utility to its cluster members. The cluster heads will have equal cluster number of nodes. The complexity is generated in computing the shortest path and this can be optimized by Dijkstra’s algorithm. The optimization is executed by Dijkstra’s shortest path algorithm that eliminates the delay in packet delivery, energy consumption, lifetime of the packet and hop count while handling the difficulties. The shortest path calculation will improve the quality of service (QoS). QoS is the crucial problem due to loss of energy and resource computation as well as the privacy in wireless sensor networks. The security can be improvised in this projected work. The preventive metrics are discussed to upgrade the QoS facility by civilizing the privacy parameter called as Safe and Efficient Query Processing (SAFEQ) and integrating the extended watchdog algorithm in wireless sensor networks.


2018 ◽  
Vol 17 ◽  
pp. 02001
Author(s):  
Churan Tang ◽  
Linghua Zhang

A central question in wireless sensor network research is how to reduce the consumption of the energy of the sensor nodes. Theoretically, the network coding technology proposed by Ahlswede et al (2000) can improve the network reliability and network throughput, increase the robustness and save energy. Based on the classic flooding routing protocol, the present study proposes a new flooding control protocol, i.e. NC-Flooding for wireless sensor networks. NC-Flooding protocol introduces five mechanisms to enhance the efficiency of wireless sensor networks. As shown by MATLAB simulation results, NC-Flooding protocol reduces the number of broadcasts of wireless sensor networks, increases the throughput of the network and increases the bandwidth utilization. We conclude that NC-Flooding protocol reduces data forwarding cost and node energy consumption and extends nodes’ life cycle, thus increasing network utilization.


Author(s):  
Nandoori Srikanth ◽  
Muktyala Sivaganga Prasad

<p>Wireless Sensor Networks (WSNs) can extant the individual profits and suppleness with regard to low-power and economical quick deployment for numerous applications. WSNs are widely utilized in medical health care, environmental monitoring, emergencies and remote control areas. Introducing of mobile nodes in clusters is a traditional approach, to assemble the data from sensor nodes and forward to the Base station. Energy efficiency and lifetime improvements are key research areas from past few decades. In this research, to solve the energy limitation to upsurge the network lifetime, Energy efficient trust node based routing protocol is proposed. An experimental validation of framework is focused on Packet Delivery Ratio, network lifetime, throughput, energy consumption and network loss among all other challenges. This protocol assigns some high energy nodes as trusted nodes, and it decides the mobility of data collector.  The energy of mobile nodes, and sensor nodes can save up to a great extent by collecting data from trusted nodes based on their trustworthiness and energy efficiency.  The simulation outcome of our evaluation shows an improvement in all these parameters than existing clustering and Routing algorithms.<strong></strong></p>


2018 ◽  
Vol 7 (4.12) ◽  
pp. 20
Author(s):  
Navneet Kaur ◽  
Dr. Sahil Verma ◽  
Dr. Kavita

Wireless Sensor Networks(WSNs) comprise sensor nodes which find applications in a wide variety of fields such as medical, wildlife, security, environment, industry. A network communication is initialized and accomplished with the aid of routing protocols. A routing protocol is a set of rules which govern the routing phenomenon. WSNs protocols for the purpose of routing have been the ubiquitous option of the researchers in the recent years due to their exorbitant scope of improvement. The objective of a routing protocol is to inquest for a relevant route amidst sender and receiver to accomplish successful transmission at the destination .Dissipation of energy and lengthening the duration of the network have always been one of the major points of research gaps. As the nodes in WSNs in are battery operated, so they can only use restricted energy to proceed with the communication and transmission operation. To cope up with this, a number of researchers have come up with developments in the field of energy efficacy and optimizations in WSNs routing protocols. A reify summarization of some protocols for routing purposes has been manifested in this paper.


Sign in / Sign up

Export Citation Format

Share Document