Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
1,406
1 of hidden nodes
"... average attainable throughput in the channel under standard conditions where all nodes follow the al of the DoS attacker is to prevent the innocent nodes from accessing the innocent node that follows the standards. The protocol resides in every node to enable each node to police other nodes in its i ..."
Abstract
- Add to MetaCart
average attainable throughput in the channel under standard conditions where all nodes follow the al of the DoS attacker is to prevent the innocent nodes from accessing the innocent node that follows the standards. The protocol resides in every node to enable each node to police other nodes in its
Hidden problems with the hidden node problem
- in Proceedings of 23rd Biennial Symposium on Communications
, 2006
"... Abstract — We discuss a few problems introduced by the RTS/CTS mechanism of collision avoidance and focus on the virtual jamming problem, which allows a malicious node to effectively jam a large fragment of a wireless network at a minimum expense of power. We propose a solution to this problem and p ..."
Abstract
-
Cited by 14 (5 self)
- Add to MetaCart
Abstract — We discuss a few problems introduced by the RTS/CTS mechanism of collision avoidance and focus on the virtual jamming problem, which allows a malicious node to effectively jam a large fragment of a wireless network at a minimum expense of power. We propose a solution to this problem
Hidden Problems with the Hidden Node Problem
- in Proceedings of 23rd Biennial Symposium on Communications
, 2006
"... We discuss a few problems introduced by the RTS/CTS mechanism of collision avoidance and focus on the virtual jamming problem, which allows a malicious node to effectively jam a large fragment of a wireless network at a minimum expense of power. We propose a solution to this problem and provide expe ..."
Abstract
- Add to MetaCart
We discuss a few problems introduced by the RTS/CTS mechanism of collision avoidance and focus on the virtual jamming problem, which allows a malicious node to effectively jam a large fragment of a wireless network at a minimum expense of power. We propose a solution to this problem and provide
Hidden nodes avoidance in wireless sensor networks
- in ‘Proceedings of Wireless Networks, Communications and Mobile Computing, 2005 International Conference
, 2005
"... Abstract — We propose a new access method for wireless multihop sensor networks. It reduces collisions due to hidden nodes, a source of significant energy dissipation. Our access method operates similarly to SMAC by alternating sleeping and active periods, but it does not use RTS/CTS. Instead, it ad ..."
Abstract
-
Cited by 5 (0 self)
- Add to MetaCart
Abstract — We propose a new access method for wireless multihop sensor networks. It reduces collisions due to hidden nodes, a source of significant energy dissipation. Our access method operates similarly to SMAC by alternating sleeping and active periods, but it does not use RTS/CTS. Instead
Interpretation of Hidden Node Methodology with Network Accuracy
, 2003
"... Bayesian networks are constructed under a conditional independency assumption. This assumption however does not necessarily hold in practice and may lead to loss of accuracy. We previously proposed a hidden node methodology whereby Bayesian networks are adapted by the addition of hidden nodes to mod ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
Bayesian networks are constructed under a conditional independency assumption. This assumption however does not necessarily hold in practice and may lead to loss of accuracy. We previously proposed a hidden node methodology whereby Bayesian networks are adapted by the addition of hidden nodes
On the identification of discrete graphical models with hidden nodes. Bernoulli
, 2012
"... Conditions are presented for local identifiability of discrete undi-rected graphical models with a binary hidden node. These models can be obtained by extending the latent class model to allow for conditional associations between the observed variables. We establish a necessary and sufficient condit ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
Conditions are presented for local identifiability of discrete undi-rected graphical models with a binary hidden node. These models can be obtained by extending the latent class model to allow for conditional associations between the observed variables. We establish a necessary and sufficient
problems called “Hidden Node ” and “Exposed Node”.
"... Abstract—The W-LAN Ad Hoc network tends to cause ..."
Detecting hidden nodes in complex networks from time series
- Phys. Rev. E
, 2012
"... We develop a general method to detect hidden nodes in complex networks, using only time series from nodes that are accessible to external observation. Our method is based on compressive sensing and we formulate a general framework encompassing continuous-and discrete-time and the evolutionary-game ..."
Abstract
-
Cited by 3 (2 self)
- Add to MetaCart
We develop a general method to detect hidden nodes in complex networks, using only time series from nodes that are accessible to external observation. Our method is based on compressive sensing and we formulate a general framework encompassing continuous-and discrete-time and the evolutionary
Upper bounds on the number of hidden nodes in the Sugiyama algorithm
- In GD ’96: Proceedings of the Symposium on Graph Drawing, volume 1190 of LNCS
, 1997
"... The Sugiyama algorithm is a well-known techique for drawing arbitrary directed grapds G=(V,E). It is being widely used in current graph-drawing systems. Despite its importance and wide-spread use, little is known about the time and space complexity of several parts of the algorithm. This paper impro ..."
Abstract
-
Cited by 2 (0 self)
- Add to MetaCart
improves this situation by analyzing the exact and asymptotic worst-case complexity of the simplification phase of the Sugiyama algorithm. This complexity is dominated by the number d of added invisible (a.k.a. hidden or dummy) nodes. The best previously known upper bound for this number is O(min{|V|^3,|E
Incremental extreme learning machine with fully complex hidden nodes
, 2007
"... Huang et al. [Universal approximation using incremental constructive feedforward networks with random hidden nodes, IEEE Trans. Neural Networks 17(4) (2006) 879–892] has recently proposed an incremental extreme learning machine (I-ELM), which randomly adds hidden nodes incrementally and analytically ..."
Abstract
-
Cited by 12 (3 self)
- Add to MetaCart
Huang et al. [Universal approximation using incremental constructive feedforward networks with random hidden nodes, IEEE Trans. Neural Networks 17(4) (2006) 879–892] has recently proposed an incremental extreme learning machine (I-ELM), which randomly adds hidden nodes incrementally
Results 1 - 10
of
1,406
