IEEE VTS 53rd Vehicular Technology Conference, Spring 2001. Proceedings (Cat. No.01CH37202)
DOI: 10.1109/vetecs.2001.944543
|View full text |Cite
|
Sign up to set email alerts
|

Congestion based pricing in a dynamic wireless network

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
34
0

Publication Types

Select...
5
2

Relationship

2
5

Authors

Journals

citations
Cited by 14 publications
(34 citation statements)
references
References 4 publications
0
34
0
Order By: Relevance
“…An example of such decentralized networks is a potential future network (ad hoc network), where the nodes are not always connected to a base station [10]. The power updating according to (40) can be seen as best-response (greedy) dynamics in a noncooperative game between the users [18].…”
Section: A Distributed Power Allocation Algorithmmentioning
confidence: 99%
See 1 more Smart Citation
“…An example of such decentralized networks is a potential future network (ad hoc network), where the nodes are not always connected to a base station [10]. The power updating according to (40) can be seen as best-response (greedy) dynamics in a noncooperative game between the users [18].…”
Section: A Distributed Power Allocation Algorithmmentioning
confidence: 99%
“…. , m (10) Ϫ4 (using the above approximation). The interference parameters f ij are independent and normally distributed with E(e h ij ) ϭ f ij where f ij is the ijth entry in interference matrix (37), and each h ij is normally distributed.…”
Section: Example With Lognormal Distributionmentioning
confidence: 99%
“…[1]) and wireless networks (e.g. [2]- [4]). The problem here differs from much of the previous work because, due to interference, the users' objective functions are coupled with each other, and the overall network objective is not concave in the allocated resource (transmit power).…”
Section: Introductionmentioning
confidence: 99%
“…Specifically, markets have been used in computational grids [1], peer-to-peer systems [16], supply-chain management [11], scheduling [19], congestion control [9], routing [6], workflow automation [10] and recommender systems [18]. Building on this, the solution that we have developed consists of software agents that compete in a marketplace to buy and sell network bandwidth.…”
mentioning
confidence: 99%