By Topic

Planning rendezvous using the Halin graph in wireless sensor networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $31
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Chang, R.-S. ; Dept. of Comput. Sci. & Inf. Eng., Nat. Dong Hwa Univ., Hualien, Taiwan ; Wang, S.-H. ; Tsai, S.-L. ; Yang, W.-P.

Recent research has shown that using a mobile element to help enhance energy efficiency is popular. A mobile element can move in a sensed area to provide connectivity and collect sensed data. However, the mobile element can only travel over a portion of a sensor network under temporal constraints. To have better energy saving of WSNs, the authors plan rendezvous points for a mobile element to travel by mapping sensors in a plane to a point on a Halin graph. Using the Halin graph helps solve rendezvous planning in polynomial time. The simulation results show the merits of the proposed method.

Published in:

Wireless Sensor Systems, IET  (Volume:2 ,  Issue: 3 )