检索结果-南通市图书馆

Novel load balancing DHT scheme for the heterogeneous system

Journal of Systems Engineering and Electronics 2008年第4期19卷 835-842页

作者： li yujun lu xianliang hou mengshu School of Computer Science and Engineering Univ. of Electronics Science and Technology of China Chengdu 610054 P. R. China

The capacities of the nodes in the peer-to-peer system are strongly heterogeneous, hence one can benefit from distributing the load, based on the capacity of the nodes. At first a model is discussed to evaluate the load balancing of the heterogeneous system, and then a novel load balancing scheme is proposed based on the concept of logical servers and the randomized binary tree, and theoretical guarantees are given. Finally, the feasibility of the scheme using extensive simulations is proven.

关键词： distributed hash table heterogeneity randomized binary tree load balancing

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

Deliverability analysis of greedy routing in the spherical cap 3D sensor networks

引用

Science China(Information Sciences) 2013年第7期56卷 52-63页

作者： hou mengshu YANG Yaling li yujun School of Computer Science and Engineering University of Electronic Science and Technology of China Department of Electrical and Computer Engineering Virginia Polytechnic Institute and State University

For 3D sensor networks to monitor the ocean, forest and aerosphere, etc., sensors can forward their data to the base station by greedy routing. It is critical to quantitatively greedy routing’s deliverability for evaluating network’s functionality and performance. The probability that all sensors can successfully send their data to the base station by greedy routing is usually modeled as the probability of guaranteed delivery. For a typical spherical cap 3D sensor network deployment scenario where nodes follow a homogeneous Poisson point process, the relationship between the sensor transmission radius and the probability of guaranteed delivery is studied, and a tight analytical upper bound on the sensor transmission radius to ensure the designed deliverability probability is derived in this paper. The correctness and tightness of the derived upper bound are verified by extensive simulations.

关键词： 3D sensor network greedy routing deliverability probability critical transmission radius

来源：

同方期刊数据库评论

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

欢迎您,

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

请选择保存的检索档案：

请选择收藏分类：

通借通还

欢迎您,

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：