• ETRI Journal
• /
• v.37 no.6
• /
• pp.1108-1119
• /
• 2015

Multicast communication of mobile ad hoc networks is vulnerable to internal attacks due to its routing structure and high scalability of its participants. Though existing intrusion detection systems (IDSs) act smartly to defend against attack strategies, adversaries also accordingly update their attacking plans intelligently so as to intervene in successful defending schemes. In our work, we present a novel indirect internal stealthy attack on a tree-based multicast routing protocol. Such an indirect stealthy attack intelligently makes neighbor nodes drop their routing-layer unicast control packets instead of processing or forwarding them. The adversary targets the collision avoidance mechanism of the Medium Access Control (MAC) protocol to indirectly affect the routing layer process. Simulation results show the success of this attacking strategy over the existing "stealthy attack in wireless ad hoc networks: detection and countermeasure (SADEC)" detection system. We design a cross-layer automata-based stealthy attack on multicast routing protocols (SAMRP) attacker detection system to identify and isolate the proposed attacker. NS-2 simulation and analytical results show the efficient performance, against an indirect internal stealthy attack, of SAMRP over the existing SADEC and BLM attacker detection systems.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.33B no.5
• /
• pp.41-51
• /
• 1996

In this paper, anew parallel processing system based on a cluster architecture which provides scalability of a parallel processing system while maintains shared memory multiprocessor characteristics is proposed. In recent days low cost, high performnce microprocessors have led to construction of large scale parallel processing systems. Such parallel processing systems provides large scalability but are mainly used for scientific applications which have large data parallelism. A shared memory multiprocessor system like TICOM is currently used as aserver for the commercial application, however, the shared memory multiprocessor system is known to have very limited scalability. The proposed architecture can support scalability and performance of the parallel processing system while it provides adaptability for the commerical application, hence it can overcome the limitation of the shared memory multiprocessor. The architecture and characteristics of the proposed system shall be described. A proprietary hierarchical crsossbar network is designed for this system, of which the protocol, routing and switching technique and the signal transfer technique are optimized for the proposed architecture. The design trade-offs for the network are described in this paper and with simulation usihng the SES/workbench, it is explored that the network fits to the proposed architecture.

• International Journal of Computer Science & Network Security
• /
• v.22 no.3
• /
• pp.236-244
• /
• 2022

Network Mobility Basic Support (NEMO BS) protocol has been accredited and approved by Internet Engineering Task Force (IETF) working group for mobility of sub-networks. Trains, aircrafts and buses are three examples of typical applications for this protocol. The NEMO BS protocol was designed to offer Internet access for a group of passengers in a roaming vehicle in an adequate fashion. Furthermore, in NEMO BS protocol, specific gateways referred to Mobile Routers (MRs) are responsible for carrying out the mobility management operations. Unfortunately, the main limitations of this basic solution are pinball suboptimal routing, excessive signaling cost, scalability, packet delivery overhead and handoff latency. In order to tackle shortcomings of triangular routing and Quality of Service (QoS) deterioration, the proposed scheme (Diff-FH NEMO) has previously evolved for end-users in moving network. In this sense, the article focuses on an exhaustive analytic evaluation at Home Agent (HA) entity of the proposed solutions. An investigation has been conducted on the signaling costs to assess the performance of the proposed scheme (Diff-FH NEMO) in comparison with the standard NEMO BS protocol and MIPv6 based Route Optimization (MIRON) scheme. The obtained results demonstrate that, the proposed scheme (Diff-FH NEMO) significantly improves the signaling cost at the HA entity in terms of the subnet residence time, number of mobile nodes, the number of DMRs, the number of LFNs and the number of CNs.

• Proceedings of the Korea Contents Association Conference
• /
• 2006.05a
• /
• pp.411-414
• /
• 2006

Topology information can be aggregated in the network constructed hierarchically and aggregating topology information is known as TA(Topology Aggregation) and TA is very important for scalability in networks. It is a very important elements to extend networks and routing in networks. In paticular, routing and TA algorithm are much influence on networks performance in PNNI. Therefore, in this paper, we design and implement routing simulator for TA in PNNI.

• Proceedings of the IEEK Conference
• /
• 1999.06a
• /
• pp.154-157
• /
• 1999

Photonic Slot Routing(PSR) is a promising approach to solve the fundamental scalability problem of all-optical packet switched WDM networks. In photonic slot routing, packets destined for the same subnetwork are aggregated to form a photonic slot which is jointly routed as a single unit of information through the network. The relative location of the nodes from bridge may cause to fairness problem in the unidirectional WDM ring network based on PSR. As photonic slots from different subnetworks can originate contentions at the bridge, packets may be dropped and retransmitted. Thus we evaluated the performance of PSR based WDM ring network in the point of fairness for each node and slot contentions at the bridge. Simulation results show that the PSR based WDM ring requires a slot access mechanism to guarantee the transmission fairness and efficient switch architecture to resolve slot contention at the bridge.

• Journal of Communications and Networks
• /
• v.13 no.6
• /
• pp.612-620
• /
• 2011

Recently, one of the problems with the Internet is the issue of scalability. To this end, locator/identifier separation protocol (LISP), which separates end-system identifiers and routing locators, has been proposed as a solution. In the LISP deployed network, the ingress and egress nodes of inter-AS traffic is determined by edge router selection (ERS) and endpoint identifier-routing locator mapping assignment (ERMA). In this paper, joint optimizations of ERS and ERMA for stub networks with and without predetermined link weights are studied and the mixed integer linear programming (MILP) formulations for the problems are given. To make the problem with optimizable link weights tractable, a revised local search algorithm is also proposed. Simulation results show that joint optimization of ERS and ERMA enables better network performance.

• Journal of Information Processing Systems
• /
• v.7 no.1
• /
• pp.29-42
• /
• 2011

Wireless sensor networks are composed of a large number of sensor nodes with limited energy resources. One critical issue in wireless sensor networks is how to gather sensed information in an energy efficient way, since their energy is limited. The clustering algorithm is a technique used to reduce energy consumption. It can improve the scalability and lifetime of wireless sensor networks. In this paper, we introduce a clustering protocol with mode selection (CPMS) for wireless sensor networks. Our scheme improves the performance of BCDCP (Base Station Controlled Dynamic Clustering Protocol) and BIDRP (Base Station Initiated Dynamic Routing Protocol) routing protocol. In CPMS, the base station constructs clusters and makes the head node with the highest residual energy send data to the base station. Furthermore, we can save the energy of head nodes by using the modes selection method. The simulation results show that CPMS achieves longer lifetime and more data message transmissions than current important clustering protocols in wireless sensor networks.

• Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
• /
• v.19 no.8
• /
• pp.138-143
• /
• 2005

A hierarchical tree structure of clusters has advantages for the network design due to its scalability and simple routing protocol. In this paper, the cluster tree routing protocol is studied for the wireless sensor network. From the numerical analysis results, the data aggregation in the intermediate nodes reduces the number of communication message and saves the energy of sensor nodes, but it may result in increased data traffic latency. And also the selection of cluster head can increase the relaying hops very high.

• Journal of information and communication convergence engineering
• /
• v.22 no.1
• /
• pp.1-6
• /
• 2024

Energy efficiency in wireless sensor networks (WSNs) is a critical issue because batteries are used for operation and communication. In terms of scalability, energy efficiency, data integration, and resilience, WSN-cluster-based routing algorithms often outperform routing algorithms without clustering. Low-energy adaptive clustering hierarchy (LEACH) is a cluster-based routing protocol with a high transmission efficiency to the base station. In this paper, we propose an energy consumption model for LEACH and compare it with the existing LEACH, advanced LEACH (ALEACH), and power-efficient gathering in sensor information systems (PEGASIS) algorithms in terms of network lifetime. The energy consumption model comprises energy-sensitive cluster formation and a cluster head selection technique. The setup and steady-state phases of the proposed model are discussed based on the cluster head selection. The simulation results demonstrated that a low-energy-consumption network was introduced, modeled, and validated for LEACH.

• Journal of KIISE:Computing Practices and Letters
• /
• v.10 no.5
• /
• pp.365-374
• /
• 2004

This paper proposes the architecture of Intermediate System to Intermediate System routing protocol. IS-IS is a link state routing protocol designed to provide routing in a network layer protocols with datagram services. IS-IS has favored scalability and stability. So, it is important to support IS-IS for the MPLS system used in backbone networks. Especially, IS-IS must provide network state information and available resource information for supporting qualify of services in MPLS network. Therefore, we propose the design architecture of IS-IS routing protocol and the implementation technologies. Also, we propose extended architecture for traffic engineering in ATM based MPLS system.