• Title/Summary/Keyword: cooperative networks

Search Result 531, Processing Time 0.032 seconds

A Study on Cooperative Based Location Estimation Algorithm in Wireless Sensor Networks (무선 센서 네트워크에서 상호 협력 기반 위치추정 알고리즘 연구)

  • Jeong, Seung-Heui;Lee, Hyun-Jae;Oh, Chang-Heon
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2008.05a
    • /
    • pp.857-860
    • /
    • 2008
  • In this paper, we proposed cooperative based localization algorithm for wireless sensor networks, which can estimate to unknown node position using received signal strength table set. The unknown nodes are monitor to RSS from neighbor nodes and exclude existence possibility area of sensor node in sensor field. Finally, we can calculate the centroid position for each unknown node with cooperative localization algorithm. Furthermore, these processes are applied iteratively about all nodes which is recorded to RSS table and can estimate for unknown nodes.

  • PDF

Hybrid TOA/AOA Cooperative Mobile Localization in 4G Cellular Networks

  • Wu, Shixun;Wang, Shuliang;Xu, Kai;Wang, Honggang
    • IEIE Transactions on Smart Processing and Computing
    • /
    • v.2 no.2
    • /
    • pp.77-85
    • /
    • 2013
  • this study examined hybrid Time of Arrival/Angle of Arrival (TOA/AOA) localization technique in a cellular network. Based on the linearized equations from the TOA and AOA measurements, the weighted least square (WLS) method is proposed to obtain the location estimation of a mobile station (MS) by analyzing the statistical properties of the error vector in Line of Sight (LOS) and Non-line of Sight (NLOS) environments, respectively. Moreover, the precise expression of the Cramer-Rao lower bound (CRLB) for hybrid TOA/AOA measurements in different LOS/NLOS conditions was derived when the LOS error is a Gaussian variable and the NLOS error is an exponential variable. The idea of cooperative localization is proposed based on the additional information from short-range communication among the MSs in fourth generation (4G) cellular networks. Therefore, the proposed hybrid TOA/AOA WLS method can be improved further with the cooperative scheme. The simulation results show that the hybrid TOA/AOA method has better performance than the TOA only method, particularly when the AOA measurements are accurate. Moreover, the performance of the hybrid TOA/AOA method can be improved further by the cooperative scheme.

  • PDF

Resource Allocation for Cooperative Relay based Wireless D2D Networks with Selfish Users

  • Niu, Jinxin;Guo, Wei
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.6
    • /
    • pp.1996-2013
    • /
    • 2015
  • This paper considers a scenario that more D2D users exist in the cell, they compete for cellular resources to increase their own data rates, which may cause transmission interference to cellular users (CU) and the unfairness of resource allocation. We design a resource allocation scheme for selfish D2D users assisted by cooperative relay technique which is used to further enhance the users' transmission rates, meanwhile guarantee the QoS requirement of the CUs. Two transmission modes are considered for D2D users: direct transmission mode and cooperative relay transmission mode, both of which reuses the cellular uplink frequency resources. To ensure the fairness of resource distribution, Nash bargaining theory is used to determine the transmission mode and solve the bandwidth allocation problem for D2D users choosing cooperative relay transmission mode, and coalition formation game theory is used to solve the uplink frequency sharing problem between D2D users and CUs through a new defined "Selfish order". Through theoretical analysis, we obtain the closed Nash bargaining solution under CUs' rate constraints, and prove the stability of the formatted coalition. Simulation results show that the proposed resource allocation approach achieves better performance on resource allocation fairness, with only little sacrifice on the system sum rates.

Performance Analysis of the Cooperative Localization Algorithm with Virtual Reference Nodes in Wireless Sensor Networks (무선 센서네트워크 환경에서 VRN을 이용한 협력 위치추정 알고리즘의 성능 분석)

  • Jeong, Seung-Heui;Oh, Chang-Heon
    • Journal of Advanced Navigation Technology
    • /
    • v.12 no.6
    • /
    • pp.619-626
    • /
    • 2008
  • In this paper, we proposed a RSS based cooperative localization algorithm using VRN for wireless sensor networks, which can estimate the BN position. The proposed localization system monitoring all nodes estimates a position of BN, and calculates an intersection area with cooperative localization. From the results, we confirm that BN intersection area is reduced as the number of RN is increased. In addition, the fewer RN exists, the more iteration needs at least 4 times. Moreover, the propose algorithm using 4 RNs is improved 71.6% estimation performance than conventional method. Therefore, the cooperative localization algorithm with VRN provides higher localization accuracy than RSS based conventional method.

  • PDF

Robust Cooperative Relay Beamforming Design for Security

  • Gong, Xiangwu;Dong, Feihong;Li, Hongjun;Shao, Wei
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.11
    • /
    • pp.4483-4501
    • /
    • 2015
  • In this paper, we investigate a security transmission scheme at the physical layer for cooperative wireless relay networks in the presence of a passive eavesdropper. While the security scheme has been previously investigated with perfect channel state information(CSI) in the presence of a passive eavesdropper, this paper focuses on researching the robust cooperative relay beamforming mechanism for wireless relay networks which makes use of artificial noise (AN) to confuse the eavesdropper and increase its uncertainty about the source message. The transmit power used for AN is maximized to degrade the signal-to-interference-plus-noise-ratio (SINR) level at the eavesdropper, while satisfying the individual power constraint of each relay node and worst-case SINR constraint at the desired receiver under a bounded spherical region for the norm of the CSI error vector from the relays to the destination. Cooperative beamforming weight vector in the security scheme can be obtained by using S-Procedure and rank relaxation techniques. The benefit of the proposed scheme is showed in simulation results.

Tradeoff between Energy-Efficiency and Spectral-Efficiency by Cooperative Rate Splitting

  • Yang, Chungang;Yue, Jian;Sheng, Min;Li, Jiandong
    • Journal of Communications and Networks
    • /
    • v.16 no.2
    • /
    • pp.121-129
    • /
    • 2014
  • The trend of an increasing demand for a high-quality user experience, coupled with a shortage of radio resources, has necessitated more advanced wireless techniques to cooperatively achieve the required quality-of-experience enhancement. In this study, we investigate the critical problem of rate splitting in heterogeneous cellular networks, where concurrent transmission, for instance, the coordinated multipoint transmission and reception of LTE-A systems, shows promise for improvement of network-wide capacity and the user experience. Unlike most current studies, which only deal with spectral efficiency enhancement, we implement an optimal rate splitting strategy to improve both spectral efficiency and energy efficiency by exploring and exploiting cooperation diversity. First, we introduce the motivation for our proposed algorithm, and then employ the typical cooperative bargaining game to formulate the problem. Next, we derive the best response function by analyzing the dual problem of the defined primal problem. The existence and uniqueness of the proposed cooperative bargaining equilibrium are proved, and more importantly, a distributed algorithm is designed to approach the optimal unique solution under mild conditions. Finally, numerical results show a performance improvement for our proposed distributed cooperative rate splitting algorithm.

Layer based Cooperative Relaying Algorithm for Scalable Video Transmission over Wireless Video Sensor Networks (무선 비디오 센서 네트워크에서 스케일러블 비디오 전송을 위한 계층 기반 협업 중계 알고리즘*)

  • Ha, Hojin
    • Journal of Korea Society of Digital Industry and Information Management
    • /
    • v.18 no.4
    • /
    • pp.13-21
    • /
    • 2022
  • Recently, in wireless video sensor networks(WVSN), various schemes for efficient video data transmission have been studied. In this paper, a layer based cooperative relaying(LCR) algorithm is proposed for minimizing scalable video transmission distortion from packet loss in WVSN. The proposed LCR algorithm consists of two modules. In the first step, a parameter based error propagation metric is proposed to predict the effect of each scalable layer on video quality degradation at low complexity. In the second step, a layer-based cooperative relay algorithm is proposed to minimize distortion due to packet loss using the proposed error propagation metric and channel information of the video sensor node and relay node. In the experiment, the proposed algorithm showed that the improvement of peak signal-to-noise ratio (PSNR) in various channel environments, compared to the previous algorithm(Energy based Cooperative Relaying, ECR) without considering the metric of error propagation.The proposed LCR algorithm minimizes video quality degradation from packet loss using both the channel information of relaying node and the amount of layer based error propagation in scalable video.

Cooperative Analog and Digital (CANDI) Time Synchronization for Large Multihop Network (다중 홉 네트워크를 위한 디지털 및 아날로그 협동 전송 시간 동기화 프로토콜)

  • Cho, Sung-Hwan;Ingram, Mary Ann
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37C no.11
    • /
    • pp.1084-1093
    • /
    • 2012
  • For large multihop networks, large time synchronization (TS) errors can accumulate with conventional methods, such as TPSN, RBS, and FTSP, since they need a large number of hops to cover the network. In this paper, a method combining Concurrent Cooperative Transmission (CCT) and Semi- Cooperative Spectrum Fusion (SCSF) is proposed to reduce the number of hops to cover the large network. In CCT, cooperating nodes transmit the same digitally encoded message in orthogonal channels simultaneously, so receivers can benefit from array and diversity gains. SCSF is an analog cooperative transmission method where different cooperators transmit correlated information simultaneously. The two methods are combined to create a new distributed method of network TS, called the Cooperative Analog and Digital (CANDI) TS protocol, which promises significantly lower network TS errors in multi-hop networks. CANDI and TPSN are compared in simulation for a line network.

Clustering-based Cooperative Routing using OFDM for Supporting Transmission Efficiency in Mobile Wireless Sensor Networks (모바일 무선 센서네트워크에서 전송 효율 향상을 지원하기 위한 OFDM을 사용한 클러스터링 기반의 협력도움 라우팅)

  • Lee, Joo-Sang;An, Beong-Ku
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.10 no.6
    • /
    • pp.85-92
    • /
    • 2010
  • In this paper, we propose a Clustering-based Cooperative Routing using OFDM (CCRO) for supporting transmission efficiency in mobile wireless sensor networks. The main features and contributions of the proposed method are as follows. First, the clustering method which uses the location information of nodes as underlying infrastructure for supporting stable transmission services efficiently is used. Second, cluster-based cooperative data transmission method is used for improving data transmission and reliability services. Third, OFDM based data transmission method is used for improving data transmission ratio with channel efficiency. Fourth, we consider realistic approach in the view points of the mobile ad-hoc wireless sensor networks while conventional methods just consider fixed sensor network environments. The performance evaluation of the proposed method is performed via simulation using OPNET and theoretical analysis. The results of performance evaluation show improvement of transmission efficiency.

Relay Selection Scheme Based on Quantum Differential Evolution Algorithm in Relay Networks

  • Gao, Hongyuan;Zhang, Shibo;Du, Yanan;Wang, Yu;Diao, Ming
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.7
    • /
    • pp.3501-3523
    • /
    • 2017
  • It is a classical integer optimization difficulty to design an optimal selection scheme in cooperative relay networks considering co-channel interference (CCI). In this paper, we solve single-objective and multi-objective relay selection problem. For the single-objective relay selection problem, in order to attain optimal system performance of cooperative relay network, a novel quantum differential evolutionary algorithm (QDEA) is proposed to resolve the optimization difficulty of optimal relay selection, and the proposed optimal relay selection scheme is called as optimal relay selection based on quantum differential evolutionary algorithm (QDEA). The proposed QDEA combines the advantages of quantum computing theory and differential evolutionary algorithm (DEA) to improve exploring and exploiting potency of DEA. So QDEA has the capability to find the optimal relay selection scheme in cooperative relay networks. For the multi-objective relay selection problem, we propose a novel non-dominated sorting quantum differential evolutionary algorithm (NSQDEA) to solve the relay selection problem which considers two objectives. Simulation results indicate that the proposed relay selection scheme based on QDEA is superior to other intelligent relay selection schemes based on differential evolutionary algorithm, artificial bee colony optimization and quantum bee colony optimization in terms of convergence speed and accuracy for the single-objective relay selection problem. Meanwhile, the simulation results also show that the proposed relay selection scheme based on NSQDEA has a good performance on multi-objective relay selection.