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

Vahid Haghighatdoost, Maryam Espandar


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 efficiency 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 alpha-Spiral node chains.


wireless ad-hoc network, sensor network, interference, spanning tree

Full Text:



T. Locher, P. von Rickenbach, and R. Wattenhofer: Sensor networks continue to puzzle: elected open problems. In Proc. 9th Internat. Conf. Distributed Computing and Networking (ICDCN), 2008

P. Santi: Topology Control in Wireless Ad Hoc and Sensor Networks. Wiley, 2005

X.Y. Li, W.Z. Song, W. Wan: A Unified Energy Efficient Topology for Unicast and Broadcast. n: Proc. of the 11th Int. Conf. on Mobile Computing and Networking (MOBICOM), 005

M. Damian, S. Pandit, S. Pemmaraju: Local Approximation Schemes for Topology Control. n: Proc. of the 25th Annual ACM Symposium on Principles of Distributed Computing (PODC), 2006

M. Burkhart, P. von Rickenbach, R. Wattenhofer, A. Zollinger: Does Topology Control educe Interference?. In: Proc. of the 5th ACM Int. Symposium on Mobile Ad-hoc Networking nd Computing (MobiHoc), 2004

K. Moaveni-Nejad, X.Y. Li: Low-Interference Topology Control for Wireless Adhoc Networks. d Hoc & Sensor Wireless Networks: An International Journal 1(1-2),2005

T. Johansson, L. Carr-Motyčková: Reducing Interference in Ad hoc Networks through Topology ontrol. In: Proc of the 3rd ACM Joint Workshop on Foundations of Mobile Computing (DIALM-POMC), 2005

M. Benkert, J. Gudmundsson, H. Haverkort, A. Wolff: Constructing Interference- Minimal etworks. Computational Geometry: Theory and Applications, 2007

P. von Rickenbach, S. Schmid, R. Wattenhofer, A. Zollinger: A Robust Interference Model or Wireless Ad-Hoc Networks.In: Proc. of the 5th Int. Workshop on Algorithms for Wireless, obile, Ad Hoc and Sensor Networks (WMAN), 2005

M.M. Halldórsson, T. Tokuyama: Minimizing Interference of a Wireless Ad-Hoc Network n a Plane. In: Proc. of the 2nd Int. Workshop on Algorithmic Aspects of Wireless Sensor etworks(ALGOSENSORS), 2006.

T. Moscibroda, R. Wattenhofer: Minimizing Interference in Ad Hoc and Sensor Networks. n: Proc. of the 3rd ACM JointWorkshop on Foundations of Mobile Computing (DIALMPOMC), 005

K. Buchin: Minimizing the Maximum Interference is Hard. CoRR 2008 and sited in arXiv/ 802.2134, 2008

N. Clark, C. J. Colbourn, D.S. Johnson: Unit Disk Graphs. Discrete Mathematics, 86:165- 77, 1990

M. Heide, C. Schindelhauer, K. Volbert, M. Gruenewald: Energy: Congestion and Dilation n Radio Networks. In Proc. of the 14th Annual ACM Symposium on Parallel Algorithms and rchitectures (SPAA), pages 230-237, 2002

DOI: https://doi.org/10.15837/ijccc.2012.2.1409

Copyright (c) 2017 Vahid Haghighatdoost, Maryam Espandar

Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.

CC-BY-NC  License for Website User

Articles published in IJCCC user license are protected by copyright.

Users can access, download, copy, translate the IJCCC articles for non-commercial purposes provided that users, but cannot redistribute, display or adapt:

  • Cite the article using an appropriate bibliographic citation: author(s), article title, journal, volume, issue, page numbers, year of publication, DOI, and the link to the definitive published version on IJCCC website;
  • Maintain the integrity of the IJCCC article;
  • Retain the copyright notices and links to these terms and conditions so it is clear to other users what can and what cannot be done with the  article;
  • Ensure that, for any content in the IJCCC article that is identified as belonging to a third party, any re-use complies with the copyright policies of that third party;
  • Any translations must prominently display the statement: "This is an unofficial translation of an article that appeared in IJCCC. Agora University  has not endorsed this translation."

This is a non commercial license where the use of published articles for commercial purposes is forbiden. 

Commercial purposes include: 

  • Copying or downloading IJCCC articles, or linking to such postings, for further redistribution, sale or licensing, for a fee;
  • Copying, downloading or posting by a site or service that incorporates advertising with such content;
  • The inclusion or incorporation of article content in other works or services (other than normal quotations with an appropriate citation) that is then available for sale or licensing, for a fee;
  • Use of IJCCC articles or article content (other than normal quotations with appropriate citation) by for-profit organizations for promotional purposes, whether for a fee or otherwise;
  • Use for the purposes of monetary reward by means of sale, resale, license, loan, transfer or other form of commercial exploitation;

    The licensor cannot revoke these freedoms as long as you follow the license terms.

[End of CC-BY-NC  License for Website User]

INTERNATIONAL JOURNAL OF COMPUTERS COMMUNICATIONS & CONTROL (IJCCC), With Emphasis on the Integration of Three Technologies (C & C & C),  ISSN 1841-9836.

IJCCC was founded in 2006,  at Agora University, by  Ioan DZITAC (Editor-in-Chief),  Florin Gheorghe FILIP (Editor-in-Chief), and  Misu-Jan MANOLESCU (Managing Editor).

Ethics: This journal is a member of, and subscribes to the principles of, the Committee on Publication Ethics (COPE).

Ioan  DZITAC (Editor-in-Chief) at COPE European Seminar, Bruxelles, 2015:

IJCCC is covered/indexed/abstracted in Science Citation Index Expanded (since vol.1(S),  2006); JCR2016: IF=1.374. .

IJCCC is indexed in Scopus from 2008 (CiteScore 2017 = 1.04; SNIP2017 = 0.616, SJR2017 =0.326):

Nomination by Elsevier for Journal Excellence Award Romania 2015 (SNIP2014 = 1.029): Elsevier/ Scopus

IJCCC was nominated by Elsevier for Journal Excellence Award - "Scopus Awards Romania 2015" (SNIP2014 = 1.029).

IJCCC is in Top 3 of 157 Romanian journals indexed by Scopus (in all fields) and No.1 in Computer Science field by Elsevier/ Scopus.


 Impact Factor in JCR2017 (Clarivate Analytics/SCI Expanded/ISI Web of Science): IF=1.29 (Q3). Scopus: CiteScore2017=1.04 (Q2); Editors-in-Chief: Ioan DZITAC & Florin Gheorghe FILIP.