This work seeks to develop an analytical model for the per-node throughput analysis of IEEE 802.11 WLAN networks with hidden nodes by extending Bianchi’s model. With the analytic model we derive the per-node throughput of each node and quantify the impact of hidden nodes on per-node throughput. Through our analysis, we find that nodes having more hidden nodes are likely to have worse throughput...

|{ We show that, for feedforward nets with a single hidden layer, a single output node, and a \transfer function" Tanhs, the net is uniquely determined by its input-output map, up to an obvious nite group of symmetries (permutations of the hidden nodes, and changing the sign of all the weights associated to a particular hidden node), provided that the net is irreducible, i.e. that there does no...

It is well-known that single hidden layer feed-forward neural networks (SLFNs) with at most n hidden neurons can learn n distinct samples with zero error, and the weights connecting the input neurons and the hidden neurons and the hidden node thresholds can be chosen randomly. Namely, for n distinct samples, there exist SLFNs with n hidden neurons that interpolate them. These networks are calle...

Many performance evaluations for IEEE 802.11distributed coordination function (DCF) have been previouslyreported in the literature. Some of them have clearly indicatedthat 802.11 MAC protocol has poor performance in multi-hopwireless ad hoc networks due to exposed and hidden nodeproblems. Although RTS/CTS transmission scheme mitigatesthese phenomena, it has not been successful in thoroughlyomit...

Successful transmission of online multimedia streams in wireless multimedia sensor networks (WMSNs) is a big challenge due to their limited bandwidth and power resources. The existing WSN protocols are not completely appropriate for multimedia communication. The effectiveness of WMSNs varies, and it depends on the correct location of its sensor nodes in the field. Thus, maximizing the multimedi...

We study two classes of sigmoids: the simple sigmoids, defined to be odd, asymptotically bounded, completely monotone functions in one variable, and the hyperbolic sigmoids, a proper subset of simple sigmoids and a natural generalization of the hyperbolic tangent. We obtain a complete characterization for the inverses of hyperbolic sigmoids using Euler's incomplete beta functions, and describe ...

Several MAC layer power control protocols have been proposed to address the limited power supplies in ad hoc networks. Recent protocols suggest varying the transmission power such that the RTS/CTS handshake is done at the maximum, and the Data-ACK are transmitted at the minimum necessary transmission power level. It has also been suggested to periodically use maximum transmission power during D...

The structure learning is one of the main concerns in studies of the Bayesian networks. In the present paper, we consider the network consisting of both observable and hidden nodes, and propose a method to investigate the existence of a hidden node between two observable nodes, which is the model selection problem between the networks with and without the middle hidden node. When the network in...

In the construction of a Bayesian network, it is always assumed that the variables starting from the same parent are conditionally independent. In practice, this assumption may not hold, and will give rise to incorrect inferences. In cases where some dependency is found between variables, we propose that the creation of a hidden node, which in effect models the dependency, can solve the problem...

We present two Bayesian algorithms CD-B and CD-H for discovering unconfounded cause and effect relationships from observational data without assuming causal sufficiency which precludes hidden common causes for the observed variables. The CD-B algorithm first estimates the Markov blanket of a node X using a Bayesian greedy search method and then applies Bayesian scoring methods to discriminate t...