Aby K. Thomas, R. Devanathan



Novel DLQ Algorithm for Energy Constrained Network Discovery in WSN

pdf PDF


Hausdorff distance, Link quality indicator, Cluster head scheduling, multi-level hierarchy, Network lifetime, Residual energy, duty cycle


Neighbor discovery is the determination of all nodes in the network that can communicate with a given node. Routing typically begins with neighbour discovery. Discovering neighbours should be both quick as well as energy efficient. Many algorithms which mostly work at a protocol level had been developed for neighbour discovery. Here a new method for neighbour node discovery that maximizes network lifetime is proposed. The basic idea accounts for clustering using Hausdorff distance and selecting wireless links having good link quality for routing packets .The nodes form clusters based on the Hausdorff distance .The clusters are formed only once but the role of cluster head is rotated among the cluster members .After cluster formation , the wireless link quality and minimum Hausdorff distance is checked for inter cluster communication. The link having better reliability is selected which minimizes the retransmissions and manages energy. Re-clustering is done when the energy of cluster head falls below particular threshold energy.



[1] C. Diallo, M. Marot, and M. Becker,“SingleNode Cluster reduction in WSN and EnergyEfficiency during Cluster Formation.AdHoc Networking Workshop (Med-Hoc-Net), 2010, Juan LesPins, France.

[2] Daniel .P.Huttenlocher , Gregory .A. Klanderman and William .J.Rucklidge, “Comparing Images Using the Hausdorff distance,” IEEE Trans. Pattern analysis and Machine Intelligence, Vol15 , no.9 , pp.850-863, sept 1993.

[3] O Younis and S Fahmy , “HEED:A Hybrid Energy Efficient Distributed Clustering Approach for ad-hoc Sensor networks,” IEEE Trans Mobile Computing, vol.3, no.4, pp. 366-3796 Oct –Dec 2004.

[4] S Bandhyopadhyay and E Coyle, “An Energy – Efficient Hierarchical Clustering Algorithm for WSN” Proc. IEEE INFOCOM, pp 1713- 1723, April.2003

[5] S. Vasudevan, J. Kurose, D. Towsley, “On neighbor discovery in wireless networks with directional antennas”, INFOCOM 2005, Vol. 4, pp. 2502–2512, March 2005.

[6] T. Narten, “Neighbor discovery and stateless auto-configuration in IPv6”, IEEE Internet Computing, Vol. 3, Issue 4, pp. 54–62, July-Aug. 1999. FLEX Chip Signal Processor (MC68175/D), Motorola, 1996.

[7] W Heinzelman, A Chandrakasan, and H.Balakrishnan, "An Application Specific Protocol Architecture for WSN,” IEEE Trans Wireless Comm, vol 1, no 4, pp.660-670, october 2002.

[8] Xiaorong Zhu, LianfengShen, and Tak-Shing Peter Yum, Senior Member, IEEE, , “Hausdorff Clustering and Minimum Energy Routing for Wireless Sensor Networks”, IEEE Transactions on Vehicular Technology, vol. 58, no. 2 February 2009.

[9] Venkatraman Iyer, Andrei Pruteanu, Stefan Dulman, “Neighborhood Discovery in Wireless Networks Using Adaptive Beacons” IEEE International Conference on Self-Adaptive and Self-Organizing Systems, SASO’11 Proceedings, pp. 31-40.

[10] Z. Zhang, “Performance of neighbor discovery algorithms in mobile ad hoc self-configuring networks with directional antennas,” IEEE MILCOM, Atlantic City, NJ, October 2005 [11] S. Banerjee and S. Khuller, A clustering scheme for hierarchical control in multi-hop wireless networks, in Proceedings of 20th Joint Conference of the IEEE Computer and Communications Societies (INFOCOMŠ 01), Anchorage, AK, April 2001.

[12] Holger Karl and Andreas willing Protocols and architecture for wireless sensor networks, John Wiley and Sons Ltd.

[13] J. Luo and D. Guo. Neighbor discovery in wireless ad hoc networks based on group testing. In Communication, Control, and Computing, 2008 46th Annual Allerton Conference on, pp.791-797. IEEE, 2008.

[14] J. Luo and D. Guo. Compressed neighbor discovery for wireless ad hoc networks: the Rayleigh fading case. In Communication, Control, and Computing, 2009. Allerton 2009. 47th Annual Allerton Conference on, pp.308-313. IEEE, 2009.

[15] M. McGlynn and S. Borbash. Birthday protocols for low energy deployment and flexible neighbor discovery in ad hoc wireless networks. In Proceedings of the 2nd ACM international symposium on Mobile adhoc networking & computing, pp.137–145. ACM, 2001.

[16] S. Vasudevan, D. Towsley, D. Goeckel, and R. Khalili. Neighbor discovery in wireless networks and the coupon collector’s problem. In Proceedings of the 15th annual international conference on Mobilecomputing and networking, pp. 181–192. ACM, 2009.

[17] A. Keshavarzian, E.Uysal-Biyikoglu, F. Herrmann, and A. Manjeshwar. Energy-efficient link assessment in wireless sensor networks. In INFOCOM2004. Twenty-third Annual Joint Conference of the IEEE Computer and Communications Societies, vol.3, pp.1751–1761, IEEE, 2004

Cite this paper

Aby K. Thomas, R. Devanathan. (2016) Novel DLQ Algorithm for Energy Constrained Network Discovery in WSN. International Journal of Communications, 1, 67-74


Copyright © 2017 Author(s) retain the copyright of this article.
This article is published under the terms of the Creative Commons Attribution License 4.0