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.

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

Abstract not found

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 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. 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

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

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

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

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