A Pareto optimization-based approach to clustering and routing in Wireless Sensor Networks
Clustering and routing in WSNs are two well-known optimization problems that are classified
as Non-deterministic Polynomial (NP)-hard. In this paper, we propose a single multi …
as Non-deterministic Polynomial (NP)-hard. In this paper, we propose a single multi …
[PDF][PDF] A Pareto optimization-based approach to Clustering and Routing in Wireless Sensor Networks
R Elhabyan, W Shi, M St-Hilaire - csit.carleton.ca
Clustering and routing in WSNs are two well-known optimization problems that are classified
as Non-deterministic Polynomial (NP)-hard. In this paper, we propose a single multi …
as Non-deterministic Polynomial (NP)-hard. In this paper, we propose a single multi …
A Pareto optimization-based approach to clustering and routing in Wireless Sensor Networks
R Elhabyan, W Shi, M St-Hilaire - 2018 - dl.acm.org
Clustering and routing in WSNs are two well-known optimization problems that are classified
as Non-deterministic Polynomial (NP)-hard. In this paper, we propose a single multi …
as Non-deterministic Polynomial (NP)-hard. In this paper, we propose a single multi …
[PDF][PDF] A Pareto optimization-based approach to Clustering and Routing in Wireless Sensor Networks
R Elhabyan, W Shi, M St-Hilaire - researchgate.net
Clustering and routing in WSNs are two well-known optimization problems that are classified
as Non-deterministic Polynomial (NP)-hard. In this paper, we propose a single multi …
as Non-deterministic Polynomial (NP)-hard. In this paper, we propose a single multi …