• 제목/요약/키워드: Rate-Aware Resource Allocation

검색결과 8건 처리시간 0.021초

Social-Aware Resource Allocation Based on Cluster Formation and Matching Theory in D2D Underlaying Cellular Networks

  • Zhuang, Wenqin;Chen, Mingkai;Wei, Xin;Li, Haibo
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제14권5호
    • /
    • pp.1984-2002
    • /
    • 2020
  • With the appearance of wireless spectrum crisis in traditional cellular network, device-to-device (D2D) communication has been regarded as a promising solution to ease heavy traffic burden by enabling precise content delivery among mobile users. However, due to the channel sharing, the interference between D2D and cellular users can affect the transmission rate and narrow the throughput in the network. In this paper, we firstly present a weighted interference minimization cluster formation model involving both social attribute and physical closeness. The weighted-interference, which is evaluated under the susceptible-infected(SI) model, is utilized to gather user in social and physical proximity. Then, we address the cluster formation problem via spectrum clustering with iterative operation. Finally, we propose the stable matching theory algorithm in order to maximize rate oriented to accomplish the one-to-one resource allocation. Numerical results show that our proposed scheme acquires quite well clustering effect and increases the accumulative transmission rate compared with the other two advanced schemes.

Energy-aware Virtual Resource Mapping Algorithm in Wireless Data Center

  • Luo, Juan;Fu, Shan;Wu, Di
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제8권3호
    • /
    • pp.819-837
    • /
    • 2014
  • Data centers, which implement cloud service, have been faced up with quick growth of energy consumption and low efficiency of energy. 60GHz wireless communication technology, as a new option to data centers, can provide feasible approach to alleviate the problems. Aiming at energy optimization in 60GHz wireless data centers (WDCs), we investigate virtualization technology to assign virtual resources to minimum number of servers, and turn off other servers or adjust them to the state of low power. By comprehensive analysis of wireless data centers, we model virtual network and physical network in WDCs firstly, and propose Virtual Resource Mapping Packing Algorithm (VRMPA) to solve energy management problems. According to VRMPA, we adopt packing algorithm and sort physical resource only once, which improves efficiency of virtual resource allocation. Simulation results show that, under the condition of guaranteeing network load, VPMPA algorithm can achieve better virtual request acceptance rate and higher utilization rate of energy consumption.

QoSCM: QoS-aware Coded Multicast Approach for Wireless Networks

  • Mohajer, Amin;Barari, Morteza;Zarrabi, Houman
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제10권12호
    • /
    • pp.5191-5211
    • /
    • 2016
  • It is essential to satisfy class-specific QoS constraints to provide broadband services for new generation networks. The present study proposes a QoS-driven multicast scheme for wireless networks in which the transmission rate and end-to-end delay are assumed to be bounded during a multiple multicast session. A distributed algorithm was used to identify a cost-efficient sub-graph between the source and destination which can satisfy QoS constraints of a multicast session. The model was then modified as to be applied for wireless networks in which satisfying interference constraints is the main challenge. A discrete power control scheme was also applied for the QoS-aware multicast model to accommodate the effect of transmission power level based on link capacity requirements. We also proposed random power allocation (RPA) and gradient power allocation (GPA) algorithms to efficient resource distribution each of which has different time complexity and optimality levels. Experimental results confirm that the proposed power allocation techniques decrease the number of unavailable links between intermediate nodes in the sub-graph and considerably increase the chance of finding an optimal solution.

저비용 선박간 통신을 위한 전송률 인지 양방향 릴레이 기법 (Rate-Aware Two-Way Relaying for Low-Cost Ship-to-Ship Communications)

  • 왕진수;김선용;정민아;이성로;김윤희
    • 한국통신학회논문지
    • /
    • 제39C권8호
    • /
    • pp.651-659
    • /
    • 2014
  • 본 논문은 선단 내 해상 통신에서 두 통신 선박이 다중 안테나 릴레이 선박의 도움으로 데이터를 교환하는 양방향 릴레이 네트워크를 고려한다. 상기 네트워크에서 두 통신 선박의 정보 전송률이 다를 때 정보 전송 신뢰도를 높이는 전송률 인지 세 단계 아날로그 네트워크 부호화 기법을 제안한다. 제안 기법은 릴레이에서 직교하게 수신된 각 통신 선박의 신호로부터 향상된 품질의 아날로그 네트워크 부호화 신호를 안테나 수신 전력만을 이용하여 생성함으로써 릴레이를 채널 추정 기능 없이 낮은 복잡도로 구현할 수 있도록 한다. 또한, 제안 기법은 두 통신 선박의 서로 다른 전송률을 고려한 전송률-인지 릴레이 전력 할당 방법을 적용하여 비대칭 전송률을 갖는 데이터 교환의 아웃티지 확률을 크게 줄일 수 있음을 모의실험으로 보였다.

Computation Controllable Mode Decision and Motion Estimation for Scalable Video Coding

  • Zheng, Liang-Wei;Li, Gwo-Long;Chen, Mei-Juan;Yeh, Chia-Hung;Tai, Kuang-Han;Wu, Jian-Sheng
    • ETRI Journal
    • /
    • 제35권3호
    • /
    • pp.469-479
    • /
    • 2013
  • This paper proposes an efficient computation-aware mode decision and search point (SP) allocation algorithm for spatial and quality scalabilities in Scalable Video Coding. In our proposal, a linear model is derived to allocate the computation for macroblocks in enhancement layers by using the rate distortion costs of the base layer. In addition, an adaptive SP decision algorithm is proposed to decide the number of SPs for motion estimation under the constraint of the allocated computation. Experiment results demonstrate that the proposed algorithm allocates the computation resource efficiently and outperforms other works in rate distortion performance under the same computational availability constraint.

Protocol-Aware Radio Frequency Jamming inWi-Fi and Commercial Wireless Networks

  • Hussain, Abid;Saqib, Nazar Abbas;Qamar, Usman;Zia, Muhammad;Mahmood, Hassan
    • Journal of Communications and Networks
    • /
    • 제16권4호
    • /
    • pp.397-406
    • /
    • 2014
  • Radio frequency (RF) jamming is a denial of service attack targeted at wireless networks. In resource-hungry scenarios with constant traffic demand, jamming can create connectivity problems and seriously affect communication. Therefore, the vulnerabilities of wireless networks must be studied. In this study, we investigate a particular type of RF jamming that exploits the semantics of physical (PHY) and medium access control (MAC) layer protocols. This can be extended to any wireless communication network whose protocol characteristics and operating frequencies are known to the attacker. We propose two efficient jamming techniques: A low-data-rate random jamming and a shot-noise based protocol-aware RF jamming. Both techniques use shot-noise pulses to disrupt ongoing transmission ensuring they are energy efficient, and they significantly reduce the detection probability of the jammer. Further, we derived the tight upper bound on the duration and the number of shot-noise pulses for Wi-Fi, GSM, and WiMax networks. The proposed model takes consider the channel access mechanism employed at the MAC layer, data transmission rate, PHY/MAC layer modulation and channel coding schemes. Moreover, we analyze the effect of different packet sizes on the proposed jamming methodologies. The proposed jamming attack models have been experimentally evaluated for 802.11b networks on an actual testbed environment by transmitting data packets of varying sizes. The achieved results clearly demonstrate a considerable increase in the overall jamming efficiency of the proposed protocol-aware jammer in terms of packet delivery ratio, energy expenditure and detection probabilities over contemporary jamming methods provided in the literature.

마켓 기반 계산 그리드를 위한 SLA 인지형 스케줄링 기법 (SLA-Aware Scheduling Scheme for Market-based Computational Grid)

  • 한영주;;윤찬현
    • 한국정보처리학회:학술대회논문집
    • /
    • 한국정보처리학회 2011년도 춘계학술발표대회
    • /
    • pp.220-223
    • /
    • 2011
  • For successfully commercialized grid systems, it is required to provide an efficient scheduling scheme which is able to optimize benefits for three participants such as consumers, brokers, and providers so that every participant has sufficient benefit to maintain a sustainable market. In this paper, we define this job scheduling problem as an objective optimization problem for three participants. The three objectives are to maximize the success rate of job execution, total achieved profit, and the system utilization. To address the scheduling problem, we propose heuristics referred to as SLA-aware scheduling scheme (SA) for optimal resource allocation. The simulation results show that the improvement and the effectiveness of the proposed scheme and the proposed scheme can outperform well-known scheduling schemes such as first come first serve (FCFS), shortest job first (SJF), and earliest deadline first (EDF).

Exploring the dynamic knowledge structure of studies on the Internet of things: Keyword analysis

  • Yoon, Young Seog;Zo, Hangjung;Choi, Munkee;Lee, Donghyun;Lee, Hyun-woo
    • ETRI Journal
    • /
    • 제40권6호
    • /
    • pp.745-758
    • /
    • 2018
  • A wide range of studies in various disciplines has focused on the Internet of Things (IoT) and cyber-physical systems (CPS). However, it is necessary to summarize the current status and to establish future directions because each study has its own individual goals independent of the completion of all IoT applications. The absence of a comprehensive understanding of IoT and CPS has disrupted an efficient resource allocation. To assess changes in the knowledge structure and emerging technologies, this study explores the dynamic research trends in IoT by analyzing bibliographic data. We retrieved 54,237 keywords in 12,600 IoT studies from the Scopus database, and conducted keyword frequency, co-occurrence, and growth-rate analyses. The analysis results reveal how IoT technologies have been developed and how they are connected to each other. We also show that such technologies have diverged and converged simultaneously, and that the emerging keywords of trust, smart home, cloud, authentication, context-aware, and big data have been extracted. We also unveil that the CPS is directly involved in network, security, management, cloud, big data, system, industry, architecture, and the Internet.