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

@inproceedings{citeulike:5718202, 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 = {Yang, Dongmin and Shin, Jongmin and Kim, Jeonggyu and Kim, Cheeha}, booktitle = {Pervasive Computing and Communications, 2009. PerCom 2009. IEEE International Conference on}, citeulike-article-id = {5718202}, citeulike-linkout-0 = {http://dx.doi.org/10.1109/PERCOM.2009.4912789}, citeulike-linkout-1 = {http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=4912789}, doi = {10.1109/PERCOM.2009.4912789}, journal = {Pervasive Computing and Communications, 2009. PerCom 2009. IEEE International Conference on}, keywords = {asychrnous, discovery, neighbor, network, opportunistic}, pages = {1--4}, posted-at = {2009-09-03 14:45:59}, priority = {2}, title = {Asynchronous probing scheme for the optimal energy-efficient neighbor discovery in opportunistic networking}, url = {http://dx.doi.org/10.1109/PERCOM.2009.4912789}, year = {2009} }

TY - CONF ID - citeulike:5718202 L3 - citeulike-article-id:5718202 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. JF - Pervasive Computing and Communications, 2009. PerCom 2009. IEEE International Conference on EP - 4 TI - Asynchronous probing scheme for the optimal energy-efficient neighbor discovery in opportunistic networking T2 - Pervasive Computing and Communications, 2009. PerCom 2009. IEEE International Conference on SP - 1 KW - asychrnous KW - discovery KW - neighbor KW - network KW - opportunistic AU - Yang, Dongmin AU - Shin, Jongmin AU - Kim, Jeonggyu AU - Kim, Cheeha PY - 2009/// UR - http://dx.doi.org/10.1109/PERCOM.2009.4912789 ER -