Bounded Relay Hop Mobile Data Gathering in Wireless Sensor Networks

摘要: Recent study reveals that great benefit can be achieved for data gathering in wireless sensor networks by employing mobile collectors gather via short-range communications. To pursue maximum energy saving at nodes, intuitively, a collector should traverse the transmission range of each field such packet directly transmitted to without any relay. However, this approach may lead significantly increased latency due low moving velocity collector. Fortunately, it is observed effectively shortened performing proper local aggregation multihop transmissions and then uploading aggregated In scheme, number hops not arbitrarily large as increase consumption on relays, which would adversely affect overall efficiency gathering. Based these observations, paper, we tradeoff between exploring balance relay hop count tour length We first propose polling-based formulate into an optimization problem, named bounded (BRH-MDG). Specifically, subset sensors will selected polling points buffer locally upload when arrives. meanwhile, are affiliated with points, guaranteed within given hops. give two efficient algorithms selecting among sensors. The effectiveness our validated through extensive simulations.