A Performance Bound of Mu1ti-hop Mu1ti-Relay Wireless Communication Systems with Optimal Path Selection | Zendy

Kamol Almuradov | Zendy; JinBae Park | Zendy; YunHee Kim | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

A Performance Bound of Mu1ti-hop Mu1ti-Relay Wireless Communication Systems with Optimal Path Selection

Author(s) -

Kamol Almuradov,

JinBae Park,

YunHee Kim

Publication year - 2011

Publication title -

the journal of korean institute of communications and information sciences

Language(s) - English

Resource type - Journals

eISSN - 2287-3880

pISSN - 1226-4717

DOI - 10.7840/kics.2011.36c.1.1

Subject(s) - relay , nakagami distribution , fading , hop (telecommunications) , upper and lower bounds , path loss , path (computing) , wireless , topology (electrical circuits) , selection (genetic algorithm) , mathematics , computer science , moment generating function , telecommunications , algorithm , mathematical optimization , computer network , statistics , power (physics) , probability density function , combinatorics , physics , decoding methods , mathematical analysis , quantum mechanics , artificial intelligence

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research