668 research outputs found
Effect of Location Accuracy and Shadowing on the Probability of Non-Interfering Concurrent Transmissions in Cognitive Ad Hoc Networks
Cognitive radio ad hoc systems can coexist with a primary network in a scanning-free region, which can be dimensioned by location awareness. This coexistence of networks improves system throughput and increases the efficiency of radio spectrum utilization. However, the location accuracy of real positioning systems affects the right dimensioning of the concurrent transmission region. Moreover, an ad hoc connection may not be able to coexist with the primary link due to the shadowing effect. In this paper we investigate the impact of location accuracy on the concurrent transmission probability and analyze the reliability of concurrent transmissions when shadowing is taken into account. A new analytical model is proposed, which allows to estimate the resulting secure region when the localization uncertainty range is known. Computer simulations show the dependency between the location accuracy and the performance of the proposed topology, as well as the reliability of the resulting secure region
Capacity Enhancement in 60âGHz Based D2D Networks by Relay Selection and Scheduling
Millimeter-wave or 60âGHz communication is a promising technology that enables data rates in multigigabits. However, its tremendous propagation loss and signal blockage may severely affect the network throughput. In current data-centric device-to-device (D2D) communication networks, the devices with intended data communications usually lay in close proximity, unlike the case in voice-centric networks. So the network can be visualized as a naturally formed groups of devices. In this paper, we jointly consider resource scheduling and relay selection to improve network capacity in 60âGHz based D2D networks. Two types of transmission scenarios are considered in wireless personal area networks (WPANs), intra and intergroup. A distributed receiver based relay selection scheme is proposed for intragroup transmission, while a distance based relay selection scheme is proposed for intergroup transmission. The outage analysis of our proposed relay selection scheme is provided along with the numerical results. We then propose a concurrent transmission scheduling algorithm based on vertex coloring technique. The proposed scheduling algorithm employs time and space division in mmWave WPANs. Using vertex multicoloring, we allow transmitter-receiver (Tx-Rx) communication pairs to span over more colors, enabling better time slot utilization. We evaluate our scheduling algorithm in single-hop and multihop scenarios and discover that it outperforms other schemes by significantly improving network throughput
Exploiting Device-to-Device Communications to Enhance Spatial Reuse for Popular Content Downloading in Directional mmWave Small Cells
With the explosive growth of mobile demand, small cells in millimeter wave
(mmWave) bands underlying the macrocell networks have attracted intense
interest from both academia and industry. MmWave communications in the 60 GHz
band are able to utilize the huge unlicensed bandwidth to provide multiple Gbps
transmission rates. In this case, device-to-device (D2D) communications in
mmWave bands should be fully exploited due to no interference with the
macrocell networks and higher achievable transmission rates. In addition, due
to less interference by directional transmission, multiple links including D2D
links can be scheduled for concurrent transmissions (spatial reuse). With the
popularity of content-based mobile applications, popular content downloading in
the small cells needs to be optimized to improve network performance and
enhance user experience. In this paper, we develop an efficient scheduling
scheme for popular content downloading in mmWave small cells, termed PCDS
(popular content downloading scheduling), where both D2D communications in
close proximity and concurrent transmissions are exploited to improve
transmission efficiency. In PCDS, a transmission path selection algorithm is
designed to establish multi-hop transmission paths for users, aiming at better
utilization of D2D communications and concurrent transmissions. After
transmission path selection, a concurrent transmission scheduling algorithm is
designed to maximize the spatial reuse gain. Through extensive simulations
under various traffic patterns, we demonstrate PCDS achieves near-optimal
performance in terms of delay and throughput, and also superior performance
compared with other existing protocols, especially under heavy load.Comment: 12 pages, to appear in IEEE Transactions on Vehicular Technolog
Restricted Mobility Improves Delay-Throughput Trade-offs in Mobile Ad-Hoc Networks
In this paper we revisit two classes of mobility models which are widely used to repre-sent users â mobility in wireless networks: Random Waypoint (RWP) and Random Direction (RD). For both models we obtain systems of partial differential equations which describe the evolution of the users â distribution. For the RD model, we show how the equations can be solved analytically both in the stationary and transient regime adopting standard mathematical techniques. Our main contributions are i) simple expressions which relate the transient dura-tion to the model parameters; ii) the definition of a generalized random direction model whose stationary distribution of mobiles in the physical space corresponds to an assigned distribution
Multihop clustering algorithm for load balancing in wireless sensor networks
The paper presents a new cluster based routing algorithm that exploits the redundancy properties of the sensor networks in order to address the traditional problem of load balancing and energy efficiency in the WSNs.The algorithm makes use of the nodes in a sensor network of which area coverage is covered by the neighbours of the nodes and mark them as temporary cluster heads. The algorithm then forms two layers of multi hop communication. The bottom layer which involves intra cluster communication and the top layer which involves inter cluster communication involving the temporary cluster heads. Performance studies indicate that the proposed algorithm solves effectively the problem of load balancing and is also more efficient in terms of energy consumption from Leach and the enhanced version of Leach
- âŠ