Please use this identifier to cite or link to this item:
|Title:||A service collaboration strategy for MANETs|
|Source:||Zheng, S.,Zhang, D.,Ngoh, L.H.,Guo, H.,Ni, X.,Mohan, G. (2007). A service collaboration strategy for MANETs. 2006 IEEE International Conference on Industrial Informatics, INDIN'06 : 155-159. ScholarBank@NUS Repository. https://doi.org/10.1109/INDIN.2006.275752|
|Abstract:||With the emergency of the ubiquity of mobile personal computing devices and the pervasiveness of wireless broadband communication, mobile ad hoc networks (MANETs) are becoming applicable and popular in the area of pervasive computing. A device can roam into a wireless network to provide networked services which can be discovered and utilized by other services. However, the prevalent service discovery protocols, such as UPnP, Salutation, SLP and Jini, fall short of accommodating the complexities and special characteristics of MANETs, such as highly dynamic topology, intermittent connectivity and constrained resources. Some service collaboration solutions based on peer-to-peer caching or virtual backbone have been proposed for MANETs. They aims to increase the service availability while decreasing the network trafile. This paper suggests a service collaboration strategy for MANETs aiming to further increase the service availability and stabilize the service collaboration system. Slotted bandwidth utilization scheme and mobile service code scheme efficiently utilize the available bandwidth to duplicate network services in mobile nodes and to transmit the prioritized service collaboration information. The radio propagation range is adaptively adjusted according to the density of mobile nodes so that the battery power consumed is reduced. © 2006 IEEE.|
|Source Title:||2006 IEEE International Conference on Industrial Informatics, INDIN'06|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Dec 13, 2017
checked on Dec 9, 2017
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.