Sciweavers

736 search results - page 50 / 148
» Approximating the Number of Network Motifs
Sort
View
TMC
2011
131views more  TMC 2011»
14 years 4 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
IWCMC
2006
ACM
15 years 3 months ago
Queuing network models for delay analysis of multihop wireless ad hoc networks
— In this paper we focus on characterizing the average end-to-end delay and maximum achievable per-node throughput in random access multihop wireless ad hoc networks with station...
Nabhendra Bisnik, Alhussein A. Abouzeid
TPDS
2008
126views more  TPDS 2008»
14 years 9 months ago
Efficient Directional Network Backbone Construction in Mobile Ad Hoc Networks
In this paper, we consider the issue of constructing an energy-efficient virtual network backbone in mobile ad hoc networks (MANETs) for broadcasting applications using directiona...
Shuhui Yang, Jie Wu, Fei Dai
INFOCOM
2008
IEEE
15 years 4 months ago
Minimum Cost Topology Construction for Rural Wireless Mesh Networks
—IEEE 802.11 WiFi equipment based wireless mesh networks have recently been proposed as an inexpensive approach to connect far-flung rural areas. Such networks are built using h...
Debmalya Panigrahi, Partha Dutta, Sharad Jaiswal, ...
INFOCOM
2006
IEEE
15 years 3 months ago
Theory and Network Applications of Dynamic Bloom Filters
Abstract— A bloom filter is a simple, space-efficient, randomized data structure for concisely representing a static data set, in order to support approximate membership querie...
Deke Guo, Jie Wu, Honghui Chen, Xueshan Luo