Service Placement in Ad Hoc Networks (Paperback, 2012)

,
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.

R1,580

Or split into 4x interest-free payments of 25% on orders over R50
Learn more

Discovery Miles15800
Mobicred@R148pm x 12* Mobicred Info
Free Delivery
Delivery AdviceShips in 10 - 15 working days


Toggle WishListAdd to wish list
Review this Item

Product Description

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.

Customer Reviews

No reviews or ratings yet - be the first to create one!

Product Details

General

Imprint

Springer London

Country of origin

United Kingdom

Series

SpringerBriefs in Computer Science

Release date

2012

Availability

Expected to ship within 10 - 15 working days

First published

2012

Authors

,

Dimensions

235 x 155 x 6mm (L x W x T)

Format

Paperback

Pages

116

Edition

2012

ISBN-13

978-1-4471-2362-0

Barcode

9781447123620

Categories

LSN

1-4471-2362-X



Trending On Loot