• Title/Summary/Keyword: Node Management

Search Result 1,126, Processing Time 0.028 seconds

Dynamic Session Key based Pairwise Key Management Scheme for Wireless Sensor Networks

  • Premamayudu, B;Rao, Koduganti Venkata;Varma, P. Suresh
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.12
    • /
    • pp.5596-5615
    • /
    • 2016
  • Security is one of the major challenges in the Wireless Sensor Networks (WSNs). WSNs are more vulnerable to adversarial activities. All cryptographic security services indirectly depend on key management. Symmetric key management is the best key establishment process for WSNs due to the resource constraints of the sensors. In this paper, we proposed dynamic session key establishment scheme based on randomly generated nonce value and sensor node identity, in which each sensor node is equipped with session key on expire basis. The proposed scheme is compare with five popular existing key management systems. Our scheme is simulated in OMNET++ with MixiM and presented experimental results. The analytical study and experimental results show the superiority of the proposed scheme over the existing schemes in terms of energy, storage, resilience and communication overhead.

A Mobility Management Scheme Using GQS based on the Fuzzy-logic in Wireless Mobile Ad-Hoc Networks (에드-혹 망에서 퍼지로직 기반 GQS를 이용한 이동성 관리방법)

  • Yoon, Il;Oh, Sun-Jin
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • v.9 no.2
    • /
    • pp.431-435
    • /
    • 2005
  • Mobile Ad-Hoc network is the network(MANET) of mobile nodes which has no fixed infrastructure, and mobile node in MANET can move and communicate freely each other. Recently, many researches for mobility management of mobile nodes are actively carried out by using the location information of mobile nodes. The location management is an important issue in MANET because location information of mobile node is frequently changed in MANET. In this paper, an adaptive mobility management scheme using fuzzy-logic based GQS by considering the mobile locality is proposed in order to manage location information of mobile nodes in MANET efficiently. The proposed scheme selects mobility databases adaptively from GQS by considering the locality of mobile node. The performance of the mobility management scheme proposed in this paper is evaluated by an analytic model and compared with that of existing UQS based mobility management scheme.

  • PDF

Hybrid FPMS: A New Fairness Protocol Management Scheme for Community Wireless Mesh Networks

  • Widanapathirana, Chathuranga H.;Sekercioglu, Y. Ahmet;Goi, Bok-Min
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.5 no.11
    • /
    • pp.1909-1928
    • /
    • 2011
  • Node cooperation during packet forwarding operations is critically important for fair resource utilization in Community Wireless Mesh Networks (CoWMNs). In a CoWMN, node cooperation is achieved by using fairness protocols specifically designed to detect and isolate malicious nodes, discourage unfair behavior, and encourage node participation in forwarding packets. In general, these protocols can be split into two groups: Incentive-based ones, which are managed centrally, and use credit allocation schemes. In contrast, reputation-based protocols that are decentralized, and rely on information exchange among neighboring nodes. Centrally managed protocols inevitably suffer from scalability problems. The decentralized, reputation-based protocols lacks in detection capability, suffer from false detections and error propagation compared to the centralized, incentive-based protocols. In this study, we present a new fairness protocol management scheme, called Hybrid FPMS that captures the superior detection capability of incentive-based fairness protocols without the scalability problems inherently expected from a centralized management scheme as a network's size and density grows. Simulation results show that Hybrid FPMS is more efficient than the current centralized approach and significantly reduces the network delays and overhead.

Service Deployment Strategy for Customer Experience and Cost Optimization under Hybrid Network Computing Environment

  • Ning Wang;Huiqing Wang;Xiaoting Wang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.17 no.11
    • /
    • pp.3030-3049
    • /
    • 2023
  • With the development and wide application of hybrid network computing modes like cloud computing, edge computing and fog computing, the customer service requests and the collaborative optimization of various computing resources face huge challenges. Considering the characteristics of network environment resources, the optimized deployment of service resources is a feasible solution. So, in this paper, the optimal goals for deploying service resources are customer experience and service cost. The focus is on the system impact of deploying services on load, fault tolerance, service cost, and quality of service (QoS). Therefore, the alternate node filtering algorithm (ANF) and the adjustment factor of cost matrix are proposed in this paper to enhance the system service performance without changing the minimum total service cost, and corresponding theoretical proof has been provided. In addition, for improving the fault tolerance of system, the alternate node preference factor and algorithm (ANP) are presented, which can effectively reduce the probability of data copy loss, based on which an improved cost-efficient replica deployment strategy named ICERD is given. Finally, by simulating the random occurrence of cloud node failures in the experiments and comparing the ICERD strategy with representative strategies, it has been validated that the ICERD strategy proposed in this paper not only effectively reduces customer access latency, meets customers' QoS requests, and improves system service quality, but also maintains the load balancing of the entire system, reduces service cost, enhances system fault tolerance, which further confirm the effectiveness and reliability of the ICERD strategy.

CoAP-based Time Synchronization Algorithm in Sensor Network (센서 네트워크에서의 CoAP 기반 시각 동기화 기법)

  • Kim, Nac-Woo;Son, Seung-Chul;Park, Il-Kyun;Yu, Hong-Yeon;Lee, Byung-Tak
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.52 no.3
    • /
    • pp.39-47
    • /
    • 2015
  • In this paper, we propose a new time synchronization algorithm using CoAP(constrained-application protocol) in sensor network environment, which handles a technique that synchronizes an explicit timestamp between sensor nodes not including an additional module for time-setting and sensor node gateway linked to internet time server. CoAP is a standard protocol for sensor data communication among sensor nodes and sensor node gateway to be built much less memory and power supply in constrained network surroundings including serious network jitter, packet losses, etc. We have supplied an exact time synchronization implementation among small and cheap IP-based sensor nodes or non-IP based sensor nodes and sensor node gateway in sensor network using CoAP message header's option extension. On behalf of conventional network time synchronization method, as our approach uses an exclusive protocol 'CoAP' in sensor network, it is not to become an additional burden for synchronization service to sensor nodes or sensor node gateway. This method has an average error about 2ms comparing to NTP service and offers a low-cost and robust network time synchronization algorithm.

A New Mobility Management Scheme in Proxy Mobile IPv6 Networks with Dynamic Paging Support (Proxy Mobile IPv6 환경에서 동적 페이징 지원을 위한 이동성 관리기법)

  • Yi, Myung-Kyu;Kim, Cheol-Joong;Park, Seok-Cheon;Yang, Young-Kyu
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.14 no.9
    • /
    • pp.1999-2007
    • /
    • 2010
  • Proxy Mobile IPv6(PMIPv6) is a network-based mobility management protocol and it does not require mobile node's involving in mobility management. In PMIPv6, the Mobile Access Gateway (MAG) incurs a high signaling cost to update the location of a mobile node to the remote Local Mobility Anchor (LMA) if it moves frequently. It may cause excessive signaling traffic and increase a high traffic load on LMA. Therefore, we propose a new mobility management scheme in proxy mobile IPv6 networks with dynamic paging support. To minimize signaling overhead, in our proposal, the size of the paging area is determined dynamically according the changes of mobility and traffic patterns of the mobile node. An analytic model is applied to determine the optimal size of the paging area. The cost analysis using fluid flow model presented in this paper shows that our proposal can achieve performance superior that of PMIPv6 scheme.

Distributed Key Management Using Regression Model for Hierarchical Mobile Sensor Networks (계층적인 이동 센서 네트워크에서 회귀모델을 이용한 분산 키 관리)

  • Kim Mi-Hui;Chae Ki-Joon
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.43 no.7 s.349
    • /
    • pp.1-13
    • /
    • 2006
  • In this paper, we introduce a novel key management scheme that is based on the key pre-distribution but provides the key re-distribution method, in order to manage keys for message encryption and authentication of lower-layer sensor nodes on hierarchical mobile sensor networks. The characteristics of our key management are as follows: First, the role of key management is distributed to aggregator nodes as well as a sink node, to overcome the weakness of centralized management. Second, a sink node generates keys using regression model, thus it stores only the information for calculating the keys using the key information received from nodes, but does not store the relationship between a node and a key, and the keys themselves. As the disadvantage of existing key pre-distributions, they do not support the key re-distribution after the deployment of nodes, and it is hard to extend the key information in the case that sensor nodes in the network enlarge. Thirdly, our mechanism provides the resilience to node capture(${\lambda}$-security), also provided by the existing key pre-distributions, and fourth offers the key freshness through key re-distribution, key distribution to mobile nodes, and scalability to make up for the weak points in the existing key pre-distributions. Fifth, our mechanism does not fix the relationship between a node and a key, thus supports the anonymity and untraceability of mobile nodes. Lastly, we compare ours with existing mechanisms, and verify our performance through the overhead analysis of communication, computation, and memory.

Neck Dissection in Oral Cavity Cancer (구강암환자의 경부청소술)

  • Park, Joo-Yong
    • The Journal of the Korean dental association
    • /
    • v.48 no.8
    • /
    • pp.594-606
    • /
    • 2010
  • Lymph node status is the single most important prognostic factor in oral cancer because lymph node involvement decreases overall survival by 50%. Appropriate management of the regional lymphatics, therefore, plays a central role in the treatment of the oral cancer patients. The purposes of this article are to present the history of neck dissections, including current neck dissection classification, describe the technique of the most common neck dissection applicable to oral cavity cancers, and discuss some of the complications associated with neck dissection. Finally, a brief review of elective neck dissection and sentinel lymph node biopsy will be presented. It is necessary that dentists have to be interested in oral cancer and these interest will make it possible to prevent oral cancer, detect it earlier and also improve the prognosis, survival and the quality of life of survivors.