Performance Evaluation of Energy Efficient Communication Protocol for Mobile Ad Hoc Networks
A mobile ad hoc network is a network of mobile nodes
without any notion of centralized administration. In such a network,
each mobile node behaves not only as a host which runs applications
but also as a router to forward packets on behalf of others. Clustering
has been applied to routing protocols to achieve efficient
communications. A CH network expresses the connected relationship
among cluster-heads. This paper discusses the methods for
constructing a CH network, and produces the following results: (1)
The required running costs of 3 traditional methods for constructing a
CH network are not so different from each other in the static
circumstance, or in the dynamic circumstance. Their running costs in
the static circumstance do not differ from their costs in the dynamic
circumstance. Meanwhile, although the routing costs required for the
above 3 methods are not so different in the static circumstance, the
costs are considerably different from each other in the dynamic
circumstance. Their routing costs in the static circumstance are also
very different from their costs in the dynamic circumstance, and the
former is one tenths of the latter. The routing cost in the dynamic
circumstance is mostly the cost for re-routing. (2) On the strength of
the above results, we discuss new 2 methods regarding whether they
are tolerable or not in the dynamic circumstance, that is, whether the
times of re-routing are small or not. These new methods are revised
methods that are based on the traditional methods. We recommended
the method which produces the smallest routing cost in the dynamic
circumstance, therefore producing the smallest total cost.
[1] W.Wu, J. Cao, J.Yang, and M. Raynal, "Design and Performance
Evaluation of Efficient Consensus Protocols for Mobile Ad Hoc
Networks," IEEE Trans. Computers, Vol.56, no.8, pp.1055-1070, August
2007.
[2] H.Ammari and H.El-Rewini, "Performance Evaluation of Hybrid
Environments with Mobile Gateways," Proceedings of the Ninth
International Symposium on Computers and Communications 2004, Vol.
2 (ISCC"04), pp.152-157.
[3] F.Dai and J.Wu, "An extended localized algorithm for connected
dominating set formation in ad hoc wireless networks," IEEE Transaction
on Parallel and Distributed System, Vol.15, No.10, 2004.
[4] N.Li, J.C.Hou, and L.Sha "Design and analysis of an MST-based
topology control algorithm," Proceedings IEEE INFOCOM 3, 2003.
[5] K.Alzoubi, P.J.Wan, and O.Frieder, "New didtributed algorithm for
connected dominating set in wireless ad hoc networks," Proceedings of
HICSS'02, 2002.
[6] A.D.Amis, R.Prakash, T.H.P. Vuong, and D.T.Huynh, "Max-min
d-cluster formation in wireless ad hoc networks," Proceedings of IEEE
INFOCOM 1, 2000.
[7] S.Basagni, D.Turgut, and S.K.Das,"Mobility-adaptive protocols for
managing large ad hoc networks," IEEE International Conference on
Communications 5, 2001.
[8] C.R.Lin and M.Gerla, "Adaptive clustering for mobile wireless
networks," IEEE Journal on Selected Areas in Communications, Vol.15,
No.7, pp.1265-1275, 1997.
[9] J.Wu and W.Lou, "Forward-node-set based broadcast in clustered mobile
ad hoc networks," Wireless Communications and Mobile Computing,
Vol.3, No.2, pp.141-154, 2003.
[10] S.Yang, J.Wu and J.Cao, "Connected k-hop clustering in ad hoc
networks," Proceedings of IEEE ICPP'05, pp.373-380, 2005.
[11] S.J.Lee and M.Gerla, "Backup routing in ad hoc networks," Proceedings
of IEEE WCNC, 2000.
[12] C.K.Toh, " Ad hoc mobile wireless networks," Pearson Education, 2002.
[13] J.Postel, "User datagram protocol, " RFC 768, 1980.
[14] J.Postel, "Internet protocol: DARPA internet program protocol
specification," RFC 791, 1981.
[15] J.Postel, "Transmission control protocol: DARPA internet program
protocol specification, " RFC 793, 1981.
[16] K.Kishida, T.Sasama, and H.Masuyama, "Performance evaluation of cost
effective routing for packet transmissions in mobile ad hoc networks,"
Proceedings of ISA 2009.
[1] W.Wu, J. Cao, J.Yang, and M. Raynal, "Design and Performance
Evaluation of Efficient Consensus Protocols for Mobile Ad Hoc
Networks," IEEE Trans. Computers, Vol.56, no.8, pp.1055-1070, August
2007.
[2] H.Ammari and H.El-Rewini, "Performance Evaluation of Hybrid
Environments with Mobile Gateways," Proceedings of the Ninth
International Symposium on Computers and Communications 2004, Vol.
2 (ISCC"04), pp.152-157.
[3] F.Dai and J.Wu, "An extended localized algorithm for connected
dominating set formation in ad hoc wireless networks," IEEE Transaction
on Parallel and Distributed System, Vol.15, No.10, 2004.
[4] N.Li, J.C.Hou, and L.Sha "Design and analysis of an MST-based
topology control algorithm," Proceedings IEEE INFOCOM 3, 2003.
[5] K.Alzoubi, P.J.Wan, and O.Frieder, "New didtributed algorithm for
connected dominating set in wireless ad hoc networks," Proceedings of
HICSS'02, 2002.
[6] A.D.Amis, R.Prakash, T.H.P. Vuong, and D.T.Huynh, "Max-min
d-cluster formation in wireless ad hoc networks," Proceedings of IEEE
INFOCOM 1, 2000.
[7] S.Basagni, D.Turgut, and S.K.Das,"Mobility-adaptive protocols for
managing large ad hoc networks," IEEE International Conference on
Communications 5, 2001.
[8] C.R.Lin and M.Gerla, "Adaptive clustering for mobile wireless
networks," IEEE Journal on Selected Areas in Communications, Vol.15,
No.7, pp.1265-1275, 1997.
[9] J.Wu and W.Lou, "Forward-node-set based broadcast in clustered mobile
ad hoc networks," Wireless Communications and Mobile Computing,
Vol.3, No.2, pp.141-154, 2003.
[10] S.Yang, J.Wu and J.Cao, "Connected k-hop clustering in ad hoc
networks," Proceedings of IEEE ICPP'05, pp.373-380, 2005.
[11] S.J.Lee and M.Gerla, "Backup routing in ad hoc networks," Proceedings
of IEEE WCNC, 2000.
[12] C.K.Toh, " Ad hoc mobile wireless networks," Pearson Education, 2002.
[13] J.Postel, "User datagram protocol, " RFC 768, 1980.
[14] J.Postel, "Internet protocol: DARPA internet program protocol
specification," RFC 791, 1981.
[15] J.Postel, "Transmission control protocol: DARPA internet program
protocol specification, " RFC 793, 1981.
[16] K.Kishida, T.Sasama, and H.Masuyama, "Performance evaluation of cost
effective routing for packet transmissions in mobile ad hoc networks,"
Proceedings of ISA 2009.
@article{"International Journal of Electrical, Electronic and Communication Sciences:57877", author = "Toshihiko Sasama and Kentaro Kishida and Kazunori Sugahara and Hiroshi Masuyama", title = "Performance Evaluation of Energy Efficient Communication Protocol for Mobile Ad Hoc Networks", abstract = "A mobile ad hoc network is a network of mobile nodes
without any notion of centralized administration. In such a network,
each mobile node behaves not only as a host which runs applications
but also as a router to forward packets on behalf of others. Clustering
has been applied to routing protocols to achieve efficient
communications. A CH network expresses the connected relationship
among cluster-heads. This paper discusses the methods for
constructing a CH network, and produces the following results: (1)
The required running costs of 3 traditional methods for constructing a
CH network are not so different from each other in the static
circumstance, or in the dynamic circumstance. Their running costs in
the static circumstance do not differ from their costs in the dynamic
circumstance. Meanwhile, although the routing costs required for the
above 3 methods are not so different in the static circumstance, the
costs are considerably different from each other in the dynamic
circumstance. Their routing costs in the static circumstance are also
very different from their costs in the dynamic circumstance, and the
former is one tenths of the latter. The routing cost in the dynamic
circumstance is mostly the cost for re-routing. (2) On the strength of
the above results, we discuss new 2 methods regarding whether they
are tolerable or not in the dynamic circumstance, that is, whether the
times of re-routing are small or not. These new methods are revised
methods that are based on the traditional methods. We recommended
the method which produces the smallest routing cost in the dynamic
circumstance, therefore producing the smallest total cost.", keywords = "cluster, mobile ad hoc network, re-routing cost,
simulation", volume = "4", number = "11", pages = "1644-5", }