Multihop Routing and Resource Allocation for Multimedia Applications in Dynamic Spectrum Access Networks

被引:0
|
作者
Su, Jingkai [1 ]
Wyglinski, Alexander M. [1 ]
机构
[1] Worcester Polytech Inst, Dept Elect & Comp Engn, Wireless Innovat Lab, Worcester, MA 01609 USA
来源
2011 IEEE PACIFIC RIM CONFERENCE ON COMMUNICATIONS, COMPUTERS AND SIGNAL PROCESSING (PACRIM) | 2011年
关键词
AD HOC NETWORKS;
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
In this paper, we propose a distributed routing mechanism in dynamic spectrum access (DSA) networks based on a pricing mechanism, in which each node put prices on their relaying services and adjust the price according to the interference condition and the spectrum availability. The proposed mechanism tries to provide required bandwidth for multimedia transmissions in DSA networks. DSA networks employing cognitive radios enable agile transmissions and provide additional transmission capacity that would otherwise be unavailable. Although the technologies applied in DSA networks provide more information than traditional contention-based networks, conventional resource allocation mechanisms cannot fully use these measurements from the MAC layers to regulate the network. The interference pattern in distributed DSA networks is also not the same as it is in contention-based TDMA networks. Consequently, spectrum allocation mechanisms must cooperate with routing algorithms in order to adapt to the rapidly varying environment of distributed wireless networks. Routing decision is made based on the price offered and price for relaying. Resources are allocated during the routing process according to interference predictions based on spectrum measurements. Simulation results show that the proposed approach increased the throughput of the network by approximately 100% in heavy traffic situation relative to an AODV based direct resource allocation approach.
引用
收藏
页码:762 / 767
页数:6
相关论文
共 50 条
  • [1] Revenue Sharing Based Resource Allocation for Dynamic Spectrum Access Networks
    Wu, Yuan
    Zhu, Qionghua
    Huang, Jianwei
    Tsang, Danny H. K.
    IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 2014, 32 (11) : 2280 - 2296
  • [2] Heat Diffusion Algorithm for Resource Allocation and Routing in Multihop Wireless Networks
    Banirazi, Reza
    Jonckheere, Edmond
    Krishnamachari, Bhaskar
    2012 IEEE GLOBAL COMMUNICATIONS CONFERENCE (GLOBECOM), 2012, : 5693 - 5698
  • [3] Simultaneous Routing and Resource Allocation in Multihop Wireless Networks using Optimization
    Moberg, Peter
    GLOBECOM 2006 - 2006 IEEE GLOBAL TELECOMMUNICATIONS CONFERENCE, 2006,
  • [4] A Stochastic Spectrum Trading and Resource Allocation Framework for Opportunistic Dynamic Spectrum Access Networks
    Abdelraheem, Mohamed
    Abdellatif, Mohammad M.
    IEEE ACCESS, 2022, 10 : 73774 - 73785
  • [5] Resource allocation for dynamic routing in WDM networks
    Späth, J
    ALL-OPTICAL NETWORKING 1999: ARCHITECTURE, CONTROL, AND MANAGEMENT ISSUES, 1999, 3843 : 235 - 246
  • [6] Dynamic spectrum access and joint radio resource management combining for resource allocation in cooperative networks
    Pan, Miao
    Chen, He
    Liu, Ruoju
    Feng, Zhiyong
    Wang, Ying
    Zhang, Ping
    2007 IEEE WIRELESS COMMUNICATIONS & NETWORKING CONFERENCE, VOLS 1-9, 2007, : 2748 - +
  • [7] Cloud Computing and Dynamic Resource Allocation for Multimedia Applications
    He, Yifeng
    Guan, Ling
    Zhu, Wenwu
    Lee, Ivan
    INTERNATIONAL JOURNAL OF DIGITAL MULTIMEDIA BROADCASTING, 2012, 2012
  • [8] Resource consumption in dynamic spectrum access networks: Applications and Shannon limits
    Pursley, Michael B.
    Royster, Thomas C.
    2007 INFORMATION THEORY AND APPLICATIONS WORKSHOP, 2007, : 321 - +
  • [9] CORA: Cooperative Communication and Optimal Resource Allocation in Multihop Wireless Multimedia Sensor Networks
    Mali, Goutam
    Misra, Sudip
    IEEE INTERNET OF THINGS JOURNAL, 2024, 11 (03) : 4076 - 4084
  • [10] Dynamic routing and resource allocation in WDM transport networks
    Späth, J
    COMPUTER NETWORKS, 2000, 32 (05) : 519 - 538