با سلام خدمت کاربران در صورتی که با خطای سیستم پرداخت بانکی مواجه شدید از طریق کارت به کارت (6037997535328901 بانک ملی ناصر خنجری ) مقاله خود را دریافت کنید (تا مشکل رفع گردد).
دسته بندی:
داده های بزرگ - big data
سال انتشار:
2020
عنوان انگلیسی مقاله:
Adaptive data and verified message disjoint security routing for gathering big data in energy harvesting networks
ترجمه فارسی عنوان مقاله:
داده تطبیقی و تایید امنیت پیام متلاشی شدن مسیریابی برای جمع آوری داده های بزرگ در شبکه های برداشت انرژی
منبع:
Sciencedirect - Elsevier - Journal of Parallel and Distributed Computing, 135 (2020) 140-155: doi:10:1016/j:jpdc:2019:08:012
نویسنده:
Xiao Liu a, Anfeng Liu a, Tian Wangb, Kaoru Ota c, Mianxiong Dong c, Yuxin Liu a,∗, Zhiping Cai
چکیده انگلیسی:
To improve the data arrival ratio and the transmission delay and considering that the capacity for
determining malicious nodes and energy are limited, a security disjoint routing-based verified message
(SDRVM) scheme is proposed. The main contributions of SDRVM are as follows: (a) two connected
dominating sets (a data CDS and a v-message CDS) are created for disseminating data and verified
messages (v-messages), respectively, based on the remaining energy of nodes. (b) Nodes record the
ID information in data packets with a specified probability, namely, the marking probability, which is
adjusted according to the remaining energy of the nodes. (c) The duty cycle of the nodes is adjusted,
and the energy of the nodes is divided into three levels. In the data CDS, the duty cycle of the sensor
nodes is the longest and the duty cycle of the nodes that do not belong to either of the CDSs is
the shortest. (d) If the energy of the sensor nodes is sufficient, data packets are transmitted several
times and the v-messages that are stored in the nodes are transmitted to the destination nodes. The
proposed scheme has been evaluated using different parameters where the results obtained prove its
effectiveness in comparison to the existing solutions.
Keywords: Energy harvesting networks | Security | Disjoint routing | Marking probability | Network lifetime
قیمت: رایگان
توضیحات اضافی:
تعداد نظرات : 0