Deterministic Greedy Routing with Guaranteed Delivery in 3D Wireless Sensor Networks

Greedy Forwarding for Wireless Sensor Networks with Guaranteed Delivery

The topology of a remote sensor system changes as a few sensors come up short on force, fall flat or Join the system; which might bring about loss of information or the velocity of exchange of information backs off. This issue is solved using Greedy Algorithm and the Hop Count Reduction (HCR) plan is used as a short-listening so as to slice procedure to decrease the steering bounces to the neig...

a new greedy geographical routing in wireless sensor networks

wireless sensor network includes a large number of nodes which are distributed in a geographical location. the essential fact about wsn is that energy of nodes is limited. therefore, presenting proper solutions as an optimized routing is crucial to equally use energy of all nodes. in this paper we propose a method which performs routing in wsns using greedy approach. it is able to choose optimu...

Energy efficient routing with guaranteed delivery in wireless sensor networks

High delivery ratio with low energy consumption is one of design challenges for wireless sensor network routing protocols. In this paper, we identify the drawbacks of pure single path routing scheme and multi -path routing scheme, in terms of guaranteed delivery with low energy consumption. Accordingly, we describe a scheme, in which data is forwarded along a pre-established single path to save...

Routing with Guaranteed Delivery in ad ho Wireless Networks

Routing with guaranteed delivery in geometric and wireless networks

In this paper we study on-line local routing algorithms for communication networks. Our algorithms take advantage of the geometric properties of planar networks. We pay special attention to on-line local routing algorithms which guarantee that a message reaches its destination. A message cosists of packets of data that have to be sent to a destination node, i.e. the message itself plus a finite...