• Title/Summary/Keyword: Network Discovery

Search Result 459, Processing Time 0.027 seconds

Implementation of IPv6 Neighbor Discovery Protocol supporting CGA

  • Kim Joong Min;Park In Kap;Yu Jae Wook
    • Proceedings of the IEEK Conference
    • /
    • 2004.08c
    • /
    • pp.571-575
    • /
    • 2004
  • Having age of ubiquitous ahead, existing IPv4's address space insufficiency phenomenon appears because of increasing network usage as well as multimedia data transmission becomes much, necessity of new IP address system that guarantee QoS are needed. IPv6 was made to solve these problem. IPv6 solves address space insufficiency phenomenon offering by 128bit address space, and also offers hierarchical address layer that support improved QoS. IPv6 defines relation between surrounding node using Neighbor Discovery protocol. Used Neighbor Discovery messages, grasp surrounding node, include important informations about network. These network information outcrops can give rise in network attack and also service that use network will paralysis. Various kinds of security limitation was found in Present Neighbor Discovery protocol therefore security function to supplement tris problem was required. In this thesis, Secure Neighbor Discovery protocol that add with security function was design and embody by CGA module and SEND module.

  • PDF

Supporting Mobile IP in Ad Hoc Networks with Wireless Backbone (무선 백본 기반 Ad Hoc 네트워크에서의 Mobile IP지원)

  • 신재욱;김응배;김상하
    • Proceedings of the IEEK Conference
    • /
    • 2003.11c
    • /
    • pp.223-226
    • /
    • 2003
  • In this paper, we propose new agent discovery and route discovery schemes to support Mobile IP (MIP) in Ad Hoc networks with wireless backbone. The wireless backbone consisting of stationary wireless routers and Internet gateways (IGs) is a kind of wireless access network of IP-based core network. The proposed scheme utilizes favorable features of wireless backbone such as stable links and no energy constraints. In the agent discovery scheme, backbone-limited periodic Agent Advertisement (AA) and proxy-AA messages are used, which reduce network-wide broadcasting overhead caused by AA and Agent Solicitation messages and decentralize MIP processing overhead in IGs. In order to reduce delay time and control message overhead during route discovery far the destination outside Ad Hoc network, we propose a cache-based scheme which can be easily added to the conventional on-demand routing protocols. The proposed schemes can reduce control overhead during agent discovery and route discovery, and efficiently support MIP in Ad Hoc network with wireless backbone.

  • PDF

Hot Topic Discovery across Social Networks Based on Improved LDA Model

  • Liu, Chang;Hu, RuiLin
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.15 no.11
    • /
    • pp.3935-3949
    • /
    • 2021
  • With the rapid development of Internet and big data technology, various online social network platforms have been established, producing massive information every day. Hot topic discovery aims to dig out meaningful content that users commonly concern about from the massive information on the Internet. Most of the existing hot topic discovery methods focus on a single network data source, and can hardly grasp hot spots as a whole, nor meet the challenges of text sparsity and topic hotness evaluation in cross-network scenarios. This paper proposes a novel hot topic discovery method across social network based on an im-proved LDA model, which first integrates the text information from multiple social network platforms into a unified data set, then obtains the potential topic distribution in the text through the improved LDA model. Finally, it adopts a heat evaluation method based on the word frequency of topic label words to take the latent topic with the highest heat value as a hot topic. This paper obtains data from the online social networks and constructs a cross-network topic discovery data set. The experimental results demonstrate the superiority of the proposed method compared to baseline methods.

An Efficient Cluster Based Service Discovery Model for Mobile Ad hoc Network

  • Buvana, M.;Suganthi, M.
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.2
    • /
    • pp.680-699
    • /
    • 2015
  • The use of web service has been increased rapidly, with an increase in the number of available services, finding the exact service is the challenging task. Service discovery is the most significant job to complete the service discoverers needs. In order to achieve the efficient service discovery, we focus on designing a cluster based service discovery model for service registering and service provisioning among all mobile nodes in a mobile ad hoc network (MANETs). A dynamic backbone of nodes (i.e. cluster heads) that forms a service repository to which MANET nodes can publish their services and/or send their service queries. The designed model is based on storing services with their service description on cluster head nodes that are found in accordance with the proposed cluster head election model. In addition to identifying and analyzing the system parameters for finding the effectiveness of our model, this paper studies the stability analysis of the network, overhead of the cluster, and bandwidth utilization and network traffic is evaluated using analytic derivations and experimental evaluation has been done.

An Analysis on the Number of Advertisements for Device Discovery in the Bluetooth Low Energy Network (저전력 블루투스 네트워크에서 장치 탐색을 위한 Advertising 횟수에 관한 분석)

  • Kim, Myoung Jin
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.53 no.8
    • /
    • pp.3-12
    • /
    • 2016
  • Bluetooth Low Energy (BLE) protocol has attracted attention as a promising technology for low data throughput and low energy wireless sensor networks. Fast device discovery is very important in a BLE based wireless network. It is necessary to configure the network to work with minimized energy consumption because the BLE network nodes are expected to operate a long time typically on a coin cell battery. However, since it is difficult to obtain low energy and low latency at the same time, the BLE standard introduces wide range setting of parameters related to device discovery process and let the network operators to set up parameter values for the application. Therefore, it is necessary to analyze the performance of device discovery according to the related parameter values prior to BLE network operation. In this paper we analyze the expected value and the cumulative distribution function of the number of advertisements for device discovery in the BLE network. In addition, we propose a scheme for controlling the interval between advertising events that can improve the performance of device discovery without increasing energy consumption.

A Study on Implementation of IPv6 Neighbor Discovery Protocol supporting Security Function (보안기능을 지원하는 IPv6 ND Protocol 구현에 관한 연구)

  • Yu Jae-Wook;Park In-Kap;Kim Joong-Min
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.41 no.12
    • /
    • pp.33-40
    • /
    • 2004
  • IPv6 defines relation between surrounding node using Neighbor Discovery protocol. Used Neighbor Discovery messages, grasp surrounding node, include important informations about network. These network information outcrops can give rise in network attack and also service that use network will paralysis. Various kinds of security limitation was found in Present Neighbor Discovery protocol therefore security function to supplement this problem was required. In this thesis, Secure Neighbor Discovery protocol that add with suity function was design and embody by CGA module and SEND module.

An Autonomic -Interleaving Registry Overlay Network for Efficient Ubiquities Web Services Discovery Service

  • Ragab, Khaled
    • Journal of Information Processing Systems
    • /
    • v.4 no.2
    • /
    • pp.53-60
    • /
    • 2008
  • The Web Services infrastructure is a distributed computing environment for service-sharing. Mechanisms for Web services Discovery proposed so far have assumed a centralized and peer-to-peer (P2P) registry. A discovery service with centralized architecture, such as UDDI, restricts the scalability of this environment, induces performance bottleneck and may result in single points of failure. A discovery service with P2P architecture enables a scalable and an efficient ubiquities web service discovery service that needs to be run in self-organized fashions. In this paper, we propose an autonomic -interleaving Registry Overlay Network (RgON) that enables web-services' providers/consumers to publish/discover services' advertisements, WSDL documents. The RgON, doubtless empowers consumers to discover web services associated with these advertisements within constant D logical hops over constant K physical hops with reasonable storage and bandwidth utilization as shown through simulation.

Protocols for service discovery in a Home Network Enviromnents (홈네트워크 환경의 서비스 검색 프로토콜)

  • Kim, Do-Woo;Han, Jong-Wook
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • v.9 no.1
    • /
    • pp.856-859
    • /
    • 2005
  • There are various clients, information appliances, sensors in a home network environments. These devices can dynamically join a network, convey its capabilities, and learn about the presence and capabilities of other devices- all automatically. Most of a home network middleware provide the protocols that discovery devices and services. In this paper we look about service discovery protocol and security that is offered in Jini, UPnP, SLP, Bluetooth.

  • PDF

Adaptively Flexible Service Discovery and Advertisement for SSDP of UPnP in Wireless Ad-hoc Network (무선 애드 혹 환경에서의 UPnP의 SSDP 기능 향상을 위한 서비스 발견 및 광고 기법)

  • Jung, So-Ra;Youn, Hee-Yong
    • The KIPS Transactions:PartA
    • /
    • v.17A no.5
    • /
    • pp.237-248
    • /
    • 2010
  • UPnP(Universal Plug and Play) is a middleware of DLNA (Digital Living Network Alliance) services a home network. UPnP supports the connections between each other devices in networks and also provides service discovery and advertisement with SSDP(Simple Service Discovery Protocol), which is generally designed for wired networks. SSDP operates on multicasting discovery request and advertisement and unicasting a reply in networks. It is a challenge issue for service discovery protocol such as SSDP to provide a stable and effective service in wireless ad-hoc networks. Wired based service discovery protocol does not consider the dynamics of wireless ad-hoc network. In that case, the nodes are freely in or out. Therefore, this paper proposes a flexible SSDP(fSSDP) which is a peer-to-peer(P2P) discovery protocol adopted for wireless ad-hoc Networks. It is implemented on the extension of SSDP. fSSDP supports a functionality that the broadcast area of service discovery dynamically changes with the periodically updated area of advertisement. It is good for reducing messaging overhead caused from the broadcast flooding of service discovery in wireless ad-hoc network.

Interpretation and Statistical Analysis of Ethereum Node Discovery Protocol (이더리움 노드 탐색 프로토콜 해석 및 통계 분석)

  • Kim, Jungyeon;Ju, Hongteak
    • KNOM Review
    • /
    • v.24 no.2
    • /
    • pp.48-55
    • /
    • 2021
  • Ethereum is an open software platform based on blockchain technology that enables the construction and distribution of distributed applications. Ethereum uses a fully distributed connection method in which all participating nodes participate in the network with equal authority and rights. Ethereum networks use Kademlia-based node discovery protocols to retrieve and store node information. Ethereum is striving to stabilize the entire network topology by implementing node discovery protocols, but systems for monitoring are insufficient. This paper develops a WireShark dissector that can receive packet information in the Ethereum node discovery process and provides network packet measurement results. It can be used as basic data for the research on network performance improvement and vulnerability by analyzing the Ethereum node discovery process.