A Nodes Deployment Algorithm in Wireless Sensor Network Based on Distribution
Song Yuli, Hongdong Zhang
Abstract
Song Yuli, Hongdong Zhang
Abstract
Wireless sensor network coverage is a basic problem of wireless sensor network. In this paper, we propose a wireless sensor network node deployment algorithm base on distribution in order to form an efficient wireless sensor network. The iteratively greedy algorithm is used in this paper to choose priority nodes into active until the entire network is covered by wireless sensor nodes, the whole network to multiply connected. The simulation results show that the distributed wireless sensor network node deployment algorithm can form a multiply connected wireless sensor network. Copyright © 2014 IFSA Publishing, S. L.
A significance statement is not available in the OpenAlex record.
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.
Wireless sensor network coverage is a basic problem of wireless sensor network. In this paper, we propose a wireless sensor network node deployment algorithm base on distribution in order to form an efficient wireless sensor network. The iteratively greedy algorithm is used in this paper to choose priority nodes into active until the entire network is covered by wireless sensor nodes, the whole network to multiply connected. The simulation results show that the distributed wireless sensor network node deployment algorithm can form a multiply connected wireless sensor network. Copyright © 2014 IFSA Publishing, S. L.
Key concepts: Wireless sensor network, Key distribution in wireless sensor networks, Wireless WAN, Mobile wireless sensor network, Computer science, Computer network, Wi-Fi array, Brooks–Iyengar algorithm