Weak Greedy Routing over Graph Embedding for Wireless Sensor Networks | Zendy

Zhigang Li | Zendy; g Xiao | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Weak Greedy Routing over Graph Embedding for Wireless Sensor Networks

Author(s) -

Zhigang Li,

g Xiao

Publication year - 2010

Publication title -

wireless sensor network

Language(s) - English

Resource type - Journals

eISSN - 1945-3086

pISSN - 1945-3078

DOI - 10.4236/wsn.2010.29082

Subject(s) - computer science , greedy algorithm , embedding , geographic routing , static routing , computer network , link state routing protocol , multipath routing , distributed computing , dynamic source routing , routing (electronic design automation) , routing protocol , algorithm , artificial intelligence

In this paper we classify the greedy routing in sensor networks into two categories, strong greedy routing and weak greedy routing. Most existing work mainly focuses on weak greedy routing over geographic location network or strong greedy routing over greedy embedding network. It is a difficult job and needs much cost to obtain geographic location or greedy embedding of the network. We propose a light-weight Tree-based graph embedding (TGE) for sensor networks. Over the TGE, we design a weak greedy routing protocol, TGR. TGR can archive good performance on path stretch factor and load balance factor

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research