[A-10-17] A stable time by dissimilar tree-based greedy heuristics in wireless sensor networks
Keywords:a wireless network、FDN、routing、greedy algorithm、heuristics
Our research is to find out a possible longer lifetime FDN in a wireless sensor network WSN. Data flows, described as an in-tree, are collected at the base station BS. In this report, we apply a greedy heuristics based on dissimilar trees to such collected trees for five ways. Then FDN improves by LEACH and EECS combination.
Abstract password authentication.
Password is required to view the abstract. Please enter a password to authenticate.