Results 1 - 10
of
2,634
Single-Hop Radio Networks
, 2014
"... HAL is a multi-disciplinary open access archive for the deposit and dissemination of sci-entific research documents, whether they are pub-lished or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L’archive ouverte p ..."
Abstract
- Add to MetaCart
HAL is a multi-disciplinary open access archive for the deposit and dissemination of sci-entific research documents, whether they are pub-lished or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et a ̀ la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d’enseignement et de recherche français ou étrangers, des laboratoires publics ou privés.
Analysis of Measured Single-Hop Delay from an Operational Backbone Network
- In Proceedings of IEEE Infocom
, 2002
"... We measure and analyze the single-hop packet delay through operational routers in a backbone IP network. First we present our delay measurements through a single router. Then we identify stepby -step the factors contributing to single-hop delay. In addition to packet processing, transmission, and qu ..."
Abstract
-
Cited by 89 (14 self)
- Add to MetaCart
We measure and analyze the single-hop packet delay through operational routers in a backbone IP network. First we present our delay measurements through a single router. Then we identify stepby -step the factors contributing to single-hop delay. In addition to packet processing, transmission
Scaling Laws of Single-Hop Cognitive Networks
"... We consider an extended cognitive network consisting of n random pairs of cognitive transmitters and receivers communicating simultaneously in the presence of multiple primary users. Of interest is how the maximum throughput of the cognitive users scales with n. Two scenarios are considered: (i) whe ..."
Abstract
-
Cited by 15 (2 self)
- Add to MetaCart
single-hop transmission, suitable for cognitive devices of opportunistic nature, we show that in both scenarios, with path loss larger than 2, the cognitive network throughput scales linearly with the number of cognitive users. Our results show that opportunistic secondary spectrum access using single-hop
Maximization of Single Hop Traffic with Greedy Heuristics
, 2002
"... Maximization of the single hop traffic has been proposed as an computationally feasible approximation to the logical topology design problem in wavelength routed networks. In this paper we consider a class of greedy heuristic algorithms for solving the maximization of the single hop traffic problem. ..."
Abstract
- Add to MetaCart
Maximization of the single hop traffic has been proposed as an computationally feasible approximation to the logical topology design problem in wavelength routed networks. In this paper we consider a class of greedy heuristic algorithms for solving the maximization of the single hop traffic problem
Secure Initialization in Single-Hop Radio Networks ⋆
"... Abstract. We consider single-hop radio networks, where collisions in the shared channel cannot be detected (no-CD model). A radio channel can be accessed by an adversary trying to degrade functionality of the network, so we are interested in algorithms that work in the presence of an adversary, who ..."
Abstract
-
Cited by 1 (1 self)
- Add to MetaCart
Abstract. We consider single-hop radio networks, where collisions in the shared channel cannot be detected (no-CD model). A radio channel can be accessed by an adversary trying to degrade functionality of the network, so we are interested in algorithms that work in the presence of an adversary, who
Capacity rates of erasure channels in Single Hop Networks
"... This paper deals with finding the capacity rates for single hop networks in erasure channels. As the importance of erasure channels are well identified, this paper finds the capacity rates for complex multi sender relay network by using the concept of mutual information with respect to information t ..."
Abstract
- Add to MetaCart
This paper deals with finding the capacity rates for single hop networks in erasure channels. As the importance of erasure channels are well identified, this paper finds the capacity rates for complex multi sender relay network by using the concept of mutual information with respect to information
Fair Scheduling with Deadline Guarantees In Single-hop Networks
"... Abstract-We address the problem of simultaneously ensuring long-term fairness and deterministic delay guarantees for real time traffic over a single-hop network. Specifically, we propose a network control policy that maximises a concave utility function of the average throughput of each flow, while ..."
Abstract
- Add to MetaCart
Abstract-We address the problem of simultaneously ensuring long-term fairness and deterministic delay guarantees for real time traffic over a single-hop network. Specifically, we propose a network control policy that maximises a concave utility function of the average throughput of each flow, while
Interference Reduction in Single Hop Relay Networks
- In Proc. of 11th Virginia Tech Symposium on Wireless Personal Communications
, 2001
"... The purpose of this paper is to determine the possible capacity increase in single hop relay networks, where mobile stations are enabled to serve as additional access points for other terminals. The total power used for direct transmission from a central base station to uniformly distributed mobiles ..."
Abstract
- Add to MetaCart
The purpose of this paper is to determine the possible capacity increase in single hop relay networks, where mobile stations are enabled to serve as additional access points for other terminals. The total power used for direct transmission from a central base station to uniformly distributed
PAPER Generalization of Sorting in Single Hop Wireless Networks ∗
"... SUMMARY The generalized sorting problem is to find the first k largest elements among n input elements and to report them in a sorted order. In this paper, we propose a fast generalized sorting algorithm under the single hop wireless networks model with collision detection (WNCD). The algorithm is b ..."
Abstract
- Add to MetaCart
SUMMARY The generalized sorting problem is to find the first k largest elements among n input elements and to report them in a sorted order. In this paper, we propose a fast generalized sorting algorithm under the single hop wireless networks model with collision detection (WNCD). The algorithm
Results 1 - 10
of
2,634