TY - JOUR
T1 - Effective algorithm for placement of directional wireless chargers
AU - Dai, Hai Peng
AU - Chen, Gui Hai
AU - Xu, Li Jie
AU - Liu, Yun Huai
AU - Wu, Xiao Bing
AU - He, Tian
PY - 2015/1/1
Y1 - 2015/1/1
N2 - Traditional sensor nodes are powered by batteries. The limited battery capacity, however, constrains the lifetime of the wireless sensor networks. Wireless power transfer technology allows energy transfers from a charger to sensor nodes via wireless, and thus solves the problem completely. One fundamental issue in wireless rechargeable sensor networks is the wireless charger placement problem, i.e., how to effectively place the chargers to maximize the overall charging utility of the network. Existing works mainly focus on the deployment issues of omnidirectional chargers, which are confined to positions such as the end point of triangles or lattice point in a grid. These works inevitably have their limitations. This study is to consider the general placement problem in which the charging area of chargers is a sector and the charger can be deployed at any position in the field with arbitrary orientation. First, a charging model for directional chargers is constructed based on trace data. Then, a series of novel techniques is proposed to transform the problem to develop an effective algorithm, CDG (charger deployment-greedy), with approximation ratio (1-1/e)/(1+ε) to solve this problem. The simulation results demonstrate the effectiveness of the CDG algorithm. Compared with other two random algorithms, the CDG algorithm has performance gains of nearly 300% and 100%, respectively.
AB - Traditional sensor nodes are powered by batteries. The limited battery capacity, however, constrains the lifetime of the wireless sensor networks. Wireless power transfer technology allows energy transfers from a charger to sensor nodes via wireless, and thus solves the problem completely. One fundamental issue in wireless rechargeable sensor networks is the wireless charger placement problem, i.e., how to effectively place the chargers to maximize the overall charging utility of the network. Existing works mainly focus on the deployment issues of omnidirectional chargers, which are confined to positions such as the end point of triangles or lattice point in a grid. These works inevitably have their limitations. This study is to consider the general placement problem in which the charging area of chargers is a sector and the charger can be deployed at any position in the field with arbitrary orientation. First, a charging model for directional chargers is constructed based on trace data. Then, a series of novel techniques is proposed to transform the problem to develop an effective algorithm, CDG (charger deployment-greedy), with approximation ratio (1-1/e)/(1+ε) to solve this problem. The simulation results demonstrate the effectiveness of the CDG algorithm. Compared with other two random algorithms, the CDG algorithm has performance gains of nearly 300% and 100%, respectively.
KW - Approximation algorithm
KW - Directional charging
KW - Directional wireless charger
KW - Placement
KW - Submodularity
UR - http://www.scopus.com/inward/record.url?scp=84938340692&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84938340692&partnerID=8YFLogxK
U2 - 10.13328/j.cnki.jos.004618
DO - 10.13328/j.cnki.jos.004618
M3 - Article
AN - SCOPUS:84938340692
SN - 1000-9825
VL - 26
SP - 1711
EP - 1729
JO - Ruan Jian Xue Bao/Journal of Software
JF - Ruan Jian Xue Bao/Journal of Software
IS - 7
ER -