scholarly journals A Monetary Incentive DTN Routing For Wireless Sensor Networks

Author(s):  
Zhi Lin ◽  
Xia Wang ◽  
Rongfang Bie ◽  
Hongwei Shi

Abstract The DTN (Delay/Interrupt Tolerant Network) protocol that relies on nodes to handle network interruptions is one of the important components of the wireless sensor network (WSN) routing protocol. However, due to resource consumption, nodes may be unable to unconditionally relay data. To address this issue, several incentive mechanisms have recently been proposed to encourage node participation. However, the existing solutions either do not fully consider the sender’s budget or do not consider the relay cost limitation, which violated the practical incentive mechanism requirements of the DTN protocol. In this paper, we focus on developing a new incentive mechanism for DTN routing that specifically address the challenges brought up by budget and relay cost limitation. Our core idea is to define the payoff functions of the sender and the next hops, then optimize the strategies under the constraints of the sender’s budget and the relay’s cost. Our experimental results demonstrate that the maximized social welfare for all participants can be realized under these constraints.

Author(s):  
Saloni Dhiman ◽  
Deepti Kakkar ◽  
Gurjot Kaur

Wireless sensor networks (WSNs) consist of several sensor nodes (SNs) that are powered by battery, so their lifetime is limited, which ultimately affects the lifespan and hence performance of the overall networks. Till now many techniques have been developed to solve this problem of WSN. Clustering is among the effective technique used for increasing the network lifespan. In this chapter, analysis of multi-hop routing protocol based on grid clustering with different selection criteria is presented. For analysis, the network is divided into equal-sized grids where each grid corresponds to a cluster and is assigned with a grid head (GH) responsible for collecting data from each SN belonging to respective grid and transferring it to the base station (BS) using multi-hop routing. The performance of the network has been analyzed for different position of BS, different number of grids, and different number of SNs.


2021 ◽  
Vol 17 (2) ◽  
pp. 198-203
Author(s):  
Rana Hussain

Wireless sensor networks have many limitations such as power, bandwidth, and memory, which make the routing process very complicated. In this research, a wireless sensor network containing three moving sink nodes is studied according to four network scenarios. These scenarios differ in the number of sensor nodes in the network. The RPL (Routing Protocol for low power and lossy network) protocol was chosen as the actual routing protocol for the network based on some routing standards by using the Wsnet emulator. This research aims to increase the life of the network by varying the number of nodes forming it. By using different primitive energy of these nodes, this gives the network to continue working for the longest possible period with low and fair energy consumption between the nodes. In this work, the protocol was modified to make the sink node move to a specific node according to the node’s weight, which depends on the number of neighbors of this node, the number of hops from this node to the sink node, the remaining energy in this node, and the number of packets generated in this node. The simulation process of the RPL protocol showed good results and lower energy consumption compared to previous researches.


2017 ◽  
Vol 2017 ◽  
pp. 1-13 ◽  
Author(s):  
Mohammed Ahmed Ahmed Al-Jaoufi ◽  
Yun Liu ◽  
Zhen-jiang Zhang ◽  
Lorna Uden

In a wireless sensor network, some nodes may act selfishly and noncooperatively, such as not forwarding packets, in response to their own limited resources. If most of the nodes in a network exhibit this selfish behavior, the entire network will be paralyzed, and it will not be able to provide normal service. This paper considers implementing the idea of evolutionary game theory into the nodes of wireless sensor networks to effectively improve the reliability and stability of the networks. We present a new model for the selfish node incentive mechanism with a forward game node for wireless sensor networks, and we discuss applications of the replicator dynamics mechanism to analyze evolutionary trends of trust relationships among nodes. We analyzed our approach theoretically and conducted simulations based on the idea of evolutionary game theory. The results of the simulation indicated that a wireless sensor network that uses the incentive mechanism can forward packets well while resisting any slight variations. Thus, the stability and reliability of wireless sensor networks are improved. We conducted numerical experiments, and the results verified our conclusions based on the theoretical analysis.


2015 ◽  
Vol 4 (1) ◽  
Author(s):  
Syopiansyah Jaya Putra, Siti Ummi Masruroh

The main goal of this research is concerning clustering protocols to minimize the energy consumption of each node, and reduce number of transmission in wireless sensor network. However, most existing clustering protocols consume large amounts of energy, incurred by cluster formation overhead and fixed-level clustering, particularly when sensor nodes are densely deployed in wireless sensor networks. In this paper, we propose TPR (Teen-Pegasis Routing)  protocol, which is a  low energy adaptive clustering hierarchy and  threshold sensitive  energy  efficient sensor  network protocol.  This proposed algorithm combine both proactive and reactive routing protocol. Keywords: Wireless sensor networks (WSN), LEACH, PEGASIS, TEEN


2018 ◽  
Vol 7 (3.34) ◽  
pp. 530
Author(s):  
Praneeta R Sheelavantar ◽  
Shreedhar A Joshi ◽  
Gopal A Bidkar

Nowadays Wireless Sensor Networks are used everywhere, which plays an important role in recording the physical conditions of the environment and organizing the data collected at a central location. WSN has many applications in fields such as military, home automation, industries, commercial, battle field, food safety etc. This paper presents the analysis of Generic MAC Protocols with different routing protocols using Qualnet 7.4 simulator. The simulation result shows that comparing with other MAC protocols SLOT CSMA/CA gives better performance. Total unicast message sent, received, average end-to-end delay, average jitter, average throughput, energy consumed, packets received and lost are analysed for each routing protocol.  


2013 ◽  
Vol E96.B (1) ◽  
pp. 309-312 ◽  
Author(s):  
Euisin LEE ◽  
Soochang PARK ◽  
Hosung PARK ◽  
Sang-Ha KIM

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.


Sign in / Sign up

Export Citation Format

Share Document