• Title/Summary/Keyword: Intermediate Node

Search Result 162, Processing Time 0.03 seconds

Performance Evaluation of the MAC Protocols for WDM Metro Ring with Wavelength-Shared Nodes Connecting Broadband Access Networks (대역 액세스 망을 연결하는 파장 공유 노드 기반 WDM 메트로 링의 MAC 프로토콜 성능 평가)

  • So Won-Ho
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.43 no.1 s.343
    • /
    • pp.111-120
    • /
    • 2006
  • In this paper, a node architecture of WDM metro network for connecting broadband access networks to converge wire/wireless networks. In consideration of the proposed node architecture and network requirements we proposed and evaluated medium access control protocols. We review WDM related technologies of sub-carrier multiplexing and optical components in order to resolve the bottleneck between optical backbone networks md access networks, and a access node architecture sharing common wavelength is introduced. Source-stripping (SS) MAC protocol Is evaluated under the proposed functional node architecture. DS+IS (Destination-Stripping and Source-Stripping) and DS+IS (Destination-Stripping and Intermediate-Stripping) MAC protocols are described to increase the slot-reuse factor which is low on SS MAC protocol. The key function of new MAC protocols regards the optical switch module of proposed node architecture and helps intermediate or source access nodes for dropping slots to destinations of different wavelength group. Thus, slot-reuse factor increases as the MAC protocols reduce the unnecessary ring-rotation of transferred slots. We use a numerical analysis to expect bandwidth efficiency and maximum throughput by slot-reuse factor Throughput network simulation, the verification of throughput, queuing delay, and transmission fairness are compared among MAC protocols.

Receiver-Initiated MAC Protocol Using an Intermediate Node to Improve Performance (성능 향상을 위해 중간 노드를 이용한 개선된 수신자 주도의 MAC 프로토콜)

  • Kong, Joon-Ik;Lee, Jaeho
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.41 no.11
    • /
    • pp.1423-1430
    • /
    • 2016
  • The MAC protocols, which are classified into synchronous and asynchronous MAC protocol in the wireless sensor network, have actively studied. Especially, the asynchronous MAC protocol needs to research on the algorithm synchronizing between nodes, since each node independently operates in its own duty cycle. Typically, Receiver-Initiated MAC protocol is the algorithm synchronizing particular nodes by using beacon immediately transmitted by each node when it wakes up. However, the sender consumes unnecessary energy because it blankly waits until receiving the receiver's beacon, even if it does not know when the receiver's beacon is transmitted. In this paper, we propose the MAC protocol which can improve the performance by selecting an optimal node between a sender and a receiver to overcome the disadvantages. The simulation results show that the proposed algorithm improves energy efficiency and decreases average delay time than the conventional algorithm.

A Multistage Authentication Strategy for Reliable N-to-N Communication in CGSR based Mobile Ad Hoc Networks (CGSR 기반의 이동 애드 흑 네트워크에서 신뢰성 있는 통신을 위한 노드간 인증 기법)

  • Lee Hyewon K.;Mun Youngsong
    • Journal of KIISE:Information Networking
    • /
    • v.32 no.6
    • /
    • pp.659-667
    • /
    • 2005
  • A Mobile Ad Hoc Network(MANET) is a multi hop wireless network with no prepared base stations or centralized administrations, where flocks of peer systems gather and compose a network. Each node operates as a normal end system in public networks. In addition to it, a MANET node is required to work as a router to forward traffic from a source or intermediate node to others. Each node operates as a normal end system in public networks, and further a MANET node work as a router to forward traffic from a source or intermediate node to the next node via routing path. Applications of MANET are extensively wide, such as battle field or any unwired place; however, these are exposed to critical problems related to network management, node's capability, and security because of frequent and dynamic changes in network topology, absence of centralized controls, restricted usage on network resources, and vulnerability oi mobile nodes which results from the special MANET's character, shared wireless media. These problems induce MANET to be weak from security attacks from eavesdropping to DoS. To guarantee secure authentication is the main part of security service In MANET because networks without secure authentication are exposed to exterior attacks. In this paper, a multistage authentication strategy based on CGSR is proposed to guarantee that only genuine and veritable nodes participate in communications. The proposed authentication model is composed of key manager, cluster head and common nodes. The cluster head is elected from secure nodes, and key manager is elected from cluster heads. The cluster head will verify other common nodes within its cluster range in MANET. Especially, ID of each node is used on communication, which allows digital signature and blocks non repudiation. For performance evaluation, attacks against node authentication are analyzed. Based on security parameters, strategies to resolve these attacks are drawn up.

Finding Top-k Answers in Node Proximity Search Using Distribution State Transition Graph

  • Park, Jaehui;Lee, Sang-Goo
    • ETRI Journal
    • /
    • v.38 no.4
    • /
    • pp.714-723
    • /
    • 2016
  • Considerable attention has been given to processing graph data in recent years. An efficient method for computing the node proximity is one of the most challenging problems for many applications such as recommendation systems and social networks. Regarding large-scale, mutable datasets and user queries, top-k query processing has gained significant interest. This paper presents a novel method to find top-k answers in a node proximity search based on the well-known measure, Personalized PageRank (PPR). First, we introduce a distribution state transition graph (DSTG) to depict iterative steps for solving the PPR equation. Second, we propose a weight distribution model of a DSTG to capture the states of intermediate PPR scores and their distribution. Using a DSTG, we can selectively follow and compare multiple random paths with different lengths to find the most promising nodes. Moreover, we prove that the results of our method are equivalent to the PPR results. Comparative performance studies using two real datasets clearly show that our method is practical and accurate.

Distributed Virtual Topology Adaptation Method to Support IP Traffic in WDM Mesh Networks (WDM Mesh 네트워크에서 IP 트래픽을 수용하기 위한 분산형 가상토폴로지 적응 기법)

  • Kim, Eal-Lae;Lee, Sung-Kuen;Lee, Yong-Won;Chang, Sun-Hyok;Lee, Myung-Moon;Park, Jin-Woo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.1B
    • /
    • pp.1-10
    • /
    • 2007
  • We propose a new approach to accommodate bidirectional asymmetric traffic demands as well as unexpected dynamic internet traffic variation in the WDM mesh network by using optical networking technologies. In the proposed scheme, an intermediate node determines the optical path based on the switching statistics of IP router of the node which characterizes the Internet traffic variation, which in effect provides a dynamic and distributed traffic control over the network. It is expected to reduce the efficiency deterioration of RWA(Routing and Wavelength Assignment) due to the real-time variation of Internet traffic so that expandability and flexibility of the network can be enhanced. In this paper, we describe a methodology for traffic behavior analysis at a node, and the decision policy of the establishment/release of optical path. In addition, we evaluate the performance of the proposed scheme through the computer simulations.

Routing Protocol based on Connectivity Degree and Energy Weight (연결도와 에너지 가중치 기반의 라우팅 프로토콜)

  • Jeong, Yoon-Su
    • Journal of Convergence Society for SMB
    • /
    • v.4 no.1
    • /
    • pp.7-15
    • /
    • 2014
  • In this paper, we propose an efficient routing protocol to achieve an optimal route searching process of the network lifetime by balancing power consumption per node. The proposed protocols aim at finding energy-efficient paths at low protocol power. In our protocol, each intermediate node keeps power level and branch number of child nodes and it transmits the data the nearest neighbor node. Our protocol may minimize the energy consumption at each node, thus prolong the lifetime of the system regardless of the location of the sink outside or inside the cluster. In the proposed protocol for inter-cluster communication, a cluster head chooses a relay node from its adjacent cluster heads according to the node's residual energy and its distance to the base station. Simulation results show that proposed protocol successfully balances the energy consumption over the network, and achieves a remarkable network lifetime improvement as highly as 7.5%.

  • PDF

Sensor Network Routing using Data Aggregation (데이터 병합을 이용한 센서 네트워크 라우팅)

  • Kim, Young-Kyun
    • Journal of the Korea Computer Industry Society
    • /
    • v.8 no.4
    • /
    • pp.237-244
    • /
    • 2007
  • In this paper we investigate the benefits of a data aggregation to prolong the lifetime of wireless sensor networks. To reduce the overload of messages from source node to sink node, data aggregation technique is generally used at intermediate node in path. The DD-G(Directed Diffusion-Greedy) can diminish the consumption of node energy by establishing energy effective single path from source to destination. In this case, the nodes near sink node have some problems, i) overly concentration of energy consumption, ii) increase of message delay time. To solve these problems, we propose a new data aggregation method which consider distribution of network overload, especially at the nodes close to sink node. The result shows that it can save energy and network delay time.

  • PDF

An Efficient Shortcut Path Algorithm using Depth in Zigbee Network (Zigbee 네트워크에서 Depth를 이용한 효율적인 중간 경로 감소 알고리즘)

  • Kim, Duck-Young;Jung, Woo-Sub;Cho, Sung-Ho
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.12B
    • /
    • pp.1475-1482
    • /
    • 2009
  • In ZigBee network, using energy efficiently is necessary because ZigBee node works by battery. To use energy efficiently, it is one of the way to reduce unnecessary network traffic. In this paper, it presents efficient shortcut routing algorithm using depth of destination node in ZigBee network. In traditional tree routing, each node transfers data only to its own parent or child node, which is inefficient way. Efficient shortcut routing algorithm is also based on tree routing. However, we suggests the algorithm with using neighbor table and depth of destination that is able to transfer data to other neighbor node, not only to parent or child node. It minimizes coordinator bottleneck state and unnecessary intermediate routing path which happens in traditional tree routing.

Data Dissemination in LTE-D2D Based Vehicular Network (LTE-D2D 차량 네트워크에서 정보 전달 방법)

  • Shim, Yong-Hui;Kim, Young-Han
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.40 no.3
    • /
    • pp.602-612
    • /
    • 2015
  • Current IEEE 802.11p which is suggested for vehicle to vehicle communication supports one hop communication. Thus, it has a limitation to carry out efficient data dissemination. In this thesis, we suggest LTE-D2D based vehicle network to provide efficient data dissemination in the vehicle environment. In this network architecture, we use name based message with IP packet options and we put the intermediate vehicle node called 'super vehicle node' and each normal vehicle node in the cell requests data to the super vehicle node. The super vehicle node responses data to the normal vehicle node. Performance analysis is based mathematical modeling. We compare LTE cellular network to LTE-D2D based vehicle network about throughput according to packet delivery time.

Energy Efficient Cross Layer Multipath Routing for Image Delivery in Wireless Sensor Networks

  • Rao, Santhosha;Shama, Kumara;Rao, Pavan Kumar
    • Journal of Information Processing Systems
    • /
    • v.14 no.6
    • /
    • pp.1347-1360
    • /
    • 2018
  • Owing to limited energy in wireless devices power saving is very critical to prolong the lifetime of the networks. In this regard, we designed a cross-layer optimization mechanism based on power control in which source node broadcasts a Route Request Packet (RREQ) containing information such as node id, image size, end to end bit error rate (BER) and residual battery energy to its neighbor nodes to initiate a multimedia session. Each intermediate node appends its remaining battery energy, link gain, node id and average noise power to the RREQ packet. Upon receiving the RREQ packets, the sink node finds node disjoint paths and calculates the optimal power vectors for each disjoint path using cross layer optimization algorithm. Sink based cross-layer maximal minimal residual energy (MMRE) algorithm finds the number of image packets that can be sent on each path and sends the Route Reply Packet (RREP) to the source on each disjoint path which contains the information such as optimal power vector, remaining battery energy vector and number of packets that can be sent on the path by the source. Simulation results indicate that considerable energy saving can be accomplished with the proposed cross layer power control algorithm.