[A-10-17] A stable time by dissimilar tree-based greedy heuristics in wireless sensor networks
キーワード：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.
講演論文集PDFを閲覧したい場合はパスワードを入力してください。
パスワードは、講演参加申込者、聴講参加申込者にメールで御連絡しております。