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 as not only a host which runs applications but also as a router to forward packets on behalf of others. Clustering is one of the most important approaches to energy efficient or cost efficient communications. Clustering is an algorithm in which the network is divided into non-overlapping sub networks, referred to as clusters where every node of each sub network is at the most k-hops from a distinguished station called the cluster-head CH. A CH network expresses the connected relation among cluster-heads. A one-to-one route can be determined after flooding on the CH network. The method of construction of the CH network is characterized by the calculating the amount of area to construct; the largest 2k+1 hops-, the middle 2.5 hops-, and the smallest A-NCR-methods. The A-NCR method is the most cost effective for construction of the CH network because it uses the smallest computing area. Since a path find through the smallest computing area creates the possibility of finding a longer routing path in a real network, this subsequently may lead to a higher running cost, which places receiving the data transmission in real circumstances at a disadvantage. This paper evaluates how the running costs vary for the transmission of data on each routing path, as found by the above three methods. This paper also makes clarifies how the differences of order-of-time complexities are under several times among these three methods.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Wu, W., Cao, J., Yang, J., Raynal, M.: Design and Performance Evaluation of Efficient Consensus Protocols for Mobile Ad Hoc Networks. IEEE Trans. Computers 56(8), 1055–1070 (2007)
Ammari, H., El-Rewini, H.: Performance Evaluation of Hybrid Environments with Mobile Gateways, pp. 152–157
Lin, C.R., Gerla, M.: Adaptive clustering for mobile wireless networks. IEEE Journal on Selected Areas in Communications 15(7), 1265–1275 (1997)
Wu, J., Lou, W.: Forward-node-set based broadcast in clustered mobile ad hoc networks. Wireless Communications and Mobile Computing 3(2), 141–154 (2003)
Yang, S., Wu, J., Cao, J.: Connected k-hop clustering in ad hoc networks. In: Proceedings of IEEE ICPP 2005, pp. 373–380 (2005)
Postel, J.: User datagram protocol, RFC 768 (1980)
Postel, J.: Internet protocol: DARPA internet program protocol specification. RFC 791 (1981)
Postel, J.: Transmission control protocol: DARPA inter-net program protocol specification, RFC 793 (1981)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kishida, K., Sasama, T., Masuyama, H. (2009). Performance Evaluation of Cost Effective Routing for Packet Transmissions in Mobile Ad Hoc Networks. In: Park, J.H., Chen, HH., Atiquzzaman, M., Lee, C., Kim, Th., Yeo, SS. (eds) Advances in Information Security and Assurance. ISA 2009. Lecture Notes in Computer Science, vol 5576. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02617-1_50
Download citation
DOI: https://doi.org/10.1007/978-3-642-02617-1_50
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-02616-4
Online ISBN: 978-3-642-02617-1
eBook Packages: Computer ScienceComputer Science (R0)