A General Approach for Minimizing the Maximum Interference of a Wireless Ad-Hoc Network in Plane

Vahid Haghighatdoost | Maryam Espandar

---

URL :   http://research.shahed.ac.ir/WSR/WebPages/Report/PaperView.aspx?PaperID=6169
Date :  2012/01/01
Publish in :    International Jornal of Computers, Communications & Control
DOI :  https://doi.org/10.15837/ijccc.2012.2.1409
Link :  http://univagora.ro/jour/index.php/ijccc/article/view/1409
Keywords :wireless ad-hoc network, sensor network, interference, spanning tree

Abstract :

---

The interference reduction is one of the most important problems in the field of wireless sensor networks. Wireless sensor network elements are small mobile receiver and transmitters. The energy of processor and other components of each device is supplied by a small battery with restricted energy. One of the meanings that play an important role in energy consumption is the interference of signals. The interference of messages through a wireless network, results in message failing and transmitter should resend its message, thus the interference directly affect on the energy consumption of transmitter. This paper presents an algorithm which suggests the best subgraph for the input distribution of the nodes in the plane how the maximum interference of the proposed graph has the minimum value. The input of the application is the complete network graph, which means we know the cost of each link in the network graph. Without any lose of generality the Euclidean distance could be used as the weight of each link. The links are arranged and ranked according to their weights, in an iterative process the link which imposition minimum increase on the network interference with some extra conditions which is proposed in future sections, is added to resulting topology and is eliminated from list until all nodes are connected together. Experimental results show the effi- ciency of proposed algorithm not only for one dimensional known distribution like exponential node chain, but also for two dimensional distributions like two Exponential node chains and a-Spiral node chains.