Service provisioning in ad hoc networks is challenging given the difficulties of communicating over a wireless channel and the potential heterogeneity and mobility of the devices that form the network. Service placement is the process of selecting an optimal set of nodes to host the implementation of a service in light of a given service demand and network topology. The key advantage of active service placement in ad hoc networks is that it allows for the service configuration to be adapted continuously at run time. Service Placement in Ad Hoc Networks proposes the SPi service placement framework as a novel approach to service placement in ad hoc networks. The SPi framework takes advantage of the interdependencies between service placement, service discovery and the routing of service requests to minimize signaling overhead. The work also proposes the Graph Cost / Single Instance and the Graph Cost / Multiple Instances placement algorithms.

Describes a SPi service placement framework as a novel approach to service placement in ad hoc networks Proposes the Graph Cost/Single Instance and the Graph Cost/Multiple Instances placement algorithms Examines the properties of this approach to service placement and compares it with other recent proposals Includes supplementary material: sn.pub/extras

Inhalt

Introduction.- Background.- The SPi Service Placement Framework.- SPi Service Placement Algorithms.- Evaluation.- Conclusion.