کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
457527 | 695943 | 2010 | 14 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
A clique base node scheduling method for wireless sensor networks
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
شبکه های کامپیوتری و ارتباطات
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: A clique base node scheduling method for wireless sensor networks A clique base node scheduling method for wireless sensor networks](/preview/png/457527.png)
چکیده انگلیسی
This paper considers the node scheduling problem for m -covered and connected sensor networks. A new concept of Clique is proposed in this paper. Based on that concept, a new distributed node scheduling algorithm is designed, which can allocate all nodes in the sensor network into k(k≤m)k(k≤m) different groups {0,1,…,k−1} without requiring location information. At the same time, it can guarantee that each group will be still connected and maintain the coverage ratio as high as possible. Theoretical analysis and simulation results show that the newly proposed algorithm has better performance than previous randomized scheduling scheme proposed in Liu et al. (2006), and can prolong the lifetime of the sensor network effectively.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Journal of Network and Computer Applications - Volume 33, Issue 4, July 2010, Pages 383–396
Journal: Journal of Network and Computer Applications - Volume 33, Issue 4, July 2010, Pages 383–396
نویسندگان
Lei Wang, Ruizhong Wei, Yaping Lin, Bo Wang,