Distributed computation of virtual coordinates for greedy routing in sensor networks

Mirela Ben Chen, Steven J. Gortler, Craig Gotsman, Camille Wormser

نتاج البحث: نشر في مجلةمقالةمراجعة النظراء

ملخص

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 protocolone 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.

اللغة الأصليةالإنجليزيّة
الصفحات (من إلى)544-560
عدد الصفحات17
دوريةDiscrete Applied Mathematics
مستوى الصوت159
رقم الإصدار7
المعرِّفات الرقمية للأشياء
حالة النشرنُشِر - 6 أبريل 2011

All Science Journal Classification (ASJC) codes

  • !!Discrete Mathematics and Combinatorics
  • !!Applied Mathematics

بصمة

أدرس بدقة موضوعات البحث “Distributed computation of virtual coordinates for greedy routing in sensor networks'. فهما يشكلان معًا بصمة فريدة.

قم بذكر هذا