By Topic

Efficient node numbering for cost effective K fault tolerant wireless network

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Ansari, A.Q. ; Dept. of Electr. Eng., Jamia Millia Islamia, New Delhi, India ; Dabas, M. ; Gupta, K.D.

The reliability of any wireless communication network is considered as one of the key issue in designing network topology. Geographical locations of nodes play a crucial role in the cost of the network. The topological design of any communication network needs to realize a specified performance at minimal cost. This paper focuses on various approaches of numbering nodes in a topology design and analyses their performance for a range of networks. The paper proposes an efficient node numbering considering technique parallel organization for designing a cost effective K-connected wireless network which eventually guarantees (K-1) fault tolerance.

Published in:

Computer Science and Information Technology (ICCSIT), 2010 3rd IEEE International Conference on  (Volume:7 )

Date of Conference:

9-11 July 2010