Loading...

A new routing protocol in mobile ad hoc networks with selfish nodes

Saremi, F ; Sharif University of Technology | 2008

337 Viewed
  1. Type of Document: Article
  2. DOI: 10.1109/SOFTCOM.2008.4669463
  3. Publisher: 2008
  4. Abstract:
  5. Mobile Ad hoc Networks (MANETs) are based on the assumption of that all participants in the network cooperate and forward packets towards the destinations. However, due to the limited nature of the nodes' resources, a node may decide not to cooperate to save its resources while still using the network. Such behavior of some nodes may degrade the whole network performance. To cope with such a situation, we propose a Stable path, Low overhead, Truthful, and Cost efficient (SLTC) routing protocol which stimulates nodes to cooperate. SLTC utilizes the game theoretic notion of mechanism design. To the best of our knowledge, SLTC is the first protocol attaining the message complexity of O(nd), where n is the number of nodes, and d is the network diameter. The best previously proposed approaches in this area has the message complexity of O(n2 log n). In addition, SLTC considers path stability in order to deal with the mobility of the nodes in a better way
  6. Keywords:
  7. Computers ; Internet ; Machine design ; Metropolitan area networks ; Routing protocols ; Systems engineering ; Telecommunication networks ; Wireless telecommunication systems ; Forward packets ; Low overheads ; Mechanism designs ; Message complexities ; Mobile Ad hoc networks ; Network diameters ; Network performances ; Number of nodes ; Path stabilities ; Selfish nodes ; Stable paths ; Ad hoc networks
  8. Source: SoftCom 2008: 16th International Conference on Software, Telecommuncations and Computer Networks, Split-Dubrovnik, 25 September 2008 through 27 September 2008 ; 2008 , Pages 114-118 ; 9789532900071 (ISBN)
  9. URL: https://ieeexplore.ieee.org/document/4669463