By Topic

Optimal Tree Pruning for Location Update in Machine-to-Machine Communications

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 $13
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

2 Author(s)
Rung-Hung Gau ; Inst. of Commun. Eng., Nat. Chiao Tung Univ., Hsinchu, Taiwan ; Ching-Pei Cheng

In this paper, we propose a novel energy-and-memory efficient location update scheme for wireless M2M communications. According to information theory, in comparison with periodically registering to the Machine-Type Communications (MTC) server, it is more efficient for a MTC device to perform location updates only when new nodes are added into the corresponding parsing tree. Based on the theory of random walks over trees, we propose optimally pruning the parsing tree to minimize the expected value of the sum of the memory cost and the energy cost for a MTC device. We use both analytical results and simulation results to justify the usage of the proposed scheme.

Published in:

Wireless Communications, IEEE Transactions on  (Volume:12 ,  Issue: 6 )