Sciweavers

5658 search results - page 299 / 1132
» An Efficient Counting Network
Sort
View
RSA
2008
123views more  RSA 2008»
15 years 6 months ago
Generating unlabeled connected cubic planar graphs uniformly at random
We present an expected polynomial time algorithm to generate an unlabeled connected cubic planar graph uniformly at random. We first consider rooted connected cubic planar graphs, ...
Manuel Bodirsky, Clemens Gröpl, Mihyun Kang
CN
2004
146views more  CN 2004»
15 years 6 months ago
Spatio-temporal correlation: theory and applications for wireless sensor networks
Wireless Sensor Networks (WSN) are characterized by the dense deployment of sensor nodes that continuously observe physical phenomenon. Due to high density in the network topology...
Mehmet C. Vuran, Özgür B. Akan, Ian F. A...
TWC
2008
235views more  TWC 2008»
15 years 6 months ago
Optimal spectrum sensing framework for cognitive radio networks
Spectrum sensing is the key enabling technology for cognitive radio networks. The main objective of spectrum sensing is to provide more spectrum access opportunities to cognitive r...
Won-Yeol Lee, Ian F. Akyildiz
WICON
2008
15 years 8 months ago
A graph based routing algorithm for multi-hop cognitive radio networks
Cognitive radio networks that allow dynamic spectrum access are considered spectrally more efficient than networks using fixed spectral allocation. These networks are characterize...
Yogesh Reddy Kondareddy, Prathima Agrawal
PERCOM
2007
ACM
16 years 6 months ago
A three round authenticated group key agreement protocol for ad hoc networks
Group Key Agreement (GKA) protocols enable the participants to derive a key based on each one's contribution over a public network without any central authority. They also pr...
Daniel Augot, Raghav Bhaskar, Valérie Issarny, Da...