5th International ICST Conference on Cognitive Radio Oriented Wireless Networks and Communications

Research Article

Atomic hierarchical routing games in communication networks

Download191 downloads
  • @INPROCEEDINGS{10.4108/ICST.CROWNCOM2010.9959,
        author={Vijay Kamble and Eitan Altman and Rachid El-Azouzi and Vinod Sharma},
        title={Atomic hierarchical routing games in communication networks},
        proceedings={5th International ICST Conference on Cognitive Radio Oriented Wireless Networks and Communications},
        keywords={Cognitive radio Density functional theory Games Mobile communication Nash equilibrium Pricing Routing},
  • Vijay Kamble
    Eitan Altman
    Rachid El-Azouzi
    Vinod Sharma
    Year: 2010
    Atomic hierarchical routing games in communication networks
    DOI: 10.4108/ICST.CROWNCOM2010.9959
Vijay Kamble1, Eitan Altman2, Rachid El-Azouzi3, Vinod Sharma4
  • 1: Dept. of Industrial Engineering and Management, IIT - Kharagpur, West Bengal, India
  • 2: Maestro group, INRIA, 2004 Route des Lucioles, Sophia Antipolis, France
  • 3: LIA, University of Avignon, 339, chemin des Meinajaries, Avignon, France
  • 4: Dept. of Electrical Communication Engineering, Indian Institute of Science, Bangalore, India


Theoretical studies on routing games in networks have so far dealt with reciprocal congestion effects between routing entities. But, with the advent of technologies like Cognitive Radio, we have networks which support differentiation of flows. In a two priority level model a user can be high priority or low priority and there is a cost for such a classification. The point of departure of this model from the traditional routing scenarios is the absence of reciprocity in the congestion effects: The low priority flow faces congestion from both high priority as well as low priority flow while the high priority flow is immune to the congestion effects from the low priority flow. This hierarchy is naturally present in contexts where there are primary (licensed) users and secondary (unlicensed) users who can sense their environment because there are equipped with a cognitive radio. We study such kind of routing scenarios for the cases of atomic users. We establish the existence and the uniqueness of Nash equilibrium and further we show the existence of a potential function for linear congestion costs and a certain priority classification pricing scheme. Natural applications of this model to Cognitive Radio are also pointed out.