Feasible bounds for multi-hop routing in sensor networks with mobile sinks

Mobile sink data collection can be accomplished with varying degrees of multi-hop routing. For a given data generation rate, as the extent of multi-hop routing increases, the round trip time of the sink decreases. At the same time, interference experienced by mobile sink-sensor link increases resulting in higher upload times. In the presence of these competing effects and sink constraints, this paper investigates the problem of determining the multi-hop routing that is feasible for the given network and application parameters through an analytical model and validates the predictions using simulations.