Routing game in wireless network

dc.accession.numberT00199
dc.classification.ddc004.65 BOR
dc.contributor.advisorMitra, Suman K.
dc.contributor.authorBorana, Lokesh
dc.date.accessioned2017-06-10T14:37:46Z
dc.date.accessioned2025-06-28T10:19:33Z
dc.date.available2017-06-10T14:37:46Z
dc.date.issued2009
dc.degreeM. Tech
dc.description.abstractIn this paper we have discussed about pricebased reliable routing in wireless AdHoc network. <p/>Because of the selfish behavior of the nodes in the network the path chosen is not equilibrium path. We have considered the link cost and reliability of each node. We have studied an algorithm based on link cost, reliability and selfish behavior of nodes. The pricing mechanism involved in this game is pull based routing game, which is destination driven and source mediated. This algorithm is used to find an equilibrium path, if any, taking link cost and reliability as factor. We simulated the original algorithm and analyzed the results. It was observed that source node gave equal reward to all the participating nodes. We proposed an algorithm to increase the gain of the source node by giving different rewards to participating nodes. We also compared the simulation result for both cases.
dc.identifier.citationBorana, Lokesh (2009). Routing game in wireless network. Dhirubhai Ambani Institute of Information and Communication Technology, viii, 32 p. (Acc.No: T00199)
dc.identifier.urihttp://drsr.daiict.ac.in/handle/123456789/236
dc.publisherDhirubhai Ambani Institute of Information and Communication Technology
dc.student.id200711005
dc.subjectEquilibrium Path
dc.subjectGame theory in ad hoc network
dc.subjectPrice based routing
dc.subjectSelfish nodes
dc.titleRouting game in wireless network
dc.typeDissertation

Files

Original bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
200711005.pdf
Size:
399 KB
Format:
Adobe Portable Document Format