Adawy, Mohammad Ibrahim and Awang Nor, Shahrudin and Mahmuddin, Massudi (2018) Data redundancy reduction in wireless sensor network. Journal of Telecommunication, Electronic and Computer Engineering, 10. pp. 1-11. ISSN 2180-1843
PDF
Restricted to Registered users only Download (622kB) | Request a copy |
Abstract
In Wireless Sensor Network, sensor nodes are randomly deployed where the sensor nodes are not situated faraway from each other. Thus, an overlapping area is generated due to intersection of their sensing ranges. If an event occurs within the overlapping area, all the sharing nodes sense the same event and produce redundant and correlated data. Data redundancy exhaust network resources and increase network overhead. Data aggregation and numerous data redundancy reduction algorithms are employed to solve this problem. This paper reviews modern data redundancy reduction used sleep schedule model to solve the redundancy. All proposed algorithms are classified on the basis of network coverage and similarity among sensory data which can be used in reducing redundancy in WSN effectively.
Item Type: | Article |
---|---|
Uncontrolled Keywords: | Coverage Control Protocol; Efficient Data Redundancy; Intelligent Algorithms; Locality Sensitive Hashing; Sleep Schedule; |
Subjects: | Q Science > QA Mathematics > QA75 Electronic computers. Computer science |
Divisions: | School of Computing |
Depositing User: | Mrs. Norazmilah Yaakub |
Date Deposited: | 18 Apr 2019 01:34 |
Last Modified: | 18 Apr 2019 01:34 |
URI: | https://repo.uum.edu.my/id/eprint/25960 |
Actions (login required)
View Item |