Greedy routing life time consideration on Location base routing in wireless sensor Networks Hadi Asharioun 1 , Hassan Asadollahi 2 , Sureswaran Ramadass 3 , Azlan Bin Osman 4 1,3,4 National Advanced IPv6 Centre (Nav6), University Science Malaysia, (hadi, sures,azlan)@nav6.usm.my 2 Department of Computer System and Communication, Faculty of Computer Science and Information, University Technology Malaysia, hasan_asadolahi@yahoo.com Abstract. Life time issue is a one of the most interested open issues in wireless sensor networks. Increasing life time is very important in WSNs and because of energy limitation the sensors will die and the networks cannot sense. value of different network topology lifetime are important for researchers to comparison their results.. In this paper we calculate the life time of the network base on greedy routing in localized routing. Key words: Greedy Routing; life time; sensor networks 1. Introduction Wireless sensor network/ad hoc is a collection of wireless devices distributed over a geographic region. Each sensor device is equipped with an omnidirectional antenna. A communication session is established either through a single hop radio transmission if the communication party is close enough, or through relaying by intermediate devices otherwise. The selection of intermediate relay nodes is determined by routing algorithms. Greedy forward routing (abbreviated by GFR) is one of the localized geographic routing algorithms proposed in literature. In GFR, one node discards a packet if none of its neighbours is closer to the destination of the packet than itself, or otherwise forwards the packet to the neighbor closest to the destination. Therefore, each packet should contain the location of its destination, and each node only needs to maintain the locations of its one-hop neighbors. GFR can be implemented in a localized and memory less manner. There are some variations of GFR. For example, in [1] and [2], the shortest projected distance to the destination on the straight line joining the current node and the destination node is considered as the greedy metrics. In [1] , packets are allowed to be sent backward if there is no forwarding neighbor. In [2], only nodes whose Voronoi cells intersect with the source destination line segment are eligible for being relay nodes. Here the Voronoi cell of a node is the set of points in the plane that are closer to the node than to any other node [3]. The analytic work of GFR can be dated back to 1984 by Takagi and Kleinrock [1]. They studied the optimal transmission radius to maximize the expected progress of packets based on most forward and least backward routing strategy in which every node delivers each packet to the neighbor (not including itself) with the shortest projected distance to the destination on the straight line joining the current node. However, the deliverability of packets is not considered. Recently, Xing et al. [2] (2004) show that in a fully covered homogeneous wireless sensor network, if the transmission radius is larger than 2 times of the sensing radius, the deliverability can be guaranteed between any source-destination pair by greedy forwarding schemes in which a packet is sent to the neighbour either with the shortest Euclidean distance to the destination [4, 5] or with the shortest projected distance to the destination on the straight line joining the current node and the destination node [1] and by bounded Voronoi greedy forwarding scheme in which only those nodes whose Voronoi cells intersect with the line segment between the source and destination are eligible to relay the packet. Another related and interesting problem in literature is the longest edge of connected geometric graphs. Penrose [6] (1997) [7] (1999) studied the longest edge of a minimal spanning tree which is corresponding to the critical transmission radius for connectivity in random geometric graphs. Later, by applying the percolation theory, Gupta and Kumar [8] had similar results for wireless networks. 2012 International Conference on Information and Computer Networks (ICICN 2012) IPCSIT vol. 27 (2012) © (2012) IACSIT Press, Singapore 129