Abstract

In this paper we propose an adaptive square-shaped trajectory (ASST)-based service location method to ensure load scalability in wireless sensor networks. This first establishes a square-shaped trajectory over the nodes that surround a target point computed by the hash function and any user can access it, using the hash. Both the width and the size of the trajectory are dynamically adjustable, depending on the number of queries made to the service information on the trajectory. The number of sensor nodes on the trajectory varies in proportion to the changing trajectory shape, allowing high loads to be distributed around the hot spot area.

Highlights

  • Advances in wireless networking have set new paradigms in computing, including pervasive computing based on a large-scale wireless sensor network

  • We have proposed a new energy efficient and scalable data dissemination method, i.e., adaptive square-shaped trajectory (ASST), based on Distributed Hash Table (DHT) and Trajectory Based Forwarding (TBF)

  • ASST is a type of data-centric storage system for sensor networks

Read more

Summary

Introduction

Advances in wireless networking have set new paradigms in computing, including pervasive computing based on a large-scale wireless sensor network. Service information is very time critical in pervasive computing; the service location protocol for the wireless sensor network should provide high accessibility to service information [21,22,23]. The easiest way to provide high accessibility is to periodically broadcast (flood) service information to the entire network. This method entails major energy consumption, but it is simple and some protocols use this approach. We propose an adaptive square-shaped trajectory (ASST)-based service location method, which is a novel self-configuring, scalable, energy efficient, and robust service location protocol.

Related Work
Basic Concept
Square-Shaped Trajectory
Dynamic Trajectory
Robustness
Load scalability
Time and message
Performance Evaluation
Conclusions
Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.