• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.45 no.6
• /
• pp.131-138
• /
• 2008

Mobile Ad hoc NETworks (MANETs) refer to autonomous networks in which wireless data communications are established between multiple nodes in a given coverage area without a base station or centralized administration. Because of node mobility and limited battery life, the network topology may changes frequently. Selecting the most reliable path during route discovery process is important to improve performance in ad hoc networks. In this paper, an enhanced routing protocol based on AODV(Ad hoc On-demand Distance Vector routing) by monitoring variation of receiving signal strength is proposed. New metric function that consists of node mobility and hops of path is used for routing decision. For preventing route failure by node movement during data transmission, a new route maintenance named as LRC (Local Route Change) is presented. If the node movement is detected, the routing agent switches path to its neighbor node in LRC. Simulation results show that the performance of the proposed routing scheme is superior to previous AODY protocol.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.46 no.4
• /
• pp.61-68
• /
• 2009

In this paper, we propose a Cluster-based Cooperative Routing using ARQ (CCRA) for supporting both reliability and transmitting efficient service in mobile ad-hoc wireless sensor networks with Rayleigh fading environments. The main contributions and features of this paper are as follows. First, the clustering method which uses the position information of nodes as underlying structure for supporting reliable transmission services is used. Second, the cooperative data transmission method based on the underlying clustering informations is used to improve both reliability and data transmission efficiency. Third, the ARQ-based transmission is used to improve transmission reliability. Fourth, we consider a realistic approach, in the points of view of mobile ad-hoc wireless sensor networks, based on mobile sensor nodes as well as fixed sensor nodes in the sensor fields while the conventional research for sensor networks focus on mainly fixed sensor networks. The performance evaluation of proposed routing protocol implemented via simulation using Optimized Network Engineering Tool (OPNET) and theoretical analysis.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.48 no.6
• /
• pp.25-34
• /
• 2011

In this paper, In this paper, we propose a Cooperative Routing Protocol (CooRP) for supporting network convergence and transmission services efficiently in mobile ad-hoc wireless sensor networks with Rayleigh fading environments. The main contributions and features of this paper are as follows. First, the routing routes are decided on route stability based on entropy concepts using mobility of nodes within the direction guided line region to increase the operational lifetime of routes as well as reduce control overhead for route construction. Second, a cooperative data transmission strategy based on the constructed stable routing route is used to increase packet delivery ratio with advanced SNR. Third, a theoretical analysis for cooperative data transmission of the proposed CooRP with outage probability is presented. The performance evaluation of the proposed CooRP is performed via simulation using OPNET and analysis. The results of performance evaluation show that the proposed CooRP by using stable routing routes and cooperative transmission can increase packet delivery ratio efficiently.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.46 no.2
• /
• pp.36-43
• /
• 2009

In this paper, we propose a Cooperative Routing using ARQ-based Transmission (CRARQ) in Mobile Ad-hoc Wireless Sensor Networks (MAWSN). The goals of the CRARQ are to improve both the efficiency of transmission and the reliability of transmission together. The main features and contributions of the proposed CRARQ for supporting these goals are as follows. First, CRARQ uses a reactive concept to construct a route from a source to a destination. Second, CRARQ chooses the most stable relay at each hop along the route by mobility-based strategy. Third, cooperative transmission using the ARQ technique which can improve reliability is used at each hop to send data packets from source to destination. Finally, we present a theoretical analysis model for the proposed CRARQ. The performance evaluation of our protocol is implemented via simulation using Optimized Network Engineering Tool (OPNET) and analysis. The results of both simulation and analysis show that CRARQ achieves the improved packet delivery ratio (PDR) and outage probability.

• Journal of KIISE:Computer Systems and Theory
• /
• v.33 no.9
• /
• pp.666-676
• /
• 2006

Rapid advances in ubiquitous computing and its pervasive influence over our society demand an efficient way to locate resources over the network. In mobile ad-hoc networks (MANETs) which is a special type of the sub-networks in ubiquitous environment, effective resource discovery is particularly important, due to their dynamics and the resource constraints on wireless nodes. In this paper, we propose an adaptive and efficient resource discovery strategy for MANETs. Our strategy also provides a solution to bridge different types of networks which coexist in ubiquitous environment.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.6B
• /
• pp.728-737
• /
• 2011

For the real time monitoring and tracking of shipping container which is one of the core objects for global logistics, Wireless Ad-Hoc Network technology might be needed in stacking environments such as ports, yards and ships. In this paper, we propose a container network routing protocol suitable for port or yard stacking environments which include some constraints such as shadow area problem from metal material, frequent movement of container, etc. With this protocol in which a mesh network algorithm is applied, every container data packet can be delivered to the sink node reliably even with frequent join/leave of container nodes. As soon as a node on path gets malfunction, alternative backup path is supported with notice to neighbor node, which makes constant total optimal path. We also verified that the performance of proposed protocol is better than AODV, one of previous major MANet(Mobile Ad-Hoc Network) protocol with a function for alternative path, which says the proposed protocol is better for frequent join/leave and variable link quality.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2007.11a
• /
• pp.377-382
• /
• 2007

Mobile ad hoc network(MANET) is a kind of wireless network which has no infrastructure. Each component node of MANET can move freely and communicate based on wireless peer to peer mode. Because of its vulnerable routing protocols, MANET is exposed to many kinds of attacks. A sinkhole attack is one of the representative attacks in MANET caused by attempts to draw all network traffic to a sinkhole node. This paper focuses on the sinkhole problem on Dynamic Source Routing(DSR) protocol in MANET. To detect the sinkhole node, we extract several useful sinkhole indicators through analyzing the sinkhole problem, then propose an efficient detection method based on an incremental learning algorithm. The simulation results show that the proposed method is effective and reliable for detecting sinkhole intrusion.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.4
• /
• pp.1223-1236
• /
• 2014

With the extension of wireless technology, vehicular ad hoc networks provide important services for the dissemination of general data and emergency warnings. However, since, the vehicle topology frequently changes from a dense to a sparse network depending on the speed of the moving vehicles and the time of day, vehicular ad hoc networks require a protocol that can facilitate the efficient and reliable dissemination of emergency messages in a highly mobile environment under dense or intermittent vehicular connectivity. Therefore, this paper proposes a new vehicular broadcast protocol, called BL-CAST, that can operate effectively in both dense and sparse network scenarios. As a low overhead multi-hop broadcast protocol, BL-CAST does not rely on the periodic exchange of beacons for updating location information. Instead, the location information of a vehicle is included in a broadcast message to identify the last rebroadcasting vehicle in an intermittently connected network. Simulation results show that BL-CAST outperforms the DV-CAST protocol in terms of the end-to-end delay, message delivery ratio and network overhead.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37C no.12
• /
• pp.1256-1262
• /
• 2012

Mobile ad hoc networks (MANETs) are infrastructure-less, autonomous, and stand-alone wireless networks with dynamic topologies. Recently, cluster-based ad hoc networks which enhance the security and efficiency of ad hoc networks are being actively researched. And routing protocols for cluster-based ad hoc networks are also studied. However, there are few studies about secure routing protocols in cluster-based ad hoc networks. In this paper, we propose secure routing protocol for cluster-based ad hoc networks. We use Diffie-Hellman key agreement, HMAC, and digital signature to support integrity of routing messages, and finally can perform secure routing.

• Journal of Internet Computing and Services
• /
• v.5 no.2
• /
• pp.75-84
• /
• 2004

Geocasting, a variant of the conventional multicasting problem, is one of communication type in which the data packets are delivered to a group of all nodes within a specified geographical region (i.e., the geocasting region) and is called location-based multicasting(LBM)(l). An Ad-hoc network is a dynamically reconfigurable and temporary wireless network where all mobile devices using batteries as energy resources cooperatively maintain network connectivity without central administration or the assistance of base stations. Consequently, the technique to efficiently consume the limited amounts of energy resources is an important problem so that the system lifetime is maximized. In this paper, we propose a LBPA(Location-Based Power Aware) geocasting algorithm that selects energy-aware neighbor to route a packet towards the target region In Ad-hoc network environments. The method Is such that the energy consumption is balanced among the nodes in proportion to their energy reserves. Through the simulations, the proposed LBPA algorithm shows better results, that is, as good as 40% on the average over the conventional LBM algorithm in terms of the network lifetime.