| Summary: | 碩士 === 國立交通大學 === 電信工程研究所 === 101 === In this thesis, we propose a parsing-tree-based location update scheme for
wireless Machine-to-Machine (M2M) communication. In M2M communication
networks, there might be a large amount of Machine-Type-Communication
(MTC) devices in a small area. If each MTC device periodically performs
location update, the MTC server might be overloaded. According to Information
Theory, in comparison with periodically performing location update, it
is more efficient for a MTC device to perform location update only when the
MTC device has to add a new node into the parsing tree. Since a MTC device
typically has limited memory and is battery-powered, we propose an optimal
tree pruning algorithm that minimizes the weighted sum of the energy cost
and the memory cost. In addition, we show that the computation complexity
of the proposed scheme is low. Furthermore, we use both analytical results
and simulation results to justify the proposed scheme.
|
|---|
