Multi-requests satisfied based on energy optimization for the service composition in wireless sensor network

5Citations
Citations of this article
19Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Wireless sensor network based on service-oriented architecture has provided important support for Internet of Things in smart city; therefore, multi-requests can be satisfied through service composition. However, as the number and complexity of requests increase, the dynamic and low energy of sensors in wireless sensor network gradually limit the development of the service-oriented architecture in Internet of Things; therefore, optimizing energy under the condition that multi-requests can be satisfied in the dynamic wireless sensor network becomes an important problem. To address this challenge, first, this paper analyzes the mobility of sensors to predict the path stability and manage the information and capabilities on them so that we can find the satisfactory service provider candidates. Then, this article proposes a service mapping pre-process to achieve the work flow reduction in a service layer to save energy in advance and a service mapping process to find the optimal sensors in a network layer that can satisfy the requests. Simulation results show that our strategies can achieve the goal of energy conservation, load balancing, and network lifetime extension under the premise of guaranteeing requests function and non-function attributes and have better performance than traditional ones.

Cite

CITATION STYLE

APA

Du, C., Shao, S., Qi, F., & Meng, L. (2019). Multi-requests satisfied based on energy optimization for the service composition in wireless sensor network. International Journal of Distributed Sensor Networks, 15(9). https://doi.org/10.1177/1550147719879049

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free