• Title/Summary/Keyword: Nodes

Search Result 8,430, Processing Time 0.03 seconds

Development of a Secure Routing Protocol using Game Theory Model in Mobile Ad Hoc Networks

  • Paramasivan, Balasubramanian;Viju Prakash, Maria Johan;Kaliappan, Madasamy
    • Journal of Communications and Networks
    • /
    • v.17 no.1
    • /
    • pp.75-83
    • /
    • 2015
  • In mobile ad-hoc networks (MANETs), nodes are mobile in nature. Collaboration between mobile nodes is more significant in MANETs, which have as their greatest challenges vulnerabilities to various security attacks and an inability to operate securely while preserving its resources and performing secure routing among nodes. Therefore, it is essential to develop an effective secure routing protocol to protect the nodes from anonymous behaviors. Currently, game theory is a tool that analyzes, formulates and solves selfishness issues. It is seldom applied to detect malicious behavior in networks. It deals, instead, with the strategic and rational behavior of each node. In our study,we used the dynamic Bayesian signaling game to analyze the strategy profile for regular and malicious nodes. This game also revealed the best actions of individual strategies for each node. Perfect Bayesian equilibrium (PBE) provides a prominent solution for signaling games to solve incomplete information by combining strategies and payoff of players that constitute equilibrium. Using PBE strategies of nodes are private information of regular and malicious nodes. Regular nodes should be cooperative during routing and update their payoff, while malicious nodes take sophisticated risks by evaluating their risk of being identified to decide when to decline. This approach minimizes the utility of malicious nodes and it motivates better cooperation between nodes by using the reputation system. Regular nodes monitor continuously to evaluate their neighbors using belief updating systems of the Bayes rule.

Morphological studies on hemal nodes and hemolymph nodes in the water deer(Hydropotes inermis) (고라니 혈절과 혈림프절에 관한 형태학적 연구)

  • Yoon, Yeo-sung;Lee, Joon-sup
    • Korean Journal of Veterinary Research
    • /
    • v.37 no.3
    • /
    • pp.463-469
    • /
    • 1997
  • This study was performed to investigate the gross anatomical features and microscopical structures of the hemal nodes and the hemolymph nodes in the water deer (Hydropotes inermis) found in Kangwon-do, Korea. The hemal nodes and hemolymph nodes were observed mainly in the periphery of the thoracic and abdominal aortae of the animals. The size of hemal nodes was generally smaller than that of the hemolymph nodes, and the shape of the both organs was spherical or ovoid. The color of the hemal nodes was red or black while that of the hemolymph nodes was gray with red bands. The hemal nodes were surrounded by a thin connective tissue capsule and there were extensive subcapsular and deep sinuses distended by a great number of erythrocytes. Although a few number of lymphatic nodules and small areas of diffuse lymphatic tissues were observed in the parenchyma, no typical cortex and medulla were defined in the hemal node. Small numbers of blood vessels were found at the connective tissue capsule but lymph vessel was not observed microscopically in this organ. The hemolymph nodes were covered by a relatively thick connective tissue capsule and there was a hilus in each node. The parenchyma was divided into cortex and medulla. The cortex was composed of a few numbers of lymphatic nodules and some diffuse lymphatic tissues. The medulla comprised medullary sinus and cords. Afferent and efferent lymph vessels were observed at the periphery of the capsule and the hilus, respectively. The subcapsular and medullary sinuses were not extensive but filled with small numbers of erythrocytes. The stroma of hemal node and hemolymph node was composed of reticular cells and fibers, and the capsule and trabecula consisted of collagenous fibers with smooth muscle fibers.

  • PDF

An Adaptive Security Model for Dynamic Node Behaviour in MANETs

  • Anand, Anjali;Rani, Rinkle;Aggarwal, Himanshu
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.6
    • /
    • pp.2861-2880
    • /
    • 2018
  • Mobile Ad hoc Networks (MANETs) have become a viable platform owing to their potential of providing communication without any pre-existing infrastructure and central administrating authority. Mutual support and co-operation among nodes are prerequisites for performing functions in such networks. The scarcity of resources makes it economical for nodes to conserve their resources and misbehave by avoiding participation in the network. Therefore, a mechanism is required to detect and handle such misbehaving nodes and promote co-operation in the network. Existing techniques for handling misbehaving nodes focus only on their current behaviour without considering the antecedent behaviour of nodes. In real world, a node may dynamically change its behaviour in accordance to its requirements. Hence, an efficient mechanism is required for providing security against such misbehaviour. This paper proposes an Adaptive Security Model which contemplates the present as well as anterior behaviour of nodes for providing security against dynamic node behaviour. The adaptivity of the model is nested in its ability to requite well-behaving nodes and penalize misbehaving ones in conformity with their overall behaviour. Simulation results indicate the efficiency of proposed scheme in securing the network from the menace of dynamic behaviour of nodes.

Selection of Monitoring Nodes to Maximize Sensing Area in Behavior-based Attack Detection

  • Chong, Kyun-Rak
    • Journal of the Korea Society of Computer and Information
    • /
    • v.21 no.1
    • /
    • pp.73-78
    • /
    • 2016
  • In wireless sensor networks, sensors have capabilities of sensing and wireless communication, computing power and collect data such as sound, movement, vibration. Sensors need to communicate wirelessly to send their sensing data to other sensors or the base station and so they are vulnerable to many attacks like garbage packet injection that cannot be prevented by using traditional cryptographic mechanisms. To defend against such attacks, a behavior-based attack detection is used in which some specialized monitoring nodes overhear the communications of their neighbors(normal nodes) to detect illegitimate behaviors. It is desirable that the total sensing area of normal nodes covered by monitoring nodes is as large as possible. The previous researches have focused on selecting the monitoring nodes so as to maximize the number of normal nodes(node coverage), which does not guarantee that the area sensed by the selected normal nodes is maximized. In this study, we have developed an algorithm for selecting the monitoring nodes needed to cover the maximum sensing area. We also have compared experimentally the covered sensing areas computed by our algorithm and the node coverage algorithm.

The Security DV-Hop Algorithm against Multiple-Wormhole-Node-Link in WSN

  • Li, Jianpo;Wang, Dong
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.13 no.4
    • /
    • pp.2223-2242
    • /
    • 2019
  • Distance Vector-Hop (DV-Hop) algorithm is widely used in node localization. It often suffers the wormhole attack. The current researches focus on Double-Wormhole-Node-Link (DWNL) and have limited attention to Multi-Wormhole-Node-Link (MWNL). In this paper, we propose a security DV-Hop algorithm (AMLDV-Hop) to resist MWNL. Firstly, the algorithm establishes the Neighbor List (NL) in initialization phase. It uses the NL to find the suspect beacon nodes and then find the actually attacked beacon nodes by calculating the distances to other beacon nodes. The attacked beacon nodes generate and broadcast the conflict sets to distinguish the different wormhole areas. The unknown nodes take the marked beacon nodes as references and mark themselves with different numbers in the first-round marking. If the unknown nodes fail to mark themselves, they will take the marked unknown nodes as references to mark themselves in the second-round marking. The unknown nodes that still fail to be marked are semi-isolated. The results indicate that the localization error of proposed AMLDV-Hop algorithm has 112.3%, 10.2%, 41.7%, 6.9% reduction compared to the attacked DV-Hop algorithm, the Label-based DV-Hop (LBDV-Hop), the Secure Neighbor Discovery Based DV-Hop (NDDV-Hop), and the Against Wormhole DV-Hop (AWDV-Hop) algorithm.

Reducing Cybersecurity Risks in Cloud Computing Using A Distributed Key Mechanism

  • Altowaijri, Saleh M.
    • International Journal of Computer Science & Network Security
    • /
    • v.21 no.9
    • /
    • pp.1-10
    • /
    • 2021
  • The Internet of things (IoT) is the main advancement in data processing and communication technologies. In IoT, intelligent devices play an exciting role in wireless communication. Although, sensor nodes are low-cost devices for communication and data gathering. However, sensor nodes are more vulnerable to different security threats because these nodes have continuous access to the internet. Therefore, the multiparty security credential-based key generation mechanism provides effective security against several attacks. The key generation-based methods are implemented at sensor nodes, edge nodes, and also at server nodes for secure communication. The main challenging issue in a collaborative key generation scheme is the extensive multiplication. When the number of parties increased the multiplications are more complex. Thus, the computational cost of batch key and multiparty key-based schemes is high. This paper presents a Secure Multipart Key Distribution scheme (SMKD) that provides secure communication among the nodes by generating a multiparty secure key for communication. In this paper, we provide node authentication and session key generation mechanism among mobile nodes, head nodes, and trusted servers. We analyzed the achievements of the SMKD scheme against SPPDA, PPDAS, and PFDA schemes. Thus, the simulation environment is established by employing an NS 2. Simulation results prove that the performance of SMKD is better in terms of communication cost, computational cost, and energy consumption.

Minimum Number of Retrieved Lymph Nodes for Staging in Gastric Cancer (위암에서 병기결정을 위한 최소 절제 림프절 수)

  • Min, Byung-Wook;Kim, Wan-Bae;Kim, Seung-Ju;Kim, Chong-Suk;Mok, Young-Jae
    • Journal of Gastric Cancer
    • /
    • v.3 no.3
    • /
    • pp.134-138
    • /
    • 2003
  • Purpose: The lymph node (N) classification in the International Union Against Cancer (UICC) TNM staging system for gastric adenocarcinomas has been revised from the anatomic sites of metastatic lymph nodes to the number of metastatic lymph nodes. The purpose of this study was to investigate the proper number of retrieved lymph nodes for applying the new TNM staging system. Materials and Methods: We retrospectively studied 267 patients who had undergone a curative resection performed by one surgeon for gastric adenocarcinomas from March 1993 to December 1996 at Korea University Guro Hospital. We compared the old staging system to the new one and analyzed the number of retrieved and metastatic lymph nodes. We also analyzed the number of retrieved and metastatic lymph nodes according to the operative procedure and the extent of the lymphadenectomy, as well as the correlation of lymph-node metastasis to the number of retrieved lymph nodes. Results: The mean number of retrieved lymph nodes was $34.27\pm14.18$, of those $6.85\pm6.24$ were metastatic. According to the extent of the lymphadenectomy, these numbers were $17.8\pm9.3\;and\;7.0\pm5.3$ in D1, $33.1\pm14.6\;and\;3.0\pm3.0$ in $D1+\alpha$, $33.9\pm13.8\;and\;7.5\pm6.2$ in D2, and $40.6\pm13.3\;and\;7.9\pm7.5$ in $D2+\alpha$. There was no correlation between the percentage of the specimen with positive lymph nodes and the number of retrieved lymph nodes, but a logistic regres sion analysis showed that the probability of lymph-node metastasis increased as the number of retrieved lymph nodes increased. Conclusion: The mean number of retrieved lymph nodes was about 34. Although by logistic regression analysis, the probability of lymph-node metastasis increased as the number of retrieved lymph nodes increased, we failed to determine the minimum number of nodes retrieved during a lymphadenectomy needed for accurate staging in a gastric adenocarcinoma. Further study is required to identify the optimum number of lymph nodes that need to be retrieved.

  • PDF

The Routing Algorithm for Wireless Sensor Networks with Random Mobile Nodes

  • Yun, Dai Yeol;Jung, Kye-Dong;Lee, Jong-Yong
    • International Journal of Internet, Broadcasting and Communication
    • /
    • v.9 no.4
    • /
    • pp.38-43
    • /
    • 2017
  • Sensor Networks (WSNs) can be defined as a self-configured and infrastructure-less wireless networks to monitor physical or environmental conditions, such as temperature, sound, vibration, pressure, motion or pollutants and to cooperatively pass their data through the network to a main location or base-station where the data can be observed and analyzed. Typically a wireless sensor network contains hundreds of thousands of sensor nodes. The sensor nodes can communicate among themselves using radio signals. A wireless sensor node is equipped with sensing and computing devices, radio transceivers and power components. The individual nodes in a wireless sensor network (WSN) are inherently resource constrained: they have limited processing speed, storage capacity, communication bandwidth and limited-battery power. At present time, most of the research on WSNs has concentrated on the design of energy- and computationally efficient algorithms and protocols In order to extend the network life-time, in this paper we are looking into a routing protocol, especially LEACH and LEACH-related protocol. LEACH protocol is a representative routing protocol and improves overall network energy efficiency by allowing all nodes to be selected to the cluster head evenly once in a periodic manner. In LEACH, in case of movement of sensor nodes, there is a problem that the data transmission success rate decreases. In order to overcome LEACH's nodes movements, LEACH-Mobile protocol had proposed. But energy consumption increased because it consumes more energy to recognize which nodes moves and re-transfer data. In this paper we propose the new routing protocol considering nodes' mobility. In order to simulate the proposed protocol, we make a scenario, nodes' movements randomly and compared with the LEACH-Mobile protocol.

Effect of Neoadjuvant Chemotherapy on Axillary Lymph Node Positivity and Numbers in Breast Cancer Cases

  • Uyan, Mikail;Koca, Bulent;Yuruker, Savas;Ozen, Necati
    • Asian Pacific Journal of Cancer Prevention
    • /
    • v.17 no.3
    • /
    • pp.1181-1185
    • /
    • 2016
  • Background: The aim of this study is to compare the numbers of axillary lymph nodes (ALN) taken out by dissection between patients with breast cancer operated on after having neoadjuvant chemotherapy (NAC) treatment and otherswithout having neoadjuvant chemotherapy, and to investigate factors affecting lymph node positivity. Materials and Methods: A total of 49 patients operated due to advanced breast cancer after neoadjuvant chemotherapy and 144 patients with a similar stage of the cancer having primary surgical treatment without chemotherapy at the general surgery clinic of Ondokuz Mayis University Medicine Faculty between the dates 01.01.2006 and 31.10.2012 were included in the study. The total number of lymph nodes taken out by axillary dissection (ALND) was categorized as the number of positive lymph nodes and divided into <10 and ${\geq}10$. The variables to be compared were analysed using the program SPSS 15.0 with P<0.05 accepted as significant. Results: Median number of dissected lymph nodes from the patient group having neoadjuvant chemotherapy was 16 (16-33) while it was 20 (5-55) without chemotherapy. The respective median numbers of positive lymph nodes were 5 (0-19) and 10 (0-51). In 8 out of 49 neoadjuvant chemotherapy patients (16.3%), the number of dissected lymph nodes was below 10, and it was below 10 in 17 out of 144 primary surgery patients. Differences in numbers of dissected total and positive lymph nodes between two groups were significant, but this was not the case for numbers of <10 lymph nodes. Conclusions: The number of dissected lymph nodes from the patients with breast cancer having neoadjuvant chemotherapy may be less than without chemotherapy. This may not always be attributed to an inadequate axillary dissection. More research to evaluate the numbers of positive lymph nodes are required in order to increase the reliability of staging in the patients with breast cancer undergoing neoadjuvant chemotherapy.

Age-related morphological studies on hemal node and hemolymph node in Korean native goat (한국재래산양 혈절과 혈림프절의 연령별 형태학적 연구)

  • Yoon, Yeo-sung;Shin, Jae-won;Lee, Joon-sup
    • Korean Journal of Veterinary Research
    • /
    • v.39 no.5
    • /
    • pp.865-877
    • /
    • 1999
  • Hemal nodes and hemolymph nodes are lymphoid organs which share morphologic and functional characteristics of lymph nodes and spleens. Hemal nodes and hemolymph nodes are normally present in Korean native goats. Hemal nodes bad extensive subcapsular and deep sinuses distended by a great number of erythrocytes, and no typical cortex and medulla were observed. Blood vessels commonly occurred, but lymph vessel was not observed in the hemal node. Hemolymph nodes had distinct cortex and medulla, and also had afferent and efferent lymph vessels. The aim of the present study was to obtain new information on the distinct morphological structures of hemal nodes and hemolymph nodes according to ages, and have the basic data for their functions. Goats are divided into 5 groups, consisting of 3 animals aged 1, 3, 6, 10, and 12 months. The morphological studies of the organs were carried out by gross anatomy, light microscopy and immunohistochemistry. During aging, there was an increase in the size of the organs, while there were no significant changes of their numbers, locations and colors. As the goat got older, the lymphatic nodules of hemal nodes were more developed, and the number of macrophage containing phagocytosed erythrocytes was more increased. As the goat was younger, the lymphatic tissues of hemolymph nodes were less developed. There was no difference in distribution of T- and B- lymphocytes according to ages.

  • PDF