Sciweavers

1600 search results - page 225 / 320
» Clustering for opportunistic communication
Sort
View
ARTCOM
2009
IEEE
15 years 9 months ago
Maximizing the Efficiency of Parallel Apriori Algorithm
In this paper we attempt to maximize the efficiency of the parallel Apriori Algorithm. The paper analyzes the performance of the algorithm over different datasets and over n proce...
Ketan Shah, Sunita Mahajan
USITS
2003
15 years 7 months ago
Anypoint: Extensible Transport Switching on the Edge
Anypoint is a new model for one-to-many communication with ensemble sites—aggregations of end nodes that appear to the external Internet as a unified site. Policies for routing...
Ken Yocum, Darrell C. Anderson, Jeffrey S. Chase, ...
IJNSEC
2007
145views more  IJNSEC 2007»
15 years 6 months ago
Authenticated Group Key Agreement Protocols for Ad hoc Wireless Networks
The lack of fixed infrastructure, both physical and organizational, and the highly dynamic nature of ad hoc networks, presents a major challenge in providing secure, authenticate...
Ahmed Abdel-Hafez, Ali Miri, Luis Orozco-Barbosa
VTC
2010
IEEE
150views Communications» more  VTC 2010»
15 years 4 months ago
Path Selection Algorithms for Multi-Hop VANETs
—In this paper, we introduce a collision model for vehicular cluster and we propose path selection algorithms for multi-hop VANETs. That is, we propose the intuitive algorithm na...
Chulhee Jang, Jae Hong Lee
TSMC
2011
355views more  TSMC 2011»
15 years 1 months ago
Particle Swarm Optimization in Wireless-Sensor Networks: A Brief Survey
—Wireless sensor networks (WSNs) are networks of autonomous nodes used for monitoring an environment. Developers of WSNs face challenges that arise from communication link failur...
Raghavendra V. Kulkarni, Ganesh K. Venayagamoorthy