检索结果-南通市图书馆

LB-AGR: level-based adaptive geo-routing for underwater sensor network

The Journal of China Universities of Posts and Telecommunications 2014年第1期21卷 54-59页

作者： DU Xiu-juan HUANG Ke-jun LAN Sheng-lin FENG Zhen-xing LIU Fan School of Computer Science Qinghai Normal University Network Information Center Qinghai Normal University

Underwater sensor network（UWSN） adopts acoustic communication with more energy-consumption and longer propagation-delay, which bring great challenges to protocol design. In this paper, we proposed level-based adaptive geo-routing（LB-AGR） protocol. LB-AGR divides traffics into four categories, and routes different types of traffic in accordance with different decisions. Packets upstream to the sink are forwarded unicast to the best next-hop instead of broadcasting to all neighbor nodes as in present UWSN routing protocols. LB-AGR defines an integrated forwarding factor for each candidate node based on available energy, density, location, and level-difference between neighbor nodes, which is used to determine the best next-hop among multiple qualified candidates. Through simulation experiments, we show the promising performance of LB-AGR.

关键词： UWSN LB-AGR node level neighbor table

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

Advanced list scheduling heuristic for task scheduling with communication contention for parallel embedded systems

引用

Science China(Information Sciences) 2010年第11期53卷 2272-2286页

作者： NEZAN Jean-Francois RAULET Mickaёl COUSIN Jean-Gabriel IETR/Image and Remote Sensing Group CNRS UMR 6164/INSA Rennes 35043 RENNES Cedex France

Modern embedded systems tend to use multiple cores or processors for processing parallel applications. This paper indeed aims at task scheduling with communication contention for parallel embedded systems and proposes three advanced techniques to improve the list scheduling heuristic. Five groups of node levels (two existing groups and three new groups) are firstly used as node priorities to generate node lists. Then the critical child technique improves the selection of a processor in the scheduling process. Finally, the communication delay technique enlarges the idle time intervals on communication links. We also propose an advanced dynamic list scheduling heuristic by combining the three techniques. Experimental results show that the combined advanced dynamic heuristic is efficient to shorten the schedule length for most of the randomly generated DAGs in the cases of medium and high communication. Our method accelerates an application up to 80% in the case of high communication and can also reduce the use of hardware resources.

关键词： list scheduling communication contention node level critical child communication delay

来源：

同方期刊数据库评论

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

欢迎您,

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

请选择保存的检索档案：

请选择收藏分类：

通借通还

欢迎您,

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：