Asynchronous probing scheme for the optimal energy-efficient neighbor discovery in opportunistic networking

Dongmin Yang; Jongmin Shin; Jeonggyu Kim; Cheeha Kim

doi:10.1109/PERCOM.2009.4912789

Asynchronous probing scheme for the optimal energy-efficient neighbor discovery in opportunistic networking

Dongmin Yang^*
, Jongmin Shin
, Jeonggyu Kim
, Cheeha Kim

^*Corresponding author for this work

Graduate School of Archives and Records Management

Pohang University of Science and Technology

Research output: Contribution to conference › Conference paper › peer-review

12 Scopus citations

Abstract

In opportunistic networking, it is hard to predict when a node gets and how long it keeps in contact with another. The persistent probing for prompt neighbor discovery consumes too much energy for battery-operated devices to afford. The most important issue is to carefully manage the power states at all stages of network operations. For the problem consisting of one sender and one receiver, we have presented a novel neighbor discovery scheme which is optimal in a sense that it does not miss a contact with the minimum energy consumed. In this paper, we extend the previous result to the optimal neighbor discovery scheme for the general case.

Original language	English
Title of host publication	7th Annual IEEE International Conference on Pervasive Computing and Communications, PerCom 2009
Publisher	IEEE Computer Society
ISBN (Print)	9781424433049
DOIs	https://doi.org/10.1109/PERCOM.2009.4912789
State	Published - 2009
Event	7th Annual IEEE International Conference on Pervasive Computing and Communications, PerCom 2009 - Galveston, TX, United States Duration: 2009.03.9 → 2009.03.13

Publication series

Name	7th Annual IEEE International Conference on Pervasive Computing and Communications, PerCom 2009

Conference

Conference	7th Annual IEEE International Conference on Pervasive Computing and Communications, PerCom 2009
Country/Territory	United States
City	Galveston, TX
Period	09.03.9 → 09.03.13

Access to Document

10.1109/PERCOM.2009.4912789

Cite this

Yang, D., Shin, J., Kim, J., & Kim, C. (2009). Asynchronous probing scheme for the optimal energy-efficient neighbor discovery in opportunistic networking. In 7th Annual IEEE International Conference on Pervasive Computing and Communications, PerCom 2009 Article 4912789 (7th Annual IEEE International Conference on Pervasive Computing and Communications, PerCom 2009). IEEE Computer Society. https://doi.org/10.1109/PERCOM.2009.4912789

Yang, Dongmin ; Shin, Jongmin ; Kim, Jeonggyu et al. / Asynchronous probing scheme for the optimal energy-efficient neighbor discovery in opportunistic networking. 7th Annual IEEE International Conference on Pervasive Computing and Communications, PerCom 2009. IEEE Computer Society, 2009. (7th Annual IEEE International Conference on Pervasive Computing and Communications, PerCom 2009).

@inproceedings{5b9c47ad36d5435aa2fb705f5cab261e,

title = "Asynchronous probing scheme for the optimal energy-efficient neighbor discovery in opportunistic networking",

abstract = "In opportunistic networking, it is hard to predict when a node gets and how long it keeps in contact with another. The persistent probing for prompt neighbor discovery consumes too much energy for battery-operated devices to afford. The most important issue is to carefully manage the power states at all stages of network operations. For the problem consisting of one sender and one receiver, we have presented a novel neighbor discovery scheme which is optimal in a sense that it does not miss a contact with the minimum energy consumed. In this paper, we extend the previous result to the optimal neighbor discovery scheme for the general case.",

author = "Dongmin Yang and Jongmin Shin and Jeonggyu Kim and Cheeha Kim",

year = "2009",

doi = "10.1109/PERCOM.2009.4912789",

language = "English",

isbn = "9781424433049",

series = "7th Annual IEEE International Conference on Pervasive Computing and Communications, PerCom 2009",

publisher = "IEEE Computer Society",

booktitle = "7th Annual IEEE International Conference on Pervasive Computing and Communications, PerCom 2009",

note = "7th Annual IEEE International Conference on Pervasive Computing and Communications, PerCom 2009 ; Conference date: 09-03-2009 Through 13-03-2009",

}

Yang, D, Shin, J, Kim, J & Kim, C 2009, Asynchronous probing scheme for the optimal energy-efficient neighbor discovery in opportunistic networking. in 7th Annual IEEE International Conference on Pervasive Computing and Communications, PerCom 2009., 4912789, 7th Annual IEEE International Conference on Pervasive Computing and Communications, PerCom 2009, IEEE Computer Society, 7th Annual IEEE International Conference on Pervasive Computing and Communications, PerCom 2009, Galveston, TX, United States, 09.03.9. https://doi.org/10.1109/PERCOM.2009.4912789

Asynchronous probing scheme for the optimal energy-efficient neighbor discovery in opportunistic networking. / Yang, Dongmin; Shin, Jongmin; Kim, Jeonggyu et al.
7th Annual IEEE International Conference on Pervasive Computing and Communications, PerCom 2009. IEEE Computer Society, 2009. 4912789 (7th Annual IEEE International Conference on Pervasive Computing and Communications, PerCom 2009).

Research output: Contribution to conference › Conference paper › peer-review

TY - GEN

T1 - Asynchronous probing scheme for the optimal energy-efficient neighbor discovery in opportunistic networking

AU - Yang, Dongmin

AU - Shin, Jongmin

AU - Kim, Jeonggyu

AU - Kim, Cheeha

PY - 2009

Y1 - 2009

N2 - In opportunistic networking, it is hard to predict when a node gets and how long it keeps in contact with another. The persistent probing for prompt neighbor discovery consumes too much energy for battery-operated devices to afford. The most important issue is to carefully manage the power states at all stages of network operations. For the problem consisting of one sender and one receiver, we have presented a novel neighbor discovery scheme which is optimal in a sense that it does not miss a contact with the minimum energy consumed. In this paper, we extend the previous result to the optimal neighbor discovery scheme for the general case.

AB - In opportunistic networking, it is hard to predict when a node gets and how long it keeps in contact with another. The persistent probing for prompt neighbor discovery consumes too much energy for battery-operated devices to afford. The most important issue is to carefully manage the power states at all stages of network operations. For the problem consisting of one sender and one receiver, we have presented a novel neighbor discovery scheme which is optimal in a sense that it does not miss a contact with the minimum energy consumed. In this paper, we extend the previous result to the optimal neighbor discovery scheme for the general case.

UR - https://www.scopus.com/pages/publications/70349335699

U2 - 10.1109/PERCOM.2009.4912789

DO - 10.1109/PERCOM.2009.4912789

M3 - Conference paper

AN - SCOPUS:70349335699

SN - 9781424433049

T3 - 7th Annual IEEE International Conference on Pervasive Computing and Communications, PerCom 2009

BT - 7th Annual IEEE International Conference on Pervasive Computing and Communications, PerCom 2009

PB - IEEE Computer Society

T2 - 7th Annual IEEE International Conference on Pervasive Computing and Communications, PerCom 2009

Y2 - 9 March 2009 through 13 March 2009

ER -

Yang D, Shin J, Kim J, Kim C. Asynchronous probing scheme for the optimal energy-efficient neighbor discovery in opportunistic networking. In 7th Annual IEEE International Conference on Pervasive Computing and Communications, PerCom 2009. IEEE Computer Society. 2009. 4912789. (7th Annual IEEE International Conference on Pervasive Computing and Communications, PerCom 2009). doi: 10.1109/PERCOM.2009.4912789

Asynchronous probing scheme for the optimal energy-efficient neighbor discovery in opportunistic networking

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this