Based on binary trees conflict decomposition not adhere to the S-CSMA protocol analysis
|Course||Electronics and Communication Engineering|
|Keywords||Wireless Sensor Network Random Multi-access Binary Trees Conflict Resolution algorithm|
Wireless Sensor Network (Wireless Sensor Network, WSN) which is a very important emerging technology in the information age, has caused great concerning all over the world, compared with current Wireless LAN, Mobile Communications Networks, Cellular Communications, Wireless Sensor Network has much more development potential. Wireless Sensor Network is composed of a large number of distributed sensor nodes for task-based self-organizing network for data collection and transmission, to provide users with useful information. It is widely applied in lots of fields, such as military defense, industry control, agricultural control, health care, rushing to deal with an emergency rescue, counter-terrorism and anti-terrorism, environmental monitoring, a remote control to hazardous area and so on However, due to its inherent networking site communications ability, computing speed, storage capacity and energy and other constraints, therefore, Wireless Sensor Network has great challenge and vast space in-depth studying. Wireless Sensor Network will become one of the most potential technologies in the twenty-first century.Because of their unique characteristics and related needs, Wireless Sensor Network’s network protocol is a very challenging task in designing. In this paper, By Wireless Sensor Network as the studying object, a random multiple access technology is described which has a wide range of applications in computer systems and communication networks.The technology is characterized by the user dynamically occupation of public resources to make maximum use of existing data storage area and the information transmission channels. The information packet is random access, there will inevitably cause conflict. Therefore, the conflict resolution capacity which is good or bad becomes the key factor so that the random access system can work efficiently. Tree collision resolution algorithm in a variety of collision resolution algorithms is a more effective decomposition method. Practice has proved that the binary conflict resolution algorithm is an effective collision resolution algorithm, However, so far these algorithms are all more complex for analysis.Based on the random multiple access system, this paper proposes a new algorithm for analysis-Isolated binary conflict resolution algorithm, which the basic idea is:the source code activating group that send a message in the same time slot is as a group, and each activating source code in the same set does independent Bernoulli trials, if the result is’0’, then the left slot (first slot) is selected to send information; if the result is ’1’, then the right time slot (second slot) is selected to send information. When the number of conflicts terminal station which you choose the left slot to send information is up to 0, turning the activating conflicts’terminal station in the right slot to send information to decompose. The decomposing process stops until the number of activating conflicts’terminal station is zero.The algorithm is used in slotted CSMA protocol in this paper, and the protocol is done mathematical analysis by using method of the average period and is concluded mathematical expressions of the average time slot and the system throughput of the binary type of isolation method of conflict resolution, and do the simulation testing and analysis of evaluation for the protocol, which shows its effectiveness.