Pro-active Key Distribution using Neighbor Graphs
| dc.contributor.author | Mishra, Arunesh | en_US |
| dc.contributor.author | Shin, Min-ho | en_US |
| dc.contributor.author | Arbaugh, William A. | en_US |
| dc.date.accessioned | 2004-05-31T23:33:41Z | |
| dc.date.available | 2004-05-31T23:33:41Z | |
| dc.date.created | 2003-09 | en_US |
| dc.date.issued | 2003-11-25 | en_US |
| dc.description.abstract | User mobility in wireless data networks is increasing because of technological advances, and the desire for voice and multimedia applications. These applications, however, require handoffs between base stations (or access points) to be fast to maintain the quality of the connections. In this paper, we introduce a novel data structure, the Neighbor Graph, which dynamically captures the mobility topology of the network, and we show how neighbor graphs can be utilized to reduce the authentication time of an IEEE 802.11 hand-off from 1.1 seconds (full EAP/TLS) to 50 ms without loss of security. (UMIACS-TR-2003-106) | en_US |
| dc.format.extent | 236519 bytes | |
| dc.format.mimetype | application/postscript | |
| dc.identifier.uri | http://hdl.handle.net/1903/1322 | |
| dc.language.iso | en_US | |
| dc.relation.isAvailableAt | Digital Repository at the University of Maryland | en_US |
| dc.relation.isAvailableAt | University of Maryland (College Park, Md.) | en_US |
| dc.relation.isAvailableAt | Tech Reports in Computer Science and Engineering | en_US |
| dc.relation.isAvailableAt | UMIACS Technical Reports | en_US |
| dc.relation.ispartofseries | UM Computer Science Department; CS-TR-4538 | en_US |
| dc.relation.ispartofseries | UMIACS; UMIACS-TR-2003-106 | en_US |
| dc.title | Pro-active Key Distribution using Neighbor Graphs | en_US |
| dc.type | Technical Report | en_US |