Universiti Teknologi Malaysia Institutional Repository

Optimized-Hilbert for mobility in wireless sensor networks

Kamat, M. and Ismail, A. S. and Olariu, S. (2007) Optimized-Hilbert for mobility in wireless sensor networks. In: International Conference on Computational Science and its Applications ICCSA 2007. Insitute of Electrical and Electronics Engineers, pp. 554-560. ISBN 978-0-7695-2945-5

[img] PDF
Restricted to Repository staff only


Official URL: http://dx.doi.org/10.1109/ICCSA.2007.85


In wireless sensor networks (WSNs), mobilizing sink node for data collection can minimize communication and maximize network lifetime. Several mobility algorithms have been proposed to control sink node's movement. However, they do not consider mobility for coverage area problem. Hilbert space-filling curves technique is modified to navigate mobile sink in traversing specfiic area of the sensor field. The algorithm is called optimized-Hilbert, which provides mobility pattern of a sink node in covering an ellipsoidal monitoring area during data collection for a specific mission by traversing the entire area from an entry point and finish at an exit point of square grids. The optimized-Hilbert requires less number of steps as compared to conventional Hilbert. Additionally, it is also compared with circular mobility, and result indicates the efficiency of optimized Hilbert.

Item Type:Book Section
Uncontrolled Keywords:Hilbert space-filling curves technique, data collection, ellipsoidal monitoring, mobility algorithms, network lifetime, sink node, wireless sensor networks
Subjects:Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Divisions:Computer Science and Information System
ID Code:9638
Deposited By: Salasiah M Said
Deposited On:14 Jan 2010 01:02
Last Modified:15 Aug 2017 01:33

Repository Staff Only: item control page