TY - GEN
T1 - Using MILP for optimal movement planning in MANETs with cooperative mobility
AU - Brahimi, G.
AU - Awwad, O.
AU - Al-Fuqaha, A.
AU - Khan, B.
AU - Kountanisi, D.
AU - Guizani, M.
PY - 2007
Y1 - 2007
N2 - Rapid-deployment mobile ad-hoc networks (MANETs) are frequently characterized by common overarching mission objectives which make it reasonable to expect some degree of cooperativeness on the part of their constituent nodes. In this article we demonstrate new strategies to improve MANET communications, based on inter-node cooperation with respect to node mobility. We present our model for cooperative mobility, and use this cost-benefit framework to explore the impact of cooperation in MANETs where nodes are - to varying extents-willing to be moved for the common good. We develop a Mixed-Integer Linear Programming (MILP) formulation of the model, accurately capturing its objectives and constraints. The MILP model is evaluated through simulations and found to be very effective, albeit for small networks. To make the proposed technique scale to large networks we develop a new technique for converting a large global MILP into a sequence of smaller local MILP optimizations, and demonstrate that the resulting approach is scalable and succeeds at efficiently moving cooperative nodes in a manner which optimizes connection bit error rates.
AB - Rapid-deployment mobile ad-hoc networks (MANETs) are frequently characterized by common overarching mission objectives which make it reasonable to expect some degree of cooperativeness on the part of their constituent nodes. In this article we demonstrate new strategies to improve MANET communications, based on inter-node cooperation with respect to node mobility. We present our model for cooperative mobility, and use this cost-benefit framework to explore the impact of cooperation in MANETs where nodes are - to varying extents-willing to be moved for the common good. We develop a Mixed-Integer Linear Programming (MILP) formulation of the model, accurately capturing its objectives and constraints. The MILP model is evaluated through simulations and found to be very effective, albeit for small networks. To make the proposed technique scale to large networks we develop a new technique for converting a large global MILP into a sequence of smaller local MILP optimizations, and demonstrate that the resulting approach is scalable and succeeds at efficiently moving cooperative nodes in a manner which optimizes connection bit error rates.
KW - Bit error rate
KW - Cooperative
KW - Mixed-integer linear programming
KW - Wireless ad-hoc networks
UR - http://www.scopus.com/inward/record.url?scp=39349110947&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=39349110947&partnerID=8YFLogxK
U2 - 10.1109/GLOCOM.2007.231
DO - 10.1109/GLOCOM.2007.231
M3 - Conference contribution
AN - SCOPUS:39349110947
SN - 1424410436
SN - 9781424410439
T3 - GLOBECOM - IEEE Global Telecommunications Conference
SP - 1201
EP - 1205
BT - IEEE GLOBECOM 2007 - 2007 IEEE Global Telecommunications Conference, Proceedings
T2 - 50th Annual IEEE Global Telecommunications Conference, GLOBECOM 2007
Y2 - 26 November 2007 through 30 November 2007
ER -