kth.sePublications
Change search
Refine search result
1 - 4 of 4
CiteExportLink to result list
Permanent link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Rows per page
  • 5
  • 10
  • 20
  • 50
  • 100
  • 250
Sort
  • Standard (Relevance)
  • Author A-Ö
  • Author Ö-A
  • Title A-Ö
  • Title Ö-A
  • Publication type A-Ö
  • Publication type Ö-A
  • Issued (Oldest first)
  • Issued (Newest first)
  • Created (Oldest first)
  • Created (Newest first)
  • Last updated (Oldest first)
  • Last updated (Newest first)
  • Disputation date (earliest first)
  • Disputation date (latest first)
  • Standard (Relevance)
  • Author A-Ö
  • Author Ö-A
  • Title A-Ö
  • Title Ö-A
  • Publication type A-Ö
  • Publication type Ö-A
  • Issued (Oldest first)
  • Issued (Newest first)
  • Created (Oldest first)
  • Created (Newest first)
  • Last updated (Oldest first)
  • Last updated (Newest first)
  • Disputation date (earliest first)
  • Disputation date (latest first)
Select
The maximal number of hits you can export is 250. When you want to export more records please use the Create feeds function.
  • 1.
    Hultell, Johan
    et al.
    KTH, School of Information and Communication Technology (ICT), Centres, Center for Wireless Systems, Wireless@kth.
    Ileri, Ömer
    KTH, School of Information and Communication Technology (ICT), Centres, Center for Wireless Systems, Wireless@kth.
    Zander, Jens
    KTH, School of Information and Communication Technology (ICT), Centres, Center for Wireless Systems, Wireless@kth. KTH, School of Information and Communication Technology (ICT), Communication: Services and Infrastucture, Communication Systems, CoS.
    Selfish users in energy constrained ALOHA systems with power capture2011In: Wireless networks, ISSN 1022-0038, E-ISSN 1572-8196, Vol. 17, no 1, p. 199-212Article in journal (Refereed)
    Abstract [en]

    We consider a slotted ALOHA setting where backlogged, energy-constrained users selfishly select the probability with which they transmit packets. Packets are successfully received, even in case of collision, if the signal to interference plus noise ratio at the access point exceeds some threshold (power capture). The user problem of finding appropriate transmission probabilities is formulated as a static non-cooperative game and the performance limits for stationary and mobile scenarios are determined. The equilibrium analyses show that for stationary scenarios, users with high pathgains share the channel fairly while others never transmit. In the mobile case users utilize a binary strategy where they try to monopolize the channel when their pathgain exceeds some threshold that depends on system parameters (number of users, transmission costs, etc.). Otherwise they shut their transmitters off. Compared to traditional nondiscriminatory distributed multiaccess protocols the operating points achieved by selfish users generally increase sum-utility although this comes at the expense of larger user performance variations.

  • 2.
    Ileri, Ömer
    et al.
    KTH, School of Information and Communication Technology (ICT), Centres, Center for Wireless Systems, Wireless@kth. KTH, School of Information and Communication Technology (ICT), Communication: Services and Infrastucture, Communication Systems, CoS.
    Zander, Jens
    KTH, School of Information and Communication Technology (ICT), Centres, Center for Wireless Systems, Wireless@kth. KTH, School of Information and Communication Technology (ICT), Communication: Services and Infrastucture, Communication Systems, CoS.
    Broker Coordination in Demand Responsive Dynamic Spectrum Access Settings2009In: 2009 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, VOLS 1-8, 2009, p. 2781-2786Conference paper (Refereed)
    Abstract [en]

    In this paper we propose cooperative/noncooperative operation models for revenue seeking spectrum brokers who coordinate to manage access to the same spectrum bands in adjacent areas. We consider a setting where users of spectrum are involved in peer-to-peer links with QoS requirements. Each wireless transmission (link) is priced collectively by all revenue seeking brokers whose responsibility areas are affected by the transmission (via interference). We propose a two-level coordination mechanism. At the pricing-level, the brokers affected by a given link collectively determine prices. At the admission level, all brokers potentially affected by all transmissions collectively determine the set of link requests that are to be permitted. The links are modeled as price sensitive users who may or may not form connections, based on the total price asked. Experimental results show that cooperation significantly increases both the number of active links and broker revenues. Relative gains achieved by pricing level cooperation alone or admission level cooperation alone depend on price sensitivity parameters for the links as well as the total number of link formation requests.

  • 3. Zhang, D.
    et al.
    Ileri, Ömer
    KTH, School of Information and Communication Technology (ICT), Centres, Center for Wireless Systems, Wireless@kth.
    Mandayam, N.
    Bandwidth exchange as an incentive for relaying2008In: CISS 2008, The 42nd Annual Conference on Information Sciences and Systems, 2008, p. 749-754Conference paper (Refereed)
    Abstract [en]

    Relay cooperation has been recognized as an important mechanism to enhance connectivity and throughput in multi-hop wireless networks, especially under varying channel conditions. One major problem of relay cooperation is that relaying always incurs energy and possibly delay costs. To a rational and selfish node these costs are worth incurring only if it receives at least comparable returns in the long term. In light of this, we propose a new incentive mechanism called bandwidth exchange (BE) where a node can delegate a portion of its bandwidth to another node in exchange for relay cooperation. In this paper we specifically study BE in the simple form of exchanging orthogonal frequency bands to provide incentives for relaying in a wireless network. Other forms of exchanging bandwidth such as delegation of time-slots or using spreading codes of different lengths are also possible. Using a Nash Bargaining framework, we explore the advantage of BE in both static and fading channels.

  • 4.
    Özyagci, Ali
    et al.
    KTH, School of Information and Communication Technology (ICT), Communication Systems, CoS. KTH, School of Information and Communication Technology (ICT), Centres, Center for Wireless Systems, Wireless@kth.
    Ileri, Ömer
    KTH, School of Information and Communication Technology (ICT), Communication Systems, CoS. KTH, School of Information and Communication Technology (ICT), Centres, Center for Wireless Systems, Wireless@kth.
    Zander, Jens
    KTH, School of Information and Communication Technology (ICT), Communication Systems, CoS. KTH, School of Information and Communication Technology (ICT), Centres, Center for Wireless Systems, Wireless@kth.
    Distributed multichannel random access networks with selfish users2010In: Proceedings of the Fifth International Conference on Cognitive Radio Oriented Wireless Networks Communications (CROWNCOM), 2010, 2010, p. 5577687-Conference paper (Refereed)
    Abstract [en]

    Dynamic spectrum access (DSA) schemes allow the users to share spectrum resources by taking advantage of the variations in spectrum demand over time and space. Carrying out dynamic spectrum allocation centrally, however, can be a complex task. For this reason, distributed schemes in which users can access the available channels independently may be preferable to centralized DSA schemes. Cognitive radio systems, which enable user terminals to sense their environment and form their action accordingly, are particularly well-suited for distributed systems. On the other hand, the freedom in distributed schemes gives the users the option to act selfishly, which has decisive effects on system performance. In this paper we consider a distributed multichannel wireless random access system where users selfishly access the channels in the system. We analyze the behavior of the selfish users by modeling the system as a non-cooperative game and we identify all stable operating points (Nash equilibria) of this game. We then compare the performance of this system with a number of cooperative distributed DSA schemes in terms of user utilities. Our results show that the performance of the selfish multichannel random access system can be comparable to cooperative schemes.

    Download full text (pdf)
    fulltext
1 - 4 of 4
CiteExportLink to result list
Permanent link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf