Software-defined wireless mesh networks for internet access sharing

2015 ◽  
Vol 93 ◽  
pp. 359-372 ◽  
Author(s):  
Ahmed Abujoda ◽  
David Dietrich ◽  
Panagiotis Papadimitriou ◽  
Arjuna Sathiaseelan
Keyword(s):  
Wireless Mesh Networks ◽  
Mesh Networks ◽  
Internet Access ◽  
Wireless Mesh

scholarly journals Broadband Internet Access via Multi-Hop Wireless Mesh Networks: Design, Protocol and Experiments

2010 ◽  
Vol 58 (4) ◽  
pp. 807-829 ◽  
Author(s):  
Frank Y. Li ◽  
Paolo Bucciol ◽  
Lorenzo Vandoni ◽  
Nikos Fragoulis ◽  
Stefano Zanoli ◽  
...  
Keyword(s):  
Wireless Mesh Networks ◽  
Mesh Networks ◽  
Internet Access ◽  
Broadband Internet ◽  
Wireless Mesh ◽  
Design Protocol

SIP-based AAA in delay-aware num-oriented wireless mesh networks

2013 ◽  
Vol 18 (4) ◽  
pp. 45-58
Author(s):  
Paweł Misiorek ◽  
Przemysław Walkowiak ◽  
Stanisław Karlik ◽  
Salvatore Vanini
Keyword(s):  
Wireless Mesh Networks ◽  
Utility Maximization ◽  
Wireless Mesh Network ◽  
Mesh Networks ◽  
Internet Access ◽  
Mesh Network ◽  
Network Utility Maximization ◽  
Mobile Nodes ◽  
Wireless Mesh ◽  
Network Utility

Abstract A growing number of mobile nodes that require Internet access is observed. These nodes may be organized in a wireless mesh network in which some of the nodes may serve the access to the Internet and relay other users’ traffic. Such a vision, however, causes the need for carrier-grade reliable Internet sharing solution. This paper presents a CARMNET-XML protocol, which enables to provide Authentication, Authorisation and Accounting AAA functionalities in wireless mesh networks managed by the Delay-Aware Network Utility Maximization System (DANUMS). The presented solution is a part of a CARMNET system, which integrates the utility-oriented resource allocation provided by DANUMS with the IMS architecture. The system allows users to access Internet with a given quality without the need of extending the operator’s infrastructure. Moreover, we define the scenario of the system application involving the use of the proposed protocol that has been experimentally evaluated in a wireless testbed environment

scholarly journals The RIMO Gateway Selection Approach for Mesh Networks: Towards a Global Internet Access for All

Proceedings ◽  
2018 ◽  
Vol 2 (19) ◽  
pp. 1258 ◽  
Author(s):  
Khulan Batbayar ◽  
Emmanouil Dimogerontakis ◽  
Roc Meseguer ◽  
Leandro Navarro ◽  
Esunly Medina ◽  
...  
Keyword(s):  
Wireless Mesh Networks ◽  
Capacity Planning ◽  
High Performance ◽  
High Efficiency ◽  
Mesh Networks ◽  
Internet Access ◽  
Mesh Network ◽  
Test Duration ◽  
Gateway Selection ◽  
Wireless Mesh

Community wireless mesh networks have emerged as cooperative initiatives to provide Internet Access in areas where traditional ISP costs are not affordable for the population. It is common in wireless mesh networks sharing several capacity limited Internet gateways to provide Internet access. As routing does not handle capacity planning, end-users have to select gateways in such a way that the overall capacity of all gateways could be used effectively. An efficient gateway selection should minimize the processing logic and measurements over the mesh network. Selecting a high performance gateway can also ensure that the overall network load is balanced. This paper presents RIMO, a standalone best-effort algorithm for client nodes to select their preferred gateway without interacting with other client nodes. RIMO-based selection matches the gateway performance of the reference brute-force and omniscient algorithms for 60% of the test duration while reducing the gateway performance measurement cost from a factor of n to 2. With a reduced overhead and high efficiency, the RIMO algorithm automates the aggregation of multiple Internet gateways in wireless mesh networks, which results in robust last mile Internet connectivity to people in vulnerable situation.

scholarly journals Performance routing with shortest path exploration in wireless mesh networks

2020 ◽  
Vol 7 (1) ◽  
pp. 50-53
Author(s):  
Kumaravel K ◽  
Sengaliappan M
Keyword(s):  
Wireless Mesh Networks ◽  
Shortest Path ◽  
Packet Loss ◽  
Wireless Mesh Network ◽  
Mesh Networks ◽  
Internet Access ◽  
Mesh Network ◽  
Self Organized ◽  
Wireless Mesh ◽  
End To End Delay

In wireless mesh network the nodes are dynamically self-organized and self- configured networks create a changing topology and keep a mesh connectivity to offer Internet access to the users. The shortest path problem is one of the most fundamental problems in networking. This problem can be solved by manytechniques and algorithm. In this paper we find the shortest path by using the fittest nodes in the network. By using the fittest node we can send the packets to the destination without packet loss, delay in packets.Average end to end delay is decreased by increasing bandwidth and the results are shown.

scholarly journals QoS in Wireless Mesh Networks- A Review

2014 ◽  
Vol 13 (6) ◽  
pp. 4543-4548
Author(s):  
Preet Pavneet Kaur Sandhu ◽  
Prof. Jatinder Singh Saini
Keyword(s):  
Wireless Mesh Networks ◽  
Routing Protocols ◽  
Mesh Networks ◽  
Internet Access ◽  
Cost Effective ◽  
Broadband Internet ◽  
Wireless Mesh ◽  
Networking Technologies

This paper is a review on QoS issue of Wireless mesh networks. QoS comes up with a great collection of networking technologies and procedures that guarantees the capability of a network to deliver with predictable consequences. WMNs have emerged as a flexible, reliable and cost effective way of providing broadband internet access over wide areas through multi hop communication. This paper has reviewed different routing protocols used in the WMNs. The overall objective of this paper is to explore the various short comings of the routing protocols of WMN.

Sign in / Sign up

Export Citation Format

Share Document