多跳分簇自组网络的最优簇内跳数分析

doi:10.3969/j.issn.1000-1093.2018.11.016

兵工学报 ›› 2018, Vol. 39 ›› Issue (11): 2220-2227.doi: 10.3969/j.issn.1000-1093.2018.11.016

多跳分簇自组网络的最优簇内跳数分析

张文庆，李旭，黄文俊

(北京交通大学电子信息工程学院, 北京 100044)

收稿日期:2018-02-06 修回日期:2018-02-06 上线日期:2018-12-25
通讯作者: 李旭（1970—），女，教授，博士生导师 E-mail:xli@bjtu.edu.cn
作者简介:张文庆（1993—），女，硕士研究生。E-mail: 16120167@bjtu.edu.cn
基金资助:
国家重点研发计划项目（2017YFF0206201）；中央高校基本科研业务费专项项目（2016JBZ003）

Analysis of Optimal Inner-cluster Hop Number of Multi-hop Cluster-based Ad Hoc Network

ZHANG Wen-qing， LI Xu， HUANG Wen-jun

(School of Electronic and Information Engineering, Beijing Jiaotong University, Beijing 100044，China)

Received:2018-02-06 Revised:2018-02-06 Online:2018-12-25

摘要/Abstract

摘要： 多跳分簇自组网络的网络规模扩展性差、开销大，簇内跳数的选取是影响分簇网络性能的关键。综合考虑路由层簇维护和媒体介入控制层调度的开销，利用硬核泊松点过程推导网络的干扰与容量，进一步建立网络吞吐量与信道利用率模型，以吞吐量最大化为目标，以信道利用率为约束，得到最优的簇内跳数。仿真结果表明，所建立的模型能有效反映簇内跳数、节点密度等参数对干扰强度、网络吞吐量和信道利用率的影响，簇内跳数的最优值取决于路径损耗系数和节点密度。

关键词: 多跳分簇, 自组网络, 簇内跳数, 硬核泊松点过程, 节点吞吐量

Abstract: Multi-hop cluster-based ad hoc networks suffer from poor scalability and large overhead. The selection of inner-cluster hop number is the key to the performance of cluster network. In considering the overhead of routing layer maintenance and MAC layer scheduling, the interference and capacity of network are derived out using hard-core Poisson point process (HCPP). A network throughput and channel utilization rate model is further established. With the goal of the maximizing throughput and the constraint of channel utilization rate, the optimal inner-cluster hop number is obtained. Simulated results show that the proposed model can effectively reflect the impacts of inner-cluster hop number, node density and other parameters on interference intensity, throughput and channel utilization rate. The optimal inner-cluster hop number depends on path loss coefficient and node density. Key

Key words: multi-hopclustering, adhocnetwork, inner-clusterhopnumber, hard-corePoissonpointprocess, nodethroughput

中图分类号:

TN929.532

张文庆，李旭，黄文俊. 多跳分簇自组网络的最优簇内跳数分析[J]. 兵工学报, 2018, 39(11): 2220-2227.

ZHANG Wen-qing， LI Xu， HUANG Wen-jun. Analysis of Optimal Inner-cluster Hop Number of Multi-hop Cluster-based Ad Hoc Network[J]. Acta Armamentarii, 2018, 39(11): 2220-2227.

参考文献

［1］ Sucasas V, Radwan A, Marques H, et al. A survey on clustering techniques for cooperative wireless networks［J］. Ad Hoc Networks, 2016, 47(C):53-81.
［2］ Amis A D, Prakash R, Vuong T H P, et al. Max-min d-cluster formation in wireless ad hoc networks［C］∥Proceedings of IEEE Conference on Computer Communications. Tel Aviv, Israel: IEEE, 2000:32-41.
［3］ Conceio L, Curado M. Onto scalable wireless ad hoc networks: adaptive and location-aware clustering［J］. Ad Hoc Networks, 2013, 11(8):2484-2499.
［4］ Guizani B, Ayeb B, Koukam A. A stable K-hop clustering algorithm for routing in mobile ad hoc networks［C］∥Proceedings of 2015 International Wireless Communications and Mobile Computing Conference. Dubrovnik, Croatia: IEEE, 2015:659-664.
［5］ Misra R, Yadav R N, Dosapati V. On robust k-hop clustering in ad-hoc cognitive radio networks［C］∥Proceedings of the 22nd National Conference on Communication. Guwahati, India: IEEE, 2016:1-6.
［6］ Perevalov E, Blum R S, Safi D. Capacity of clustered ad hoc networks: how large is “large”?［J］. IEEE Transactions on Communications, 2006, 54(9):1672-1681.
［7］ Niu X G, Cui L, Huang C C. Hybrid optimal cluster routing protocol for mobile ad hoc network［J］. Journal on Communications, 2010, 31(10):58-67.
［8］ Yevsieieva O, Al-Azzawi E M. Choosing of optimal cluster size in WiMax mesh network under hierarchical cross-layer routing［C］∥Proceedings of the 2nd International Scientific-Practical Conference on Problems of Infocommunications Science and Technology. Kharkiv, Ukraine: IEEE, 2015:29-32.
［9］ Zhang L, Quddus A U, Katranaras E, et al. Performance analysis and optimal cooperative cluster size for randomly distributed small cells under cloud RAN［J］. IEEE Access, 2016, 4:1925-1939.

［10］ Kurniawan D W H, Kurniawan A, Arifianto M S. An analysis of optimal capacity in cluster of CDMA wireless sensor network［C］∥Proceedings of 2017 International Conference on Applied Computer and Communication Technologies. Jakarta, Indonesia: IEEE, 2017:1-6.
［11］ Li X, Gao H, Liang Y, et al. Performance modeling and analysis of distributed multi-hop wireless ad hoc networks［C］∥Proceedings of International Conference on Communications. Kuala Lumpur, Malaysia: IEEE, 2016:1-6.
［12］ Haenggi M. Stochastic geometry for wireless networks［M］. Cambridge, UK: Cambridge University Press, 2012:1-302.
［13］ Albert R, Barabási A. Statistical mechanics of complex networks［J］. Review of Modern Physics, 2002, 74(1):47-92.
［14］ Haenggi M. Mean interference in hard-core wireless networks［J］. IEEE Communications Letters, 2011, 15(8):792-794.
［15］王建新, 朱贤曼, 罗玉宏,等. 移动自组网中任意时刻链路可用性计算方法［J］. 电路与系统学报, 2009, 14(1):1-7.
WANG Jian-xin, ZHU Xian-man, LUO Yu-hong, et al. Link availability for any time in mobile ad hoc networks［J］. Journal of Circuits & Systems, 2009, 14(1):1-7.(in Chinese)

第39卷
第11期2018 年11月兵工学报ACTA
ARMAMENTARIIVol.39No.11Nov.2018

多跳分簇自组网络的最优簇内跳数分析

Analysis of Optimal Inner-cluster Hop Number of Multi-hop Cluster-based Ad Hoc Network

PDF

可视化

摘要/Abstract

引用本文

使用本文

参考文献

相关文章 0

编辑推荐

Metrics

本文评价