Performance evaluation considering iterations per phase and SA temperature in WMN-SA system

One of the key advantages of Wireless Mesh Networks (WMNs) is their importance for providing cost-efficient broadband connectivity. There are issues for achieving the network connectivity and user coverage, which are related with the node placement problem. In this work, we consider Simulated Annealing Algorithm (SA) temperature and Iteration per phase for the router node placement problem in WMNs. We want to find the optimal distribution of router nodes in order to provide the best network connectivity and provide the best coverage in a set of Normal distributed clients. From simulation results, we found how to optimize both the size of Giant Component and number of covered mesh clients. When the number of iterations per phase is big, the performance is better in WMN-SA System. From for SA temperature, when SA temperature is 0 and 1, the performance is almost same. When SA temperature is 2 and 3 or more, the performance decrease because there are many kick ups.Peer ReviewedPostprint (published version

A simulated annealing algorithm for router nodes placement problem in Wireless Mesh Networks

Mesh router nodes placement is a central problem in Wireless Mesh Networks (WMNs). An efficient placement of mesh router nodes is indispensable for achieving network performance in terms of both network connectivity and user coverage. Unfortunately the problem is computationally hard to solve to optimality even for small deployment areas and a small number of mesh router nodes. As WMNs are becoming an important networking infrastructure for providing cost-efficient broadband wireless connectivity, researchers are paying attention to the resolution of the mesh router placement problem through heuristic approaches in order to achieve near optimal, yet high quality solutions in reasonable time. In this work we propose and evaluate a simulated annealing (SA) approach to placement of mesh router nodes in WMNs. The optimization model uses two maximization objectives, namely, the size of the giant component in the network and user coverage. Both objectives are important to deployment of WMNs; the former is crucial to achieve network connectivity while the later is an indicator of the QoS in WMNs. The SA approach distinguishes for its simplicity yet its policy of neighborhood exploration allows to reach promising areas of the solution space where quality solutions could be found. We have experimentally evaluated the SA algorithm through a benchmark of generated instances, varying from small to large size, and capturing different characteristics of WMNs such as topological placements of mesh clients. The experimental results showed the efficiency of the annealing approach for the placement of mesh router nodes in WMNs.Peer ReviewedPostprint (author's final draft

Efficient Routing for Wireless Mesh Networks Using a Backup Path

Wireless Mesh Network (WMN) has a proven record in providing viable solutions for some of the fundamental issues in wireless networks such as capacity and range limitations. WMN infrastructure includes clusters of Mobile Ad-Hoc Networks (MANETs) connected through a fixed backbone of mesh routers. The mesh network can be constrained severely due to various reasons, which could result in performance degradation such as a drop in throughput or long delays. Solutions to this problem often focus on multipath or multichannel extensions to the existing ad- hoc routing protocols. In this paper, we propose a novel solution by introducing an alternative path to the mesh backbone that traverses the MANET part of the WMN. The new routing solution allows the Mobile Nodes (MNs) to establish direct communication among peers without going through the backbone. The proposed alternative ad-hoc path is used only when the mesh backbone is severely constrained. We also propose, for the first time in WMNs, using MNs with two interfaces, one used in the mesh backbone communication and the other engaged in the ad-hoc network. A scheme is presented for making the MN aware of link quality measures by providing throughput values to the AODV protocol. We use piggybacking on route reply messages in AODV to avoid incurring additional costs. We implemented our solution in an OPNET simulator and evaluated its performance under a variety of conditions. Simulation results show that the alternative ad-hoc path provides higher throughput and lower delays. Delay analysis show that the throughput improvement does not impose additional costs

A Cross-Layer Modification to the DSR Routing Protocol in Wireless Mesh Networks

A cross-layer modification to the DSR routing protocol that finds high throughput paths in WMNs has been introduced in this work. The Access Efficiency Factor (AEF) has been introduced in this modification as a local congestion avoidance metric for the DSR routing mechanism as an alternative to the hop count (Hc) metric. In this modification, the selected path is identified by finding a path with the highest minimum AEF (max_min_AEF) value. The basis of this study is to compare the performance of the Hc and max_min_AEF as routing metrics for the DSR protocol in WMNs using the OPNET modeler. Performance comparisons between max_min_AEF, Metric Path (MP), and the well known ETT metrics are also carried out in this work. The results of this modification suggest that employing the max_min_AEF as a routing metric outperforms the Hc, ETT, and MP within the DSR protocol in WMNs in terms of throughput. This is because the max_min_AEF is based upon avoiding directing traffic through congested nodes where significant packet loss is likely to occur. This throughput improvement is associated with an increment in the delay time due to the long paths taken to avoid congested regions. To overcome this drawback, a further modification to the routing discovery mechanism has been made by imposing a hop count limit (HCL) on the discovered paths. Tuning the HCL allows the network manager to tradeoff throughput against delay. The choice of congestion avoidance metric exhibits another shortcoming owing to its dependency on the packet size. It penalises the smaller packets over large ones in terms of path lengths. This has been corrected for by introducing a ModAEF metric that explicitly considers the size of the packet. The ModAEF metric includes a tuning factor that allows the operator determine the level of the weighting that should be applied to the packet size to correct for this dependence

Messhu-gata musen nettowaku ni okeru supekutoramu kenchi to MAC-so purotokoru ni kansuru kenkyu

制度:新 ; 報告番号:甲3458号 ; 学位の種類:博士(国際情報通信学) ; 授与年月日:2011/11/16 ; 早大学位記番号:新578

Performance Evaluation of Video Streaming in an Infrastructure Mesh Based Vehicle Network

Most next-generation wireless networks are expected to support video stream- ing which constitutes the bulk of traffic on the Internet. This thesis evaluates the performance of video streaming in a vehicle network with an infrastructure wireless mesh network (WMN) backhaul. Several studies have investigated video quality per- formance primarily in single hop wireless networks and static WMNs. This thesis is based on those studies and conducts the study in relation to a network where the multi-hop features of the mesh network and mobility of the streaming clients may have substantial impact on the perceived video quality in the network. The study assumes a previously proposed vehicle network architecture con- sisting of an infrastructure WMN that serves as the mesh backhaul [2, 3]. A number of mesh routers (MRs) form the mesh backhaul using one of their two IEEE 802.11g radios whereas the other radio is used to communicate with the fast moving mesh clients (MCs). Selective MRs called mesh gateways (MGs) are connected to a wired network (e.g., the Internet, hereafter referred to as the core network) via a point-to- point link and provide gateway connectivity to the rest of the network. A server on the core network acts as a video server and streams individual video streams to the fast moving MCs. Upon deployment, network discovery occurs and segregates the network into a number of separate routing zones with each routing zone consisting of a single MG and all the MRs that use the MG as their gateway. A minimum-hop based routing protocol is used to enable seamless handover of MCs from one MR to another within a single zone. Simulation studies in this thesis inspects the network and video streaming performance within a single routing zone, assuming the handoff and inter-zone routing being taken care of by the routing protocol and only focus on the intra-zone packet forwarding and scheduling impacts. Hence, this study does not address cases where MCs move from one routing zone to another routing zone in the mobile network. In the first part of the study, we evaluate the performance of video streaming in the described network by studying performance metrics across different layers of the protocol stack. The number of video flows that can be supported by the network is experimentally determined for each scenario. In the second part, the thesis studies controllable network and protocol parameters\u27 ability to improve the network and video quality performance. Simulations are run in an integrated framework that includes network-simulator ns-2, NS-MIRACLE, and Evalvid

A secure prepaid micropayment scheme for wireless mesh networks

Wireless Mesh Network (WMN) is an evolving multi-hop, ubiquitous and high speed networking technology. In this thesis, we proposed a secure micropayment scheme for network access in WMNs. The main motivation is that the operators are not considered as fully trusted entities in our scheme; the clients control their balance with their operators. In this way, none of the system entities can behave dishonestly about the amount of services provided and obtained. Our proposed payment scheme is a prepaid one. The users obtain connection cards for getting service. Connection card issuer, which is a trusted third party, generates the connection cards. Each connection card includes tokens. These tokens are generated as a hash chain which is obtained by hashing an initial value (IV) several times. Hash functions are one way and irreversible cryptographic functions. The tokens are consumed backwards. Therefore, it is not feasible to generate unused tokens from an already used token. This property is the main enabler for the security of our scheme. We have conducted simulations for performance evaluation of the proposed scheme. Our results show that in a network with 300 clients, the average authentication completion time becomes less than 1 second even if all the clients send their connection request at the same time