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

doi:10.3969/j.issn.1000-1093.2018.11.016

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

CLC Number:

TN929.532

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.

References

［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

[1]	FU Yanfang， WANG Zan， SU Yichang， DAI Fei， ZHONG Lianjiong， GUO Dengdeng， LU Ying， LIANG Hongtao. Availability Modeling of Military Ad Hoc Network Based on Markov Chain [J]. Acta Armamentarii, 2021, 42(1): 65-73.
[2]	DING Hongwei， LU Xu， YANG Zhijun， BAO Liyong， LIU Qianlin. Implementation and Performance of FPGA-based Multi-priority Optimized CSMA in Ad Hoc Network [J]. Acta Armamentarii, 2020, 41(9): 1837-1847.
[3]	LIU Dakun， CHEN Guifen， WANG Yijun. Regional Coverage Cooperative Control Algorithm for Ad Hoc Networks [J]. Acta Armamentarii, 2020, 41(6): 1131-1139.
[4]	LIU Dakun， CHEN Guifen， WANG Yijun. Cooperative Time Synchronization Optimization Algorithm for Wireless Ad Hoc Networks [J]. Acta Armamentarii, 2020, 41(4): 702-710.
[5]	LIU Weilun, ZHANG Hengyang, ZHENG Bo, GAO Weiting. A Novel Media Access Control Protocol for Multiple Priority Services in FANETs [J]. Acta Armamentarii, 2019, 40(4): 820-828.
[6]	TANG Yao, LI Bo, YAN Zhong-jiang, YANG Mao, ZUO Xiao-ya. A Cluster Head Coordination-based Time-division Multiple Access Routing Protocol [J]. Acta Armamentarii, 2017, 38(11): 2143-2150.
[7]	LIU Ying， TANG Yi-wei， SHAO Xiao-tao， LI Xu. Hybrid Routing Protocol for Wireless Multi-hop Ad Hoc Networks [J]. Acta Armamentarii, 2017, 38(1): 184-189.