SHARP : Secured Hierarchical Anonymous Routing Protocol for MANETs

被引:0
|
作者
Remya, S. [1 ]
Lakshmi, K. S. [2 ]
机构
[1] Rajagiri Sch Engn & Technol, Dept Informat Technol, Network Engn, Ernakulam, India
[2] Rajagiri Sch Engn & Technol, Dept Informat Technol, Ernakulam, India
关键词
Anonymous routing; cluster-based routing; random forwarder; Cryptographic techniques; RSA;
D O I
暂无
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Mobile ad-hoc network (MANET) is one of the developing fields for research and development of wireless network. MANETs are self-organizing, infrastructure less, independent, dynamic topology based, open and decentralized networks. This is an ideal choice for uses such as communication and data sharing. Due to the open and decentralized nature of the network the nodes can join or leave the network as they wish. There is no centralized authority to maintain the membership of nodes in the network. In MANETs security is the major concern in applications such as communication and data sharing. These are so many chances of different types of attacks due to self-organizing property of MANETs. Malicious attacker may try to attack the data packets by tracing the route. They may try to find the source and destination through different types attacks. MANETs are vulnerable to malicious attackers that target to damage and analyze data and traffic analysis by communication eavesdropping or attacking routing protocols. Anonymous routing protocols are used by MANETs that hi des the identity of nodes as well as routes from outside observers. In MANETs anonymity means identity and location anonymity of data sources and destinations as well as route anonymity. However existing anonymous routing protocols have significantly high cost, which worsens the resource constraint problem in MANETs. This paper proposes Secured Hierarchical Anonymous Routing Protocol (SHARP) based on cluster routing. SHARP offers anonymity to source, destination, and routes. Theoretically SHARP achieves better anonymity protection compared to other anonymous routing protocols.
引用
收藏
页数:6
相关论文
共 50 条
  • [1] Energy efficient secured routing protocol for MANETs
    Singh, Tejpreet
    Singh, Jaswinder
    Sharma, Sandeep
    [J]. WIRELESS NETWORKS, 2017, 23 (04) : 1001 - 1009
  • [2] Energy efficient secured routing protocol for MANETs
    Tejpreet Singh
    Jaswinder Singh
    Sandeep Sharma
    [J]. Wireless Networks, 2017, 23 : 1001 - 1009
  • [3] FASRP: A Fully Anonymous Security Routing Protocol in MANETs
    Pan, Jun
    Ma, Lin
    Yu, Kai
    [J]. SECURITY, PRIVACY, AND ANONYMITY IN COMPUTATION, COMMUNICATION, AND STORAGE, 2016, 10066 : 292 - 304
  • [4] EARP: Energy-aware Anonymous Routing Protocol in MANETs
    Selvi, S. Kalai
    Ganeshkumar, V.
    [J]. 2014 INTERNATIONAL CONFERENCE ON ADVANCED COMMUNICATION CONTROL AND COMPUTING TECHNOLOGIES (ICACCCT), 2014, : 1143 - 1147
  • [5] ALERT: An Anonymous Location-Based Efficient Routing Protocol in MANETs
    Shen, Haiying
    Zhao, Lianyu
    [J]. IEEE TRANSACTIONS ON MOBILE COMPUTING, 2013, 12 (06) : 1079 - 1093
  • [6] Performance of Secured Zone Routing Protocol due to the Effect of Malicious Nodes in MANETs
    Ravilla, Dilli
    Putta, Chandra Shekar Reddy
    [J]. 2013 FOURTH INTERNATIONAL CONFERENCE ON COMPUTING, COMMUNICATIONS AND NETWORKING TECHNOLOGIES (ICCCNT), 2013,
  • [7] A New Location-Aware Hierarchical Routing Protocol for MANETs
    Khan, Farrukh Aslam
    Ahn, Khi-Jung
    Song, Wang-Cheol
    [J]. UBIQUITOUS INTELLIGENCE AND COMPUTING, 2010, 6406 : 519 - +
  • [8] Improving the efficiency of anonymous routing for MANETs
    Chen, Jiefeng
    Boreli, Roksana
    Sivaraman, Vijay
    [J]. COMPUTER COMMUNICATIONS, 2012, 35 (05) : 619 - 627
  • [9] Heavy Secured Routing Protocol: A Secured Routing Protocol for Wireless Networks
    Ganeshkumar, P.
    Gopalakrishnan, S.
    [J]. JOURNAL OF COMPUTATIONAL AND THEORETICAL NANOSCIENCE, 2015, 12 (06) : 1086 - 1095
  • [10] An anonymous on-demand source routing in MANETs
    Zou, Chao
    Chigan, Chunxiao
    [J]. SECURITY AND COMMUNICATION NETWORKS, 2009, 2 (06) : 476 - 491