کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
4968189 1449519 2017 37 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
A systematic approach to constructing incremental topology control algorithms using graph transformation
ترجمه فارسی عنوان
رویکرد سیستماتیک برای ساخت الگوریتم های کنترل توپولوژی افزایشی با استفاده از تبدیل گراف
کلمات کلیدی
مدل سازی مهندسی نرم افزار، تبدیل گراف، محدودیت گراف، کنترل توپولوژی، تجزیه و تحلیل استاتیک، درست با ساخت،
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر نرم افزارهای علوم کامپیوتر
چکیده انگلیسی

Communication networks form the backbone of our society. Topology control algorithms optimize the topology of such communication networks. Due to the importance of communication networks, a topology control algorithm should guarantee certain required consistency properties (e.g., connectivity of the topology), while achieving desired optimization properties (e.g., a bounded number of neighbors). Real-world topologies are dynamic (e.g., because nodes join, leave, or move within the network), which requires topology control algorithms to operate in an incremental way, i.e., based on the recently introduced modifications of a topology. Visual programming and specification languages are a proven means for specifying the structure as well as consistency and optimization properties of topologies. In this paper, we present a novel methodology, based on a visual graph transformation and graph constraint language, for developing incremental topology control algorithms that are guaranteed to fulfill a set of specified consistency and optimization constraints. More specifically, we model the possible modifications of a topology control algorithm and the environment using graph transformation rules, and we describe consistency and optimization properties using graph constraints. On this basis, we apply and extend a well-known constructive approach to derive refined graph transformation rules that preserve these graph constraints. We apply our methodology to re-engineer an established topology control algorithm, kTC, and evaluate it in a network simulation study to show the practical applicability of our approach.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Journal of Visual Languages & Computing - Volume 38, February 2017, Pages 47-83
نویسندگان
, , , , , ,