A General Approach for Minimizing the Maximum Interference of a Wireless Ad-Hoc Network in Plane
Keywords:wireless ad-hoc network, sensor network, interference, spanning tree
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.
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 http://dx.doi.org/10.1002/0470094559
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 http://dx.doi.org/10.1016/0012-365X(90)90358-O
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
ONLINE OPEN ACCES: Acces to full text of each article and each issue are allowed for free in respect of Attribution-NonCommercial 4.0 International (CC BY-NC 4.0.
You are free to:
-Share: copy and redistribute the material in any medium or format;
-Adapt: remix, transform, and build upon the material.
The licensor cannot revoke these freedoms as long as you follow the license terms.
DISCLAIMER: The author(s) of each article appearing in International Journal of Computers Communications & Control is/are solely responsible for the content thereof; the publication of an article shall not constitute or be deemed to constitute any representation by the Editors or Agora University Press that the data presented therein are original, correct or sufficient to support the conclusions reached or that the experiment design or methodology is adequate.