TY - GEN
T1 - Optimal hierarchical energy efficient design for MANETs
AU - El-Hajj, Wasim
AU - Kountanis, Dionysios
AU - Al-Fuqaha, Ala
AU - Harbi, Hani
PY - 2006
Y1 - 2006
N2 - Due to the growing interest in mobile wireless Ad-Hoc networks' (MANETs) applications, researchers have proposed many routing protocols that differ in their objective. Energy efficiency and scalability are two of the most important objectives. In our previous work, we proposed a fuzzy based hierarchical energy efficient routing protocol (FEER) for large scale MANETs that aims to maximize the network's lifetime and increase its scalability. The problem has two parts: the clustering part and the routing part. In the first part, we cluster the network into two levels of hierarchy (cluster heads and normal nodes), connect the cluster heads (backbone) with each other, and connect the normal nodes to the cluster heads while maximizing the network lifetime. In the second part, we design energy efficient routing that uses the hierarchical structure. We call the first part, the energy efficient clustering problem (EEC). In this paper, we formulate three variations of EEC as integer linear programming (ILP) problems. We first consider a network with a fully connected backbone (EEC-FCB). Then, we relax the fully connected constraint and consider a network with a connected backbone (EEC-CB), not necessarily fully connected. Finally, we consider a more reliable network (EEC-R) by electing a backup cluster head for each cluster.
AB - Due to the growing interest in mobile wireless Ad-Hoc networks' (MANETs) applications, researchers have proposed many routing protocols that differ in their objective. Energy efficiency and scalability are two of the most important objectives. In our previous work, we proposed a fuzzy based hierarchical energy efficient routing protocol (FEER) for large scale MANETs that aims to maximize the network's lifetime and increase its scalability. The problem has two parts: the clustering part and the routing part. In the first part, we cluster the network into two levels of hierarchy (cluster heads and normal nodes), connect the cluster heads (backbone) with each other, and connect the normal nodes to the cluster heads while maximizing the network lifetime. In the second part, we design energy efficient routing that uses the hierarchical structure. We call the first part, the energy efficient clustering problem (EEC). In this paper, we formulate three variations of EEC as integer linear programming (ILP) problems. We first consider a network with a fully connected backbone (EEC-FCB). Then, we relax the fully connected constraint and consider a network with a connected backbone (EEC-CB), not necessarily fully connected. Finally, we consider a more reliable network (EEC-R) by electing a backup cluster head for each cluster.
KW - Energy efficiency
KW - Hierarchical design
KW - Integer linear programming
KW - Mobile wireless ad-hoc network
UR - http://www.scopus.com/inward/record.url?scp=34247353805&partnerID=8YFLogxK
U2 - 10.1145/1143549.1143607
DO - 10.1145/1143549.1143607
M3 - Conference contribution
AN - SCOPUS:34247353805
SN - 1595933069
SN - 9781595933065
T3 - IWCMC 2006 - Proceedings of the 2006 International Wireless Communications and Mobile Computing Conference
SP - 287
EP - 292
BT - IWCMC 2006 - Proceedings of the 2006 International Wireless Communications and Mobile Computing Conference
T2 - IWCMC 2006 - 2006 International Wireless Communications and Mobile Computing Conference
Y2 - 3 July 2006 through 6 July 2006
ER -