On The k-hop Partial Connectivity in Finite Wireless Multi-hop Networks
In this paper, we consider wireless multi-hop networks with a finite number of (ordinary) nodes randomly deployed in a given 2D area, and a finite number of gateways (infrastructure nodes) deterministically placed in the same area. We study the connectivity between the ordinary nodes and the gateways. In real applications, it is often desirable to limit the maximum number of hops between the ordinary nodes and the gateways in order to provide reliable services. On the other hand, requiring...[Show more]
|Collections||ANU Research Publications|
|Source:||Blind Timing and Carrier Synchronization in Decode and Forward Cooperative Systems|
|01_Zhang_On_The_k-hop_Partial_2011.pdf||233.32 kB||Adobe PDF||Request a copy|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.