Presentation 2001/11/19
Rout Search Problem with Consideration of Optimum Power Consumption of all Nodes in a Multi-Hop Wireless Network
Masafumi MICHIOKA, Toshio KOIDE, Hitoshi WATANABE,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) Since any mobile equipments is driven by a battery, minimization of consumption of battery power in modern multi-hop wireless communication system is one of the essential problems. This paper presented an algorithm for shortest electric-power-distance, where total battery power consumption from the sender to the final receiver is minimum. Some computer simulations on large-scale multi-hop wireless systems were performed. It is shown that the "the law of the least action (Fermat's principle)" is still hold in the case of the shortest electric-power-distance problem, which is the common principle of natural physics.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) multi-hop / position information / routing / power consumption
Paper # CAS2001-72,CST2001-25
Date of Issue

Conference Information
Committee CST
Conference Date 2001/11/19(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Concurrent System Technology (CST)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Rout Search Problem with Consideration of Optimum Power Consumption of all Nodes in a Multi-Hop Wireless Network
Sub Title (in English)
Keyword(1) multi-hop
Keyword(2) position information
Keyword(3) routing
Keyword(4) power consumption
1st Author's Name Masafumi MICHIOKA
1st Author's Affiliation Graduate School of Engineering, Soka University()
2nd Author's Name Toshio KOIDE
2nd Author's Affiliation Graduate School of Engineering, Soka University
3rd Author's Name Hitoshi WATANABE
3rd Author's Affiliation Graduate School of Engineering, Soka University
Date 2001/11/19
Paper # CAS2001-72,CST2001-25
Volume (vol) vol.101
Number (no) 460
Page pp.pp.-
#Pages 6
Date of Issue