Design And Implementation Of Wireless Network Based On NRF24L01

With the rapid development of the wireless communication technology, kinds ofwireless networks have already been in aspects of people’s daily life, acting indispensibleparts in information society. As a result of the continuous creation of wireless technology, thedate-rate of network communication is faster and faster and the transmission distance is fatherand father. The application area of wireless technology does not confine to high date-rate andremote data transmission, and excessive date-rate and transmission distance are notobligatory in many occasions, for example, wireless detection, wireless control, wirelesssensor network, Smart Home and so on.In order to meet the demand of short distance networking technology with low cost, thispaper designed and implemented a kind of wireless network based on nRF24L01whichincluded the networking protocol and related unicast and multicast routing algorithms. Theresearch has great significance for wireless network with low cost used in industry and familyautomation, wireless detection and other Applications Scenarios.While lucubrating various characteristic of nRF24L01, which includes sending mode,receive mode, automatic retransmission and so on, first, this paper designed and implementeda method of channel selection which saved the network from interference。Then this articledesigned a kind of custom response way which has more advantages compared with therespond mode which is intrinsic while there were more forwarding nodes. The design whichis related with the network includes the setting of the node address, the format of the dataframes and the mechanism of respond, retransmission and withdrawal.According to the characteristics of the application scene, the routing table (includingunicast and multicast) is calculated by the convergent node and is sent to the common node.The convergent node could obtain the topological structure of the network. This paperdesigned and implemented a process of obtaining the network topological structure which isstarted by the convergent node and finished with cooperating of other nodes. The convergentnode could gain the adjacency matrix. The unicast routing table is established as follows: the convergent node gains theprecursor matrix using the classical Ford-Warshall algorithm, sending the precursor table toall common nodes and calculating the routing table using the precursor table. This paperproposals related methods to make the network refresh the route when the network gets intotrouble or is obstructed.Multicast routing algorithm based on unicast routing results, this paper implemented alower cost of routing with the reference of some multicast routing algorithm. The algorithmmake full use of the wireless network properties which could work with one sending pointand multiple receiving points, and resolve the collision problem that multiple nodes sends ina multicast.Finally, some experiment designed to verification the implementation of network,experiments show that the network has reached the design requirement.