• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제9권11호
• /
• pp.4644-4661
• /
• 2015

Wireless sensor networks are often organized in the form of clusters leading to the new framework of WSN called cluster or hierarchical WSN where each cluster head is responsible for its own cluster and its members. These hierarchical WSN are prone to various routing layer attacks such as Black hole, Gray hole, Sybil, Wormhole, Flooding etc. These routing layer attacks try to spoof, falsify or drop the packets during the packet routing process. They may even flood the network with unwanted data packets. If one cluster head is captured and made malicious, the entire cluster member nodes beneath the cluster get affected. On the other hand if the cluster member nodes are malicious, due to the broadcast wireless communication between all the source nodes it can disrupt the entire cluster functions. Thereby a scheme which can detect both the malicious cluster member and cluster head is the current need. Abnormal energy consumption of nodes is used to identify the malicious activity. To serve this purpose a learning based energy prediction algorithm is proposed. Thus a two level energy prediction based intrusion detection scheme to detect the malicious cluster head and cluster member is proposed and simulations were carried out using NS2-Mannasim framework. Simulation results achieved good detection ratio and less false positive.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제5권8호
• /
• pp.1388-1403
• /
• 2011

A vehicular ad-hoc network (VANET) consists of vehicles that form a network without any additional infrastructure, thus allowing the vehicles to communicate with each other. VANETs have unique characteristics, including high node mobility and rapidly changing network topology. Because of these characteristics, routing algorithms based on greedy forwarding such as greedy perimeter stateless routing (GPSR) are known to be very suitable for a VANET. However, greedy forwarding just selects the node nearest to the destination node as a relay node within its transmission range. This increases the possibility of a local maximum and link loss because of the high mobility of vehicles and the road characteristics in urban areas. Therefore, this paper proposes a reliability-improving position-based routing (RIPR) algorithm to solve those problems. The RIPR algorithm predicts the positions, velocities, and moving directions of vehicles after receiving beacon messages, and estimates information about road characteristics to select the relay node. Thus, it can reduce the possibility of getting a local maximum and link breakage. Simulation results using ns-2 revealed that the proposed routing protocol performs much better than the existing routing protocols based on greedy forwarding.

• 한국지진공학회:학술대회논문집
• /
• 한국지진공학회 1997년도 춘계 학술발표회 논문집 Proceedings of EESK Conference-Fall 1997
• /
• pp.207-214
• /
• 1997

The objective of this study is to review the current stare of earthquake simulation techniques using the shaking table and check the reliability. One degree-of-freedom(d.o.f.)and three d.o.f. aluminium shear models were used and 4m$\times$4m 6 d.o.f. shaking table was excitated in one horizontal direction to simulate 1940 El centro earthquake accelerogram (NS component). When the acceleration history of shaking table is compared to the desired one, it can be found that the overall histories are very similar, but that the lower frequency range (0~2 Hz) of the actual excitation has generally lower amplitude than that of the desired in fourier transform amplitude. Free vibration and white noise tests have shown almost the same values for natural frequencies, but shown quite different values for damping ratios, that is, 1.37% in case of r\free vibration test vs 14.76% in case of white noise test. The time histories of story shear versus story drift show the globally linear elastic behaviors. But the elliptical shape of the histories with one of the axis being the stiffness of the story implies the effect of viscous damping.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2006년도 하계종합학술대회
• /
• pp.849-850
• /
• 2006

This thesis presents a new analysis method of Vegas network model in single link single source and a new version of Vegas for expanding asymptotically stable region. Actually since original Vegas model is difficult to analysis, we use a modified Vegas network model. Since there is a few tools to analyze nonlinear system with delay, developing other methods is very important and useful. We used state space model in discrete time. Using by Jury's criterion, we could find asymptotically stable region of Vegas network model. And it was a if and only if condition. Moreover, we proposed a new version of Vegas algorithm. To expand asymptotically stable region we modified the original Vegas model. The new analysis method and new Vegas algorithm were justified by ns-2 simulation. And as compare with other result, we could know our method has many advantages.

• Journal of Information Processing Systems
• /
• 제7권4호
• /
• pp.627-634
• /
• 2011

This paper addresses the Proxy Mobile IPv6 (PMIP) handover using bicasting in mobile/wireless networks. The bicasting scheme can be used to support the PMIP handover, which tends to waste the network resources of wireless links and incurs data losses during handover. We propose an enhanced scheme of PMIP handover, called the partial bicasting with buffering for PMIP (PBB-PMIP). In the PBB-PMIP handover, the bicasting is performed in the "partial" region between the Local Mobility Anchor (LMA) and the Mobile Access Gateway (MAG), when a mobile node is in the handover area. The data packets are buffered at the new MAG during handover to reduce data losses and are then forwarded to mobile nodes after handover. By ns-2 simulations, the proposed PBB-PMIP scheme is compared with the existing schemes of PMIP and PMIP with bicasting. The proposed scheme can benefit from the reduction of handover delay and packet loss, and the effective use of the network resources of wireless links, as compared to the existing handover schemes.

• 한국정보통신학회:학술대회논문집
• /
• 한국해양정보통신학회 2010년도 추계학술대회
• /
• pp.475-477
• /
• 2010

IEEE 802.11에 정의된 전력 절약 메카니즘에서 모든 노드들은 동일한 ATIM(Ad hoc Traffic Indication Map) 윈도우 크기와 동일한 비이콘(beacon) 간격을 사용한다. ATIM 윈도우 크기는 처리율과 에너지 소모에 크게 영행을 미치기 때문에 고정된 ATIM 윈도우 크기는 좋은 성능을 나타내지 못한다. 본 논문에서는 네트워크 상태에 따라 ATIM 윈도우 크기를 조절하는 기법을 제시한다. 제시된 기법은 네트워크 특성을 반영하기 위해 (m,k)-firm 스트림 기법을 적용하였다. 제시된 기법의 성능을 평가하기 위해 ns-2 시뮬레이터를 이용한 성능 평가를 수행했다. 수행된 결과를 보면 제시된 프로토콜은 기존의 프로토콜 보다 많은 양의 에너지 절약을 하고 있음을 볼 수 있다.

• International Journal of Computer Science & Network Security
• /
• 제21권7호
• /
• pp.341-349
• /
• 2021

Many emerging mobile ad-hoc network application communications are group-oriented. Multicast supports group-oriented applications efficiently, particularly in a mobile environment that has a limited bandwidth and limited power. Energy effectiveness along with safety are 2 key problem in MANET design. Within this paper, MANET is presented with a stable, energy-efficient clustering technique. In this proposed work advanced clustering in the networks with ticket ID cluster manager (TID-CMGR) has formed in MANET. The proposed routing scheme makes secure networking the shortest route possible. In this article, we propose a Cluster manager approach based on TICKET-ID to address energy consumption issues and reduce CH workload. TID-CMGR includes two mechanism including ticket ID controller, ticketing pool, route planning and other components. The CA (cluster agent) shall control and supervise the functions of nodes and inform to TID-CMGR. The CH conducts and transfers packets to the network nodes. As the CH energy level is depleted, CA elects the corresponding node with elevated energy values, and all new and old operations are simultaneously stored by CA at this time. A simulation trial for 20 to 100 nodes was performed to show the proposed scheme performance. The suggested approach is used to do experimental work using the NS- simulator. TIDCMGR is compared with TID BRM and PSO to calculate the utility of the work proposed. The assessment shows that the proposed TICKET-ID scheme achieves 90 percent more than other current systems.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제13권3호
• /
• pp.1298-1310
• /
• 2019

Network coding (NC) is a promising technology that can improve available bandwidth and packet throughput in wireless sensor networks (WSNs). Sliding window is an improved technology of NC, which is a supplement of TCP/IP technology and can improve data throughput and network lifetime on WSNs. This paper proposes a network coding-based maximum lifetime algorithm for sliding window in WSNs (NC-MLSW) which improves the throughput and network lifetime in WSN. The packets on the source node are sent on the WSNs. The intermediate node encodes the received original packet and forwards the newly encoded packet to the next node. Finally, the destination node decodes the received encoded data packet and recovers the original packet. The performance of the NC-MLSW algorithm is studied using NS2 simulation software and the network packet throughput, network lifetime and data packet loss rate were evaluated. The simulations experiment results show that the NC-MLSW algorithm can obviously improve the network packet throughput and network lifetime.

• International Journal of Computer Science & Network Security
• /
• 제22권1호
• /
• pp.139-148
• /
• 2022

Research into wireless sensor networks (WSNs) is a trendy issue with a wide range of applications. With hundreds to thousands of nodes, most wireless sensor networks interact with each other through radio waves. Limited computational power, storage, battery, and transmission bandwidth are some of the obstacles in designing WSNs. Clustering and routing procedures have been proposed to address these concerns. The wireless sensor network's most complex and vital duty is routing. With the Greedy Perimeter Stateless Routing method (GPSR), an efficient and responsive routing protocol is built. In packet forwarding, the nodes' locations are taken into account while making choices. In order to send a message, the GPSR always takes the shortest route between the source and destination nodes. Weighted directed graphs may be constructed utilising four distinct distance metrics, such as Euclidean, city block, cosine, and correlation distances, in this study. NS-2 has been used for a thorough simulation. Additionally, the GPSR's performance with various distance metrics is evaluated and verified. When compared to alternative distance measures, the proposed GPSR with correlation distance performs better in terms of packet delivery ratio, throughput, routing overhead and average stability time of the cluster head.

• 디지털산업정보학회논문지
• /
• 제18권4호
• /
• pp.23-30
• /
• 2022

Recently, traffic congestion and environmental pollution have occurred due to population concentration and vehicle increase in large cities. Various studies are being conducted to solve these problems. Most of the traffic congestion in cities is caused by traffic signals at intersections. This paper proposes a dynamic traffic light control (DTLC) scheme to support safe vehicle operation and smooth traffic flow using real-time traffic information based on VANET. DTLC receives instantaneous speed and directional information of each vehicle through road side units (RSUs) to obtain the density and average speed of vehicles for each direction. RSUs deliver this information to traffic light controllers (TLCs), which utilize it to dynamically control traffic lights at intersections. To demonstrate the validity of DTLC, simulations were performed on average driving speed and average waiting time using the ns-2 simulator. Simulation results show that DTLC can provide smooth traffic flow by increasing average driving speed at dense intersections and reducing average waiting time.