OPS: Opportunistic pipeline scheduling in long-strip wireless sensor networks with unreliable links

Peng Guo, Nirvana Meratnia, Paul J.M. Havinga, He Jiang, Kui Zhang

    Research output: Contribution to journalArticleAcademicpeer-review

    7 Citations (Scopus)

    Abstract

    Being deployed in narrow but long area, strip wireless sensor networks (SWSNs) have drawn much attention in applications such as coal mines, pipeline and structure monitoring. One of typical characteristics of SWSNs is the large hop counts, which leads to long end-to-end delivery delay in low-duty-cycle SWSNs. To reduce the delay, pipeline scheduling is a promising technique, which assigns sensor nodes sequential active time slots along the data forwarding path. However, pipeline scheduling is prone to failure when communication links are unreliable. In this paper, we propose an opportunistic pipeline scheduling algorithm (OPS) for SWSNs, based on the observation that sensor nodes in SWSNs can overhear data transmissions passing by them. OPS exploits nodes outside the data forwarding path to opportunistically provide links when transmission failure happens, and hence maintains the pipeline forwarding instead of retransmission in the next duty cycle. Theoretical calculation shows that the expectation delay of OPS is always smaller than that of existing methods when the link quality is <100 %. Both extensive simulations and experiments are conducted. The results verify that the average end-to-end delivery delay of OPS is usually <60 % of that of existing methods, while the energy cost is almost the same.
    Original languageUndefined
    Pages (from-to)1669-1682
    Number of pages14
    JournalWireless networks
    Volume21
    Issue number5
    DOIs
    Publication statusPublished - 12 Jul 2015

    Keywords

    • EWI-25676
    • IR-94399
    • METIS-309873

    Cite this

    @article{42ecb96b4d7b4b38bfdf5b754a4f2ae1,
    title = "OPS: Opportunistic pipeline scheduling in long-strip wireless sensor networks with unreliable links",
    abstract = "Being deployed in narrow but long area, strip wireless sensor networks (SWSNs) have drawn much attention in applications such as coal mines, pipeline and structure monitoring. One of typical characteristics of SWSNs is the large hop counts, which leads to long end-to-end delivery delay in low-duty-cycle SWSNs. To reduce the delay, pipeline scheduling is a promising technique, which assigns sensor nodes sequential active time slots along the data forwarding path. However, pipeline scheduling is prone to failure when communication links are unreliable. In this paper, we propose an opportunistic pipeline scheduling algorithm (OPS) for SWSNs, based on the observation that sensor nodes in SWSNs can overhear data transmissions passing by them. OPS exploits nodes outside the data forwarding path to opportunistically provide links when transmission failure happens, and hence maintains the pipeline forwarding instead of retransmission in the next duty cycle. Theoretical calculation shows that the expectation delay of OPS is always smaller than that of existing methods when the link quality is <100 {\%}. Both extensive simulations and experiments are conducted. The results verify that the average end-to-end delivery delay of OPS is usually <60 {\%} of that of existing methods, while the energy cost is almost the same.",
    keywords = "EWI-25676, IR-94399, METIS-309873",
    author = "Peng Guo and Nirvana Meratnia and Havinga, {Paul J.M.} and He Jiang and Kui Zhang",
    note = "eemcs-eprint-25676",
    year = "2015",
    month = "7",
    day = "12",
    doi = "10.1007/s11276-014-0807-x",
    language = "Undefined",
    volume = "21",
    pages = "1669--1682",
    journal = "Wireless networks",
    issn = "1022-0038",
    publisher = "Springer",
    number = "5",

    }

    OPS: Opportunistic pipeline scheduling in long-strip wireless sensor networks with unreliable links. / Guo, Peng; Meratnia, Nirvana; Havinga, Paul J.M.; Jiang, He; Zhang, Kui.

    In: Wireless networks, Vol. 21, No. 5, 12.07.2015, p. 1669-1682.

    Research output: Contribution to journalArticleAcademicpeer-review

    TY - JOUR

    T1 - OPS: Opportunistic pipeline scheduling in long-strip wireless sensor networks with unreliable links

    AU - Guo, Peng

    AU - Meratnia, Nirvana

    AU - Havinga, Paul J.M.

    AU - Jiang, He

    AU - Zhang, Kui

    N1 - eemcs-eprint-25676

    PY - 2015/7/12

    Y1 - 2015/7/12

    N2 - Being deployed in narrow but long area, strip wireless sensor networks (SWSNs) have drawn much attention in applications such as coal mines, pipeline and structure monitoring. One of typical characteristics of SWSNs is the large hop counts, which leads to long end-to-end delivery delay in low-duty-cycle SWSNs. To reduce the delay, pipeline scheduling is a promising technique, which assigns sensor nodes sequential active time slots along the data forwarding path. However, pipeline scheduling is prone to failure when communication links are unreliable. In this paper, we propose an opportunistic pipeline scheduling algorithm (OPS) for SWSNs, based on the observation that sensor nodes in SWSNs can overhear data transmissions passing by them. OPS exploits nodes outside the data forwarding path to opportunistically provide links when transmission failure happens, and hence maintains the pipeline forwarding instead of retransmission in the next duty cycle. Theoretical calculation shows that the expectation delay of OPS is always smaller than that of existing methods when the link quality is <100 %. Both extensive simulations and experiments are conducted. The results verify that the average end-to-end delivery delay of OPS is usually <60 % of that of existing methods, while the energy cost is almost the same.

    AB - Being deployed in narrow but long area, strip wireless sensor networks (SWSNs) have drawn much attention in applications such as coal mines, pipeline and structure monitoring. One of typical characteristics of SWSNs is the large hop counts, which leads to long end-to-end delivery delay in low-duty-cycle SWSNs. To reduce the delay, pipeline scheduling is a promising technique, which assigns sensor nodes sequential active time slots along the data forwarding path. However, pipeline scheduling is prone to failure when communication links are unreliable. In this paper, we propose an opportunistic pipeline scheduling algorithm (OPS) for SWSNs, based on the observation that sensor nodes in SWSNs can overhear data transmissions passing by them. OPS exploits nodes outside the data forwarding path to opportunistically provide links when transmission failure happens, and hence maintains the pipeline forwarding instead of retransmission in the next duty cycle. Theoretical calculation shows that the expectation delay of OPS is always smaller than that of existing methods when the link quality is <100 %. Both extensive simulations and experiments are conducted. The results verify that the average end-to-end delivery delay of OPS is usually <60 % of that of existing methods, while the energy cost is almost the same.

    KW - EWI-25676

    KW - IR-94399

    KW - METIS-309873

    U2 - 10.1007/s11276-014-0807-x

    DO - 10.1007/s11276-014-0807-x

    M3 - Article

    VL - 21

    SP - 1669

    EP - 1682

    JO - Wireless networks

    JF - Wireless networks

    SN - 1022-0038

    IS - 5

    ER -