Title

Evaluating Contacts for Routing in Highly Partitioned Mobile Networks

Document Type

Article

Publication Date

6-11-2007

Publication Source

ACM/SIGMOBILE First International Workshop on Mobile Opportunistic Networking (MobiOpp 2007)

Inclusive pages

17-24

DOI

http://dx.doi.org/10.1145/1247694.1247698

Publisher

Association for Computing Machinery (ACM)

Place of Publication

New York

ISBN/ISSN

9781595936882

Peer Reviewed

yes

Abstract

he movement of real users often follows some patterns that can be characterized by certain statistical metrics of the contacts. Such metrics are useful for nodes to make routing decisions, especially in sparse mobile ad hoc networks where instantaneous network connectivity is rare and messages are delivered using store-carry-forward routing. None of the statistical metrics used in existing routing algorithms considers the dependency between neighboring contacts, thus resulting in an inaccurate estimation of message delays over paths. In this paper, a new metric called the expected dependent delay that characterizes the expected delay of a contact dependent on the previous hop is proposed. With this new metric, the closed-form expression for the expected delay of a path is given and can be further simplified in highly partitioned mobile networks. Simulation results show that the proposed algorithm has a significant improvement in terms of the message delay than those that consider only the delivery probability or the expected delay.

Disciplines

Engineering

This document is currently not available here.

  Contact Author

Share

COinS
 
 

Link to Original Published Item

http://dl.acm.org/citation.cfm?id=1247698