TY - GEN
T1 - Data size reduction and maximization of the network lifetime over wireless sensor network
AU - Kuthadi, Venu Madhav
AU - Selvaraj, Rajalakshmi
AU - Marwala, Tshilidzi
N1 - Publisher Copyright:
© Springer India 2016.
PY - 2016
Y1 - 2016
N2 - The main concept of this research is for increasing the network lifetime and decreases the data size over wireless sensor network. To perform this idea we proposed some novel technique which provides the reliable energy efficient routes and maximizing the network lifetime for finding the route that minimize the total energy for packet traversal. We also use the data compression model that reduce the size of data and joint balancing of nodes and optimize the dynamic compression for improving the lifetime of network. The data compression could be completed within some step, those are raw data could get broken in few branches and get compressed at distinct level of the compression, these compressed data could be decompressed at a certain level and again compressed with distinct level to forward directly or by using some base station. For transmitting the data to base station from the source node, every node has to be clustered and have to choose one cluster head in the group of every cluster, the CH (Cluster Head) is having the more energy in compared to the all other nodes. The CH (Cluster Head) is obtaining the entire message from the other neighbor’s nodes and transmits it to the Base station. From source to destination data transmission, the nodes are searching shortest path that provide a high computation of complexity.
AB - The main concept of this research is for increasing the network lifetime and decreases the data size over wireless sensor network. To perform this idea we proposed some novel technique which provides the reliable energy efficient routes and maximizing the network lifetime for finding the route that minimize the total energy for packet traversal. We also use the data compression model that reduce the size of data and joint balancing of nodes and optimize the dynamic compression for improving the lifetime of network. The data compression could be completed within some step, those are raw data could get broken in few branches and get compressed at distinct level of the compression, these compressed data could be decompressed at a certain level and again compressed with distinct level to forward directly or by using some base station. For transmitting the data to base station from the source node, every node has to be clustered and have to choose one cluster head in the group of every cluster, the CH (Cluster Head) is having the more energy in compared to the all other nodes. The CH (Cluster Head) is obtaining the entire message from the other neighbor’s nodes and transmits it to the Base station. From source to destination data transmission, the nodes are searching shortest path that provide a high computation of complexity.
KW - Data compression
KW - Dijkstra with AODV
KW - Huffman coder
KW - LEACH
KW - Network lifetime
UR - http://www.scopus.com/inward/record.url?scp=84965008224&partnerID=8YFLogxK
U2 - 10.1007/978-81-322-2755-7_75
DO - 10.1007/978-81-322-2755-7_75
M3 - Conference contribution
AN - SCOPUS:84965008224
SN - 9788132227533
T3 - Advances in Intelligent Systems and Computing
SP - 731
EP - 750
BT - Information Systems Design and Intelligent Applications - Proceedings of 3rd International Conference, INDIA 2016
A2 - Mandal, Jyotsna Kumar
A2 - Bhateja, Vikrant
A2 - Udgata, Siba K.
A2 - Satapathy, Suresh Chandra
PB - Springer Verlag
T2 - 3rd International Conference on Information Systems Design and Intelligent Applications, INDIA 2016
Y2 - 8 January 2016 through 9 January 2016
ER -
