- 1、本文档共3页,可阅读全部内容。
- 2、有哪些信誉好的足球投注网站(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。
- 3、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载。
- 4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
- 5、该文档为VIP文档,如果想要下载,成为VIP会员后,下载免费。
- 6、成为VIP后,下载本文档将扣除1次下载权益。下载后,不支持退款、换文档。如有疑问请联系我们。
- 7、成为VIP后,您将拥有八大权益,权益包括:VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
- 8、VIP文档为合作方或网友上传,每下载1次, 网站将根据用户上传文档的质量评分、类型等,对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档
查看更多
real-timetemperaturemonitoringofshellfishcatchesusingawirelesssensornetwork
HYPERLINK /science?_ob=ArticleURL_udi=B6WKJ-4HSY4SY-1_user=10_coverDate=04%2F30%2F2006_alid=1613114292_rdoc=146_fmt=high_orig=search_origin=search_zone=rslt_list_item_cdi=6908_sort=r_st=5_docanchor=view=c_ct=6613_acct=C000050221_version=1_urlVersion=0_userid=10md5=15d5e89d54fba6aaa0dde912822f34c8searchtype=a approximation algorithms and PTASs for various problems in wireless ad hoc networks??Original Research ArticleJournal of Parallel and Distributed Computing
wireless ad hoc network is often composed of a set V of n wireless devices distributed in a two-dimensional domain. For each wireless device (also called node) uV, there is a transmission region within which signal-to-noise-ratio (SNR) is at least a threshold γ so that the signal transmitted by u can be correctly received by other nodes with high probability. The transmission region is often modeled as a disk centered at the node u. In addition, for each node u, there is an interference region within which the transmission from u makes the signal-to-interference-and-noise-ratio (SINR) of the legitimate receiver smaller than the threshold γ so that the legitimate receiver cannot correctly receive the message from the legitimate transmitter.
In this paper, we first present new graph models to model the communication graphs and the interference graphs defined by wireless ad hoc networks with attention to interference-free channel assignment or scheduling. Then we propose some simple approximation algorithms and/or PTASs (polynomial time approximation scheme) to approximate several classical graph problems such as maximum independent set, minimum vertex cover and minimum vertex coloring in these graph models. In addition, we also discuss various possible applications for these simple approximation algorithms and/or PTASs in wireless ad hoc networks.
HYPERLINK /science?_ob=ArticleURL_udi=B7GWW-4VKMWDK-1_user=10_coverDate=02%2F28%2F2010_alid=1613114292_rdoc=147_fmt=high_orig=search_origin=search_zone=rslt_l
您可能关注的文档
最近下载
- 居住区规划设计.ppt
- 《汤姆 · 索亚历险记》阅读测试题及答案 .docx VIP
- 小升初阅读技巧剖析——+文言文阅读(课件)-部编版语文六年级下册.pptx VIP
- HG_T 3731-2023 非金属化工设备 玻璃纤维增强聚氯乙烯复合管和管件.docx VIP
- 小学科学六年级下册全册 .pdf VIP
- 《世说新语系列》课件.pptx VIP
- 工程项目居间合同协议.docx VIP
- Unit 2 No Rules, No Order复习课件P2-人教版七下英语2024.pptx VIP
- EPSON,爱普生EPSON SC POS Application Programming Guide说明书用户手册.pdf
- 2024-2025学年北京海淀区四年级(上)期末英语试卷.pdf
文档评论(0)