Clustering Routing Algorithm Based On Regular Hexagons Design And Implementation In Crowd Sensing

With the rapid development of mobile Internet,convenient and intelligent mobile devices have been rapidly developed and popularized.People use smart devices to exchange and transmit information more and more frequently,instead of becoming mobile nodes in traditional networks.In this context,the sense of group wisdom came into being.Crowd sensing is an emerging Internet of Things perception model characterized by “people-centric”,enabling data perception and computing.Throughout the process,people are both producers of the entire data and consumers of the data.However,with the gradual complexity of crowd sensing applications,first of all,large-scale data tasks are faced in data collection,and nodes are difficult to manage.Secondly,the mobile nodes in the group intelligence perception are the basic sensing units,which are responsible for completing the specific sensing tasks,but these mobile nodes have limited capabilities,including limited energy and insufficient buffer space.Then,the user who has a large number of redundant users in the local area continuously performs the sensing activity of the data,which consumes the energy of the network,causes the network to be congested,and causes the delivery rateo of the network to be low,and the network overhead is large.In order to solve the above problems,based on the research of existing perceptual network node partitioning,combined with the relevant technical principle of network node partitioning,the network is divided by regular hexagonal nodes,then clustered,the optimal cluster head node is selected,and efficient congestion is used between nodes.The control strategy reduces the transmission energy consumption of data in the entire network and improves the transmission efficiency of the entire network.The paper has mainly achieved the following research results:First,the existing crowd sensing is limited by the capacity of the mobile node and the network.As the number of nodes increases,the energy consumption of the data transmission of the network increases geometrically.For these reasons,the energy consumption of the network is too fast and the performance is degraded.In order to solve this problem,using the hexagonal network node partitioning strategy,the network is divided into regions by virtual grid tools,each mobile node is located to ensure communication in each region,and compared with the traditional quadrilateral node partitioning strategy,which can effectively reduce.The energy consumption of data transmission between nodes is more stable in terms of network connectivity.Finally,theoretical analysis shows that the use of regular hexagonal node division can effectively reduce the energy consumption of the entire network.Second,in order to fully utilize the capabilities of the nodes within the limited resource consumption,the performance of the network is drastically reduced due to the increase of the number of nodes in the network.According to the relationship between nodes and nodes,combined with the partitioning strategy of the regular hexagonal network nodes,a An optimal cluster preferred extraction mechanism based on a regular hexagon.The mechanism select the optimal cluster head node by taking the distance from the center coordinates of the cluster and the energy of each cluster in each cluster.Each node in the cluster uses a more efficient congestion control strategy as the data transmission mode between the cluster heads,thereby reducing the network overhead in the traditional routing and improving the transmission success rate of the network.The simulation results show that the algorithm can reduce the network overhead in routing and improve the network delivery success rate.Third,There are a large number of redundant users in the crowd sensing to continuously collect data,resulting in a large number of data copies in the network nodes,causing network congestion,increasing network overhead,and thus degrading network performance.Therefore,this paper proposes a new cache discarding strategy.The strategy calculates the activity of the message in the node by calculating the receiving frequency,the cache ratio,and the lifetime of the node type message.When the node's buffer is insufficient to receive the new message,the most active message is discarded.Avoid network congestion and free up cache space.The simulation results show that the proposed strategy can effectively improve the network delivery success rate and reduce the routing cost of the entire network under the premise of ensuring the network lifetime.