Game Theoretical Approach for Cluster-Based Routing Protocol in Wireless Sensor Network

Author(s):  
Namrata Sahayam ◽  
Anjana Jain ◽  
Shekhar Sharma
IEEE Access ◽  
2020 ◽  
Vol 8 ◽  
pp. 12232-12252 ◽  
Author(s):  
Nura Modi Shagari ◽  
Mohd Yamani Idna Idris ◽  
Rosli Bin Salleh ◽  
Ismail Ahmedy ◽  
Ghulam Murtaza ◽  
...  

2010 ◽  
Vol 61 (2) ◽  
pp. 251-281 ◽  
Author(s):  
Samer A. B. Awwad ◽  
Chee Kyun Ng ◽  
Nor K. Noordin ◽  
Mohd. Fadlee A. Rasid

Author(s):  
N Saranya ◽  
Mr. S.V. Manisekaran

In a dynamic Wireless Sensor Network (WSN) the movement of each sensor node affects the structure of network which may result in inefficient routing. Various difficulties in a dynamic network may include lack of communication between the nodes, end to end delay and transmission overhead. Transmitting data in a dynamic network to the destination node with less delay is the major problem to be addressed. Sensed data can be transmitted using flooding scheme, where the end to end delay can be minimized but results in transmission overhead. In this scheme sensed data is broadcasted to all the nearby nodes until it reaches the sink node. The proposed system make use of cluster based routing protocol, where the sensor nodes with similar mobility pattern are grouped into cluster. Exponentially weighted moving average (EWMA) scheme is used for updating the nodal contact probability of each cluster node. Two Gateway nodes are selected for routing which performs data transmission. The simulation result shows that cluster based routing protocol implemented for a dynamic wireless sensor network result in less end to end delay.


Sign in / Sign up

Export Citation Format

Share Document