A novel local search approximation algorithm for relay node placement in Wireless Sensor Networks
文献类型：会议论文
| 作者 | Ma CF(马超凡) ; Liang W(梁炜); Zheng M(郑萌); Sharif, Hamid
|
| 出版日期 | 2015 |
| 会议名称 | 2015 IEEE Wireless Communications and Networking Conference, WCNC 2015 |
| 会议日期 | March 9-12, 2015 |
| 会议地点 | New Orleans, LA, United states |
| 页码 | 1518-1523 |
| 中文摘要 | In two-tiered Wireless Sensor Networks (WSNs) relay node placement considering resource constraints and high overhead of the relay nodes plays a key role in extending the network lifetime. Therefore, approaches that support fewer relay nodes are desired to cover the WSNs. In this paper, we formulate the relay node placement problem as a Geometric Disc Covering (GDC) problem, and propose a novel local search approximation algorithm (LSAA) to solve the GDC problem. In the proposed LSAA, the sensor nodes are allocated into independent groups and then a Set Cover (SC) for each group is performed. The set of the SC for each group constitutes a SC of the GDC problem. LSAA is extensively investigated and analyzed by rigorous proof and the simulation results presented in this paper clearly demonstrate that the proposed LSAA outperform the approaches reported in literature in the reduction in deployed relay nodes. |
| 收录类别 | EI ; CPCI（ISTP） |
| 产权排序 | 1 |
| 会议录 | 2015 IEEE Wireless Communications and Networking Conference, WCNC 2015
 |
| 会议录出版者 | IEEE |
| 会议录出版地 | Piscataway, NJ, USA |
| 语种 | 英语 |
| ISBN号 | 978-1-4799-8406-0 |
| WOS记录号 | WOS:000380909600259 |
| 源URL | [http://ir.sia.cn/handle/173321/16865]  |
| 专题 | 沈阳自动化研究所_工业控制网络与系统研究室 |
| 推荐引用方式 GB/T 7714 | Ma CF,Liang W,Zheng M,et al. A novel local search approximation algorithm for relay node placement in Wireless Sensor Networks[C]. 见:2015 IEEE Wireless Communications and Networking Conference, WCNC 2015. New Orleans, LA, United states. March 9-12, 2015. |
入库方式： OAI收割
来源：沈阳自动化研究所
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。