Secure routing protocol considering load distribution in mobile ad hoc networks

Yuri Ohata, Sayaka Umeda, Takashi Kamimoto, Hiroshi Shigeno

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Citations (Scopus)

Abstract

Mobile ad hoc networks (MANETs), where nodes can communicate without an infrastructure, require all nodes to be cooperative enough to transfer packets for other nodes. However, malicious nodes engage in dropping packets improperly. In order to alleviate the influence, secure routing protocols using trust values were proposed. Secure routing protocols discover reliable paths that are comprised of cooperative nodes with high trust values. Here, the trust value indicates the degree of reliance. Though these protocols are effective for reducing the influence by malicious nodes, they causes two problems at the same time. One is a load concentration problem that specific nodes with high trust values are required to transfer numerous packets. The other is an undetected malicious nodes problem. In secure routing protocols, it takes a long time to detect malicious nodes because of the lack of evaluation for the nodes. In this paper, we propose an ad hoc on-demand trusted-path distance vector routing protocol that distributes loads (LD-AOTDV). LD-AOTDV discovers paths that are comprised of the nodes which are not used so much as relay nodes. Thereby, this protocol can distribute loads of relaying packets to the nodes. LD-AOTDV can also detect malicious nodes effectively by evaluating the nodes when they are selected as relay nodes. By detecting malicious nodes quickly, LD-AOTDV can make the network safer. We evaluate the performance of LDAOTDV and compare it with other secure routing protocols. As a result, LD-AOTDV shows better performance than others in terms of load balancing and detection ratio of malicious nodes.

Original languageEnglish
Title of host publicationProceedings - 14th IEEE International Conference on Trust, Security and Privacy in Computing and Communications, TrustCom 2015
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages840-847
Number of pages8
Volume1
ISBN (Print)9781467379519
DOIs
Publication statusPublished - 2015 Dec 2
Event14th IEEE International Conference on Trust, Security and Privacy in Computing and Communications, TrustCom 2015 - Helsinki, Finland
Duration: 2015 Aug 202015 Aug 22

Other

Other14th IEEE International Conference on Trust, Security and Privacy in Computing and Communications, TrustCom 2015
CountryFinland
CityHelsinki
Period15/8/2015/8/22

Fingerprint

Mobile ad hoc networks
Routing protocols
Network protocols
Resource allocation

Keywords

  • Load distribution
  • Mobile ad hoc networks
  • Secure routing
  • Trust

ASJC Scopus subject areas

  • Computer Networks and Communications

Cite this

Ohata, Y., Umeda, S., Kamimoto, T., & Shigeno, H. (2015). Secure routing protocol considering load distribution in mobile ad hoc networks. In Proceedings - 14th IEEE International Conference on Trust, Security and Privacy in Computing and Communications, TrustCom 2015 (Vol. 1, pp. 840-847). [7345363] Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/Trustcom.2015.455

Secure routing protocol considering load distribution in mobile ad hoc networks. / Ohata, Yuri; Umeda, Sayaka; Kamimoto, Takashi; Shigeno, Hiroshi.

Proceedings - 14th IEEE International Conference on Trust, Security and Privacy in Computing and Communications, TrustCom 2015. Vol. 1 Institute of Electrical and Electronics Engineers Inc., 2015. p. 840-847 7345363.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Ohata, Y, Umeda, S, Kamimoto, T & Shigeno, H 2015, Secure routing protocol considering load distribution in mobile ad hoc networks. in Proceedings - 14th IEEE International Conference on Trust, Security and Privacy in Computing and Communications, TrustCom 2015. vol. 1, 7345363, Institute of Electrical and Electronics Engineers Inc., pp. 840-847, 14th IEEE International Conference on Trust, Security and Privacy in Computing and Communications, TrustCom 2015, Helsinki, Finland, 15/8/20. https://doi.org/10.1109/Trustcom.2015.455
Ohata Y, Umeda S, Kamimoto T, Shigeno H. Secure routing protocol considering load distribution in mobile ad hoc networks. In Proceedings - 14th IEEE International Conference on Trust, Security and Privacy in Computing and Communications, TrustCom 2015. Vol. 1. Institute of Electrical and Electronics Engineers Inc. 2015. p. 840-847. 7345363 https://doi.org/10.1109/Trustcom.2015.455
Ohata, Yuri ; Umeda, Sayaka ; Kamimoto, Takashi ; Shigeno, Hiroshi. / Secure routing protocol considering load distribution in mobile ad hoc networks. Proceedings - 14th IEEE International Conference on Trust, Security and Privacy in Computing and Communications, TrustCom 2015. Vol. 1 Institute of Electrical and Electronics Engineers Inc., 2015. pp. 840-847
@inproceedings{0d5e3cccb86b4da1b4b2be9cf9daf974,
title = "Secure routing protocol considering load distribution in mobile ad hoc networks",
abstract = "Mobile ad hoc networks (MANETs), where nodes can communicate without an infrastructure, require all nodes to be cooperative enough to transfer packets for other nodes. However, malicious nodes engage in dropping packets improperly. In order to alleviate the influence, secure routing protocols using trust values were proposed. Secure routing protocols discover reliable paths that are comprised of cooperative nodes with high trust values. Here, the trust value indicates the degree of reliance. Though these protocols are effective for reducing the influence by malicious nodes, they causes two problems at the same time. One is a load concentration problem that specific nodes with high trust values are required to transfer numerous packets. The other is an undetected malicious nodes problem. In secure routing protocols, it takes a long time to detect malicious nodes because of the lack of evaluation for the nodes. In this paper, we propose an ad hoc on-demand trusted-path distance vector routing protocol that distributes loads (LD-AOTDV). LD-AOTDV discovers paths that are comprised of the nodes which are not used so much as relay nodes. Thereby, this protocol can distribute loads of relaying packets to the nodes. LD-AOTDV can also detect malicious nodes effectively by evaluating the nodes when they are selected as relay nodes. By detecting malicious nodes quickly, LD-AOTDV can make the network safer. We evaluate the performance of LDAOTDV and compare it with other secure routing protocols. As a result, LD-AOTDV shows better performance than others in terms of load balancing and detection ratio of malicious nodes.",
keywords = "Load distribution, Mobile ad hoc networks, Secure routing, Trust",
author = "Yuri Ohata and Sayaka Umeda and Takashi Kamimoto and Hiroshi Shigeno",
year = "2015",
month = "12",
day = "2",
doi = "10.1109/Trustcom.2015.455",
language = "English",
isbn = "9781467379519",
volume = "1",
pages = "840--847",
booktitle = "Proceedings - 14th IEEE International Conference on Trust, Security and Privacy in Computing and Communications, TrustCom 2015",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - GEN

T1 - Secure routing protocol considering load distribution in mobile ad hoc networks

AU - Ohata, Yuri

AU - Umeda, Sayaka

AU - Kamimoto, Takashi

AU - Shigeno, Hiroshi

PY - 2015/12/2

Y1 - 2015/12/2

N2 - Mobile ad hoc networks (MANETs), where nodes can communicate without an infrastructure, require all nodes to be cooperative enough to transfer packets for other nodes. However, malicious nodes engage in dropping packets improperly. In order to alleviate the influence, secure routing protocols using trust values were proposed. Secure routing protocols discover reliable paths that are comprised of cooperative nodes with high trust values. Here, the trust value indicates the degree of reliance. Though these protocols are effective for reducing the influence by malicious nodes, they causes two problems at the same time. One is a load concentration problem that specific nodes with high trust values are required to transfer numerous packets. The other is an undetected malicious nodes problem. In secure routing protocols, it takes a long time to detect malicious nodes because of the lack of evaluation for the nodes. In this paper, we propose an ad hoc on-demand trusted-path distance vector routing protocol that distributes loads (LD-AOTDV). LD-AOTDV discovers paths that are comprised of the nodes which are not used so much as relay nodes. Thereby, this protocol can distribute loads of relaying packets to the nodes. LD-AOTDV can also detect malicious nodes effectively by evaluating the nodes when they are selected as relay nodes. By detecting malicious nodes quickly, LD-AOTDV can make the network safer. We evaluate the performance of LDAOTDV and compare it with other secure routing protocols. As a result, LD-AOTDV shows better performance than others in terms of load balancing and detection ratio of malicious nodes.

AB - Mobile ad hoc networks (MANETs), where nodes can communicate without an infrastructure, require all nodes to be cooperative enough to transfer packets for other nodes. However, malicious nodes engage in dropping packets improperly. In order to alleviate the influence, secure routing protocols using trust values were proposed. Secure routing protocols discover reliable paths that are comprised of cooperative nodes with high trust values. Here, the trust value indicates the degree of reliance. Though these protocols are effective for reducing the influence by malicious nodes, they causes two problems at the same time. One is a load concentration problem that specific nodes with high trust values are required to transfer numerous packets. The other is an undetected malicious nodes problem. In secure routing protocols, it takes a long time to detect malicious nodes because of the lack of evaluation for the nodes. In this paper, we propose an ad hoc on-demand trusted-path distance vector routing protocol that distributes loads (LD-AOTDV). LD-AOTDV discovers paths that are comprised of the nodes which are not used so much as relay nodes. Thereby, this protocol can distribute loads of relaying packets to the nodes. LD-AOTDV can also detect malicious nodes effectively by evaluating the nodes when they are selected as relay nodes. By detecting malicious nodes quickly, LD-AOTDV can make the network safer. We evaluate the performance of LDAOTDV and compare it with other secure routing protocols. As a result, LD-AOTDV shows better performance than others in terms of load balancing and detection ratio of malicious nodes.

KW - Load distribution

KW - Mobile ad hoc networks

KW - Secure routing

KW - Trust

UR - http://www.scopus.com/inward/record.url?scp=84967211126&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84967211126&partnerID=8YFLogxK

U2 - 10.1109/Trustcom.2015.455

DO - 10.1109/Trustcom.2015.455

M3 - Conference contribution

AN - SCOPUS:84967211126

SN - 9781467379519

VL - 1

SP - 840

EP - 847

BT - Proceedings - 14th IEEE International Conference on Trust, Security and Privacy in Computing and Communications, TrustCom 2015

PB - Institute of Electrical and Electronics Engineers Inc.

ER -