Enhancing the performance of service discovery protocol using minimum spanning tree Online publication date: Wed, 08-Jul-2020
by Cynthia Jayapal; Senthil Jayavel; V. Vanitha
International Journal of Mobile Communications (IJMC), Vol. 18, No. 4, 2020
Abstract: In a wireless sensor network, aggregation is either done to avoid the redundant transmissions. In service provisioning, the control packets sent for service advertisement and discovery contribute significantly to the network traffic. In this paper, it is proposed to aggregate the similar control packets sent from different sources to a common destination along with minimum spanning tree, which is constructed for service provisioning. The mobile agent migration schemes used in the literature have got overhead in finding the migration path. Therefore, the proposed approach uses the spanning tree constructed for service discovery, as the migration path for the mobile agents. It is found from the investigation that the aggregation scheme has reduced average energy spent by 33%, control overhead by 12% and average discovery delay by 25%. Use of mobile agents has reduced the average discovery delay by 22%, control overhead by 19% and service discovery success ratio by 4%.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Mobile Communications (IJMC):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook