Probability Detection CSMA with Monitoring Based on the Improved Binary Tree Conflict Resolution Algorithm

Abstract:

This paper presents a new wireless sensor network MAC protocol: the probability detection CSMA protocol with monitoring function based on the improved binary tree conflict resolution algorithm. By using the average cycle method, the paper gets the mathematical expressions of the throughput, system average delay of the probability detection CSMA protocol with monitoring function and the probability detection CSMA protocol with monitoring function based on the improved binary tree conflict resolution algorithm through complicated mathematical modeling, rigorous mathematical derivation. The computer simulation results not only confirm the correctness of the theoretical analysis but also show that the probability detection CSMA protocol with monitoring function based on the improved binary tree conflict resolution algorithm due to adding to the conflict resolution algorithm, resulting in the increases of systemic throughput but increase the time delay of the system.

• Periodical: Applied Mechanics and Materials (Volume 610)
• Pages: 897-904
• DOI: https://doi.org/10.4028/www.scientific.net/AMM.610.897
• Online since: August 2014
• Authors: Ying Ying Guo*, Hong Wei Ding, Yi Fan Zhao, Jia Guo, Qian Lin Liu
• Keywords: Average Cycle Method, BTPDACK-CSMA, Improved Binary Tree Conflict Resolution, PDACK-CSMA, System Average Delay, Throughput

References

[1] Qin Danyang, Wang Huiwu, Ma Lin, Ding Qun. Reserach on Topology Property for Wireless Multihop Communication Network. TELKOMNIKA Indonesion Journal of Electrical Engineering. 2013, 1(11): 351-361.

DOI: 10.11591/telkomnika.v11i1.1907

[2] Xu Rui. Wireless Communication Network' Planning in under developed Counteries. International Journal of Plant Engineering and Management. 2012, 4(17): 238-254.

[3] Zhao Hongmin. The Research on Wireless Local Area Network MAC Layer Protocol [D]. Central South University, 2009. 12.

[4] Zhao Dongfeng. Study on a New Method for Continuous-Time Systems of Random Access Channel [J]. Journal of Electronics, 1999. 1 (21): 37-41.

[5] Zhao Dongfeng, Li Bihai, Zheng Sumin. Study on a New Method for the Slotted Access Channel [J]. Journal of Electronics, 1997. 6 (19): 814-819.

[6] Qu Junqing, Gao Zhonghe. The Theoretical Analysis of p in the P-persistent CSMA Protocol [J]. Computer Era, 2009. 6: 48-50.

[7] Wu Xiaoping. The Discus s of Solving the Hidden and Exposed Terminal Problems in Ad Hoc Network [J]. Microcomputer Information, 2006. 22 (10): 35-38.

[8] Gulko E. Tree-based multi-access protocols where collision multiplicities are known. IEEE Trans Commun, 1985, 33: 999.

DOI: 10.1109/tcom.1985.1096419

[9] Zhao Dongfeng, Li Bihai, Zheng Sumin. Study on Two-Ary Tree Algorithms of Packet Conflict Resolution for Random Channels. Journal of Yunnan University (Natural Sciences), 1996, 8 (25): 260-264.

[10] Zhao Dongfeng. Study on the Average Cycle Method for Slotted Multiple-Access Communications [J]. Journal of China Institute of Communications. 1999, 20(8): 80-85.

[11] Liu Binbin. The Analysis of Multi-channel Random Multiple Access Wireless Communication Network Protocol based on Probability Detection [D]. Kunming: Yunnan University, (2006).

[12] Zhou Ningyu, Zhao Dongfeng, Ding Hongwei. Analysis of Multi-Channel and Random Multi-Access Ad hoc Networks Protocol with Two-dimensional Probability [C]. Computational Intelligence and Industrial Applications Conference (Proceedings of ISCIIA 2006), 2006. 26-32.

DOI: 10.1016/s1007-0214(08)72195-3