检索结果-南通市图书馆

2012 International Conference on Computer Networks and Communication Systems(CNCS 2012)

作者： Yaser Khamayseh Wail Mardini Anas Shatnawi Computer Science Department Faculty of Computer and Information Technology Jordan University of Science and TechnologyIrbid 22110 Jordan

An emerging problem in wireless sensors network is the need to increase the network life *** a network with two power modes,this goal can be achieved by choosing the minimum number of sensors that have high power mode （long range radio） in the service *** vertex cover assist in organizing clusters and determine the cluster head to save power and ensure that all sensors in the network are accessible by the cluster heads,The minimum （optimal） number of vertices （sensors） problem is ***,a near-optimal solution to the problem can be obtained by an approximation algorithm that solves the problem in polynomial *** this paper,we propose a new algorithm for minimizing the number of node that represents the wireless sensor with high transition power,thus we minimize the power consumption of the wireless sensor network and prolong the network life time.

关键词： Sensor Networks vertex cover problem Approximation Algorithms

来源： cnki会议评论

在线全文

cnki会议

学校读者我要写书评

暂无评论

A Heuristic Approach to Fast NOVCA （Near Optimal vertex cover Algorithm）

引用

Computer Technology and Application 2014年第2期5卷 83-90页

作者： Sanj aya Gajurel Roger Bielefeld ITS Advanced Research Computing CWR U Cleveland 44106 USA

This paper describes an extremely fast polynomial time algorithm, the NOVCA （Near Optimal vertex cover Algorithm） that produces an optimal or near optimal vertex cover for any known undirected graph G （V, E）. NOVCA is based on the idea of（l） including the vertex having maximum degree in the vertex cover and （2） rendering the degree of a vertex to zero by including all its adjacent vertices. The three versions of algorithm, NOVCA-I, NOVCA-II, and NOVCA-random, have been developed. The results identifying bounds on the size of the minimum vertex cover as well as polynomial complexity of algorithm are given with experimental verification. Future research efforts will be directed at tuning the algorithm and providing proof for better approximation ratio with NOVCA compared to any available vertex cover algorithms.

关键词： vertex cover problem combinatorial problem NP-complete problem approximation algorithm optimization algorithms.

来源：

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

欢迎您,

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

请选择保存的检索档案：

请选择收藏分类：

通借通还

欢迎您,

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：