Copy limited flooding over opportunistic networks
المؤلف | Niu, Jianwei |
المؤلف | Mingzhu Liu |
المؤلف | Lei Shu |
المؤلف | Guizani, Mohsen |
تاريخ الإتاحة | 2022-11-10T09:47:29Z |
تاريخ النشر | 2013 |
اسم المنشور | IEEE Wireless Communications and Networking Conference, WCNC |
المصدر | Scopus |
المصدر | 2-s2.0-84881570031 |
الملخص | Mobile devices with local wireless interfaces can be organized into opportunistic networks which exploit communication opportunities arising from the movement of their users. With the proliferation and increasing capabilities of these devices, it is significant to investigate message dissemination over opportunistic networks to maximize the potential of those networks. In this paper, we analyze the performance of copy-limited flooding over opportunistic networks, where each node can only send no more than k copies of the same message. For this purpose, we propose a network model called Markov and Random graph Hierarchic Model (MRHM), where a node transfers among different Main-areas (places frequently visited by nodes) according to the Markov rule, and two different nodes in the same Main-area can establish a connection with a certain probability. We theoretically analyze the performance of k-copy limited flooding over MRHM in terms of delivery rate and delay. Our extensive experiments over MRHM and real traces reveal that when k equals 3, the performance of k-copy limited flooding is very close to that of Epidemic Routing. 2013 IEEE. |
راعي المشروع | This work was supported by the National Natural Science Foundation of China ( 61170296 , 61572060 and 61190125 ), and the R&D Program ( 2013BAH35F01 ). |
اللغة | en |
الموضوع | copy limited flooding message dissemination network model Opportunistic network |
النوع | Conference Paper |
الصفحات | 1785-1790 |
الملفات في هذه التسجيلة
الملفات | الحجم | الصيغة | العرض |
---|---|---|---|
لا توجد ملفات لها صلة بهذه التسجيلة. |
هذه التسجيلة تظهر في المجموعات التالية
-
علوم وهندسة الحاسب [2284 items ]