Privacy Preserving Data Forwarding using Multi Path Routing in Non-Cooperative Wireless Sensor Network
 |
International Journal of Engineering Trends and Technology (IJETT) | 
|
| © 2015 by IJETT Journal | ||
| Volume-30 Number-8 |
||
| Year of Publication : 2015 | ||
| Authors : Adi Narayana Mogali, Konni Srinivasa Rao |
Citation
Adi Narayana Mogali, Konni Srinivasa Rao"Privacy Preserving Data Forwarding using Multi Path Routing in Non-Cooperative Wireless Sensor Network", International Journal of Engineering Trends and Technology (IJETT), V30(8),409-414 December 2015. ISSN:2231-5381. www.ijettjournal.org. published by seventh sense research group
Abstract
Today’s wireless sensor network have been received much attention due to fast advancement of mobile communication. By implementing such network can be formed by numerous of heterogeneous personal mobile network. In this work, we focus on multi-path routing and forwarding in non-cooperative wireless networks, where nodes rely on each other to forward packets to the destination. Sending packets via multiple paths provide benefits such as route resilience, interference avoidance, and load/energy balancing. This paper present hybrid design for finding malicious nodes in a network, also provide for finding multi path routing and provide privacy of transferred message in the network. In this paper we are using ecliptic curve digital signature algorithm for identification of malicious or genuine nodes in a network. After finding malicious or genuine nodes we can find out multi path routing from source node to destination node. Using differentiate distance algorithm we can find out the multi path routing from source node to destination node. In this paper we can implement another concept for providing privacy of transferring message. By implementing ascii value based text data encryption process for data encryption and decryption. So that by implementing those concepts we can improve efficiency and more security of transferring message.
References
[1] I. Cidon, R. Rom, and Y. Shavitt, “Analysis of multi-path routing,” IEEE/ACM Trans. Networking, vol. 7, no. 6, pp. 885– 896, 1999
[2] H. Suzuki and F. A. Tobagi, “Fat bandwidth reservation scheme with multi-link and multi-path routing in atm networks,” in Proc. IEEE INFOCOM ?92, May 1992.
[3] CORPORATE The ATM Forum, ATM user-network interface specification (version 3.0).
[4] J. Moy, OSPF (version 2), RFC 2328, 1998.
[5] Y. Rekhter, T. Li, and S. Hares, “A border gateway protocol 4 (BGP-4),” RFC 4271, 2006.
[6]S.-J. Lee and M. Gerla, “AODV-BR: backup routing in ad hoc networks,” in Proc. IEEE Wireless Communications and Networking Conference (WCNC ?00), Sep. 2000.
[7] M. Marina and S. Das, “On-demand multi path distance vector routing in ad hoc networks,” in Proc. 9th International Conference on Network Protocols (ICNP ?01), Nov. 2001.
[8] V. D. Park and M. S. Corson, “A highly adaptive distributed routing algorithm for mobile wireless networks,” in Proc. IEEE INFOCOM ?97, Apr. 1997.
[9] Z. Ye, S. V. Krishnamurthy, and S. K. Tripathi, “A framework for reliable routing in mobile ad hoc networks,” in Proc. IEEE INFOCOM ?03, Mar. 2003.
[10] S. Lee and M. Gerla, “Split multipath routing with maximally disjoint paths in ad hoc networks,” in Proc. IEEE International Conference on Communications (ICC ?01), 2001.
[11] P. Papadimitratos, Z. Haas, and E. Sirer, “Path-set selection in mobile ad hoc networks,” in Proc. Third ACM Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc ?02), June 2002
[12] M. R. Pearlman, Z. J. Haas, P. Sholander, and S. S. Tabrizi, “On the impact of alternate path routing for load balancing in mobile ad hoc networks,” in Proc. 1st ACM Interational Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc ?00), Aug. 2000
[13] L. Anderegg and S. Eidenbenz, “Ad hoc-VCG: a truthful and costefficient routing protocol for mobile ad hoc networks with seltsh agents,” in Proc. Ninth International Conference on Mobile Computing and Networking (MobiCom ?03), San Diego, CA, Sep. 2003
[14] V. Srinivasan, P. Nuggehalli, C.-F. Chiasserini, and R. Rao, “Cooperation in wireless ad hoc networks,” in Proc. IEEE INFOCOM ?03, Mar. 2003
[15] W. Wang, S. Eidenbenz, Y. Wang, and X. Y. Li, “OURS: optimal unicast routing systems in non-cooperative wireless networks,” in Proc. Twelfth International Conference on Mobile Computing and Networking (Mobicom ?06), Sep. 2006.
[16] S. Zhong, L. Li, Y. G. Liu, and Y. R. Yang, “On designing incentivecompatible routing and forwarding protocols in wireless ad-hoc networks,” in Proc. Eleventh International Conference on Mobile Computing and Networking (Mobicom ?05), Aug. 2005.
[17] S. Zhong, L. Li, Y. Liu, and Y. Yang, “On designing incentive-compatible routing and forwarding protocols in wireless ad-hoc networks: an integrated approach using game theoretic and cryptographic techniques”, Wireless Networks, Vol. 13, No. 6, 2007, pp. 799–816.
[18] J. Feigenbaum, C. Papadimitriou, R. Sami, and S. Shenker, “A BGP-based mechanism for lowest-cost routing”, Proceedings of the twenty-first annual symposium on Principles of distributed computing, 2002, pp. 173–182.
[19] W. Wang and X.-Y. Li, “Low-cost routing in selfish and rational wireless ad hoc networks”, IEEE Transactions on Mobile Computing, Vol. 5, May 2006, pp. 596–607.
[20] W. Wang, X.-Y. Li, and X. Chu, “Nash equilibria and dominant strategies in routing”, Proceedings of the First international conference on Internet and Network Economics, WINE?05, 2005, pp. 979– 988.
[21] S. Zhong, J. Chen, and Y. Yang, “Sprite: a simple, cheatproof, credit-based system for mobile ad-hoc networks”, Proceedings of theINFOCOM 2003, 2003, pp. 1987–1997.
[22] J. Feigenbaum and S. Shenker, „„Distributed Algorithmic Mechanism Design: Recent Results and Future Directions,?? in Proc. 6th Int?lWorkshop Discr. Algorithms Methods Mobile Comput. Commun., 2002, pp. 1-13.
[23] J. Feigenbaum, C. Papadimitriou, R. Sami, and S. Shenker, „„A BGP-Based Mechanism for Lowest-Cost Routing,?? Distrib. Comput., vol. 18, no. 1, pp. 61-72, July 2005.
[24] M. Feldman, J. Chuang, I. Stoica, and S. Shenker, „„Hidden- Action in Multi-Hop Routing,?? in Proc. 6th ACM Conf. Electron. Commerce, 2005, pp. 117-126.
[25] L. Buttya´n and J. Hubaux, „„Stimulating Cooperation in Self- Organizing Mobile Ad Hoc Networks,?? Mobile Netw. Appl., vol. 8, no. 5, pp. 579-592, Oct. 2003.
[26] S. Zhong, J. Chen, and Y. Yang, „„Sprite: A Simple, Cheat- Proof, Credit-Based System for Mobile Ad-Hoc Networks,?? in Proc. IEEE INFOCOM, 2003, pp. 1987-1997.
[27] L. Anderegg and S. Eidenbenz, „„Ad Hoc-VCG: A Truthful and Cost-Efficient Routing Protocol for Mobile Ad Hoc Networks with Selfish Agents,?? in Proc. MobiCom, 2003, pp. 245-259.
[28] S. Zhong, L. Li, Y. Liu, and Y. Yang, „„On Designing Incentive- Compatible Routing and Forwarding Protocols in Wireless Ad- Hoc Networks: An Integrated Approach Using Game Theoretic and Cryptographic Techniques,?? Wireless Netw., vol. 13, no. 6, pp. 799-816, Dec. 2007.
[29] Y. Wang, V.C. Giruka, and M. Singhal, „„Truthful Multipath Routing for Ad Hoc Networks With Selfish Nodes,?? J. Parallel Distrib. Comput., vol. 68, no. 6, pp. 778-789, June 2008.
[30] F. Wu, S. Zhong, and J. Liu, „„Cost-Effective Traffic Assignment for Multipath Routing in Selfish Networks,?? in Proc. IEEE GLOBECOM, 2007, pp. 453-457.
[31] D. Karger and E. Nikolova, „„On the Expected VCG Overpayment in Large Networks,?? in Proc. 45th IEEE Conf. Decision Control, Dec. 2006, pp. 2831-2836.
[32] K. Talwar, „„The Price of Truth: Frugality in Truthful Mechanisms,?? in Proc. 20th Annu. Symp. Theor. Aspects Comput. Sci., 2003, pp. 608-619.
[33] W. Wang, S. Eidenbenz, Y. Wang, and X.-Y. Li, „„OURS: Optimal Unicast Routing Systems in Non-Cooperative Wireless Networks,?? in Proc. MobiCom, 2006, pp. 402-413.
Keywords
non-cooperative networks, routing and forwarding, Security, cryptography, Multi Path Routing.