کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
420102 | 683895 | 2011 | 17 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Distributed computation of virtual coordinates for greedy routing in sensor networks
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
نظریه محاسباتی و ریاضیات
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: Distributed computation of virtual coordinates for greedy routing in sensor networks Distributed computation of virtual coordinates for greedy routing in sensor networks](/preview/png/420102.png)
چکیده انگلیسی
Sensor networks are emerging as a paradigm for future computing, but pose a number of challenges in the fields of networking and distributed computation. One challenge is to devise a greedy routing protocol—one that routes messages through the network using only information available at a node or its neighbors. Modeling the connectivity graph of a sensor network as a 3-connected planar graph, we describe how to compute on the network in a distributed and local manner a special geometric embedding of the graph. This embedding supports a geometric routing protocol called “greedy routing” based on the “virtual” coordinates of the nodes derived from the embedding.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Discrete Applied Mathematics - Volume 159, Issue 7, 6 April 2011, Pages 544–560
Journal: Discrete Applied Mathematics - Volume 159, Issue 7, 6 April 2011, Pages 544–560
نویسندگان
Mirela Ben Chen, Steven J. Gortler, Craig Gotsman, Camille Wormser,