Exploiting Contact Spatial Dependency for Opportunistic Message Forwarding Export

@article{chen:spatial, abstract = {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.}, address = {Los Alamitos, CA, USA}, author = {Chen, Chao and Chen, Zesheng}, citeulike-article-id = {5650064}, citeulike-linkout-0 = {http://doi.ieeecomputersociety.org/10.1109/TMC.2009.55}, citeulike-linkout-1 = {http://dx.doi.org/10.1109/TMC.2009.55}, citeulike-linkout-2 = {http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=4799784}, day = {12}, doi = {10.1109/TMC.2009.55}, issn = {1536-1233}, journal = {Mobile Computing, IEEE Transactions on}, keywords = {crawdad, forwarding, information-dissemination, opportunistic-networks, routing, umass\_diesel}, month = {October}, number = {10}, pages = {1397--1411}, posted-at = {2009-08-31 10:08:18}, priority = {2}, publisher = {IEEE Computer Society}, title = {Exploiting Contact Spatial Dependency for Opportunistic Message Forwarding}, url = {http://dx.doi.org/10.1109/TMC.2009.55}, volume = {8}, year = {2009} }

TY - JOUR ID - chen:spatial L3 - citeulike-article-id:5650064 N2 - 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. IS - 10 JF - Mobile Computing, IEEE Transactions on SN - 1536-1233 AD - Los Alamitos, CA, USA EP - 1411 TI - Exploiting Contact Spatial Dependency for Opportunistic Message Forwarding PB - IEEE Computer Society VL - 8 SP - 1397 KW - crawdad KW - forwarding KW - information-dissemination KW - opportunistic-networks KW - routing KW - umass_diesel AU - Chen, Chao AU - Chen, Zesheng PY - 2009/10/12/ UR - http://dx.doi.org/10.1109/TMC.2009.55 ER -