科研之友
微信
新浪微博
Facebook
分享链接
摘要
Routing in communication networks involves the indirection from a persistent name (ID) to a locator. The locator specifies how packets are delivered to a destination with a particular ID. Such a mapping is provided by a routing table entry, i.e. state. In a DTN, it is hard to maintain routing state because intermittent connectivity prevents protocols from refreshing states when they become inaccurate. In prior work, per-destination state mostly corresponds to utilities, where a high utility value about a destination implies that the probability to encounter the destination for the node maintaining the state is high. This approach depends on a particular mobility pattern in which nodes that met frequently in the past are likely to encounter in the future. In this paper, we use the concept of weak state that does not rely on external messages to remain valid (Acer et al. in MobiCom '07: proceedings of the 13th annual ACM international conference on mobile computing and networking, pp 290-301, 2007). Our weak state realization provides probabilistic yet explicit information about where the destination is located. We build Weak State Routing protocol for Delay Tolerant Networks (WSR-D) that exploits the direction of node mobility in forwarding. It provides an osmosis mechanism to disseminate the state information to the network. With osmosis, a node has consistent information about a portion of the nodes that are located in regions relevant to its direction of mobility. Through simulations, we show that WSR-D achieves a higher delivery ratio with smaller average delay, and reduces the number of message transfers in comparison to Spray & Wait (Spyropoulos et al. in Proceedings of ACM SIGCOMM 2005 workshops: conference on computer communications, pp 252-259, 2005) and Spray & Focus (Spyropoulos et al. in IEEE/ACM Trans Netw, 16(1):77-90, 2008), a stateless and a utility based protocol, respectively.
- 出版日期2011-7
