• Title/Summary/Keyword: routing scheme

Search Result 820, Processing Time 0.023 seconds

Secure Routing Scheme in CCN-Based Mobile Ad-Hoc Networking Environments (CCN 기반 이동 애드혹 환경에서의 그룹 콘텐츠 요청을 사용한 효율적인 콘텐츠 공유 방안)

  • Shin, Jooho;Lee, Juyong;Lee, Jihoon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.39B no.12
    • /
    • pp.817-821
    • /
    • 2014
  • As users generate lots of contents independently of time and places anytime and anywhere together with a rapid development of mobile wireless communication technologies and an explosive dissemination of smart devices, content centric networking (CCN) has emerged as a new networking architecture. However, as CCN is based on one to one message exchanges, it is not appropriate for ad hoc network environment that has frequent network topology changes, which results in high control overhead and low transmission throughput. So, this paper proposes the new content sharing methods using group interest messages in CCN ad hoc environment. It is shown from the simulation that the proposed method can provide low control overhead and high transmission throughput.

An Internet Stopper Using ARP Spoofing with Automatic Node Identification (자동 노드 인식 기능을 갖는 ARP 스푸핑을 이용한 인터넷 차단기)

  • Jung, In-Hwan
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.11 no.6
    • /
    • pp.93-106
    • /
    • 2011
  • In this paper we describe an efficient and easy to use internet stopper, which is called AINS (Automatic Internet Stopper), which uses ARP spoofing scheme. Instead of forwarding packets to router for the case of hacking, in ARP spoofing, the AINS ignores all the packets so that internet stopping operates. The AINS program needs to be installed only in manager computer that does not require additional agent program. In addition to setting manually the stopping computer list, it is able to indentify network nodes automatically by analyzing broadcasting packets. The experimental results show that less than 4 secs for spoofing interval is enough for blocking internet usage regardless the number of computers and therefore network overhead is negligible. The AINS can indentify and control network nodes not only on same subnet but also on different subnet only if they are connected onto same ethernet switch physically. It is being used for an efficient tool for controling internet usage of university computer laboratory and also for an efficient network management.

CEM-PF: Cost-Effective Mobility Management Scheme Based on Pointer Forwarding in Proxy Mobile IPv6 Networks (프록시 모바일 IPv6 네트워크에서 포인터 포워딩에 기반한 비용효과적인 이동성관리 기법)

  • Park, Seung-Yoon;Jeong, Jong-Pil
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.12 no.4
    • /
    • pp.81-93
    • /
    • 2012
  • We propose efficient mobility management schemes based on pointer forwarding for Proxy Mobile IPv6 Networks(PMIPv6) with the objective to reduce the overall network traffic incurred by mobility management and packet delivery. The proposed schemes are per-user-based, i.e., the optimal threshold of the forwarding chain length that minimizes the overall network traffic is dynamically determined for each individual mobile user, based on the user's specific mobility and service patterns. We demonstrate that there exists an optimal threshold of the forwarding chain length, given a set of parameters characterizing the specific mobility and service patterns of a mobile user. We also demonstrate that our schemes yield significantly better performance than schemes that apply a static threshold to all mobile users. A comparative analysis shows that our pointer forwarding schemes outperform routing-based mobility management protocols for PMIPv6.

Implementation and TCP Performance Measurement of RED scheduler using NetFPGA platform (NetFPGA 플랫폼 기반 RED스케줄러 구현 및 TCP 성능평가)

  • Oh, Min-Kyung;Min, Seok-Hong;Kim, Byung-Chul;Lee, Jae-Yong
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.49 no.3
    • /
    • pp.27-36
    • /
    • 2012
  • With the increase of various user's requirements, lots of interesting applications on the Internet have been emerging recently. However, Internet has many limitations for providing upcoming new services because it was only designed to provide basic connectivity between research networks and simplified forwarding functions at the first time. Internet has many problems in the aspects of routing scalability, mobility, security and QoS, so lots of researches are being actively performed in many countries to solve these problems. In this paper, we implement RED(Random Early Detection) scheduler using NetFPGA platform and local testbed to provide active queue management. Using the implemented RED scheduler, packets are dropped according to the specified drop probability, so Global Synchronization coming from simultaneous TCP segment losses in a congestion condition can be prevented. With the comparison to the Drop-Tail scheme in the basic router, we show TCP performance can be enhanced in the congestion situation using the NetFPGA-based RED scheduler.

Clustering Algorithm for Extending Lifetime of Wireless Sensor Networks (무선 센서 네트워크의 수명연장을 위한 클러스터링 알고리즘)

  • Kim, Sun-Chol;Choi, Seung-Kwon;Cho, Yong-Hwan
    • Journal of the Korea Society of Computer and Information
    • /
    • v.20 no.4
    • /
    • pp.77-85
    • /
    • 2015
  • Recently, wireless sensor network(WSN) have been used in various fields to implement ubiquitous computing environment. WSN uses small, low cost and low power sensors in order to collect information from the sensor field. This paper proposes a clustering algorithm for energy efficiency of sensor nodes. The proposed algorithm is based on conventional LEACH, the representative clustering protocol for WSN and it prolongs network and nodes life time using sleep technique and changable transmission mode. The nodes of the proposed algorithm first calculate their clustering participation value based on the distance to the neighbor nodes. The nodes located in high density area will have clustering participation value and it can turn to sleep mode. Besides, proposed algorithm can change transmission method from conventional single-hop transmission to multi-hop transmission according to the energy level of cluster head. Simulation results show that the proposed clustering algorithm outperforms conventional LEACH, especially non-uniformly deployed network.

Data Dissemination Protocol for Supporting Both Sink Mobility and Event Mobility in Wireless Sensor Networks (무선 센서 네트워크에서 싱크 이동성과 이벤트 이동성을 지원하는 데이타 전달 프로토콜)

  • Choi, Young-Hwan;Lee, Dong-Hun;Ye, Tian;Jin, Min-Sook;Kim, Sang-Ha
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.14 no.3
    • /
    • pp.316-320
    • /
    • 2008
  • Data dissemination schemes for wireless sensor networks, where sinks and event targets might be mobile, has been one of the active research fields. For doing that, stationary nodes gathered data on behalf of mobile sinks and the relayed data in previous studies. their schemes, however, lead to frequent query flooding and report congestion problems over sink moving. We propose a data dissemination protocol to solve both the query flooding and the report congestion problem. Our scheme improves the two shortcomings through sink location management. Finally, we prove effectiveness of our protocol through computer simulations.

Tier-based Proactive Path Selection Mode for Wireless Mesh Networks

  • Fu-Quan, Zhang;Joe, In-Whee;Park, Yong-Jin
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.6 no.5
    • /
    • pp.1303-1315
    • /
    • 2012
  • In the draft of the IEEE 802.11s standard, a tree topology is established by the proactive tree-building mode of the Hybrid Wireless Mesh Protocol (HWMP). It is used for cases in which the root station (e.g., gateway) is an end point of the majority of the data connections. In the tree topology, the root or central stations (e.g., parent stations) are connected to the other stations (e.g., leaves) that are one level lower than the central station. Such mesh stations are likely to suffer heavily from contention in bottleneck links when the network has a high traffic load. Moreover, the dependence of the network on such stations is a point of vulnerability. A failure of the central station (e.g., a crash or simply going into sleep mode to save energy) can cripple the whole network in the tree topology. This causes performance degradation for end-to-end transmissions. In a connected mesh topology where the stations having two or more radio links between them are connected in such a way that if a failure subsists in any of the links, the other link could provide the redundancy to the network. We propose a scheme to utilize this characteristic by organizing the network into concentric tiers around the root mesh station. The tier structure facilitates path recovery and congestion control. The resulting mode is referred to as Tier-based Proactive Path Selection Mode (TPPSM). The performance of TPPSM is compared with the proactive tree mode of HWMP. Simulation results show that TPPSM has better performance.

Performance Analysis in Wireless Home Network using Bluetooth with SAW-ARQ (SAW-ARQ를 활용하여 블루투스 하에서의 무선 홈 네트워크의 성능 분석)

  • Hong, Sung-Hwa;Kang, Bong-Jik
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.11 no.5
    • /
    • pp.1608-1615
    • /
    • 2010
  • In this paper, we proposed the method called "DoublePico"(Double Piconet) forovercoming low data transmission rate in a scatternet. This needs a new Ad-hoc network topology to transmit with high rate. Every node performs the function of the relay station. DoublePico has two bluetooth devices that should form two different poconets; every node can make a link between two different piconets. Two different piconets are linked in one node by the link with two bluetooth divices thereby forming the Ad-Hoc network. In this paper, we shows the method of DoublePico which supports about 457kbps of the maximum data transmission rate. This method supports a higher data transmission rate than the traditional bluetooth's Ad-Hoc topology by using analysis and comparison of existing algorithm of bluetooth specification and simulation results. Specifically, this paper focuses on the impact of intererence on the PER (Packet Error Rate), throughput performance, and the throughput improvement with SAW(Stop and Wait)-ARQ scheme in DoublePico.

An Energy-Efficient Routing Protocol for Data Collection in Wireless Sensor Network (WSN 환경에서 데이터 수집을 위한 에너지 효율적인 전송경로 설정 프로토콜)

  • Kim, Bo-Seung;Jung, Ki-Won;Shin, Yong-Tae;Son, Young-Soo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.36 no.2A
    • /
    • pp.160-171
    • /
    • 2011
  • The one of the core technologies for ubiquitous computing is WSN. WSN detects the information from the environment around them based on the information perceived from the human and all things and manages the information by connecting to the network in realtime. In this environment, the existing research provides the mechanism that most of sensor nodes in the target area can set the transmission path using RGF. However, unrelated to the target area will be responsible for the energy consumption of nodes that are the problem. In this paper, we propose EEDCP protocol. It is designed to collect data from the specific region on sinks in WSN. EEDCP is the protocol that sets the transmission path for collection data inside the target area in WSN. And this paper is shown that the proposed scheme is more efficient in the energy efficiency and the occurrence rate of isolated nodes by comparison with the previous studies through simulation.

Energy-Efficient Clustering Scheme using Candidates Nodes of Cluster Head (클러스터헤더 후보노드를 이용한 에너지 효율적인 클러스터링 방법)

  • Cho, Young-Bok;Kim, Kwang-Deuk;You, Mi-Kyeong;Lee, Sang-Ho
    • Journal of the Korea Society of Computer and Information
    • /
    • v.16 no.3
    • /
    • pp.121-129
    • /
    • 2011
  • One of the major challenges of minimum energy consumption for wireless sensor networks(WSN) environment. LEACH protocol is hierarchical routing protocol that obtains energy efficiency by using clustering. However, LEACH protocol in each round, because the new cluster configuration, cluster configuration, whenever the energy consumed shorten the life of the network. Therefore in this paper, the cluster is formed in WSN environment in early stage and the problems with energy waste have been solved by selecting C-node. In the initial round of proposed model uses 26 percent more than traditional LEACH energy consumption. However, as the round is ongoing, it has been proved by the network simulation tool that the waste of energy could be diminished up to 35%.