Abstract
Wireless sensor networks (WSNs) serving in hostile environments are susceptible to multiple collocated failures due to explosives, and natural calamities such as avalanches, landslides etc., which could partition the network into disjoint segments. A similar scenario is encountered when autonomous WSNs need to collaborate for achieving a common task; therefore, federating the segments or individual WSNs would be essential for sharing data between them. The federation may be achieved by populating relay nodes and providing perpetual inter-segment paths. In this paper, we tackle the federation problem while considering constrained relay availability that makes the problem more challenging. We exploit the use of a limited number of mobile relays to provide intermittent inter-segment connectivity. We propose LOAF, a novel algorithm for LOad and resource Aware Federation of multiple sensor sub-networks. LOAF strives to group the segments into multiple clusters considering the amount of energy consumed to support the inter-segment traffic as well as proximity between segments. The formed inter-cluster topology is star-shaped where the segments in each cluster are served by a distinct mobile relay and a central cluster provides inter-cluster data delivery. During forming a central cluster, LOAF opts to balance the load on the individual mobile relays in terms of energy consumed in travel and in wireless communication. We analyze the properties of LOAF mathematically and validate its performance through extensive simulation experiments.
Highlights
WSNs have attracted increased interest in recent years due to their numerous civil, scientific and military applications
We propose a novel algorithm for LOad and resource Aware Federation of multiple sensor sub-networks (LOAF) by forming a k-clustered topology where the energy consumption overhead in touring and data transporting is balanced among the k mobile data carriers (MDCs)
We have proposed LOAF, a novel approach that groups the segments into k clusters and defines energy-efficient and balanced tour paths for the mobile relays by factoring in both inter-segment data volume and proximity to the formed clusters
Summary
Ns have attracted increased interest in recent years due to their numerous civil, scientific and military applications. Most published solutions exploit the deployment of stationary relay nodes and formulate the federation problem as finding the locations of the least relay count to form a stable inter-segment topology [2]. S. Lee et al.: LOAF: Load and Resource Aware Federation of Multiple Sensor Sub-Networks where the relay count is not sufficient to form a perpetual topology; instead multiple mobile data carriers (MDCs) are employed to form intermittent communication links among the segments. We propose a novel algorithm for LOad and resource Aware Federation of multiple sensor sub-networks (LOAF) by forming a k-clustered topology where the energy consumption overhead in touring and data transporting is balanced among the k MDCs. LOAF consists of two phases. In the 1st phase, LOAF first tries to find the energy-based center of mass of S while considering the inter-segment data volume, hereafter denoted as eG.
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
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 callDisclaimer: 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.
