Loading…

Scaling laws for cognitive radio network with heterogeneous mobile secondary users

We study the capacity and delay scaling laws for cognitive radio network (CRN) with static primary users and heterogeneous mobile secondary users coexisting in the unit planar area. The primary network consists of n randomly and uniformly distributed static primary users (PUs) with higher priority t...

Full description

Saved in:
Bibliographic Details
Main Authors: Yingzhe Li, Xinbing Wang, Xiaohua Tian, Xue Liu
Format: Conference Proceeding
Language:English
Subjects:
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by
cites
container_end_page 54
container_issue
container_start_page 46
container_title
container_volume
creator Yingzhe Li
Xinbing Wang
Xiaohua Tian
Xue Liu
description We study the capacity and delay scaling laws for cognitive radio network (CRN) with static primary users and heterogeneous mobile secondary users coexisting in the unit planar area. The primary network consists of n randomly and uniformly distributed static primary users (PUs) with higher priority to access the spectrum. The secondary network consists of m = (h + 1)n 1+ϵ heterogeneous mobile secondary users (SUs) which should access the spectrum opportunistically, here h = O(log n) and ϵ >; 0. Each secondary user moves within a circular area centered at its initial position with a restricted speed. The moving area of each mobile SU is n -α , where a is a random variable which follows the discrete uniform distribution with h + 1 different values, ranging from 0 to α 0 (α 0 >; 0). α 0 and h together determine the mobility heterogeneity of secondary users. By allowing the secondary users to relay the packets for primary users, we have proposed a joint routing and scheduling scheme to fully utilize the mobility heterogeneity of secondary users. We show that the primary network and secondary network can achieve optimal capacity and delay scalings if we increase the mobility heterogeneity of secondary users, i.e., the value of h and α 0 , until h = Θ(log n) and α 0 ≥ 1 + ϵ. In this optimal condition, both the primary network and part of the secondary network can achieve almost constant capacity and delay scalings except for poly-logarithmic factor.
doi_str_mv 10.1109/INFCOM.2012.6195787
format conference_proceeding
fullrecord <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_6195787</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>6195787</ieee_id><sourcerecordid>6195787</sourcerecordid><originalsourceid>FETCH-LOGICAL-i220t-9441b05629bef029ad22e043c963400eb706905d236d236790b3f8ba200ed4b53</originalsourceid><addsrcrecordid>eNpVkNtKAzEYhOMJLHWfoDd5ga1_DptsLqVYLVQLHsC7kuz-u41uN5JsLb69FXvjwDAXHwzDEDJhMGUMzPXicT5bPUw5MD5VzBS61CckM7pkUmkBWhflKRlxJVluSi3P_jEhz8kItBQ5U-rtkmQpvcNBGgSwckSenivb-b6lnd0n2oRIq9D2fvBfSKOtfaA9DvsQP-jeDxu6wQFjaLHHsEt0G5zvkCasQl_b-E13CWO6IheN7RJmxxyT1_nty-w-X67uFrObZe45hyE3UjIHheLGYQPc2JpzBCkqo4QEQKdBGShqLtSvtQEnmtJZfmC1dIUYk8lfr0fE9Wf028OE9fEh8QOjyVYL</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Scaling laws for cognitive radio network with heterogeneous mobile secondary users</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Yingzhe Li ; Xinbing Wang ; Xiaohua Tian ; Xue Liu</creator><creatorcontrib>Yingzhe Li ; Xinbing Wang ; Xiaohua Tian ; Xue Liu</creatorcontrib><description>We study the capacity and delay scaling laws for cognitive radio network (CRN) with static primary users and heterogeneous mobile secondary users coexisting in the unit planar area. The primary network consists of n randomly and uniformly distributed static primary users (PUs) with higher priority to access the spectrum. The secondary network consists of m = (h + 1)n 1+ϵ heterogeneous mobile secondary users (SUs) which should access the spectrum opportunistically, here h = O(log n) and ϵ &gt;; 0. Each secondary user moves within a circular area centered at its initial position with a restricted speed. The moving area of each mobile SU is n -α , where a is a random variable which follows the discrete uniform distribution with h + 1 different values, ranging from 0 to α 0 (α 0 &gt;; 0). α 0 and h together determine the mobility heterogeneity of secondary users. By allowing the secondary users to relay the packets for primary users, we have proposed a joint routing and scheduling scheme to fully utilize the mobility heterogeneity of secondary users. We show that the primary network and secondary network can achieve optimal capacity and delay scalings if we increase the mobility heterogeneity of secondary users, i.e., the value of h and α 0 , until h = Θ(log n) and α 0 ≥ 1 + ϵ. In this optimal condition, both the primary network and part of the secondary network can achieve almost constant capacity and delay scalings except for poly-logarithmic factor.</description><identifier>ISSN: 0743-166X</identifier><identifier>ISBN: 9781467307734</identifier><identifier>ISBN: 1467307734</identifier><identifier>EISSN: 2641-9874</identifier><identifier>EISBN: 9781467307758</identifier><identifier>EISBN: 1467307750</identifier><identifier>EISBN: 9781467307741</identifier><identifier>EISBN: 1467307742</identifier><identifier>DOI: 10.1109/INFCOM.2012.6195787</identifier><language>eng</language><publisher>IEEE</publisher><subject>Delay ; Interference ; Mobile communication ; Relays ; Routing ; Throughput ; Transmitters</subject><ispartof>2012 Proceedings IEEE INFOCOM, 2012, p.46-54</ispartof><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/6195787$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,776,780,785,786,2052,27902,54530,54895,54907</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/6195787$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Yingzhe Li</creatorcontrib><creatorcontrib>Xinbing Wang</creatorcontrib><creatorcontrib>Xiaohua Tian</creatorcontrib><creatorcontrib>Xue Liu</creatorcontrib><title>Scaling laws for cognitive radio network with heterogeneous mobile secondary users</title><title>2012 Proceedings IEEE INFOCOM</title><addtitle>INFCOM</addtitle><description>We study the capacity and delay scaling laws for cognitive radio network (CRN) with static primary users and heterogeneous mobile secondary users coexisting in the unit planar area. The primary network consists of n randomly and uniformly distributed static primary users (PUs) with higher priority to access the spectrum. The secondary network consists of m = (h + 1)n 1+ϵ heterogeneous mobile secondary users (SUs) which should access the spectrum opportunistically, here h = O(log n) and ϵ &gt;; 0. Each secondary user moves within a circular area centered at its initial position with a restricted speed. The moving area of each mobile SU is n -α , where a is a random variable which follows the discrete uniform distribution with h + 1 different values, ranging from 0 to α 0 (α 0 &gt;; 0). α 0 and h together determine the mobility heterogeneity of secondary users. By allowing the secondary users to relay the packets for primary users, we have proposed a joint routing and scheduling scheme to fully utilize the mobility heterogeneity of secondary users. We show that the primary network and secondary network can achieve optimal capacity and delay scalings if we increase the mobility heterogeneity of secondary users, i.e., the value of h and α 0 , until h = Θ(log n) and α 0 ≥ 1 + ϵ. In this optimal condition, both the primary network and part of the secondary network can achieve almost constant capacity and delay scalings except for poly-logarithmic factor.</description><subject>Delay</subject><subject>Interference</subject><subject>Mobile communication</subject><subject>Relays</subject><subject>Routing</subject><subject>Throughput</subject><subject>Transmitters</subject><issn>0743-166X</issn><issn>2641-9874</issn><isbn>9781467307734</isbn><isbn>1467307734</isbn><isbn>9781467307758</isbn><isbn>1467307750</isbn><isbn>9781467307741</isbn><isbn>1467307742</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2012</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><recordid>eNpVkNtKAzEYhOMJLHWfoDd5ga1_DptsLqVYLVQLHsC7kuz-u41uN5JsLb69FXvjwDAXHwzDEDJhMGUMzPXicT5bPUw5MD5VzBS61CckM7pkUmkBWhflKRlxJVluSi3P_jEhz8kItBQ5U-rtkmQpvcNBGgSwckSenivb-b6lnd0n2oRIq9D2fvBfSKOtfaA9DvsQP-jeDxu6wQFjaLHHsEt0G5zvkCasQl_b-E13CWO6IheN7RJmxxyT1_nty-w-X67uFrObZe45hyE3UjIHheLGYQPc2JpzBCkqo4QEQKdBGShqLtSvtQEnmtJZfmC1dIUYk8lfr0fE9Wf028OE9fEh8QOjyVYL</recordid><startdate>20120101</startdate><enddate>20120101</enddate><creator>Yingzhe Li</creator><creator>Xinbing Wang</creator><creator>Xiaohua Tian</creator><creator>Xue Liu</creator><general>IEEE</general><scope>6IE</scope><scope>6IH</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIO</scope></search><sort><creationdate>20120101</creationdate><title>Scaling laws for cognitive radio network with heterogeneous mobile secondary users</title><author>Yingzhe Li ; Xinbing Wang ; Xiaohua Tian ; Xue Liu</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i220t-9441b05629bef029ad22e043c963400eb706905d236d236790b3f8ba200ed4b53</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2012</creationdate><topic>Delay</topic><topic>Interference</topic><topic>Mobile communication</topic><topic>Relays</topic><topic>Routing</topic><topic>Throughput</topic><topic>Transmitters</topic><toplevel>online_resources</toplevel><creatorcontrib>Yingzhe Li</creatorcontrib><creatorcontrib>Xinbing Wang</creatorcontrib><creatorcontrib>Xiaohua Tian</creatorcontrib><creatorcontrib>Xue Liu</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan (POP) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Electronic Library (IEL)</collection><collection>IEEE Proceedings Order Plans (POP) 1998-present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Yingzhe Li</au><au>Xinbing Wang</au><au>Xiaohua Tian</au><au>Xue Liu</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Scaling laws for cognitive radio network with heterogeneous mobile secondary users</atitle><btitle>2012 Proceedings IEEE INFOCOM</btitle><stitle>INFCOM</stitle><date>2012-01-01</date><risdate>2012</risdate><spage>46</spage><epage>54</epage><pages>46-54</pages><issn>0743-166X</issn><eissn>2641-9874</eissn><isbn>9781467307734</isbn><isbn>1467307734</isbn><eisbn>9781467307758</eisbn><eisbn>1467307750</eisbn><eisbn>9781467307741</eisbn><eisbn>1467307742</eisbn><abstract>We study the capacity and delay scaling laws for cognitive radio network (CRN) with static primary users and heterogeneous mobile secondary users coexisting in the unit planar area. The primary network consists of n randomly and uniformly distributed static primary users (PUs) with higher priority to access the spectrum. The secondary network consists of m = (h + 1)n 1+ϵ heterogeneous mobile secondary users (SUs) which should access the spectrum opportunistically, here h = O(log n) and ϵ &gt;; 0. Each secondary user moves within a circular area centered at its initial position with a restricted speed. The moving area of each mobile SU is n -α , where a is a random variable which follows the discrete uniform distribution with h + 1 different values, ranging from 0 to α 0 (α 0 &gt;; 0). α 0 and h together determine the mobility heterogeneity of secondary users. By allowing the secondary users to relay the packets for primary users, we have proposed a joint routing and scheduling scheme to fully utilize the mobility heterogeneity of secondary users. We show that the primary network and secondary network can achieve optimal capacity and delay scalings if we increase the mobility heterogeneity of secondary users, i.e., the value of h and α 0 , until h = Θ(log n) and α 0 ≥ 1 + ϵ. In this optimal condition, both the primary network and part of the secondary network can achieve almost constant capacity and delay scalings except for poly-logarithmic factor.</abstract><pub>IEEE</pub><doi>10.1109/INFCOM.2012.6195787</doi><tpages>9</tpages><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier ISSN: 0743-166X
ispartof 2012 Proceedings IEEE INFOCOM, 2012, p.46-54
issn 0743-166X
2641-9874
language eng
recordid cdi_ieee_primary_6195787
source IEEE Electronic Library (IEL) Conference Proceedings
subjects Delay
Interference
Mobile communication
Relays
Routing
Throughput
Transmitters
title Scaling laws for cognitive radio network with heterogeneous mobile secondary users
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-07T12%3A42%3A06IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_6IE&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Scaling%20laws%20for%20cognitive%20radio%20network%20with%20heterogeneous%20mobile%20secondary%20users&rft.btitle=2012%20Proceedings%20IEEE%20INFOCOM&rft.au=Yingzhe%20Li&rft.date=2012-01-01&rft.spage=46&rft.epage=54&rft.pages=46-54&rft.issn=0743-166X&rft.eissn=2641-9874&rft.isbn=9781467307734&rft.isbn_list=1467307734&rft_id=info:doi/10.1109/INFCOM.2012.6195787&rft.eisbn=9781467307758&rft.eisbn_list=1467307750&rft.eisbn_list=9781467307741&rft.eisbn_list=1467307742&rft_dat=%3Cieee_6IE%3E6195787%3C/ieee_6IE%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-i220t-9441b05629bef029ad22e043c963400eb706905d236d236790b3f8ba200ed4b53%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=6195787&rfr_iscdi=true