Premium
Exact formulations for the minimum interference problem in k ‐connected ad hoc wireless networks
Author(s) -
Moraes Renato E. N.,
Ribeiro Celso C.,
Ribeiro Glaydston M.
Publication year - 2016
Publication title -
international transactions in operational research
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.032
H-Index - 52
eISSN - 1475-3995
pISSN - 0969-6016
DOI - 10.1111/itor.12327
Subject(s) - wireless ad hoc network , topology control , computer science , topology (electrical circuits) , computer network , interference (communication) , wireless sensor network , wireless network , power control , wireless , integer programming , energy consumption , mobile ad hoc network , key distribution in wireless sensor networks , power (physics) , algorithm , network packet , channel (broadcasting) , telecommunications , electrical engineering , engineering , physics , quantum mechanics
Energy consumption is one of the most critical issues in wireless ad hoc and sensor networks. A considerable amount of energy is dissipated due to radio transmission power and interference (message collisions). A typical topology control technique aims at reducing energy consumption while ensuring specific desired properties to the established wireless network (such as biconnectivity). Energy minimization can be achieved by reducing the transmission power and selecting edges that suffer or cause less interference. We propose four integer programming formulations for the k ‐connected minimum wireless ad hoc interference problem, which consists in a topology control technique to find a power assignment to the nodes of an ad hoc wireless network such that the resulting network topology is k ‐vertex connected and the radio interference is minimum. Interference is measured by three different models: Boolean, protocol, and physical. We report computational experiments comparing the formulations and interference models. Optimal solutions for moderately sized networks are obtained using a commercial solver.