4,143 research outputs found

    Throughput and Delay Scaling in Supportive Two-Tier Networks

    Full text link
    Consider a wireless network that has two tiers with different priorities: a primary tier vs. a secondary tier, which is an emerging network scenario with the advancement of cognitive radio technologies. The primary tier consists of randomly distributed legacy nodes of density nn, which have an absolute priority to access the spectrum. The secondary tier consists of randomly distributed cognitive nodes of density m=nβm=n^\beta with β2\beta\geq 2, which can only access the spectrum opportunistically to limit the interference to the primary tier. Based on the assumption that the secondary tier is allowed to route the packets for the primary tier, we investigate the throughput and delay scaling laws of the two tiers in the following two scenarios: i) the primary and secondary nodes are all static; ii) the primary nodes are static while the secondary nodes are mobile. With the proposed protocols for the two tiers, we show that the primary tier can achieve a per-node throughput scaling of λp(n)=Θ(1/logn)\lambda_p(n)=\Theta(1/\log n) in the above two scenarios. In the associated delay analysis for the first scenario, we show that the primary tier can achieve a delay scaling of Dp(n)=Θ(nβlognλp(n))D_p(n)=\Theta(\sqrt{n^\beta\log n}\lambda_p(n)) with λp(n)=O(1/logn)\lambda_p(n)=O(1/\log n). In the second scenario, with two mobility models considered for the secondary nodes: an i.i.d. mobility model and a random walk model, we show that the primary tier can achieve delay scaling laws of Θ(1)\Theta(1) and Θ(1/S)\Theta(1/S), respectively, where SS is the random walk step size. The throughput and delay scaling laws for the secondary tier are also established, which are the same as those for a stand-alone network.Comment: 13 pages, double-column, 6 figures, accepted for publication in JSAC 201

    Algorithmic Aspects of Energy-Delay Tradeoff in Multihop Cooperative Wireless Networks

    Full text link
    We consider the problem of energy-efficient transmission in delay constrained cooperative multihop wireless networks. The combinatorial nature of cooperative multihop schemes makes it difficult to design efficient polynomial-time algorithms for deciding which nodes should take part in cooperation, and when and with what power they should transmit. In this work, we tackle this problem in memoryless networks with or without delay constraints, i.e., quality of service guarantee. We analyze a wide class of setups, including unicast, multicast, and broadcast, and two main cooperative approaches, namely: energy accumulation (EA) and mutual information accumulation (MIA). We provide a generalized algorithmic formulation of the problem that encompasses all those cases. We investigate the similarities and differences of EA and MIA in our generalized formulation. We prove that the broadcast and multicast problems are, in general, not only NP hard but also o(log(n)) inapproximable. We break these problems into three parts: ordering, scheduling and power control, and propose a novel algorithm that, given an ordering, can optimally solve the joint power allocation and scheduling problems simultaneously in polynomial time. We further show empirically that this algorithm used in conjunction with an ordering derived heuristically using the Dijkstra's shortest path algorithm yields near-optimal performance in typical settings. For the unicast case, we prove that although the problem remains NP hard with MIA, it can be solved optimally and in polynomial time when EA is used. We further use our algorithm to study numerically the trade-off between delay and power-efficiency in cooperative broadcast and compare the performance of EA vs MIA as well as the performance of our cooperative algorithm with a smart noncooperative algorithm in a broadcast setting.Comment: 12 pages, 9 figure

    Considering Pigeons for Carrying Delay Tolerant Networking based Internet traffic in Developing Countries

    Get PDF
    There are many regions in the developing world that suffer from poor infrastructure and lack of connection to the Internet and Public Switched Telephone Networks (PSTN). Delay Tolerant Networking (DTN) is a technology that has been advocated for providing store-and-forward network connectivity in these regions over the past few years. DTN often relies on human mobility in one form or another to support transportation of DTN data. This presents a socio-technical problem related to organizing how the data should be transported. In some situations the demand for DTN traffic can exceed that which is possible to support with human mobility, so alternative mechanisms are needed. In this paper we propose using live carrier pigeons (columba livia) to transport DTN data. Carrier pigeons have been used for transporting packets of information for a long time, but have not yet been seriously considered for transporting DTN traffic. We provide arguements that this mode of DTN data transport provides promise, and should receive attention from research and development projects. We provide an overview of pigeon characteristics to analyze the feasibility of using them for data transport, and present simulations of a DTN network that utilizes pigeon transport in order to provide an initial investigation into expected performance characteristics

    Sparse Signal Processing Concepts for Efficient 5G System Design

    Full text link
    As it becomes increasingly apparent that 4G will not be able to meet the emerging demands of future mobile communication systems, the question what could make up a 5G system, what are the crucial challenges and what are the key drivers is part of intensive, ongoing discussions. Partly due to the advent of compressive sensing, methods that can optimally exploit sparsity in signals have received tremendous attention in recent years. In this paper we will describe a variety of scenarios in which signal sparsity arises naturally in 5G wireless systems. Signal sparsity and the associated rich collection of tools and algorithms will thus be a viable source for innovation in 5G wireless system design. We will discribe applications of this sparse signal processing paradigm in MIMO random access, cloud radio access networks, compressive channel-source network coding, and embedded security. We will also emphasize important open problem that may arise in 5G system design, for which sparsity will potentially play a key role in their solution.Comment: 18 pages, 5 figures, accepted for publication in IEEE Acces

    Source Delay in Mobile Ad Hoc Networks

    Full text link
    Source delay, the time a packet experiences in its source node, serves as a fundamental quantity for delay performance analysis in networks. However, the source delay performance in highly dynamic mobile ad hoc networks (MANETs) is still largely unknown by now. This paper studies the source delay in MANETs based on a general packet dispatching scheme with dispatch limit ff (PD-ff for short), where a same packet will be dispatched out up to ff times by its source node such that packet dispatching process can be flexibly controlled through a proper setting of ff. We first apply the Quasi-Birth-and-Death (QBD) theory to develop a theoretical framework to capture the complex packet dispatching process in PD-ff MANETs. With the help of the theoretical framework, we then derive the cumulative distribution function as well as mean and variance of the source delay in such networks. Finally, extensive simulation and theoretical results are provided to validate our source delay analysis and illustrate how source delay in MANETs are related to network parameters.Comment: 11page
    corecore