A Clique Based Bandwidth Computation for Consistent Routing in Wireless Mesh Networks

N. Snehalatha(1*), Paul Rodrigues(2)

(1) Department of SWE, SRM University, India
(2) Dean School of Computing, Velammal Eng. College, India
(*) Corresponding author

DOI's assignment:
the author of the article can submit here a request for assignment of a DOI number to this resource!
Cost of the service: euros 10,00 (for a DOI)


A wireless mesh network has a more planned configuration, and may be deployed to provide dynamic and cost effective co n- nectivity over a certain geographic area. In this paper, we use the existing methods for calculating the bandwidth of a path for wireless networks and using it we provide an efficient path selection and packet forwarding mechanisms. The main objective of the paper is to provide a quality of service and at the same time utilise the bandwidth efficiently. The interference problem makes it difficult for computation of the available bandwidth for a particular route. In this paper the concept of composite available bandwidth is used along with clique based bandwidth computation. In this paper we will be using AODV routing protocol along with a distributed packet forwarding scheme and we will also find the no of hops to be stored in a packet for the distributed pack- et forwarding scheme based on expected transmission hops
Copyright © 2013 Praise Worthy Prize - All rights reserved.


Distributed Forwarding; Clique Based Bandwidth Computation; Quality of Service (QoS)

Full Text:



Y. Yang and J. Wang, “Design Guidelines for Routing Metrics in Multihop Wireless Networks,” Proc. IEEE INFOCOM, pp. 22882296, Apr. 2008.

D. S. J. D. Couto, D. Aguayo, J. Bicket, and R. Morris, “A high throughput path metric for multi-hop wireless routing”, Proc. ACM MobiCom, San Diego, CA, USA, September 2003.

G. Bianchi, “Performance analysis of the IEEE 802.11 distributed coordination function”, IEEE Journal on Selected Areas in Com- munications, 18(3):535–547, Mar. 2000.

M. Carvalho and J. J. Garcia-Luna-Aceves, “A scalable model for channel access protocols in multihop ad hoc networks”, Proc. ACM MobiCom, Philadelphia, PA, USA, Sept. 2004.

R. Draves, J. Padhye, , and B. Zill, “Comparison of routing met- rics for static multi-hop wireless networks”, In Proc. ACM SIGCOMM , Philadelphia, PA, USA, Sept. 2004.

Charles Perkins, “Ad-hoc on-demand distance vector r outing,” in MILCOM panel o n Ad Hoc Networks, 1997.

David B Johnson and David A Maltz, “Dynamic Source Routing in AdHoc Wireless Networks,” in Mobile Computing. 1996, vol. 353, Kluwer Academic Publishers.

Pradeep Kyasanur and Nitin Vaidya, “Multi-Channel Wireless Networks: Capacity and Protocols,” Tech. Rep., University of Il- linois at Urbana Champaign, 2005.

Richard Draves, Jitendra Padhye, and Brian Zill, “Routing in MultiRadio, Multi-Hop Wireless Mesh Networks,” in ACM Mo- bicom, 2004.

Ronghui Hou, King- Shan Lui, Fred Baker, and Jiandong Li, “Hop-by-Hop Routing in Wireless Mesh Networks with Band- width Guarantees”, IEEE Trans on Mobile Computing, February 2012.

T. Salonidis, M. Garetto, A. Saha, and E. Knightly, “Identifying High Throughput Paths in 802.11 Mesh Networks: A Model- Based Approach,” Proc. IEEE Int‟l Conf. Network Protocols (ICNP ‟07), pp. 21-30, Oct. 2007.

K. Jain, J. Padhye, V. Padmanabhan, and L. Qiu, “Impact of Inter- ference on Multi-Hop Wireless Network Performance,” Proc. ACM MobiCom, pp. 66-80, 2003.

Q. Zhang and Y.-Q. Zhang, “Cross-Layer Design for QoS Sup- port in Multihop Wireless Networks,” Proc. IEEE, vol. 96, no. 1, pp. 234-244, Jan. 2008.

Richard Draves, Jitendra Padhye and Brian Zill, “Routing in Multi-Radio, Multi-Hop Wireless Mesh Networks,” Mo- biCom‟04, Sept. 26-Oct. 1, 2004


  • There are currently no refbacks.

Please send any question about this web site to info@praiseworthyprize.com
Copyright © 2005-2022 Praise Worthy Prize