2016 Symposium on Colossal Data Analysis and Networking (CDAN) 2016
DOI: 10.1109/cdan.2016.7570912
|View full text |Cite
|
Sign up to set email alerts
|

Distance based Angular Clustering Algorithm (DACA) for heterogeneous wireless sensor networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2017
2017
2022
2022

Publication Types

Select...
3
2
1

Relationship

0
6

Authors

Journals

citations
Cited by 6 publications
(2 citation statements)
references
References 19 publications
0
2
0
Order By: Relevance
“…In this they applied to the protocol the minimum spanning tree and the information entropy theory in which amount of communication can be reduced while transmitting the data. Navjot Kumar Surinder Kaur [10] proposed an algorithm that considers wireless sensor network and divides in to angles and clusters which are distance based regions. Path formation problem and non coverage area will be removed.…”
Section: Literature Surveymentioning
confidence: 99%
“…In this they applied to the protocol the minimum spanning tree and the information entropy theory in which amount of communication can be reduced while transmitting the data. Navjot Kumar Surinder Kaur [10] proposed an algorithm that considers wireless sensor network and divides in to angles and clusters which are distance based regions. Path formation problem and non coverage area will be removed.…”
Section: Literature Surveymentioning
confidence: 99%
“…Navjot et al, [39] proposed a Distance based Angular Clustering Algorithm (DACA) for WSNs. The DACA algorithm finds the path based on node's energy, distance and path energy.…”
Section: Related Workmentioning
confidence: 99%