• 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.

• Journal of information and communication convergence engineering
• /
• v.6 no.4
• /
• pp.396-404
• /
• 2008

Service discovery is the technology of finding needed services in networks, and a key point in pervasive computing environments. This paper presents a novel service discovery protocol: ASESDP(AIP and SRR Enhanced Service Discovery Protocol). In ASESDP, tow schemes are proposed to enhance its performance: AIP(Advertisement Information Piggybacked) and SRR(Shortest Reply Route). In AIP, parts of advertisement information are piggybacked in the service reply packet, which makes the advertisement information propagating along the reply path, and spreads its transmission area. In SRR, in order to reduce the service response time, the shortest reply route is chosen to forward the service reply packet to the source node sending the service request. With the theoretical analysis and Glomosim simulation results, it is verified that ASESDP can reduce the number of service request packets, save the response time, and improve the efficiency of service discovery.

• 한국HCI학회:학술대회논문집
• /
• 2008.02a
• /
• pp.669-673
• /
• 2008

The service discovery method is an important technology finding and offering users' desirable services in smart meeting spaces. Extensive researches of the service discovery methods are achieved: SSDP(simple service discovery protocol) of UPnP(universal plug & play) and so on. However, there are several limitations to satisfy the requirements of service discovery in smart meeting spaces. In this paper, the requirements of service discovery in smart meeting spaces are investigated and the service discovery method based on multi-agent system is proposed in the practical aspect. Additionally, we explore the possibilities of the proposed approach by implementing a couple of services belonging to the smart meeting spaces.

• Journal of KIISE:Information Networking
• /
• v.35 no.1
• /
• pp.91-97
• /
• 2008

In order to get a desired service in such environments, we need a service discovery method for discovering a device providing that service. In this paper, we propose a service discovery protocol which is based on DHTs (Distributed Hash Tables) to solve these problems. Our protocol is scalable since it does not require a central lookup server and does not rely on multicast or flooding. Simulation results show that our protocol is scalable and outperforms existing service discovery protocols.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.11 no.6
• /
• pp.275-282
• /
• 2011

Current service discovery protocols such as UPnP, Jini, SLP provide the basic function which is message exchange pattern, service representation and description, in service discovery. They does not guarantee service interoperability among service discovery. Therefore, in this paper, we design and implement CLAM (Component-based Autonomic Layered Middleware) agent platform to enable an efficient service discovery through extension of DF agent function in FIPA-compliant specification. Also, we propose an efficient service discovery mechanism using DHT-Chord algorithm to guarantee scalability and interoperability in DF agent.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.4 no.3
• /
• pp.9-18
• /
• 2008

Mobile devices do not need the fixed network infrastructure in ad-hoc network, these devices communicate each other through the distributed control. Accordingly, mobile devices can discover several services using dynamic searching method and provide safely public ownership of these services. Ad-hoc network needs the distributed control and topology of dynamic network because the limited power for processing and network communication. This paper is devoted to provide the secure protocol that provides efficient services discovery using SDP(Service Discovery Protocol) and considers the security requirements. Proposed protocol provides the distributed control based on PKI without central server, the discovery of trusted service, secure telecommunication, the identification among mobile devices, and service access control by user authority.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38A no.10
• /
• pp.908-917
• /
• 2013

In this paper, we propose a discovery protocol for finding nearby mobile applications and services in a device-to-device communications system. The device-to-device communication technology enables proximity-based services such as mobile social networks and mobile marketing. For realizing these proximity-based services, it is essential to design a discovery protocol which pinpoints the devices with mobile applications of interest among hundreds and thousands of devices in proximity. In the infrastructure-less networks such as ad hoc networks, we can design the discovery protocol that periodically broadcasts a short discovery code containing the compressed information of the mobile applications. In this paper, we design the discovery protocol with the discovery code generated by using a hash function and a Bloom filter. We also mathematically analyze the performance of the proposed protocol.

• 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.

• 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.

• The KIPS Transactions:PartC
• /
• v.16C no.2
• /
• pp.223-228
• /
• 2009

Efficient service discovery mechanism is a crucial feature for a hybrid ad-hoc network supporting extension of a wireless ad-hoc network to the Internet. We propose an efficient cross-layer service discovery mechanism using non-disjoint multi-path source routing protocol for hybrid ad-hoc networks. Our scheme has advantages of multi-path routing protocol and cross-layer service discovery. Intuitively, it is not difficult to imagine that the cross-layer service discovery mechanism could result in a decreased number of messages compared to the traditional approach for handling routing independently from service discovery. By simulation, we show that faster route recovery is possible by maintaining multiple routing paths in each node, and the route maintenance overhead can be reduced by limiting the number of multiple routing paths and by maintaining link/node non-disjoint multi-path.