K-connectivity in shadowing wireless multi-hop networks

In this paper, we study the network performance of a wireless multi-hop network in terms of the successful link probability and k-connectivity probability by taking into account shadowing. We provide the closed-form analytic results of the successful link probability, and henceforth k-connectivity,...

وصف كامل

محفوظ في:
التفاصيل البيبلوغرافية
المؤلفون الرئيسيون: Zhang, Lili, Soong, Boon Hee
مؤلفون آخرون: School of Electrical and Electronic Engineering
التنسيق: Conference or Workshop Item
اللغة:English
منشور في: 2011
الموضوعات:
الوصول للمادة أونلاين:https://hdl.handle.net/10356/94351
http://hdl.handle.net/10220/7147
الوسوم: إضافة وسم
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
الوصف
الملخص:In this paper, we study the network performance of a wireless multi-hop network in terms of the successful link probability and k-connectivity probability by taking into account shadowing. We provide the closed-form analytic results of the successful link probability, and henceforth k-connectivity, in the context of shadowing multi-hop networks. Given a certain number of nodes spatially distributed according to a Poisson point process, we examine the critical density to keep the probability that a node is k-connected close to 1. The impacts of the shadowing on the k-connectivity are illustrated and discussed. The results can be practically used for the design of a wireless multi-hop network.