Research on weak greedy routing over graph embedding for wireless sensor networks

Research on weak greedy routing over graph embedding for wireless sensor networks

The greedy routing in sensor networks can be classified into two categories,strong greedy routing and weak greedy routing.The weak greedy routing protocol needs geographic location and strong greedy routing needs greedy em-bedding network.In order to solve these problems and minimize operation compl...

Full description

Saved in:
Bibliographic Details
Main Authors: LI Zhi-gang1, CHEN Wei-wei1, XIAO Nong2, XIA Ge-ming2
Format: Article
Language:zho
Published: Editorial Department of Journal on Communications 2011-01-01
Series:Tongxin xuebao
Subjects:
sensor networks
greedy routing
network embedding
load balance
data storage
Online Access:http://www.joconline.com.cn/zh/article/74412732/
Tags: Add Tag
No Tags, Be the first to tag this record!

Similar Items

Similar Items