Monday, February 26, 2018

Efficient File Search in Delay Tolerant Networks with social content and contact Awareness



Today everyone is having one or more personal gadgets like mobile, laptops, tablets and other digital devices. Each of those can be connected together to form a network. But there are certain conditions or places where the network connectivity is not good or available all the time. In such case, there is a continuous study on DTN (Delay Tolerant Networking).

What is DTN?

It is a method of a computer network architecture used to solve the issues in connecting or technical issues in heterogeneous networks that has not continuous network connectivity. 

Disruption may occur due to fault in sparsity of mobile nodes, wireless radio range, attack, noise, and energy resources. It is important for the people those who are communicating with each other specially planned networks in space, extreme terrestrial environments etc.

Combination of Content and Contact Based Methods:

Content and Contact based methods need to be used as combined because in only contact based technique there are departments of nodes under a community. It is a fact that under this process there are inter-community searches. 

Since the communities are not having the content information. A community needs complete information about the content indexes of all other communities otherwise the process will go inefficient and costlier.

Actual Process:

The content or contact based file searching is actually an algorithm. It works on the property of social network. Each and every node has a system with its own interest list. Whenever a file has been searched from any node it has been passed on to another node if the file is not available there. 

Now another node can check in its system about the requested file, if it is not the file holder then it checks whether it is located in its destination community. If it is then it initiates the intra-community search. If the file has been found then it has been forwarded to the requested node. 

In case the current node is not the destination community then it performs inter-community searching. After detecting the right community where the file has been located, the request has been passed to the destination community and finally, the intra-community search has been activated to find the right node there. 

It is very necessary for every community to have the proper introduction that may result in saving energy during searching. In order to make it quick each request has a specific TTL or Time To Live, if the file has not been searched within that time the request has been expired and the process ends.

Conclusion:


This method can definitely help in enhancing the efficiency of a search through social media networks. Each and every node’s content is important and does matters a lot in the proper searching of a file.  Even the moment pattern of nodes can help predict the right search results about a requested file. 

It is based on a virtual communication among the nodes having content of common interest as a community. A file request can be passed from one to another with a higher possibility of common content or interest. This method has been tested with others on NS-2 simulator and real-world GENI testbed both community and real-trace based mobility models and found very helpful.

No comments:

Post a Comment

Hybrid scheme of public-key encryption

Hybrid scheme of public-key encryption We introduce a hybrid homomorphic encryption that combines public-key encryption (PKE) and som...