Entity

Time filter

Source Type


Lee E.,University of California at Los Angeles | Yu F.,Key Laboratory of Broadband Optical Fiber Transmission and Communication Networks | Park S.,Orange S.A. | Kim S.-H.,Chungnam National University | And 2 more authors.
Wireless Networks | Year: 2014

Geographic routing in wireless sensor networks requires sources nodes to be aware of the location information of sinks to send their data.To provide the sink location service, quorum-based schemes have been proposed, which exploit crossing points between a quorum of a sink location announcement (SLA) message from a sink and a quorum of a sink location query (SLQ) message from a source node.For guaranteeing at least one crossing point in irregular sensor networks with void areas or irregular boundaries, the previous schemes however collect and flood the network boundary information or forward a SLA and SLQ message along the whole network boundary.In this paper, we design a novel quorum-based sink location service scheme that exploits circle and line quorums, which does not require the network boundary information and send a SLA and SLQ message along the whole network boundary.In the proposed scheme, a source node sends a SLQ message to the network center and sends another SLQ message to an edge node in the network boundary, thus generating a SLQ line quorum.On the other hand, a sink node sends a SLA message along a circle path whose center is the network center, thus forming a SLQ circle quorum.By this way, it is guaranteed that the SLQ and SLA quorums have at least one crossing point in irregular sensor networks.Both numerical analysis and extensive simulation results verify that the proposed scheme outperforms the existing schemes in terms of the delivery distance, the delivery hop count, and the energy consumption for providing sink location service.© 2013 Springer Science+Business Media New York. Source


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


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


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


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

Discover hidden collaborations