摘要

In this paper, we introduce a delay-sensitive service that involves transmitting large amounts of location-based data to nodes at multiple locations. Given a limited amount of access points (APs) and an abundance of service requests that result from the nodes moving around, a typical content delivery service would inevitably introduce considerable delay. To solve this problem, we analyze the movement pattern of mobile nodes and approximate it as a semi-Markov process. Based on this model, we explore different components of the underlying service delay and propose that APs should use a multicast strategy to minimize the queuing delay component. Furthermore, we demonstrate the feasibility of employing nodes, which already have their own local copies of location-relevant data, to relay such data to other nodes by employing one or multiple communication channels. Lastly, we examine the resulting algorithms and study their performance relative to baseline content-delivery schemes through simulations.

  • 出版日期2011-3
  • 单位rutgers