The algorithm shows how the sensed data from the sensor nodes is being routed to the sink efficiently.The energy of the sensor nodes is very less and the cost of transmitting data of 1Kb from the sensor nodes to a distance of 100 meters is same as performing 3 billion instructions in a general purpose register.Thus there is a requirement in minimising the number of transmissions and length of transmission and every node in the network must be covered . So a Grid is chosen of dimensions m*m (where m is maximum distance the node can communicate) and among all the nodes a centre head is chosen where all the nodes in the grid sends the data to the cluster head and all the cluster heads sends data to nearest cluster head to save the energy until it reaches the sink (https://user-images.githubusercontent.com/32775691/31572830-78f3c396-b0cc-11e7-8941-3fbea69812cd.png)
-
Notifications
You must be signed in to change notification settings - Fork 8
The algorithm shows how the sensed data from the sensor nodes is being routed to the sink efficiently.The energy of the sensor nodes is very less and the cost of transmitting data of 1Kb from the sensor nodes to a distance of 100 meters is same as performing 3 billion instructions in a general purpose register.Thus there is a requirement in mini…
bhanu1131/Routing-algorithm-in-WSN-Grid-based-approach-
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
The algorithm shows how the sensed data from the sensor nodes is being routed to the sink efficiently.The energy of the sensor nodes is very less and the cost of transmitting data of 1Kb from the sensor nodes to a distance of 100 meters is same as performing 3 billion instructions in a general purpose register.Thus there is a requirement in mini…
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published