• Title/Summary/Keyword: Relay node selection

Search Result 74, Processing Time 0.023 seconds

An Efficient Power Allocaction Scheme to Maximize Network Lifetime in Wireless Relay Networks with Energy Contraint (전송 용량 제한조건을 가진 무선 중계 네트워크의 수명을 최대화하는 효율적인 전송 전력 할당 기법)

  • Park, Dae-Jun;Kim, Hyung-Myung
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.7A
    • /
    • pp.660-668
    • /
    • 2010
  • In energy resource constrained networks, the network lifetime can be enhanced by optimally allocating energy resource among users based on the available channel state information and the residual energy information at each node. In this paper, we propose the relay selection scheme and power allocation scheme to maximize the network lifetime in wireless relay networks with capacity constraint. The computer simulation results show that the proposed scheme increase the network lifetime in comparison to the conventional schemes.

Relay node selection algorithm consuming minimum power of MIMO integrated MANET

  • Chowdhuri, Swati;Banerjee, Pranab;Chaudhuri, Sheli Sinha
    • Advances in Computational Design
    • /
    • v.3 no.2
    • /
    • pp.191-200
    • /
    • 2018
  • Establishment of an efficient routing technique in multiple-input-multiple-output (MIMO) based mobile ad hoc network (MANET) is a new challenge in wireless communication system to communicate in a complex terrain where permanent infrastructure network implementation is not possible. Due to limited power of mobile nodes, a minimum power consumed routing (MPCR) algorithm is developed which is an integration of cooperative transmission process. This algorithm select relay node and support short distance communication. The performance analysis of proposed routing algorithm increased signal to noise interference ratio (SNIR) resulting effect of cooperative transmission. Finally performance analysis of the proposed algorithm is verified with simulated result.

Design of SoQ-based Cooperative Communication Protocol for UWB-based Distributed MAC/WUSB Systems (UWB 기반 Distributed MAC 시스템을 위한 SoQ 기반 협력 통신 프로토콜 설계)

  • Hur, Kyeong
    • Journal of Korea Multimedia Society
    • /
    • v.15 no.3
    • /
    • pp.345-355
    • /
    • 2012
  • The WiMedia Alliance has specified a Distributed Medium Access Control (D-MAC)/WUSB protocol based on UWB for high speed wireless home networks and WPANs. In this paper, we propose a novel SoQ-based cooperative communication protocol adaptive to current UWB link transmission rate and QoS measure. The proposed SoQ-based cooperative communication protocol has compatibility with current WiMedia D-MAC/Wireless USB standard and is executed at each device according to a SoQ-based Relay Node Selection (RNS) criterion.

Analysis of Antenna Selection in Two-way Relaying MIMO Systems with CPM Modulation

  • Lei, Guowei;Chen, Hailan;Liu, Yuanan
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.15 no.3
    • /
    • pp.1140-1155
    • /
    • 2021
  • Up to now, many state-of-arts have been proposed for two-way relaying system with linear modulations. The performances of antenna selection (AS) at both transmit and relay nodes need to be investigated in some two-way relaying multiple-input multiple-output (TWRM) systems. In this paper, the goal is focused on the study of nonlinear modulations, i.e., continuous phase modulation (CPM) in TWRM systems. Firstly, the joint phase trellis are simplified by reversed Rimoldi processing so as to reduce the systems' complexity. Then the performances of joint transmit and receive antenna selection (JTRAS) with CPM modulations in two-way relaying MIMO systems are analyzed. More exactly, the pair wise probability (PEP) is used to evaluate the error performance based on the CPM signal matrix, which is calculated in terms of Laurent expression. Since the channels subject to two terminal nodes share common antennas at relay node R in multiple-access scheme, we revise the JTRAS algorithm and compare it to existing algorithm via simulation. Finally, the error performances for various schemes of antenna selection are simulated and compared to the analysis in this paper.

Power Allocation and Mode Selection in Unmanned Aerial Vehicle Relay Based Wireless Networks

  • Zeng, Qian;Huangfu, Wei;Liu, Tong
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.13 no.2
    • /
    • pp.711-732
    • /
    • 2019
  • Many unmanned aerial vehicle (UAV) applications have been employed for performing data collection in facilitating tasks such as surveillance and monitoring objectives in remote and dangerous environments. In light of the fact that most of the existing UAV relaying applications operate in conventional half-duplex (HD) mode, a full-duplex (FD) based UAV relay aided wireless network is investigated, in which the UAV relay helps forwarding information from the source (S) node to the destination (D). Since the activated UAV relays are always floating and flying in the air, its channel state information (CSI) as well as channel capacity is a time-variant parameter. Considering decode-and-forward (DF) relaying protocol in UAV relays, the cooperative relaying channel capacity is constrained by the relatively weaker one (i.e. in terms of signal-to-noise ratio (SNR) or signal-to-interference-plus-noise ratio (SINR)) between S-to-relay and relay-to-D links. The channel capacity can be optimized by adaptively optimizing the transmit power of S and/or UAV relay. Furthermore, a hybrid HD/FD mode is enabled in the proposed UAV relays for adaptively optimizing the channel utilization subject to the instantaneous CSI and/or remaining self-interference (SI) levels. Numerical results show that the channel capacity of the proposed UAV relay aided wireless networks can be maximized by adaptively responding to the influence of various real-time factors.

HESnW: History Encounters-Based Spray-and-Wait Routing Protocol for Delay Tolerant Networks

  • Gan, Shunyi;Zhou, Jipeng;Wei, Kaimin
    • Journal of Information Processing Systems
    • /
    • v.13 no.3
    • /
    • pp.618-629
    • /
    • 2017
  • Mobile nodes can't always connect each other in DTNs (delay tolerant networks). Many DTN routing protocols that favor the "multi-hop forwarding" are proposed to solve these network problems. But they also lead to intolerant delivery cost so that designing a overhead-efficient routing protocol which is able to perform well in delivery ratio with lower delivery cost at the same time is valuable. Therefore, we utilize the small-world property and propose a new delivery metric called multi-probability to design our relay node selection principles that nodes with lower delivery predictability can also be selected to be the relay nodes if one of their history nodes has higher delivery predictability. So, we can find more potential relay nodes to reduce the forwarding overhead of successfully delivered messages through our proposed algorithm called HESnW. We also apply our new messages copies allocation scheme to optimize the routing performance. Comparing to existing routing algorithms, simulation results show that HESnW can reduce the delivery cost while it can also obtain a rather high delivery ratio.

A Study of Optimal path Availability Clustering algorithm in Ad Hoc network (에드 혹 네트워크에서 최적 경로의 유효성 있는 클러스터링 알고리즘에 관한 연구)

  • Oh, Young-Jun;Lee, Kang-Whan
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.17 no.1
    • /
    • pp.225-232
    • /
    • 2013
  • In this paper, we introduce a method that can be used to select the position of head node for context-awareness information. The validity of the head node optimal location is saving the energy in the path according to the clustering. It is important how to elect one of the relay node for energy efficiency routing. Existing LEACH algorithm to elect the head node when the node's energy probability distribution function based on the management of the head node is optional cycle. However, in this case, the distance of the relay node status information including context-awareness parameters does not reflect. These factors are not suitable for the relay node or nodes are included in the probability distribution during the head node selects occurs. In particular, to solve the problems from the LEACH-based hierarchical clustering algorithms, this study defines location with the status context information and the residual energy factor in choosing topology of the structure adjacent nodes. The proposed ECOPS (Energy Conserving Optimal path Schedule) algorithm that contextual information is contributed for head node selection in topology protocols. This proposed algorithm has the head node replacement situations from the candidate head node in the optimal path and efficient energy conservation that is the path of the member nodes. The new head node election technique show improving the entire node lifetime and network in management the network from simulation results.

Pre-cluster HEAD Selection Scheme based on Node Distance in Chain-Based Protocol (체인기반 프로토콜에서 노드의 거리에 따른 예비 헤드노드 선출 방법)

  • Kim, Hyun-Duk;Choi, Won-Ik
    • Journal of Korea Multimedia Society
    • /
    • v.12 no.9
    • /
    • pp.1273-1287
    • /
    • 2009
  • PEGASIS, a chain-based protocol, forms chains from sensor nodes so that each node transmits and receives from a neighbor. In this way, only one node (known as a HEAD) is selected from that chain to transmit to the sink. Although PEGASIS is able to balance the workload among all of the nodes by selecting the HEAD node in turn, a considerable amount of energy may be wasted when nodes which are far away from sink node act as the HEAD. In this study, DERP (Distance-based Energy-efficient Routing Protocol) is proposed to address this problem. DERP is a chain-based protocol that improves the greedy-algorithm in PEGASIS by taking into account the distance from the HEAD to the sink node. The main idea of DERP is to adopt a pre-HEAD (P-HD) to distribute the energy load evenly among sensor nodes. In addition, to scale DERP to a large network, it can be extended to a multi-hop clustering protocol by selecting a "relay node" according to the distance between the P-HD and SINK. Analysis and simulation studies of DERP show that it consumes up to 80% less energy, and has less of a transmission delay compared to PEGASIS.

  • PDF

Sensing and Compression Rate Selection with Energy-Allocation in Solar-Powered Wireless Sensor Networks

  • Yoon, Ikjune
    • Journal of the Korea Society of Computer and Information
    • /
    • v.22 no.5
    • /
    • pp.81-88
    • /
    • 2017
  • Solar-powered wireless sensor nodes can use extra energy to obtain additional data to increase the precision. However, if the amount of data sensed is increased indiscriminately, the overhead of relay nodes may increase, and their energy may be exhausted. In this paper, we introduce a sensing and compression rate selection scheme to increase the amount of data obtained while preventing energy exhaustion. In this scheme, the neighbor nodes of the sink node determine the limit of data to be transmitted according to the allocated energy and their descendant nodes, and the other nodes select a compression algorithm appropriate to the allocated energy and the limitation of data to be transmitted. A simulation result verifies that the proposed scheme gathers more data with a lower number of blackout nodes than other schemes. We also found that it adapts better to changes in node density and the amount of energy harvested.

A Node Deployment Strategy Considering Environmental Factors and the Number of Nodes in Surveillance and Reconnaissance Sensor Network (감시정찰 센서네트워크에서 환경요소와 노드수량을 고려한 노드 배치 전략)

  • Kim, Yong-Hyun;Chung, Kwang-Sue
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.36 no.12B
    • /
    • pp.1670-1679
    • /
    • 2011
  • In the area of wireless sensor networks, sensor coverage and network connectivity problems are caused by a limited detection range and the communication distance of the nodes. To solve the coverage and connectivity problems, many studies are suggested, but most research is restricted to apply into the real environment because they didn't consider various environmental factors on wireless sensor network deployment. So in this paper, we propose a node deployment strategy considering environmental factors and the number of nodes in surveillance and reconnaissance sensor networks(SRSN). The proposed node deployment method divides the installation of the surveillance and reconnaissance sensor networks system into four steps such as identification of influences factors for node placement through IPB process, sensor node deployment based on sensing range, selection of monitoring site, and relay node deployment based on RF communication range. And it deploys the sensor nodes and relay nodes considered the features of the surveillance and reconnaissance sensor network system and environmental factors. The result of simulation indicates that the proposed node deployment method improves sensor coverage and network connectivity.