• Title/Summary/Keyword: communication networks

Search Result 5,470, Processing Time 0.031 seconds

Simultaneous Information and Power Transfer Using Magnetic Resonance

  • Lee, Kisong;Cho, Dong-Ho
    • ETRI Journal
    • /
    • v.36 no.5
    • /
    • pp.808-818
    • /
    • 2014
  • To deal with the major challenges of embedded sensor networks, we consider the use of magnetic fields as a means of reliably transferring both information and power to embedded sensors. We focus on a power allocation strategy for an orthogonal frequency-division multiplexing system to maximize the transferred power under the required information capacity and total available power constraints. First, we consider the case of a co-receiver, where information and power can be extracted from the same signal. In this case, we find an optimal power allocation (OPA) and provide the upper bound of achievable transferred power and capacity pairs. However, the exact calculation of the OPA is computationally complex. Thus, we propose a low-complexity power reallocation algorithm. For practical consideration, we consider the case of a separated receiver (where information and power are transferred separately through different resources) and propose two heuristic power allocation algorithms. Through simulations using the Agilent Advanced Design System and Ansoft High Frequency Structure Simulator, we validate the magnetic-inductive channel characteristic. In addition, we show the performances of the proposed algorithms by providing achievable ${\eta}$-C regions.

QA-MAC: QoS-Aware MAC Protocol for Wireless Sensor Networks

  • Kim, Seong-Cheol;Park, Hyun-Joo
    • Journal of information and communication convergence engineering
    • /
    • v.8 no.2
    • /
    • pp.223-227
    • /
    • 2010
  • In this paper, we present a QoS-aware MAC protocol (QA-MAC) for cluster based wireless sensor networks (WSNs). QA-MAC is a TDMA-based scheduling protocol that minimizes the energy consumption in multi-hop WSNs and provides Quality of Service (QoS). A dynamic scheduling algorithm according to the number of member nodes, node traffics, and traffic priorities is suggested. The selected cluster head allocates time slots for all member nodes in the first TDMA schedule period of each round. During the second schedule period in each round, the cluster head makes a schedule for all data transmission. The proposed QA-MAC (QoS-Aware MAC) could save energy, reduce transmission delay, and support QoS.

A Secure Network for Mobile Wireless Service

  • Peng, Kun
    • Journal of Information Processing Systems
    • /
    • v.9 no.2
    • /
    • pp.247-258
    • /
    • 2013
  • A new secure network communication technique that has been designed for mobile wireless services, is presented in this paper. Its network services are mobile, distributed, seamless, and secure. We focus on the security of the scheme and achieve anonymity and reliability by using cryptographic techniques like blind signature and the electronic coin. The question we address in this paper is, "What is the best way to protect the privacy and anonymity of users of mobile wireless networks, especially in practical applications like e-commerce?" The new scheme is a flexible solution that answers this question. It efficiently protects user's privacy and anonymity in mobile wireless networks and supports various applications. It is employed to implement a secure e-auction as an example, in order to show its advantages in practical network applications.

PERIODIC SENSING AND GREEDY ACCESS POLICY USING CHANNEL MODELS WITH GENERALLY DISTRIBUTED ON AND OFF PERIODS IN COGNITIVE NETWORKS

  • Lee, Yutae
    • Journal of applied mathematics & informatics
    • /
    • v.32 no.1_2
    • /
    • pp.129-136
    • /
    • 2014
  • One of the fundamental issues in the design of dynamic spectrum access policy is the modeling of the dynamic behavior of channel occupancy by primary users. Under a Markovian modeling of channel occupancy, a periodic sensing and greedy access policy is known as one of the simple and practical dynamic spectrum access policies in cognitive radio networks. In this paper, the primary occupancy of each channel is modeled as a discrete-time alternating renewal process with generally distributed on- and off-periods. A periodic sensing and greedy access policy is constructed based on the general channel occupancy model. Simulation results show that the proposed policy has better throughput than the policies using channel models with exponentially distributed on- or off-periods.

Analysis of Resource Assignment for Directional Multihop Communications in mm-Wave WPANs

  • Kim, Meejoung;Hong, Seung-Eun;Kim, Yongsun;Kim, Jinkyeong
    • ETRI Journal
    • /
    • v.35 no.1
    • /
    • pp.120-130
    • /
    • 2013
  • This paper presents an analysis of resource assignment for multihop communications in millimeter-wave (mm-wave) wireless personal area networks. The purpose of this paper is to figure out the effect of using directional antennas and relaying devices (DEVs) in communications. The analysis is performed based on a grouping algorithm, categorization of the flows, and the relaying DEV selection policy. Three schemes are compared: direct and relaying concurrent transmission (DRCT), direct concurrent transmission (DCT), and direct nonconcurrent transmission (DNCT). Numerical results show that DRCT is better than DCT and DCT is better than DNCT for any antenna beamwidths under the proposed algorithm and policy. The results also show that using relaying DEVs increases the throughput up to 30% and that there is an optimal beamwidth that maximizes spatial reuse and depends on parameters such as the number of flows in the networks. This analysis can provide guidelines for improving the performance of mm-wave band communications with relaying DEVs.

Distributed Load Balancing with Handovers over Mobile Cellular Networks Using Supervisory Control (셀룰러 망에서 관리 제어를 이용한 분산적 부하 균등 방법)

  • Byun, Hee-Jung;Yang, Yoon-Gi
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.17 no.7
    • /
    • pp.714-719
    • /
    • 2011
  • This paper proposes a scheme for distributed load balancing in mobile communication networks based on supervisory control framework. Using load information exchanged with neighboring cells, the "supervisors" that reside in the base stations distribute load among cells by controlling handover parameters in a distributed manner. The supervisors are designed so that the load difference among neighboring cells are kept under a pre-defined value. Results from systematic analysis and simulation indicate that our scheme effectively balances traffic load among cells and reduces call blocking rate of the overloaded cells.

Implementation of the Direction Indicator Algotithm for Autonomous Mobile Robot using VFF and Neural Networks (VFF와 신경망을 이용한 자율주행로봇의 조향 알고리즘 구현)

  • Jeong, Heon;Lim, Chun-Hwan;Lee, Sang-Hun
    • Journal of the Korean Institute of Telematics and Electronics T
    • /
    • v.36T no.1
    • /
    • pp.58-63
    • /
    • 1999
  • In this paper, We present a direction indicator algorithm for a mobile robot which uses VFF and neural networks. The structure of this neural network navigation system is composed of sensor system, backpropagation learning controllers for adjusting weight and the motion control system for real-time execution. The experimental results show that the direction indicator system operates properlv and strongly at any circumstance

  • PDF

Energy Efficient Routing in Wireless Sensor Networks

  • Cho, Seongsoo;Shrestha, Bhanu;Shrestha, Surendra;Lee, Jong-Yong;Hong, Suck-Joo
    • International journal of advanced smart convergence
    • /
    • v.3 no.2
    • /
    • pp.1-5
    • /
    • 2014
  • Sensor nodes depend on batteries for energy source in Wireless Sensor Networks (WSNs). Low Energy Adaptive Clustering Hierarchy (LEACH) is a representative cluster-based routing protocol designed to ensure energy use efficiency whereas the virtual cluster exchange routing (VCR) information only with its closest node to build a network. In this paper, a protocol scheme was proposed wherein member nodes are designed to compare the currently sensed data with the previously sensed one and to switch to sleep mode when a match is achieved. The design is to help improve the transmission energy efficiency too.

Feasibility of Interference Alignment for Full-Duplex MIMO Cellular Networks (전 이중 다중 안테나 셀룰라 네트워크의 간섭 정렬 타당성)

  • Kim, Kiyeon;Yang, Janghoon;Jeon, Sang-Woon;Kim, Dong Ku
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.40 no.12
    • /
    • pp.2389-2391
    • /
    • 2015
  • The feasibility condition of interference alignment (IA) for full-duplex (FD) multiple-input multipleoutput (MIMO) cellular networks is considered. The necessary and sufficient condition on the IA feasibility is established, characterizing the achievable sum degrees of freedom (DoF). The results demonstrate that FD operation with appropriate IA is able to improve the sum DoF on the conventional half-duplex operation.

Performance of Prioritized Service Discipline Based on Hop Count for Optical Burst Switched Networks

  • Kim, Dong-Ok
    • Journal of The Institute of Information and Telecommunication Facilities Engineering
    • /
    • v.6 no.3
    • /
    • pp.1-7
    • /
    • 2007
  • In this paper, we propose a new prioritized Optical Burst Switching (OBS) protocol based on a hop count, which can provide efficient utilization in optical networks. Under several legacy schemes, a switch drops the burst with the shortest time regardless of its traversed hop count. As a result, a dropped burst that have been traversed many hops might cause increased bandwidth waste compared to one that has traversed a few hops. To improve this problem, we propose the Just Enough Time (JET) with a hop counting scheme which can reduce the wasted bandwidth by prioritizing the burst traversed many hops over others. From the simulation result, it is preyed, we show that the proposed scheme has advantages against legacy schemes in terms of the burst blocking probability and the link utilization.

  • PDF