**Author details**

Sangsu Jung *Future Internet Research Team, National Institute for Mathematical Sciences, Daejeon, S. Korea*

### **6. References**


[9] L. Tassiulas, A. Ephremides (1992) Stability properties of constrained queueing systems and scheduling polices of maximum throughput in multihop radio networks. IEEE Trans. on Automatic Control. 37: 1936-1948.

14 Will-be-set-by-IN-TECH

electrostatic potential theory governed by Poisson's equation, we derive a routing metric that shows the hybrid behaviors of back-pressure routing and geographic routing. The beauty of our routing scheme is adopting the strengths of the two aforementioned routing schemes while overcoming the limitations of the two. We adopt an FEM and an LEM to design a distributed potential assignment as the routing metric; only one-hop neighbor information is required for scale-free global routing. The stateless property of our scheme contributes to maintaining robustness to node failures and eliminating requirement of flooding overheads for re-routing. Furthermore, our scheme utilizes a Gaussian function to dynamically adapt to rapidly changing environments. Using simulations, we investigate how our scheme behaves with respect to a tuning parameter, which characterizes a routing behavior similarly to back-pressure routing or geographic routing. In addition, we demonstrate the superior performance of our scheme compared with conventional schemes in the aspects of throughput, load balancing, and path lengths. Considering the implementation issues of a protocol in practical applications, our scheme is the appropriate solution combining the

As a future work, applications of our scheme can be extended to other mesh networking areas based on sensor networks, machine-to-machine communications, and LTE-Advanced, with

*Future Internet Research Team, National Institute for Mathematical Sciences, Daejeon, S. Korea*

[1] C. Metz (2002) IP anycast point-to-any point communication. IEEE Internet Computing.

[2] V. Lenders, M. May, B. Plattner (2008) Density-based anycast: a robust routing strategy for wireless ad hoc networks. IEEE/ACM Trans. on Networking. 16: 852-863. [3] J. Wang, Y. Zheng, W. Jia (2003) An AODV-based anycast protocol in mobile ad hoc

[4] J. Wang, Y. Zheng, W. Jia (2003) A-DSR: a DSR-based anycast protocol for IPv6 flow in

[5] U. C. Kozat, L. Tassiulas (2003) Network layer support for service discovery in mobile

[6] J. Shin et al. (2005) Load balancing among Internet gateways in ad-hoc networks. in

[7] A. Velmurugan, R. Rajaram (2006) Adaptive hybrid mobile agent protocol for wireless

[8] D. Nandiraju et al. (2006) Achieving load balancing in wireless mesh networks through

multihop Internet access. Journal of Computer Science. 2: 672-682.

properties of back-pressure routing and geographic routing.

practical network service models.

network. in: Proc. IEEE PIMRC.

mobile ad hoc networks. in: Proc. IEEE VTC.

ad hoc networks. in: Proc. IEEE INFOCOM.

multiple gateways. in: Proc. IEEE MASS.

**Author details**

**6. References**

6: 94-98.

:Proc. IEEE VTC.

Sangsu Jung

	- [32] R. Ahuja, T. Magnanti, J. Orlin (1993) Network flows: theory, algorithms, and applications. Prentice hall.
	- [33] NS-2. http://www.isi.edu/nsnam/ns/.
	- [34] S. Jung et al. (2008) A geographic routing protocol utilizing link lifetime and power control for mobile ad hoc networks. in: Proc. ACM FOWANC.
	- [35] C. Perkins, E. Belding-Royer, S. Das. Ad hoc on-demand distance vector (AODV) routing. http://www.ietf.org/rfc/rfc3561.txt. RFC 3561.

© 2012 Olwal et al., licensee InTech. This is an open access chapter distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/3.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

© 2012 The Author(s). Licensee InTech. This chapter is distributed under the terms of the Creative Commons Attribution License http://creativecommons.org/licenses/by/3.0), which permits unrestricted use, distribution,

**Achievable Capacity Limit of High** 

Additional information is available at the end of the chapter

http://dx.doi.org/10.5772/45868

**1. Introduction** 

**Performance Nodes for Wireless Mesh Networks** 

*Research background:* Next generation fixed wireless broadband networks have immensely been deployed as mesh networks in order to provide and extend access to the internet. These networks are characterised by the use of multiple orthogonal channels available within the industrial, scientific and medical (ISM) liscensed-free frequency bands. Nodes in the network have the ability to simultaneously communicate with many neighbours or stream different versions of the same data/information using multiple radio devices over orthogonal channels thereby improving effective "online" channel utilisation (Kodialam & Nandagopal, 2005). The ability to perform full duplex communication by individual multiradio nodes without causing network interference has also been achieved through decentralized transmission power control schemes in (Olwal, 2010; Olwal et al., 2011). Allen et al. (2007) alluded that multiple radios that receive versions of the same transmission may together correctly recover a frame that would otherwise be lost based on multipath fading, even when any given individual radio cannot. Many such networks emerging from standards such as IEEE 802.11 a/b/g/n and 802.16 are already in use, ranging from prototype test-

The increasing question is how the theoretical capacity of such static multi-radio multichannel (MRMC) network scales with the node density, irregularity of the terrain and the presence of tree foliage (Intini, 2000). In their seminal work, Gupta and Kumar (2000) determined the capacity of single radio single channel networks. Their findings have been later extended to derive the capacity bounds of the MRMC configurations of a network scope by Kyasanur and Vaidya (2005). In addition, the link throughput performance parameters in IEEE 802.11 networks have also been discussed in Berthilson & Pascual (2007). However, the considered MRMC network architecture has so far been presented with a number of impractical assumptions. The first assumption asserts that the location of nodes and traffic patterns can be controlled in arbitrary networks. The second assumption claims that channel fading

and reproduction in any medium, provided the original work is properly cited.

Thomas Olwal, Moshe Masonta, Fisseha Mekuria and Kobus Roux

beds (Eriksson et al., 2006) to complete solutions (Mesh Dynamics, 2010).
