Determination of the K-optimal number of chains-based routing protocol formed by the K-Means algorithm for the WSN
Wireless sensor networks comprise of a large number of lightweight and relatively low-cost computational nodes which their main task is to sense the surrounding environment and collect the information to send it wirelessly to a central point to take the appropriate actions. Although these networks h...
Saved in:
Main Authors: | Alnajdi, Samah (Author), Bajaber, Fuad (Author) |
---|---|
Other Authors: | King Abdulaziz City for Science and Technology (Contributor) |
Format: | EJournal Article |
Published: |
Institute of Advanced Engineering and Science,
2020-08-01.
|
Subjects: | |
Online Access: | Get fulltext |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Comparison by simulation of PEGASIS and IEEPB routing protocols
by: Alnajdi, Samah, et al.
Published: (2019) -
K-means algorithm with level set for brain tumor segmentation
by: Abdelaziz, Samah, et al.
Published: (2019) -
A Survey on Clustering Routing Protocols Based on PSO in WSN
by: Sun, Enyan
Published: (2014) -
Qualnet performances of grid-based clustering For WSN's routing protocols
by: Ismail, Nahidah Hussein, et al.
Published: (2020) -
New efficient GAF routing protocol using an optimized weighted sum model in WSN
by: Aznaoui, Hanane, et al.
Published: (2021)