Study On The Annular Routing Algorithm Based On Mobile Agent

As the wireless sensor network is formed of nodes that data is transmitted throughthem, this will cause the low data transmission efficiency. Moreover the complexityand dynamic changing of the network will increase data transmission difficulties. Inorder to improve the quality of data transmission in reality, there are manycommunication paths to achieve the purpose of the more number of links the bettertransmission quality. However, the finite resources of nodes demand routing algorithmshould complete the transmission of data by using low energy consumption, small timedelay and high quality of communication. At the same time, it also requires balancingthe energy and prolonging the lifetime of the network. Because the mobile agent isintelligent and can judge environment independently, combining mobile agent androuting algorithm can solve many problems of networks. We put forward an annularrouting algorithm based on mobile agent. By using this model, we deduce an energybalanced ring routing algorithm based on mobile agent (EBRRMA) and an energybalanced spiral routing algorithm based on mobile agent (EBSRMA). This paper’smain research contents are followed:1. Construction the annular network model based on mobile agent. In the network,sink node is located in the center and the member nodes are evenly distributed aroundit. According to the characteristics that each node has the same communicationdistance, we divide the network into multiple concentric rings that sink node stands inthe center and the radius is the integer multiple of node’s communication distance.Then we choose the hop count as the reference standard and give each ring a minimumhop to establish a minimum hop annular network based on mobile agent.2. We put forward an energy balanced ring routing algorithm based on mobileagent. In the algorithm, each gradient ring has a mobile agent which is sent by sinknode. Every mobile agent parades in the way of minimum time delay, first visitingneighbor and recording the migration path with fusing the data. Then MA finds themost energy node in the gradient ring and sends the fusion data back to sink node byusing the link of the most energy node. Finally, mobile agent will sleep in the mostenergy node in the ring and wait for natural waking up or event waking up.3. We put forward an energy balanced spiral routing algorithm based on mobile agent. In this algorithm, the network only has a mobile agent and this MA moves to theoutermost loop according to the gradient value of each ring. Then MA migrates basedon minimum time delay strategy and priority visiting the outer loop strategy, andaccomplishes the spiral routing with fusing data by the way of visiting neighbor,marking trace and finding source. Finally, mobile agent will take the fusion data backto sink node.4. Simulating and comparing EBRRMA algorithm, EBSRMA algorithm and DDalgorithm. The experiment shows that EBRRMA algorithm and EBSRMA algorithmare better than DD algorithm at network’s hops, network’s energy consumption,network’s time delay and the rate of data collection. Nevertheless EBRRMA algorithmwill use much less time delay and when the fusion ratio is relatively large, EBSRMAalgorithm is more outstanding at energy balance and data collection.