• 제목/요약/키워드: Mobile Network Simulation

검색결과 1,068건 처리시간 0.027초

유비쿼터스 환경에서 다중 인터페이스를 탑재한 이동 단말의 인터페이스 선택 기법에 관한 연구 (A Study on the Interface Selection Scheme of Mobile Nodes with Multiple Interfaces in Ubiquitous Environments)

  • 김성철;문일영;조성준
    • 한국항행학회논문지
    • /
    • 제14권2호
    • /
    • pp.198-205
    • /
    • 2010
  • 유비쿼터스 환경에서 사용자가 언제 어디서나 네트워크에 접속할 수 있도록 하기 위해 다중 인터페이스 기술에 대한 관심과 연구가 늘고 있다. 본 논문에서는 다중 인터페이스를 탑재한 이동 단말이 이동 중에 단일 인터페이스만 고정적으로 이용하지 않고, 계속해서 변화하는 무선 채널의 상태에 따라 적절한 인터페이스를 적응적으로 이용하기 위한 기법을 제안한다. 본 논문에서 제안하는 기법은 각 인터페이스의 전송률과 패킷 오류율, 그리고 종단간 지연시간에 따라 가장 적절한 무선 인터페이스를 판단할 수 있다. 시뮬레이션 결과 본 논문에서 제안한 기법이 쓰였을 때 단일 인터페이스만 사용한 환경보다 약 20% 더 많은 패킷 전송을 할 수 있었다.

RGF: Receiver-based Greedy Forwarding for Energy Efficiency in Lossy Wireless Sensor Networks

  • Hur, In;Kim, Moon-Seong;Seo, Jae-Wan;Choo, Hyun-Seung
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제4권4호
    • /
    • pp.529-546
    • /
    • 2010
  • Greedy forwarding is the key mechanism of geographic routing and is one of the protocols used most commonly in wireless sensor networks. Greedy forwarding uses 1-hop local information to forward packets to the destination and does not have to maintain the routing table, and thus it takes small overhead and has excellent scalability. However, the signal intensity reduces exponentially with the distance in realistic wireless sensor network, and greedy forwarding consumes a lot of energy, since it forwards the packets to the neighbor node closest to the destination. Previous proposed greedy forwarding protocols are the sender-based greedy forwarding that a sender selects a neighbor node to forward packets as the forwarding node and hence they cannot guarantee energy efficient forwarding in unpredictable wireless environment. In this paper, we propose the receiver-based greedy forwarding called RGF where one of the neighbor nodes that received the packet forwards it by itself. In RGF, sender selects several energy efficient nodes as candidate forwarding nodes and decides forwarding priority of them in order to prevent unnecessary transmissions. The simulation results show that RGF improves delivery rate up to maximum 66.8% and energy efficiency, 60.9% compared with existing sender-based greedy forwarding.

유전 알고리즘을 이용한 휴머노이드 로봇의 동작연구 (Motion Study for a Humanoid Robot Using Genetic Algorithm)

  • 공정식;이보희;김진걸
    • 한국정밀공학회지
    • /
    • 제23권7호
    • /
    • pp.84-92
    • /
    • 2006
  • This paper deals with determination of motions of a humanoid robot using genetic algorithm. A humanoid robot has some problems of the structural instability basically. So, we have to consider the stable walking gait in gait planning. Besides, it is important to make the smoothly optimal gait for saving the electric power. A mobile robot has battery to move autonomously. But a humanoid robot needs more electric power in order to drive many joints. So, if movements of walking joint don't maintain optimally, it is hard to sustain the battery power during the working period. Also, if a gait trajectory doesn't have optimal state, the expected lift span of joints tends to be decreased. Also, if a gait trajectory doesn't have optimal state, the expected lift span of joints tends to be decreased. To solve these problems, the genetic algorithm is employed to guarantee the optimal gait trajectory. The fitness functions in a genetic algorithm are introduced to find out optimal trajectory, which enables the robot to have the less reduced jerk of joints and get smooth movement. With these all process accomplished by PC-based program, the optimal solution could be obtained from the simulation. In addition, we discuss the design consideration fur the joint motion and distributed computation of tile humanoid, ISHURO, and suggest its result such as structure of the network and a disturbance observer.

Maximum Ratio Transmission for Space-Polarization Division Multiple Access in Dual-Polarized MIMO System

  • Hong, Jun-Ki;Jo, Han-Shin;Mun, Cheol;Yook, Jong-Gwan
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제9권8호
    • /
    • pp.3054-3067
    • /
    • 2015
  • The phenomena of higher channel cross polarization discrimination (XPD) is mainly observed for future wireless technologies such as small cell network and massive multiple-input multiple-output (MIMO) system. Therefore, utilization of high XPD is very important and space-polarization division multiple access (SPDMA) with dual-polarized MIMO system could be a suitable solution to high-speed transmission in high XPD environment as well as reduction of array size at base station (BS). By SPDMA with dual-polarized MIMO system, two parallel data signals can be transmitted by both vertically and horizontally polarized antennas to serve different mobile stations (MSs) simultaneously compare to conventional space division multiple access (SDMA) with single-polarized MIMO system. This paper analyzes the performance of SPDMA for maximum ratio transmission (MRT) in time division duplexing (TDD) system by proposed dual-polarized MIMO spatial channel model (SCM) compare to conventional SDMA. Simulation results indicate that how SPDMA utilizes the high XPD as the number of MS increases and SPDMA performs very close to conventional SDMA for same number of antenna elements but half size of the array at BS.

Joint Mode Selection, Link Allocation and Power Control in Underlaying D2D Communication

  • Zhang, Wei;He, Wanbing;Wu, Dan;Cai, Yueming
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제10권11호
    • /
    • pp.5209-5228
    • /
    • 2016
  • Device-to-device (D2D) communication underlaying cellular networks can bring significate benefits for improving the performance of mobile services. However, it hinges on elaborate resource sharing scheme to coordinate interference between cellular users and D2D pairs. We formulate a joint mode selection, link allocation and power control optimization problem for D2D communication sharing uplink resources in a multi-user cellular network and consider the efficiency and the fairness simultaneously. Due to the non-convex difficulty, we propose a three-step scheme: firstly, we conduct mode selection for D2D pairs based on a minimum distance metric after an admission control and obtain some cellular candidates for them. And then, a cellular candidate will be paired to each D2D pair based on fairness. Finally, we use Lagrangian Algorithm to formulate a joint power control strategy for D2D pairs and their reused cellular users and a closed-form of solution is derived. Simulation results demonstrate that our proposed algorithms converge in a short time. Moreover, both the sum rate of D2D pairs and the energy efficiency of cellular users are improved.

Optimal Resource Planning with Interference Coordination for Relay-Based Cellular Networks

  • Kim, Taejoon;An, Kwanghoon;Yu, Heejung
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제11권11호
    • /
    • pp.5264-5281
    • /
    • 2017
  • Multihop relay-based cellular networks are attracting much interest because of their throughput enhancement, coverage extension, and low infrastructure cost. In these networks, relay stations (RSs) between a base station (BS) and mobile stations (MSs) drastically increase the overall spectral efficiency, with improved channel quality for MSs located at the cell edge or in shadow areas, and enhanced throughput of MSs in hot spots. These relay-based networks require an advanced radio resource management scheme because the optimal amount of radio resource for a BS-to-RS link should be allocated according to the MS channel quality and distribution, considering the interference among RSs and neighbor BSs. In this paper, we propose optimal resource planning algorithms that maximize the overall utility of relay-based networks under a proportional fair scheduling policy. In the first phase, we determine an optimal scheduling policy for distributing BS-to-RS link resources to RSs. In the second phase, we determine the optimal amount of the BS-to-RS link resources using the results of the first phase. The proposed algorithms efficiently calculate the optimal amount of resource without exhaustive searches, and their accuracy is verified by comparison with simulation results, in which the algorithms show a perfect match with simulations.

광대역 부호분할다원접속(WCDMA) 이동통신 환경하에서 송수신 다이버시티 기법의 성능 분석 (Performance Analysis of the Open Loop Transmitter and Receiver Diversity in the Wide Band CDMA network)

  • 박상조;노용우
    • 한국컴퓨터정보학회논문지
    • /
    • 제11권2호
    • /
    • pp.201-211
    • /
    • 2006
  • 현재 이동통신 시장이 급성장하고 있으며 무선통신 환경에서의 다양한 멀티미디어 서비스의 요구에 부합하고 한정된 주파수를 효율적으로 사용하기 위하여, 데이터 전송의 고속화가 가능하고 다중 안테나를 이용하는 3세대 이동통신 표준화가 진행되고 있다. 본 논문에서는 3세대 이동통신 표준화 기구인 3GPP에서 다루어지는 개루프 송신 다이버시티 기법 중 STTD(Space Time Transmit Diversity) 기법 및 STTD를 기본으로 확장되어진 STTD-OTD, CL-STTD 그리고 4TX-STTD 들에 대한 성능을 분석한다. 그리고 각 기법에서 수신 다이버시티를 추가한 개루프 송신 및 수신 다이버시티 기법을 제안한다. 플랫 페이딩 채널 환경하에서 이들 기법들을 적용하여 모의 수치계산을 수행하고 성능을 비교 분석한다.

  • PDF

An adaptable polling scheme for real time traffic support in IEEE 802.11 networks

  • Pak Jin-suk;Son Jae-min;Cho Chi-woo;Lee Ho-seung;Han Ki-jun
    • 대한전자공학회:학술대회논문집
    • /
    • 대한전자공학회 2004년도 ICEIC The International Conference on Electronics Informations and Communications
    • /
    • pp.313-316
    • /
    • 2004
  • This paper presents a new dynamically adaptable polling scheme for efficient support of real-time traffic over an IEEE 802.11 wireless LAN network. The poll scheduling plays an important role in IEEE 802.11 PCF. However, the current version of the polling list management scheme proposed in the IEEE802.11 standard is inefficient when a variable number of mobile stations have variable packets to transmit. If Point Coordinator(PC) has an exact information on the station status, it is possible to efficiently perform polling. In this thesis. we suggest an adaptable polling scheme to meet requirements of the stations. In our scheme, each station transmits packets including a piggyback information to inform that it wants to receive a poll in the next polling duration. Simulation results indicate that our scheme may reduces the packet discard ratio and real-time packet transfer delay.

  • PDF

이기종 무선 네트워크에서 멀티 캐스팅 터널링을 이용한 이동성 관리 방법 (Fast Mobility Management Method Using Multi-Casting Tunneling in Heterogeneous Wireless Networks)

  • 천승만;박종태
    • 대한전자공학회논문지TC
    • /
    • 제47권12호
    • /
    • pp.69-77
    • /
    • 2010
  • 본 논문에서는 이기종 무선 네트워크에서 다중 무선 네트워크 인터페이스를 이용한 고속 IP 이동성 관리 방법을 제시한다. 구체적으로, 핸드오버로 인한 패킷 손실과 핸드오버 지연시간을 최소화하기 위해, E-MAP과 이동 단말 간 멀티 캐스팅 터널링을 동적으로 생성하는 IETF HMIPv6를 확장한 E-HMIPv6를 제시하였다. E-HMIPv6는 IETF HNIPv6의 MAP의 확장, 핸드오버 절차, 동시 다중 터널링를 포함 한다. 제안된 방법의 우수성을 증명하기 위해 기존의 이동성 관리 방법과의 TCP과 UDP 기반의 어플리케이션에서의 성능 비교를 위해 NS-2 시뮬레이션을 수행하였다.

MANETs의 AODV기반 향상된 견고한 라우팅 프로토콜 (An Enhanced Robust Routing Protocol in AODV over MANETs)

  • 김관웅;배성환;김대익
    • 한국전자통신학회논문지
    • /
    • 제4권1호
    • /
    • pp.14-19
    • /
    • 2009
  • 노드의 이동성과 한정된 배터리 용량으로 무선애드혹 네트워크에서는 종종 경로 단절이나 패킷 손실이 발생한다. 본 논문에서는 수신 신호 세기의 변화를 측정함으로써 경로 단절 확률과 패킷손실을 줄일 수 있는 AODV (Ad hoc On-demand Distance Vector routing)에 기반을 둔 향상된 라우팅 프로토콜을 제안한다. 라우팅을 결정하기 위해 노드 이동성과 경로의 홉으로 이루어진 새로운 측정 함수를 사용하고, 데이터 전송 중 노드의 움직임에 의한 경로의 단절을 방지하기 위해 새로운 경로 관리 기법을 소개한다. 이웃 노드의 움직임을 감지되면, 경로가 단절되기 전에 라우팅 에이전트는 다음 홉 노드를 이웃노드로 변경한다. 시뮬레이션 결과를 통해 제안한 라우팅 기법의 성능이 기존의 AODV 방식보다 우수함을 보인다.

  • PDF