The joint resource allocation problem in wireless networks

Papavassiliou, S; Tassiulas, L

dc.contributor.author	Papavassiliou, S	en
dc.contributor.author	Tassiulas, L	en
dc.date.accessioned	2014-03-01T02:48:18Z
dc.date.available	2014-03-01T02:48:18Z
dc.date.issued	1995	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/33725
dc.subject	Dynamic Resource Allocation	en
dc.subject	Maximum Matching	en
dc.subject	Resource Allocation	en
dc.subject	Wireless Network	en
dc.subject	Base Station	en
dc.subject	Channel Assignment Problem	en
dc.subject	Power Control	en
dc.title	The joint resource allocation problem in wireless networks	en
heal.type	conferenceItem	en
heal.identifier.primary	10.1109/ICC.1995.525200	en
heal.identifier.secondary	http://dx.doi.org/10.1109/ICC.1995.525200	en
heal.publicationDate	1995	en
heal.abstract	The fundamental problem underlying any phase of a dynamic resource allocation algorithm in a wireless network is to assign transmission powers, forward and reverse channels, and base stations such that every mobile of the system can establish a connection. The author considers the joint resource allocation problem in a system with two base stations. An algorithm that achieves the optimal	en
heal.journalName	IEEE International Conference on Communications	en
dc.identifier.doi	10.1109/ICC.1995.525200	en