• No results found

A Novel Data transferring from sender to receiver using the Router in Tolerant Networks

N/A
N/A
Protected

Academic year: 2020

Share "A Novel Data transferring from sender to receiver using the Router in Tolerant Networks"

Copied!
5
0
0

Loading.... (view fulltext now)

Full text

(1)

International Journal of Research (IJR)

e-ISSN: 2348-6848, p- ISSN: 2348-795X Volume 2, Issue 09, September 2015

Available at http://internationaljournalofresearch.org

A Novel Data transferring from sender to receiver using

the Router in Tolerant Networks

Kammari Rajarajeshwari

1

& N.Shiva Kumar

2

1M-Tech Dept. of CSE Megha Institute of Engineering & Technology for Women

2Assistant Professor Dept. of CSE Megha Institute of Engineering & Technology for Women

Abstract

Disruption tolerant networks (DTNs) are described by low node stupidity, erratic node versatility, and absence of worldwide system data. The vast majority of flow examination deliberations in DTNs concentrate on information sending, however just restricted work have been carried out on giving effective information access to portable clients. In this paper, we propose a novel methodology to help cooperative caching in DTNs, which empowers the offering and coordination of stored information among different nodes and diminishes information access delay.A utility-based cache replacement scheme to dynamically adjust cache locations based on query history, and this scheme achieves good tradeoff between the data accessibility and access delay. A Contact Duration Aware Approach a novel caching protocol adaptive to the challenging surroundings of DTNs. To derive an adaptive caching bound for each mobile node according to its specific contact pattern with others, to limit the quantity of information it caches. In this way, both the storage space and the contact opportunities are better utilized. Extensive trace-driven simulations show that our cooperative caching protocol can significantly improve the performance of data access in DTNs

1. INTRODUCTION

Disruption tolerant networks (DTNs) consist of mobile devices that contact each other opportunistically. Due to the low node density and unpredictable node mobility, noise, sparsity of nodes, and lack of global network information only intermittent network connectivity exists in DTNs and the subsequent difficulty maintaining end-to-end communication links makes it necessary to use “carry-and-forward” methods for data transmission. In such networks, node mobility is exploited to let mobile nodes carry data as relays and forward data opportunistically when contacting others. The key problem is, therefore, how to determine the appropriate relay selection strategy. Although forwarding schemes have been proposed in DTNs there is limited research on providing efficient data access to

mobile users, despite the importance of data accessibility in many mobile applications

(2)

International Journal of Research (IJR)

e-ISSN: 2348-6848, p- ISSN: 2348-795X Volume 2, Issue 09, September 2015

Available at http://internationaljournalofresearch.org

with heterogeneous node contact patterns and behaviors.

A common technique used to improve data access performance is caching, i.e., to cache data at appropriate network locations based on query history, so that queries in the future can be responded with less delay. Although cooperative caching has been studied for both web-based applications and wireless ad hoc networks to allow sharing and coordination among multiple caching nodes, it is difficult to be realized in DTNs due to the lack of persistent network connectivity. First, the opportunistic network connectivity complicates the estimation of data transmission delay, and furthermore makes it difficult to determine appropriate caching locations for reducing data access delay. This difficulty is also raised by the incomplete information at individual nodes about query history. Second, due to the uncertainty of data transmission, multiple data copies need to be coached at different locations to ensure data accessibility. The difficulty in coordinating multiple caching nodes makes it hard to optimize the tradeoff between data accessibility and caching overhead.

2. RELATED WORK

Existing system:

In the existing system, research on data forwarding in DTNs originates from Epidemic routing], which floods the entire network. Some later studies focus on proposing efficient relay selection metrics to approach the performance of Epidemic routing with lower forwarding cost, based on prediction of node contacts in the future. Some schemes do such prediction based on their mobility patterns, which are

characterized by Kalman filter or semi-Markov chains. In some other schemes, node contact pattern is exploited as abstraction of node mobility pattern for better prediction accuracy, based on the experimental and theoretical analysis of the node contact characteristics. The social network properties of node contact patterns, such as the centrality and community structures, have also been also exploited for relay selection in recent social-based data forwarding schemes.

Proposed system:

In the proposed system, we propose a novel scheme to address the aforementioned challenges and to efficiently support cooperative caching in DTNs. Our basic idea is to intentionally cache data at a set of network central locations (NCLs), each of which corresponds to a group of mobile nodes being easily accessed by other nodes in the network. Each NCL is represented by a central node, which has high popularity in the network and is prioritized for caching data. Due to the limited caching buffer of central nodes, multiple nodes near a central node may be involved for caching, and we ensure that popular data are always cached nearer to the central nodes via dynamic cache replacement based on query history.

(3)

International Journal of Research (IJR)

e-ISSN: 2348-6848, p- ISSN: 2348-795X Volume 2, Issue 09, September 2015

Available at http://internationaljournalofresearch.org

3. IMPLEMENTATION

Service Provider

In this module, the Service Provider sends their file to the particular receivers. For the security purpose the Service Provider encrypts the data file and then store in the network central locations (NCL 1, NCL 2 and NCL 3). The Service Provider can have capable of manipulating the encrypted data file. The service provider will send the file to particular receivers.

Router

The Router manages a multiple nodes to provide data storage service. In Router n-number of nodes are present, before sending any file to receiver energy will be generate in a router and then select a smallest energy path and send to particular receivers. Service Provider encrypts the data files and stores them in the network central locations for sharing with data receivers. To access the shared data files, data receivers download encrypted data files of their interest from the Network Central Location and then decrypt them.

Network Central Location

All uploaded files are stored in Network Central Locations (NCL 1, NCL 2 and NCL 3), via network central locations file will send to particular receivers. Receiver has request the file to router, then it will connect to NCL and check the file in network central locations & then send to receiver. If the requested file is not present in network central locations then response (file is not exist) will send to receiver. The receivers receive the file by without changing the File Contents.

Receiver (End User)

In this module, the receiver can receive the data file with the encrypted key to access the file. The Receiver has request the file to router, it will connect to NCL and check the file in all network central locations & then send to receiver. If receiver enters file name is not present in all network central locations then the receiver is getting the file response from the router and also shows delay of time in router. The receivers receive the file by without changing the File Contents. Users may try to access data files within the network only.

4. EXPERIMENTAL RESULTS

Fig:-1 Data upload In Network

(4)

International Journal of Research (IJR)

e-ISSN: 2348-6848, p- ISSN: 2348-795X Volume 2, Issue 09, September 2015

Available at http://internationaljournalofresearch.org

Fig:-3 Data Transfer Path

Fig:-4 Moving Packets

Fig:-5 Revised Data in Receiving End

Fig: - Results

5. CONCLUSION

(5)

International Journal of Research (IJR)

e-ISSN: 2348-6848, p- ISSN: 2348-795X Volume 2, Issue 09, September 2015

Available at http://internationaljournalofresearch.org

takes important step towards fast data access with complete avoidance of data delay in the future

6. REFERENCES

[1] Fall, K. (2003). A Delay-Tolerant Network Architecture for Challenged Internets.In Proceedings of ACM SIGCOMM 2003.

[2] Seth, A., Kroeker, D., Zaharia, M., Guo, S., and Keshav, S. (2006). Low-cost Communication for Rural Internet Kiosks Using Mechanical Backhaul.In Proceedings of ACM MOBICOM 2006.

[3] Chaintreau, A., Hui, P., Crowcroft, J., Diot, C., Gass, R., Scott, J. (2006). Impact of Human Mobility on the Design of Opportunistic Forwarding Algorithms.In Proceedings of INFOCOM 2006.

[4] Palen, L. and Liu, S. (2007). Citizen Communications in Crisis: Anticipating a Future of ICT-Supported Participation, In Proceedings of ACM CHI 2007.

[5] H. Cai and D.Y. Eun, “Crossing over the Bounded Domain: From Exponential to Power-Law Inter-Meeting Time in MANET,” Proc. ACM MobiCom, pp. 159-170, 2007.

[6] P. Cao and S. Irani, “Cost-Aware WWW Proxy Caching Algorithms,” Proc. USENIX Symp.Internet Technologies and Systems, 1997.

[7] A. Chaintreau, P. Hui, J. Crowcroft, C. Diot, R. Gass, and J. Scott, “Impact of Human Mobility on Opportunistic Forwarding Algorithms,” IEEE Trans. Mobile Computing, vol. 6, no. 6, pp. 606-620, June 2007.

[8] W. Gao, G. Cao, A. Iyengar, and M. Srivatsa, “Supporting Cooperative Caching in Disruption Tolerant Networks,” Proc. Int’l Conf. Distributed Computing Systems (ICDCS), 2011.

[9] C. Boldrini, M. Conti, and A. Passarella, “ContentPlace: Social- Aware Data Dissemination in Opportunistic Networks,” Proc. 11th Int’l Symp. Modeling, Analysis and Simulation of Wireless and Mobile Systems (MSWiM), pp. 203-210, 2008.

[10] W. Gao, Q. Li, B. Zhao, and G. Cao, “Multicasting in Delay Tolerant Networks: A Social Network Perspective,” Proc. ACM MobiHoc, pp. 299-308, 2009.

Author Profile

Dr.Shaik Abdul Muzeer

Professor & Principal

Megha institute of Engineering & Technology for

Women

Dr.S.A.Muzeer, at present working as a principal of

Megha institute of engineering & Technology has

completed his PG and P.HD in Electronics &

Communication Engineering and published

around 25 Papers in National & International

Journals. His area of research is Digital signal

References

Related documents

Dependent variable, in this study, was tax morale where the variables of religiosity, national pride, and importance of religion, importance of politics,

‘The Future Of The World Social Forum’ Social Movements Assembly: an Actor within a Space.

Figure 2 indicates the representative chromatographic peaks of FFAs in the sediment samples in both seasons while the free fatty acid levels of the river sediments

1) To assess the level of maternal knowledge about folic acid among women attending well baby clinic in ministry of health primary health care centers in

The master then generates a (re)start condition and the 8−bit read slave address/data direction byte, and clocks out the register data, eight bits at a time. The master generates

ARCA was meant to make our research and our researchers more visible within and outside the research community, to help us attracting research funds from the academic community

Based on th e MMB analysis, the evidence of new roughness regimes is provided by segregating the scale separations between inner-length-scale and roughness, outer-

Mutation analy- sis of the EGFR gene revealed a different mutation in each tumor (on exon 19) confirming the diagnosis of 2 meta- chronous primary lung cancers.. 20,21 Both EGFR