Broadcast on wireless mesh networks using neighbor nodes

Wireless mesh networks can spread to an unlimited amount. This increased by adding nodes based client that is challenging . One of the most important of these issues is appropriate routing and route selection to minimize data redundancy and also to at least take the fastest time possible . Broadcast one of the most important tasks is a mesh network , Because the message control and activation of all for spreading universal basis and are due to the expansion of unlimited nodes , unlimited route for this purpose there , each with a different answer produce and a path false the entire broadcast will be difficult . In this study broadcast in wireless mesh networks operated by three basic approaches . The first approach is to not use the tree for routing a greedy technique has been used for this purpose . Select the node that performs the second publisher. And The third approach at every stage of the distribution node is selected . By selecting the most profitable node due to the dependence of the neighboring nodes with the corresponding node And Thus providing the required data to the node, resulting in less redundancy than other nodes . The same procedure until all nodes receive the corresponding data continue And This project has caused a reduction of redundancy in the network data transfer rates decrease And Nodes that are involved in the publish is less . The results of the simulation showed that compared with previous models the minimum data transfer rate dropped to 5 percent . also Due to the broadcast layered And Step by step by selecting multiple servers , server of choice for each broadcast on the amount of 7 percent from previous models that have the best performance is lower .

کلیدواژه ها:

Broadcasting ، Rated Nodes ، Wireles Mesh Network