Tyck till om SwePub Sök här!
WFRF:(Song Honglin)
Sökning: WFRF:(Song Honglin) > Cross-layer optimiz...
- You, LeiUppsala universitet,Signaler och System,PCN CAD Center, Beijing University of Posts and Telecommunications, Beijing, China (författare)
Cross-layer optimization of wireless multihop networks with one-hop two-way network coding
- Artikel/kapitelEngelska2011
Förlag, utgivningsår, omfång ...
- Elsevier BV,2011
- printrdacarrier
Nummerbeteckningar
- LIBRIS-ID:oai:DiVA.org:uu-155389
- https://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-155389URI
- https://doi.org/10.1016/j.comnet.2011.01.008DOI
Kompletterande språkuppgifter
- Språk:engelska
- Sammanfattning på:engelska
Ingår i deldatabas
- SwePubSwePub
Klassifikation
Anmärkningar
- In this paper, we investigate optimal cross-layer design of congestion control, routing, one-hop two-way inter-commodity (OTIC) network coding and scheduling in wireless multihop networks utilizing the broadcast advantage of wireless medium. We first present an achievable rate region with OTIC network coding by introducing virtual flow rates in a node. Then we formulate the network utility maximization problem subject to constraints on this achievable rate region, and analyze the complexities of both node- and path-based formulation with no network coding, OTIC network coding, and overhearing network coding. After that, we solve it using dual decomposition and subgradient method. Based on the solution, we present a new queue model, which is able to facilitate the coding operation between two-way commodities, and then propose a backpressure-based cross-layer optimization algorithm with low coding complexity and overhead. Afterwards, we analyze the stability and asymptotical optimality of the proposed cross-layer algorithm by Lyapunov drift technique, and evaluate its performance through extensive simulation. By comparing with the pure routing scheme under both primary and two-hop interference models in an illustrative topology, it is shown that with the proposed joint optimization algorithms, the OTIC network coding can interact adaptively and optimally with other components in different layers and achieve high throughput gain. Simulation of the proposed algorithm in a mesh network with base station and a random ad hoc network justifies that OTIC network coding can obtain considerable throughput gain with low complexity in various kinds of networks.
Ämnesord och genrebeteckningar
- Wireless multihop networks
- Network coding
- Cross-layer optimization
- Subgradient
- Backpressure
- TECHNOLOGY
- TEKNIKVETENSKAP
- Elektroteknik med inriktning mot signalbehandling
- Electrical Engineering with specialization in Signal Processing
Biuppslag (personer, institutioner, konferenser, titlar ...)
- Ding, LianghuiUppsala universitet,Signaler och System (författare)
- Wu, PingUppsala universitet,Signaler och System(Swepub:uu)pingelwu (författare)
- Pan, ZhiwenNational Mobile Communication Research Laboratory, Southeast University, Nanjing, China (författare)
- Hu, HonglinShanghai Research Center for Wireless Communcations, Shanghai, China (författare)
- Song, MeiPCN CAD Center, Beijing University of Posts and Telecommunications, Beijing, China (författare)
- Song, JundePCN CAD Center, Beijing University of Posts and Telecommunications, Beijing, China (författare)
- Uppsala universitetSignaler och System (creator_code:org_t)
Sammanhörande titlar
- Ingår i:Computer Networks: Elsevier BV55:8, s. 1747-17691389-12861872-7069
Internetlänk
Hitta mer i SwePub
- Av författaren/redakt...
- You, Lei
- Ding, Lianghui
- Wu, Ping
- Pan, Zhiwen
- Hu, Honglin
- Song, Mei
- visa fler...
- Song, Junde
- visa färre...
- Artiklar i publikationen
- Computer Network ...
- Av lärosätet
- Uppsala universitet
Sök utanför SwePub
- Sök vidare i:
- Google Book Search
- Google Scholar
Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.
- Copyright © LIBRIS - Nationella bibliotekssystem
- LIBRIS.kb.se
