• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.10 no.5
• /
• pp.193-199
• /
• 2010

In this paper, we propose a new metric to measure the dynamic connection states of Ad Hoc network. The new metric measures the total path break up time $\sum_{i}T_i$, where $T_i$ is the time period during which maximum cluster distance exceeds the radio range. $T_i$ can be calculated from the maximum cluster distance function of time, which can be computed from the node position samples of mobility model. The proposed metric can be used as a total system metric as well as an individual connection metric.

• Journal of information and communication convergence engineering
• /
• v.7 no.4
• /
• pp.475-479
• /
• 2009

In ad hoc network, the scarce energy management of the mobile devices has become a critical issue in order to extend the network lifetime. Current research activity for the Minimum Energy Multicast (MEM) problem has been focused on devising efficient centralized greedy algorithms for static ad hoc networks. In this paper, we consider mobile ad hoc networks(MANETs) that could provide the reliable monitoring and control of a variety of environments for remote place. Mobility of MANET would require the topology change frequently compared with a static network. To improve the routing protocol in MANET, energy efficient routing protocol would be required as well as considering the mobility would be needed. In this paper, we propose a new method, the CACH(Context-aware Clustering Hierarchy) algorithm, a hybrid and clustering-based protocol that could analyze the link cost from a source node to a destination node. The proposed analysis could help in defining the optimum depth of hierarchy architecture CACH utilize. The proposed CACH could use localized condition to enable adaptation and robustness for dynamic network topology protocol and this provide that our hierarchy to be resilient. As a result, our simulation results would show that CACH could find energy efficient depth of hierarchy of a cluster.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.4A
• /
• pp.309-315
• /
• 2009

Wireless Ad-hoc networks are dynamic networks that consist of mobile nodes. Nodes in Ad-hoc networks are usually laptops, PDAs or mobile phones. These devices feature Bluetooth and/or IEEE 802.11 (WiFi) network interfaces and communicate in a decentralized manner. Due to characteristics of Ad-hoc networks, Mobility is a key feature of routing protocol design. In this paper, we present an enhanced routing maintenance scheme that cope with topology changes pre-actively. The key feature of the proposed scheme is to switch next-hop node to alternative neighbor node before link breakage for preventing route failure. From extensive experiments by using NS2, the performance of the proposed scheme has been improved by comparison to AODV protocol.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.5
• /
• pp.1354-1372
• /
• 2012

Route establishment in Mobile Ad Hoc Network (MANET) is the key mechanism to a successful connection between a pair of source and destination nodes. An efficient routing protocol constructs routing path with minimal time, less routing overhead and capable of utilizing all possible link connectivity. In general, most on-demand MANET routing protocols operates over symmetrical and bidirectional routing path, which is infeasible due to the inherent heterogeneous properties of wireless devices. Simulation results show that the presence of unidirectional links on a network severely affect the performance of a routing protocol. In this paper, a robust protocol independent scheme is proposed, which enable immediate rediscovery of alternative route for a path blocked by a unidirectional link. The proposed scheme is efficient; route rediscovery is locally computed, which results in significant minimization of multiple route packets flooding. Nodes may exploit route information of immediate neighbors using the local reply broadcast technique, which then redirect the control packets around the unidirectional links, therefore maintaining the end-to-end bidirectional connection. The proposed scheme along with Ad Hoc On-demand Distance Vector (AODV) and AODV-Blacklist routing protocol is investigated over three types of mobility models. Simulation results show that the proposed scheme is extremely reliable under poor network conditions and the route connectivity can be improved by as much as 75%.

• Applied Science and Convergence Technology
• /
• v.23 no.4
• /
• pp.192-199
• /
• 2014

The electronic property of graphene was investigated by hydrazine treatment. Hydrazine ($N_2H_4$) highly increases electron concentrations and up-shifts Fermi level of graphene based on significant shift of Dirac point to the negative gate voltage. We have observed contact resistance and channel length dependent mobility of graphene in the back-gated device after hydrazine monohydrate treatment and continuously monitored electrical characteristics under Nitrogen or air exposure. The contact resistance increases with hydrazine-treated and subsequent Nitrogen-exposed devices and reduces down in successive Air-exposed device to the similar level of pristine one. The channel conductance curve as a function of gate voltage in hole conduction regime keeps analogous value and shape even after Nitrogen/Air exposure specially whereas, in electron conduction regime change rate of conductance along with the level of conductance with gate voltage are decreased. Hydrazine could be utilized as the highly effective donor without degradation of mobility but the stability issue to be solved for future application.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.2
• /
• pp.542-558
• /
• 2016

Vehicular Ad Hoc Networks (VANETs) are self-configuring networks where the nodes are vehicles equipped with wireless communication technologies. In such networks, limitation of signal coverage and fast topology changes impose difficulties to the proper functioning of the routing protocols. Traditional Mobile Ad Hoc Networks (MANET) routing protocols lose their performance, when communicating between vehicles, compromising information exchange. Obviously, most applications critically rely on routing protocols. Thus, in this work, we propose a methodology for investigating the performance of well-established protocols for MANETs in the VANET arena and, at the same time, we introduce a routing protocol, called Genetic Network Protocol (G-NET). It is based in part on Dynamic Source Routing Protocol (DSR) and on the use of Genetic Algorithms (GAs) for maintenance and route optimization. As G-NET update routes periodically, this work investigates its performance compared to DSR and Ad Hoc on demand Distance Vector (AODV). For more realistic simulation of vehicle movement in urban environments, an analysis was performed by using the VanetMobiSim mobility generator and the Network Simulator (NS-3). Experiments were conducted with different number of vehicles and the results show that, despite the increased routing overhead with respect to DSR, G-NET is better than AODV and provides comparable data delivery rate to the other protocols in the analyzed scenarios.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.9
• /
• pp.2101-2119
• /
• 2013

The spectrum allocation is an attractive issue for mobile cognitive radio (CR) network. However, the time-varying characteristic of the spectrum allocation is not fully investigated. Thus, this paper originally deduces the probabilities of spectrum availability and interference constrain in theory under the mobile environment. Then, we propose a prediction mechanism of the time-varying available spectrum lists and the dynamic interference topologies. By considering the node mobility and primary users' (PUs') activity, the mechanism is capable of overcoming the static shortcomings of traditional model. Based on the mechanism, two prediction-based spectrum allocation algorithms, prediction greedy algorithm (PGA) and prediction fairness algorithm (PFA), are presented to enhance the spectrum utilization and improve the fairness. Moreover, new utility functions are redefined to measure the effectiveness of different schemes in the mobile CR network. Simulation results show that PGA gets more average effective spectrums than the traditional schemes, when the mean idle time of PUs is high. And PFA could achieve good system fairness performance, especially when the speeds of cognitive nodes are high.

• Korean Journal of Computational Design and Engineering
• /
• v.19 no.4
• /
• pp.332-339
• /
• 2014

This paper presents on the development of wheel-terrain interaction device using low-priced sensors, which will be used to predict the drawbar pull and optimal slip of off-road vehicle in real time. The essential variables obtained in the device to predict the mobility of vehicles are determined based on semi-empirical model describing the wheel-terrain interaction. Using the developed device, the experiments about the wheel-terrain interaction were performed on the soil of the Jumunjin standard sand, which yielded dynamic weight, motor driving torque, drawbar pull, and sinkage with respect to wheel slip ratio. Finally, the repeatability of the measured data are verified through repeating the experiments three times on the same condition.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.9 no.4
• /
• pp.87-97
• /
• 2009

A Mobile Ad hoc Network (MANET) is characterized by multi-hop wireless connectivity, frequently changing network topology with mobile nodes and the efficiency of the dynamic routing protocol plays an important role in the performance of the network. In this paper, the performance of five routing protocols for MANET is compared by using OPNET modeler: AODV, DSR, GRP, OLSR and TORA. The various performance metrics are examined, such as packet delivery ratio, end-to-end delay and routing overhead with varying data traffic, number of nodes and mobility. In our simulation results, OLSR shows the best performance in terms of data delivery ratio in static networks, while AODV has the best performance in mobile networks with moderate data traffic. When comparing proactive protocols (OLSR, GRP) and reactive protocols (AODV, DSR) with varying data traffic in the static networks, proactive protocols consistently presents almost constant overhead while the reactive protocols show a sharp increase to some extent. When comparing each of proactive protocols in static and mobile networks, OLSR is better than GRP in the delivery ratio while overhead is more. As for reactive protocols, DSR outperforms AODV under the moderate data traffic in static networks because it exploits caching aggressively and maintains multiple routes per destination. However, this advantage turns into disadvantage in high mobility networks since the chance of the cached routes becoming stale increases.

• Journal of Communications and Networks
• /
• v.10 no.4
• /
• pp.422-429
• /
• 2008

Mobile peer-to-peer (P2P) systems have recently got in the limelight of the research community that is striving to build efficient and effective mobile content addressable networks. Along this line of research, we propose a new peer-to-peer file sharing protocol suited to mobile ad hoc networks (MANET). The main ingredients of our protocol are network coding and mobility assisted data propagation, i.e., single-hop communication. We argue that network coding in combination with single-hop communication allows P2P file sharing systems in MANET to operate in a more efficient manner and helps the systems to deal with typical MANET issues such as dynamic topology and intermittent connectivity as well as various other issues that have been disregarded in previous MANET P2P researches such as addressing, node/user density, non-cooperativeness, and unreliable channel. Via simulation, we show that our P2P protocol based on network coding and single-hop communication allows shorter file downloading delays compared to an existing MANET P2P protocol.