Sciweavers

278 search results - page 54 / 56
» Partitioning parallel simulation of wireless networks
Sort
View
DIALM
2007
ACM
178views Algorithms» more  DIALM 2007»
15 years 3 months ago
Near-Optimal Compression of Probabilistic Counting Sketches for Networking Applications
Sketches--data structures for probabilistic, duplicate insensitive counting--are central building blocks of a number of recently proposed network protocols, for example in the con...
Björn Scheuermann, Martin Mauve
DCOSS
2011
Springer
13 years 11 months ago
Planning the trajectories of multiple mobile sinks in large-scale, time-sensitive WSNs
—Controlled sink mobility has been shown to be very beneficial in lifetime prolongation of wireless sensor networks (WSNs) by avoiding the typical hot-spot problem near the sink...
Wint Yi Poe, Michael Beck, Jens B. Schmitt
IPPS
2005
IEEE
15 years 5 months ago
PReCinCt: A Scheme for Cooperative Caching in Mobile Peer-to-Peer Systems
Mobile Peer-to-Peer (MP2P) systems consist of mobile peers that collaborate with each other to complete application problems. Information sharing in such environments is a challen...
Huaping Shen, Mary Suchitha Joseph, Mohan Kumar, S...
FCCM
2006
IEEE
133views VLSI» more  FCCM 2006»
15 years 5 months ago
A Scalable FPGA-based Multiprocessor
It has been shown that a small number of FPGAs can significantly accelerate certain computing tasks by up to two or three orders of magnitude. However, particularly intensive lar...
Arun Patel, Christopher A. Madill, Manuel Salda&nt...
GLOBECOM
2009
IEEE
15 years 6 months ago
Distributed Physical Carrier Sensing Adaptation Scheme in Cooperative MAP WLAN
Abstract— Recently a multiple access point (MAP) architecture is proposed for wireless local area networks (WLAN) to exploit the spatial diversity by permitting each user to asso...
Yao Hua, Qian Zhang, Zhisheng Niu