Sciweavers

191 search results - page 12 / 39
» Solving the Capacitated Local Access Network Design Problem
Sort
View
104
Voted
PPSN
2010
Springer
14 years 10 months ago
Variable Neighborhood Search and Ant Colony Optimization for the Rooted Delay-Constrained Minimum Spanning Tree Problem
Abstract. The rooted delay-constrained minimum spanning tree problem is an NP-hard combinatorial optimization problem arising for example in the design of centralized broadcasting ...
Mario Ruthmair, Günther R. Raidl
ICNP
2006
IEEE
15 years 5 months ago
Benefit-based Data Caching in Ad Hoc Networks
—Data caching can significantly improve the efficiency of information access in a wireless ad hoc network by reducing the access latency and bandwidth usage. However, designing e...
Bin Tang, Himanshu Gupta, Samir R. Das
NBIS
2007
Springer
15 years 5 months ago
Trust Model for Mobile Devices in Ubiquitous Environment
In ubiquitous computing environment, people carrying their mobile devices (eg., mobile phone, PDA, embedded devices) expect to access locally hosted services or resources anytime, ...
Zhefan Jiang, Sangwook Kim
CN
2011
117views more  CN 2011»
14 years 6 months ago
Cross-layer design in multihop wireless networks
In this paper, we take a holistic approach to the protocol architecture design in multihop wireless networks. Our goal is to integrate various protocol layers into a rigorous fram...
Lijun Chen, Steven H. Low, John C. Doyle
WISEC
2010
ACM
15 years 6 months ago
On the reliability of wireless fingerprinting using clock skews
Determining whether a client station should trust an access point is a known problem in wireless security. Traditional approaches to solving this problem resort to cryptography. B...
Chrisil Arackaparambil, Sergey Bratus, Anna Shubin...