Spatial tessellations: concepts and applications of Voronoi diagrams
Spatial tessellations: concepts and applications of Voronoi diagrams
Wireless sensor networks: a survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.01 |
Due to the limited resources available to the nodes (hosts) in the ad hoc wireless networks, the network lifetime is crucial for network operations. One effective approach is to keep the distance small enough among nodes to maintain the efficient network topology. This paper concentrates on the problem of choosing locations for relay node (relay hosts) such that the distance between nodes is at most δ i.e., the range of nodes. The main contribution of this paper is an optimal algorithm for maximize network lifetime by computing the locations for additional nodes and to increase the network lifetime in terms of connectivity. The quantitative analysis showed that after the application of the algorithm, the network consumes ((1/2)n + O(n3/2)) less energy.