[公告] 博士論文口試 陳富文 (2013/11/8)

[:()]

嚙瞎嚙諍大嚙褒賂蕭T嚙線嚙緹嚙褒系嚙調士嚙論歹蕭f嚙踝蕭
嚙踝蕭 嚙談：嚙踝蕭嚙瘢嚙踝蕭
嚙踝蕭伀訇癒G嚙踝蕭嚙窮嚙瑾嚙請梧蕭
嚙篆嚙調委嚙踝蕭G
嚙調外: 嚙踝蕭嚙篇嚙請授、嚙踝蕭R嚙篇嚙請授、嚙踝蕭嚙磐嚙緘嚙請梧蕭
嚙調歹蕭: 嚙穀嚙踝蕭嚙踝蕭嚙請授、嚙踝蕭嚙踝蕭嚙踝蕭訇癒B嚙踝蕭嚙窮嚙瑾嚙請梧蕭
嚙踝蕭 嚙踝蕭嚙瘦102 嚙羯 11 嚙踝蕭 8 嚙踝蕭 (嚙瞑嚙踝蕭嚙踝蕭) 15:00 - 17:00
嚙窮 嚙瘢嚙瘦嚙綞嚙瘤嚙稽 614 嚙罵議嚙踝蕭
嚙瘩 嚙諍：Design and Analysis of Efficient Transmission Control Protocols in
Wireless Networks: Multihop Broadcast and Relay-Assisted Network-Coding ARQ

嚙論歹蕭K嚙緯嚙瘦
Wireless communication is inherently error-prone due to path loss,
fading, noise, interference, etc. In such an error-inclined environment with
scarce spectrum, it is of paramount importance to achieve reliable data
delivery efficiently. In this thesis, we develop efficient schemes for
providing reliable broadcast in wireless multihop networks and for providing
advanced ARQ in wireless relay networks.

We first address the minimum transmission broadcast problem in
error-prone wireless networks and present efficient solutions, including an
optimal broadcast scheme and a distributed game-based algorithm. The minimum
transmission broadcast problems over reliable links and over unreliable links
are formulated as two mixed integer linear programming (MILP) problems,
respectively. This way, optimal broadcast schemes can be easily obtained
using any existing MILP solver, for small-scale networks. For large-scale
networks, we propose a distributed game-based algorithm and prove that the
game-based algorithm achieves Nash Equilibrium. Using simulation, we confirm
that compared with existing algorithms in the literature and optimal
solutions obtained by our MILP techniques, the proposed game-based algorithm
performs very well in terms of delivery ratio, number of transmissions, and convergence speed.

We further address the issue of advanced ARQ in wireless relay networks
and develop relay-assisted network-coding (RANC) ARQ protocols, which
leverage both opportunistic retransmission and network coding techniques. We
introduce the concept of work, which is the number of recoded blocks a relay
node will send, and study ways to adjusting the rate at which a relay node
increases its work. Based on this concept, we present the unified framework
of work-based RANC and then, under the unified framework, we develop a number
of RANC ARQ protocols including plain-RANC, Work-based Opportunistic RANC
(WO-RANC), Listen-and-Supersede (LS) RANC, and Hold-and-Proceed (HP) RANC. LS
offers a fundamental limit to any single-relay RANC ARQ protocol. HP is a
simple yet efficient RANC ARQ protocol with near-zero overhead. We analyze
saturation throughput and segment delay for both LS and HP. Through extensive
analysis and simulation results, we show that HP has a performance close to
LS.

Publication:
Journal Paper
1. Fu-Wen Chen and Jung-Chun Kao, 嚙踝蕭Game-Based Broadcast over Reliable and
Unreliable Wireless Links in Wireless Multihop Networks,嚙踝蕭 IEEE Transactions
on Mobile Computing, vol. 12, no. 8, pp. 1613-1624, Aug. 2013. (SCI, EI)
[Impact factor: 3.071]
2. Jung-Chun Kao and Fu-Wen Chen, 嚙踝蕭On RANC ARQ for Wireless Relay Networks:
From the Transmission Perspective,嚙踝蕭 IEEE Transactions on Wireless
Communications, vol. 12, no. 6, pp. 2962-2976, June 2013. (SCI, EI) [Impact
factor: 2.744]

Conference Papers
1. Jung-Chun Kao, Fu-Wen Chen, Ming-Hung Yang, and Te-Li Wang, 嚙踝蕭Coverage
Enhancement to IEEE 802.11p Using Work-Based Opportunistic Relay-Assisted
Network-Coding ARQ,嚙踝蕭 in Proc. IEEE Asia Pacific Wireless Communication
Symposium (IEEE VTS APWCS), Singapore, Aug. 2011.
2. Fu-Wen Chen and Jung-Chun Kao, 嚙踝蕭RRBS: Reliable Broadcasting over
Unreliable Wireless Links in Resilient Ad-Hoc Networks,嚙踝蕭 in Proc. Intl.
Symposium on Wireless Personal Multimedia Communications (WPMC), Sept. 2012.

--
[;32m嚙踝蕭 Origin: 嚙踝蕭嚙踝蕭嚙賣站<bbs.cs.nthu.edu.tw>
[;32m嚙踝蕭 From: richarticle @ r735-2.cs.nthu.edu.tw [m
[;36mricharticle 嚙踝蕭 2013/10/23 Wed 20:16:52 嚙緬 r735-2.cs.nthu.edu.tw 嚙論改蕭 [m