Next Article in Journal
Economic Benefits: Metrics and Methods for Landscape Performance Assessment
Next Article in Special Issue
Sustainable Load-Balancing Scheme for Inter-Sensor Convergence Processing of Routing Cooperation Topology
Previous Article in Journal
Analysis of the Relationship between China’s IPPU CO2 Emissions and the Industrial Economic Growth
Article Menu

Export Article

Open AccessArticle
Sustainability 2016, 8(5), 431; doi:10.3390/su8050431

Asymmetric Block Design-Based Neighbor Discovery Protocol in Sensor Networks

1
Department of Computer Science, Swaziland Christian University, P.O. Box A624 Swazi Plaza, Mbabane H101, Swaziland
2
Department of Computer Science & Engineering, Gangneung-Wonju National University, Wonju 220-711, Korea
*
Author to whom correspondence should be addressed.
Academic Editors: James Park, Han-Chieh Chao and Marc A. Rosen
Received: 22 March 2016 / Revised: 18 April 2016 / Accepted: 25 April 2016 / Published: 29 April 2016
(This article belongs to the Special Issue Advanced IT based Future Sustainable Computing)
View Full-Text   |   Download PDF [2204 KB, uploaded 29 April 2016]   |  

Abstract

Neighbor discovery is one of the emerging research areas in a wireless sensor network. After sensors are distributed, neighbor discovery is the first process to set up a communication channel with neighboring sensors. This paper proposes a new block design–based asymmetric neighbor discovery protocol for sensor networks. We borrow the concept of combinatorial block designs for our block combination scheme for neighbor discovery. First, we introduce an asymmetric neighbor discovery problem and define a target research question. Second, we propose a new asymmetric block design–based neighbor discovery protocol and explain how it works. Third, we analyze the worst-case neighbor discovery latency numerically between our protocol and some well-known protocols in the literature, and compare and evaluate the performance between the proposed protocol and others. Our protocol reveals that the worst-case latency is much lower than that of Disco and U-Connect. Finally, we conclude that the minimum number of slots per a neighbor schedule shows the lowest discovery time in terms of discovery latency and energy consumption. View Full-Text
Keywords: sustainable wireless sensor networks; neighbor discovery protocol; design theory; balanced incomplete block design sustainable wireless sensor networks; neighbor discovery protocol; design theory; balanced incomplete block design
Figures

Figure 1

This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. (CC BY 4.0).

Scifeed alert for new publications

Never miss any articles matching your research from any publisher
  • Get alerts for new papers matching your research
  • Find out the new papers from selected authors
  • Updated daily for 49'000+ journals and 6000+ publishers
  • Define your Scifeed now

SciFeed Share & Cite This Article

MDPI and ACS Style

Choi, S.; Yi, G. Asymmetric Block Design-Based Neighbor Discovery Protocol in Sensor Networks. Sustainability 2016, 8, 431.

Show more citation formats Show less citations formats

Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Related Articles

Article Metrics

Article Access Statistics

1

Comments

[Return to top]
Sustainability EISSN 2071-1050 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top