• Title/Summary/Keyword: Access node

Search Result 672, Processing Time 0.028 seconds

Control Frame Design for Improvement Transmit Efficiency in the Wireless Networks (무선 네트워크에서 전송효율증대를 위한 제어프레임 설계)

  • Han, Jae-Kyun;Pyeon, Seok-Beom
    • 전자공학회논문지 IE
    • /
    • v.48 no.2
    • /
    • pp.61-70
    • /
    • 2011
  • IEEE 802.11 wireless network supports control frames like RTS/CTS(Request To Send / Clear To Send). Because they is defend to frame collection problems. It helps to solve the frame collection problem but decreases the throughput rate. Also, control frame makes False Node Problem. This problem is makes to other wireless nodes don't work and don't find channels in the same cell and near cells. We proposed a reformed new control frame for efficiency throughput rate and solution of False Node Problem. New control frame is to have added to 4 bytes of channel detection ability at the RTS frames. Channel detection ability supported to check channel at the wireless node start to transmit data frame, We expect that channel detection ability make prevent False Node Problem for increase to access number to channel. We perform comparative analysis in terms of delay(sec) and load(bits/sec) with reform RTS/CTS method which proves the efficiency of the proposed method.

A Study on the Performance of the Various Multiple Access for the Mobile Computer Network (이동 컴퓨터 통신망용 다중 엑세스 방식의 성능 연구)

  • 백지현;조동호;이영웅
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.17 no.7
    • /
    • pp.641-655
    • /
    • 1992
  • In this paper, the performance of the various multiple accesstechniques for the mobile computer network has been studied in the consideration of the characteristics. Of the mobile communication channel. In the case of the hidden node occurring, it could be seen that the performance of the code division multiple access(CDMA) technique. With simultaneous access function is better than that of the other packet access methods such as carrier sensed multiple access(CAMA). Busy tone mulitiple access(BTMA)and idle signal muitiple access(ISMA) in the view of the throuhtput and mean delay time. Also it has been shown that the performance of the CDMA method is superior to that of other packet access techniques such as multiple access(CSMA).etc when the fading effect or impulsive noise exists in the mobile channel. Especially in the case of the distributed mobile network. It has been shown that the receiver-transmitter based CDMA method using the characteristics of CDMA effectively has better throughput and less mean delay time than the commontransmitter based CDMA technique.

  • PDF

Performance Evaluation of an Underwater Propagation Delay-Aware Medium Access Control Protocol (수중 전파 지연을 고려한 매체 접근 제어 프로토콜에 대한 성능 평가)

  • Hwang, Ho Young;Kim, Woo-Sik;Lee, Sang-Kug;Cho, Ho-Shin
    • The Journal of the Acoustical Society of Korea
    • /
    • v.34 no.6
    • /
    • pp.463-469
    • /
    • 2015
  • In this paper, we propose an underwater propagation delay-aware medium access control protocol and evaluate the performance of the proposed protocol. In the proposed propagation delay-aware medium access control protocol, a sink node can restore the received RTS frames that are not piled up in a slot time. We analyze and compare the performance of the proposed underwater propagation delay-aware medium access control protocol with that of the conventional medium access control protocol in various environments.

An Erasure Node Algorithm for DQDB Networks (DQDB망 소거노드 알고리즘)

  • 전병천;김대영
    • Journal of the Korean Institute of Telematics and Electronics A
    • /
    • v.29A no.11
    • /
    • pp.1-13
    • /
    • 1992
  • In this DQDB networks, erasure nodes may be allocated on the bus and release slots which already had been read by destination nodes. An important function of the erasure node must be to eliminate as many requests as erased slots used by downstream nodes. In the networks with priorities, following two additional issues must be solved : (1) accurately to guess for which priority the erased slots is to be used, and (2) to find in a short period a request of that priority to cancel. In this paper, we propose two erasure node algorithms based on elimination of the requests. In these algorithms, the requests are eliminated excessively at low load but optimum elimination can be achieved at full load. Simulation results show that these two algorithms have similar access delay to that of existing algorithms at low load and better performance at high load.

  • PDF

Enhanced ANTSEC Framework with Cluster based Cooperative Caching in Mobile Ad Hoc Networks

  • Umamaheswari, Subbian;Radhamani, Govindaraju
    • Journal of Communications and Networks
    • /
    • v.17 no.1
    • /
    • pp.40-46
    • /
    • 2015
  • In a mobile ad hoc network (MANET), communication between mobile nodes occurs without centralized control. In this environment the mobility of a node is unpredictable; this is considered as a characteristic of wireless networks. Because of faulty or malicious nodes, the network is vulnerable to routing misbehavior. The resource constrained characteristics of MANETs leads to increased query delay at the time of data access. In this paper, AntHocNet+ Security (ANTSEC) framework is proposed that includes an enhanced cooperative caching scheme embedded with artificial immune system. This framework improves security by injecting immunity into the data packets, improves the packet delivery ratio and reduces end-to-end delay using cross layer design. The issues of node failure and node malfunction are addressed in the cache management.

Hybrid MAC Protocol for Improving Performance of IEEE 802.11 Wireless LANs (IEEE 802.11 무선랜의 성능 향상을 위한 하이브리드 MAC 프로토콜)

  • Choi, Woo-Yong
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.41 no.2
    • /
    • pp.220-224
    • /
    • 2015
  • The DCF (Dcistributed Coordination Function) and PCF (Point Coordination Function) are the basic MAC (Medium Access Control) protocols of IEEE 802.11 wireless LANs. According to the DCF, each node performs the exponential backoff algorithm before the transmission of its data frame. Each node doubles the backoff waiting time before the transmission of its data frame whenever it detects the transmission collision with other nodes. Therefore, as the number of the active nodes having the data frames to transmit increases, the overall MAC performance of the DCF decreases. On the other hand, according to the PCF, each node is granted the transmission opportunity by which the PCF transmission is possible without the collision with other nodes. Therefore, as the number of the active nodes increases, the MAC performance of the PCF increases, In this paper, considering the tradeoff of MAC performance between the DCF and PCF, a hybrid MAC protocol is proposed to enhance the performance of IEEE 802.11 wireless LANs.

Cooperative Synchronization and Channel Estimation in Wireless Sensor Networks

  • Oh Mi-Kyung;Ma Xiaoli;Giannakis Georgios B;Park Dong-Jo
    • Journal of Communications and Networks
    • /
    • v.7 no.3
    • /
    • pp.284-293
    • /
    • 2005
  • A critical issue in applications involving networks of wireless sensors is their ability to synchronize, and mitigate the fading propagation channel effects. Especially when distributed 'slave' sensors (nodes) reach-back to communicate with the 'master' sensor (gateway), low power cooperative schemes are well motivated. Viewing each node as an antenna element in a multi-input multi-output (MIMO) multi-antenna system, we design pilot patterns to estimate the multiple carrier frequency offsets (CFO), and the multiple channels corresponding to each node-gateway link. Our novel pilot scheme consists of non-zero pilot symbols along with zeros, which separate nodes in a time division multiple access (TDMA) fashion, and lead to low complexity schemes because CFO and channel estimators per node are decoupled. The resulting training algorithm is not only suitable for wireless sensor networks, but also for synchronization and channel estimation of single- and multi-carrier MIMO systems. We investigate the performance of our estimators analytically, and with simulations.

IP Prefix Update of Routing Protocol in the Multi-way Search Tree (멀티웨이 트리에서의 IP Prefix 업데이트 방안)

  • 이상연;이강복;이형섭
    • Proceedings of the IEEK Conference
    • /
    • 2001.06a
    • /
    • pp.269-272
    • /
    • 2001
  • Since Multi-way Search Tree reduces the number of the memory access by increasing the branch factor, it is considered a method to archive the high-speed IP address lookup. Using the combination of initial 16 bit may and Multi-way Search Tree, it also reduces the search time of If address lookup. Multi-way Search Tree consists of K keys and K+1 key pointers. This paper shows how the E update of Multi-way Search Tree which consists of the one pointer within a node can be performed. Using the one pointer within a node, it increases the number of keys within a node and reduces the search time of IP lookup. We also describes IP updating methods such as modification, Insertion and Deletion of address entries. Our update scheme performs better than the method which rebuilds the entire IP routing table when IP update processes.

  • PDF

Excess Power를 이용한 HSDPA throughput 개선

  • Kim, Tae-Hyun
    • 한국정보통신설비학회:학술대회논문집
    • /
    • 2008.08a
    • /
    • pp.107-111
    • /
    • 2008
  • 3GPP는 사용자의 다운링크 패킷 데이터 Throughput을 높이고,NodeB에 MAC계층을 위치시켜, 사용자의 스케줄링과 재전송을 담당하게 함으로써, 다운링크 패킷의 전송 지연을 감소시키는 HSDPA(High Speed Data Packet Access)기술을 Release 5에서 도입하였다. NodeB에 위치한 MAC-hs 스케줄러는 각각의 사용자에게 가용한 NodeB의 RF power와 code 자원을 제공하며, R99에서 사용했던 Power control을 이용하는 대신, AMC(Adaptive Modulation and Coding)기능을 제공하여 Radio conditions에 따라 전송되는 Data Format을 조정하여 채널환경이 좋은 사용자에게는 높은 data Throughput을 제공하며, 채널환경이 좋지 않은 사용자에게는 낮은 data throughput을 제공하고 있다. 본 고에서는 매 TTI에 스케줄링된 사용자에게 제공하고도, RF power 및 code 자원이 남아 있을 경우, 스케줄러는 남은 자원을 각각의 사용자에게 재 분배하여, 초기에 추정한 HSDPA Throughput보다 향상된 성능을 갖을 수 있음을 설명하였다.

  • PDF

A Novel Scheme for an RSVP Session Handoff in Wireless IP Networks with Micro-Mobility (Micro-Mobility 환경에서의 RSVP Session Handoff를 위한 연구)

  • Kim, Jeong-Hoe;Min, Sang-Won
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.5B
    • /
    • pp.296-303
    • /
    • 2008
  • In this paper, we propose a novel Route_Reconf message as the RSVP message to maintain an RSVP session for hard handoff and consider a path-comparing route(PCR) algorithm to find an intermediate node in the charge of down-link re-establishment. And, we consider information form each mode for the PCR algorithm, which also reduces the frequency and amount of exchanged RSVP message to minimize packet loss and delay between an intermediate node and a receiver. According to the proposed algorithm, a new support node(NSN) and an existing support node(ESN) along the RSVP path can be found; the former is a supporting RSVP session node newly searched and the latter is the last supporting node holding the previous session after handoff. On receiving the Route_Reconf message at the ESN, a new allocated route from a NSN to the MN waiting for the handoff via a new access router is configured by the ESN.