LOGIN TO YOUR ACCOUNT

Username
Password
Remember Me
Or use your Academic/Social account:

CREATE AN ACCOUNT

Or use your Academic/Social account:

Congratulations!

You have just completed your registration at OpenAire.

Before you can login to the site, you will need to activate your account. An e-mail will be sent to you with the proper instructions.

Important!

Please note that this site is currently undergoing Beta testing.
Any new content you create is not guaranteed to be present to the final version of the site upon release.

Thank you for your patience,
OpenAire Dev Team.

Close This Message

CREATE AN ACCOUNT

Name:
Username:
Password:
Verify Password:
E-mail:
Verify E-mail:
*All Fields Are Required.
Please Verify You Are Human:
fbtwitterlinkedinvimeoflicker grey 14rssslideshare1
Qureshi, H. K.; Rizvi, S.; Saleem, M.; Khayam, S. A.; Rakocevic, V.; Rajarajan, M. (2013)
Publisher: Kluwer
Languages: English
Types: Article
Subjects: QA75
The connected dominating set (CDS) principle has emerged as the predominant method for energy-efficient discovery and clustering of power-/location-unaware WSN nodes. While many CDS discovery protocols have been proposed recently, a one-to-one comparative evaluation of these protocols has not been performed on judicious metrics. In this paper, we perform a simulation-based evaluation of three prominent CDS based protocols (CDS Rule K, EECDS and A3) on the basis of message and energy overhead, residual energy, number of unconnected nodes, and convergence time. Our analysis shows that the protocols’ performances vary significantly with different maintenance techniques and none of the existing protocols can outperform the others on all metrics. Based on this result, we identify some performance-improving guidelines for CDS-based topology discovery and utilize them to propose a new protocol, clique-based CDS discovery (CCDS). We show that CCDS provides considerably better performance than existing protocols in most operational scenarios.
  • The results below are discovered through our pilot algorithms. Let us know how we are doing!

    • [1] P. J. Wan, K. M. Alzoubi, and O. Frieder, “Distributed Construction of Connected Dominating Sets in Wireless Ad Hoc Networks,” IEEE INFOCOM, 2002.
    • [2] J. Wu and H. Li, “On calculating connected dominating set for efficient routing in ad hoc wireless networks,” In Proceedings of the ACM international Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications, pp. 7-14, 1999.
    • [3] J. Wu and F. Dai, “An extended localized algorithm for connected dominating set formation in ad hoc wireless networks,” In Proceedings of the IEEE Transactions on Parallel and Distributed Systems, pages 908-920, 2004.
    • [4] H. Yanxiang and Z. Yuanyuan, “Topology Control in Wireless Sensor Networks with Interference Consideration,” Springer Lecture Notes in Control and Information Sciences, vol. 344, pp. 202-206, October, 2006.
    • [5] R. Ramanathan and R. Rosales-Hain, “Topology control of Multihop Wireless Networks Using Transmit Power adjustment,” IEEE Infocom, pp. 404-413, 2000.
    • [6] V. Rodoplu and T. H. Meng, “Minimum Energy Mobile Wireless Networks,” IEEE J. Selected Areas in Comm., vol. 17(8), pp. 1333-1344, August, 1999.
    • [7] D. J. Baker and A. Ephremides, “The architectural organization of a mobile radio network via a distributed algorithm,” IEEE Transactions on Communications, pp. 1694-1701, 1981.
    • [8] M. Gerla and J. T. Tsai, “Multicluster mobile multimedia radio network,“ ACM Wireless Networks, vol. 1(3), pp. 255-265, 1995.
    • [9] J. Wu, M. Cardei, F. Dai, and S. Yang, “Extended dominating set and its applications in ad hoc networks using cooperative communication,” IEEE Trans. on Parallel and Distributed Systems, vol. 17(8), pp. 851- 864, 2006.
    • [10] Z. Yuanyuan, X. Jia, and H. Yanxiang, “Energy efficient distributed connected dominating sets construction in wireless sensor networks,” In Proceedings of the ACM International Conference on Communications and Mobile Computing, pp. 797-802, 2006.
    • [11] P. M. Wightman and M. A. Labrador, “A3: A Topology Construction Algorithm for Wireless Sensor Network,” Proc. IEEE Globecom, 2008.
    • [12] P. M. Wightman and M. A. Labrador, “Atarraya: A Simulation Tool to Teach and Research Topology Control Algorithms for Wireless Sensor Networks,” Create-Net 2nd International Conference on Simulation Tools and Techniq, SIMUTools, 2009.
    • [13] Y. Xu, J. Heidemann, and D. Estrin, “Adaptive Energy-Conserving Routing for Multihop Ad Hoc Networks,” Research Report 527, USC/Information Sciences Institute, October, 2000.
    • [14] Y. Xu, J. Heidemann, and D. Estrin, “Geography-informed Energy Conservation for Ad Hoc Routing,” In Proceedings of the 7th Annual International Conference on Mobile Computing and Networking, pp. 70-84, 2001.
    • [15] B. Chen, K. Jamieson, H. Balakrishnan, and R. Morris, “Span: An Energy-Efficient Coordination Algorithm for Topology Maintenance in Ad Hoc Wireless Networks,” Wireless Networks, vol. 8(5), pp. 481-494, 2002.
    • [16] R. Iyengar, K. Kar, and S. Banerjee, “Low-coordination Topologies for Redundancy in Sensor Networks,” In Proceedings of the 6th ACM International Symposium on Mobile Ad Hoc Networking and Computing, pp. 332-342, 2005.
    • [17] W. B. Heinzelman, A. P. Chandrakasan, and H. Balakrishnan, “EnergyEfficient Communication Protocol for Wireless Microsensor Networks,” In Proceedings of 33rd Hawaii International Conference on System Sciences, January, 2000.
    • [18] H. K. Qureshi, S. Rizvi, M. Saleem, S. A. Khayam, V. Rakocevic, and M. Rajarajan, “An Energy Efficient Clique-based CDS Discovery Protocol for Wireless Sensor Networks,” accepted at 44th Annual conference on Information Sciences and Systems(CISS), March, 2010.
  • No related research data.
  • Discovered through pilot similarity algorithms. Send us your feedback.

Share - Bookmark

Cite this article