QQ客服 官方微博 反馈留言

	Minimum average routing path clustering problem in multi-hop 2-D underwater sensor networks
	Kim, Donghyun; Wang, Wei; Ding, Ling; Lim, Jihwan; Oh, Heekuck; Wu, Weili
刊名	OPTIMIZATION LETTERS
	2010
卷号	4期号:3页码:383-392
关键词	Approximation algorithm Graph theory Underwater sensor networks Wireless network clustering
ISSN号	1862-4472
DOI	10.1007/s11590-009-0168-z
URL标识	查看原文
WOS记录号	WOS:000279632700007
内容类型	期刊论文
URI标识	http://www.corc.org.cn/handle/1471x/4814018
专题	西安交通大学
推荐引用方式 GB/T 7714	Kim, Donghyun,Wang, Wei,Ding, Ling,et al. Minimum average routing path clustering problem in multi-hop 2-D underwater sensor networks[J]. OPTIMIZATION LETTERS,2010,4(3):383-392.
APA	Kim, Donghyun,Wang, Wei,Ding, Ling,Lim, Jihwan,Oh, Heekuck,&Wu, Weili.(2010).Minimum average routing path clustering problem in multi-hop 2-D underwater sensor networks.OPTIMIZATION LETTERS,4(3),383-392.
MLA	Kim, Donghyun,et al."Minimum average routing path clustering problem in multi-hop 2-D underwater sensor networks".OPTIMIZATION LETTERS 4.3(2010):383-392.

个性服务

查看访问统计

相关权益政策

暂无数据

收藏/分享

除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。