• Journal of Digital Contents Society
• /
• v.15 no.1
• /
• pp.1-9
• /
• 2014

Delay-Tolerant Network (DTN) is an asynchronous networking technology that has been deployed for the networking environment in which steady communication paths are not available, and therefore it stores receiving data in a data storage and forward them only when the communication links are established. DTN can be applied to sensor networks and mobile ad-hoc network (MANET) as well as space communication that supports data transmissions among satellites. In DTN networking environments, it is very important to secure a scheme that has relatively low routing overhead and high reliability, so that it can enhance the overall routing speed and performance. In order for achieving efficient data transmissions among the nodes that have comparatively periodic moving patterns, this paper proposes a time information based DTN routing scheme which is able to predict routing paths. From the simulation results using Omnet++ simulation tools, it has been verified that the proposed time information based DTN routing algorithm shows satisfied levels of routing speed and routing reliability even with lower routing overheads.

• ETRI Journal
• /
• v.37 no.6
• /
• pp.1108-1119
• /
• 2015

Multicast communication of mobile ad hoc networks is vulnerable to internal attacks due to its routing structure and high scalability of its participants. Though existing intrusion detection systems (IDSs) act smartly to defend against attack strategies, adversaries also accordingly update their attacking plans intelligently so as to intervene in successful defending schemes. In our work, we present a novel indirect internal stealthy attack on a tree-based multicast routing protocol. Such an indirect stealthy attack intelligently makes neighbor nodes drop their routing-layer unicast control packets instead of processing or forwarding them. The adversary targets the collision avoidance mechanism of the Medium Access Control (MAC) protocol to indirectly affect the routing layer process. Simulation results show the success of this attacking strategy over the existing "stealthy attack in wireless ad hoc networks: detection and countermeasure (SADEC)" detection system. We design a cross-layer automata-based stealthy attack on multicast routing protocols (SAMRP) attacker detection system to identify and isolate the proposed attacker. NS-2 simulation and analytical results show the efficient performance, against an indirect internal stealthy attack, of SAMRP over the existing SADEC and BLM attacker detection systems.

• Journal of information and communication convergence engineering
• /
• v.7 no.3
• /
• pp.309-313
• /
• 2009

In this paper, end-to-end VoIP(Voice over Internet Protocol) performance is evaluated by simulation with NS-2 simulation tool. There are many results studied and published for VoIP performance over TCP/IP networks. But, almost all of them were focused on wired or wireless Internet environments. About MANET (Mobile Ad Hoc Network), VoIP is currently studying several points of research. In this paper, analysis of VoIP performance is done with focusing on the mobility of MANETs. MOS(Mean Opinion Score), network delay, packet loss rates are considered as end-to-end QoS performance parameters.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.5
• /
• pp.2218-2244
• /
• 2016

In this paper, we propose a hybrid routing scheme that utilizes location information to support reliable data transmission in mobile ad hoc networks. The proposed scheme determines and maintains routing path by considering the directionality and connectivity of nodes using grid zones and information on neighbor nodes. In addition, it generates alternative paths with consideration for node distance and reliability. To show the superiority of the proposed routing scheme, a performance evaluation was conducted using simulations. The performance evaluation results show that the proposed scheme offers faster and more reliable data transmission than the existing routing schemes, and the number of messages decreases by approximately 31% compared to the existing schemes on average.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.9
• /
• pp.1829-1836
• /
• 2009

A wireless Ad-hoc network is willing to send and receive data and for other nodes, and it is a temporal network where the nodes with mobility are automatically constituted. This network has been studied to construct networks in the state where there is no infrastructure. The limited nodes and its frequent moving in a wireless Ad-hoc network have resulted in frequent network disconnection. Therefore, the data transmission rate should be secured in a wireless Ad-hoc network. This study proposes the method to improve QoS of data transmission considering the mobility of nodes that respond to path searching by means of AOMDV routing protocol. By applying the suggested method, it is possible to raise the transmission rate by improving the reliability of transmission path.

• Journal of Communications and Networks
• /
• v.17 no.2
• /
• pp.110-117
• /
• 2015

In mobile social network, it is a critical challenge to select an optimal set of devices to supply high quality service constantly under dynamic network topology and the limit of device capacity in mobile ad-hoc network (MANET). In this paper, a multi-devices composition and maintenance problem is proposed with ubiquitous service model and network model. In addition, a multi-devices composition and maintenance approach with dynamic planning is proposed to deal with this problem, consisting of service discovery, service composition, service monitor and service recover. At last, the simulation is implemented with OPNET and MATLAB and the result shows this mechanism is better applied to support complex ubiquitous service.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39C no.4
• /
• pp.334-342
• /
• 2014

Military communications for future warfare have limited resources but highly requirements. MANET has a lot of advantages for future military network due to easily deploying without infrastructure and supporting dynamic topology in restricted environments. But, one of the biggest issues for MANET is difficulty of transmitting data due to link failure in dynamic topology. Content Centric Networking is a future Internet paradigm which solves various IP network problem. In this paper, we propose a future military communication routing scheme using CCN in military tactical MANET. Simulation results show our scheme gets lower control message overhead and faster data downloads as number of node increases and mobile speed increases than other two schemes.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2013.05a
• /
• pp.610-613
• /
• 2013

Vehicular Ad Hoc NETwork (VANET), a subclass of Mobile Ah Hoc NETwork (MANET) has been a tech-buzz for the last couple of decades. VANET, yet not deployed, promises the ease, comfort, and safety to both drivers and passengers once deployed. The by far most important factor in successful VANET application is the data dissemination scheme. Such data includes scheduled beacons that contain whereabouts information of vehicles. In this paper, we aim at regularly broadcasted beacons and devise an algorithm to disseminate the beacon information up to a maximum distance and alleviate the broadcast storm problem at the same time. According to the proposed scheme, a vehicle before re-broadcasting a beacon, takes into account the current vehicular density in its neighborhood. The re-broadcasters are chosen away from the source of the beacon and among the candidate re-broadcasters, if the density in the neighborhood is high, then the candidate rebroadcaster re-broadcasts the beacon with high probability and with low probability, otherwise. We also performed thorough simulations of our algorithms and the results are sound according to the expectations.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39B no.9
• /
• pp.620-628
• /
• 2014

Various on-demand manner routing protocols have been proposed for efficient energy consumption in mobile ad-hoc networks. Some of the protocols tried to extend the network lifetime by periodically rerouting paths according to the energy consumption rate of nodes. However, those protocols suffer from frequent flooding and high overhead. This paper proposed a new routing protocol called ALPMR (Adaptive Local Path Modification Routing) that extends the network lifetime by using local path rerouting. The proposed ALPMR protocol performs local rerouting around nodes with little remaining energy as well as data congestion, thus reduces flooding and routing overhead and can extend the network lifetime. The performance of ALPMR protocol is observed using ns-2 simulator.

• Journal of the Korea Society for Simulation
• /
• v.19 no.2
• /
• pp.119-125
• /
• 2010

In ad-hoc networks, dynamically reconfigurable and temporary wireless networks, all mobile devices cooperatively maintain network connectivity with no assistance of base stations while they have limited amounts of energy that is used in different rates depending on the power level. Since every node has to perform the functions of a router, if some nodes die early due to lack of energy, it will not be possible for other nodes to communicate with each other and network lifetime will be shortened. Consequently, it is very important to develop a technique to efficiently consume the limited amounts of energy resources so that the network lifetime is maximized. In this paper, geographical localized routing is proposed to help making smarter routing decision using only local information and reduce the routing overhead. The proposed localized routing algorithm selects energy-aware neighbors considering the transmission energy and error rate over the wireless link, and the residual energy of the node, which enables nodes to achieve balanced energy-consumption and the network lifetime to prolong.