Presenting a New Coverage Algorithm for Three Dimensional WSN
Publish Year: 1390
نوع سند: مقاله کنفرانسی
زبان: English
View: 1,574
This Paper With 6 Page And PDF Format Ready To Download
- Certificate
- من نویسنده این مقاله هستم
استخراج به نرم افزارهای پژوهشی:
شناسه ملی سند علمی:
ICEEE03_130
تاریخ نمایه سازی: 18 مهر 1390
Abstract:
Network coverage is one of the most important factors in wireless sensor networks which has a crucial affect on network functioning. This is performed in all the wireless networks to receive the region information. Clustering is an approach by which network management can be done easier. Thus, this technique can be used for network coverage, as the platform. In this paper we focus on covering the three dimensional wireless sensor networks (3DWSN) based on the platform of our new presented clustering algorithm for such 3D networks; this 3D clustering algorithm uses pyramid shapes to form network clusters. Applying the proposed coverage method leads receiving the region information much more and energy efficiently, especially in the 3D networks. Network full coverage and overlap avoidance are two factors considered by the new method.
Keywords:
Authors
Mohammad Mehrani
department of computer engineering islamic azad universityshoushtar branchShoushtar, Iran
Nima Attarzadeh
department of computer engineering islamic azad universityshoushtar branchShoushtar, Iran
Ali Mojoodi
department of computer engineering islamic azad universitydezful branchDezful, Iran
مراجع و منابع این Paper:
لیست زیر مراجع و منابع استفاده شده در این Paper را نمایش می دهد. این مراجع به صورت کاملا ماشینی و بر اساس هوش مصنوعی استخراج شده اند و لذا ممکن است دارای اشکالاتی باشند که به مرور زمان دقت استخراج این محتوا افزایش می یابد. مراجعی که مقالات مربوط به آنها در سیویلیکا نمایه شده و پیدا شده اند، به خود Paper لینک شده اند :