• Title/Summary/Keyword: Node Allocation Area

Search Result 21, Processing Time 0.023 seconds

Design and Implementation of Channel Allocation Module of Synchronous Area in MOST Network (MOST 네트워크의 동기영역 채널 할당 모듈 설계 및 구현)

  • Jang, Si-Woong;Kwak, Gil-Bong;Yu, Yoon-Sik
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.14 no.6
    • /
    • pp.1397-1402
    • /
    • 2010
  • While MOST is an in-vehicle network which transfers concurrently synchronous data, asynchronous data and control data, it provides high bandwidth synchronous section which can transfer video and audio without buffering. To transfer real time data using synchronous section, connections between source node and sink node, and channel allocation for connections are required. In this paper, we proposed synchronous data transfer method and channel allocation method by constructing MOST network after designing and implementing channel allocation module for using synchronous data section.

Design and Implementation of Upstream Channel Allocation Algorithm for DOCSIS 3.0 MAC (채널-결합 방식을 사용하는 상향대역 할당 알고리즘 성능 검증을 위한 DOCSIS 3.0 시뮬레이터 설계 및 구현)

  • Kim, Tae-Kyoon;Ra, Sung-Woong
    • Journal of the Korea Society for Simulation
    • /
    • v.17 no.4
    • /
    • pp.21-27
    • /
    • 2008
  • In this paper, we design and implement the upstream packet bandwidth allocation algorithm on OPNET-based DOCSIS 3.0 simulator including channel-bonding CM (Cable Modem)s. Previous DOCSIS CM could not support channel bonding, it has problem in upstream bandwidth allocation and determine the contention area. The proposed upstream bandwidth allocation algorithm has been improved the queuing time and success rate. For the simulation, we design the MAC frame structure with channel bonding supported CM and not. And then, this paper design and implement the CMTS node model, CM node model, CMTS process model, and CM process model.

  • PDF

A Block-based Uniformly Distributed Random Node Arrangement Method Enabling to Wirelessly Link Neighbor Nodes within the Communication Range in Free 3-Dimensional Network Spaces (장애물이 없는 3차원 네트워크 공간에서 통신 범위 내에 무선 링크가 가능한 블록 기반의 균등 분포 무작위 노드 배치 방법)

  • Lim, DongHyun;Kim, Changhwa
    • Journal of Korea Multimedia Society
    • /
    • v.25 no.10
    • /
    • pp.1404-1415
    • /
    • 2022
  • The 2-dimensional arrangement method of nodes has been used in most of RF (Radio Frequency) based communication network simulations. However, this method is not useful for the an none-obstacle 3-dimensional space networks in which the propagation delay speed in communication is very slow and, moreover, the values of performance factors such as the communication speed and the error rate change on the depth of node. Such a typical example is an underwater communication network. The 2-dimensional arrangement method is also not useful for the RF based network like some WSNs (Wireless Sensor Networks), IBSs (Intelligent Building Systems), or smart homes, in which the distance between nodes is short or some of nodes can be arranged overlapping with their different heights in similar planar location. In such cases, the 2-dimensional network simulation results are highly inaccurate and unbelievable so that they lead to user's erroneous predictions and judgments. For these reasons, in this paper, we propose a method to place uniformly and randomly communication nodes in 3-dimensional network space, making the wireless link with neighbor node possible. In this method, based on the communication rage of the node, blocks are generated to construct the 3-dimensional network and a node per one block is generated and placed within a block area. In this paper, we also introduce an algorithm based on this method and we show the performance results and evaluations on the average time in a node generation and arrangement, and the arrangement time and scatter-plotted visualization time of all nodes according to the number of them. In addition, comparison with previous studies is conducted. As a result of evaluating the performance of the algorithm, it was found that the processing time of the algorithm was proportional to the number of nodes to be created, and the average generation time of one node was between 0.238 and 0.28 us. ultimately, There is no problem even if a simulation network with a large number of nodes is created, so it can be sufficiently introduced at the time of simulation.

Effective address assignment method in hierarchical structure of Zigbee network (Zigbee 네트워크 계층 구조에서의 효율적인 주소 할당 방법)

  • Kim, Jae-Hyun;Hur, Soo-Jung;Kang, Won-Sek;Lee, Dong-Ha;Park, Yong-Wan
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.44 no.10
    • /
    • pp.20-28
    • /
    • 2007
  • Zigbee sensor network base on IEEE802.15.4 has local address of 2 byte on transmit packet data which is pick up the address for each sensor node. Sensor network is requested low power, low cost, many nodes at hues physical area. There for Zigbee is very good solution supporting for next Ubiquitous generation but the Zigbee sensor network has address allocation problem of each sensor node. Is established standard from Zigbee Alliance, to the address allocation method uses Cskip algorithm. The Cskip algorithm use the hazard which allocates an address must blow Hop of the maximum modification and child node number. There is to address allocation and from theoretically it will be able to compose a personal 65536 sensor nodes only actual with concept or space, only 500 degree will be able to compose expansion or the low Zigbee network. We proposed an address allocation method using coordinate value for Zigbee sensor network.

Resource Allocation and Power Control for Device-to-Device Communication in LTE-Advanced Based on User Area Information (LTE-Advanced에서 단말간 직접 통신을 위한 영역 정보 기반 자원할당 및 전력 제어 기법)

  • Li, Xiang;Shin, Oh-Soon;Shin, Yoan
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.40 no.1
    • /
    • pp.32-42
    • /
    • 2015
  • In this paper, we considered the scenario that one cellular link and muti-D2D links share the same frequency resource which can improve the spectrum efficiency during uplink communication in LTE (Long Term Evolution)-Advanced network. In order to reduce the interference caused to the D2D users, we set DME (Discovery and Management Entity) which can send the area information to eNB(evolved Node B). We proposed a resource allocation scheme by using these assistant devices to reduce the interference that CUE (Cellular User Equipment) causes to DUE Rx (D2D UE Receiver). Basing on the area information, in order to mitigate the interference among the D2D pairs which share the same frequency resource, a power control scheme has been proposed. The simulation results prove that by using the DMEs, the proposed schemes improve the stability of D2D communication and bring the highest performance of the communication system when comparing to the other different schemes.

Bio-MAC: Optimal MAC Protocol for Various Bio-signal Transmission in the WBSN Environment (Bio-MAC: WBSN환경에서 다양한 생체신호 전송을 위한 최적화된 MAC Protocol)

  • Jang, Bong-Mun;Ro, Young-Sin;Yoo, Sun-Kook
    • Proceedings of the KIEE Conference
    • /
    • 2007.04a
    • /
    • pp.423-425
    • /
    • 2007
  • In this paper, Medium Access Control(MAC) protocol designed for Wireless Body area Sensor Network(Bio-MAC) is proposed, Because in WBSN, the number of node is limited and each node has different characteristics. Also, reliability in transmitting vital data sensed at each node and periodic transmission should be considered so that general MAC protocol cannot satisfy such requirements of biomedical sensors in WBSN. Bio-MAC aims at optimal MAC protocol in WBSN. For this, Bio-MAC used Pattern -SuperFrame, which modified IEE E 802.15.4-based SuperFrame structurely. Bio-MAC based on TDMA uses Medium Access-priority and Pattern eXchange -Beacon method for dynamic slot allocation by considering critical sensing data or power consumption level of sensor no de etc. Also, because of the least delay time. Bio-MAC is suitable in the periodic transmission of vital signal data. The simulation results demonstrate that a efficient performance in WBSN can be achieved through the proposed Bio-MAC.

  • PDF

Adaptive OFDMA with Partial CSI for Downlink Underwater Acoustic Communications

  • Zhang, Yuzhi;Huang, Yi;Wan, Lei;Zhou, Shengli;Shen, Xiaohong;Wang, Haiyan
    • Journal of Communications and Networks
    • /
    • v.18 no.3
    • /
    • pp.387-396
    • /
    • 2016
  • Multiuser communication has been an important research area of underwater acoustic communications and networking. This paper studies the use of adaptive orthogonal frequency-division multiple access (OFDMA) in a downlink scenario, where a central node sends data to multiple distributed nodes simultaneously. In practical implementations, the instantaneous channel state information (CSI) cannot be perfectly known by the central node in time-varying underwater acoustic (UWA) channels, due to the long propagation delays resulting from the low sound speed. In this paper, we explore the CSI feedback for resource allocation. An adaptive power-bit loading algorithm is presented, which assigns subcarriers to different users and allocates power and bits to each subcarrier, aiming to minimize the bit error rate (BER) under power and throughput constraints. Simulation results show considerable performance gains due to adaptive subcarrier allocation and further improvement through power and bit loading, as compared to the non-adaptive interleave subcarrier allocation scheme. In a lake experiment, channel feedback reduction is implemented through subcarrier clustering and uniform quantization. Although the performance gains are not as large as expected, experiment results confirm that adaptive subcarrier allocation schemes based on delayed channel feedback or long term statistics outperform the interleave subcarrier allocation scheme.

Management of Neighbor Cell Lists and Physical Cell Identifiers in Self-Organizing Heterogeneous Networks

  • Lim, Jae-Chan;Hong, Dae-Hyoung
    • Journal of Communications and Networks
    • /
    • v.13 no.4
    • /
    • pp.367-376
    • /
    • 2011
  • In this paper, we propose self-organizing schemes for the initial configuration of the neighbor cell list (NCL), maintenance of the NCL, and physical cell identifier (PCI) allocation in heterogeneous networks such as long term evolution systems where lower transmission power nodes are additionally deployed in macrocell networks. Accurate NCL maintenance is required for efficient PCI allocation and for avoiding handover delay and redundantly increased system overhead. Proposed self-organizing schemes for the initial NCL configuration and PCI allocation are based on evolved universal terrestrial radio access network NodeB (eNB) scanning that measures reference signal to interference and noise ratio and reference symbol received power, respectively, transmitted from adjacent eNBs. On the other hand, the maintenance of the NCL is managed by adding or removing cells based on periodic user equipment measurements. We provide performance analysis of the proposed schemes under various scenarios in the respects of NCL detection probability, NCL false alarm rate, handover delay area ratio, PCI conflict ratio, etc.

Broadcasting Message Reduction Methods in VANET

  • Makhmadiyarov, Davron;Hur, Soojung;Park, Yongwan
    • IEMEK Journal of Embedded Systems and Applications
    • /
    • v.4 no.1
    • /
    • pp.42-49
    • /
    • 2009
  • Most Vehicular Ad hoc Network (VANET) applications rely heavily on broadcast transmission of traffic related information to all reachable nodes within a certain geographical area. Among various broadcast approaches, flooding is the first broadcasting technique. Each node rebroadcasts the received message exactly once, which results in broadcast storm problems. Some mechanisms have been proposed to improve flooding in Mobile Ad hoc Networks (MANET), but they are not effective for VANET and only a few studies have addressed this issue. We propose two distance-based and timer-based broadcast suppression techniques: 15P(15percent) and slotted 15P. In the first (distance based) scheme, node's transmission range is divided into three ranges (80%,15%and5%). Only nodes within 15% range will rebroadcast received packet. Specific packet retransmission range (15%) is introduced to reduce the number of messages reforwarding nodes that will mitigate the broadcaststorm. In the second (timer-based) scheme, waiting time allocation for nodes within 15% range isused to significantly reduce the broadcaststorm. The proposed schemes are distributed and reliedon GPS information and do not requireany other prior knowledge about network topology. To analyze the performance of proposed schemes, statistics such as link load and the number of retransmitted nodes are presented. Our simulation results show that the proposed schemes can significantly reduce link load at high node densities up to 90 percent compared to a simple broadcast flooding technique.

  • PDF

Relationship between the sexual and the vegetative organs in a Polygonatum humile (Liliaceae) population in a temperate forest gap

  • Min, Byeong-Mee
    • Journal of Ecology and Environment
    • /
    • v.41 no.9
    • /
    • pp.256-264
    • /
    • 2017
  • Background: The aim of this study was to clarify the relationship between the sexual reproduction and the resource allocation in a natural Polygonatum humile population grown in a temperate mixed forest gap. For this aim, the plant size, the node which flower was formed, the fruiting rate, and the dry weight of each organ were monitored from June 2014 to August 2015. Results: Firstly, in 3-13-leaf plants, plants with leaves ${\leq}8$ did not have flowers and in plants with over 9 leaves the flowering rate increased with the number of leaves. Among plants with the same number of leaves, the total leaf area and dry weight of flowering plants were larger than those of non-flowering plants. The minimum leaf area and dry weight of flowering plants were $100cm^2$ and 200 mg, respectively. Secondary, the flowers were formed at the 3rd~8th nodes, and the flowering rate was highest at the 5th node. Thirdly, cumulative values of leaf properties from the last leaf (the top leaf on a stem) to the same leaf rank were greater in a plant with a reproductive organ than in a plant without a reproductive organ. Fourthly, fruit set was 6.1% and faithful fruit was 2.6% of total flowers. Biomasses of new rhizomes produced per milligram dry weight of leaf were $0.397{\pm}190mg$ in plants that set fruit and $0.520{\pm}0.263mg$ in plants that did not, and the difference between the 2 plant groups was significant at the 0.1% level. Conclusions: P. humile showed that the 1st flower formed on the 3rd node from the shoot's base. And P. humile showed the minimum plant size needed in fruiting, and fruiting restricted the growth of new rhizomes. However, the fruiting rate was very low. Thus, it was thought that the low fruiting rate caused more energy to invest in the rhizomes, leading to a longer rhizome. A longer rhizome was thought to be more advantageous than a short one to avoid the shading.