Flow allocation in wireless networks with selfish nodes

Simple item page
dc.contributor.authorKrzesinski, A. E.en_ZA
dc.date.accessioned2014-07-07T09:47:28Z
dc.date.available2014-07-07T09:47:28Z
dc.date.issued2013
dc.descriptionCITATION: Krzesinski, A. E. 2013. Flow allocation in wireless networks with selfish nodes. In Southern Africa Telecommunication Networks and Applications Conference (SATNAC) 2013 Proceedings, 1-4 September, Stellenbosch, pp.285-290.
dc.descriptionThe original publication is available at http://www.satnac.org.za
dc.description.abstractConsider an ad hoc network where packet transmissions occur between the nodes. Optimal flow allocation in such systems can be modelled as a constrained nonlinear optimisation problem. This problem can be solved either by standard methods which assume global knowledge of the system being modelled, or by a distributed algorithm which assumes local knowledge only. We consider an ad hoc network which contains selfish nodes. A selfish node cares only about maximising its own flows and does not care about the utility that any other nodes get. Flow allocation in a network of altruistic and selfish nodes can be modelled as a constrained nonlinear optimisation problem and solved by standard methods. However, in this case a dynamic algorithm to compute the network flows in not available. We modify the behaviour of the selfish nodes so that a dynamic solution is possible. In this scheme, selfish nodes advertise false (inflated) resource prices to the other nodes. These nodes respond by not routing their flows through the selfish nodes, and the selfish nodes can now can use all their resources to transmit their own flows. The flows return to their optimal values if the selfish nodes subsequently advertise the correct prices for their resources. Altruistic nodes can detect the inflated prices charged by the selfish nodes and respond by advertising false (inflated) prices to the selfish nodes. In this case the flows originating at the selfish nodes are reduced, but the flows do not return to their optimal values. This scheme also has a distributed solution.
dc.description.urihttp://www.satnac.org.za/proceedings/2013/SATNAC_2013_Conference_Proceedings.pdf
dc.description.versionPublisher's version
dc.identifier.citationKrzesinski, A. E. 2013. Flow allocation in wireless networks with selfish nodes. In Southern Africa Telecommunication Networks and Applications Conference (SATNAC) 2013 Proceedings, 1-4 September, Stellenbosch, pp.285-290.
dc.identifier.urihttp://hdl.handle.net/10019.1/90965
dc.language.isoen
dc.publisherSATNAC
dc.rights.holderAuthor retains copyright
dc.subjectAlgorithmsen_ZA
dc.subjectLagrangian functionsen_ZA
dc.subjectWireless communication systemsen_ZA
dc.titleFlow allocation in wireless networks with selfish nodesen_ZA
dc.typeConference Paper
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
krzesinski_flow_2013.pdf
Size:
1.5 MB
Format:
Adobe Portable Document Format
Description:
Download article
Download
Collections
Conference Proceedings (Computer Science)