**Author details**

**Proof.** According to the degree of nodes, the nodes are arranged in decreasing

The simulation is done with test data taken from the Internet Topology Zoo Archive [13]. There are 261 topologies are available in the data set which indicates a large diversity of network structure. These data sets are gathered from different vendors of networking services. We have made a self written python script to convert Graphical Mark-up Language into adjacency list. The data set contains edge and node informations for the given topology. For a given network, capacity is considered as node value and load is considered as edge weight values. Based on the proposed method, the sink is selected in such a way that the summation of edge weight loads fewer than the total capacity of sink node. The simulation of proposed approach gives us total number of sink nodes required for given topology as shown in the **Table 1**. It is observed that the average number of sink nodes required to

**Name of the Dataset Number sink nodes**

Abilene 4 BelNet 5 UniNett 6 AtmNet 7 Sprint 3 Bell Canada 4 Garr 3 ArpaNet1990 3 Airtel 7

This chapter proposes an efficient algorithm to place the sink node for the given topological network. This algorithm reduces cost by reducing the number of the sink node being used in the network. Moreover, the placed sink node can serve a maximum number of sensor nodes. The future work is to enhance this approach

order and it takes *O n*ð Þ log *n* as the worst case complexity. The first maximum degree node is passed as input to the Algorithm 1. The same way the algorithm proceeds with the next maximum degree which is not marked and so on which takes the complexity of *O*ð Þ Δ log ð Þ Δ . The Algorithm 1 follows by taking local minimum value and adds to the global sum which satisfies the constraints. The algorithm terminates when it breaks the constraints. Thus, the algorithm produce an optimal solution. So the proposed solution takes the complexity of *O n*ð Þþ log *n*

*O n*ð Þ Δ log ð Þ Δ for identifying and assigning the sink node.

*Wireless Sensor Networks - Design, Deployment and Applications*

**6. Results and discussion**

manage the given topology is 5 � 6.

**7. Conclusion and future work**

*Number of sink nodes vs topology.*

**Table 1.**

**64**

when a sink node fails in the given topology.

Veeramani Sonai\* and Indira Bharathi Department of Computer Science and Engineering, Vignan's Foundation for Science, Technology and Research, Guntur, Andhra Pradesh, India

\*Address all correspondence to: veeramanicse@gmail.com

© 2021 The Author(s). Licensee IntechOpen. This chapter is distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/ by/3.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
