| Summary: | 碩士 === 逢甲大學 === 資訊工程學系 === 105 === The internet of things(IoT) has rapid development in recent years, and makes it
has more widely applications, for example, smart home, smart city, smart healthcare
and smart transport etc. IoT is becoming more and more important in our lives, There
will be more than billions devices connected to the internet in the near future. How to
find the services (or resources) we need in the internet is an important issue. There are
many researches about the issue and a lot of novel schemes are proposed. However,
most of them do not take into account the delay time and have high control overhead.
Therefore, in this paper, we propose an efficient context-aware service discovery
mechanism that employs a spanning tree and has shorter delay time, less control
packets and energy consumption in the internet of things. First, establish a service
discovery spanning tree according to the weights of nodes defined by the number of
service, residual energy and distance etc. Secondly, design and efficient service
discovery mechanism by using Bloom filter and the established spanning tree.
Meanwhile, if there are many choices, the better one will be chose. Finally, provide a
maintenance mechanism for nodes joining or leaving. Simulation results show that the
proposed method outperforms TRENDY and CAEsAR in terms of the number of
packets, energy consumption and search time.
|
|---|
