Quality of routing congestion games in wireless sensor networks

We consider congestion games in wireless sensor networks that offer quantitatively distinct classes of routing paths. Each routing class is characterized by a service cost. Within a routing class, the maximum link congestion is also an important metric for measuring the quality of the paths. Here, we study routing games where each player i selfishly selects a path with a respective routing class that simultaneously minimizes its maximum edge congestion Ci and service cost Si, in other words minimizes Ci +Si. We examine the quality of Nash-equilibria and prove that the price

• Type: Conference
• Year: 2008
• Where: WICON
• Authors: Costas Busch, Rajgopal Kannan, Athanasios V. Vasilakos
• Keywords: Computer Networks, Maximum Link Congestion, Respective Routing Class, Routing Class, WICON 2008