Sciweavers

1357 search results - page 25 / 272
» Combinatorial Structures for Design of Wireless Sensor Netwo...
Sort
View
NETWORKING
2007
13 years 9 months ago
Maximum Energy Welfare Routing in Wireless Sensor Networks
Most routing algorithms for sensor networks focus on finding energy efficient paths to prolong the lifetime of sensor networks. As a result, the sensors on the efficient paths are ...
Changsoo Ok, Prasenjit Mitra, Seokcheon Lee, Sound...
JPDC
2006
134views more  JPDC 2006»
13 years 7 months ago
Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs
Minimum Spanning Tree (MST) is one of the most studied combinatorial problems with practical applications in VLSI layout, wireless communication, and distributed networks, recent ...
David A. Bader, Guojing Cong
VTC
2006
IEEE
138views Communications» more  VTC 2006»
14 years 1 months ago
Simulated Annealing based Wireless Sensor Network Localization with Flip Ambiguity Mitigation
Abstract— Accurate self-localization capability is highly desirable in wireless sensor networks. A major problem in wireless sensor network localization is the flip ambiguity, w...
Anushiya A. Kannan, Guoqiang Mao, Branka Vucetic
CATA
2007
13 years 9 months ago
Wireless Sensor Payload Design for Sounding Rocket
A quick turnaround Sub-Orbital Student Experiment Module sounding rocket experiment has been designed and built to initiate the Old Dominion University wireless spacecraft bus pro...
Sachin Shetty, Min Song, Robert Ash, Ersin Ancel, ...
IJSN
2007
120views more  IJSN 2007»
13 years 7 months ago
On the design of secure protocols for hierarchical sensor networks
Wireless sensor networks (WSNs) are ad hoc networks comprised mainly of small sensor nodes with limited resources, and can be used to monitor areas of interest. In this paper, we p...
Leonardo B. Oliveira, Hao Chi Wong, Antonio Alfred...