• The Journal of Korean Institute of Communications and Information Sciences
• /
• 제39B권12호
• /
• pp.817-821
• /
• 2014

As users generate lots of contents independently of time and places anytime and anywhere together with a rapid development of mobile wireless communication technologies and an explosive dissemination of smart devices, content centric networking (CCN) has emerged as a new networking architecture. However, as CCN is based on one to one message exchanges, it is not appropriate for ad hoc network environment that has frequent network topology changes, which results in high control overhead and low transmission throughput. So, this paper proposes the new content sharing methods using group interest messages in CCN ad hoc environment. It is shown from the simulation that the proposed method can provide low control overhead and high transmission throughput.

• Journal of KIISE:Information Networking
• /
• 제33권4호
• /
• pp.299-309
• /
• 2006

In Mobile ad hoc networks, AODV is one of the famous on-demand routing protocol, which use the routing tables in the nodes if possible, or Route Discovery Process (RDP) is triggered to find a new route. However increasing the traffic of RDP causes dropping of the network performance in the large size of ad hoc networks. In this paper, we propose a novel routing protocol, named as AOZDV (Ad hoc On-demand Zone and Distance-Vector Routing), which enhances the AODV protocol with zone routing. AOZDV creates a Zone with neighbor nodes of the source/destination using traffic and power information, and utilizes Destination-Vector Table for internal routing in the Zone. We show by simulations that AOZDV can reduce the occurrence rate of route fail and RDP caused by route fail compared to existing routing protocols such as DSR and AODV.

• Convergence Security Journal
• /
• 제14권7호
• /
• pp.17-22
• /
• 2014

Wireless Ad hoc Network is threatened from many types of attacks because of its open structure, dynamic topology and the absence of infrastructure. Attacks by malicious nodes inside the network destroy communication path and discard packet. The damage is quite large and detecting attacks are difficult. In this paper, we proposed attack detection technique using secure authentication infrastructure for efficient detection and prevention of internal attack nodes. Cluster structure is used in the proposed method so that each nodes act as a certificate authority and the public key is issued in cluster head through trust evaluation of nodes. Symmetric Key is shared for integrity of data between the nodes and the structure which adds authentication message to the RREQ packet is used. ns-2 simulator is used to evaluate performance of proposed method and excellent performance can be performed through the experiment.

• KIPS Transactions on Computer and Communication Systems
• /
• 제6권11호
• /
• pp.463-468
• /
• 2017

To sense a wide area with mobile nodes, the uniformity of node deployment is a very important issue. In this paper, we consider the coverage problem to sense big data in sparse mobile ad hoc networks. In most existing works on the coverage problem, it has been assumed that the number of nodes is large enough to cover the area in the network. However, the coverage problem in sparse mobile ad hoc networks differs in the sense that a long-distance between nodes should be formed to avoid the overlapping coverage areas. We formulate the sensor coverage problem in sparse mobile ad hoc networks and provide the solution to the problem by a self-organized approach without a central authority. The experimental results show that our approach is more efficient than the existing ones, subject to both of coverage areas and energy consumption.

• Journal of Korea Society of Digital Industry and Information Management
• /
• 제7권4호
• /
• pp.31-37
• /
• 2011

Recently, MANET(Mobile Ad-hoc Network) is developing increasingly in the wireless network. MANET has weakness because phases change frequently and MANET doesn't have middle management system. Every node which consists of MANET has to perform data forwarding, but traceback is not reliable if these nodes do malicious action owing to attack. It also is not easy to find location of attacker when it is attacked as moving of nodes. In this paper, we propose a hierarchical-based traceback method that reduce waste of memory and can manage path information efficiently. In order to manage trace path information and reduce using resource in the cluster head after network is formed to cluster, method which recomposes the path efficiently is proposed. Proposed method in this paper can reduce path trace failure rate remarkably due to moving of nodes. It can also reduce the cost for traceback and time it takes to collect information.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• 제8권6호
• /
• pp.29-34
• /
• 2008

In this paper, we propose an entropy-based dynamic routing protocol for supporting effective route stability in mobile ad-hoc wireless sensor networks(MAWSN). The basic ideas and features are as follows. First, construction of entropy-based stable routing route using mobility of nodes between a source node and a destination node. Second, usage of location and direction information for route construction to support resource saving. Third, We consider a realistic approach, in the points of view of the MAWSN, based on mobile sensor nodes as well as fixed sensor nodes in sensor fields while the conventional research for sensor networks focus on mainly fixed sensor nodes. The performance evaluation of the proposed routing protocol is performed via simulation using OPNET. The simulation results show the proposed routing protocol can effectively support route stability and packet delivery ratio.

• Journal of Communications and Networks
• /
• 제10권1호
• /
• pp.98-107
• /
• 2008

In mobile ad hoc networks, packet loss is unavoidable due to MAC contention, link failure or the inherent characteristics of wireless link. Since TCP relies on the timely reception of TCP ACK packets to progress the transmission of the TCP DATA packets, ACK loss obviously affects the performance due to two main problems: (a) Frequent occurrence of spurious retransmissions caused by timeout events and (b) impairment of the fast retransmit mechanism caused by the lack of a sufficient number of duplicate ACK packets. In particular, since most reactive routing protocols force the packets buffered over a path to be discarded while performing a route recovery, the performance degradation becomes more serious due to such ACK loss. In this paper, therefore, TCP with two piggybacking schemes (called TCP-pgy) is proposed in order to resolve the above-mentioned problems over reactive routing protocols. Through extensive simulations using the ns-2 simulator, we prove that our proposed schemes contribute to TCP performance improvements.

• Proceedings of the IEEK Conference
• /
• 대한전자공학회 2006년도 하계종합학술대회
• /
• pp.167-168
• /
• 2006

Mobile Ad Hoc Networks (MANETs) has the characteristics such as dynamic network topology, constrained power capacity, constrained wireless bandwidth and quality, etc. For MANETs AODV (Ad-Hoc On-Demand Distance Vector) routing protocol has been proposed. However AODV routing protocol has some inefficiency related to re-routing path establishment corresponding to node's failure. In this paper, we propose a Self-Healing Routing Technique for MANETs that uses the one-hop nodes from the failed node to set up the routing path efficiently. We also include simulation results to show the performance of our method.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• 제22권8호
• /
• pp.797-804
• /
• 2011

Network coding has recently emerged as an effective solution for multicast and broadcast communications in wireless ad hoc networks. In this paper, we propose a throughput performance model for IEEE 802.11 wireless networks with network coding. Specifically, we consider IEEE 802.11 DCF protocol and linear topology in which traffic sources are located at both ends and intermediate nodes act as relays performing network coding. The proposed analytic model has the form of nonlinear equations in terms of throughput of each node. The solution of the nonliear equations thus correspond to the end-to-end throughput. Extensive simulation experiments have been performed to validate accuracy of the proposed model. Numerical results show that the results of the proposed analytic model agree fairly well with the corresponding simulation results.

• International journal of advanced smart convergence
• /
• 제2권1호
• /
• pp.6-11
• /
• 2013

Network Coding (NC) is a new paradigm for network communication. In network coding, intermediate nodes create new packets by algebraically combining ingress packets and send it to its neighbor node by broadcast manner. NC has rapidly emerged as a major research area in information theory due to its wide applicability to communication through real networks. Network coding is expected to improve throughput and channel efficiency in the wireless multi-hop network. Many researches have been carried out to employ network coding to wireless ad-hoc network. In this paper, we proposed a dynamic queue management to improve coding opportunistic to enhance efficiency of NC. In our design, intermediate nodes are buffering incoming packets to encode queue. We expect that the proposed algorithm shall improve encoding rate of network coded packet and also reduce end to end latency. From the simulation, the proposed algorithm achieved better performance in terms of coding gain and packet delivery rate than static queue management scheme.