TY - GEN
T1 - Load and resource aware federation of disjoint sensor network segments
AU - Lee, Sookyoung
AU - Younis, Mohamed
AU - Anglin, Ben
AU - Lee, Meejeong
N1 - Funding Information:
This research was supported by Basic Science Research Program through the National Research Foundation of Korea funded by the Ministry of Education (2015R1D1A1A01057095), and the Institute for Info. & comm. Tech. Promotion grant from the Korea government (B0126-16-1051). Meejeong Lee is the designated corresponding author.
Publisher Copyright:
© 2017 IEEE.
PY - 2017/7/28
Y1 - 2017/7/28
N2 - 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 can partition the network into disjoint segments. In such a scenario, federating the segments becomes essential for reestablishing communication among segments and resuming the WSN operation. Placing relays has been a popular strategy for forming a connected inter-segment topology. In this paper, we tackle the federation problem while considering constrained relay availability. We exploit the use of a limited number of mobile relays to provide intermittent inter-segment connectivity. We propose FLOWER, a novel algorithm for Federation with LOW inter-segment latency and Even Relay load. FLOWER groups the segments into clusters and forms a star inter-cluster topology where each cluster is served by a distinct mobile relay. A cluster at the center of the area serves as a hub to bound inter-segment communication delay. In addition, FLOWER opts to prolong the lifetime of the mobile relays by balancing the energy overhead due to travel and wireless communication. We validate its performance through extensive simulation experiments.
AB - 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 can partition the network into disjoint segments. In such a scenario, federating the segments becomes essential for reestablishing communication among segments and resuming the WSN operation. Placing relays has been a popular strategy for forming a connected inter-segment topology. In this paper, we tackle the federation problem while considering constrained relay availability. We exploit the use of a limited number of mobile relays to provide intermittent inter-segment connectivity. We propose FLOWER, a novel algorithm for Federation with LOW inter-segment latency and Even Relay load. FLOWER groups the segments into clusters and forms a star inter-cluster topology where each cluster is served by a distinct mobile relay. A cluster at the center of the area serves as a hub to bound inter-segment communication delay. In addition, FLOWER opts to prolong the lifetime of the mobile relays by balancing the energy overhead due to travel and wireless communication. We validate its performance through extensive simulation experiments.
KW - Federation
KW - Intermittent connectivity
KW - Mobile data carrier
KW - Network partitioning
KW - Topology repair
KW - Wireless sensor networks
UR - http://www.scopus.com/inward/record.url?scp=85028320821&partnerID=8YFLogxK
U2 - 10.1109/ICC.2017.7996321
DO - 10.1109/ICC.2017.7996321
M3 - Conference contribution
AN - SCOPUS:85028320821
T3 - IEEE International Conference on Communications
BT - 2017 IEEE International Conference on Communications, ICC 2017
A2 - Debbah, Merouane
A2 - Gesbert, David
A2 - Mellouk, Abdelhamid
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2017 IEEE International Conference on Communications, ICC 2017
Y2 - 21 May 2017 through 25 May 2017
ER -