MND: An information of detected neighbors based multi-channel neighbor discovery protocol for wireless sensor networks

2Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Multi-channel neighbor discovery protocol based on information of detected neighbors for wireless sensor networks is proposed in this paper, called MND. To make sure that the discovery among nodes is as quick as possible, MND uses the schedule mechanism in which the nodes compute the potential neighbors set so as to calculate the sleep and wake schedule of the node. To minimize the influence of channel conflict to the performance, MND uses multi-channel mechanism and calculates the required total number of channels according to the duty cycle and network density. Through analysis, we can get how to choose the total number of channels for each node and the fact that the common neighbor node of the neighbors of a node is the neighbor of this node in a large probability. The simulation and test-bed experiment results show the discovery rate and discovery latency of MND is higher and lower, respectively. © 2013 Springer-Verlag.

Author supplied keywords

Cite

CITATION STYLE

APA

Li, J., Wang, Z., Yao, L., & Guo, L. (2013). MND: An information of detected neighbors based multi-channel neighbor discovery protocol for wireless sensor networks. In Communications in Computer and Information Science (Vol. 334 CCIS, pp. 167–180). Springer Verlag. https://doi.org/10.1007/978-3-642-36252-1_16

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free