Up-and-Down Routing through Nested Core-periphery Hierarchy in Mobile Opportunistic Social Networks (May-2017)

Aim:

The aim of the project is improving secured transmission to upload & download files(messages) from source to destination using up & down routing protocol.

Proposed system:

An up-and-down routing protocol, which has an upload phase and a download phase. A message can be uploaded from the source to the network core, through iteratively forwarding the message to a relay that has a higher position in the NCPH. Bloom-filter-based routing hints are
proposed to provide guidance for the message download. Subtle balances among the data delivery delay, ratio, and cost are achieved by the up-and-down routing protocol. Experimental results show that good data delivery delay and ratio are achieved, with a small cost on the prior information maintenance and a low forwarding cost.

These tradeoffs enable our routing protocol to achieve a good data delivery delay and ratio, with a low prior information collection cost and a low forwarding cost.
• We systematically explore the MOSNs, verifying the existences of the NCPH. An up-and-down routing protocol is proposed by utilizing the NCPH. It has a good data delivery delay and ratio, with a low prior information collection cost and a low forwarding cost.
• We study the message upload in different network hierarchies. We show that the NCPH has a subtle difference from the degree or weighted-degree network hierarchies. A distributed labeling scheme is proposed to determine the NCPH with a granularity control.
• We introduce Bloom-filter-based hints as the download routing guidance to achieve a good data delivery delay and ratio, with a low prior information collection cost and a low forwarding cost.
• Extensive real trace-driven experiments are conducted to evaluate the proposed solutions. Multiple real traces are analyzed. The experimental results are shown from different perspectives to provide insightful conclusions