Path Planning for Mobile Beacon Nodes in Localization for Wireless Sensor Networks
Lu Wang, Wusong Wen
Abstract
Lu Wang, Wusong Wen
Abstract
Abstract A path planning for mobile beacon nodes is presented based on the node localization problem of WSN. The beacon nodes define the unknown node position by using ranging method of RSSI. By analyzing defects of a static trajectory, random trajectory, the beacon nodes move to the maximum coverage of unlocated nodes. The simulation result demonstrates that this algorithm obtains good localization performance and can be well adapted to the WSN node localization problem.
OpenAlex reports 3 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Abstract A path planning for mobile beacon nodes is presented based on the node localization problem of WSN. The beacon nodes define the unknown node position by using ranging method of RSSI. By analyzing defects of a static trajectory, random trajectory, the beacon nodes move to the maximum coverage of unlocated nodes. The simulation result demonstrates that this algorithm obtains good localization performance and can be well adapted to the WSN node localization problem.
Key concepts: Computer science, Wireless sensor network, Computer network, Path (computing), Key distribution in wireless sensor networks, Mobile wireless, Real-time computing, Wireless