• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.4B
• /
• pp.303-310
• /
• 2006

In sensor network environments, a sensor node has a limited power because of their resource constraints. Therefore it is important to efficiently use its power in sensor networks. Power consumption of sensor node is closely related to its amount of transmission data. So, we need to reduce the transmission data in order to minimize the power consumption. And sensor networks are inherently unreliable because radio transmission can fail, node can move, and so on. In this paper, we propose the reliable data aggregation protocol in order to these problems. This protocol performs the routing and the query inserting process at the same time to minimize the packet loss caused by network changes. And, this protocol removes the unnecessary routing caused by the periodic routing without query. Additionally, we suggest the countermeasure algorithm against the frequent errors in sensor networks.

• Journal of KIISE:Information Networking
• /
• v.29 no.3
• /
• pp.224-232
• /
• 2002

The routing protocols designed for wired networks can hardly be used for mobile ad-hoc networks due to limited bandwidth of wireless transmission and unpredictable topological change. Recently, several routing protocols for mobile ad-hoc networks have been proposed. However, when these protocols are applied to support real time services like multimedia transmission, they still have problems in ad-hoe networks, where the topology changes drastically. In this paper, we propose a new route selection algorithm which selects the most reliable rouse that is impervious to route failures by topological changes by mobile hosts. For reliable route selection, the concept of virtual zone (stable lone and caution zone) is proposed. The lone is located in a mobile node's transmission range and determined by mobile node's mobility information received by Global Positioning System (GPS). The proposed algorithm is applied to the route discovery procedure of the existing on-demand routing protocol, AODV, and evaluated by simulation in various traffic conditions and mobility patterns.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.8B
• /
• pp.695-705
• /
• 2012

Due to recent advances in wireless devices and the automotive industry, Vehicular Ad hoc Networks (VANETs) have emerged as a very promising technology for transferring data collected on the road by moving cars. The delivered data may contain emergency information which affects the safety of passengers and drivers as well as the traffic congestion, and the routing protocols have thus a significant impact on the performance of VANETs. In this paper, we study the impact of movement direction of the participating cars which forward data packets on the performance of data delivery and present a new approach which extends the contention-based forwarding (CBF). The proposed reliable CBF (R-CBF) increases the reliability of data deliver on the traffic lights installed roads and reduces the overall propagation delay without routing loops or interruption of data forwarding that may be caused by changes of relative positions of involving cars in routing. Simulation demonstrates that the R-CBF diminishes propagation delay by 38% in comparison to G-SRMB which forwards data to moving cars in the backward direction and eliminates unnecessary retransmissions.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.5A
• /
• pp.459-468
• /
• 2006

Current routing in sensor networks focuses on finding methods for energy-efficient route setup and reliable relaying of data from the sensors to the sink so that the lifetime of the network is maximized. The existing routing protocols do not have routing tables to determine a path when packets are transferred. A sensor network by a routing table increases a cost of maintaining and updating a path, because sensor nodes have characteristics to be mobile and constrained capacity and resources. This paper proposes a new routing algorithm by broadcasting a bitmap in order to reduce the number of messages transferred when routing paths are established. Each node has a routing table with a bitmap, which contains link information. A bitmap is formed two-dimensional array, which consists of each row and column represented with a bit. The node only updates its own bitmap if it receives a bitmap from another adjacent nodes after the broadcasting. There by, each node has a bitmap with partial links information not total links information on the network. The proposed routing algorithm reduces the number of messages for routing establishment at least 10% compared with the previous algorithms.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39B no.11
• /
• pp.730-742
• /
• 2014

In the case of On-demand routing protocol in cognitive radio ad-hoc networks, broadcasting of control packets may occur common control channel overload and packet collisions during the routing procedure. This situation is to increase the overhead of path finding and also limited to find the accurate and reliable path. Since reliable channel and path finding is restricted, path life time is shorten and path reliability is reduced. In this paper, we propose a new routing algorithm that reduces control channel overhead and increases path life time by considering the probability of appearance of primary user and channel status of neighbor nodes. Each node performs periodic local sensing to detect primary user signal and to derive primary user activity patterns. The probability of primary appearance on the current channel and the channel status can be obtained based on the periodic sensing. In addition, each node identifies the quality of the channel by message exchange through a common channel with neighbor nodes, then determines Link_Levels with neighbor nodes. In the proposed method, the Link Level condition reduces the number of control messages that are generated during the route discovery process. The proposed method can improve path life time by choosing a path through Path_Reliability in which stability and quality are weighted depending on the location. Through simulation, we show that our proposed algorithm reduces packet collisions and increases path life time in comparison with the traditional algorithm.

• Journal of the Korea Society of Computer and Information
• /
• v.7 no.4
• /
• pp.188-198
• /
• 2002

In this paper, we propose an active network to support reliable data transmission in the mobile ad-hoc network. The active network uses DSR(Dynamic Source Routing) protocol as its basic routing protocol, and uses source and destination nodes as key active nodes. For reliable improvement the source node is changed to source active node to add function that its buffer to store the last data with the flow control for data transmission per destination node. The destination node is changed to destination active node to add function that it requests the re-transmission for data that was not previously received by the destination active node with the flow control for data reception per source active node As the result of evaluation. we found the proposed active network guaranteed reliable data transmission with almost 100% data reception rate for slowly moving mobile ad-hoc network and with more 95% data reception rate, which is improvement of 3.5737% reception rate compared with none active network, for continuously fast moving mobile ad-hoc network.

• Journal of IKEEE
• /
• v.7 no.1 s.12
• /
• pp.63-71
• /
• 2003

In this paper, we propose an DSR(Dynamic Source Routing) protocol to support QoS for reliable data transmission in the mobile ad-hoc network. The proposed algorithm uses DSR protocol to support QoS as its basic routing protocol, and uses the nodes which are between source and destination nodes as key QoS support. Because of moving nodes there is some problem that is restricted reliable data transmission. For solve this problem, source node set up the QoS link with destination node. The nodes that are located at QoS link and find out loss of transmission path save the transmitting data packets. Those search a new transmission path to destination node and transmit the saved data packet to destination node. As the result of evaluation, we found the proposed QoS network guaranteed reliable data transmission with almost 100% data reception rate for slowly moving mobile ad-hoc network and with more 96% data reception rate, which is improvement of 3.7737% reception rate compared with none QoS network, for continuously fast moving mobile ad-hoc network.

• The KIPS Transactions:PartC
• /
• v.9C no.6
• /
• pp.875-882
• /
• 2002

The active packets unlike traditional IP packets should be executed at each active node along their path. To execute the active program at each active node, the active packets for an active program should go through the same active nodes and all packets are delivered without any loss. This paper presents the new active engine for every active packet which execute an active program to be routed through the same intermediate active nodes and to be delivered reliably. Proposed active engine requires fewer changes to existing IP protocols and guarantees the reliable delivery of the active packets. Moreover, even if the sender does not have any information about the intermediate nodes every active packet is routed through the same intermediate active nodes. The simulation results show that proposed active engine achieves an efficient transmission with high data delivery and low communication overhead compared with the other existing transmission protocols.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.3 no.1
• /
• pp.5-25
• /
• 2009

In recent years the popularity of multi-hop wireless networks has been growing. Its flexible topology and abundant routing path enables many types of applications. However, the lack of a centralized controller often makes it difficult to design a reliable service in multi-hop wireless networks. While packet routing has been the center of attention for decades, recent research focuses on data discovery such as file sharing in multi-hop wireless networks. Although there are many peer-to-peer lookup (P2P-lookup) schemes for wired networks, they have inherent limitations for multi-hop wireless networks. First, a wired P2P-lookup builds a search structure on the overlay network and disregards the underlying topology. Second, the performance guarantee often relies on specific topology models such as random graphs, which do not apply to multi-hop wireless networks. Past studies on wireless P2P-lookup either combined existing solutions with known routing algorithms or proposed tree-based routing, which is prone to traffic congestion. In this paper, we present two wireless P2P-lookup schemes that strictly build a topology-dependent structure. We first propose the Ring Interval Graph Search (RIGS) that constructs a DHT only through direct connections between the nodes. We then propose the ValleyWalk, a loosely-structured scheme that requires simple local hints for query routing. Packet-level simulations showed that RIGS can find the target with near-shortest search length and ValleyWalk can find the target with near-shortest search length when there is at least 5% object replication. We also provide an analytic bound on the search length of ValleyWalk.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.11 no.9
• /
• pp.1665-1671
• /
• 2007

Mobile Ad hoc Networks (MANETs) refer to autonomous networks in which wireless data communications are established between multiple nodes in a given coverage area without a base station or centralized administration. Because of node mobility and limited battery life, the network topology may changes frequently. Selecting the most reliable path during route discovery process is important to improve performance in ad-hoc networks. In this study, we proposed an enhanced routing protocol based on AODV by monitoring variation of receiving signal strength. New metric function that consists of node mobility and hops of path is used for routing decision. From extensive experiments by using NS-2, The performance of the proposed routing scheme has been imp개ved by comparison to AODV protocol.