| Presentation | 2024-01-18 A greedy stable time by various parameter combination of a routing protocol in wireless sensor networks Yoshihiro Kaneko, |
|---|---|
| PDF Download Page |  PDF download Page Link |
| Abstract(in Japanese) | (See Japanese page) |
| Abstract(in English) | A wireless sensor network WSN is composed of one base station BS and many sensor nodes SNs that sense and transmit data toward the BS. After data transmission many times, some SN dries out its energy, when the time is termed a stable time or a first death node time FDN. Our research interest is to examine the possibility of extending such FDN of a given routing protocol in a WSN. During WSN operations, spanning in-trees representing data flow are easily collected at the BS. To such trees, we have so far applied a greedy heuristic algorithm to select dissimilar trees, whose size is to equal an FDN. In previous reports, we have combined different routing protocols aiming at a longer FDN. In this report, we restrict LEACH (Low Energy Adaptive Clustering Hierarchy), which is one of the most popular layer 3 routing. It is known that FDNs of LEACH depends on its cluster head CH ratio. Using such difference, we repeat LEACH with a couple of CH ratios to collect various in-trees. Besides, we relax the initial energy of SN, because doubling it has so far brought better results than four or eight times setting. Simulation experiments show that those two relaxations are effective meaning a possible longer FDN. |
| Keyword(in Japanese) | (See Japanese page) |
| Keyword(in English) | wireless sensor networkFDNLEACHtwo-hop dissimilar treegreedy heuristics |
| Paper # | MSS2023-66,SS2023-45 |
| Date of Issue | 2024-01-10 (MSS, SS) |
| Conference Information | |
| Committee | SS / MSS |
|---|---|
| Conference Date | 2024/1/17(2days) |
| Place (in Japanese) | (See Japanese page) |
| Place (in English) | |
| Topics (in Japanese) | (See Japanese page) |
| Topics (in English) | |
| Chair | Kozo Okano(Shinshu Univ.) / Shingo Yamaguchi(Yamaguchi Univ.) |
| Vice Chair | Yoshiki Higo(Osaka Univ.) / Toshiyuki Miyamoto(Osaka Inst. of Tech.) |
| Secretary | Yoshiki Higo(Shinshu Univ.) / Toshiyuki Miyamoto(Tokyo Inst. of Tech.) |
| Assistant | Shinsuke Matsumoto(Osaka Univ.) / Masato Shirai(Shimane Univ.) |
| Paper Information | |
| Registration To | Technical Committee on Software Science / Technical Committee on Mathematical Systems Science and its Applications |
|---|---|
| Language | ENG |
| Title (in Japanese) | (See Japanese page) |
| Sub Title (in Japanese) | (See Japanese page) |
| Title (in English) | A greedy stable time by various parameter combination of a routing protocol in wireless sensor networks |
| Sub Title (in English) | |
| Keyword(1) | wireless sensor networkFDNLEACHtwo-hop dissimilar treegreedy heuristics |
| 1st Author's Name | Yoshihiro Kaneko |
| 1st Author's Affiliation | Gifu University(Gifu Univ.) |
| Date | 2024-01-18 |
| Paper # | MSS2023-66,SS2023-45 |
| Volume (vol) | vol.123 |
| Number (no) | MSS-334,SS-335 |
| Page | pp.pp.81-86(MSS), pp.81-86(SS), |
| #Pages | 6 |
| Date of Issue | 2024-01-10 (MSS, SS) |