Metropolitan Mesh Network Research Articles

Optimasi Routing pada Metropolitan Mesh Network Menggunakan Adaptive Mutation Genetic Algorithm

In dynamic and wide networks, such as Metropolitan Mesh Network (MMN), routing becomes very complex because a packet can be blocked before it reaches its destination. In addition, users can also log in or log out from network topology. Therefore, a good routing algorithm, which is able to reduce time in network update process or when there is an error in the network, are required. Routing problems can be represented as the shortest path problem to facilitate completion. In this paper, a routing algorithm optimization using Adaptive Mutation Genetic Algorithm (AMGA) on MMN is presented by determining a probability of 0.000005782 at the beginning, with crossover probability of 0.000847, to reduce or avoid premature convergence.

Experiences with a Metropolitan Multiradio Wireless Mesh Network: Design, Performance, and Application

Wireless mesh networks comprise nodes with multiple radio interfaces, and can provide low-cost high-speed Internet access or connectivity for data transfer. In this article we report our experiences and investigations with an experimental metropolitan multiradio mesh network that covers an area of approximately 60 km <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</sup> in the city of Heraklion, Crete. We present the design and deployment of the network, experiments to quantify the network's performance, and an application that runs on top of it and exploits it's low-cost wide-area connectivity. The metropolitan network consists of 16 nodes, among which six are core nodes, each with up to four 802.11a wireless interfaces and an additional wireless interface for management and monitoring. The distance between core mesh nodes varies from 1.6 to 5 km, and the mesh network contains two gateways that connect it to a wired network. Our performance experiments involve rate, power, and channel control for long-distance metropolitan links, and include investigations of the timescales for the operation for these mechanisms. Finally, we present a system for continuous online electromagnetic field monitoring and spectrum sensing, which utilizes the metropolitan mesh network for collecting wide-area measurements from low-cost EMF measurement devices.

Interference-aware channel assignment in a metropolitan multi-radio wireless mesh network with directional antennas

We investigate the problem of channel assignment in a metropolitan multi-radio wireless mesh network with directional antennas. Our contributions include a new conflict graph model for capturing the interference between links in a mesh network with a known wireless interface communication graph, and a new channel assignment procedure which accounts for interference both between links inside the mesh network, and from external sources. Additionally, we have implemented and evaluated the proposed channel assignment procedure in an actual metropolitan mesh network with 1.6–5 km links. Key components of the channel assignment procedure are the interference model, the link ordering, and the channel selection metric. The experimental results demonstrate how link ordering and the channel selection metric affect performance, in terms of the average packet delay and http latency. The results show that the proposed channel assignment procedure achieves performance very close to a lower bound of the average packet delay, and significantly higher than the performance achieved with a simpler interference-unaware procedure, and a measurement-based scheme that has appeared in the literature, and accounts for interference only from external 802.11 sources. Moreover, we investigate the performance when a different number of channels are available, and the timescales for channel re-assignment.

Anonymous User Communication for Privacy Protection in Wireless Metropolitan Mesh Networks

As a combination of ad hoc networks and wireless local area network (WLAN), the wireless mesh network (WMN) provides a low-cost convenient solution to the last-mile network-connectivity problem. As such, existing route protocols designed to provide security and privacy protection for ad hoc networks are no longer applicable in WMNs. On the other hand, little research has focused on privacy-preserving routing for WMNs. In this paper, we propose two solutions for security and privacy protection in WMNs. The first scheme relies on group signatures, together with user credentials, to deliver security and privacy protection. By enforcing access control using user credentials, the user's identity has to be disclosed to mesh routers. To avoid this, our second scheme employs pairwise secrets between any two users to achieve stronger privacy protection. In the second scheme, the user is kept anonymous to mesh routers. Finally, we analyze these two schemes in terms of security, privacy, and performance.