No abstract

No abstract

No abstract

Nodes in wireless sensor networks continuously monitor their surroundings and report to the base station if there is any anomaly. WSN in extreme environmental conditions can suffer from a large scale failure where multiple nodes fail simultaneously and the network gets partitioned into disjoint segments. In addition, in some application multiple standalone WSNs need to be federated to collectively handle an emerging event that requires data sharing among these networks. Numerous approaches have been proposed in the literature to establish connectivity among these network segments by deploying stationary relay nodes (RN) to form data path. In scenarios where the available resources are limited, one or very few mobile data collectors (MDCs) can be used to create intermittent links among the disjoint segments. In this paper, we investigate a federation problem in scenarios where the number of available MDCs is less than the number of RNs required and more than the number of network segments. We present an algorithm to find an optimized travel routes for the MDCs so that the average delay of the network is minimized. The performance of the algorithm is validated through simulation.

Wireless sensor networks (WSNs) are used to continuously monitor certain area of interest and send data back to the base station for processing. In many applications, WSNs serve in inhospitable environments where multiple node failure may take place causing the network to be divided into disjoint segments. Also, multiple standalone WSNs in some applications may need to be federated to collectively handle an important event that requires data sharing among these networks. A viable approach for establishing connectivity among these network segments is by employing mobile data collectors (MDCs). Few MDCs can be used to create intermittent links among the segments by touring and carrying data. Obviously, the travel path of the MDCs will affect the date delivery latency. In this paper, we present an algorithm to form an intermittent star topology so that the average and maximum delay for delivering the inter-segment traffic is reduced. The performance of the algorithm is validated through simulation.