AntMeshNet

2014 ◽  
Vol 5 (1) ◽  
pp. 20-45 ◽  
Author(s):  
Sharad Sharma ◽  
Shakti Kumar ◽  
Brahmjit Singh
Keyword(s):  
Foraging Behavior ◽  
Network Architecture ◽  
Network Performance ◽  
Mesh Networks ◽  
Fault Tolerant ◽  
Dynamic Environment ◽  
Dynamic Network ◽  
Residual Energy ◽  
Network Resource ◽  
Self Organizing

Wireless Mesh Networks (WMNs) are emerging as evolutionary self organizing networks to provide connectivity to end users. Efficient Routing in WMNs is a highly challenging problem due to existence of stochastically changing network environments. Routing strategies must be dynamically adaptive and evolve in a decentralized, self organizing and fault tolerant way to meet the needs of this changing environment inherent in WMNs. Conventional routing paradigms establishing exact shortest path between a source-terminal node pair perform poorly under the constraints imposed by dynamic network conditions. In this paper, the authors propose an optimal routing approach inspired by the foraging behavior of ants to maximize the network performance while optimizing the network resource utilization. The proposed AntMeshNet algorithm is based upon Ant Colony Optimization (ACO) algorithm; exploiting the foraging behavior of simple biological ants. The paper proposes an Integrated Link Cost (ILC) measure used as link distance between two adjacent nodes. ILC takes into account throughput, delay, jitter of the link and residual energy of the node. Since the relationship between input and output parameters is highly non-linear, fuzzy logic was used to evaluate ILC based upon four inputs. This fuzzy system consists of 81 rules. Routing tables are continuously updated after a predefined interval or after a change in network architecture is detected. This takes care of dynamic environment of WMNs. A large number of trials were conducted for each model. The results have been compared with Adhoc On-demand Distance Vector (AODV) algorithm. The results are found to be far superior to those obtained by AODV algorithm for the same WMN.

Energy-Efficient Self-Organizing Routing for Wireless Mobile Networks

2009 ◽  
Vol 5 (4) ◽  
pp. 52-69 ◽  
Author(s):  
Melody Moh ◽  
Rashmi Kukanur ◽  
Xuquan Lin ◽  
Subhankar Dhar
Keyword(s):  
Mobile Networks ◽  
Energy Efficient ◽  
Network Performance ◽  
Power Saving ◽  
Residual Energy ◽  
Traffic Load ◽  
Hierarchical Routing ◽  
Traffic Demand ◽  
Time Space ◽  
Self Organizing

The instant deployment without relying on an existing infrastructure makes mobile ad hoc networks (MANET) a striking choice for many dynamic situations. An efficient MANET protocol may be applied to other important emerging wireless technologies, such as wireless mesh and sensor networks. This article proposes a hierarchical routing scheme that is scalable, energy efficient, and self-organizing. The new algorithm that is discussed in this article is the Dynamic Leader Set Generation (DLSG). This algorithm dynamically selects leader nodes based on traffic demand, locality, and residual energy level, and de-selects them based on residual energy. Therefore, energy consumption and traffic load are balanced throughout the network, and the network reorganizes itself around the dynamically selected leader nodes. Time, space, and message complexities are formally analyzed and implementation issues are also addressed. Incorporating the IEEE 802.11 medium access control mechanism and including the power saving mode, performance evaluation is carried out by simulating DLSG and four existing hierarchical routing algorithms. It shows that DLSG successfully extends network lifetime by 20 to 50% while achieving a comparable level of network performance.

scholarly journals Congestion Control for Fault Tolerant Multicast Routing in MANET

2016 ◽  
Vol 15 (9) ◽  
pp. 7041-7048
Author(s):  
Channabasayya Mathad ◽  
Paramesha Paramesha ◽  
D Srinivasa Rao
Keyword(s):  
Congestion Control ◽  
Network Performance ◽  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Multicast Routing ◽  
Fault Tolerant ◽  
Transmission Rate ◽  
Dynamic Network ◽  
Control Technique ◽  
Mobile Nodes

Mobile Ad hoc Network (MANET) is a collection of two or more devices or nodes or terminals with wireless communications and networking capability that communicate with each other without the aid of any centralized administrator a dynamic network consisting of several mobile nodes communicating wirelessly. MANET is an infrastructure less network and each member node is free to move in and out of the network in a random manner. Congestion may occur in any node when data packets travel from source to destination. Controlling congestion is critical to ensure adequate network operation and performance. Due to this mobile nature of the nodes in MANET, the possibility for the network to get congested is high. This may result in isolated nodes and reduced network performance. So in this paper, we proposed to develop a congestion control technique for fault tolerant multicast routing in MANET. In this technique, the congestion probability around the forwarding node is initially estimated and then according to the congestion level, the future transmission rates are adapted. The data transmission rate is varied dynamically to efficiently handle the congestion in the network. In this way, the network performance is enhanced.

scholarly journals PROVIDING THE BOUNDARY LINE CONTROLLED REQUEST WITH ADAPTABLE TRANSMISSION RATES IN WDM MESH NETWORKS

2013 ◽  
pp. 250-254
Author(s):  
ANUSHA ANNAPUREDDY ◽  
B. BALAJI
Keyword(s):  
Optical Networks ◽  
Bandwidth Allocation ◽  
Network Performance ◽  
Service Providers ◽  
Mesh Networks ◽  
Mixed Integer ◽  
Boundary Line ◽  
Network Resource ◽  
Mixed Integer Linear Program ◽  
Transmission Rates

The mixture of applications increases and supported over optical networks, to the network customers new service guarantees must be offered .The partitioning the data into multiple segments which can be processed independently the useful data to be transferred before a predefined deadline .this is a deadline driven request. To provide the request the customer chooses the bandwidth DDRs provide scheduling flexibility for the service providers. It chooses bandwidth while achieving two objectives 1.satisfying the guaranteed deadline 2.decreasing network resource utilization .by using bandwidth allocation policies improve the network performance and by using mixed integer linear program allows choosing flexible transmission rates.

COORDINATED DISTRIBUTED SCHEDULING IN WIRELESS MESH NETWORK

2012 ◽  
Vol 3 (3) ◽  
pp. 368-374
Author(s):  
Usha Kumari ◽  
Udai Shankar
Keyword(s):  
Network Performance ◽  
Mesh Networks ◽  
Mac Protocol ◽  
Scheduling Algorithm ◽  
Ieee 802.16 ◽  
Distributed Scheduling ◽  
Mesh Network ◽  
Fourth Generation ◽  
Network Nodes ◽  
Wireless Mesh

IEEE 802.16 based wireless mesh networks (WMNs) are a promising broadband access solution to support flexibility, cost effectiveness and fast deployment of the fourth generation infrastructure based wireless networks. Reducing the time for channel establishment is critical for low latency/interactive Applications. According to IEEE 802.16 MAC protocol, there are three scheduling algorithms for assigning TDMA slots to each network node: centralized and distributed the distributed is further divided into two operational modes coordinated distributed and uncoordinated distributed. In coordinated distributed scheduling algorithm, network nodes have to transmit scheduling message in order to inform other nodes about their transfer schedule. In this paper a new approach is proposed to improve coordinated distributed scheduling efficiency in IEEE 802.16 mesh mode, with respect to three parameter Throughput, Average end to end delay and Normalized Overhead. For evaluating the proposed networks efficiency, several extensive simulations are performed in various network configurations and the most important system parameters which affect the network performance are analyzed

scholarly journals FOSquare: A Novel Optical HPC Interconnect Network Architecture Based on Fast Optical Switches with Distributed Optical Flow Control

Photonics ◽  
2021 ◽  
Vol 8 (1) ◽  
pp. 11
Author(s):  
Fulong Yan ◽  
Changshun Yuan ◽  
Chao Li ◽  
Xiong Deng
Keyword(s):  
Flow Control ◽  
Network Architecture ◽  
Network Performance ◽  
Optical Switches ◽  
Low Power Consumption ◽  
Low Latency ◽  
High Bandwidth ◽  
Fast Flow ◽  
Real Traffic ◽  
Interconnect Network

Interconnecting networks adopting Fast Optical Switches (FOS) can achieve high bandwidth, low latency, and low power consumption. We propose and demonstrate a novel interconnecting topology based on FOS (FOSquare) with distributed fast flow control which is suitable for HPC infrastructures. We also present an Optimized Mapping (OPM) algorithm that maps the most communication-related processes inside a rack. We numerically investigate and compare the network performance of FOSquare with Leaf-Spine under real traffic traces collected by running multiple applications (CG, MG, MILC, and MINI_MD) in an HPC infrastructure. The numerical results show that the FOSquare can reduce >10% latency with respect to Leaf-Spine under the scenario of 16 available cores.

A Optimization Traffic Grooming Algorithm Based on Bidirectional SONET Ring Topology Network

2015 ◽  
Vol 727-728 ◽  
pp. 996-999 ◽  
Author(s):  
Su Xia Cui
Keyword(s):  
Resource Utilization ◽  
Network Performance ◽  
Minimum Weight ◽  
Routing Algorithm ◽  
Traffic Grooming ◽  
Network Routing ◽  
Ring Network ◽  
Network Resource ◽  
Blocking Rate ◽  
The Impact

The issue of WDM network traffic grooming has been a hot in the field of research. The implementation of traffic grooming technology can improve the utilization of wavelength channels, reducing the link delay and the blocking rate of the network, which to improve network resource utilization and optimize network performance. This article mainly studies all-optical network routing algorithm utilizing WDM technology to achieve the dynamic traffic grooming and propose a optimization grooming policy -HaffmanGroom (M) algorithms which based on SONET / WDM ring network. The most important feature of this algorithm is that the SONET / WDM ring network of multiple multicast request packet , with a minimum weight of the light path priority selection method, the flow of requests each group effectively optimize ease . The algorithm takes into account the impact of the link request factor and link hops to optimize the link selection. The simulation results show that under the conditions of factors and the number of hop a request fully consider the impact of these two factors to the link, and can achieve optimal link with the smallest weights for effective data transmission, improving resource utilization, reducing blocking rate in order to achieve the purpose of optimizing network performance.

Research on robust adaptive sliding film fault-tolerant control under nonlinear distortion of signal transmission in amorphous flat air-to-ground wireless ad-hoc network system

2022 ◽  
Vol ahead-of-print (ahead-of-print) ◽  
Author(s):  
Zhifang Wang ◽  
Jianguo Yu ◽  
Shangjing Lin
Keyword(s):  
Nonlinear Distortion ◽  
Ad Hoc ◽  
Fault Tolerant ◽  
Signal Transmission ◽  
Network System ◽  
Long Distance ◽  
Content Type ◽  
Wireless Signal ◽  
Robust Adaptive ◽  
Self Organizing

Purpose To solve the above problems and ensure the stability of the ad hoc network node topology in the process of wireless signal transmission, this paper aims to design a robust adaptive sliding film fault-tolerant controller under the nonlinear distortion of signal transmission in an amorphous flat air-to-ground wireless ad hoc network system. Design/methodology/approach This paper designs a robust adaptive sliding film fault-tolerant controller under the nonlinear distortion of signal transmission in an amorphous flat air-to-ground wireless ad hoc network system. Findings The simulation results show that the amorphous flat wireless self-organizing network system has good nonlinear distortion fault-tolerant correction ability under the feedback control of the designed controller, and the system has the asymptotically stable convergence ability; the test results show: the node topology of the self-organizing network structural stability is significantly improved, which provides a foundation for the subsequent realization of long-distance transmission of ad hoc network nodes. Research limitations/implications Because of the chosen research approach, the research results may lack generalizability. Therefore, researchers are encouraged to test the proposed propositions further. Originality/value The controller can extract the fault information caused by nonlinear distortion in the wireless signal transmission process, and at the same time, its feedback matrix K can gradually converge the generated wireless signal error to zero, to realize the stable transmission of the wireless signal.

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 An Enhanced Clustering Method for Extending Sensing Lifetime of Wireless Sensor Network

2021 ◽  
pp. 67-82
Author(s):  
Yakubu Abdul-Wahab Nawusu ◽  
Alhassan Abdul-Barik ◽  
Salifu Abdul-Mumin
Keyword(s):  
Wireless Sensor Network ◽  
Sensor Network ◽  
Network Performance ◽  
Rank Order ◽  
Cluster Head ◽  
Residual Energy ◽  
Base Station ◽  
Wireless Sensor ◽  
Cluster Heads ◽  
Heterogeneous Wireless Sensor Network

Extending the lifetime of a wireless sensor network is vital in ensuring continuous monitoring functions in a target environment. Many techniques have appeared that seek to achieve such prolonged sensing gains. Clustering and improved selection of cluster heads play essential roles in the performance of sensor network functions. Cluster head in a hierarchical arrangement is responsible for transmitting aggregated data from member nodes to a base station for further user-specific data processing and analysis. Minimising the quick dissipation of cluster heads energy requires a careful choice of network factors when selecting a cluster head to prolong the lifetime of a wireless sensor network. In this work, we propose a multi-criteria cluster head selection technique to extend the sensing lifetime of a heterogeneous wireless sensor network. The proposed protocol incorporates residual energy, distance, and node density in selecting a cluster head. Each factor is assigned a weight using the Rank Order Centroid based on its relative importance. Several simulation tests using MATLAB 7.5.0 (R2007b) reveal improved network lifetime and other network performance indicators, including stability and throughput, compared with popular protocols such as LEACH and the SEP. The proposed scheme will be beneficial in applications requiring reliable and stable data sensing and transmission functions.

Sign in / Sign up

Export Citation Format

Share Document