• Title/Summary/Keyword: Border Nodes

Search Result 34, Processing Time 0.026 seconds

Fair Scheduling for Throughput Improvement in Wireless Mesh Networks

  • Tran, Nguyen H.;Hong, Choong-Seon
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2007.05a
    • /
    • pp.1310-1312
    • /
    • 2007
  • Throughput improvement problem in wireless mesh network can be alleviated by equipped mesh router with multiple radios tuned into orthogonal channels. However, some links on the same channel also can be activated concurrently if the Signal-to-Noise and Interference Ratio (SNIR) at their receiver endpoints is not lower than the threshold. We propose a greedy algorithm to investigate the problem of how to schedule a set of feasible transmission under physical interference model by using the spatial time-division multiple-access (STDMA) scheme. We also consider the fairness in scheduling to prevent some border nodes from starvation. We evaluate our algorithms through extensive simulation and the results show that our algorithms can achieve better aggregate throughput and fairness performance than 802.11 standard.

  • PDF

Positioning of the Base Station at Wireless Sensor Network (무선 센서 네트워크에서 기지국의 위치선정)

  • Cho, Do-Hyeoun;Lee, Jong-Young;Lee, Sang-Hun;Choi, Jin-Tak
    • Proceedings of the IEEK Conference
    • /
    • 2008.06a
    • /
    • pp.1189-1190
    • /
    • 2008
  • Wireless sensor networks (WSN) have attracted much attention in recent years due to their potential use in many applications such as border protection and combat field surveillance. Given the criticality of such applications, maintaining a dependable operation of the network is a fundamental objective. However, the resource constrained nature of sensor nodes and the ad-hoc formation of the network, often coupled with an unattended deployment, pose non-conventional challenges and motivate the need for special techniques for dependable design and management of WSN. In this article, we highlight the potential of careful positioning of the base station (BS), which acts as a sink resources.

  • PDF

D-DoS Attack Prevention Using Improved 'Approximated VC' in AS Network Topology (향상된 VC 근사기법을 이용한 AS망에서의 D-DoS 공격의 효율적 차단)

  • Kim, Han-Soo;Lee, Hoon-Jae;Jang, Ju-Wook
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2003.11b
    • /
    • pp.911-914
    • /
    • 2003
  • The prevention of D-Dos Attack requires to install filters at As border routers. This follows that finding minimum number of filters - VC(Vertex Cover), which is NP-complete problem. So, We propose improved 'Approximate VC' which is more efficient to real AS topology using topology property. Simulation shows that our algorithm, improved 'Approximated VC' enables us to reduce 25% VC nodes in comparison with 'Approximated VC'.

  • PDF

Study on the Characteristics of the Korea Internet AS-Level Topology Using Node Degree and Node Connectivity Metrics

  • Oh, Dong Ik;Lee, Kang Won
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.38B no.6
    • /
    • pp.417-426
    • /
    • 2013
  • The Korea Internet AS-level topology was constructed using three data sources: Border Gateway Protocol (BGP) trace collector, Internet Routing Registry (IRR), and Internet Exchange Point (IXP). It has 685 nodes and 1,428 links. The Korea Internet AS-level topology is a small regional subgraph of the massive global one. We investigate how well the Korea Internet preserves the topological characteristics of the global one or how different they are. We carefully select several topology metrics that can analyze the characteristics of the Korea Internet AS-level topology. We also investigate how well Internet topology generators can represent the characteristics of the Korea Internet AS-level topology.

Improving the Network Lifetime of WSNs by Using Control of Sensor Nodes in Border Surveillance (국경 감시망 환경하에서 센서 노드 제어를 통한 네트워크 수명 향상)

  • Lee, Jae-Hun;Kim, Dong-Wan;An, Sun-Shin;Boudriga, Noureddine
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2014.11a
    • /
    • pp.164-167
    • /
    • 2014
  • 무선 센서 네트워크를 이용한 국경 감시망 시스템은 기존 센서 네트워크의 요구 조건인 효율적인 에너지 사용을 만족함과 동시에 침입자에 대한 신속하고 정확한 감지가 요구된다. 본 논문에서는 이러한 요구 사항을 만족하기 위해 위치에 따라 그룹화된 센서 노드들의 센싱 모듈을 차등적으로 sleep 하는 방법과 전송파워를 동적으로 조절하는 방법을 제안한다. 그리고 이를 통해 효율적인 에너지 소비 및 신속한 감지를 하는 시스템을 구축하고, 논문에서 제안하는 기법의 성능 향상을 확인한다.

Free Vibration Analysis of Thick Plate Subjected to In-plane Force on Inhomogeneous Pasternak Foundation (비균질 Pasternak지반 위에 놓인 면내력을 받는 후판의 진동해석)

  • Lee, Yong Soo;Kim, Il Jung;Oh, Soog Kyoung
    • Journal of Korean Society of Steel Construction
    • /
    • v.15 no.3
    • /
    • pp.291-298
    • /
    • 2003
  • Recently, as the size of buildings structure becomes large increases, their mat area of building structure is supported or by an inhomogeneous foundation. This paper presents a vibration analysis on thick plates subjected to in-plane force is presented in this paper. The rectangular plate is isotropic, homogeneous, and composed of a linearly elastic material. A vibration analysis of the rectangular thick plate iwas done by useing ofarectangular finite element with 8 nodes and 9 nodes. In this study, the foundation was idealized as a Pasternak foundation model. A Pasternak foundation haves a shear layer on Winkler's model, which idealizes the foundation as a vertical spring. In order tTo analysze the vibration of a plate supported on by an inhomogeneous Pasternak foundation, the value of the Winkler foundation parameter of the central and border zones of the plate awere chosen as WFP1 and WFP2. (fFigure 4.). The Winkler foundation parameter of WFP1 and WFP2 is varied from 0 to 10, $10^2$, and $10^3$ and the shear foundation parameters is were 0, 5, and 10. The ratio of the in-plane force to the critical load iwas applied as 0.4 to 0.8

A Minimum Interference Channel Assignment Algorithm for Performance Improvement of Large-Scale Wireless Mesh Networks (대규모 무선 메쉬 네트워크의 성능 향상을 위한 최소 간섭 채널 할당 알고리즘)

  • Ryu, Min-Woo;Cha, Si-Ho;Cho, Kuk-Hyun
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.10B
    • /
    • pp.964-972
    • /
    • 2009
  • Wireless mesh network (WMN) is emerging a future core technology to resolve many problems derived from exist wireless networks by employing multi-interface and multi-channel. Ability to utilize multiple channels in WMNs substantially increases the effective bandwidth available to wireless network nodes. However, minimum interference channel assignment algorithms are required to use the effective bandwidth in multi-channel environments. This paper proposes a cluster-based minimum interference channel assignment (MI-CA) algorithm to improve the performance of WMN. The MI-CA algorithm is consists of Inter-Cluster and Intra-Cluster Intrchannel assignment between clusters and in the internal clusters, respectively. The Inter-Cluster channel assignment assigns a barebone channel to cluster heads and border nodes based on minimum spanning tree (MST) and the Intra-Cluster channel assignment minimizes channel interference by reassigning ortasgonal channels between cluster mespann. Our simheation results show that MI-CA can improve the performance of WMNs by minimizing channel interference.

The Design for Traffic Container to use resources efficiently in DiffServ (DiffServ의 효율적인 자원활용을 위한 트래픽 컨테이너 설계)

  • Jang, Kyung-Sung;Kang, Dae-Wook
    • The KIPS Transactions:PartC
    • /
    • v.11C no.1
    • /
    • pp.115-122
    • /
    • 2004
  • Diff-Serv is a mechanism by which network service providers can offer differing levels of network service to different traffic, in so providing quality of service (QoS) to their customers. Because this mechanism has been deployed just for fixed hosts with the Token Bucket mechanism, DiffServ have been suggested can not satisfy the mobility service or the differential serrlce for Individual traffics. In this paper, we suggest WFQ mechanism for traffic conditioner and scheduling method for monitoring the AggF(Aggregate Flow) which will be controlled in edge nodes and border routers. So it will control traffic rate dynamically and suggest efficient usability of bandwidth.

CONTRALATERAL NECK LYMPH NODE METASTASIS OF EARLY TONGUE CANCER : A CASE REPORT (반대측 경부 림프절로 전이된 초기 설암의 치험례)

  • Kwon, Myung-Hee;Kim, Sung-Il;Kim, Pyoung-Soo;Leem, Dae-Ho;Shin, Hyo-Keun;Ko, Seung-O
    • Journal of the Korean Association of Oral and Maxillofacial Surgeons
    • /
    • v.35 no.5
    • /
    • pp.376-379
    • /
    • 2009
  • Likely to be the most common oral cancer, squamous cell carcinoma(SCC) of the tongue accounts for about 20% of all oral and pharyngeal cancers. SCC of the tongue frequently arises in the lateral border, and if it metastasize, it occurs on submandibular gland and neck lymph nodes. Location of the primary lesions and neck lymph node metastasis affect the prognosis and decrease survival rate of patients with carcinoma of the tongue. The authors experienced the patient with contralateral neck lymph node metastasis of SCC of the tongue. The patient came to our department with chief complaint of elevated lesion on left lateral border of the tongue. The mass was diagnosed as $T_2N_0M_0$, Stage II invasive SCC of oral tongue. Computed tomography(CT) & magnetic resonance imaging(MRI) which were taken before the operation showed no significant finding of metastasis. Surgical mass removal and preventive neck dissection on the left side were done. While follow up PET/CT, contralateral neck lymph node metastasis(right side, level II) was detected, and re-operation(Rt. side RND) was done. There are few studies concerning the contralateral neck lymph node metastasis related with SCC of the tongue. The purpose of this report is to introduce the uncommon case of contralateral neck lymph node metastasis occurred in the $T_2$-stage of SCC of the tongue treated by surgical resection.

Fan-shaped Search Zone Routing Protocol for Ship Ad Hoc Networks (선박 애드 혹 네트워크를 위한 부채꼴 탐색구역 경로배정 프로토콜)

  • Son, Joo-Young
    • Journal of KIISE:Information Networking
    • /
    • v.35 no.6
    • /
    • pp.521-528
    • /
    • 2008
  • Such conventional maritime communication technologies as radio have short some comings in their transmission quality. It can be overcome by wireless channels provided by satellites such as INMARSAT, which nevertheless suffer from the high costs. In this paper, we propose a novel technology resolving the above problems, featuring in the establishment of maritime communication networks with multi-hop structures. The inter vessel and ship-to- shore networks previously modeled after MANET are remodeled by SANET (Ship Ad Hoc Networks) in the present work. Fan-shaped Search Zone Routing (FSR) protocol also is presented, which utilizes not only static geographical information including the locations of ports and the navigations of courses but also the unique characteristics of ships in terms of mobile nodes. The FSR finds the fan-shaped search zone on which the shortest path is located. The performance of LAR protocol is compared with that of FSR in several ways. First, FSR does not make use of a type of control packets as beaconing data, resulting in a full utilization of the bandwidth of the wireless channels. Second, the delivery rate by the FSR is 100% for the fan-shaped search zone includes at least one route between source and destination nodes on its border line, where as that of LAR has been turned out to be 64%. Third, the optimality of routes searched by the FSR is on a 97% level. Of all, the FSR shows a better performance than LAR by about 50%.