نتایج جستجو برای: hidden node problem

تعداد نتایج: 1081759  

Journal: :Journal of Combinatorial Optimization 2006

2013
Francesco Segreto Daniele Tosi Giovanni Francesco Marangi Alfonso Luca Pendolino Stefano Santoro Pierluigi Gigliofiorito Paolo Persichetti

functional and aesthetic results [3]. In case of more extensive defects involving both scrotal and perineal skin loss, we favor split thickness skin grafts for defect coverage. As noted by Huettinger et al. [1], graft fixation remains a challenge. We have developed a VAC fixation technique, the so-called “sandwich technique” [4], that we have used successfully for many years now. We feel that i...

Jafar Razmi Saeed Zameni,

Centralizing and using proper transportation facilities cut down costs and traffic. Hub facilities concentrate on flows to cause economic advantage of scale and multimodal transportation helps use the advantage of another transporter. A distinctive feature of this paper is proposing a new mathematical formulation for a three-stage p-hub location routing problem with simultaneous pick-ups and de...

2005
Naveen Santhapuri Junling Wang Zifei Zhong

It is well-known that MAC protocols for multihop wireless networks face the problems of hidden and exposed nodes due to the limited transmission range of wireless nodes. The Distributed Coordination Function (DCF) mechanism of the IEEE 802.11 standard [2] addresses the issue of hidden node problem by employing a four-way handshake of RTS-CTSDATA-ACK frames. In this exchange, the transmitter emi...

2016
N. Arun Vignesh P. Poongodi

In Wireless Local Area Network, wireless node will suffer due to the hidden terminal node. This hidden terminal node leads to high collision, high drop rate of packets and high delay. To avoid this hidden terminal node, wireless nodes use the control messages to know the status of the destination nodes. Another issue in the WLAN is less coverage range with lesser number of nodes. To increase th...

2005
Murat Demirbas Muzammil Hussain

RTS-CTS handshake based protocols achieve “reliable unicast” by eliminating the hidden node problem effectively, however, these solutions are not directly or efficiently generalizable for solving the single-hop “reliable broadcast” problem, and broadcast remains as a best-effort operation in wireless ad hoc networks. Here we present a simple, light-weight, and self-stabilizing MAC protocol, nam...

Journal: :Mathematics 2022

Graph contrastive learning (GCL) has been subject to more attention and widely applied numerous graph tasks such as node classification link prediction. Although it achieved great success even performed better than supervised methods in some tasks, most of them depend on node-level comparison, while ignoring the rich semantic information contained topology, especially for social networks. Howev...

Journal: :JCSE 2014
Akihisa Matoba Masaki Hanada Hidehiro Kanemitsu Moo Wan Kim

One interesting problem regarding wireless local area network (WLAN) ad-hoc networks is the effective mitigation of hidden nodes. The WLAN standard IEEE 802.11 provides request to send/clear to send (RTS/CTS) as mitigation for the hidden node problem; however, this causes the exposed node problem. The first 802.11 standard provided only two transmission rates, 1 and 2 Mbps, and control frames, ...

Journal: :CoRR 2018
Feng Li Sibo Yang Huanhuan Huang Wei Wu

This paper is concerned with the sparsification of the input-hidden weights of ELM (Extreme Learning Machine). For ordinary feedforward neural networks, the sparsification is usually done by introducing certain regularization technique into the learning process of the network. But this strategy can not be applied for ELM, since the input-hidden weights of ELM are supposed to be randomly chosen ...

Journal: :Neurocomputing 2007
Guang-Bin Huang Lei Chen

Unlike the conventional neural network theories and implementations, Huang et al. [Universal approximation using incremental constructive feedforward networks with random hidden nodes, IEEE Transactions on Neural Networks 17(4) (2006) 879–892] have recently proposed a new theory to show that single-hidden-layer feedforward networks (SLFNs) with randomly generated additive or radial basis functi...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید