Sciweavers

494 search results - page 30 / 99
» The Conference Call Search Problem in Wireless Networks
Sort
View
JCP
2006
151views more  JCP 2006»
13 years 9 months ago
Simulated Annealing based Wireless Sensor Network Localization
In this paper, we describe a novel localization algorithm for ad hoc wireless sensor networks. Accurate selforganization and localization capability is a highly desirable character...
Anushiya A. Kannan, Guoqiang Mao, Branka Vucetic
ASC
2004
13 years 9 months ago
Adaptive reconfiguration of data networks using genetic algorithms
Genetic algorithms are applied to an important, but little-investigated, network design problem, that of reconfiguring the topology and link capacities of an operational network t...
David J. Montana, Talib S. Hussain
COMSWARE
2007
IEEE
14 years 3 months ago
Topology-based Clusterhead Candidate Selection in Wireless Ad-hoc and Sensor Networks
—Clustering techniques create hierarchal network structures, called clusters, on an otherwise flat network. Neighboring devices elect one appropriate device as clusterhead. Due t...
Matthias R. Brust, Adrian Andronache, Steffen Roth...
ISCC
2006
IEEE
112views Communications» more  ISCC 2006»
14 years 3 months ago
The Precision and Energetic Cost of Snapshot Estimates in Wireless Sensor Networks
— Even for a specific application, the design space of wireless sensor networks is enormous, and traditional disciplinary boundaries are disappearing in the search for efficien...
Paul G. Flikkema
PERCOM
2006
ACM
14 years 8 months ago
Decorrelating wireless sensor network traffic to inhibit traffic analysis attacks
Typical packet traffic in a sensor network reveals pronouncedpatterns that allow an adversary analyzing packet traffic to deduce the location of a base station. Once discovered, t...
Jing Deng, Richard Han, Shivakant Mishra