Routing in intermittently connected sensor networks

Lu Su, Changlei Liu, Hui Song, Guohong Cao

Research output: Chapter in Book/Report/Conference proceedingConference contribution

35 Citations (Scopus)

Abstract

To prolong the lifetime of sensor networks, various scheduling schemes have been designed to reduce the number of active sensors. However, some scheduling strategies, such as partial coverage scheduling and target coverage scheduling, may result in disconnected network topologies, due to the low density of the active nodes. In such cases, traditional routing algorithms cannot be applied, and the shortest path discovered by these algorithms may not have the minimum packet delivery latency. In this paper, we address the problem of finding minimum latency routes in intermittently connected sensor networks by proposing an on-demand minimum latency (ODML) routing algorithm. Since on-demand routing algorithm does not work well when the source and destination frequently communicate with each other, we propose two proactive minimum latency routing algorithms: optimal-PML and quick-PML. Theoretical analysis and simulation results show that (1) ODML can effectively identify minimum latency routes which have much smaller latency than the shortest path, and (2) optimal-PML can minimize the routing message overhead and quick-PML can significantly reduce the route acquisition delay.

Original languageEnglish (US)
Title of host publication16th IEEE International Conference on Network Protocols, ICNP'08
Pages278-287
Number of pages10
DOIs
StatePublished - Dec 1 2008
Event16th IEEE International Conference on Network Protocols, ICNP'08 - Orlando, FL, United States
Duration: Oct 19 2008Oct 22 2008

Publication series

NameProceedings - International Conference on Network Protocols, ICNP
ISSN (Print)1092-1648

Other

Other16th IEEE International Conference on Network Protocols, ICNP'08
CountryUnited States
CityOrlando, FL
Period10/19/0810/22/08

Fingerprint

Routing algorithms
Sensor networks
Scheduling
Topology
Sensors

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications
  • Software

Cite this

Su, L., Liu, C., Song, H., & Cao, G. (2008). Routing in intermittently connected sensor networks. In 16th IEEE International Conference on Network Protocols, ICNP'08 (pp. 278-287). [4697046] (Proceedings - International Conference on Network Protocols, ICNP). https://doi.org/10.1109/ICNP.2008.4697046
Su, Lu ; Liu, Changlei ; Song, Hui ; Cao, Guohong. / Routing in intermittently connected sensor networks. 16th IEEE International Conference on Network Protocols, ICNP'08. 2008. pp. 278-287 (Proceedings - International Conference on Network Protocols, ICNP).
@inproceedings{9d1e0211fd504227b4becfb00650682f,
title = "Routing in intermittently connected sensor networks",
abstract = "To prolong the lifetime of sensor networks, various scheduling schemes have been designed to reduce the number of active sensors. However, some scheduling strategies, such as partial coverage scheduling and target coverage scheduling, may result in disconnected network topologies, due to the low density of the active nodes. In such cases, traditional routing algorithms cannot be applied, and the shortest path discovered by these algorithms may not have the minimum packet delivery latency. In this paper, we address the problem of finding minimum latency routes in intermittently connected sensor networks by proposing an on-demand minimum latency (ODML) routing algorithm. Since on-demand routing algorithm does not work well when the source and destination frequently communicate with each other, we propose two proactive minimum latency routing algorithms: optimal-PML and quick-PML. Theoretical analysis and simulation results show that (1) ODML can effectively identify minimum latency routes which have much smaller latency than the shortest path, and (2) optimal-PML can minimize the routing message overhead and quick-PML can significantly reduce the route acquisition delay.",
author = "Lu Su and Changlei Liu and Hui Song and Guohong Cao",
year = "2008",
month = "12",
day = "1",
doi = "10.1109/ICNP.2008.4697046",
language = "English (US)",
isbn = "9781424425075",
series = "Proceedings - International Conference on Network Protocols, ICNP",
pages = "278--287",
booktitle = "16th IEEE International Conference on Network Protocols, ICNP'08",

}

Su, L, Liu, C, Song, H & Cao, G 2008, Routing in intermittently connected sensor networks. in 16th IEEE International Conference on Network Protocols, ICNP'08., 4697046, Proceedings - International Conference on Network Protocols, ICNP, pp. 278-287, 16th IEEE International Conference on Network Protocols, ICNP'08, Orlando, FL, United States, 10/19/08. https://doi.org/10.1109/ICNP.2008.4697046

Routing in intermittently connected sensor networks. / Su, Lu; Liu, Changlei; Song, Hui; Cao, Guohong.

16th IEEE International Conference on Network Protocols, ICNP'08. 2008. p. 278-287 4697046 (Proceedings - International Conference on Network Protocols, ICNP).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

T1 - Routing in intermittently connected sensor networks

AU - Su, Lu

AU - Liu, Changlei

AU - Song, Hui

AU - Cao, Guohong

PY - 2008/12/1

Y1 - 2008/12/1

N2 - To prolong the lifetime of sensor networks, various scheduling schemes have been designed to reduce the number of active sensors. However, some scheduling strategies, such as partial coverage scheduling and target coverage scheduling, may result in disconnected network topologies, due to the low density of the active nodes. In such cases, traditional routing algorithms cannot be applied, and the shortest path discovered by these algorithms may not have the minimum packet delivery latency. In this paper, we address the problem of finding minimum latency routes in intermittently connected sensor networks by proposing an on-demand minimum latency (ODML) routing algorithm. Since on-demand routing algorithm does not work well when the source and destination frequently communicate with each other, we propose two proactive minimum latency routing algorithms: optimal-PML and quick-PML. Theoretical analysis and simulation results show that (1) ODML can effectively identify minimum latency routes which have much smaller latency than the shortest path, and (2) optimal-PML can minimize the routing message overhead and quick-PML can significantly reduce the route acquisition delay.

AB - To prolong the lifetime of sensor networks, various scheduling schemes have been designed to reduce the number of active sensors. However, some scheduling strategies, such as partial coverage scheduling and target coverage scheduling, may result in disconnected network topologies, due to the low density of the active nodes. In such cases, traditional routing algorithms cannot be applied, and the shortest path discovered by these algorithms may not have the minimum packet delivery latency. In this paper, we address the problem of finding minimum latency routes in intermittently connected sensor networks by proposing an on-demand minimum latency (ODML) routing algorithm. Since on-demand routing algorithm does not work well when the source and destination frequently communicate with each other, we propose two proactive minimum latency routing algorithms: optimal-PML and quick-PML. Theoretical analysis and simulation results show that (1) ODML can effectively identify minimum latency routes which have much smaller latency than the shortest path, and (2) optimal-PML can minimize the routing message overhead and quick-PML can significantly reduce the route acquisition delay.

UR - http://www.scopus.com/inward/record.url?scp=67249165295&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=67249165295&partnerID=8YFLogxK

U2 - 10.1109/ICNP.2008.4697046

DO - 10.1109/ICNP.2008.4697046

M3 - Conference contribution

AN - SCOPUS:67249165295

SN - 9781424425075

T3 - Proceedings - International Conference on Network Protocols, ICNP

SP - 278

EP - 287

BT - 16th IEEE International Conference on Network Protocols, ICNP'08

ER -

Su L, Liu C, Song H, Cao G. Routing in intermittently connected sensor networks. In 16th IEEE International Conference on Network Protocols, ICNP'08. 2008. p. 278-287. 4697046. (Proceedings - International Conference on Network Protocols, ICNP). https://doi.org/10.1109/ICNP.2008.4697046