Time filter

Source Type

Yu F.,Key Laboratory of Broadband Optical Fiber Transmission and Communication Networks | Park S.,Chungnam National University | Lee E.,Chungnam National University | Kim S.-H.,Chungnam National University
IET Communications | Year: 2010

Geographic routing has been considered as an efficient, simple and scalable routing protocol for wireless sensor networks, since it exploits pure location information instead of global topology information to route data packets towards a static sink. Recently, a number of research works have shown that mobile sinks can achieve high energy efficiency and load balance than static ones. In order to receive data packets continuously, a mobile sink must update its location to the source frequently. However, frequent location updates of mobile sinks may lead to both rapid energy consumption of the sensor nodes and increased collisions in wireless transmissions. The authors propose a novel geographic routing for mobile sinks to address this issue. The proposed scheme takes advantage of wireless broadcast transmission nature of wireless sensor nodes. When a sink moves, the new location information is propagated along the reverse geographic routing path to the source during data delivery. Analysis and simulation results indicate that elastic routing is superior to other protocols in terms of control overhead, data delivery delay and energy consumption. © 2010 The Institution of Engineering and Technology.


Yu F.,Key Laboratory of Broadband Optical Fiber Transmission and Communication Networks | Lee E.,Chungnam National University | Park S.,Chungnam National University | Kim S.-H.,Chungnam National University
IEEE Communications Letters | Year: 2010

The overhearing feature of wireless transmission has been widely employed for applications such as network time synchronization, malicious packet-modifying attacks detection, and reducing redundant transmissions in wireless sensor networks (WSNs). In this letter, we exploit the overhearing feature of wireless transmission to propagate the location information of a mobile sink to a source in WSNs, and to the best of our knowledge, this is the first design which exploit the overhearing feature for multi-hop information relay. © 2006 IEEE.


Lee E.,Chungnam National University | Yu F.,Key Laboratory of Broadband Optical Fiber Transmission and Communication Networks | Park S.,Chungnam National University | Kim S.-H.,Chungnam National University
IEEE Communications Letters | Year: 2010

In wireless sensor networks, geographic routing requires source nodes to be aware of the location information of sinks to send their data. Since sensor nodes have limited resources, providing the sink location service through low overhead is an important challenging issue. To address this issue, in this letter, we propose a simple sink location service scheme based on circle and line paths. In the proposed scheme, a sink constructs a circle path of a Sink Location Announcement (SLA) message while a source node constructs a line path of a Sink Location Query (SLQ) message. Then, the proposed scheme guarantee that the SLQ line path and SLA circle path can have at least one crossing point. Simulation results show that the proposed scheme is superior to other schemes in terms of control overhead. © 2006 IEEE.


Li T.,Key Laboratory of Broadband Optical Fiber Transmission and Communication Networks | Li T.,Chengdu University of Information Technology | Li X.,Key Laboratory of Broadband Optical Fiber Transmission and Communication Networks
ICCASM 2010 - 2010 International Conference on Computer Application and System Modeling, Proceedings | Year: 2010

Dynamic rules acquisition is a topic of general interest in the field of association rules mining. Many existing incremental mining algorithms are Apriori-based, which are not easily adoptable to mine tree-based frequent patterns. In this paper, we provide a novel incremental updating algorithm IULFP for mining association rules. We use the layered frequent pattern tree based structure to store frequent items. Moreover, we propose the definition of "strong frequent item sets", which is proved to be a useful method to find all the frequent item sets in the updated databases. The experimental results show that our approach has higher efficiency than other previous works.


Li T.,Key Laboratory of Broadband Optical Fiber Transmission and Communication Networks | Li T.,Chengdu University of Information Technology | Li X.,Key Laboratory of Broadband Optical Fiber Transmission and Communication Networks
Information Sciences | Year: 2010

Alarm correlation analysis system is an useful method and tool for analyzing alarms and finding the root cause of faults in telecommunication networks. Recently, the application of association rules mining becomes an important research area in alarm correlation analysis. In this paper, we propose a novel Association Rules Mining based Alarm Correlation Analysis System (ARM-ACAS) to find interesting association rules between alarm events. In order to mine some infrequent but important items, ARM-ACAS first uses neural network to classify the alarms with different levels. In addition, ARM-ACAS also exploits an optimization technique with the weighted frequent pattern tree structure to improve the mining efficiency. The system is both efficient and practical in discovering significant relationships of alarms as illustrated by experiments performed on simulated and real-world datasets. © 2010 Elsevier Inc. All rights reserved.


Lee E.,Chungnam National University | Park S.,Chungnam National University | Yu F.,Key Laboratory of Broadband Optical Fiber Transmission and Communication Networks | Kim S.-H.,Chungnam National University
IEEE Transactions on Consumer Electronics | Year: 2010

Most existing geographic routing protocols on sensor networks concentrates on finding ways to guarantee data forwarding from the source to the destination, and not many protocols have been done on gathering and aggregating data of sources in a local and adjacent region. However, data generated from the sources in the region are often redundant and highly correlated. Accordingly, gathering and aggregating data from the region in the sensor networks is important and necessary to save the energy and wireless resources of sensor nodes. We introduce the concept of a local sink to address this issue in geographic routing. The local sink is a sensor node in the region, in which the sensor node is temporarily selected by a global sink for gathering and aggregating data from sources in the region and delivering the aggregated data to the global sink. We next design a Single Local Sink Model for determining optimal location of single local sink. Because the buffer size of a local sink is limited and the deadline of data is constrained, single local sink is capable of carrying out many sources in a large-scale local and adjacent region. Hence, we also extend the Single Local Sink Model to a Multiple Local Sinks Model. We next propose a data gathering mechanism that gathers data in the region through the local sink and delivers the aggregated data to the global sink. Simulation results show that the proposed mechanism is more efficient in terms of the energy consumption, the data delivery ratio, and the deadline miss ratio than the existing mechanisms. © 2006 IEEE.


Li T.-Y.,Chengdu University of Information Technology | Li X.-M.,Key Laboratory of Broadband Optical Fiber Transmission and Communication Networks
Expert Systems with Applications | Year: 2011

Recently, the application of association rules mining becomes an important research area in alarm correlation analysis. However, the original alarms in the telecommunication networks cannot be used to mine association rules directly. This paper proposes a novel preprocessing expert system model to deal with the original alarms. This model uses two important techniques, of which the time window technique is used for converting original alarms into transactions, and the neural network technique can classify the alarms with different levels according to the characteristics of telecommunication networks in order to mine the weighted association rules. Simulation results and the real-world applications demonstrate the effectiveness and practicality of this preprocessing expert system. © 2010 Elsevier Ltd. All rights reserved.


Huang H.,Key Laboratory of Broadband Optical Fiber Transmission and Communication Networks | Hu G.,Key Laboratory of Broadband Optical Fiber Transmission and Communication Networks | Yu F.,Key Laboratory of Broadband Optical Fiber Transmission and Communication Networks
International Conference on Communication Technology Proceedings, ICCT | Year: 2010

Power control in wireless ad hoc networks is very important and useful for its some application such as battlefield, where node battery recharging is usually impossible. However, it can not guarantee to provide a route with minimal network delay for data delivery due to bandwidth-constrained, variable-capacity links and dynamic topology and so on. Many ad hoc networks applications must resolve the inherent conflict between energy efficient communication and the need to achieve desired end-to-end network delay. To address this challenge, we propose a Delay-Sensitive and Power-Aware routing protocol (DSPA). This proposal builds different routing entries based on network delay from source to destination at different power levels on demand, and selects the minimum power level routing for data delivery. Moreover, DSPA uses different power control policies to transmit data packets, as well as the control packets of network layer and MAC layer. Simulation results show that our protocol can not only effectively reduce energy consumption, thus prolong the network lifetime, but also significantly improve average end-to-end delay while maintaining a good packet delivery ratio. © 2010 IEEE.


Lee E.,Chungnam National University | Park S.,Chungnam National University | Yu F.,Key Laboratory of Broadband Optical Fiber Transmission and Communication Networks | Kim S.-H.,Chungnam National University
IEEE Transactions on Consumer Electronics | Year: 2010

Typical communication model of wireless sensor networks consists of users, sinks, and a number of sensor nodes. The users are remote from wireless sensor networks and they gather data from the sinks via legacy networks. However, in practical sensor network applications, there are two types of users: traditional remote users and mobile users such as firefighters and soldiers. The mobile users may move around sensor fields and they communicate with the sinks only via the sensor networks in order to gather data like location information of victims in disaster areas. In this paper, in order to effectively support both the remote users and the mobile users, we propose a novel communication model relying on the typical sensor network model. In the model, multiple static sinks connect with legacy networks and divide a sensor field into the number of the multiple sinks. Through sharing queries and data via the legacy networks, the multiple static sinks provide high throughput through distributed data gathering and low latency through short-hops data delivery. Multiple static sinks deliver the aggregated data to the remote users via the legacy networks. In case of the mobile users, when a mobile user moves around, it receives the aggregated data from the nearest static sink. Simulation results show that the proposed model is more efficient in terms of energy consumption, data delivery ratio, and delay than the existing models. © 2006 IEEE.


Park S.,Chungnam National University | Lee E.,Chungnam National University | Yu F.,Key Laboratory of Broadband Optical Fiber Transmission and Communication Networks | Kim S.-H.,Chungnam National University
IEEE Transactions on Consumer Electronics | Year: 2010

The publish/subscribe paradigm has been known as the appropriate communication model for providing high scalability and mobility in data-centric networks such as wireless sensor networks. Through an internal infrastructure, in the publish/subscribe paradigm consumers and producers are completely decoupled in the three essential properties: decoupling in space, time, and synchronization. In other words, the internal infrastructure should be hidden from consumers and producers, and it should provide anonymous, asynchronous, and multicasting communication for the decoupling properties. The properties are suitable for the large-scaled mobile environment with many mobile consumers and many mobile producers. Hence, we propose a novel data dissemination scheme satisfied fully with three decoupling properties, and an embedded grid structure is used as the internal infrastructure for supporting shared buffering and multicasting. Through our performance analysis from computer simulation, we conclude that our scheme may be not only the first attempt to implement the true publish/subscribe paradigm in wireless sensor networks, but also can support high scalability and mobility in the wireless sensor networks. © 2006 IEEE.

Loading Key Laboratory of Broadband Optical Fiber Transmission and Communication Networks collaborators
Loading Key Laboratory of Broadband Optical Fiber Transmission and Communication Networks collaborators