Energy-efficient communication

Understanding the distribution of runs in binary strings

Koushik Sinha, Bhabani P. Sinha

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

Abstract

With the increasing use of wireless sensor networks (WSNs) in diverse applications where data to be communicated can range from few bytes of raw data to multimedia, the need for designing energy-efficient communication has attained paramount importance to increase the operational lifetime of such WSNs. Related to this issue, it is essential to understand the distribution of runs of 1's and 0's in the data to be transmitted, so that suitable communication techniques can be designed. Such a knowledge would also help in analyzing and comparing the performances of different energy-efficient communication techniques for a specific WSN application. In this paper, we derive a recurrence relation for expressing N k, the total number of occurrences of runs of 1's of length k, 1≤k≤n, in all possible binary strings of length n. Due to symmetry, N k is also the total number of occurrences of runs of 0's of length k, 1≤k≤n. We show that N n = 1, N n-1 = 2 and N n-k = (k + 3)2 k-2, for k≥2.

Original languageEnglish
Title of host publication2012 1st International Conference on Recent Advances in Information Technology, RAIT-2012
Pages177-181
Number of pages5
DOIs
Publication statusPublished - 24 May 2012
Externally publishedYes
Event2012 1st International Conference on Recent Advances in Information Technology, RAIT-2012 - Dhanbad, India
Duration: 15 Mar 201217 Mar 2012

Other

Other2012 1st International Conference on Recent Advances in Information Technology, RAIT-2012
CountryIndia
CityDhanbad
Period15/3/1217/3/12

Fingerprint

Wireless sensor networks
Communication

Keywords

  • Bernoulli's trial
  • combinatorial problems
  • energy-efficient communication
  • run distribution
  • run statistics
  • Wireless sensor networks

ASJC Scopus subject areas

  • Information Systems

Cite this

Sinha, K., & Sinha, B. P. (2012). Energy-efficient communication: Understanding the distribution of runs in binary strings. In 2012 1st International Conference on Recent Advances in Information Technology, RAIT-2012 (pp. 177-181). [6194501] https://doi.org/10.1109/RAIT.2012.6194501

Energy-efficient communication : Understanding the distribution of runs in binary strings. / Sinha, Koushik; Sinha, Bhabani P.

2012 1st International Conference on Recent Advances in Information Technology, RAIT-2012. 2012. p. 177-181 6194501.

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

Sinha, K & Sinha, BP 2012, Energy-efficient communication: Understanding the distribution of runs in binary strings. in 2012 1st International Conference on Recent Advances in Information Technology, RAIT-2012., 6194501, pp. 177-181, 2012 1st International Conference on Recent Advances in Information Technology, RAIT-2012, Dhanbad, India, 15/3/12. https://doi.org/10.1109/RAIT.2012.6194501
Sinha K, Sinha BP. Energy-efficient communication: Understanding the distribution of runs in binary strings. In 2012 1st International Conference on Recent Advances in Information Technology, RAIT-2012. 2012. p. 177-181. 6194501 https://doi.org/10.1109/RAIT.2012.6194501
Sinha, Koushik ; Sinha, Bhabani P. / Energy-efficient communication : Understanding the distribution of runs in binary strings. 2012 1st International Conference on Recent Advances in Information Technology, RAIT-2012. 2012. pp. 177-181
@inproceedings{578c81af27654b51a6185ae7e88a0e6b,
title = "Energy-efficient communication: Understanding the distribution of runs in binary strings",
abstract = "With the increasing use of wireless sensor networks (WSNs) in diverse applications where data to be communicated can range from few bytes of raw data to multimedia, the need for designing energy-efficient communication has attained paramount importance to increase the operational lifetime of such WSNs. Related to this issue, it is essential to understand the distribution of runs of 1's and 0's in the data to be transmitted, so that suitable communication techniques can be designed. Such a knowledge would also help in analyzing and comparing the performances of different energy-efficient communication techniques for a specific WSN application. In this paper, we derive a recurrence relation for expressing N k, the total number of occurrences of runs of 1's of length k, 1≤k≤n, in all possible binary strings of length n. Due to symmetry, N k is also the total number of occurrences of runs of 0's of length k, 1≤k≤n. We show that N n = 1, N n-1 = 2 and N n-k = (k + 3)2 k-2, for k≥2.",
keywords = "Bernoulli's trial, combinatorial problems, energy-efficient communication, run distribution, run statistics, Wireless sensor networks",
author = "Koushik Sinha and Sinha, {Bhabani P.}",
year = "2012",
month = "5",
day = "24",
doi = "10.1109/RAIT.2012.6194501",
language = "English",
isbn = "9781457706974",
pages = "177--181",
booktitle = "2012 1st International Conference on Recent Advances in Information Technology, RAIT-2012",

}

TY - GEN

T1 - Energy-efficient communication

T2 - Understanding the distribution of runs in binary strings

AU - Sinha, Koushik

AU - Sinha, Bhabani P.

PY - 2012/5/24

Y1 - 2012/5/24

N2 - With the increasing use of wireless sensor networks (WSNs) in diverse applications where data to be communicated can range from few bytes of raw data to multimedia, the need for designing energy-efficient communication has attained paramount importance to increase the operational lifetime of such WSNs. Related to this issue, it is essential to understand the distribution of runs of 1's and 0's in the data to be transmitted, so that suitable communication techniques can be designed. Such a knowledge would also help in analyzing and comparing the performances of different energy-efficient communication techniques for a specific WSN application. In this paper, we derive a recurrence relation for expressing N k, the total number of occurrences of runs of 1's of length k, 1≤k≤n, in all possible binary strings of length n. Due to symmetry, N k is also the total number of occurrences of runs of 0's of length k, 1≤k≤n. We show that N n = 1, N n-1 = 2 and N n-k = (k + 3)2 k-2, for k≥2.

AB - With the increasing use of wireless sensor networks (WSNs) in diverse applications where data to be communicated can range from few bytes of raw data to multimedia, the need for designing energy-efficient communication has attained paramount importance to increase the operational lifetime of such WSNs. Related to this issue, it is essential to understand the distribution of runs of 1's and 0's in the data to be transmitted, so that suitable communication techniques can be designed. Such a knowledge would also help in analyzing and comparing the performances of different energy-efficient communication techniques for a specific WSN application. In this paper, we derive a recurrence relation for expressing N k, the total number of occurrences of runs of 1's of length k, 1≤k≤n, in all possible binary strings of length n. Due to symmetry, N k is also the total number of occurrences of runs of 0's of length k, 1≤k≤n. We show that N n = 1, N n-1 = 2 and N n-k = (k + 3)2 k-2, for k≥2.

KW - Bernoulli's trial

KW - combinatorial problems

KW - energy-efficient communication

KW - run distribution

KW - run statistics

KW - Wireless sensor networks

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

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

U2 - 10.1109/RAIT.2012.6194501

DO - 10.1109/RAIT.2012.6194501

M3 - Conference contribution

SN - 9781457706974

SP - 177

EP - 181

BT - 2012 1st International Conference on Recent Advances in Information Technology, RAIT-2012

ER -