• Journal of Korea Multimedia Society
• /
• v.13 no.6
• /
• pp.849-864
• /
• 2010

This paper proposes a multipath routing protocol called cross-layer multipath AODV (CM-AODV) for wireless ad hoc networks, which selects multiple routes on demand based on the signal-to-interference plus noise ratio (SINR) measured at the physical layer. Note that AODV (Ad hoc On-demand Distance Vector) is one of the most popular routing protocols for mobile ad hoc networks. Each time a route request (RREQ) message is forwarded hop by hop, each forwarding node updates the route quality which is defined as the minimum SINR of serialized links in a route and is contained in the RREQ header. While achieving robust packet delivery, the proposed CM-AODV is amenable to immediate implementation using existing technology by neither defining additional packet types nor increasing packet length. Compared to the conventional multipath version of AODV (which is called AOMDV), CM-AODV assigns the construction of multiple paths to the destination node and makes it algorithmically simple, resulting in the improved performance of packet delivery and the less overhead incurred at intermediate nodes. Our performance study shows that CM-AODV significantly outperforms AOMDV in terms of packet delivery ratio and average end-to-end delay, and results in less routing overhead.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.3
• /
• pp.1330-1347
• /
• 2018

Mobile Ad hoc Network (MANET) is a collection of nodes or communication devices that wish to communicate without any fixed infrastructure and predetermined organization of available links. The effort has been made by proposing a scheme to overcome the critical security issue in MANET. The insufficiency of security considerations in the design of Ad hoc On-Demand Distance Vector protocol makes it vulnerable to the threats of collaborative black hole attacks, where hacker nodes attack the data packets and drop them instead of forwarding. To secure mobile ad hoc networks from collaborative black hole attacks, we implement our scheme and considered sensor's energy as a key feature with a better packet delivery ratio, less delay time and high throughput. The proposed scheme has offered an improved solution to diminish collaborative black hole attacks with high performance and benchmark results as compared to the existing schemes EDRIAODV and DRIAODV respectively. This paper has shown that throughput and packet delivery ratio increase while the end to end delay decreases as compared to existing schemes. It also reduces the overall energy consumption and network traffic by maintaining accuracy and high detection rate which is more safe and reliable for future work.

• The KIPS Transactions:PartC
• /
• v.9C no.6
• /
• pp.935-944
• /
• 2002

It is the Mobile Ad Hoc Networks that constituted with serveral mobile node that can communicate with other mobile nodes. Until now, there were no routing protocols considering such as Multimediadata, VOD (Video On Demand), which is required of lots of bandwidth in Mobile Ad Hoc Network, io we are in the need of QoS (Quality of Service)routing protocol to transmit the data packets faster and more accurate. Also, there are an unidirectional links due to asymmetric property of mobile terminals or current wireless environments on practical mobile ad hoc networks. However, at present, the existing mobile ad hoc routing protocols are implemented to support only bidirectional links. In this paper, we propose the Advanced Routing routing protocol in order to implement a new routing protocol, which is fit to mobile ad hoc networks containing unidirectional links and to support QoS service. For the performance evaluation, we use NS-2 simulator of U.C. Berkeley. We could get not only increased received data rate and decreased average route discovery time, but also network load decreases with compared Best effort service.

• Journal of Korea Society of Industrial Information Systems
• /
• v.16 no.2
• /
• pp.13-18
• /
• 2011

Security supports are a significant factor in mobile ad hoc networks. Especially in dynamic topologies, considering cluster, key management is essential to provide a secure system. Recently, Li-Liu proposed iD-based multiple key management scheme for cluster-based ad hoc networks. However, we found the security weakness of their scheme. In this paper, we analyze the security of Li-Liu's scheme and show that master secret key and fragment of the master secret key can be revealed to compromised CHs and nodes. Furthermore, we propose a solution to improve the scheme against disclosure of the share key and the master secret key even though system parameters are opened to compromised nodes and modify the Li-Liu's scheme fitted for a scalable networks. The improved IMKM scheme could be usefully applied in dynamic cluster-based MANETs such as the military battlefields, mobile marketplace and VANETs.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2017.05a
• /
• pp.649-651
• /
• 2017

A clustering problem is one of the organizational problems to improve the network lifetime and scalability in wireless ad-hoc networks. This problem is a difficult combinatorial optimization problem associated with the design and operation of these networks. In this paper, we propose an efficient clustering algorithm to maximize the network lifetime and consider scalability in wireless ad-hoc networks. The clustering problem is known to be NP-hard. We thus solve the problem by using optimization approaches that are able to efficiently obtain high quality solutions within a reasonable time for a large size network. The proposed algorithm selects clusterheads and configures clusters by considering both nodes' power and the clustering cost. We evaluate this performance through some experiments in terms of nodes' transmission energy. Simulation results indicate that the proposed algorithm performs much better than the existing algorithms.

• Journal of Communications and Networks
• /
• v.13 no.5
• /
• pp.525-535
• /
• 2011

In this paper, we study the contribution of network coding (NC) in improving the multicast capacity of random wireless ad hoc networks when nodes are endowed with multi-packet transmission (MPT) and multi-packet reception (MPR) capabilities. We show that a per session throughput capacity of ${\Theta}$(nT$^3$(n)) can be achieved as a tight bound when each session contains a constant number of sinks where n is the total number of nodes and T(n) is the transmission range. Surprisingly, an identical order capacity can be achieved when nodes have only MPR and MPT capabilities. This result proves that NC does not contribute to the order capacity of multicast traffic in wireless ad hoc networks when MPR and MPT are used in the network. The result is in sharp contrast to the general belief (conjecture) that NC improves the order capacity of multicast. Furthermore, if the communication range is selected to guarantee the connectivity in the network, i.e., ${\Omega}$($\sqrt{log\;n/n}$)=T(n) = O(log log n / log n), then the combination of MPR and MPT achieves a throughput capacity of ${\Theta}$(log$^{\frac{3}{2}}$ n/$\sqrt{n}$) which provides an order capacity gain of ${\Theta}$(log$^2$ n) compared to the point-to-point multicast capacity with the same number of destinations.

• Journal of Communications and Networks
• /
• v.9 no.3
• /
• pp.282-295
• /
• 2007

Due to the nature that high datarate leads to shorter transmission range, the performance enhancement by high datarate 802.11 WLANs may be degraded when applying high datarate to an 802.11 based multihop ad hoc network. In this paper, we evaluate, through extensive simulations, the performance of multihop ad hoc networks at multiple transmission datarates, in terms of the number of hops between source and destination, throughput, end-to-end delay and packet loss. The study is conducted based on both stationary chain topology and mesh topologies with or without node mobility. From numerical results on network performance based on chain topology, we conclude that there is almost no benefit by applying the highest datarate when the chain length is 6 hops or more. With node mobility in mesh topology, the benefit of using high datarate diminishes at even shorter number of hops. To explore the main reasons for this behavior, analyses on multihop end-to-end throughput and network k-connectivity have been conducted later in the paper, and correspondingly an auto-rate adaptation algorithm has been proposed.

• Proceedings of the Korean Information Science Society Conference
• /
• 2002.04a
• /
• pp.190-192
• /
• 2002

무선 통신 기술의 발달과 함께 응급상황이나 전시와 같이 필요에 의해 임의의 장소에 형성되어 사용되어질 수 있는 네트워크의 필요성이 커지면서 Ad-hoc 네트워크에 관한 여러 가지 연구가 진행되고 있다. Ad-Hoc 네트워크에서는 기존의 유선 네트워크 망에서와는 달리휴대용 기기들만으로 네트워크 망이 형성이 되어있고 이때 휴대용 기기들은 대부분 배터리를 에너지원으로 사용한다. 무한대의 에너지를 갖고 있다고 볼 수 있었던 종전의 유선 네트워크에서와는 단리 배터리를 에너지원으로 사용하는 Ad-Hoc 네트워크에서는 효율적인 에너지 자원 관리가 중요한 이슈가 된다. 이에 관련된 연구의 하나로 Chang과 Tassiulas는 [1]에서 시스템 활동시간 증가에 초점을 두고 Ad-Hoc 네트워크상의 라우팅 경로를 재조정해 줌으로써 시스템의 활동 시간을 늘이는 라우팅 방법을 제안하였다. 그러나, 그들의 방법에서는 단지 데이터 전송에 사용되는 에너지의 양만을 고려한 모델로, 에어신호의 전송 에너지 사용은 고려하지 않았다. 본 논문에서는 Ad-hoc 네트워크의 라우팅에 데이터 전송 뿐만 아니라 제어신호의 전송 에너지 사용을 함께 고려한 라우팅 방법을 소개한다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.10c
• /
• pp.619-621
• /
• 2003

최근 무선 환경에서 기지국 없이 이동 노드들만으로도 서로 통신할 수 있는 ad­hoc 네트워크에 대한 연구가 진행되고 있다. 이러한 무선 ad­hoc 네트워크 환경에서는 라우팅 프로토콜이 중요한 역할을 하게 되는데 그 중에서 DSR(Dynamic Source Routing)은 무선 ad­hoc 네트워크 환경에 적합한 소스 라우팅을 기반으로 한 라우팅 프로토콜이다. 그러나 DSR은 데이터 전송 경로를 선택할 때 그 경로의 신뢰성을 고려하지 않는다. 이를 해결하기 위해 본 논문에서는 무선 ad­hoc 네트워크 환경에서 노드의 우선순위에 기반한 신뢰성 있는 경로 설정 기법을 제안한다. 이 기법은 경로 설정 후에 데이터를 송수신하는 과정에서. 선택된 경로의 링크가 유실될 확률을 줄여줌으로써 더욱 신뢰성 있는 데이터 송수신을 보장한다. 그러므로 이 기법은 무선 ad­hoc 네트워크 환경에서 데이터의 손실을 줄일 필요가 있는 멀티미디어 통신 등의 응용분야에 적용시킬 수 있다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2003.05b
• /
• pp.1441-1444
• /
• 2003

Ad-Hoc 네트워크는 기존에 설치된 유선망이나 기지국과 같은 기반 구조가 없는 환경에서 이동 호스트들로만 구성되는 임시적인 무선 이동 네트워치이다. Ad-Hoc 통신망은 이동단말기의 이동성 문제로 인하여 보안에서 심각한 문제를 가지고 있는데 아직까지 제안된 Ad-Hoc 통신망 프로토콜에는 충분한 보안에 관한 해결방안이 제시되지 못하고 있는 실정이다. Ad-Hoc 네트워크에서 안전한 라우팅 프로토콜을 설정하기 위해서는 호스트들 사이에 인증을 하여야 한다. 본 논문에서는 Ad-Hoc에서 안전한 라우팅 선정을 위한 인증 프로토콜을 제안한다. 제안한 프로토콜은 해쉬 함수와 디지털 서명을 통하여 노드들을 인증하여 라우팅 설정에 안전성을 제공한다.