关键词: 物联网, 服务社区, Max-Min策略, The Set-covering理论

Abstract: The ubiquitous service-oriented Internet Of Things（IOT） is becoming one of the dual focuses of the Academic annual and industries. But the most important problem of the realization of the network in serving for terminal users is how to construct the minimum cost of serving the community of IOT efficiently. This paper proposes the minimum cost of construction algorithm of IOT to serve the community which is based on existing research results, combined with the characteristics of Things, and The Set-covering theory. It describes all related issues, proposes the algorithm of construction community service and analyses this algorithm. Compared to CONGA, simulation results show that it is able to achieve the minimum cost of IOT to serve the community efficiently.

Key words: Internet Of Things, service community, Max-Min, The Set-covering