楼主: 可人4
275 0

[计算机科学] 1-覆盖蕴涵连通性的一个新的充分条件 [推广有奖]

  • 0关注
  • 2粉丝

会员

学术权威

76%

还不是VIP/贵宾

-

威望
10
论坛币
15 个
通用积分
49.0443
学术水平
0 点
热心指数
1 点
信用等级
0 点
经验
24465 点
帖子
4070
精华
0
在线时间
0 小时
注册时间
2022-2-24
最后登录
2022-4-15

楼主
可人4 在职认证  发表于 2022-3-8 19:42:40 来自手机 |AI写论文

+2 论坛币
k人 参与回答

经管之家送您一份

应届毕业生专属福利!

求职就业群
赵安豆老师微信:zhaoandou666

经管之家联合CDA

送您一个全额奖学金名额~ !

感谢您参与论坛问题回答

经管之家送您两个论坛币!

+2 论坛币
摘要翻译:
无线传感器网络节能的一个有效方法是调度外部节点的睡眠间隔,而剩余节点保持活动状态,以提供持续的服务。为了使传感器网络成功运行,主动节点必须同时保持感知覆盖和网络连通性,以前的研究证明,如果节点的通信范围至少是感知范围的两倍,凸区域的完全覆盖意味着节点工作集之间的连通性。本文考虑一个矩形区域a=a*b,使得R a R b s s{磅},{磅},其中s R是节点的感知范围。并对节点间的最小允许距离进行约束。根据这一约束,我们提出了一个新的通信范围相对于传感器感知范围的下界(S2+3*R),即考虑区域的完全覆盖意味着节点工作集之间的连通性;同时提出了一种新的满足约束的分配方法。
---
英文标题:
《A New Sufficient Condition for 1-Coverage to Imply Connectivity》
---
作者:
Seyed Hossein Khasteh, Saeid Bagheri Shouraki, and Ali Akbar Kiaei
---
最新提交年份:
2010
---
分类信息:

一级分类:Computer Science        计算机科学
二级分类:Artificial Intelligence        人工智能
分类描述:Covers all areas of AI except Vision, Robotics, Machine Learning, Multiagent Systems, and Computation and Language (Natural Language Processing), which have separate subject areas. In particular, includes Expert Systems, Theorem Proving (although this may overlap with Logic in Computer Science), Knowledge Representation, Planning, and Uncertainty in AI. Roughly includes material in ACM Subject Classes I.2.0, I.2.1, I.2.3, I.2.4, I.2.8, and I.2.11.
涵盖了人工智能的所有领域,除了视觉、机器人、机器学习、多智能体系统以及计算和语言(自然语言处理),这些领域有独立的学科领域。特别地,包括专家系统,定理证明(尽管这可能与计算机科学中的逻辑重叠),知识表示,规划,和人工智能中的不确定性。大致包括ACM学科类I.2.0、I.2.1、I.2.3、I.2.4、I.2.8和I.2.11中的材料。
--

---
英文摘要:
  An effective approach for energy conservation in wireless sensor networks is scheduling sleep intervals for extraneous nodes while the remaining nodes stay active to provide continuous service. For the sensor network to operate successfully the active nodes must maintain both sensing coverage and network connectivity, It proved before if the communication range of nodes is at least twice the sensing range, complete coverage of a convex area implies connectivity among the working set of nodes. In this paper we consider a rectangular region A = a *b, such that R a R b s s {\pounds}, {\pounds}, where s R is the sensing range of nodes. and put a constraint on minimum allowed distance between nodes(s). according to this constraint we present a new lower bound for communication range relative to sensing range of sensors(s 2 + 3 *R) that complete coverage of considered area implies connectivity among the working set of nodes; also we present a new distribution method, that satisfy our constraint.
---
PDF链接:
https://arxiv.org/pdf/1011.1662
二维码

扫码加我 拉你入群

请注明:姓名-公司-职位

以便审核进群资格,未注明则拒绝

关键词:connectivity Successfully distribution Intelligence Presentation 进行 network 意味着 连通性 complete

您需要登录后才可以回帖 登录 | 我要注册

本版微信群
jg-xs1
拉您进交流群
GMT+8, 2025-12-31 16:15