• International Journal of Computer Science & Network Security
• /
• v.21 no.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.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.12 no.8
• /
• pp.1384-1390
• /
• 2008

The TCP protocol is originally designed for wired network, however it performs very poor in wireless network due to different nature of wireless network from wired networks. In terms of TCP performance improvement in wireless Ad-hoc network, many researches show that small congestion window size of TCP connection can improve TCP performance. We propose a new TCP algorithm to improve TCP performance in wireless Ad-hoc network. The basic idea of our approach is that TCP receiver estimates the optimum window size and then sets congestion window limit of TCP sender to an optimum value by using the advertised window field in TCP ACK packet. From extensive computer simulation, the proposed algorithm shows superior performance than traditional TCP protocols in terms of packet delivery ratio and packet loss.

• The KIPS Transactions:PartC
• /
• v.18C no.3
• /
• pp.167-178
• /
• 2011

As the growth of ubiquitous services, various types of ad hoc networks have emerged. In particular, wireless sensor networks (WSN) and mobile ad hoc networks (MANET) are widely known ad hoc networks, but there are also other kinds of wireless ad hoc networks in which the characteristics of the aforementioned two network types are mixed together. This paper proposes a variant of the Low Energy Adaptive Cluster Hierarchy (LEACH) routing protocol modified to be suitable in such a combined network environment. That is, the proposed routing protocol provides node detection and route discovery/maintenance in a network with a large number of mobile sensor nodes, while preserving node mobility, network connectivity, and energy efficiency. The proposed routing protocol is implemented with a multi-hop multi-path algorithm, a topology reconfiguration technique using node movement estimation and vibration sensors, and an efficient path selection and data transmission technique for a great many moving nodes. In the experiments, the performance of the proposed protocol is demonstrated by comparing it to the conventional LEACH protocol.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2008.11a
• /
• pp.1142-1145
• /
• 2008

This paper proposes a novel cluster-based lookup service in mobile ad hoc networks. By applying a self-adaptive multi-hop clustering, we avoid the empty region problem of grid system and omit the need of GPS device. The novelty of the proposed scheme is in its exploitation of hashing function for location querying to achieve low communication overhead. By varying different simulation parameters, we show that the proposed scheme is scalable and adaptive to many networks scenarios. Experiment results demonstrate that our scheme reduces the communication overhead significantly.

• Journal of Information Processing Systems
• /
• v.10 no.1
• /
• pp.36-54
• /
• 2014

Resource sharing is a major advantage of distributed computing. However, a distributed computing system may have some physical or virtual resource that may be accessible by a single process at a time. The mutual exclusion issue is to ensure that no more than one process at a time is allowed to access some shared resource. The article proposes a token-based mutual exclusion algorithm for the clustered mobile ad hoc networks (MANETs). The mechanism that is adapted to handle token passing at the inter-cluster level is different from that at the intra-cluster level. It makes our algorithm message efficient and thus suitable for MANETs. In the interest of efficiency, we implemented a centralized token passing scheme at the intra-cluster level. The centralized schemes are inherently failure prone. Thus, we have presented an intra-cluster token passing scheme that is able to tolerate a failure. In order to enhance reliability, we applied a distributed token circulation scheme at the inter-cluster level. More importantly, the message complexity of the proposed algorithm is independent of N, which is the total number of nodes in the system. Also, under a heavy load, it turns out to be inversely proportional to n, which is the (average) number of nodes per each cluster. We substantiated our claim with the correctness proof, complexity analysis, and simulation results. In the end, we present a simple approach to make our protocol fault tolerant.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2009.11a
• /
• pp.541-542
• /
• 2009

MANET은 유선 기반망의 도움 없이 무선 노드들 간에 서로 협력하여 다중-홉으로 정보를 주고 받을 수 있도록 해주는 네트워크이다. 최근 MANET과 인터넷 망과의 통신이 요구되고 있고 이를 위해 무선 노드가 글로벌 IP 주소를 할당 받을 수 있어야 한다. 본 논문에서는 인터넷 게이트웨이를 통해 인터넷 망과 연결된 MANET 구조에서 무선 노드가 빠르게 글로벌 IP 주소를 설정할 수 있는 기법을 제안한다. 제안하는 기법의 성능 평가를 위해 NS-2로 실험을 수행했으며, 그 결과 기존 방법보다 빠르게 글로벌 IP 주소를 설정하고 네트워크 부하를 감소 시킬 수 있음을 입증하였다.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.8 no.1
• /
• pp.71-76
• /
• 2013

In this paper, end-to-end performances for some VoIP traffics are measured and analyzed over MANET(Mobile Ad-hoc Networks) with packet aggregation transmission under blackhole attacks. A VoIP simulator based on NS-2 is used for performance measure. In the simulation, MOS, call connection ratio, network delay and packet loss rate are measured for end-to-end transmission performance. With analysis of measured data, characteristics of each traffics for performance parameters of packet aggregation transmission is showed on MANET under blackhole attack, As a results of this paper, some considerations be required for packet aggregation transmission are suggested to implement VoIP services on MANET under blackhole attacks.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.6 no.1
• /
• pp.49-54
• /
• 2011

In this paper, End-to-End VoIP(Voice over Internet Protocol) performance over large scale MANET(Mobile Ad-hoc Networks) is evaluated. VoIP implementation model, which can be used for large scale MANET, is suggested through this evaluation. VoIP simulator based on NS-2 network simulator is used for performance measurement. Call connection ratio as a connection performance, MOS and network delay as a transmission performance, packet loss rate as other performance is measured with this simulation. Finally, maximum $10{\sim}15km^2$ as a single MANET, 500 nodes and 100 call connections is suggested for VoIP implementation and operation conditions over large scale MANETs.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.7 no.2
• /
• pp.257-262
• /
• 2012

In this paper, transmission performance for serval VoIP traffics is meaured and analysised over MANET(Mobile Ad-hoc Networks) under some types of intrusions. VoIP simulator based on NS-2 is used for performance measure. In the simulation, MOS, network delay, packet loss rate and call connection rate is measured for transmission performance. With analysis of measued data, characteristics of each traffics for transmission performance parameters is showed on MANET under multi intrusions, As a results of this paper, some recommendation condtion for codec selection and blackhole intrusion is suggested to implement VoIP services on MANET under multi intrusions like as DDoS and blockhole intrusions.

• Journal of KIISE:Information Networking
• /
• v.35 no.6
• /
• pp.521-528
• /
• 2008

Such conventional maritime communication technologies as radio have short some comings in their transmission quality. It can be overcome by wireless channels provided by satellites such as INMARSAT, which nevertheless suffer from the high costs. In this paper, we propose a novel technology resolving the above problems, featuring in the establishment of maritime communication networks with multi-hop structures. The inter vessel and ship-to- shore networks previously modeled after MANET are remodeled by SANET (Ship Ad Hoc Networks) in the present work. Fan-shaped Search Zone Routing (FSR) protocol also is presented, which utilizes not only static geographical information including the locations of ports and the navigations of courses but also the unique characteristics of ships in terms of mobile nodes. The FSR finds the fan-shaped search zone on which the shortest path is located. The performance of LAR protocol is compared with that of FSR in several ways. First, FSR does not make use of a type of control packets as beaconing data, resulting in a full utilization of the bandwidth of the wireless channels. Second, the delivery rate by the FSR is 100% for the fan-shaped search zone includes at least one route between source and destination nodes on its border line, where as that of LAR has been turned out to be 64%. Third, the optimality of routes searched by the FSR is on a 97% level. Of all, the FSR shows a better performance than LAR by about 50%.