• Journal of Communications and Networks
• /
• v.17 no.2
• /
• pp.203-209
• /
• 2015

Although mobile applications are an essential characteristic of wireless sensor networks, most existing media access control (MAC) protocols focus primarily on static networks. In these protocols, fixed periodic neighbor discovery and schedule updating are used to connect and synchronize neighbors to provide successful data transmission; however, they cannot adapt to mobile speed variation and degrade the network performance dramatically. In this paper, we propose a mobile-supporting mechanism for MAC protocols, in which the decision to update the neighbors of a mobile node is made adaptively according to the mobile speed. Analysis and simulation results demonstrate that the mechanism efficiently avoids the disconnection of amobile node from its neighbors and achieves a better performance as compared with fixed periodic neighbor discovery.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• v.9 no.2
• /
• pp.82-85
• /
• 2005

In the MIPv6 network, when mobile nodes move into new newtwork, they need to find the new access router and points(AR/AP) for the newtwork. Unless they are not connected to authorized AR/APs, they can be exposed to a lot of attacks. In this paper we propose a protocol to authenticate AR/AR and MN each other. This protocol is based on the public key scheme which is used in the SEcure Neighbor Discovery(SEND) protocol.

• Journal of Communications and Networks
• /
• v.17 no.1
• /
• pp.34-39
• /
• 2015

In opportunistic networks, it is difficult to predict when a node encounters others and how long it keeps in contact with another. Nodes continually attempt to explore neighbor nodes in the vicinity to transmit data. In battery-operated devices, this persistent exploration consumes a great deal of energy. In this paper, we propose an optimal energy-efficient neighbor discovery scheme (OPEED) that guarantees neighbor discovery within a delay bound. Through performance evaluation, we show that the OPEED scheme consumes 33%-83% less energy than other schemes.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.9 no.2
• /
• pp.123-128
• /
• 2009

In ubiquitous computing environments, service discovery to search for an available service is an important issue. In this paper, we propose an efficient service discovery scheme that is combined a node id-based clustering service discovery scheme and a P2P caching-based information spreading scheme. To search quickly a service, proposed scheme store key information in neighbor's local cache and search services using it's information. We do not use a central look up server and do not rely on flooding. Through simulation, we show that the proposed scheme improves the performance of response time and network load compared to other methods.

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

• Journal of KIISE:Information Networking
• /
• v.34 no.1
• /
• pp.41-47
• /
• 2007

The Hierarchical Mobile IPv6 (HMIPv6) has been proposed to accommodate frequent mobility of the Mobile Node and to reduce the signaling load. A Mobility Anchor Point is a router located in a network visited by the Mobile Node. The Mobile Node uses the Mobile Anchor Point as a local Home Agent. The absence of any protections between Mobile Node and Mobile Anchor Point may lead to malicious Mobile Nodes impersonating other legitimate ones or impersonating a Mobile Anchor Point. In this paper, we propose a mechanism of the secure Mobile Anther Point discovery in HMIPv6. The performance analysis and the numerical results presented in this paper show that our proposal has superior performance to other methods.

• The Journal of the Convergence on Culture Technology
• /
• v.5 no.2
• /
• pp.381-388
• /
• 2019

In this paper, we propose a new wireless transport network, which is named as Mobile Xhaul Network(MXN), that is enable to bring cost efficiency of fronthaul, midhaul and backhaul and to make easy installation of 5G Radio Access Network(RAN). For this purpose, we design XDU discovery and xhaul link setup mechanism with MXN architecture and operational procedure. Especially, in this paper, we propose various types of beam discovery mechanisms for mmWave based radio access on XDU and evaluate proposed schemes. The Simulation result shows that threshold based scheme and information based scheme have less than about 50% beam discovery latency compared to full search scheme.

• Proceedings of the KIEE Conference
• /
• 2006.10c
• /
• pp.154-156
• /
• 2006

These days wireless sensor networks receive much attention from industry and researchers on various fields. The challenge is that wireless sensor networks have limited resources. Nevertheless, the route discovery in ZigBee sensor networks is performed by simple flooding when the original racket is rebroadcasted at least once by every node in a network. Such uncontrolled flooding generates an excessive number of packets competing for the media and causes a high collision rate. In this article, we propose a suitable packet Time-To-Live value to solve problems of uncontrolled flooding in ZigBee networks. It is shown that more sufficient route discovery in a ZigBee network can save network resources and lengthen the life of a sensor network.

• Journal of Information Processing Systems
• /
• v.15 no.5
• /
• pp.1055-1067
• /
• 2019

In view of the deficiencies of existing weighted similarity indexes, a hierarchical clustering method initialize-expand-merge (IEM) is proposed based on the similarity of common neighbors for community discovery in weighted networks. Firstly, the similarity of the node pair is defined based on the attributes of their common neighbors. Secondly, the most closely related nodes are fast clustered according to their similarity to form initial communities and expand the communities. Finally, communities are merged through maximizing the modularity so as to optimize division results. Experiments are carried out on many weighted networks, which have verified the effectiveness of the proposed algorithm. And results show that IEM is superior to weighted common neighbor (CN), weighted Adamic-Adar (AA) and weighted resources allocation (RA) when using the weighted modularity as evaluation index. Moreover, the proposed algorithm can achieve more reasonable community division for weighted networks compared with cluster-recluster-merge-algorithm (CRMA) algorithm.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39B no.3
• /
• pp.188-190
• /
• 2014

In mobile ad hoc networks(MANETs), each node rebroadcast received route request packets for route discovery. Flooding from large number of nodes induces the broadcast storm problem which causes severe degradation in network performance due to redundant retransmission, collision and contention. This paper presents a node status algorithm based on probabilistic scheme to alleviate the broadcast storm problem for wireless ad hoc networks.