A scheme for detecting selfish nodes in MANETs using OMNET++

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

5 Citations (Scopus)

Abstract

ln a mobile ad hoc network (MANET), each node has to rely on others to relay its packets. Since most mobile nodes are typically constrained by power and computing resources, some nodes may choose not tobe cooperative by refusing to do so while still using the network to forward their packets. Most previous works focus on data forwarding. However, dropping control packets is a better strategy for the selfish nodes to avoid themselves from being asked to forward data packets and hence could conserve resources for their own use. In this paper, we present a new mechanism to detect those selfish nodes. Each node is expected to contribute to the network on the continual basis within a time frame. Those which fail will undergo a test for their suspicious behaviour. Simulation results shows that our scheme could be used to detect selfish nodes in a network.

Original languageEnglish
Title of host publicationProceedings - 6th International Conference on Wireless and Mobile Communications, ICWMC 2010
Pages410-414
Number of pages5
DOIs
Publication statusPublished - 1 Dec 2010
Externally publishedYes
Event6th International Conference on Wireless and Mobile Communications, ICWMC 2010 - Valencia, Spain
Duration: 20 Sep 201025 Sep 2010

Other

Other6th International Conference on Wireless and Mobile Communications, ICWMC 2010
CountrySpain
CityValencia
Period20/9/1025/9/10

Fingerprint

Mobile ad hoc networks

Keywords

  • Mobile ad-hoc
  • Networks (MANETs)
  • OMNET++
  • Selfish nodes

ASJC Scopus subject areas

  • Computer Networks and Communications

Cite this

Abu Bakar , K. A., & Irvine, J. (2010). A scheme for detecting selfish nodes in MANETs using OMNET++. In Proceedings - 6th International Conference on Wireless and Mobile Communications, ICWMC 2010 (pp. 410-414). [5628763] https://doi.org/10.1109/ICWMC.2010.14

A scheme for detecting selfish nodes in MANETs using OMNET++. / Abu Bakar , Khairul Azmi; Irvine, James.

Proceedings - 6th International Conference on Wireless and Mobile Communications, ICWMC 2010. 2010. p. 410-414 5628763.

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

Abu Bakar , KA & Irvine, J 2010, A scheme for detecting selfish nodes in MANETs using OMNET++. in Proceedings - 6th International Conference on Wireless and Mobile Communications, ICWMC 2010., 5628763, pp. 410-414, 6th International Conference on Wireless and Mobile Communications, ICWMC 2010, Valencia, Spain, 20/9/10. https://doi.org/10.1109/ICWMC.2010.14
Abu Bakar  KA, Irvine J. A scheme for detecting selfish nodes in MANETs using OMNET++. In Proceedings - 6th International Conference on Wireless and Mobile Communications, ICWMC 2010. 2010. p. 410-414. 5628763 https://doi.org/10.1109/ICWMC.2010.14
Abu Bakar , Khairul Azmi ; Irvine, James. / A scheme for detecting selfish nodes in MANETs using OMNET++. Proceedings - 6th International Conference on Wireless and Mobile Communications, ICWMC 2010. 2010. pp. 410-414
@inproceedings{321ac154eec3463686368ba35aa8b1fd,
title = "A scheme for detecting selfish nodes in MANETs using OMNET++",
abstract = "ln a mobile ad hoc network (MANET), each node has to rely on others to relay its packets. Since most mobile nodes are typically constrained by power and computing resources, some nodes may choose not tobe cooperative by refusing to do so while still using the network to forward their packets. Most previous works focus on data forwarding. However, dropping control packets is a better strategy for the selfish nodes to avoid themselves from being asked to forward data packets and hence could conserve resources for their own use. In this paper, we present a new mechanism to detect those selfish nodes. Each node is expected to contribute to the network on the continual basis within a time frame. Those which fail will undergo a test for their suspicious behaviour. Simulation results shows that our scheme could be used to detect selfish nodes in a network.",
keywords = "Mobile ad-hoc, Networks (MANETs), OMNET++, Selfish nodes",
author = "{Abu Bakar }, {Khairul Azmi} and James Irvine",
year = "2010",
month = "12",
day = "1",
doi = "10.1109/ICWMC.2010.14",
language = "English",
isbn = "9780769541822",
pages = "410--414",
booktitle = "Proceedings - 6th International Conference on Wireless and Mobile Communications, ICWMC 2010",

}

TY - GEN

T1 - A scheme for detecting selfish nodes in MANETs using OMNET++

AU - Abu Bakar , Khairul Azmi

AU - Irvine, James

PY - 2010/12/1

Y1 - 2010/12/1

N2 - ln a mobile ad hoc network (MANET), each node has to rely on others to relay its packets. Since most mobile nodes are typically constrained by power and computing resources, some nodes may choose not tobe cooperative by refusing to do so while still using the network to forward their packets. Most previous works focus on data forwarding. However, dropping control packets is a better strategy for the selfish nodes to avoid themselves from being asked to forward data packets and hence could conserve resources for their own use. In this paper, we present a new mechanism to detect those selfish nodes. Each node is expected to contribute to the network on the continual basis within a time frame. Those which fail will undergo a test for their suspicious behaviour. Simulation results shows that our scheme could be used to detect selfish nodes in a network.

AB - ln a mobile ad hoc network (MANET), each node has to rely on others to relay its packets. Since most mobile nodes are typically constrained by power and computing resources, some nodes may choose not tobe cooperative by refusing to do so while still using the network to forward their packets. Most previous works focus on data forwarding. However, dropping control packets is a better strategy for the selfish nodes to avoid themselves from being asked to forward data packets and hence could conserve resources for their own use. In this paper, we present a new mechanism to detect those selfish nodes. Each node is expected to contribute to the network on the continual basis within a time frame. Those which fail will undergo a test for their suspicious behaviour. Simulation results shows that our scheme could be used to detect selfish nodes in a network.

KW - Mobile ad-hoc

KW - Networks (MANETs)

KW - OMNET++

KW - Selfish nodes

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

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

U2 - 10.1109/ICWMC.2010.14

DO - 10.1109/ICWMC.2010.14

M3 - Conference contribution

SN - 9780769541822

SP - 410

EP - 414

BT - Proceedings - 6th International Conference on Wireless and Mobile Communications, ICWMC 2010

ER -