• Title/Summary/Keyword: Cooperative Networks

Search Result 533, Processing Time 0.023 seconds

ROI-based Video Transmission using Cooperative Diversity over Wireless Ad-hoc Networks (무선 Ad-hoc 네트워크에서 협력 다이버시티를 이용한 관심영역 중심의 비디오 전송)

  • Jang, Uk;Lee, Sang-Hoon;Bae, Kyung-Hoon
    • Journal of Broadcast Engineering
    • /
    • v.13 no.6
    • /
    • pp.951-961
    • /
    • 2008
  • Cooperative diversity is a cooperative technique which exploits user diversity by decoding the combined signal of the relayed signal and the direct signal in wireless multi-hop networks. Using the cooperation, the performance of the network system can be improved because cooperative diversity which is very strong against the fading channels can be achieved. In this paper, we propose the technique that provides the enhanced visual quality of the reconstructed video using the cooperative diversity with the FMO which is the error resilience tool of H.264/AVC standardization over wireless networks. The eye-tracker can detect the gaze point of user and transmit the gaze information to the nodes. After receiving the gaze information of user, each node performs ROI encoding according to the received gaze information. After encoding, video sources are divided into ROI and Non-ROI. Through the simulation results, the better visual quality of the reconstructed video is achieved when ROI and Non-ROI are transmitted through different channels.

A Location-Aided Cooperative Transmission Method in Mobile Ad-hoc Wireless Sensor Networks (모바일 Ad-hoc 무선 센서 네트워크에서 위치도움 협력 전송 방법)

  • Son, Dong-Hwan;Lee, Joo-Sang;An, Beongku;Kong, Hyung-Yun
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.8 no.2
    • /
    • pp.23-28
    • /
    • 2008
  • In this paper, we propose location-aided cooperative routing protocol (LACARP) for supporting power saving and stable route lifetime in mobile ad-hoc wireless sensor networks. The main ideas and features of the proposed routing protocol are as follows. First, the definition of the area of route search using location-based information to support power saving transmission. Second, the expect zone-based establishment of routing route within the area of route search. Third, the cooperative-aided transmission method. In the operation of data transmission over the established rout the datas are transmitted via both the established route and cooperative route aided by neighbor nodes. The performance evaluation using OPNET(Optimized Network Engineering Tool) shows the LACARP can improve the packet delivery ratio and power saving transmission efficiently.

  • PDF

Throughput and Delay Analysis of a Reliable Cooperative MAC Protocol in Ad Hoc Networks

  • Jang, Jaeshin;Kim, Sang Wu;Wie, Sunghong
    • Journal of Communications and Networks
    • /
    • v.14 no.5
    • /
    • pp.524-532
    • /
    • 2012
  • In this paper, we present the performance evaluation of the reliable cooperative media access control (RCO-MAC) protocol, which has been proposed in [1] by us in order to enhance system throughput in bad wireless channel environments. The performance of this protocol is evaluated with computer simulation as well as mathematical analysis in this paper. The system throughput, two types of average delays, average channel access delay, and average system delay, which includes the queuing delay in the buffer, are used as performance metrics. In addition, two different traffic models are used for performance evaluation: The saturated traffic model for computing system throughput and average channel access delay, and the exponential data generation model for calculating average system delay. The numerical results show that the RCO-MAC protocol proposed by us provides over 20% more system throughput than the relay distributed coordination function (rDCF) scheme. The numerical results show that the RCO-MAC protocol provides a slightly higher average channel access delay over a greater number of source nodes than the rDCF. This is because a greater number of source nodes provide more opportunities for cooperative request to send (CRTS) frame collisions and because the value of the related retransmission timer is greater in the RCO-MAC protocol than in the rDCF protocol. The numerical results also confirm that the RCO-MAC protocol provides better average system delay over the whole gamut of the number of source nodes than the rDCF protocol.

A study on the network coding enabled cooperative MAC protocol at Ad Hoc networks (네트워크 코딩 기능을 갖춘 협력통신용 MAC 프로토콜에 관한 연구)

  • Jang, Jae-Shin
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.13 no.9
    • /
    • pp.1819-1828
    • /
    • 2009
  • Until now, much research on cooperative communications to increase system throughput at Ad Hoc networks has been provided. In this paper, in order to enhance system throughput much more at Ad Hoc networks, a network coding-enabled new MAC protocol, called NC-MAC protocol, is proposed and its performance is evaluated with a mathematical approach. Numerical results show that this scheme provides conspicuously enhanced system throughput compared to DCF scheme, and more increased system throughput by 48% than rDCF and CO-MAC schemes.

A Genetic Algorithm for Cooperative Communication in Ad-hoc Networks (애드혹 네트워크에서 협력통신을 위한 유전 알고리즘)

  • Jang, Kil-Woong
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.18 no.1
    • /
    • pp.201-209
    • /
    • 2014
  • This paper proposes a genetic algorithm to maximize the connectivity among the mobile nodes for the cooperative communication in ad-hoc networks. In general, as the movement of the mobile nodes in the networks increases, the amount of calculation for finding the solution would be too much increased. To obtain the optimal solution within a reasonable computation time for a high-density network, we propose a genetic algorithm to obtain the optimal solution for maximizing the connectivity. In order to make a search more efficient, we propose some efficient neighborhood generating operations of the genetic algorithm. We evaluate those performances through some experiments in terms of the maximum number of connections and the execution time of the proposed algorithm. The comparison results show that the proposed algorithm outperforms other existing algorithms.

A Simple Cooperative Transmission Protocol for Energy-Efficient Broadcasting Over Multi-Hop Wireless Networks

  • Kailas, Aravind;Thanayankizil, Lakshmi;Ingram, Mary Ann
    • Journal of Communications and Networks
    • /
    • v.10 no.2
    • /
    • pp.213-220
    • /
    • 2008
  • This paper analyzes a broadcasting technique for wireless multi-hop sensor networks that uses a form of cooperative diversity called opportunistic large arrays (OLAs). We propose a method for autonomous scheduling of the nodes, which limits the nodes that relay and saves as much as 32% of the transmit energy compared to other broadcast approaches, without requiring global positioning system (GPS), individual node addressing, or inter-node interaction. This energy-saving is a result of cross-layer interaction, in the sense that the medium access control (MAC) and routing functions are partially executed in the physical (PHY) layer. Our proposed method is called OLA with a transmission threshold (OLA-T), where a node compares its received power to a threshold to decide if it should forward. We also investigate OLA with variable threshold (OLA-VT), which optimizes the thresholds as a function of level. OLA-T and OLA-VT are compared with OLA broadcasting without a transmission threshold, each in their minimum energy configuration, using an analytical method under the orthogonal and continuum assumptions. The trade-off between the number of OLA levels (or hops) required to achieve successful network broadcast and transmission energy saved is investigated. The results based on the analytical assumptions are confirmed with Monte Carlo simulations.

Energy-Efficiency and Transmission Strategy Selection in Cooperative Wireless Sensor Networks

  • Zhang, Yanbing;Dai, Huaiyu
    • Journal of Communications and Networks
    • /
    • v.9 no.4
    • /
    • pp.473-481
    • /
    • 2007
  • Energy efficiency is one of the most critical concerns for wireless sensor networks. By allowing sensor nodes in close proximity to cooperate in transmission to form a virtual multiple-input multiple-output(MIMO) system, recent progress in wireless MIMO communications can be exploited to boost the system throughput, or equivalently reduce the energy consumption for the same throughput and BER target. However, these cooperative transmission strategies may incur additional energy cost and system overhead. In this paper, assuming that data collectors are equipped with antenna arrays and superior processing capability, energy efficiency of relevant traditional and cooperative transmission strategies: Single-input-multiple-output(SIMO), space-time block coding(STBC), and spatial multiplexing(SM) are studied. Analysis in the wideband regime reveals that, while receive diversity introduces significant improvement in both energy efficiency and spectral efficiency, further improvement due to the transmit diversity of STBC is limited, as opposed to the superiority of the SM scheme especially for non-trivial spectral efficiency. These observations are further confirmed in our analysis of more realistic systems with limited bandwidth, finite constellation sizes, and a target error rate. Based on this analysis, general guidelines are presented for optimal transmission strategy selection in system level and link level, aiming at minimum energy consumption while meeting different requirements. The proposed selection rules, especially those based on system-level metrics, are easy to implement for sensor applications. The framework provided here may also be readily extended to other scenarios or applications.

Differential Game Theoretic Approach for Distributed Dynamic Cooperative Power Control in Cognitive Radio Ad Hoc Networks

  • Zhang, Long;Huang, Wei;Wu, Qiwu;Cao, Wenjing
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.10
    • /
    • pp.3810-3830
    • /
    • 2015
  • In this paper, we investigate the differential game theoretic approach for distributed dynamic cooperative power control in cognitive radio ad hoc networks (CRANETs). First, a payoff function is defined by taking into consideration the tradeoff between the stock of accumulated power interference to the primary networks and the dynamic regulation of the transmit power of secondary users (SUs). Specifically, the payoff function not only reflects the tradeoff between the requirement for quickly finding the stable available spectrum opportunities and the need for better channel conditions, but also reveals the impact of the differentiated types of data traffic on the demand of transmission quality. Then the dynamic power control problem is modeled as a differential game model. Moreover, we convert the differential game model into a dynamic programming problem to obtain a set of optimal strategies of SUs under the condition of the grand coalition. A distributed dynamic cooperative power control algorithm is developed to dynamically adjust the transmit power of SUs under grand coalition. Finally, numerical results are presented to demonstrate the effectiveness of the proposed algorithm for efficient power control in CRANETs.

Combined Relay Selection and Cooperative Beamforming for Physical Layer Security

  • Kim, Jun-Su;Ikhlef, Aissa;Schober, Robert
    • Journal of Communications and Networks
    • /
    • v.14 no.4
    • /
    • pp.364-373
    • /
    • 2012
  • In this paper, we propose combined relay selection and cooperative beamforming schemes for physical layer security. Generally, high operational complexity is required for cooperative beamforming withmultiple relays because of the required information exchange and synchronization among the relays. On the other hand, while it is desirable to reduce the number of relays participating in cooperative beamforming because of the associated complexity problem, doing so may degrade the coding gain of cooperative beamforming. Hence, we propose combined relay selection and cooperative beamforming schemes, where only two of the available relays are selected for beamforming and data transmission. The proposed schemes introduce a selection gain which partially compensates for the decrease in coding gain due to limiting the number of participating relays to two. Both the cases where full and only partial channel state information are available for relay selection and cooperative beamforming are considered. Analytical and simulation results for the proposed schemes show improved secrecy capacities compared to existing physical layer security schemes employing cooperative relays.

Cooperative Node Selection for the Cognitive Radio Networks (인지무선 네트워크를 위한 협력 노드 선택 기법)

  • Gao, Xiang;Lee, Juhyeon;Park, Hyung-Kun
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.17 no.2
    • /
    • pp.287-293
    • /
    • 2013
  • Cognitive radio has been recently proposed to dynamically access unused-spectrum. The CR users can share the same frequency band with the primary user without interference to each other. Usually each CR user needs to determine spectrum availability by itself depending only on its local observations. But uncertainty communication environment effects can be mitigated so that the detection probability is improved in a heavily shadowed environment. Soft detection is a primary user detection method of cooperative cognitive radio networks. In our research, we will improve system detection probability by using optimal cooperative node selection algorithm. New algorithm can find optimal number of cooperative sensing nodes for cooperative soft detection by using maximum ratio combining (MRC) method. Through analysis, proposed cooperative node selection algorithm can select optimal node for cooperative sensing according to the system requirement and improve the system detection probability.