• Title/Summary/Keyword: network time-delay

Search Result 1,471, Processing Time 0.028 seconds

Application of artificial neural networks to predict total dissolved solids in the river Zayanderud, Iran

  • Gholamreza, Asadollahfardi;Afshin, Meshkat-Dini;Shiva, Homayoun Aria;Nasrin, Roohani
    • Environmental Engineering Research
    • /
    • v.21 no.4
    • /
    • pp.333-340
    • /
    • 2016
  • An Artificial Neural Network including a Radial Basis Function (RBF) and a Time Delay Neural Network (TDNN) was used to predict total dissolved solid (TDS) in the river Zayanderud. Water quality parameters in the river for ten years, 2001-2010, were prepared from data monitored by the Isfahan Regional Water Authority. A factor analysis was applied to select the inputs of water quality parameters, which obtained total hardness, bicarbonate, chloride and calcium. Input data to the neural networks were pH, $Na^+$, $Mg^{2+}$, Carbonate ($CO{_3}^{-2}$), $HCO{_3}^{-1}$, $Cl^-$, $Ca^{2+}$ and Total hardness. For learning process 5-fold cross validation were applied. In the best situation, the TDNN contained 2 hidden layers of 15 neurons in each of the layers and the RBF had one hidden layer with 100 neurons. The Mean Squared Error and the Mean Bias Error for the TDNN during the training process were 0.0006 and 0.0603 and for the RBF neural network the mentioned errors were 0.0001 and 0.0006, respectively. In the RBF, the coefficient of determination ($R^2$) and the index of agreement (IA) between the observed data and predicted data were 0.997 and 0.999, respectively. In the TDNN, the $R^2$ and the IA between the actual and predicted data were 0.957 and 0.985, respectively. The results of sensitivity illustrated that $Ca^{2+}$ and $SO{_4}^{2-}$ parameters had the highest effect on the TDS prediction.

The Design of ONU and OLT for Dynamic Bandwidth Allocation on Ethernet PON (EPON의 동적대역폭할당을 위한 ONU와 OLT 설계)

  • 이순화;이종호;김장복
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.28 no.11B
    • /
    • pp.1016-1022
    • /
    • 2003
  • The EPON has been actively studied as one of the access networks for the economic configuration of FTTH. The EPON must support the dynamic bandwidth allocation to the subscribers in order to support the QoS due to its base on Ethernet technology EFM SG, which is actively working for the standardization of EPON, also recently decided to select DBA. Therefore in this paper, we designed a ONU buffer scheduling algorithm(AIWFQ) and a scheme of DBA(Class-based FCFS) for the OLT suitable for embodying MPCP of the EPON. In this paper, we proposed methods that the EPON system can make use of by measuring end to end process delay time and the buffer size in order to implement the algorithm by using the OPNET.

The Design of ONU and OLT for Dynamic Bandwidth Allocation on Ethernet PON (EPON의 동적대역폭할당을 위한 ONU와 OLT 설계)

  • 이순화;이종호;김장복
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.29 no.2B
    • /
    • pp.272-278
    • /
    • 2004
  • The EPON has been actively studied as one of the access networks for the economic configuration of FTTH. The EPON must support the dynamic bandwidth allocation to the subscribers in order to support the QoS due to its base on Ethernet technology. EFM SG, which is actively working for the standardization of EPON, also recently decided to select DBA. Therefore in this paper, we designed a ONU buffer scheduling algorithm (AIWFQ) and a scheme of DBA(Class-based FCFS) for the OLT suitable for embodying MPCP of the EPON. In this paper, we proposed methods that the EPON system can make use of by measuring end to end process delay time and the buffer size in order to implement the algorithm by using the OPNET.

Spatial Reuse based on Power Control Algorithm Ad hoc Network (IEEE 802.11 기반의 모바일 애드 혹 네트워크에서 전력제어 알고리즘을 통한 공간 재사용)

  • Lee, Seung-Dae;Jung, Yong-Chae
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.11 no.1
    • /
    • pp.119-124
    • /
    • 2010
  • The MAC layer in ad-hoc network which makes network of nodes without infrastructure for a time has became an issue to reduce delay, allocate fairly bandwidth, control TX/RX power and improve throughput. Specially, the problem to reduce power consumption in ad-hoc network is very important part as ad-hoc devices use the limited battery. For solution of the problem, many power control algorithms, such as distribute power control, PCM (Power Control MAC) and F-PCF (Fragmentation based PCM), are proposed to limit power consumption until now. Although the algorithms are designed to minimize power consumption, the latency communication zone is generated by power control of RX/TX nodes. However the algorithms don't suitably reuse the space. In this paper proposes the algorithm to improve data throughput through Spatial Reuse based on a power control method.

A Study on Construction of Roundabouts considering the Effects for Adjacent Intersections in Urban Network (인접교차로 영향을 고려한 회전교차로 도입방안 연구)

  • Lee, Dong-Min;Kim, Do-Hun
    • Journal of Korean Society of Transportation
    • /
    • v.29 no.5
    • /
    • pp.79-89
    • /
    • 2011
  • Though many studies regarding roundabout have been recently conducted, most of them have focused on operational aspect. Moreover, majority of the previous researches analyzes operational effects of single roundabout, but seldom investigate the effects of multi-roundabouts constructed on road networks. In this study, we seek ways to construct multiple roundabouts on road network maximizing their operational effects. The analysis investigate influence of both adjacent signalized and unsignalized intersections as well as influence of the distance from those intersections to roundabouts. The results show that the optimal distance between two adjacent intersections were calculated to be 150m, and any two intersections located within 150m apart influence each other thus imposing operational restrictions on each other. In addition, those results are confirmed using simulation analysis conducted on the real urban network in Nonheon regional area, Incheon City.

Performance Analysis of Position Based Routing Protocol for UAV Networks (UAV 네트워크 환경에 적합한 위치기반 라우팅 프로토콜의 성능 분석)

  • Park, Young-Soo;Jung, Jae-Il
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37 no.2C
    • /
    • pp.188-195
    • /
    • 2012
  • Many systems are developing for the realization of NCW(Network Centric Warfare). UAV(Unmanned Aerial Vehicle) Network is attracting attention in a lot of military applications. In general, UAVs have the potential to create an ad-hoc network and greatly reduce the hops from source to destination. However, UAV networks exhibit unique properties such as high mobility, high data rate, and real time service. The routing protocols are required to design the multi-hop routing protocols that can dynamically adapt to the requirements of UAV network. In this paper we analyse Geographic Routing Protocol is based on geographical distance between source and destination for efficient and reliable transmission. Geographic Routing Protocol is evaluated in video service scenarios with TDMA model in our simulation. The simulation results show that the performance of Geographic Routing Protocol is better than the MANET Routing Protocol in terms of packet received ratio, end to end delay, and routing traffic sent.

A Novel Instruction Set for Packet Processing of Network ASIP (패킷 프로세싱을 위한 새로운 명령어 셋에 관한 연구)

  • Chung, Won-Young;Lee, Jung-Hee;Lee, Yong-Surk
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.9B
    • /
    • pp.939-946
    • /
    • 2009
  • In this paper, we propose a new network ASIP(Application Specific Instruction-set Processor) which was designed for simulation models by a machine descriptions language LISA(Language for Instruction Set Architecture). This network ASIP is aimed for an exclusive engine undertaking packet processing in a router. To achieve the purpose, we added a new necessary instruction set for processing a general ASIP based on MIPS(Microprocessor without Interlock Pipeline Stages) architecture in high speed. The new instructions can be divided into two groups: a classification instruction group and a modification instruction group, and each group is to be processed by its own functional unit in an execution stage. The functional unit was optimized for area and speed through Verilog HDL, and the result after synthesis was compared with the area and operation delay time. Moreownr, it was allocated to the Macro function ana low-level standardized programming language C using CKF(Compiler Known Function). Consequently, we verified performance improvement achieved by analysis and comparison of execution cycles of application programs.

Deciding Priority of Safety Messages using Decision Tree in IEEE 802.11p/1609.4 Vehicular Network (802.11p/1609 차량네트워크에서 Decision Tree를 이용한 안전메세지 우선순위 결정 기법)

  • Baik, Hyein;Kwon, YongHo;Rhee, Byung Ho
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2015.10a
    • /
    • pp.794-797
    • /
    • 2015
  • As the interest in VANET is increased, a study on the beacon message transmission between vehicles is actively being made. IEEE 802.11p/1609.4 standard is based on a multichannel system consisting of multiple service channels (SCH) and a control channel (CCH). Multiple SCHs are defined for nonsafety data transfer, while the CCH is used to broadcast safety messages called beacons and control messages (i.e., service advertisement messages). However, most messages broadcast in the only one CCH belong to safety application that must be contested in dense vehicular network. This paper suggests safety message transfer algorithm in dense vehicular congestion. The proposed algorithm is that the priority of safety messages is decided by decision tree and messages are stored in proper queues according to their priorities. Then, safety messages with higher priorities are sent in turn by CCH in the assigned time. The proposed algorithm decreases the beacon transmission delay and increase on the probability of a successful beacon reception in an IEEE 802.11p/1609.4-based network.

  • PDF

Dynamic Bandwidth Allocation Scheme with Considering Downstream Traffic in EPON (EPON에서 하향 데이터 전송을 고려한 동적 대역폭 할당 방안)

  • Kim Eun-Chul;Lee Kang-Won;Choi Young-Soo;Cho You-Ze
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.42 no.12
    • /
    • pp.37-44
    • /
    • 2005
  • This paper proposes a hybrid scheme for dynamic bandwidth allocation(DBA) in Ethernet passive optical network(EPON), which combines advantages of adaptive cycle and constant cycle-based schemes. The proposed scheme is based on IPACT scheme, but it operates as adaptive cycle or constant cycle mode according to the queue status of optical line terminal(OLT) for downstream transmission. Simulation results showed that the proposed scheme could achieve a similar throughput in downstream transmission to a constant cycle-based DBA scheme, while producing a similar delay performance to the IPACT scheme in upstream transmission.

Priority-based reservation protocol for variable-length messages in a WDM-based optical subscriber network (WDM 기반의 광 가입자 망에서 우선순위 기반의 효율적인 가변 길이 메시지 예약 프로토콜)

  • Lee Jae hwoon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.4B
    • /
    • pp.153-161
    • /
    • 2005
  • In a multi-channel network based of wavelength division multiplexing (WDM) technology, an efficient protocol is needed in order for the transmitter and receiver to be tuned to the same wavelength during message transmission time. This paper proposes a priority-based reservation protocol that can efficiently support variable-length messages that require different QoS requirements. In this proposed protocol, high-priority nodes can reserve the data channel before low-priority nodes. However, once a node reserves a data channel successfully, it can persistently use the reserved channel till message transmission is finished regardless of the priority of the node. Moreover, the protocol can operate independently of the number of nodes, and any new node can join the network anytime without requiring network re-initialization. The protocol is analyzed with a finite population model and the throughput-delay characteristics are investigated as performance measures.