• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 21,546
Next 10 →

Access Point

by Raj Jain, Attack Tools
"... � Access Points (APs) periodically broadcast a beacon with SSID (service set ID) and security level � Subscriber stations listen to these beacons, measure signal strength and determine which AP to join � Subscribers can also send a “Probe ” to find AP’s in the neighborhood � AP authenticates the sub ..."
Abstract - Add to MetaCart
� Access Points (APs) periodically broadcast a beacon with SSID (service set ID) and security level � Subscriber stations listen to these beacons, measure signal strength and determine which AP to join � Subscribers can also send a “Probe ” to find AP’s in the neighborhood � AP authenticates

The R*-tree: an efficient and robust access method for points and rectangles

by Norbert Beckmann, Hans-Peter Kriegel, Ralf Schneider, Bernhard Seeger - INTERNATIONAL CONFERENCE ON MANAGEMENT OF DATA , 1990
"... The R-tree, one of the most popular access methods for rectangles, is based on the heuristic optimization of the area of the enclosing rectangle in each inner node. By running numerous experiments in a standardized testbed under highly varying data, queries and operations, we were able to design the ..."
Abstract - Cited by 1262 (74 self) - Add to MetaCart
The R-tree, one of the most popular access methods for rectangles, is based on the heuristic optimization of the area of the enclosing rectangle in each inner node. By running numerous experiments in a standardized testbed under highly varying data, queries and operations, we were able to design

and Access Points

by Unauthorized Cards
"... this document is subject to change without notice. Interlink Networks does not guarantee the accuracy of the information. ..."
Abstract - Add to MetaCart
this document is subject to change without notice. Interlink Networks does not guarantee the accuracy of the information.

Multidimensional Access Methods

by Volker Gaede, Oliver Günther , 1998
"... Search operations in databases require special support at the physical level. This is true for conventional databases as well as spatial databases, where typical search operations include the point query (find all objects that contain a given search point) and the region query (find all objects that ..."
Abstract - Cited by 686 (3 self) - Add to MetaCart
Search operations in databases require special support at the physical level. This is true for conventional databases as well as spatial databases, where typical search operations include the point query (find all objects that contain a given search point) and the region query (find all objects

Clustering by passing messages between data points

by Brendan J. Frey, Delbert Dueck - Science , 2007
"... Clustering data by identifying a subset of representative examples is important for processing sensory signals and detecting patterns in data. Such “exemplars ” can be found by randomly choosing an initial subset of data points and then iteratively refining it, but this works well only if that initi ..."
Abstract - Cited by 696 (8 self) - Add to MetaCart
Clustering data by identifying a subset of representative examples is important for processing sensory signals and detecting patterns in data. Such “exemplars ” can be found by randomly choosing an initial subset of data points and then iteratively refining it, but this works well only

Improved access point selection

by Anthony J. Nicholson, Brian D. Noble, Yatin Chawathe, David Wetherall, Mike Y. Chen - In MobiSys , 2006
"... This paper presents Virgil, an automatic access point discovery and selection system. Unlike existing systems that select access points based entirely on received signal strength, Virgil scans for all available APs at a location, quickly associates to each, and runs a battery of tests to estimate th ..."
Abstract - Cited by 61 (6 self) - Add to MetaCart
This paper presents Virgil, an automatic access point discovery and selection system. Unlike existing systems that select access points based entirely on received signal strength, Virgil scans for all available APs at a location, quickly associates to each, and runs a battery of tests to estimate

Wireless Access Point Installation Guide Connect the Wireless Access Point Double-click the correct Wireless Access Point in the list. If the Wireless Access Point in

by unknown authors
"... Wireless Access Point in the network. ..."
Abstract - Add to MetaCart
Wireless Access Point in the network.

Data mules: Modeling a three-tier architecture for sparse sensor networks

by Rahul C. Shah, Sumit Roy, Sushant Jain, Waylon Brunette - IN IEEE SNPA WORKSHOP , 2003
"... Abstract — This paper presents and analyzes an architecture that exploits the serendipitous movement of mobile agents in an environment to collect sensor data in sparse sensor networks. The mobile entities, called MULEs, pick up data from sensors when in close range, buffer it, and drop off the data ..."
Abstract - Cited by 485 (6 self) - Add to MetaCart
the data to wired access points when in proximity. This leads to substantial power savings at the sensors as they only have to transmit over a short range. Detailed performance analysis is presented based on a simple model of the system incorporating key system variables such as number of MULEs, sensors

SEAD: Secure Efficient Distance Vector Routing for Mobile Wireless Ad Hoc Networks

by Yih-Chun Hu, David B. Johnson, Adrian Perrig , 2003
"... An ad hoc network is a collection of wireless computers (nodes), communicating among themselves over possibly multihop paths, without the help of any infrastructure such as base stations or access points. Although many previous ad hoc network routing protocols have been based in part on distance vec ..."
Abstract - Cited by 534 (8 self) - Add to MetaCart
An ad hoc network is a collection of wireless computers (nodes), communicating among themselves over possibly multihop paths, without the help of any infrastructure such as base stations or access points. Although many previous ad hoc network routing protocols have been based in part on distance

Ad-hoc On-Demand Distance Vector Routing

by Charles E. Perkins, Elizabeth M. Royer - IN PROCEEDINGS OF THE 2ND IEEE WORKSHOP ON MOBILE COMPUTING SYSTEMS AND APPLICATIONS , 1997
"... An ad-hoc network is the cooperative engagement of a collection of mobile nodes without the required intervention of any centralized access point or existing infrastructure. In this paper we present Ad-hoc On Demand Distance Vector Routing (AODV), a novel algorithm for the operation of such ad-hoc n ..."
Abstract - Cited by 3240 (14 self) - Add to MetaCart
An ad-hoc network is the cooperative engagement of a collection of mobile nodes without the required intervention of any centralized access point or existing infrastructure. In this paper we present Ad-hoc On Demand Distance Vector Routing (AODV), a novel algorithm for the operation of such ad
Next 10 →
Results 1 - 10 of 21,546
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University