Sciweavers

20638 search results - page 209 / 4128
» Computer Networks
Sort
View
ISAAC
2005
Springer
117views Algorithms» more  ISAAC 2005»
15 years 12 months ago
Basic Computations in Wireless Networks
Abstract. In this paper we address the problem of estimating the number of stations in a wireless network. Under the assumption that each station can detect collisions, we show tha...
Ioannis Caragiannis, Clemente Galdi, Christos Kakl...
PDCAT
2005
Springer
15 years 12 months ago
Trusted Computing-Based Security Architecture For 4G Mobile Networks
In this paper security requirements and security architecture for 4G systems are presented with the consideration of Trusted Computing (TC) for mobile equipment (ME). The security...
Yu Zheng, Dake He, Weichi Yu, Xiaohu Tang
WSC
2004
15 years 7 months ago
On-Demand Computation of Policy Based Routes for Large-Scale Network Simulation
Routing table storage demands pose a significant obstacle for large-scale network simulation. On-demand computation of routes can alleviate those problems for models that do not r...
Michael Liljenstam, David M. Nicol
CISS
2008
IEEE
16 years 29 days ago
Distributed computation of a sparse cover in sensor networks without location information
— In this paper, we present a distributed algorithm for detecting redundancies in a sensor network with no location information. We demonstrate how, in the absence of localizatio...
Alireza Tahbaz-Salehi, Ali Jadbabaie
ISAAC
2005
Springer
113views Algorithms» more  ISAAC 2005»
15 years 12 months ago
Fast Algorithms for Computing the Tripartition-Based Distance Between Phylogenetic Networks
Consider two phylogenetic networks N and N′ of size n. The tripartition-based distance finds the proportion of tripartitions which are not shared by N and N′ . This distance i...
Nguyen Bao Nguyen, C. Thach Nguyen, Wing-Kin Sung