TY - GEN
T1 - Social structure based routing of intermittently connected network using contact information
AU - Wang, Muyuan
AU - Nahrstedt, Klara
PY - 2008
Y1 - 2008
N2 - Social structure refers to relatively enduring patterns of behavior and relationship within social systems. In this paper, we propose a novel routing scheme, which takes advantage of the social structure of underlying 'owners' and their mobile devices in intermittently connected networks. We focus on routing by utilizing the social contact information. For example, device-owners come into contact with each other during attending regular meetings. We formulate the routing optimization problem, emphasizing the ever-changing network connectivity. Moreover, we propose an algorithm to infer the social structure by extracting contact information from online gathered traces. We further develop a routing protocol for intermittently connected networks based on that. The performance of our protocol is tested using real network traces. It is shown that the protocol is able to achieve a good delivery rate and latency, which is comparable with the optimal routing, and far outperforms the First Contact protocol. Our protocol is incrementally applicable to many current mobile ad hoc routing protocols.
AB - Social structure refers to relatively enduring patterns of behavior and relationship within social systems. In this paper, we propose a novel routing scheme, which takes advantage of the social structure of underlying 'owners' and their mobile devices in intermittently connected networks. We focus on routing by utilizing the social contact information. For example, device-owners come into contact with each other during attending regular meetings. We formulate the routing optimization problem, emphasizing the ever-changing network connectivity. Moreover, we propose an algorithm to infer the social structure by extracting contact information from online gathered traces. We further develop a routing protocol for intermittently connected networks based on that. The performance of our protocol is tested using real network traces. It is shown that the protocol is able to achieve a good delivery rate and latency, which is comparable with the optimal routing, and far outperforms the First Contact protocol. Our protocol is incrementally applicable to many current mobile ad hoc routing protocols.
UR - http://www.scopus.com/inward/record.url?scp=78650759133&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=78650759133&partnerID=8YFLogxK
U2 - 10.1109/MILCOM.2008.4753141
DO - 10.1109/MILCOM.2008.4753141
M3 - Conference contribution
AN - SCOPUS:78650759133
SN - 9781424426775
T3 - Proceedings - IEEE Military Communications Conference MILCOM
BT - 2008 IEEE Military Communications Conference, MILCOM 2008 - Assuring Mission Success
T2 - 2008 IEEE Military Communications Conference, MILCOM 2008 - Assuring Mission Success
Y2 - 17 November 2008 through 19 November 2008
ER -