基于中斷概率的多跳混合協(xié)作地理路由算法

張嵩; 馬林華; 茹樂; 張海威; 唐紅; 胡星

doi:10.11999/JEIT150487

基于中斷概率的多跳混合協(xié)作地理路由算法

doi: 10.11999/JEIT150487

1.
(空軍工程大學(xué)航空航天工程學(xué)院西安 710038) ②(宇航動(dòng)力學(xué)國家重點(diǎn)實(shí)驗(yàn)室西安 710043)

基金項(xiàng)目:

國家自然科學(xué)基金(61372167)，航空科學(xué)基金 (20130596008)

計(jì)量
- 文章訪問數(shù): 1226
- HTML全文瀏覽量: 114
- PDF下載量: 340
- 被引次數(shù): 0
出版歷程
- 收稿日期: 2015-04-29
- 修回日期: 2015-10-13
- 刊出日期: 2016-02-19

Multi-hop Hybrid Cooperative Geographic Routing Algorithm with Outage-probability-constrained

1.
(Institute of Aeronautics and Astronautics Engineering, Air Force Engineering University, Xi&rsquo
2.
(State Key Laboratory of Astronautics Dynamics, Xi&rsquo

Funds:

The National Natural Science Foundation of China (61372167), National Aerospace Science Foundation of China (20130596008)

摘要

摘要: 為了減小無線傳感器網(wǎng)絡(luò)中路由的路徑長度，該文提出基于中斷概率的多跳混合協(xié)作地理路由(MHCGR)算法。首先對(duì)不同協(xié)作機(jī)制的鏈路進(jìn)行分析，理論分析表明，在一定中斷概率要求下，采用譯碼放大轉(zhuǎn)發(fā)混合協(xié)作機(jī)制可以進(jìn)一步擴(kuò)大傳輸距離，并推導(dǎo)了每跳協(xié)作鏈路的理想最大協(xié)作傳輸距離和理想中繼的位置。在無信標(biāo)地理路由(BLGR)算法的基礎(chǔ)上，MHCGR算法結(jié)合節(jié)點(diǎn)位置信息為每跳選擇最佳的中繼節(jié)點(diǎn)和轉(zhuǎn)發(fā)節(jié)點(diǎn)，建立從源節(jié)點(diǎn)到目的節(jié)點(diǎn)的多跳協(xié)作路由。仿真表明，與ENBGCR算法和基于DF協(xié)作機(jī)制的MPCR算法兩種協(xié)作地理路由算法相比，MHCGR算法可明顯減少路由的跳數(shù)，改善路由的整體發(fā)射功率。
- 無線傳感器網(wǎng)絡(luò) /
- 路徑長度 /
- 協(xié)作路由 /
- 協(xié)作傳輸距離 /
- 位置信息
Abstract: A Multi-hop Hybrid Cooperative Geographic Routing (MHCGR) algorithm with outage-probability- constrained is proposed to reduce the path length for routing in wireless sensor networks. The cooperative links using different cooperative strategies are analyzed. With theoretical analysis, the decode-amplify-and-forward hybrid cooperative strategy can further expand the transmission distance. The ideal maximum cooperative transmission distance and the location of ideal relay node are proved for per-hop cooperative transmission link. Based on the BeaconLess Geographic Routing (BLGR) algorithm, the MHCGR algorithm uses the location information of nodes to select the optimum relay node and optimum forward node for each hop. Then MHCGR algorithm forms the cooperative route from the source node to destination node by mentioned cooperative strategy. Simulation results show that, compared with the ENBGCR algorithm and the MPCR algorithm using DF strategy, the MHCGR algorithm can reduce the number of routing hop, and reduce the overall transmission power routing.
- Wireless sensor networks /
- Path length /
- Cooperative routing /
- Cooperative transmission distance /
- Location information

HTML全文

參考文獻(xiàn)(17)

HEISSENBUTTEL M, BRAUN T, BERNOULLI T, et al. BLR: Beacon-less routing algorithm for mobile ad hoc networks[J]. Elsevier Compter Communication, 2004, 27(11): 1076-1086.

WANG Anbao and ZHU Bin. Improving MPR selection algorithm in OLSR protocol based on node localization technology[J]. Journal of Networks, 2014, 9(7): 1674-1681.

JENI P R J, JULIET A V, and BOSE A M. A secured and reliable route maintenance mechanism for AODV routing protocol[J]. International Journal on Information Technology, 2014, 2(2): 56-62.

NOARATINIA A, HUNTER T E, and HEDAYAT A. Cooperative communication in wireless networks[J]. IEEE Communications Magazine, 2004, 42(10): 74-80.

SU Weifeng, SADEK A K, and LIU K J R. Cooperative communication protocols in wireless networks: Performance analysis and optimum power allocation[J]. Wireless Personal Communications, 2008, 44(2): 181-217.

IBRAHIM A, HAN Zhu, and LIU K J R. Distributed energy-efficient cooperative routing in wireless networks[J]. IEEE Transactions on Wireless Communications, 2008, 7(10): 3930-3941.

張晚生, 劉凱. 無線網(wǎng)絡(luò)中基于位置的能量高效協(xié)作路由算法[J]. 電子與信息學(xué)報(bào), 2012, 34(1): 63-68. doi:10.3724/SP. J.1146.2011.00425.

ZHANG Wansheng and LIU Kai. Energy-efficient location- based cooperative routing in wireless network[J]. Jounal of Electronics Information Technology, 2012, 34(1): 63-68. doi: 10.3724/SP.J.1146.2011.00425.

SYUE S J, WANG Chinliang, AGUILAR T, et al. Cooperative geographic routing with radio coverage extension for SER-constrained wireless relay networks[J]. IEEE Journal on Selected Areas in Communications, 2012, 30(2): 271-279.

ABDULHADI S, JASEEMUDDIN M, and ANPALAGAN A. Multi-hop routing with cooperative transmission: A cross-layer approach[J]. Wireless Network, 2014, 20(7): 1685-1697.

SU Weifeng and LIU Xin. On optimum selection relaying protocols in cooperative wireless networks[J]. IEEE Transactions on Communications, 2010, 58(1): 52-57.

XIONG Ke, FAN Pingyi, LI Tao, et al. Outage probability of spacetime network coding over rayleigh fading channels[J]. IEEE Transactions on Vehicular Technology, 2014, 63(4): 1965-1970.

BHATNAGAR M R and ARTI M K. On the closed-form performance analysis of maximal ratio combining in Shadowed-Rician fading LMS channels[J]. IEEE Communications Letters, 2014, 18(1): 54-57.

MUTHUKUMAR S and NAGARAJAN V. Performance analysis of selective decode and forward protocol with partner selection[J]. International Journal of Mobile Communications, 2014, 12(2): 192-206.

劉云, 劉凱, 曾峰. 無線網(wǎng)絡(luò)中基于優(yōu)先級(jí)競(jìng)爭(zhēng)的協(xié)作媒質(zhì)接入控制協(xié)議研究[J]. 通信學(xué)報(bào), 2011, 32(8): 183-190.

LIU Yun, LIU Kai, and ZENG Feng. Study in a cooperative MAC protocol with priority-based contention for wireless networks[J]. Journal on Communications, 2011, 32(8): 183-190.

AGUILAR T, SYUE S, GAUTHIER V, et al. CoopGeo: A beaconless geographic cross-layer protocol for cooperative wireless ad hoc networks[J]. IEEE Transactions on Wireless Communications, 2011, 10(8): 2554-2565.

相關(guān)文章

施引文獻(xiàn)

資源附件(0)

訪問統(tǒng)計(jì)