• Title/Summary/Keyword: Node Area

Search Result 854, Processing Time 0.027 seconds

IPv6 Networking with Subnet ID Deprecated

  • Kim, Young Hee;Kim, Dae Young;Park, Jong Won
    • Journal of Computing Science and Engineering
    • /
    • v.11 no.2
    • /
    • pp.49-57
    • /
    • 2017
  • This paper proposes a new IPv6 networking paradigm as a counter answer to the rationale for locator/identifier separation. Instead of involving separate number spaces each for node identifiers and locators, the context of the IP address as a node identifier alone is utilized and no additional locators are incorporated. That is, there are only node addresses and no locators, and location information is indirectly derived from neighbor relations between nodes. In order to accomplish this, no subnet IDs are utilized; the ID value is set to zero for all subnets. The paper details how to construct this paradigm through novel choice of operational policies in various IPv6 protocols and some trivial modifications. Especially, inherent provision of intra-domain node- as well as subnet-mobility by use of standard link-state intra-domain routing protocols is discussed. A number of important advantages of this paradigm over the canonical IPv6 networking and various known solutions of locator/identifier separation are discussed. Tailoring for multi-area domains and IPv4 is left for further study.

A Study on Region-based Secure Multicast in Mobile Ad-hoc Network (Mobile Ad-hoc Network에서 영역기반 보안 멀티캐스트 기법 연구)

  • Yang, Hwanseok
    • Journal of Korea Society of Digital Industry and Information Management
    • /
    • v.12 no.3
    • /
    • pp.75-85
    • /
    • 2016
  • MANET is a network composed only mobile network having limited resources and has dynamic topology characteristics. Therefore, every mobile node acts as a route and delivers data by using multi-hop method. In particular, group communication such as multicast is desperately needed because of characteristics such as battery life of limited wireless bandwidth and mobile nodes. However, the multicast technique can have different efficient of data transmission according to configuring method of a virtual topology by the movement of the nodes and the performance of a multicast can be significantly degraded. In this paper, the region based security multicast technique is proposed in order to increase the efficiency of data transmission by maintaining an optimal path and enhance the security features in data transmission. The group management node that manages the state information of the member nodes after the whole network is separated to area for efficient management of multicast member nodes is used. Member node encrypts using member key for secure data transmission and the security features are strengthened by sending the data after encrypted using group key in group management node. The superiority of the proposed technique in this paper was confirmed through experiments.

The 3 Dimensional Triangulation Scheme based on the Space Segmentation in WPAN

  • Lee, Dong Myung;Lee, Ho Chul
    • Journal of Engineering Education Research
    • /
    • v.15 no.5
    • /
    • pp.93-97
    • /
    • 2012
  • Most of ubiquitous computing devices such as stereo camera, ultrasonic sensor based MIT cricket system and other wireless sensor network devices are widely applied to the 2 Dimensional(2D) localization system in today. Because stereo camera cannot estimate the optimal location between moving node and beacon node in Wireless Personal Area Network(WPAN) under Non Line Of Sight(NLOS) environment, it is a great weakness point to the design of the 2D localization system in indoor environment. But the conventional 2D triangulation scheme that is adapted to the MIT cricket system cannot estimate the 3 Dimensional(3D) coordinate values for estimation of the optimal location of the moving node generally. Therefore, the 3D triangulation scheme based on the space segmentation in WPAN is suggested in this paper. The measuring data in the suggested scheme by computer simulation is compared with that of the geographic measuring data in the AutoCAD software system. The average error of coordinates values(x,y,z) of the moving node is calculated to 0.008m by the suggested scheme. From the results, it can be seen that the location correctness of the suggested scheme is very excellent for using the localization system in WPAN.

Novel Architecture of Self-organized Mobile Wireless Sensor Networks

  • Rizvi, Syed;Karpinski, Kelsey;Razaque, Abdul
    • Journal of Computing Science and Engineering
    • /
    • v.9 no.4
    • /
    • pp.163-176
    • /
    • 2015
  • Self-organization of distributed wireless sensor nodes is a critical issue in wireless sensor networks (WSNs), since each sensor node has limited energy, bandwidth, and scalability. These issues prevent sensor nodes from actively collaborating with the other types of sensor nodes deployed in a typical heterogeneous and somewhat hostile environment. The automated self-organization of a WSN becomes more challenging as the number of sensor nodes increases in the network. In this paper, we propose a dynamic self-organized architecture that combines tree topology with a drawn-grid algorithm to automate the self-organization process for WSNs. In order to make our proposed architecture scalable, we assume that all participating active sensor nodes are unaware of their primary locations. In particular, this paper presents two algorithms called active-tree and drawn-grid. The proposed active-tree algorithm uses a tree topology to assign node IDs and define different roles to each participating sensor node. On the other hand, the drawn-grid algorithm divides the sensor nodes into cells with respect to the radio coverage area and the specific roles assigned by the active-tree algorithm. Thus, both proposed algorithms collaborate with each other to automate the self-organizing process for WSNs. The numerical and simulation results demonstrate that the proposed dynamic architecture performs much better than a static architecture in terms of the self-organization of wireless sensor nodes and energy consumption.

A Prediction-based Energy-conserving Approximate Storage and Query Processing Schema in Object-Tracking Sensor Networks

  • Xie, Yi;Xiao, Weidong;Tang, Daquan;Tang, Jiuyang;Tang, Guoming
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.5 no.5
    • /
    • pp.909-937
    • /
    • 2011
  • Energy efficiency is one of the most critical issues in the design of wireless sensor networks. In object-tracking sensor networks, the data storage and query processing should be energy-conserving by decreasing the message complexity. In this paper, a Prediction-based Energy-conserving Approximate StoragE schema (P-EASE) is proposed, which can reduce the query error of EASE by changing its approximate area and adopting predicting model without increasing the cost. In addition, focusing on reducing the unnecessary querying messages, P-EASE enables an optimal query algorithm to taking into consideration to query the proper storage node, i.e., the nearer storage node of the centric storage node and local storage node. The theoretical analysis illuminates the correctness and efficiency of the P-EASE. Simulation experiments are conducted under semi-random walk and random waypoint mobility. Compared to EASE, P-EASE performs better at the query error, message complexity, total energy consumption and hotspot energy consumption. Results have shown that P-EASE is more energy-conserving and has higher location precision than EASE.

A Cluster-based Routing Protocol with Energy Consumption Balance in Distributed Wireless Sensor Networks (분산 무선센서 네트워크의 클러스터-기반 에너지 소비 균형 라우팅 프로토콜)

  • Kim, Tae-Hyo;Ju, Yeon-Jeong;Oh, Ho-Suck;Kim, Min-Kyu;Jung, Yong-Bae
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.15 no.4
    • /
    • pp.155-161
    • /
    • 2014
  • In this paper, a cluster-based routing protocol in distributed sensor network is proposed, which enable the balanced energy consumption in the sensor nodes densely deployed in the sensor fields. This routing protocol is implemented based on clusters with hierarchical scheme. The clusters are formed by the closely located sensor nodes. A cluster node with maximum residual energy in the cluster, can be selected as cluster head node. In routing, one of the nodes in the intersection area between two clusters is selected as a relay-node and this method can extend the lifetime of all the sensor nodes in view of the balanced consumption of communication energy.

Indolent Metastatic Squamous Cell Carcinoma of Unknown Primary in the Intrathoracic Lymph Node: A Case Report and Review of the Literatures

  • Kim, Min Jin;Lim, Sang Hyok;Han, Su Jung;Choi, Kang Hyug;Lee, Sun Hyo;Park, Min Woo;Kang, HyeRan;Na, Ju Ock
    • Tuberculosis and Respiratory Diseases
    • /
    • v.78 no.1
    • /
    • pp.23-26
    • /
    • 2015
  • Metastatic squamous cell carcinoma from a cancer of unknown primary (CUP) affecting the intrathoracic lymph node is very rare. We reported a case of metastatic squamous cell carcinoma in the hilar and interlobar lymph node from a patient with CUP and reviewed the associated literature. Abnormal mass in the right hilar area was incidentally detected. A chest computed tomography scan showed a 2.5-cm diameter mass in the right hilum that had changed little in size for 3 years. The patient underwent a right pneumonectomy and mediastinal lymph node dissection. A metastatic squamous cell carcinoma in the hilar and interlobar lymph nodes without a primary lung or other lesion was diagnosed. The patient received adjuvant chemotherapy for a diagnosis of T0N1M0 lung cancer.

An Effective Algorithm for Diagnosing Sensor Node Faults (효율적인 센서 노드 고장 진단 알고리즘)

  • Oh, Won-Geun;Lee, Sung-Keun
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.10 no.2
    • /
    • pp.283-288
    • /
    • 2015
  • The possible erroneous output data of the sensor nodes can cause the performance limit or the degradation of the reliability in the whole wireless sensor networks(WSN). In this paper, we propose a new sensor node scheme with multiple sensors and a new fault diagnostic algorithm. The algorithm can increase the reliability of the whole WSNs by utilizing measurements of the multiple sensors on the node and by determining the validity of the date by comparing the value of each sensor. It can increase the cost and complexity of the node, but is suitable for the area where the high reliability is critical.

A Case of Cervical Malignant Lymphoma Coexisted with Multicentric Castleman's Disease (다발성 캐슬만병과 공존한 경부 악성 림프종 1례)

  • Jang, Gyu Ho;Jung, Young Do;Seo, Youn Tae;Kim, Jeong Kyu
    • Korean Journal of Head & Neck Oncology
    • /
    • v.32 no.2
    • /
    • pp.35-39
    • /
    • 2016
  • Castleman's disease (CD) is an uncommon lymphoproliferative disorder. The disease entity is classified into 2 clinical subtypes, unicentric and multicentric type. Prevalence of lymphoid malignancy in multicentric CD (MCD) is very low. In this case, we report a case of 77 years old woman who developed high fever and swelling in both side of her neck. Neck lymph node biopsy revealed plasma cell hyperplasia. Patient's symptom was subsided after treatment with Dexamethasone. Three months later, multiple lymph node enlargement was developed in abdomen and neck area again. Repeated neck lymph node biopsy confirmed diffuse large B cell lymphoma. The patient started chemotherapy.

Maize with Multiple Ears and and Tillers(MET) IV. Leaf Characteristics of IK Type Maize with Tillers (다얼성 옥수수 연구 IV. IK형 분얼 옥수수의 잎 특성)

  • Choe, Bong-Ho;Lee, Hee-Bong;Lee, Won-Koo;Kang, Kwon-Kyu;Choi, Chang-Yeol
    • KOREAN JOURNAL OF CROP SCIENCE
    • /
    • v.34 no.4
    • /
    • pp.364-369
    • /
    • 1989
  • Leaf characteristics of main stem and tiller of IK type maize (IK/ /IRI/B68) were compared with those of Jinjoo Ok hybrid which are not usually tillered. A total of nine leaves from flag leaf to the third or the fourth leaf below ear-bearing node were sampled from each stem or tiller. There was no significant difference in mean leaf length between IK/ /IRI/B68 and Jinjoo Ok. But the mean leaf width of IK/ /IRI/ B68 was about 2 cm narrower than that of Jinjoo Ok. The mean leaf area of the IK/ /IRI/B68 was also smaller than that of Jinjoo Ok due to the narrower leaf width. There were not significant differences in mean leaf characteristics between main stem and tillers of IK/IRI/B68. The longest leaf was the leaf below the ear-bearing node and the widest leaf was the leaf just above the ear-bearing node. Mean length. width and area of leaf on main stem and tillers were similar. Coefficients of variation calculated for individual leaf indicated that the leaves near the ear-bearing node were more uniform than others. The leaf area measured was significantly greater than that estimated by formular, length x width x 0.75. New constant to estimate leaf area of tillering maize was derived as 0.8.

  • PDF