Sciweavers

641 search results - page 81 / 129
» Improved Bounds for Wireless Localization
Sort
View
CCS
2010
ACM
14 years 2 months ago
Practical ID-based encryption for wireless sensor network
In this paper, we propose a new practical identity-based encryption scheme which is suitable for wireless sensor network (WSN). We call it Receiver-Bounded Online/Offline Identity...
Cheng-Kang Chu, Joseph K. Liu, Jianying Zhou, Feng...
SECON
2008
IEEE
14 years 2 months ago
Enhancing the Data Collection Rate of Tree-Based Aggregation in Wireless Sensor Networks
— What is the fastest rate at which we can collect a stream of aggregated data from a set of wireless sensors organized as a tree? We explore a hierarchy of techniques using real...
Özlem Durmaz Incel, Bhaskar Krishnamachari
CORR
2007
Springer
92views Education» more  CORR 2007»
13 years 7 months ago
Throughput Scaling in Random Wireless Networks: A Non-Hierarchical Multipath Routing Strategy
— Franceschetti et al. [1] have recently shown that per-node throughput in an extended (i.e., geographically expanding), ad hoc wireless network with Θ(n) randomly distributed n...
Awlok Josan, Mingyan Liu, David L. Neuhoff, S. San...
WIOPT
2010
IEEE
13 years 6 months ago
On maximizing collaboration in Wireless Mesh Networks without monetary incentives
—In distributed network settings, where nodes are not under the control of a single administrative entity, the fulfillment of fundamental network operations is heavily dependent...
Gabriel Popa, Éric Gourdin, Franck Legendre...
TMC
2011
131views more  TMC 2011»
13 years 2 months ago
In-Network Computation in Random Wireless Networks: A PAC Approach to Constant Refresh Rates with Lower Energy Costs
—We propose a method to compute a probably approximately correct (PAC) normalized histogram of observations with a refresh rate of Âð1Þ time units per histogram sample on a ra...
Srikanth K. Iyer, D. Manjunath, R. Sundaresan