Disjoint Multipath Based Secure Routing in Opportunistic Networks

Sanjay K. Dhurandher,
Jagdeep Singh,
Isaac Woungang,
Joel J. P. C. Rodrigues,

Abstract


Opportunistic Networks (OppNets) are composed of wireless nodes opportunistically communicating with each other. These networks are designed to operate in a challenging environment characterized by high delay, intermittent connectivity, and no-guarantee of fixed path between the sender and destination nodes. One of the most vital issues in designing such a network is the security of the messages flowing in it. This paper proposes a new method called Disjoint Multipath based Secure Routing in Opportunistic Networks, called as D-MUST, which relays the message to the destination through four disjoint paths; each applying a soft-encryption technique to prevent message fabrication attacks. Simulations are conducted using the HAGGLE INFOCOM 2006 real mobility data traces, showing that when time-to-live is varied, (1) the proposed D-MUST scheme outperforms RSASec by 15.05%, 8.4%, 5.81% 2.16% respectively in terms of delivery probability, hop count, messages dropped and average latency; (2) it also outperforms SHBPR by 16.17%, 9.2%, 6.85%, 3.95% respectively in terms of delivery probability, hop count, messages dropped and average latency.


Citation Format:
Sanjay K. Dhurandher, Jagdeep Singh, Isaac Woungang, Joel J. P. C. Rodrigues, "Disjoint Multipath Based Secure Routing in Opportunistic Networks," Journal of Internet Technology, vol. 20, no. 6 , pp. 1683-1692, Nov. 2019.

Full Text:

PDF

Refbacks

  • There are currently no refbacks.





Published by Executive Committee, Taiwan Academic Network, Ministry of Education, Taipei, Taiwan, R.O.C
JIT Editorial Office, Library and Information Center, National Dong Hwa University
No. 1, Sec. 2, Da Hsueh Rd. Shoufeng, Hualien 97401, Taiwan, R.O.C.
Tel: +886-3-931-7017  E-mail: jit.editorial@gmail.com