scholarly journals An Evaluation on Game Theory Problem of RSSI Localization Technique in Wireless Sensor Networks

The most interesting and challenging research areas in WSNs are routing protocol based on RSSI localization technique in wireless sensor networks. Get-up-and-go safeguarding is the most important experiment for WSNs and make the most of the energy efficiently during routing is an essential requirement and is a demanding task for all other research areas in WSNs. Enhancing the lifespan of the network be contingent on game theory based on RSSI localization technique in wireless sensor networks are the foremost purposes in Machiavellian WSNs since the course-plotting up for theory based on RSSI sensor nodes are battery operated and cannot be replenished or recharged frequently. Here game theory based on RSSI localization for increasing the Wireless Sensor Network life-time using Ant Colony Optimization metaheuristics.

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].


Author(s):  
Mohammed Réda El Ouadi ◽  
Abderrahim Hasbi

<p>Wireless Sensor Networks is a group of sensor nodes dispatched in a geographical area for a defined objective. These sensor nodes are characterized by limited capacity of communicating, computing and especially of energy. The performance of these WSN is resting on a good routing protocol, hence the need to choose the routing protocol able to satisfy the wsn's objectives, and to satisfy the common challenge to prolong network life time.</p><p>Several routing concepts have been proposed for the WSN, hierarchical routing is one of the most used concepts. It is divided into 3 types: cluster based routing, grid based routing and chain based protocol. In this paper, we are interested to Study, analyse and compare two popular routing protocols for Wireless sensor networks (WSNs), Low-Energy Adaptive Clustering Hierarchy (LEACH) using clusters based concept and Power-Efficient Gathering in Sensor Information System (PEGASIS) with chain based concept. The both protocols are simulated with Matlab simulator, in order to evaluate its performances against the different users and the WSNs objectives defined.</p>


Author(s):  
Syed Umar ◽  
P.V.R. D Prasada Rao ◽  
Sridevi Gutta

Today the wireless sensor networks (WSN) play a crucial role in wireless technology in various domains like military, medicine, communications etc. The energy conservation is the crucial factor in the WSN. The WSN is a system which has more number of nodes in which various sensors are fabricated on the nodes to monitor various factors of the given task. These nodes will form a network by connecting the one to other for the effective communication between the nodes, and sends the whole information to the base station (BS). As the nodes which we use for the WSN are of low cost and are battery operated. The main drawback is replacement of the battery in the WSN. The main goal is to conserve the energy consumption in WSN and also to balance the load on WSN. For this many protocols are designed like LEACH, PEGASIS, PEDAP, etc. in those balancing the load and time delayed. some drawbacks are there. So we proposed a protocol so called “Tree Based Energy Balancing routing Protocol by Self Organizing” (TEBRSO), in which instead of routing tables a routing tree will be used for routing from nodes to base station (BS), which chooses one root/control node for the broadcasting messages to the selected sensor nodes. By this protocol we can save the energy consumption in WSN and can extend the life time of it. The performance of this protocol is better when we compare with other energy saving protocols.


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.


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


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):  
Wajeeha Aslam ◽  
Muazzam A. Khan ◽  
M. Usman Akram ◽  
Nazar Abbas Saqib ◽  
Seungmin Rho

Wireless sensor networks are greatly habituated in widespread applications but still yet step behind human intelligence and vision. The main reason is constraints of processing, energy consumptions and communication of image data over the sensor nodes. Wireless sensor network is a cooperative network of nodes called motes. Image compression and transmission over a wide ranged sensor network is an emerging challenge with respect to battery, life time constraints. It reduces communication latency and makes sensor network efficient with respect to energy consumption. In this paper we will have an analysis and comparative look on different image compression techniques in order to reduce computational load, memory requirements and enhance coding speed and image quality. Along with compression, different transmission methods will be discussed and analyzed with respect to energy consumption for better performance in wireless sensor networks.


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>


Sign in / Sign up

Export Citation Format

Share Document