Error message

  • Warning: Illegal string offset 'tokenized' in addtocal_field_get_value() (line 362 of /var/www/drupal/sites/all/modules/addtocal/addtocal.module).
  • Warning: Illegal string offset 'tokenized' in addtocal_field_get_value() (line 400 of /var/www/drupal/sites/all/modules/addtocal/addtocal.module).
  • Warning: Illegal string offset 'tokenized' in addtocal_field_get_value() (line 362 of /var/www/drupal/sites/all/modules/addtocal/addtocal.module).
  • Warning: Illegal string offset 'tokenized' in addtocal_field_get_value() (line 400 of /var/www/drupal/sites/all/modules/addtocal/addtocal.module).
Home > Events > 2012 > Flow allocation with joint channel and power assignment in multihop radio networks using game theory
Flow allocation with joint channel and power assignment in multihop radio networks using game theory
21 May 2012 - 10:00am
Speaker(s): 
Jorge Ortín, University of Zaragoza, Spain
Location: 

Room 4.1.F03, Torres Quevedo Building, UC3M, Avda. Universidad, 30, 28911 Leganes – Madrid

Organization: 
NETCOM Research Group (Departmento de Telemática, UC3M)

Abstract:

Autonomous, self-configuring multihop networks present a versatile solution to provide broadband services with infrastructure-less deployments and decentralized management. Furthermore, their intrinsic adaptability and resilience can be enhanced with cognitive radio technology, enabling the nodes of the network to adjust their transmitting parameters to the specific operational environment. One of the main research challenges in this kind of networks is the proposal of efficient and distributed radio resource management solutions that accomplish the channel and power allocation for the links of each flow in the network.

To tackle these challenges, game theory has recently received an increasing interest in the context of cognitive networks. Since game theory allows analyzing the strategic interactions among multiple decision makers, the characterization of the problem as a game facilitates the evaluation of the expected performance of the network, giving an insight into its behavior. In this context, we will analyze three different games to address this problem: a local flow game based on complete information about the links of the flow, a potential flow game which needs overall network information and a cooperative link game only requiring partial information about the links of the flow.

This event will be conducted in English.