نتایج جستجو برای: relay node
تعداد نتایج: 185831 فیلتر نتایج به سال:
The proposed energy-efficient geographical routing (EGR) mechanism is generally applicable to reduce energy consumption in wireless communication networks. No matter for table-driven or on-demand ad-hoc routing algorithms, EGR enhances them by constructing an initial routing path considering location information. Then, to further improve energy utilization it selects relay nodes of links on the...
In geographical forwarding of packets in a large wireless sensor network (WSN) with sleep-wake cycling nodes, we are interested in the local decision problem faced by a node that has “custody” of a packet and has to choose one among a set of next-hop relay nodes to forward the packet towards the sink. Each relay is associated with a “reward” that summarizes the benefit of forwarding the packet ...
Future wireless communication is expected to integrate collocated different radio access technologies together to meet wide expectation (multiple services) from users and to support mobility. The key requirements in this multiple radio access technology are to meet the Quality of Service (QoS) requirement of the user based on the service type, reduce energy consumption for the particular servic...
The aim of this paper is to propose a novel technique to guarantee Quality of Service (QoS) in a highly dynamic environment. The MANET changes its topology dynamically as the nodes are moved frequently. This will cause link failure between mobile nodes. MANET cannot ensure reliability without delay. The relay node is selected based on achieving QoS in previous transmission. It considers one mor...
In this paper, a symbol-level selective transmission for full-duplex (FD) relaying networks is proposed to mitigate error propagation effects and improve system spectral efficiency. The idea is to allow the FD relay node to predict the correctly decoded symbols of each frame, based on the generalized square deviation method, and discard the erroneously decoded symbols, resulting in fewer errors...
We consider an amplify-and-forward (AF) cooperative diversity system where a source node communicates with a destination node directly and indirectly (through multiple relays). In regular multiple-relay cooperative diversity systems, all relay nodes relay the source signal using orthogonal channels (time slots, carriers, or codes) to avoid cochannel interference. Hence, for a regular cooperativ...
This paper is motivated by the observation that traditional ad hoc routing protocols are not an adequate solution for messaging applications (e.g., e-mail) in mobile ad hoc networks. Routing in ad hoc mobile networks is challenging mainly because of node mobility—the more rapid the rate of movement, the greater the fraction of bad routes and undelivered messages. For applications that can toler...
In this paper, we investigate opportunistic relay and jammer cooperation schemes in multiple-input multiple-output (MIMO) buffer-aided relay networks. The network consists of one source, an arbitrary number of relay nodes, legitimate users and eavesdroppers, with the constraints of physical layer security. We propose an algorithm to select a set of relay nodes to enhance the legitimate users’ t...
In conventional decode-and-forward (DF) one-way relay systems, a data block received at the relay node is discarded, if the information part is found to have errors after decoding. Such errors are referred to as intra-link errors in this article. However, in a setup where the relay forwards data blocks despite possible intra-link errors, the two data blocks, one from the source node and the oth...
Quality of service (QoS) routing has generally been addressed in the context of reservation-based network services (e.g. ATM, IntServ), which require explicit (out of band) signaling of reservation requests and maintenance of per-flow state information. It has been recognized that the processing of per-flow state information poses scalability problems, especially at core routers. To remedy this...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید