scholarly journals Path Mechanism to reduce packet data loss in Wireless Mesh Networks

2012 ◽  
Vol 2 (3) ◽  
pp. 134-141
Author(s):  
Rajinder Singh ◽  
Er. Nidhi Bhalla
Keyword(s):  
Wireless Mesh Networks ◽  
Packet Loss ◽  
Wireless Mesh Network ◽  
Mesh Networks ◽  
Data Packet ◽  
Mesh Network ◽  
Data Loss ◽  
Packet Dropping ◽  
Wireless Mesh ◽  
Packet Data

A wireless mesh network (WMN) is a communicationnetwork made up of radio nodes organized in a meshtopology. Wireless mesh network often consists of meshclients, mesh routers and gateways. A wireless Mesh networkuses multi-hop communication. Due to multi-hop architectureand wireless nature, Mesh networks are vulnerable to varioustypes of Denial of Services attack. It suffers from Packetdropping at Routing layer. Client nodes are unable to getservices from gateway nodes, hence network gets down. ThePaper emphasis on the developing of a path protocol when theminimun possible packet dropp occurs in wireless meshnetworks. Due to packet droping occurrences the networkperformance degrades. In the work, we have evaluated thePerformance of WMN under packet dropping on the basis oftheir throughput and Data packet loss.

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.

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 A Water Flow Algorithm Based Link Optimization in Common-Hop for Congestion Control in Wireless Mesh Networks

2019 ◽  
Vol 8 (3) ◽  
pp. 6728-6735
Keyword(s):  
Water Flow ◽  
Wireless Mesh Networks ◽  
Mesh Networks ◽  
Data Packet ◽  
Mesh Network ◽  
Single Node ◽  
Wireless Mesh ◽  
Packet Arrival ◽  
Flow Algorithm ◽  
The Common

One of the famous and popular networks is Wireless Mesh Networks (WMN), in which any node can communicate with any other node. Nodes in the WMN are called as mesh nodes, including multi-radios changed to non-overlapping channels for improving their capacities. Since mesh connection, data transmission between any two nodes is confused with selecting a link and bandwidth among pair of nodes dynamically. In the mesh network, any single node becomes a common-hop, can have multiple links from various sources nodes. When a greater number of data packet arrives into the common-hop, understanding and forwarding them is a critical issue and congestion occurs. In mesh network, obtaining a potential bandwidth route is also a critical task. The common-hop meets difficult in selecting a next hop based on the potential bandwidth, and forward the appropriate data packet. Due to the variations in packet arrival, common-hop meets congestion, flooding and jamming. To avoid this kind of problems in mesh network, this paper proposed Water Flow Algorithm (WFA) for optimizing the link and avoid congestion in mesh networks. The data packet flow from the source nodes is forward in the optimized links eliminates congestion. The proposed WFA optimization is simulated in MATLAB software and the results are compared with the existing algorithms for performance evaluation

scholarly journals Context-Based Topology Control for Wireless Mesh Networks

2016 ◽  
Vol 2016 ◽  
pp. 1-16
Author(s):  
Pragasen Mudali ◽  
Matthew Olusegun Adigun
Keyword(s):  
Topology Control ◽  
Wireless Mesh Network ◽  
Network Performance ◽  
Mesh Networks ◽  
Negative Impact ◽  
Mesh Network ◽  
Adjustment Process ◽  
Spatial Reuse ◽  
Test Bed ◽  
Wireless Mesh

Topology Control has been shown to provide several benefits to wireless ad hoc and mesh networks. However these benefits have largely been demonstrated using simulation-based evaluations. In this paper, we demonstrate the negative impact that the PlainTC Topology Control prototype has on topology stability. This instability is found to be caused by the large number of transceiver power adjustments undertaken by the prototype. A context-based solution is offered to reduce the number of transceiver power adjustments undertaken without sacrificing the cumulative transceiver power savings and spatial reuse advantages gained from employing Topology Control in an infrastructure wireless mesh network. We propose the context-based PlainTC+ prototype and show that incorporating context information in the transceiver power adjustment process significantly reduces topology instability. In addition, improvements to network performance arising from the improved topology stability are also observed. Future plans to add real-time context-awareness to PlainTC+ will have the scheme being prototyped in a software-defined wireless mesh network test-bed being planned.

scholarly journals PERFORMANCE ANALYSIS AND QOS FRAMEWORK OF FLY WİRELESS NETWORK

2019 ◽  
Vol 01 (02) ◽  
pp. 103-115
Author(s):  
Durai Pandian M
Keyword(s):  
Quality Of Service ◽  
Performance Analysis ◽  
Wireless Network ◽  
Wireless Mesh Network ◽  
Environmental Changes ◽  
Mesh Networks ◽  
Access Point ◽  
Mesh Network ◽  
Wireless Mesh

The spread out of wireless mesh network has made possible the extended range of communication network that are impractical due to environmental changes in a wired access point, these wireless mesh network does not require much competence to set it up as it can be set very fast at a cheap rate, and the conveyancing of messages in it happens by selecting the shortest path, these wireless mesh built-in with irrepressible and invulnerable identities come with an endurance to temporary congestion and individual node failure. This results in an architecture providing a better coverage, flaw indulgent with higher bandwidth compared to other wireless distributed systems. But faces the limitation on power conservation. The battery activated mesh nodes loses their resources on perception, processing and transmission of the data’s, though these batteries or accumulators comes with energy regaining capability still draw backs show up as their nature of energy regaining are unexposed. So the performance analysis of fly wireless network which proposes a uninterrupted wireless mesh networks aims at providing a best measure of performance that is the best quality of service on the meshwork by providing an improved energy gleaning using potency segregation (IGPS) which empowers each node to have self- contained accumulation of energy achieving heightened adaption with energy consumption kept at a minimum. The gross functioning of the proposed is examined on the bases of delay and packet loss to prove the quality of service acquired.

Deployment of a Wireless Mesh Network for Traffic Control

2012 ◽  
pp. 290-310
Author(s):  
Kun-chan Lan ◽  
Zhe Wang ◽  
Mahbub Hassan ◽  
Tim Moors ◽  
Rodney Berriman ◽  
...  
Keyword(s):  
Traffic Control ◽  
Network Architecture ◽  
Wireless Mesh Network ◽  
Critical Infrastructure ◽  
Mesh Networks ◽  
New Technology ◽  
Mesh Network ◽  
Traffic Light ◽  
Wireless Mesh ◽  
Communication Needs

Wireless mesh networks (WMN) have attracted considerable interest in recent years as a convenient, new technology. However, the suitability of WMN for mission-critical infrastructure applications remains by and large unknown, as protocols typically employed in WMN are, for the most part, not designed for real-time communications. In this chapter, the authors describe a wireless mesh network architecture to solve the communication needs of the traffic control system in Sydney. This system, known as SCATS and used in over 100 cities around the world — from individual traffic light controllers to regional computers and the central TMC —places stringent requirements on the reliability and latency of the data exchanges. The authors discuss experience in the deployment of an initial testbed consisting of 7 mesh nodes placed at intersections with traffic lights, and share the results and insights learned from measurements and initial trials in the process.

Using Wireless Mesh Network for Traffic Control

2010 ◽  
pp. 331-347 ◽  
Author(s):  
Kun-Chan Lan
Keyword(s):  
Traffic Control ◽  
Network Architecture ◽  
Wireless Mesh Network ◽  
Mesh Networks ◽  
Great Majority ◽  
Mesh Network ◽  
Traffic Light ◽  
Available Bandwidth ◽  
Wireless Mesh ◽  
Communication Needs

Wireless mesh networks (WMN) have attracted considerable interest in recent years as a convenient, flexible and low-cost alternative to wired communication infrastructures in many contexts. However, the great majority of research on metropolitan-scale WMN has been centered around maximization of available bandwidth, suitable for non-real-time applications such as Internet access for the general public. On the other hand, the suitability of WMN for missioncritical infrastructure applications remains by and large unknown, as protocols typically employed in WMN are, for the most part, not designed for realtime communications. In this chapter, we describe a real-world testbed, which sets a goal of designing a wireless mesh network architecture to solve the communication needs of the traffic control system in Sydney, Australia. This system, known as SCATS (Sydney Coordinated Adaptive Traffic System) and used in over 100 cities around the world, connects a hierarchy of several thousand devices -- from individual traffic light controllers to regional computers and the central Traffic Management Centre (TMC) - and places stringent requirements on the reliability and latency of the data exchanges. We discuss some issues in the deployment of this testbed consisting of 7 mesh nodes placed at intersections with traffic lights, and show some results from the testbed measurements.

Opportunistic Frame Forwarding in Wireless Mesh Networks

2015 ◽  
Vol 764-765 ◽  
pp. 941-945
Author(s):  
Shih Tsung Liang ◽  
Bo Yi Song ◽  
Yu Yao Su
Keyword(s):  
Wireless Mesh Networks ◽  
Mesh Networks ◽  
Opportunistic Routing ◽  
Wireless Channel ◽  
Mesh Network ◽  
Delivery Ratio ◽  
Delivery Probability ◽  
Wireless Mesh ◽  
Deterministic Routing ◽  
The One

Opportunistic routing has been shown to achieve the high throughput of the wireless mesh network with lossy channels. Different from deterministic routing mechanisms in which a frame is <em>transmitted</em> and forwarded along with a fixed and predetermined <em>path</em>, the opportunistic routing technique allows multiple nodes hearing the frame to form the forwarder set containing promising candidates for the frame forwarding. Existing opportunistic routing protocols typically choose among forwarding candidates based on the decision made from the transmitter disregarding the current loads in candidates. In this paper, the opportunistic frame forwarding mechanism with considering backlog of frames among forwarders is proposed and analyzed. Specifically, in addition to take into account the delivery probability, our proposal restricts members of the forwarder set for a given transmitter to those wireless nodes whose transmission range covers one another and makes the true forwarder picked from the forward set of a given transmitting frame being the one who gains access to wireless channel for the frame before others do. Therefore, the efficient and load-balanced opportunistic routing for wireless mesh networks can be achieved. Analytic results show that the proposed method compared to the deterministic routing methodology can achieve the high frame delivery ratio.

scholarly journals Robust Beamforming Design for SWIPT-Based Multi-Radio Wireless Mesh Network with Cooperative Jamming

Information ◽  
2020 ◽  
Vol 11 (3) ◽  
pp. 138
Author(s):  
Liang Li ◽  
Xiongwen Zhao ◽  
Suiyan Geng ◽  
Yu Zhang ◽  
Lei Zhang
Keyword(s):  
Wireless Mesh Network ◽  
Mesh Networks ◽  
Mesh Network ◽  
Channel State ◽  
Sdp Relaxation ◽  
Cooperative Jamming ◽  
Total Transmission ◽  
Channel Estimate ◽  
Wireless Mesh ◽  
The Individual

Wireless mesh networks (WMNs) can provide flexible wireless connections in a smart city, internet of things (IoT), and device-to-device (D2D) communications. The performance of WMNs can be greatly enhanced by adopting a multi-radio technique, which enables a node to communicate with more nodes simultaneously. However, multi-radio WMNs face two main challenges, namely, energy consumption and physical layer secrecy. In this paper, both simultaneous wireless information and power transfer (SWIPT) and cooperative jamming technologies were adopted to overcome these two problems. We designed the SWIPT and cooperative jamming scheme, minimizing the total transmission power by properly selecting beamforming vectors of the WMN nodes and jammer to satisfy the individual signal-to-interference-plus-noise ratio (SINR) and energy harvesting (EH) constrains. Especially, we considered the channel estimate error caused by the imperfect channel state information. The SINR of eavesdropper (Eve) was suppressed to protect the secrecy of WMN nodes. Due to the fractional form, the problem was proved to be non-convex. We developed a tractable algorithm by transforming it into a convex one, utilizing semi-definite programming (SDP) relaxation and S-procedure methods. The simulation results validated the effectiveness of the proposed algorithm compared with the non-robust design.

Sign in / Sign up

Export Citation Format

Share Document