A novel dynamic reputation-based source routing protocol for mobile ad hoc networks
Abstract Routing in mobile ad hoc networks is based on the cooperation of the network’s nodes. The presence of selfish nodes that do not cooperate in this task drastically reduces the number of delivered packets. In order to find the better paths that include nodes willing to cooperate, we propose...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
SpringerOpen
2019-03-01
|
| Series: | EURASIP Journal on Wireless Communications and Networking |
| Subjects: | |
| Online Access: | http://link.springer.com/article/10.1186/s13638-019-1375-7 |
| _version_ | 1818460114268454912 |
|---|---|
| author | Lenin Guaya-Delgado Esteve Pallarès-Segarra Ahmad Mohamad Mezher Jordi Forné |
| author_facet | Lenin Guaya-Delgado Esteve Pallarès-Segarra Ahmad Mohamad Mezher Jordi Forné |
| author_sort | Lenin Guaya-Delgado |
| collection | DOAJ |
| description | Abstract Routing in mobile ad hoc networks is based on the cooperation of the network’s nodes. The presence of selfish nodes that do not cooperate in this task drastically reduces the number of delivered packets. In order to find the better paths that include nodes willing to cooperate, we propose a new routing algorithm based on the reputation of the nodes. In our proposal, each node locally assigns a reputation value to the rest of the nodes in the network and next it uses the assigned reputation values to find out the better routing paths, in order to minimize the overall packet loss ratio. We assume that nodes have a stationary routing behavior, but we also include a mechanism to detect changes in their behavior. Our approach has been evaluated in the presence of selfish nodes, in order to compare it with the dynamic source routing algorithm, obtaining a reduction in the packet loss ratio at the expenses of a small increase in the number of hops taken by the packets to reach their destinations. |
| first_indexed | 2024-12-14T23:25:06Z |
| format | Article |
| id | doaj.art-c2b0044b0cde4712ae6febf54c069b5d |
| institution | Directory Open Access Journal |
| issn | 1687-1499 |
| language | English |
| last_indexed | 2024-12-14T23:25:06Z |
| publishDate | 2019-03-01 |
| publisher | SpringerOpen |
| record_format | Article |
| series | EURASIP Journal on Wireless Communications and Networking |
| spelling | doaj.art-c2b0044b0cde4712ae6febf54c069b5d2022-12-21T22:43:49ZengSpringerOpenEURASIP Journal on Wireless Communications and Networking1687-14992019-03-012019111610.1186/s13638-019-1375-7A novel dynamic reputation-based source routing protocol for mobile ad hoc networksLenin Guaya-Delgado0Esteve Pallarès-Segarra1Ahmad Mohamad Mezher2Jordi Forné3Department of Network Engineering, Universitat Politècnica de Catalunya (UPC)Department of Network Engineering, Universitat Politècnica de Catalunya (UPC)Department of Electrical and Computer Engineering, University of New Brunswick (UNB)Department of Network Engineering, Universitat Politècnica de Catalunya (UPC)Abstract Routing in mobile ad hoc networks is based on the cooperation of the network’s nodes. The presence of selfish nodes that do not cooperate in this task drastically reduces the number of delivered packets. In order to find the better paths that include nodes willing to cooperate, we propose a new routing algorithm based on the reputation of the nodes. In our proposal, each node locally assigns a reputation value to the rest of the nodes in the network and next it uses the assigned reputation values to find out the better routing paths, in order to minimize the overall packet loss ratio. We assume that nodes have a stationary routing behavior, but we also include a mechanism to detect changes in their behavior. Our approach has been evaluated in the presence of selfish nodes, in order to compare it with the dynamic source routing algorithm, obtaining a reduction in the packet loss ratio at the expenses of a small increase in the number of hops taken by the packets to reach their destinations.http://link.springer.com/article/10.1186/s13638-019-1375-7ReputationRouting protocolsSelfish nodesMANETs |
| spellingShingle | Lenin Guaya-Delgado Esteve Pallarès-Segarra Ahmad Mohamad Mezher Jordi Forné A novel dynamic reputation-based source routing protocol for mobile ad hoc networks EURASIP Journal on Wireless Communications and Networking Reputation Routing protocols Selfish nodes MANETs |
| title | A novel dynamic reputation-based source routing protocol for mobile ad hoc networks |
| title_full | A novel dynamic reputation-based source routing protocol for mobile ad hoc networks |
| title_fullStr | A novel dynamic reputation-based source routing protocol for mobile ad hoc networks |
| title_full_unstemmed | A novel dynamic reputation-based source routing protocol for mobile ad hoc networks |
| title_short | A novel dynamic reputation-based source routing protocol for mobile ad hoc networks |
| title_sort | novel dynamic reputation based source routing protocol for mobile ad hoc networks |
| topic | Reputation Routing protocols Selfish nodes MANETs |
| url | http://link.springer.com/article/10.1186/s13638-019-1375-7 |
| work_keys_str_mv | AT leninguayadelgado anoveldynamicreputationbasedsourceroutingprotocolformobileadhocnetworks AT estevepallaressegarra anoveldynamicreputationbasedsourceroutingprotocolformobileadhocnetworks AT ahmadmohamadmezher anoveldynamicreputationbasedsourceroutingprotocolformobileadhocnetworks AT jordiforne anoveldynamicreputationbasedsourceroutingprotocolformobileadhocnetworks AT leninguayadelgado noveldynamicreputationbasedsourceroutingprotocolformobileadhocnetworks AT estevepallaressegarra noveldynamicreputationbasedsourceroutingprotocolformobileadhocnetworks AT ahmadmohamadmezher noveldynamicreputationbasedsourceroutingprotocolformobileadhocnetworks AT jordiforne noveldynamicreputationbasedsourceroutingprotocolformobileadhocnetworks |