Exploiting Contact Spatial Dependency for Opportunistic Message Forwarding

被引:17
作者
Chen, Chao [1 ]
Chen, Zesheng [2 ]
机构
[1] Indiana Univ Purdue Univ, Dept Engn, Ft Wayne, IN 46805 USA
[2] Florida Int Univ, Dept Elect & Comp Engn, Miami, FL 33174 USA
关键词
Opportunistic networks; delay-tolerant networks; routing; spatial dependency; end-to-end delay; CONNECTED MOBILE NETWORKS;
D O I
10.1109/TMC.2009.55
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The movement of real users often follows patterns that can be characterized by certain statistical metrics of the contacts. Such metrics are useful for routing decisions, especially in sparse mobile ad hoc networks where node connectivity is opportunistic and messages are delivered using store-carry-forward routing. Past analysis on real-world data traces indicates that human behaviors affect the node contact pattern and spatial dependency exists among mobile nodes. A new metric called the expected dependent delay that characterizes the expected delay of a contact dependent on the previous hop is proposed. It characterizes the spatial dependency between neighboring contact pairs and reflects the regularity in node movement. In sparse opportunistic mobile ad hoc networks, a good approximation of the expected delay of a multihop path can be derived as the sum of the expected delay of the first hop and the expected dependent delays of later hops. We apply the proposed path-delay estimation to end-to-end routing. Simulation results show that compared with routing schemes that consider only the delivery probability or the expected delay, the proposed scheme can reduce the message delay significantly, when the network is sufficiently sparse and the spatial dependency is quantitatively constant over time. Moreover, the proposed method is tractable and can be easily implemented in combination with other routing techniques such as multipath routing and per-contact routing.
引用
收藏
页码:1397 / 1411
页数:15
相关论文
共 51 条
[1]   The state of the art in interplanetary Internet [J].
Akyildiz, IF ;
Akan, ÖB ;
Chen, C ;
Fang, J ;
Su, WL .
IEEE COMMUNICATIONS MAGAZINE, 2004, 42 (07) :108-118
[2]  
[Anonymous], P 3 ACM WORKSH CHALL
[3]  
[Anonymous], P SIGCOMM 04
[4]  
[Anonymous], P ACM MOBIHOC
[5]  
[Anonymous], 2000, CS200006 DUK U DEP C
[6]  
[Anonymous], P ACM MOBIHOC 06 FLO
[7]  
[Anonymous], P MOBIHOC
[8]  
[Anonymous], [No title captured]
[9]  
Arnold Jeffrey L, 2004, Prehosp Disaster Med, V19, P201
[10]  
Balasubramanian A., 2007, P ACM SIGCOMM AUG, P372