The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Wireless Mesh Networking (WMN) emerges as a new technology to reshape the broadband industry towards a more efficient and cost effective connectivity. The WMN has been the ideal technology for the next generation wireless community networks that offers efficient digital engagements and an ideal platform for promoting social partnerships over both urban and rural communities. This is essential for...
Graph routing is proposed in wireless HART communication foundation, but the implementing of the algorithm is not specified. This paper proposes a graph routing mechanism termed ELHFR (exhenced least-hop first routing) that exploits the mesh topology and application characteristics of wireless HART. ELHFR defines the network topology as a connected graph then generates the sub-graph that includes...
A key challenge in multihop wireless network is to provision for sufficient network capacity to meet user requirements. The contributions of this paper are two-fold: (a) we analyses wireless bandwidth, the ratio between the number of channels and the number of interfaces, the ratio between the number of gateways and the number of mesh routers, and the impact on the capacity of mesh backbone, and present...
Supporting user mobility is an important requirement for wireless mesh networks. We propose a relay-router buffering- and-forwarding scheme for supporting smooth handoff in the infrastructure wireless mesh networks. Our proposal is based on buffering packets at intermediate relay routers in the packets forwarding route and neighboring relay routers working in promiscuous mode which can overhear the...
In wireless mesh networks (WMNs) traffic is routed from mobile clients through a multihop wireless backbone to and from Internet gateways (IGWs). Because of their limited number, IGWs become the major traffic bottlenecks. The purpose of this work is to explore the benefits of introducing load-dependent routing metrics to increase WMN capacity and performance. We use weighted shortest path routing...
Low-cost wireless routers are changing the way people connect to the Internet. They are also very cheap, albeit quite limited, Linux boxes. These attributes make them ideal candidates for wireless mesh routers. This paper presents a minimally invasive mechanism for redundant multipath routing in kernel-space to achieve high reliability with high throughput in a mesh network. This service is essential...
We study scalable, distributed, and adaptive routing algorithms for communication networks. The back-pressure algorithm introduced in [21] is a well-known distributed and adaptive routing/scheduling algorithm where nodes only need the queue length information of neighboring nodes to make routing decisions, and packets are adaptively routed in the network according to congestion information, which...
Infrastructure mesh networks offer a high-capacity wireless backhaul network through which client devices, such as PDAs, can connect to one another or with the Internet. In dynamically deployed mesh networks the routers within the mesh network may be unaware of existing Internet gateways and need to discover them on demand. In this paper we present a lightweight gateway discovery and traffic forwarding...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.