1-18hit |
Seung-Woo HONG Euisin LEE Ho-Yong RYU Sang-Ha KIM
For monitoring of a large-scale continuous object, a large number of sensor nodes might be participated with object detection and tracking. In order to reduce huge quantities of data from the sensor nodes, previous studies focus on representative selection for data reporting to a sink. However, they simply choose representatives among a large number of candidates without consideration of node deployment environments and detection accuracy. Hence, this letter proposes a novel object tracking scheme that first makes a small set of candidates and then chooses a small number of representatives in the set. Also, since the scheme also considers object alteration for representative selection, it can provide high energy-efficiency despite reducing data reporting.
Euisin LEE Soochang PARK Jeongcheol LEE Sang-Ha KIM
To provide scalability against group size, Global Location Search based Hierarchical Geographic Multicast Protocols (GLS-HGMPs) have recently been proposed for wireless sensor networks. To reduce the communication overhead imposed by the global location search and prevent the multicast data detour imposed by the hierarchical geographic multicasting in GLS-HGMPs, this letter proposes Local Location Search based Progressive Geographic Multicast Protocol (LLS-PGMP). Simulation results show that LLS-PGMP is superior to GLS-HGMPs.
In this paper, we propose a new measurement-based fair call admission control policy for heterogeneous packet radio networks. The objectives of the new admission policy are to 1) reduce computation overhead and rapidly re-allocate resources to keep desired Quality of Service (QoS) demands, 2) relieve hot-spot cell by reducing the number of handoff calls from neighboring cells, 3) fairly admit voice and data traffic to prevent declined service degradation. With numerical analysis, we evaluate QoS constraints and inter-cell as well as inter-service fairness by using queuing model, which is described by a two-dimensional continuous-time Markov chain. Finally, we validate our model's accuracy by comparing results of analytical model with ones of event-driven simulation.
Euisin LEE Soochang PARK Hosung PARK Sang-Ha KIM
Quantity-based event reliability protocols have been proposed for reliable event detection in wireless sensor networks. They support the event reliability by achieving the desired number of data packets successfully transmitted from sensor nodes sensing an event to a sink by controlling the transport process. However, since many data collisions and buffer overflows frequently happen due to data congestions on limited data delivery paths from an event to a sink, the quantity-based event reliability protocols are hard to achieve the desired number due to lost data packets. Thus, this letter proposes a Quality-based Event Reliability Protocol (QERP) utilizing a property that the data packets from sensor nodes have different Contribution Degree (CD) values for event detection according to their environmental conditions. QERP selects sensor nodes to forward their data packets according to CD, and differentially transports the data packets by CD-based buffer management and load balancing.
Soochang PARK Euisin LEE Min-Sook JIN Sang-Ha KIM
In large-scale wireless sensor networks, in order to support group mobility of mobile sinks, this letter proposes a novel strategy for energy-efficient and robust data dissemination to the sinks based on cluster-based communication. The novel strategy is composed of two major mechanisms for reduction of structure construction overhead and routing state maintenance overhead: 1) a virtual infrastructure construction through grid-referred clustering and 2) inter-cluster communication by geographic routing relying on recursive location search. Based on the two major mechanisms, the strategy provides representative location management per sink group, distributed data collection, and per-cluster foot-print chaining in order to effectively adapt the traditional strategy for individual mobile sinks. Simulation results prove the proposed strategy shows better performances in terms of energy efficiency and robustness of data dissemination.
In this letter, we present a new IPv6 multihoming scheme, which complements in both load sharing and delay aspects. The advantages of the proposed scheme are as follows: 1) it provides efficient load sharing algorithm. 2) Since it distributes concentrated tunneling overhead to many other border routers, it can solve a point of failure problem. 3) Finally, it can drastically reduce end-to-end delay by means of establishing alternative optimized path. The simulation results show the distinct performance of our approach.
Fucai YU Soochang PARK Euisin LEE Younghwan CHOI Sang-Ha KIM
Geographic routing for wireless sensor networks requires a source that can encapsulate the location of a sink in each data packet. How a source can obtain the location of a sink with low overhead is a difficult issue. This letter proposes a Quorum Based Sink Location Service (QSLS) which can be exploited by most geographic routing protocols in arbitrary irregular wireless sensor networks.
Sungkee NOH Euisin LEE Soochang PARK Seungmin OH Sang-Ha KIM
Recently, a flexible loss recovery scheme, called Active Caching (AC) has been proposed to accomplish a Desired Communication Reliability (DCR) about the whole data packets at a source depending on the various applications. However, since AC does not consider the packet delivery rate of each wireless link on multi-hop forwarding paths, it increases the number of totally transmitted packets to achieve a DCR and thus grows the energy consumption of sensor nodes. Thus, this letter proposes a novel recovery scheme which can minimize the number of totally transmitted packets while satisfying a DCR. By geometric programming, the proposed scheme allocates an optimized one-hop packet transmission rate of each wireless link on the multi-hop forwarding path.
This letter presents a new stable clustering architecture to reduce the number of re-clustering in MANET. Since some existing stable clustering schemes based on measured metric have certain deficiency in negative effect caused by nodes moving fast or causing ping pong effect, we introduce average connection time as major parameter to form as well as maintain cluster structure over the entire networks. From simulation results it is clear that average connection time is more adequate parameter for stable cluster architecture than other measured factors, resulting in fewer number of cluster changes than previous schemes.
Overlay multicast schemes for Mobile Ad hoc Networks (MANET) [1] have been proposed to remove non group members' dependency for multicast forwarding. However, since all packets are relayed from one group member to other group member in a form of unicast packet, they sometimes cause a lot of packets' collision and low resource utilization particularly where group members densely locate. In this paper, we propose a new forwarding scheme, DESIRE (Density awarE heterogeneouS overlay multIcast foRwarding schemE in MANET), for overlay multicast in MANET. DESIRE is significantly different from previous overlay multicast schemes in that it creates separate data forwarding path over overlay DDT (Data Delivery Tree) depending on density of group members. In dense environment, a zone is constructed and a scoped flooding is applied within it. On the other hand, in sparse environment, data dissemination is accomplished in a form of unicast packet similar to previous overlay multicast. By adapting scoped flooding in dense environment, it can reduce a lot of packets' collision and balance battery consumption by making use of mobile node's broadcast capability entirely. Also, in sparse environment, DESIRE can cope with network mobility very well since overlay DDT can remain static regardless of changes in physical topology. Such distinct advantages are evaluated by simulation. Generally, better performance is shown with large group members than small group members.
Sang-Wan KIM Yongbin YIM Hosung PARK Ki-Dong NAM Sang-Ha KIM
Energy-efficient tracking of continuous objects such as fluids, gases, and wild fires is one of the important challenging issues in wireless sensor networks. Many studies have focused on electing fewer nodes to report the boundary information of continuous objects for energy saving. However, this approach of using few reporting packets is very sensitive to packet loss. Many applications based on continuous objects tracking require timely and precise boundary information due to the danger posed by the objects. When transmission of reporting packets fails, applications are unable to track the boundary reliably and a delay is imposed to recover. The transmission failure can fatally degrade application performance. Thus, it is necessary to consider just-in-time recovery for reliable continuous object tracking. Nevertheless, most schemes did not consider the reliable tracking to handle the situation that packet loss happen. Recently, a scheme called I-COD with retransmission was proposed to recover lost packets but it leads to increasing both the energy consumption and the tracking latency owing to the retransmission. Thus, we propose a reliable tracking scheme that uses fast recovery with the redundant boundary information to track continuous objects in real-time and energy-efficiently. In the proposed scheme, neighbor nodes of boundary nodes gather the boundary information in duplicate and report the redundant boundary information. Then the sink node can recover the lost packets fast by using the redundant boundary information. The proposed scheme provides the reliable tracking with low latency and no retransmissions. In addition, the proposed scheme saves the energy by electing fewer nodes to report the boundary information and performing the recovery without retransmissions. Our simulation results show that the proposed scheme provides the energy-efficient and reliable tracking in real-time for the continuous objects.
Euisin LEE Soochang PARK Fucai YU Sang-Ha KIM
In-network data aggregation is one of the most important issues for achieving energy-efficiency in wireless sensor networks since sensor nodes in the surrounding region of an event may generate redundant sensed data. The redundant sensed data should be aggregated before being delivered to the sink to reduce energy consumption. Which node should be selected as a Data Aggregation Node (DAN) for achieving the best energy efficiency is a difficult issue. To address this issue, this letter proposes a scheme to select a DAN for achieving energy-efficiency in an event region. The proposed scheme uses an analytical model to select the sensor node that has the lowest total energy consumption for gathering data from sensor nodes and for forwarding aggregated data to a sink, as a DAN. Analysis and simulation results show that the proposed scheme is superior to other schemes.
Vertical handoff is a new type of handoff that is triggered when a mobile node moves over heterogeneous wireless networks with each proving different access bandwidth, transmission latency, and coverage. A mobile node can achieve higher throughput by accessing a higher bandwidth providing wireless network. However, TCP has to experience drastic changes of the bandwidth and the latency due to the vertical handoff which must be recognized as a network congestion, and this degrades end-to-end performance. In this paper, we propose a TCP context switching scheme, named Context-Switching TCP, that maintains TCP variables separately for different types of wireless networks. Through simulations, Context-Switching TCP shows higher performance than TCP SACK for vertical handoff. Especially, it shows much higher performance gain when vertical handoff occurs frequently.
Euisin LEE Soochang PARK Hosung PARK Sang-Ha KIM
In this paper, to provide scalability and mobility of sinks and events, we propose a new independent structure-based routing protocol which exploits a k-level Independent Grid Structure (IGS) for data dissemination from sources to sinks. Beside the k-level IGS, the proposed protocol does not to construct any additional routing structure irrespective of the number and the movement of both sinks and events. The proposed protocol also allows query or report packets to be sent to only a few grid headers in the k-level IGS and provides aggregation and multicasting of report packets by the k-level IGS. Simulation results show that the proposed protocol is superior to other protocols regarding to energy-efficiency.
Jung-Mo MOON Mi-Young YUN Sang-Ha KIM
The crucial issue for mobile Internet services is to provide the guaranteed mobile QoS for multicalls. In mobile networks, we should not only guarantee handoff dropping probability but also maximize resource utilization. In this paper, we propose a QoS admission control mechanism for macro Mobile QoS based on a dynamic resource reservation. We introduce the requirements for macro Mobile QoS as mobility features and predict required resources in each routing paths thorough the combined analysis of average movement pattern and pre-defined handoff dropping probability. Our simulation results show that the proposed scheme can guarantee the pre-defined handoff dropping probability and maintain lower call blocking probability and higher resource utilization than other schemes. The propose scheme gives a practical solution for mobile networks providing mobile Internet services.
Ki-Il KIM Dong-Kyun KIM Sang-Ha KIM
In this letter, we propose to construct reliable overlay data delivery tree based on group member's packet loss rate while preserving end-to-end delay below predetermined threshold. Through practical simulation, performance is evaluated and compared.
Soochang PARK Euisin LEE Min-Sook JIN Sang-Ha KIM
In Proxy Mobile IPv6 (PMIPv6), when a Mobile Node (MN) enters a PMIPv6 domain and attaches to an access link, the router on the access link detects attachment of the MN by the link-layer access. All elements of PMIPv6 including the router then provide network-based mobility management service for the MN. If the MN moves to another router in this PMIPv6 domain, the new router emulates attachment to the previous router by providing same network prefix to the MN. In other words, PMIPv6 provides rapid mobility management based on layer-2 attachment and transparent mobility support to the MN by emulating layer-3 attachment with respect to intra-domain roaming. However, when the MN moves to other PMIPv6 domains, although the domains also provide the network-based mobility management service, the MN should exploit the host-based mobility management protocol, i.e. Mobile IPv6 (MIPv6), for the inter-domain roaming. Hence, this letter proposes the rapid and transparent inter-domain roaming mechanism controlled by the networks adopting PMIPv6.
Soochang PARK Euisin LEE Juhyun JUNG Sang-Ha KIM
In wireless sensor networks, real-time data delivery schemes typically achieve the desired delivery speed by proactively performing one-hop lookahead. Recently, to reduce the deadline miss ratio with respect to the desired delivery speed, a study has proposed a real-time data delivery scheme based on proactively performing two-hop lookahead. However, the recent proposal might cause heavy message exchange overhead and high computing complexity in order to proactively obtain two-hop neighbor speed information in all sensor nodes whether data are delivered or not. In this paper, we propose a novel real-time data delivery scheme that applies on-demand multi-hop lookahead only around data forwarding paths. Hence, the scheme can provide lower deadline miss ratio for real-time data delivery with low message exchange overhead than existing schemes.