Efficient tree based code dissemination and search protocol for small subset of sensors

Hiromu Asahina, Iwao Sasase, Hisao Yamamoto

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

1 Citation (Scopus)

Abstract

Code dissemination is an important and challenging task in wireless sensor networks (WSNs). Although there are a lot of dissemination protocols, the situation where small subset of nodes requires the code, such as a WSN shared among multiple users, is not considered. Some prior works have proposed dissemination protocols using high power sensors or clustering to enable efficient dissemination for a small subset of sensors with low transmission cost. However, the high power sensors or cluster heads incur the congestion around or between these nodes and the increase of the energy consumption. In this paper, we propose an efficient tree-based code dissemination and search protocol which enables to disseminate a code to small subsets without high power sensors and cluster heads. The protocol is based on an idea that the source only disseminates the code along the route in which the largest number of destinations are located and the rest of destinations obtains the code from the former destinations. Since the most of destinations obtains the code along a single route and a destination has the way to obtain the code by itself, energy consumption is mitigated and 100% packet receive ratio is guaranteed. We employ a standard routing protocol RPL (Routing Protocol for Low-Power and Lossy Networks) for the base of our proposed scheme. We evaluate the proposed scheme and compare with two conventional schemes which enable the dissemination for small subset of sensors. Our simulations show that our proposed scheme reduces the transmission count by 80% and enables to avoid the congestion compared with the conventional schemes.

Original languageEnglish
Title of host publication2017 IEEE International Conference on Communications Workshops, ICC Workshops 2017
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages283-288
Number of pages6
ISBN (Electronic)9781509015252
DOIs
Publication statusPublished - 2017 Jun 29
Event2017 IEEE International Conference on Communications Workshops, ICC Workshops 2017 - Paris, France
Duration: 2017 May 212017 May 25

Other

Other2017 IEEE International Conference on Communications Workshops, ICC Workshops 2017
CountryFrance
CityParis
Period17/5/2117/5/25

Fingerprint

Network protocols
Sensors
Routing protocols
Wireless sensor networks
Energy utilization
Costs

Keywords

  • Code dissemination
  • RPL
  • Wireless reprogramming
  • Wireless sensor networks

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Hardware and Architecture

Cite this

Asahina, H., Sasase, I., & Yamamoto, H. (2017). Efficient tree based code dissemination and search protocol for small subset of sensors. In 2017 IEEE International Conference on Communications Workshops, ICC Workshops 2017 (pp. 283-288). [7962671] Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ICCW.2017.7962671

Efficient tree based code dissemination and search protocol for small subset of sensors. / Asahina, Hiromu; Sasase, Iwao; Yamamoto, Hisao.

2017 IEEE International Conference on Communications Workshops, ICC Workshops 2017. Institute of Electrical and Electronics Engineers Inc., 2017. p. 283-288 7962671.

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

Asahina, H, Sasase, I & Yamamoto, H 2017, Efficient tree based code dissemination and search protocol for small subset of sensors. in 2017 IEEE International Conference on Communications Workshops, ICC Workshops 2017., 7962671, Institute of Electrical and Electronics Engineers Inc., pp. 283-288, 2017 IEEE International Conference on Communications Workshops, ICC Workshops 2017, Paris, France, 17/5/21. https://doi.org/10.1109/ICCW.2017.7962671
Asahina H, Sasase I, Yamamoto H. Efficient tree based code dissemination and search protocol for small subset of sensors. In 2017 IEEE International Conference on Communications Workshops, ICC Workshops 2017. Institute of Electrical and Electronics Engineers Inc. 2017. p. 283-288. 7962671 https://doi.org/10.1109/ICCW.2017.7962671
Asahina, Hiromu ; Sasase, Iwao ; Yamamoto, Hisao. / Efficient tree based code dissemination and search protocol for small subset of sensors. 2017 IEEE International Conference on Communications Workshops, ICC Workshops 2017. Institute of Electrical and Electronics Engineers Inc., 2017. pp. 283-288
@inproceedings{3c0cebc23b0f41a19eab57d11b038bab,
title = "Efficient tree based code dissemination and search protocol for small subset of sensors",
abstract = "Code dissemination is an important and challenging task in wireless sensor networks (WSNs). Although there are a lot of dissemination protocols, the situation where small subset of nodes requires the code, such as a WSN shared among multiple users, is not considered. Some prior works have proposed dissemination protocols using high power sensors or clustering to enable efficient dissemination for a small subset of sensors with low transmission cost. However, the high power sensors or cluster heads incur the congestion around or between these nodes and the increase of the energy consumption. In this paper, we propose an efficient tree-based code dissemination and search protocol which enables to disseminate a code to small subsets without high power sensors and cluster heads. The protocol is based on an idea that the source only disseminates the code along the route in which the largest number of destinations are located and the rest of destinations obtains the code from the former destinations. Since the most of destinations obtains the code along a single route and a destination has the way to obtain the code by itself, energy consumption is mitigated and 100{\%} packet receive ratio is guaranteed. We employ a standard routing protocol RPL (Routing Protocol for Low-Power and Lossy Networks) for the base of our proposed scheme. We evaluate the proposed scheme and compare with two conventional schemes which enable the dissemination for small subset of sensors. Our simulations show that our proposed scheme reduces the transmission count by 80{\%} and enables to avoid the congestion compared with the conventional schemes.",
keywords = "Code dissemination, RPL, Wireless reprogramming, Wireless sensor networks",
author = "Hiromu Asahina and Iwao Sasase and Hisao Yamamoto",
year = "2017",
month = "6",
day = "29",
doi = "10.1109/ICCW.2017.7962671",
language = "English",
pages = "283--288",
booktitle = "2017 IEEE International Conference on Communications Workshops, ICC Workshops 2017",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - GEN

T1 - Efficient tree based code dissemination and search protocol for small subset of sensors

AU - Asahina, Hiromu

AU - Sasase, Iwao

AU - Yamamoto, Hisao

PY - 2017/6/29

Y1 - 2017/6/29

N2 - Code dissemination is an important and challenging task in wireless sensor networks (WSNs). Although there are a lot of dissemination protocols, the situation where small subset of nodes requires the code, such as a WSN shared among multiple users, is not considered. Some prior works have proposed dissemination protocols using high power sensors or clustering to enable efficient dissemination for a small subset of sensors with low transmission cost. However, the high power sensors or cluster heads incur the congestion around or between these nodes and the increase of the energy consumption. In this paper, we propose an efficient tree-based code dissemination and search protocol which enables to disseminate a code to small subsets without high power sensors and cluster heads. The protocol is based on an idea that the source only disseminates the code along the route in which the largest number of destinations are located and the rest of destinations obtains the code from the former destinations. Since the most of destinations obtains the code along a single route and a destination has the way to obtain the code by itself, energy consumption is mitigated and 100% packet receive ratio is guaranteed. We employ a standard routing protocol RPL (Routing Protocol for Low-Power and Lossy Networks) for the base of our proposed scheme. We evaluate the proposed scheme and compare with two conventional schemes which enable the dissemination for small subset of sensors. Our simulations show that our proposed scheme reduces the transmission count by 80% and enables to avoid the congestion compared with the conventional schemes.

AB - Code dissemination is an important and challenging task in wireless sensor networks (WSNs). Although there are a lot of dissemination protocols, the situation where small subset of nodes requires the code, such as a WSN shared among multiple users, is not considered. Some prior works have proposed dissemination protocols using high power sensors or clustering to enable efficient dissemination for a small subset of sensors with low transmission cost. However, the high power sensors or cluster heads incur the congestion around or between these nodes and the increase of the energy consumption. In this paper, we propose an efficient tree-based code dissemination and search protocol which enables to disseminate a code to small subsets without high power sensors and cluster heads. The protocol is based on an idea that the source only disseminates the code along the route in which the largest number of destinations are located and the rest of destinations obtains the code from the former destinations. Since the most of destinations obtains the code along a single route and a destination has the way to obtain the code by itself, energy consumption is mitigated and 100% packet receive ratio is guaranteed. We employ a standard routing protocol RPL (Routing Protocol for Low-Power and Lossy Networks) for the base of our proposed scheme. We evaluate the proposed scheme and compare with two conventional schemes which enable the dissemination for small subset of sensors. Our simulations show that our proposed scheme reduces the transmission count by 80% and enables to avoid the congestion compared with the conventional schemes.

KW - Code dissemination

KW - RPL

KW - Wireless reprogramming

KW - Wireless sensor networks

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

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

U2 - 10.1109/ICCW.2017.7962671

DO - 10.1109/ICCW.2017.7962671

M3 - Conference contribution

SP - 283

EP - 288

BT - 2017 IEEE International Conference on Communications Workshops, ICC Workshops 2017

PB - Institute of Electrical and Electronics Engineers Inc.

ER -