• Journal of the Korean Institute of Intelligent Systems
• /
• v.15 no.6
• /
• pp.695-700
• /
• 2005

In the sensor network, a lot of sensor nodes are scattered sparsely and organizes a united communication network between each node. After that, environmental information around each sensor node are gathered and analyzed. Because each node operates under resource constraint, the efficiency and hardware specification of a node should be maximized. There exist technical constraints until now but recent technical progress in IC fabrication and wireless network enables to construct a tiny embedded system, which has the properties of low cost, low power consumption, multi functions. Wireless sensor network becomes a modern research field with technical improvements, is studied in numerous laboratories, and is called as diverse different project names - Wireless Integrated Network Sensors (WINS), Mobile Ad hoc NETwork (MANET), Ubiquitous Sensor Network (USN). TinyOS is one of leading project and is widely used. In this paper, we suggest a sensor network, which uses TinyOS platforms and aims for context awareness in a home environment.

• Journal of Ubiquitous Convergence Technology
• /
• v.2 no.2
• /
• pp.97-104
• /
• 2008

In this paper, we demonstrate the boundary effect of a deployed regions on the effective coverage of a mobile node. A node coverage area is not uniform throughout the entire deployed region. Assuming a uniform coverage can result in significant error in calculations. In this study, we analyze the behavior of a node's coverage area as a function of its transmission range throughout the entire deployed region. Using this analysis, a mathematical model for effective coverage in mobile wireless communications is created. The mathematical model considers the effect of the deployed regions boundaries on the coverage area of a mobile node. Lastly, we present simulation results to verify the analytical model and to compare this model with that of a uniform coverage.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.48 no.2
• /
• pp.72-78
• /
• 2011

Localization information of an object can be a very useful element for many application areas. Presently, GPS is typically used for it, but many researches on the wireless localization technology are going on recently actively using mobile communication network, wireless sensor network, and ad hoc network in order to overcome the limitations of the GPS such as indoor, cost, power consumption, and etc. Therefore, this article surveys the most representative wireless localization techniques, which can be deployed in the wireless networks, and their principles and performances are analyzed based on the researched papers. In a conclusion, selection of a localization technique should consider the key design elements to a given application from the design elements such as localization environment, accuracy, time to fix, computation amount, implementation ease, and etc.

• The KIPS Transactions:PartC
• /
• v.10C no.2
• /
• pp.163-170
• /
• 2003

In this paper we propose a robust clustered croup Multicast in Ad-hoc network. The proposed scheme applies to weighted clustered Algorithm. Ad-hoc network is a collection of wireless mobile hosts forming a temporary network without the aid of any centralized administration or reliable support services such as wired network and base station. In ad hoc network routing protocol because of limited bandwidth and high mobility robust, simple and energy consume minimal. WCGM method uses a base structure founded on combination weighted value and applies combination weight value to cluster header keeping data transmission by scoped flooding, which is the advantage of the exiting FGMP method. Because this method has safe and reliable data transmission, it shows the effect to decrease both overhead to preserve transmission structure and overhead for data transmission.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.5B
• /
• pp.274-286
• /
• 2005

In this paper, we propose a new power-efficient and reliable connected dominating set based routing protocol in the mobile ad hoc networks. Gateway nodes must be elected in consideration of residual energy and mobility because frequent reconstruction of connected dominating set result in transmission error for route losses. If node density is high, it results in a lot of contentions and more delays for network congestion. Therefore, in this paper, we propose a new construction method of connected dominating set that supports reliable and efficient data transmission through minimizing reconstruction of connected dominating set by delaying neighbor set advertisement message broadcast in proportion to weighted sum of residual energy, mobility, and the number of neighbor nodes. The performance of the proposed protocol is proved by simulation of various conditions.

• Journal of Communications and Networks
• /
• v.6 no.3
• /
• pp.216-225
• /
• 2004

In a cellular network, if there are too many data users in a cell, data may suffer long delay, and system's quality-of-service (QoS) will degrade. Some traditional schemes such as dynamic channel-allocation scheme (DCA) will assign more channels to hot (or overloaded) cells through a central control system (CC) and the throughput increase will be upper bounded by the number of new channels assigned to the cell. In mobile-assisted data forwarding (MADF), we add an ad-hoc overlay to the fixed cellular infrastructure and special channels-called forwarding channels- are used to connect mobile units in a hot cell and its surrounding cold cells without going through the hot cell's base station. Thus, mobile units in a hot cell can forward data to other cold cells to achieve load balancing. Most of the forwarding-channel management work in MADF is done by mobile units themselves in order to relieve the load from the CC. The traffic increase in a certain cell will not be upper bounded by the number of forwarding channels. It can be more if the users in hot cell are significantly far away from one another and these users can use the same forwarding channels to forward data to different cold neighboring cells without interference. We find that, in a system using MADF, under a certain delay requirement, the throughput in a certain cell or for the whole net-work can be greatly improved.

• 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.

• Proceedings of the KIEE Conference
• /
• 2003.11c
• /
• pp.476-479
• /
• 2003

Recently, Bluetooth has been regarded as a new technology for short-range wireless connection. Although initial application of Bluetooth technology has been focused mainly on replacing cables between hand-held devices due to a limited packet size and short-range, general wireless telecommunication such as PAN and Ad hoc networks via Bluetooth-equipped devices is expected to be one of the most popular applications. Wireless equipments have been used to exchange data between host and mobile unit. The exchanging data may be several bytes of control command and the value of sensors with ultra-sonic, vision sensor, and encoder from mobile robot. However, most wireless equipments have some drawbacks such as lack of authentication, large size and high price. On the other hand, the benefits of Bluetooth are small size, low power, low price except short-range. Especially, there are some difficulties when wireless modules are used in indoor environments. In this paper, a method of using wire network in Bluetooth network is investigated as a solution to overcome the short-range problem of Bluetooth and difficulty in indoor environment.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38C no.11
• /
• pp.1060-1073
• /
• 2013

In this paper, we present a cluster-based routing scheme for efficiently delivering data to group mobile users by extracting and clustering mobile user group simply from beacon message information in wireless ad-hoc networks. First, we propose an online-clustering mechanism that uses a local neighbor table on each node by recursively transmitting to neighbor nodes, and forms a group table where a set of listed nodes are classified as group members, without incurring much overhead. A node that appears the most frequently from neighbor tables throughout the network is selected as the cluster-head node, serving as a data gateway for the intra-cluster. Second, we design an inter-cluster routing that delivers data from stationary data sources to the selected cluster-head node, and a intra-cluster routing to deliver from the cluster-head node to users. Simulation results based on ns-2 in the ad-hoc networks consisting of 518 stationary nodes and 20 mobile nodes show that our proposed clustering mechanism achieves high clustering accuracy of 96 % on average. Regarding routing performance, our cluster-based routing scheme outperforms a naive one-to-one routing scheme without any clustering by reducing routing cost up to 1/20. Also, our intra-cluster routing utilizing a selected cluster-head node reduces routing cost in half as opposed to a counterpart of the intra-cluster routing through a randomly-selected internal group member.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.9
• /
• pp.3496-3514
• /
• 2015

One of the challenging tasks in Mobile Ad hoc Network is to discover precise optimal routing solution due to the infrastructure-less dynamic behavior of wireless mobile nodes. Ant Colony Optimization, a swarm Intelligence technique, inspired by the foraging behaviour of ants in colonies was used in the past research works to compute the optimal path. In this paper, we propose a Recurrent Ant Colony Optimization (RECACO) that executes the actual Ant Colony Optimization iteratively based on recurrent value in order to obtain an optimal path convergence. Each iteration involves three steps: Pheromone tracking, Pheromone renewal and Node selection based on the residual energy in the mobile nodes. The novelty of our approach is the inclusion of new pheromone updating strategy in both online step-by-step pheromone renewal mode and online delayed pheromone renewal mode with the use of newly proposed metric named ELD (Energy Load Delay) based on energy, Load balancing and end-to-end delay metrics to measure the performance. RECACO is implemented using network simulator NS2.34. The implementation results show that the proposed algorithm outperforms the existing algorithms like AODV, ACO, LBE-ARAMA in terms of Energy, Delay, Packet Delivery Ratio and Network life time.