• 한국멀티미디어학회논문지
• /
• 제18권9호
• /
• pp.1083-1090
• /
• 2015

A generalized recursive circulant network(GR) is widely used in the design and implementation of local area networks and parallel processing architectures. In this paper, we investigate the routing of a message on this network, that is a key to the performance of this network. We would like to transmit maximum number of packets from a source node to a destination node simultaneously along paths on this network, where the i^th packet traverses along the i^th path. In order for all packets to arrive at the destination node securely, the i^th path must be node-disjoint from all other paths. For construction of these paths, employing the Hamiltonian Circuit Latin Square(HCLS), a special class of (n x n) matrices, we present O(n²) parallel routing algorithm on generalized recursive circulant networks.

• Journal of Electrical Engineering and information Science
• /
• 제3권2호
• /
• pp.151-157
• /
• 1998

Free-space optical interconnection networks can be classified into two types, space variant and space invariant, according to the degree of space variance. In terms of physical implementations, the degree of space variance can be interpreted as the degree of sharing beam steering optics among the nodes of a given network. This implies that all nodes in a totally space-invariant network can share a single beam steering optics to realize the given network topology, whereas, in a totally space variant network, each node requires a distinct beam steering optics. However, space invariant networks require mechanisms for distinguishing the origins of incoming signals detected at the node since several signals may arrive at the same time if the node degree of the network is greater than one. This paper presents a signal source encoding scheme for distinguishing incoming signals efficiently, in terms of the number of detectors at each node or the number of unique wavelengths. The proposed scheme is solved by developing a new parallel genetic algorithm called distributed asynchronous genetic algorithm (DAGA). Using the DAGA, we solved signal distinction schemes for various network sizes of several topologies such as hypercube, the mesh, and the de Brujin.

• 한국컴퓨터정보학회논문지
• /
• 제22권8호
• /
• pp.73-83
• /
• 2017

In this paper, we discuss the differences between an ordinary B-tree and B-tree implemented by NTFS. There are lots of distinctions between the two B-tree, if not understand the distinctions fully, it is difficult to utilize and analyze artifacts of NTFS. Not much, actually, is known about the implementation of NTFS, especially B-tree index for directory management. Several items of B-tree features are performed that includes a node size, minimum number of children, root node without children, type of key, key sorting, type of pointer to child node, expansion and reduction of node, return of node. Furthermore, it is emphasized the fact that NTFS use B-tree structure not B+structure clearly.

• Journal of information and communication convergence engineering
• /
• 제9권6호
• /
• pp.676-682
• /
• 2011

Sybil attack can disrupt proper operations of wireless sensor network by forging its sensor node to multiple identities. To protect the sensor network from such an attack, a number of countermeasure methods based on RSSI (Received Signal Strength Indicator) and LQI (Link Quality Indicator) have been proposed. However, previous works on the Sybil attack detection do not consider the fact that Sybil nodes can change their RSSI and LQI strength for their malicious purposes. In this paper, we present a Sybil attack detection method based on a transmission power range. Our proposed method initially measures range of RSSI and LQI from sensor nodes, and then set the minimum, maximum and average RSSI and LQI strength value. After initialization, monitoring nodes request that each sensor node transmits data with different transmission power strengths. If the value measured by monitoring node is out of the range in transmission power strengths, the node is considered as a malicious node.

• 대한원격탐사학회:학술대회논문집
• /
• 대한원격탐사학회 2004년도 Proceedings of ISRS 2004
• /
• pp.91-94
• /
• 2004

Ubiquitous sensor network is to manage and collect information autonomously by communicating user around device. Security requirements in Ubiquitous based on sensor network are as follows: a location of sensor, a restriction of performance by low electric power, communication by broadcasting, etc. We propose new mutual authentication protocol using a low power of sensor node. This protocol solved a low power problem by reducing calculation overload of sensor node using two steps, RM(Register Manager) and AM(Authentication Manager). Many operations performing the sensor node itself have a big overload in low power node. Our protocol reduces the operation number from sensor node. Also it is mutual authentication protocol in Ubiquitous network, which satisfies mutual authentication, session key establishment, user and device authentication, MITM attack, confidentiality, integrity, and is safe the security enemy with solving low electric power problem.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제2권2호
• /
• pp.82-102
• /
• 2008

Packet losses tend to occur during short error bursts separated by long periods of relatively error-free transmission. There is also a significant spatial correlation in loss among the receiver nodes in a multicast session. To recover packet transmission errors at the transport layer, tree-based protocols construct a logical tree for error recovery before data transmission is started. The current tree construction scheme does not scale well because it overloads the sender node. We propose a scalable recovery tree construction scheme considering these properties. Unlike the existing tree construction schemes, our scheme distributes some tasks normally handled by the sender node to specific nodes acting as repair node distributors. It also allows receiver nodes to adaptively re-select their repair node when they experience unacceptable error recovery delay. Simulation results show that our scheme constructs the logical tree with reduced message and time overhead. Our analysis also indicates that it provides fast error recovery, since it can reduce the number of additional retransmissions from its upstream repair nodes or sender node.

• Journal of Computing Science and Engineering
• /
• 제11권2호
• /
• pp.49-57
• /
• 2017

This paper proposes a new IPv6 networking paradigm as a counter answer to the rationale for locator/identifier separation. Instead of involving separate number spaces each for node identifiers and locators, the context of the IP address as a node identifier alone is utilized and no additional locators are incorporated. That is, there are only node addresses and no locators, and location information is indirectly derived from neighbor relations between nodes. In order to accomplish this, no subnet IDs are utilized; the ID value is set to zero for all subnets. The paper details how to construct this paradigm through novel choice of operational policies in various IPv6 protocols and some trivial modifications. Especially, inherent provision of intra-domain node- as well as subnet-mobility by use of standard link-state intra-domain routing protocols is discussed. A number of important advantages of this paradigm over the canonical IPv6 networking and various known solutions of locator/identifier separation are discussed. Tailoring for multi-area domains and IPv4 is left for further study.

• 디지털산업정보학회논문지
• /
• 제6권1호
• /
• pp.83-90
• /
• 2010

DTNs (Delay Tolerant Networks) refer to the networks that can support data transmission in the extreme networking situations such as continuous delay and no connectivity between ends. DTMNs (Delay Tolerant Networks) are a specific range of DTNs, and its chief considerations in the process of message delivery in the routing protocol are the transmission delay, improvement of reliability, and reduction of network loading. This article proposes a new LCN (Largest Common Neighbor) routing algorism to improve Spray and Wait routing protocol that prevents the generation of unnecessary packets in a network by letting mobile nodes limit the number of copies of their messages to all nodes to L. Since higher L is distributed to nodes with directivity to the destination node and the maximum number of common neighbor nodes among the mobile nodes based on the directivity information of each node and the maximum number of common neighbor nodes, more efficient node transmission can be realized. In order to verify this proposed algorism, DTN simulator was designed by using ONE simulator. According to the result of this simulation, the suggested algorism can reduce average delay and unnecessary message generation.

• 대한수의학회지
• /
• 제37권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.

• Journal of Information Processing Systems
• /
• 제6권3호
• /
• pp.413-434
• /
• 2010

Wireless sensor networks are usually characterized by dense deployment of energy constrained nodes. Due to the usage of a large number of sensor nodes in uncontrolled hostile or harsh environments, node failure is a common event in these systems. Another common reason for node failure is the exhaustion of their energy resources and node inactivation. Such failures can have adverse effects on the quality of the real-time services in Wireless Sensor Networks (WSNs). To avoid such degradations, it is necessary that the failures be recovered in a proper manner to sustain network operation. In this paper we present a dynamic Energy efficient Real-Time Job Allocation (ERTJA) algorithm for handling node failures in a cluster of sensor nodes with the consideration of communication energy and time overheads besides the nodes' characteristics. ERTJA relies on the computation power of cluster members for handling a node failure. It also tries to minimize the energy consumption of the cluster by minimum activation of the sleeping nodes. The resulting system can then guarantee the Quality of Service (QoS) of the cluster application. Further, when the number of sleeping nodes is limited, the proposed algorithm uses the idle times of the active nodes to engage a graceful QoS degradation in the cluster. Simulation results show significant performance improvements of ERTJA in terms of the energy conservation and the probability of meeting deadlines compared with the other studied algorithms.