›› 2013,Vol. 28 ›› Issue (3): 403-411.doi: 10.1007/s11390-013-1341-5

所属专题： Computer Networks and Distributed Computing

• Special Section on Selected Paper from NPC 2011 • 上一篇    下一篇

协作Ad Hoc网络的中断概率分析

Cheng-Wen Xing1 (邢成文), Member, IEEE, Hai-Chuan Ding1,2 (丁海川), Guang-Hua Yang3 (杨光华), Member, IEEE, Shao-Dan Ma2 (马少丹), Member, IEEE and Ze-Song Fei1 (费泽松), Member, IEEE   

  1. 1. School of Information and Electronics, Beijing Institute of Technology, Beijing 100081, China;
    2. Department of Electrical and Computer Engineering, University of Macau, Taipa, Macao, China;
    3. Department of Electrical and Electronic Engineering, The University of Hong Kong, Hong Kong, China
  • 收稿日期:2012-09-22 修回日期:2013-03-04 出版日期:2013-05-05 发布日期:2013-05-05
  • 作者简介:Cheng-Wen Xing received the B.Eng. degree from Xidian University, Xi'an, in 2005 and the Ph.D. degree from the University of Hong Kong, in 2010 both in electrical engineering. Since September 2010, he has been with the School of Information and Electronics, Beijing Institute of Technology, where he is currently a lecturer. His current research interests include statistical signal processing, convex optimization, multivariate statistics, combinatorial optimization, MIMO systems, and cooperative communication systems.
  • 基金资助:

    This work was supported in part by the National Natural Science Foundation of China under Grant No. 61101130 and the Excellent Young Scholar Research Funding of Beijing Institute of Technology under Grant No. 2013CX04038.

Outage Analysis of Opportunistic Cooperative Ad Hoc Networks with Randomly Located Nodes

Cheng-Wen Xing1 (邢成文), Member, IEEE, Hai-Chuan Ding1,2 (丁海川), Guang-Hua Yang3 (杨光华), Member, IEEE, Shao-Dan Ma2 (马少丹), Member, IEEE, and Ze-Song Fei1 (费泽松), Member, IEEE   

  1. 1. School of Information and Electronics, Beijing Institute of Technology, Beijing 100081, China;
    2. Department of Electrical and Computer Engineering, University of Macau, Taipa, Macao, China;
    3. Department of Electrical and Electronic Engineering, The University of Hong Kong, Hong Kong, China
  • Received:2012-09-22 Revised:2013-03-04 Online:2013-05-05 Published:2013-05-05
  • Contact: 10.1007/s11390-013-1341-5
  • Supported by:

    This work was supported in part by the National Natural Science Foundation of China under Grant No. 61101130 and the Excellent Young Scholar Research Funding of Beijing Institute of Technology under Grant No. 2013CX04038.

PDF (PC)

1943

本文研究和分析了协作Ad Hoc网络的性能。为了描述网络中节点分布的随机性,本文利用齐次泊松点过程对网络进行建模。与此同时,文中考虑了干扰消除对系统性能的影响。基于随机几何理论,本文得到了系统的中断概率以及协作增益。由分析结果可见,节点间的协作可以明显地改善系统的性能。最后,本文利用仿真验证了理论分析的准确性,因而文中的结果可为系统设计提供指导。

Abstract: In this paper, an opportunistic cooperative ad hoc sensor network with randomly located nodes is analyzed. The randomness of nodes' locations is captured by a homogeneous Poisson point process. The effect of imperfect interference cancellation is also taken into account in the analysis. Based on the theory of stochastic geometry, outage probability and cooperative gain are derived. It is demonstrated that explicit performance gain can be achieved through cooperation. The analyses are corroborated by extensive simulation results and the analytical results can thus serve as a guideline for wireless sensor network design.

[1] van der Meulen E C. Three-terminal communication channels. Advance in Applied Probability, 1971, 3(1): 120-154.

[2] Cover T, Gamal A E. Capacity theorems for the relay channel. IEEE Trans. Information Theory, 1979, 25(5): 572-584.

[3] Pabst R, Walke B H, Schultz D C et al. Relay-based deployment concepts for wireless and mobile broadband radio. IEEE Communications Magazine, 2004, 42(9): 80-89.

[4] Dai L, Chen W, Cimini Jr L J et al. Fairness improves throughput in energy-constrained cooperative ad-hoc networks. IEEE Trans. Wireless Commun., 2009, 8(7): 3679-3691.

[5] Zhu S, Leung K K, Constantinides A G. Distributed cooperative data relaying for diversity in impulse-based UWB adhoc networks. IEEE Trans. Wireless Commun., 2009, 8(8): 4037-4047.

[6] Dai L, Letaief K B. Throughput maximization of ad-hoc wireless networks using adaptive cooperative diversity and truncated ARQ. IEEE Trans. Commun., 2008, 56(11): 1907-1918.

[7] Nigara A R, Qin M, Blum R S. On the performance of wireless ad hoc networks using amplify-and-forward cooperative diversity. IEEE Trans. Wireless Commun., 2006, 5(11): 3204-3214.

[8] Baccelli F, B?laszczyszyn B, Muhlethaler P. Stochastic analysis of spatial and opportunistic aloha. IEEE J. Selected Area Commun., 2009, 27(7): 1105-1119.

[9] Huang K, Andrews J G, Guo D et al. Spatial interference cancellation for multiantenna mobile ad hoc networks. IEEE Trans. Information Theory, 2012, 58(3): 1660-1676.

[10] Xu Y,Wu P, Ding L, Shen L. Capacity analysis of selection cooperation in wireless ad-hoc networks. IEEE Commun. Letters, 2011, 15(11): 1212-1214.

[11] Weber S, Andrews J G, Yang X, De Veciana G. Transmission capacity of wireless ad hoc networks with successive interference cancellation. IEEE Trans. Info. Theory, 2007, 53(8): 2799-2814.

[12] Lee J, Andrews J G, Hong D. Spectrum-sharing transmission capacity with interference cancellation. IEEE Trans. Commun., 2013, 61(1): 76-86.

[13] Goldsmith A. Wireless Communications. Cambridge: Cambridge University Press, 2005.

[14] Ganti R K, Haenggi M. Spatial analysis of opportunistic downlink relaying in a two-hop cellular system. IEEE Trans. Commun., 2012, 60(5): 1443-1450.

[15] Liu C H, Andrews J G. Multicast outage probability and transmission capacity of multihop wireless networks. IEEE Trans. Info. Theory, 2010, 57(7): 4344-4358.

[16] Baccelli F, B?laszczyszyn B. Foundations and Trendsr in Networking: Stochastic Geometry and Wireless Networks (volume 2), Boston, USA: Now Publishers, 2009.

[17] Stoyan D, Kendall W, Mecke J. Stochastic Geometry and Its Applications (2 edition). Chichester: WILEY, 1996.

[18] Gradshteyn I S, Ryzhik I M. Tables of Integrals, Series, and Products (7 edition). San Diego: Academic Press, 2007.
No related articles found!
Viewed
Full text


Abstract

Cited
  Shared   
  Discussed   
[1] 马军; 马绍汉;. Efficient Parallel Algorithms for Some Graph Theory Problems[J]. , 1993, 8(4): 76 -80 .
[2] 金国华; 陈福接. On the Problem of Optimizing Parallel Programs for Complex Memory Hierarchies[J]. , 1994, 9(1): 1 -26 .
[3] 周建强; 谢立; 戴非; 孙钟秀;. Adaptive Memory Coherence Algorithms in DSVM[J]. , 1994, 9(4): 365 -372 .
[4] 张松懋;. Weak Precedence Story Parsing Grammar[J]. , 1995, 10(1): 53 -64 .
[5] 刘铁英; 叶新铭;. An Algorithm for Determining Minimal Reduced-Coverings of Acyclic Database Schemes[J]. , 1996, 11(4): 347 -355 .
[6] 王坚;. Integration Model of Eye-Gaze, Voice and Manual Response in Multimodal User Interface[J]. , 1996, 11(5): 512 -518 .
[7] 聂旭民; 郭青;. Renaming a Set of Non-Horn Clauses[J]. , 2000, 15(5): 409 -415 .
[8] . 基于克隆镶嵌的纹理样式生成[J]. , 2006, 21(2): 173 -180 .
[9] . 最优化实时应用中的动态电压调节点配置[J]. , 2006, 21(6): 893 -900 .
[10] . CLASCN: 支持高效数据库关键词Top-k查询的候选网络选择方法[J]. , 2007, 22(2): 197 -207 .
版权所有 © 《计算机科学技术学报》编辑部
本系统由北京玛格泰克科技发展有限公司设计开发 技术支持：support@magtech.com.cn
总访问量：