• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2011.05a
• /
• pp.197-200
• /
• 2011

Many routing protocols have been proposed for low-power and ad-hoc networks where energy awareness and reliability are essential design issues. This paper proposes a dynamic routing protocol for low-power and ad-hoc networks. A dynamic path cost function is defined considering the constraints and characteristics of low-power and ad-hoc networks. The cost function can be applied flexibly depending on the characteristics of the networks. The performance of the proposed method is evaluated using a QualNet network simulator.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.18 no.8
• /
• pp.1955-1960
• /
• 2014

Many routing protocols have been proposed for low-power and ad-hoc networks to deliver command or data among nodes and recently, various researches are carried out about networking scheme considering reliability and scalability. In low-power networking technology, the performance of network layer is closely connected with the operation of data link layer and mesh routing mechanisms based on TDMA MAC are considered for reliability and scalability. This paper proposes mesh routing algorithm utilizing the characteristics of TDMA MAC and topological addressing in TDMA based low-power and ad-hoc networks and implementation results are presented.

• Journal of the Korea Society of Computer and Information
• /
• v.22 no.12
• /
• pp.95-100
• /
• 2017

In this paper, we propose a zone based ad hoc network construction scheme which support ad hoc path between nodes in local IoT networks consisting of IoT devices with the constrained feature, such as low power, the limited transmission rate and low computing capacity. Recently, the various routing protocols have been studied to support ad hoc networking of local IoT environments. This is, because basis RPL protocol is deigned to be used for the connecting service with Internet through gateway, ad hoc path between nodes in local IoT networks is not supported in basis RPL protocol. Thus, in this paper, the proposed routing scheme provides both ad hoc path and Infra path through gateway, supporting basis RPL protocol simultaneously. Through simulation, we show that the proposed routing scheme with zone based path selection scheme improves the performance of the success rate of end-to-end data transmission and the end-to-end delay, compared to basis RPL protocol.

• Journal of Communications and Networks
• /
• v.4 no.3
• /
• pp.161-169
• /
• 2002

Ad hoc wireless networks involving large populations of scattered communication nodes will play a key role in the development of low power, high capacity, interactive, multimedia communication networks. Such networks must support arbitrary network connections and provide coverage anywhere and anytime. This paper partitions such arbitrarily connected network architectures into three distinct groups, identifies the associated dual network architectures and counts the number of network architectures assuming there exist N network nodes. Connectivity between network nodes is characterized as a random event. Defining the link availability P as the probability that two arbitrary network nodes in an ad hoc network are directly connected, the network connection probability $ \integral_n$(p) that any two network nodes will be directly or indirectly connected is derived. The network connection probability $ \integral_n$(p) is evaluated and graphically demonstrated as a function of p and N. It is shown that ad hoc wireless networks containing a large number of network nodes possesses the same network connectivity performance as does a fixed network, i.e., for p>0, $lim_{N\to\infty} Integral_n(p)$ = 1. Furthermore, by cooperating with fixed networks, the ad hoc network connection probability is used to derive the global network connection probability for hybrid networks. These probabilities serve to characterize network connectivity performance for users of wireless ad hoc and hybrid networks, e.g., IEEE 802.11, IEEE 802.15, IEEE 1394-95, ETSI BRAN HIPERLAN, Bluetooth, wireless ATM and the world wide web (WWW).

• Proceedings of the Korean Information Science Society Conference
• /
• 2006.06d
• /
• pp.124-126
• /
• 2006

Mobile Ad hoc networking is an emerging technology and in these days many applications are being developed to run on these networks. In these networks lookup services are very important because all nodes do not have same resources in term of memory and computing power. Nodes need to use different services offered by different servers. Reliable and efficient scheme should be available for lookup services due to limited bandwidth and low computing power of devices in mobile ad hoc networks. Due to mobility and rapid change in network topology, lookup mechanism used in wired network is not appropriate. Service discovery mechanism can be divided into two main categories Centralized and Distributed. Centralized mechanism is not reliable as there is no central node in these networks. Secondly centralized mechanism leads toward single point failure. We can handle the service discovery mechanism by distributing server's information to each node. But this approach is also not appropriate due to limited bandwidth and rapid change in network. In this paper, we present reliable lookup service scheme which is based on distributed mechanism. We are not using replication approach as well due to low bandwidth of wireless networks. In this scheme service discovery mechanism will be handled through different lookup servers. Reliability is the key feature of our proposed scheme.

• Journal of the Korea Society of Computer and Information
• /
• v.15 no.5
• /
• pp.103-111
• /
• 2010

This paper proposes an efficient data transmission strategy using adaptive-tier low transmission power schedule in a TDMA-based ad hoc MAC protocol. Since the network resource of ad hoc networks has the characteristic of reassignment due to the multiple interferences and the contention-based limited wireless channel, the efficient time slot assignment and low power transmission scheme are the main research topics in developing ad hoc algorithms. Based on the proposed scheme of interference avoidance when neighbor clusters transmit packets, this paper can minimize the total energy dissipation and maximize the utilization of time slot in each ad hoc node. Simulation demonstrates that the proposed algorithm yields 15.8 % lower energy dissipation and 4.66% higher time slot utilization compared to the ones of two-tier conventional energy dissipation model.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2002.05a
• /
• pp.117-120
• /
• 2002

Bluetooth uses baseband of 2.4G ISM and composes radio Ad Hoc network based on Ad Hoc wireless connectivity which it used low power and low complexity solution. Bluetooth designed as can play detect, connect, discover service by surrounding other device even if users do not get acquainted all to Bluetooth. This paper operate wish to recognize mobility to routing algorithm how communication method and radio network in Bluetooth.

• The Journal of the Korea Contents Association
• /
• v.9 no.8
• /
• pp.49-56
• /
• 2009

In this paper, we propose a method of energy level, node degree and selection information based CDS(Connected Dominating Set) construction algorithm for more efficient routing in ad-hoc wireless networks. Constructing CDS in ad-hoc wireless network, it is necessary to make more efficient algorithm that is faster, more simple and has low power consumption. A CDS must be minimized because nodes in the CDS consume more energy in order to handle various bypass traffics than nodes outside the set. It is better not to reconstruct CDS after constructing the most efficient CDS. To overcome this problem, we proposed the CDS construction algorithms based on EL+ND+Sel method. We compared and estimated the performance in each situation of EL + ND and EL + ND + Sel.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.14 no.4
• /
• pp.1041-1047
• /
• 2010

One of the weaknesses of ad hoc network is that a route used between a source and a destination is to break during communication. To solve this problem, one approach consists of selecting routes whose nodes have the most stable link cost. In this paper proposes a new method for improving the low power distributed MAC. The method is rule-based on the context awareness of the each nodes energy in clustering. The proposed networks scheme could get better improve the awareness for data to achieve and performance on their clustering establishment and messages transmission.

• Journal of information and communication convergence engineering
• /
• v.5 no.2
• /
• pp.104-108
• /
• 2007

Ad hoc networks are a type of mobile network that function without any fixed infrastructure. One of the weaknesses of ad hoc network is that a route used between a source and a destination is to break during communication. To solve this problem, one approach consists of selecting routes whose nodes have the most stable link cost. This paper proposes a method for improving the low power distributed MAC. This method is based on the context awareness of the each nodes energy in clustering. We propose to select a new scheme to optimize energy conserving between the clustering nodes in MANET. And this architecture scheme would use context-aware considering the energy related information such as energy, RF strength, relative distances between each node in mobile ad hoc networks. The proposed networks scheme could get better improve the awareness for data to achieve and performance on their clustering establishment and messages transmission. Also, by using the context aware computing, according to the condition and the rules defined, the sensor nodes could adjust their behaviors correspondingly to improve the network routing.