Name
Abstract | ||
|---|---|---|
Message routing is one of the major challenges in Mobile Delay Tolerant Networks (MDTNs) due to frequent and long-term network partitions. A number of routing protocols for MDTNs belong to the category of prediction-based routing protocols, which utilize the social encounter probability of nodes to guide message forwarding. However, these prediction-based routing protocols compromise the privacy of the nodes by revealing their mobility patterns. In this paper, we propose the Privacy Preserving Probabilistic Prediction-based Routing (4PR) protocol that forwards messages by comparing aggregated information about communities instead of individual nodes. Specifically, it compares the probability that at least one node in a community will encounter the destination node. We present theoretical security analyses as well as practical performance evaluations. Our simulations on a well established community-based mobility model demonstrate that our routing protocol has comparable performance to existing prediction-based protocols. Additionally, the community information is computed efficiently and independently of the routing protocol. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1016/j.comnet.2016.08.005 | Computer Networks |
Keywords | Field | DocType |
Privacy,Routing protocols,Mobile computing,Delay tolerant networks | Link-state routing protocol,Dynamic Source Routing,Computer science,Static routing,Computer network,Interior gateway protocol,Wireless Routing Protocol,Routing Information Protocol,Routing protocol,Distributed computing,Zone Routing Protocol | Journal |
Volume | ISSN | Citations |
111 | 1389-1286 | 0 |
PageRank | References | Authors |
0.34 | 0 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jingwei Miao | 1 | 43 | 4.30 |
| Omar Hasan | 2 | 120 | 13.39 |
| Sonia Ben Mokhtar | 3 | 596 | 44.86 |
| Lionel Brunie | 4 | 686 | 126.62 |
| Ammar Hasan | 5 | 5 | 2.88 |