Please use this identifier to cite or link to this item: http://idr.nitk.ac.in/jspui/handle/123456789/12037
Full metadata record
DC FieldValueLanguage
dc.contributor.authorPushparaj, Shetty, D.
dc.contributor.authorPrasanna, Lakshmi, M.
dc.date.accessioned2020-03-31T08:38:37Z-
dc.date.available2020-03-31T08:38:37Z-
dc.date.issued2019
dc.identifier.citationElectronic Journal of Graph Theory and Applications, 2019, Vol.7, 1, pp.169-182en_US
dc.identifier.urihttp://idr.nitk.ac.in/jspui/handle/123456789/12037-
dc.description.abstractInterference is one of the major challenges faced by communication networks. Since the inter- ference leads to packet loss, packet collision and data re-transmission, higher the interference, higher is the energy consumption. Several algorithms were proposed for reducing the interference in a wireless sensor network (WSN). By deploying additional nodes at an appropriate position in a WSN, it is possible to reduce the interference. We propose an algorithm in which, the main objective is to reduce the maximum Sender interference by deploying the additional nodes in the network, while the connectivity of the network is preserved. We use the properties of Gabriel graph to achieve the reduction in interference. We present the simulation results which show the number of additional nodes to be deployed. The comparison of the maximum Sender interference obtained by the proposed algorithm with that of the Euclidean minimum spanning tree (MST) of the given network is presented through simulation. We show that the additional number of nodes required for deployment has an upper bound of n=2, where n is the number of nodes. We also compute the average reduction in Sender interference of the network for a various number of nodes. 2019 Indonesian Combinatorics Society.en_US
dc.titleMinimizing the maximum sender interference by deploying additional nodes in a wireless sen- sor networken_US
dc.typeArticleen_US
Appears in Collections:1. Journal Articles

Files in This Item:
There are no files associated with this item.


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.