Optimal Tree Pruning for Location Update in Machine-to-Machine Communications
| dc.citation.epage | 2632 | en_US |
| dc.citation.issue | 6 | en_US |
| dc.citation.spage | 2620 | en_US |
| dc.citation.volume | 12 | en_US |
| dc.citation.woscount | 1 | |
| dc.contributor.author | Gau, Rung-Hung | en_US |
| dc.contributor.author | Cheng, Ching-Pei | en_US |
| dc.contributor.department | 傳播研究所 | zh_TW |
| dc.contributor.department | Institute of Communication Studies | en_US |
| dc.date.accessioned | 2014-12-08T15:31:23Z | |
| dc.date.available | 2014-12-08T15:31:23Z | |
| dc.date.issued | 2013-06-01 | en_US |
| dc.description.abstract | 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. | en_US |
| dc.identifier.doi | 10.1109/TWC.2013.040413.112086 | en_US |
| dc.identifier.issn | 1536-1276 | en_US |
| dc.identifier.journal | IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS | en_US |
| dc.identifier.uri | http://dx.doi.org/10.1109/TWC.2013.040413.112086 | en_US |
| dc.identifier.uri | https://ir.lib.nycu.edu.tw/handle/11536/22304 | |
| dc.identifier.wosnumber | WOS:000321201200008 | |
| dc.language.iso | en_US | en_US |
| dc.subject | Machine-to-machine communications | en_US |
| dc.subject | mobility management | en_US |
| dc.subject | random walks over trees | en_US |
| dc.title | Optimal Tree Pruning for Location Update in Machine-to-Machine Communications | en_US |
| dc.type | Article | en_US |