On the problem of joint power and rate control in CDMA ad hoc networks

Kastrinogiannis, T; Karyotis, V; Papavassiliou, S

dc.contributor.author	Kastrinogiannis, T	en
dc.contributor.author	Karyotis, V	en
dc.contributor.author	Papavassiliou, S	en
dc.date.accessioned	2014-03-01T02:45:42Z
dc.date.available	2014-03-01T02:45:42Z
dc.date.issued	2008	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/32334
dc.subject	Ad Hoc Network	en
dc.subject	Channel State Information	en
dc.subject	non-cooperative game	en
dc.subject	Power Consumption	en
dc.subject	Rate Allocation	en
dc.subject	Rate Control	en
dc.subject	Theoretical Framework	en
dc.subject	Utility Function	en
dc.subject	Nash Equilibrium	en
dc.subject.other	Boolean functions	en
dc.subject.other	Code division multiple access	en
dc.subject.other	Computer networks	en
dc.subject.other	Game theory	en
dc.subject.other	Image coding	en
dc.subject.other	Throughput	en
dc.subject.other	Wireless telecommunication systems	en
dc.subject.other	International symposium	en
dc.subject.other	Joint power and rate control	en
dc.subject.other	Ad hoc networks	en
dc.title	On the problem of joint power and rate control in CDMA ad hoc networks	en
heal.type	conferenceItem	en
heal.identifier.primary	10.1109/ISWPC.2008.4556170	en
heal.identifier.secondary	http://dx.doi.org/10.1109/ISWPC.2008.4556170	en
heal.identifier.secondary	4556170	en
heal.publicationDate	2008	en
heal.abstract	In this work, the problem of joint power and rate control (PRC) in CDMA-based ad hoc networks is considered and analyzed. We propose a game theoretic framework for performing efficient power and rate allocation in CDMA ad hoc networks and develop a distributed PRC algorithm for dynamically selecting the optimal neighboring destination, power and rate values. The objective is to maximize properly-defined node utility functions that reflect a tradeoff between actual achieved throughput and power consumption. The PRC algorithm selects opportunistically the destination nodes, by exploiting current channel state information, as expressed by the experienced SINR of the receivers, while it assures the convergence at the game's unique Nash Equilibrium point in terms of power and rate transmission vectors. We demonstrate the performance of the proposed algorithm in two different network scenarios with respect to the allocated transmission power, received node performance satisfaction, actual achieved throughput and the convergence of the non-cooperative game. © 2008 IEEE.	en
heal.journalName	3rd International Symposium on Wireless Pervasive Computing, ISWPC 2008, Proceedings	en
dc.identifier.doi	10.1109/ISWPC.2008.4556170	en
dc.identifier.spage	78	en
dc.identifier.epage	82	en