Improvement of Data Distribution in LGossiping with Choosing the Next Hop According to Its Chance

Wireless sensors networks (WSN´s) have a lot of ability for spreading in the areas where wired networks can´t operate correctly and old versions of wireless networks aren´t useful. WSN´s consist of many sensors that place in an unavailable area. The method of routing to transform information from sensor nodes to the Base station is very important and one of the main needs of WSN is the best method of energy consumption because using battery power in sensor devices. In this paper we have produced a routing algorithm with determining the optimum consumption of energy for sending information form sensor nodes to Base station with multi hopping data sending. In this algorithm when a sensor senses an event, it gives an amount of chance to the neighbor sensors (sensors which have the distance of sending data). This chance depends on their distance from Base station and the remaining energy of the sensors. Then on the basis this chance one of the sensors will be chosen randomly. The sensor which has the more amount of chance will get the more probability of being chosen and that sensor in the only one to get the data. At last we will compare our presented algorithm with Gossiping and LGossiping algorithm. The result of the simulation shows the better function of the presented algorithm.