In this paper, we address the problem of load balancing in Wireless Mesh Networks. We consider a Cluster Based Wireless Mesh Architecture in which the WMN is divided into clusters that could minimize the updating overhead during topology change due to mobility of mesh nodes or congestion of load on a cluster. Each cluster contains a gateway that has complete knowledge about group memberships and link state information in the cluster. The gateway is often elected in the cluster formation process. We consider load of gateways and try to reduce it. As a matter of fact when a gateway undertakes to be an interface for connecting nodes of a wireless mesh network to other networks or internet, there would be some problems such as congestion and bottleneck, so we introduce a new paradigm for these problems. For solving bottleneck we use clustering to reduce load of gateways and after that by use of dividing cluster we prevent from bottleneck on gateways. We study how to detect congestion on a gateway and how can reduce loads of it that preventing from bottleneck on gateway and therefore increasing throughput of network to encountering many loads. So we propose an algorithm to detect bottleneck and remedies for load balancing in Wireless Mesh Networks. We also use Ns2-Emultion for implementing and testing the framework. Some qualitative results are provided to prove the correctness and the advantages of our framework.
Wireless mesh networks offer high bandwidth Internet access for mobile users anywhere and at any time.
It is an emerging technology that uses wireless multi-hop networking to provide a cost-efficient way for
community or enterprise users to have broadband Internet access and share network resource. In this paper,
we have tried to give a comparative analysis of various Gateway Placement approaches which can be
helpful in understanding which approach will be useful in which situation.
Congestion control, routing, and scheduling 2015parry prabhu
This document summarizes a research paper about congestion control, routing, and scheduling in wireless networks with interference cancellation capabilities. It discusses using successive interference cancellation (SIC) to allow multiple concurrent transmissions and increase network capacity. The paper formulates the joint congestion control, routing, and scheduling problem and solves it in a distributed manner using dual decomposition. It develops a decentralized algorithm for link scheduling under the physical SINR interference model that coordinates local transmissions and achieves similar results to centralized greedy maximal scheduling. The paper evaluates the performance gains from SIC and shows that network flows can achieve up to twice their rates compared to networks without interference cancellation.
AN EFFICIENT ROUTING PROTOCOL FOR DELAY TOLERANT NETWORKS (DTNs)cscpconf
Delay-Tolerant Networks are those which lacks continuous communications among mobile
nodes . Distributed clustering scheme and cluster-based routing protocol are used for DelayTolerant
Mobile Networks (DTMNs). The basic idea is to distributive group mobile nodes with
similar mobility pattern into a cluster, which can then interchangeably share their resources for
overhead reduction and load balancing, aiming to achieve efficient and scalable routing in DTMN. Load balancing is carried out in two ways, Intra cluster load balancing and Inter cluster load balancing. The Convergence and stability become major challenges in distributed clustering in DTMN. An efficient routing protocol will be provided for the delay tolerant networks through which the stability of the network is maintained .Based on nodal contact probabilities, a set of functions including Sync(), Leave(), and Join() are devised for cluster formation and gateway selection. Finally, the gateway nodes exchange network information and perform routing
MULTI-HOP BANDWIDTH MANAGEMENT PROTOCOL FOR MOBILE AD HOC NETWORKSIJMIT JOURNAL
An admission control scheme should play the role of a coordinator for flows in a data communication network, to provide the guarantees as the medium is shared. The nodes of a wired network can monitor the medium to know the available bandwidth at any point of time. But, in wireless ad hoc networks, a node must consume the bandwidth of neighboring nodes, during a communication. Hence, the consumption of bandwidth by a flow and the availability of resources to any wireless node strictly depend upon the neighboring nodes within its transmission range. We present a scalable and efficient admission control scheme, Multi-hop Bandwidth Management Protocol (MBMP), to support the QoS requirements
in multi-hop ad hoc networks. We simulate several options to design MBMP and compare the performances of these options through mathematical analysis and simulation results, and compare its effectiveness with the existing admission control schemes through extensive simulations.
Developing QoS by Priority Routing for Real Time Data in Internet of Things (...IJCNCJournal
- The document discusses developing quality of service (QoS) in Internet of Things (IoT) networks by using priority routing for real-time data.
- It proposes a novel solution that integrates mobile ad hoc networks (MANETs) to improve delivery of high priority real-time application data over low latency MANET paths.
- Experimental results showed the proposed approach was effective in reducing network overhead and congestion, while also improving routing protocol performance in terms of packet delay and throughput.
This document discusses an autonomous network reconfiguration system (ARS) for multi-radio wireless mesh networks. ARS allows a network to self-recover from local link failures in order to maintain performance. It uses a reconfiguration planning algorithm to determine the minimum necessary changes needed for recovery. When a link failure is detected, ARS triggers the formation of a local group and designates a leader to coordinate reconfiguration. The leader requests a reconfiguration plan from a gateway, which is then implemented by group members to resolve the failure. ARS aims to reconfigure autonomously and locally in response to failures while limiting effects on healthy parts of the network.
Power Aware Cluster to Minimize Load In Mobile Ad Hoc NetworksIJRES Journal
Mobile ad hoc networks (MANETs) are popularly known to their mobility and ease of usage. These networks are a set of identical nodes that move freely to communicate among networks and they are represented as a set of clusters. However, their wireless and active natures cause them to be more susceptible to various types of security attacks and transmission energy consumption so that they drop out of the network easily. Now-a-days the major challenge of MANETS is to endow with the assurance to the secure network services and also to provide a nearby balance of load for the cluster-heads. To meet this confront, certificate revocation with load balancing is an important central component to provide security and energy conservation in the network communications. In this paper, we focus on load balancing clustering to widen the lifetime of the cluster-head for a maximum time before allowing it to withdraw so as to distribute the responsibility to other legitimate nodes in the cluster to act as a cluster-head along with the issue of certificate revocation process. For quick, accurate, secure certificate revocation and to conserve energy, we propose the CCRV with Load Balancing Clustering scheme where we can reduce the burden of the cluster along with secure certificate revocation. In particular, to minimize the transmission energy consumption, we use the master slave model to operate the network with longer lifetime and we propose load balancing mechanism to enhance the lifetime of the cluster-head.
ENERGY EFFICIENT MULTICAST ROUTING IN MANET ijac journal
In this paper, we have presented the Modified Multicasting through Time Reservation using Adaptive
Control for Excellent Energy efficiency (MMC-TRACE). It is a real time multicasting architecture for
Mobile Ad-Hoc networks to make their work an energy efficient one .MMC-TRACE is a cross layer design
where the network layer and medium access control layer functionality are done in a single integrated
layer design. The basic design of the architecture is to establish and maintain an active multicast tree
surrounded by a passive mesh within a mobile ad hoc network. Energy efficiency is maximized by enabling
the particular node from sleep to awake mode while the remaining nodes of the same path are maintained
at sleep mode. Energy efficiency too achieved by eliminating most of the redundant data receptions across
nodes. The performance of MMC-TRACE are evaluated with the help of ns-2 simulations and comparisons
are made with its predecessor such as MC-TRACE. The results show that the MMC-TRACE provides
superior energy efficiency, competitive QoS performance and bandwidth efficiency.
Wireless mesh networks offer high bandwidth Internet access for mobile users anywhere and at any time.
It is an emerging technology that uses wireless multi-hop networking to provide a cost-efficient way for
community or enterprise users to have broadband Internet access and share network resource. In this paper,
we have tried to give a comparative analysis of various Gateway Placement approaches which can be
helpful in understanding which approach will be useful in which situation.
Congestion control, routing, and scheduling 2015parry prabhu
This document summarizes a research paper about congestion control, routing, and scheduling in wireless networks with interference cancellation capabilities. It discusses using successive interference cancellation (SIC) to allow multiple concurrent transmissions and increase network capacity. The paper formulates the joint congestion control, routing, and scheduling problem and solves it in a distributed manner using dual decomposition. It develops a decentralized algorithm for link scheduling under the physical SINR interference model that coordinates local transmissions and achieves similar results to centralized greedy maximal scheduling. The paper evaluates the performance gains from SIC and shows that network flows can achieve up to twice their rates compared to networks without interference cancellation.
AN EFFICIENT ROUTING PROTOCOL FOR DELAY TOLERANT NETWORKS (DTNs)cscpconf
Delay-Tolerant Networks are those which lacks continuous communications among mobile
nodes . Distributed clustering scheme and cluster-based routing protocol are used for DelayTolerant
Mobile Networks (DTMNs). The basic idea is to distributive group mobile nodes with
similar mobility pattern into a cluster, which can then interchangeably share their resources for
overhead reduction and load balancing, aiming to achieve efficient and scalable routing in DTMN. Load balancing is carried out in two ways, Intra cluster load balancing and Inter cluster load balancing. The Convergence and stability become major challenges in distributed clustering in DTMN. An efficient routing protocol will be provided for the delay tolerant networks through which the stability of the network is maintained .Based on nodal contact probabilities, a set of functions including Sync(), Leave(), and Join() are devised for cluster formation and gateway selection. Finally, the gateway nodes exchange network information and perform routing
MULTI-HOP BANDWIDTH MANAGEMENT PROTOCOL FOR MOBILE AD HOC NETWORKSIJMIT JOURNAL
An admission control scheme should play the role of a coordinator for flows in a data communication network, to provide the guarantees as the medium is shared. The nodes of a wired network can monitor the medium to know the available bandwidth at any point of time. But, in wireless ad hoc networks, a node must consume the bandwidth of neighboring nodes, during a communication. Hence, the consumption of bandwidth by a flow and the availability of resources to any wireless node strictly depend upon the neighboring nodes within its transmission range. We present a scalable and efficient admission control scheme, Multi-hop Bandwidth Management Protocol (MBMP), to support the QoS requirements
in multi-hop ad hoc networks. We simulate several options to design MBMP and compare the performances of these options through mathematical analysis and simulation results, and compare its effectiveness with the existing admission control schemes through extensive simulations.
Developing QoS by Priority Routing for Real Time Data in Internet of Things (...IJCNCJournal
- The document discusses developing quality of service (QoS) in Internet of Things (IoT) networks by using priority routing for real-time data.
- It proposes a novel solution that integrates mobile ad hoc networks (MANETs) to improve delivery of high priority real-time application data over low latency MANET paths.
- Experimental results showed the proposed approach was effective in reducing network overhead and congestion, while also improving routing protocol performance in terms of packet delay and throughput.
This document discusses an autonomous network reconfiguration system (ARS) for multi-radio wireless mesh networks. ARS allows a network to self-recover from local link failures in order to maintain performance. It uses a reconfiguration planning algorithm to determine the minimum necessary changes needed for recovery. When a link failure is detected, ARS triggers the formation of a local group and designates a leader to coordinate reconfiguration. The leader requests a reconfiguration plan from a gateway, which is then implemented by group members to resolve the failure. ARS aims to reconfigure autonomously and locally in response to failures while limiting effects on healthy parts of the network.
Power Aware Cluster to Minimize Load In Mobile Ad Hoc NetworksIJRES Journal
Mobile ad hoc networks (MANETs) are popularly known to their mobility and ease of usage. These networks are a set of identical nodes that move freely to communicate among networks and they are represented as a set of clusters. However, their wireless and active natures cause them to be more susceptible to various types of security attacks and transmission energy consumption so that they drop out of the network easily. Now-a-days the major challenge of MANETS is to endow with the assurance to the secure network services and also to provide a nearby balance of load for the cluster-heads. To meet this confront, certificate revocation with load balancing is an important central component to provide security and energy conservation in the network communications. In this paper, we focus on load balancing clustering to widen the lifetime of the cluster-head for a maximum time before allowing it to withdraw so as to distribute the responsibility to other legitimate nodes in the cluster to act as a cluster-head along with the issue of certificate revocation process. For quick, accurate, secure certificate revocation and to conserve energy, we propose the CCRV with Load Balancing Clustering scheme where we can reduce the burden of the cluster along with secure certificate revocation. In particular, to minimize the transmission energy consumption, we use the master slave model to operate the network with longer lifetime and we propose load balancing mechanism to enhance the lifetime of the cluster-head.
ENERGY EFFICIENT MULTICAST ROUTING IN MANET ijac journal
In this paper, we have presented the Modified Multicasting through Time Reservation using Adaptive
Control for Excellent Energy efficiency (MMC-TRACE). It is a real time multicasting architecture for
Mobile Ad-Hoc networks to make their work an energy efficient one .MMC-TRACE is a cross layer design
where the network layer and medium access control layer functionality are done in a single integrated
layer design. The basic design of the architecture is to establish and maintain an active multicast tree
surrounded by a passive mesh within a mobile ad hoc network. Energy efficiency is maximized by enabling
the particular node from sleep to awake mode while the remaining nodes of the same path are maintained
at sleep mode. Energy efficiency too achieved by eliminating most of the redundant data receptions across
nodes. The performance of MMC-TRACE are evaluated with the help of ns-2 simulations and comparisons
are made with its predecessor such as MC-TRACE. The results show that the MMC-TRACE provides
superior energy efficiency, competitive QoS performance and bandwidth efficiency.
Energy Consumption in Ad Hoc Network With Agents Minimizing the Number of Hop...CSCJournals
Wireless mobile ad-hoc network (MANET) is a special kind of network, where all of the nodes move in time. Node is intended to help relaying packets of neighboring nodes using multi-hop routing mechanism in order to solve problem of dead communication. MANET which engages broadcasting and contains multiple hops becomes increasingly vulnerable to problems such as mobile node’s energy degradation, routing problem and rapid increasing of overhead packets. This paper provides an extensive study of energy consumption in the MANET that consists of several network areas with the presence agents. Agents will minimize number of hops and its affect in linearity with the delay. As nodes grow, either in data transmission services or coverage of node’s communication or more agents stand in overlapped locations, accordingly data exchange and topology development to adapt the network are becoming an important issue. As a result, agents are needed to support process automation, high-level connectivity and intelligent service on that such environment. We evaluate the agents’ performance and network energy consumption for supporting MANET. The proposed agents provides service packets transmission between networks; e.g. determine appropriate relay nodes dynamically, maintain the transmission between networks through another nodes, share the topology knowledge among agents, and route packets between source and final destination that are unable to communicate directly. The achievement on research with this approach is conducted via simulation study. A similar network without agents is presented to derive such referential bounds by using appropriate functions of network agents. The proposed algorithm is confirmed with composite simulation results.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
EFFICIENT PACKET DELIVERY APPROACH FOR ADHOC WIRELESS NETWORKS cscpconf
A wireless ad-hoc network is a collection of nodes which are selfconfiguring,
connected by wireless links. The nodes are free to move randomly and
organize themselves arbitrarily; thus, the network's topology may change rapidly and
unpredictably. These kinds of networks are very flexible and they do not require any
existing infrastructure. Therefore, ad-hoc wireless networks are suitable for temporary
communication links. The biggest challenge in these kinds of networks is to find a path
between the communication end points of nodes that are mobile. Due to the limited
transmission range of wireless interfaces, the communication traffic has to be relayed
over several intermediate nodes to enable the communication between two nodes.
Therefore, these kinds of networks are also called multi-hop ad-hoc networks. The
proposed model is designed to improve the problems of real-time event-based
communication. It improves the packet delivery ratio by prior prediction and reduces
end-to-end packet delay. This in turn improves performance of the routing process
significantly and increases the Quality of Service (QoS).
Enhancement of qos in multihop wireless networks by delivering cbr using lb a...eSAT Publishing House
This document summarizes a research paper that proposes using the Leaky Bucket Algorithm to enhance quality of service (QoS) in multi-hop wireless networks delivering constant bit rate (CBR) traffic. The Leaky Bucket Algorithm aims to reduce transmission delay by delivering packets at a constant rate even when packets arrive in bursts. It combines joint congestion control and a scheduling algorithm to not only achieve provable throughput guarantees, but also place explicit upper bounds on the end-to-end delay of each flow. Simulation results show the proposed approach reduces transmission time and improves throughput compared to existing scheduling algorithms that do not consider delay performance.
Enhancement of qos in multihop wireless networks by delivering cbr using lb a...eSAT Journals
Abstract One of the most complicated issues is to measuring the delay performance of end to end nodes in Multi-hop Wireless Networks. The two nodes are communicating via hopping over the multiple wireless links. The fact that is each node has to concentrate not only its own generated traffic, but also relayed one. Observing unfairness particularly for transmissions among nodes that are more than one hop Most of the existing works deals with the joint congestion control and scheduling algorithm, which does not focusing the delay performance. In turn, considering the throughput metric alone although for congestion control flows, throughput is the repeated difficult performance metric Packet delay is also important because practical congestion control protocols need to establish the timeouts for the retransmissions based on the packet delay, such parameters could significantly impact the speed of recovery when loss of packets occurred. The related issues on the delay-performance First, for long flows, the end to end delay may grow in terms of square with based on the number of hops. Second, it is difficult to control the end-to-end delay of each flows. TDMA schedules the transmissions in a fair way, in terms of throughput per connection, considering the communication requirements of the active flows of the network. It does not work properly in the multi-hop scenario, because it is generated only for single hop networks, We propose The Leaky Bucket Algorithm, in addition to joint congestion control and scheduling algorithm in multi-hop wireless networks. The proposed algorithm not only achieves the provable throughput and also considering the upper bounds of the delay of each flow. It reduces the transmission time by delivering packets at a constant bit rate even it receives the packet at a busty way. Keywords- Multi-hop wireless networks, congestion control, Performance, Delay, Flow, Throughput.
International Journal of Engineering Research and Applications (IJERA) aims to cover the latest outstanding developments in the field of all Engineering Technologies & science.
International Journal of Engineering Research and Applications (IJERA) is a team of researchers not publication services or private publications running the journals for monetary benefits, we are association of scientists and academia who focus only on supporting authors who want to publish their work. The articles published in our journal can be accessed online, all the articles will be archived for real time access.
Our journal system primarily aims to bring out the research talent and the works done by sciaentists, academia, engineers, practitioners, scholars, post graduate students of engineering and science. This journal aims to cover the scientific research in a broader sense and not publishing a niche area of research facilitating researchers from various verticals to publish their papers. It is also aimed to provide a platform for the researchers to publish in a shorter of time, enabling them to continue further All articles published are freely available to scientific researchers in the Government agencies,educators and the general public. We are taking serious efforts to promote our journal across the globe in various ways, we are sure that our journal will act as a scientific platform for all researchers to publish their works online.
This document summarizes and categorizes different weight-based clustering algorithms that have been designed for mobile ad hoc networks (MANETs). It discusses:
1) The basic concept of clustering in MANETs and the roles of standard nodes, cluster heads, and cluster gateways.
2) Two categories of clustering algorithms - simple (e.g. lowest ID, connectivity-based) and enhanced (e.g. k-cluster, hierarchical) approaches.
3) Weighted clustering, where each node calculates a weight based on attributes like speed, degree, power, and energy to elect cluster heads.
Defeating jamming with the power of silence a gametheoretic analysisranjith kumar
Dear Student,
DREAMWEB TECHNO SOLUTIONS is one of the Hardware Training and Software Development centre available in
Trichy. Pioneer in corporate training, DREAMWEB TECHNO SOLUTIONS provides training in all software
development and IT-related courses, such as Embedded Systems, VLSI, MATLAB, JAVA, J2EE, CIVIL,
Power Electronics, and Power Systems. It’s certified and experienced faculty members have the
competence to train students, provide consultancy to organizations, and develop strategic
solutions for clients by integrating existing and emerging technologies.
ADD: No:73/5, 3rd Floor, Sri Kamatchi Complex, Opp City Hospital, Salai Road, Trichy-18
Contact @ 7200021403/04
phone: 0431-4050403
This document summarizes a survey on routing algorithms for anycast in wireless mesh networks. It discusses how using anycast-based routing instead of traditional routing can improve network performance by better selecting gateways. Three popular anycast heuristics are examined: one optimizes load balancing, another improves quality of service and minimizes interference, and a third uses ant colony optimization. The survey compares these anycast implementations to AODV routing and determines the best approach for wireless mesh networks adapts to select gateways.
Improvement at Network Planning using Heuristic Algorithm to Minimize Cost of...Yayah Zakaria
Wireless Mesh Networks (WMN) consists of wireless stations that are connected with each other in a semi-static configuration. Depending on the configuration of a WMN, different paths between nodes offer different levels of efficiency. One areas of research with regard to WMN is cost minimization. A Modified Binary Particle Swarm Optimization (MBPSO) approach was used to optimize cost. However, minimized cost does not
guarantee network performance. This paper thus, modified the minimization function to take into consideration the distance between the different nodes so as to enable better performance while maintaining cost balance. The results were positive with the PDR showing an approximate increase of 17.83% whereas the E2E delay saw an approximate decrease of 8.33%.
This document summarizes a research paper that proposes a new cooperative channel load aware VoIP routing topology for 802.11 WLAN networks. It introduces the concept of cooperative channel transmitting technology for 802.11 WLAN networks and discusses some of the challenges in providing quality of service guarantees. It then presents a linear programming model and scheduling algorithm to implement cooperative channel transmissions while considering queue status and transitive node relationships to maximize throughput. Simulation results show that the proposed scheduling algorithm improves throughput and fairness compared to alternatives.
A New Efficient Cache Replacement Strategy for Named Data NetworkingIJCNCJournal
The Information-Centric Network (ICN) is a future internet architecture with efficient content retrieval and distribution. Named Data Networking (NDN) is one of the proposed architectures for ICN. NDN’s innetwork caching improves data availability, reduce retrieval delays, network load, alleviate producer load, and limit data traffic. Despite the existence of several caching decision algorithms, the fetching and distribution of contents with minimum resource utilization remains a great challenge. In this paper, we introduce a new cache replacement strategy called Enhanced Time and Frequency Cache Replacement strategy (ETFCR) where both cache hit frequency and cache retrieval time are used to select evicted data chunks. ETFCR adds time cycles between the last two requests to adjust data chunk’s popularity and cache hits. We conducted extensive simulations using the ccnSim simulator to evaluate the performance of ETFCR and compare it to that of some well-known cache replacement strategies. Simulations results show that ETFCR outperforms the other cache replacement strategies in terms of cache hit ratio, and lower content retrieval delay.
EFFECTS OF MAC PARAMETERS ON THE PERFORMANCE OF IEEE 802.11 DCF IN NS-3ijwmn
This paper presents the design procedure of the NS-3 script for WLAN that is organized according to the hierarchical manner of TCP/IP model. We configure all layers by using NS-3 model objects and set and modify the values used by objects to investigate the effects of MAC parameters (access mechanism, CWmin, CWmax and retry limit) on the performance metrics viz. packet delivery ratio, packet lost ratio, aggregated throughput, and average delay. The simulation results show that RTS/CTS access mechanism outperforms basic access mechanism in saturated state, whereas the MAC parameters have no significant impact on network performance in non-saturated state. A higher value of CWmin improves the aggregated throughput in expense of average delay. The tradeoff relationships among the performance metrics are also observed in results for the optimal values of MAC parameters. Our design procedure represents a good guideline for new NS-3 users to design and modify script and results greatly benefit the network design and management.
PROPOSED A HETEROGENEOUS CLUSTERING ALGORITHM TO IMPROVE QOS IN WSNIJCNCJournal
In this article it has presented leach extended hierarchical 3-level clustered heterogeneous and dynamics
algorithm. On suggested protocol (LEH3LA) with planning of selected auction cluster head, and
alternative cluster head node, problem of delay on processing, processing of selecting members, decrease
of expenses, and energy consumption, decrease of sending message, and receiving messages inside the
clusters, selecting of cluster heads in large sensor networks were solved. This algorithm uses hierarchical
heterogeneous network (3-levels), collective intelligence, and intra-cluster interaction for communications.
Also it will solve the problems of sending data in Multi-BS mobile networks, expanding inter-cluster
networks, overlap cluster, genesis orphan nodes, boundary change dynamically clusters, using backbone
networks, cloud sensor. Using sleep/wake scheduling algorithm or TDMA-schedule alternative cluster head
node provides redundancy, and fault tolerance. Local processing in cluster head nodes, and alternative
cluster head, intra-cluster and inter-cluster communications such as Multi-HOP cause increase on
processing speed, and sending data intra-cluster and inter-cluster. Decrease of overhead network, and
increase the load balancing among cluster heads. Using encapsulation of data method, by cluster head
nodes, energy consumption decrease during sending data. Also by improving quality of service (QoS) in
CBRP, LEACH, 802.15.4, decrease of energy consumption in sensors, cluster heads and alternative cluster
head nodes, cause increase on lift time of sensor networks.
Clustering effects on wireless mobile ad hoc networks performancesijcsit
A new era is dawning for wireless mobile ad hoc networks where communication will be done using a
group of mobile devices called cluster, hence clustered network. In a clustered network, protocols used by
these mobile devices are different from those used in a wired network; which helps to save computation
time and resources efficiently. This paper focuses on Cluster-Based Routing Protocol and Dynamic Source
Routing. The results presented in this paper illustrates the implementation of Ad-hoc On-Demand Distance
Vector routing protocol for enhancing mobile nodes performance and lifetime in a clustered network and to
demonstrate how this routing protocol results in time efficient and resource saving in wireless mobile ad
hoc networks.
Modified q aware scheduling algorithm for improved fairness in 802.16 j networksIJCNCJournal
Deployment of Multi-hop Relays in WiMax based Cellu
lar Networks is considered as a cost effective
solution to increase the Coverage area of Base Stat
ion and also to improve the Network Capacity with h
igh
quality short links. Scheduling became a challengin
g task in these Multi-hop Relay Wireless Cellular
Networks of IEEE 802.16j standard. H. Chen, X. Xie
and H. Wu proposed a Q-aware Scheduling
Algorithm in which back-pressure flow control mecha
nism is used to reflect current Q size of the Relay
s
and considered high back-pressure links to include
in Concurrent Transmission Scenarios, to maximize t
he
throughput. This focus on high back-pressure links,
leads to starvation of Mobile Stations having low
back-
pressure links, resulting unfairness in some cases.
To remedy this situation, a Fair Link Inclusion (F
LI)
mechanism is applied in Greedy Algorithm of Q-aware
Scheduling Algorithm. Simulation results show that
Modified Q-aware Scheduling Algorithm with FLI mech
anism has reasonable improvement in fairness and
maintaining steady throughput when compared with ex
isting algorithms.
AN EFFECTIVE CONTROL OF HELLO PROCESS FOR ROUTING PROTOCOL IN MANETSIJCNCJournal
In the mobile ad hoc network (MANET) update of link connectivity is necessary to refresh the neighbor tables in data transfer. A existing hello process periodically exchanges the link connectivity information, which is not adequate for dynamic topology. Here, slow update of neighbour table entries causes link failures which affect performance parameter as packet drop, maximum delay, energy consumption, and reduced throughput. In the dynamic hello technique, new neighbour nodes and lost neighbour nodes are used to compute link change rate (LCR) and hello-interval/refresh rate (r). Exchange of link connectivity information at a fast rate consumes unnecessary bandwidth and energy. In MANET resource wastage can be controlled by avoiding the re-route discovery, frequent error notification, and local repair in the entire network. We are enhancing the existing hello process, which shows significant improvement in performance.
Dear Student,
DREAMWEB TECHNO SOLUTIONS is one of the Hardware Training and Software Development centre available in
Trichy. Pioneer in corporate training, DREAMWEB TECHNO SOLUTIONS provides training in all software
development and IT-related courses, such as Embedded Systems, VLSI, MATLAB, JAVA, J2EE, CIVIL,
Power Electronics, and Power Systems. It’s certified and experienced faculty members have the
competence to train students, provide consultancy to organizations, and develop strategic
solutions for clients by integrating existing and emerging technologies.
ADD: No:73/5, 3rd Floor, Sri Kamatchi Complex, Opp City Hospital, Salai Road, Trichy-18
Contact @ 7200021403/04
phone: 0431-4050403
El documento describe tres estrategias de enseñanza-aprendizaje de informática que utilizan las TIC: 1) el blog personal del estudiante, que les permite publicar contenidos y reflexionar; 2) la organización del portafolio digital del estudiante, que muestra su progreso; y 3) hacer resúmenes de clase para mejorar la expresión escrita y la síntesis. El documento concluye que estas estrategias son útiles en el aula ya que motivan a los estudiantes y brindan diversidad al docente.
La oficina de Prevención en Violencia de Género de Nogoyá invita a la población a participar el 3 de junio en Plaza Libertad de las actividades de la marcha nacional contra la violencia hacia las mujeres bajo el lema Ni Una Menos, ya que es fundamental que toda la sociedad acompañe esta causa justa que se opone a la violencia contra la mujer y promueve la igualdad de género y el respeto a los derechos humanos.
Energy Consumption in Ad Hoc Network With Agents Minimizing the Number of Hop...CSCJournals
Wireless mobile ad-hoc network (MANET) is a special kind of network, where all of the nodes move in time. Node is intended to help relaying packets of neighboring nodes using multi-hop routing mechanism in order to solve problem of dead communication. MANET which engages broadcasting and contains multiple hops becomes increasingly vulnerable to problems such as mobile node’s energy degradation, routing problem and rapid increasing of overhead packets. This paper provides an extensive study of energy consumption in the MANET that consists of several network areas with the presence agents. Agents will minimize number of hops and its affect in linearity with the delay. As nodes grow, either in data transmission services or coverage of node’s communication or more agents stand in overlapped locations, accordingly data exchange and topology development to adapt the network are becoming an important issue. As a result, agents are needed to support process automation, high-level connectivity and intelligent service on that such environment. We evaluate the agents’ performance and network energy consumption for supporting MANET. The proposed agents provides service packets transmission between networks; e.g. determine appropriate relay nodes dynamically, maintain the transmission between networks through another nodes, share the topology knowledge among agents, and route packets between source and final destination that are unable to communicate directly. The achievement on research with this approach is conducted via simulation study. A similar network without agents is presented to derive such referential bounds by using appropriate functions of network agents. The proposed algorithm is confirmed with composite simulation results.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
EFFICIENT PACKET DELIVERY APPROACH FOR ADHOC WIRELESS NETWORKS cscpconf
A wireless ad-hoc network is a collection of nodes which are selfconfiguring,
connected by wireless links. The nodes are free to move randomly and
organize themselves arbitrarily; thus, the network's topology may change rapidly and
unpredictably. These kinds of networks are very flexible and they do not require any
existing infrastructure. Therefore, ad-hoc wireless networks are suitable for temporary
communication links. The biggest challenge in these kinds of networks is to find a path
between the communication end points of nodes that are mobile. Due to the limited
transmission range of wireless interfaces, the communication traffic has to be relayed
over several intermediate nodes to enable the communication between two nodes.
Therefore, these kinds of networks are also called multi-hop ad-hoc networks. The
proposed model is designed to improve the problems of real-time event-based
communication. It improves the packet delivery ratio by prior prediction and reduces
end-to-end packet delay. This in turn improves performance of the routing process
significantly and increases the Quality of Service (QoS).
Enhancement of qos in multihop wireless networks by delivering cbr using lb a...eSAT Publishing House
This document summarizes a research paper that proposes using the Leaky Bucket Algorithm to enhance quality of service (QoS) in multi-hop wireless networks delivering constant bit rate (CBR) traffic. The Leaky Bucket Algorithm aims to reduce transmission delay by delivering packets at a constant rate even when packets arrive in bursts. It combines joint congestion control and a scheduling algorithm to not only achieve provable throughput guarantees, but also place explicit upper bounds on the end-to-end delay of each flow. Simulation results show the proposed approach reduces transmission time and improves throughput compared to existing scheduling algorithms that do not consider delay performance.
Enhancement of qos in multihop wireless networks by delivering cbr using lb a...eSAT Journals
Abstract One of the most complicated issues is to measuring the delay performance of end to end nodes in Multi-hop Wireless Networks. The two nodes are communicating via hopping over the multiple wireless links. The fact that is each node has to concentrate not only its own generated traffic, but also relayed one. Observing unfairness particularly for transmissions among nodes that are more than one hop Most of the existing works deals with the joint congestion control and scheduling algorithm, which does not focusing the delay performance. In turn, considering the throughput metric alone although for congestion control flows, throughput is the repeated difficult performance metric Packet delay is also important because practical congestion control protocols need to establish the timeouts for the retransmissions based on the packet delay, such parameters could significantly impact the speed of recovery when loss of packets occurred. The related issues on the delay-performance First, for long flows, the end to end delay may grow in terms of square with based on the number of hops. Second, it is difficult to control the end-to-end delay of each flows. TDMA schedules the transmissions in a fair way, in terms of throughput per connection, considering the communication requirements of the active flows of the network. It does not work properly in the multi-hop scenario, because it is generated only for single hop networks, We propose The Leaky Bucket Algorithm, in addition to joint congestion control and scheduling algorithm in multi-hop wireless networks. The proposed algorithm not only achieves the provable throughput and also considering the upper bounds of the delay of each flow. It reduces the transmission time by delivering packets at a constant bit rate even it receives the packet at a busty way. Keywords- Multi-hop wireless networks, congestion control, Performance, Delay, Flow, Throughput.
International Journal of Engineering Research and Applications (IJERA) aims to cover the latest outstanding developments in the field of all Engineering Technologies & science.
International Journal of Engineering Research and Applications (IJERA) is a team of researchers not publication services or private publications running the journals for monetary benefits, we are association of scientists and academia who focus only on supporting authors who want to publish their work. The articles published in our journal can be accessed online, all the articles will be archived for real time access.
Our journal system primarily aims to bring out the research talent and the works done by sciaentists, academia, engineers, practitioners, scholars, post graduate students of engineering and science. This journal aims to cover the scientific research in a broader sense and not publishing a niche area of research facilitating researchers from various verticals to publish their papers. It is also aimed to provide a platform for the researchers to publish in a shorter of time, enabling them to continue further All articles published are freely available to scientific researchers in the Government agencies,educators and the general public. We are taking serious efforts to promote our journal across the globe in various ways, we are sure that our journal will act as a scientific platform for all researchers to publish their works online.
This document summarizes and categorizes different weight-based clustering algorithms that have been designed for mobile ad hoc networks (MANETs). It discusses:
1) The basic concept of clustering in MANETs and the roles of standard nodes, cluster heads, and cluster gateways.
2) Two categories of clustering algorithms - simple (e.g. lowest ID, connectivity-based) and enhanced (e.g. k-cluster, hierarchical) approaches.
3) Weighted clustering, where each node calculates a weight based on attributes like speed, degree, power, and energy to elect cluster heads.
Defeating jamming with the power of silence a gametheoretic analysisranjith kumar
Dear Student,
DREAMWEB TECHNO SOLUTIONS is one of the Hardware Training and Software Development centre available in
Trichy. Pioneer in corporate training, DREAMWEB TECHNO SOLUTIONS provides training in all software
development and IT-related courses, such as Embedded Systems, VLSI, MATLAB, JAVA, J2EE, CIVIL,
Power Electronics, and Power Systems. It’s certified and experienced faculty members have the
competence to train students, provide consultancy to organizations, and develop strategic
solutions for clients by integrating existing and emerging technologies.
ADD: No:73/5, 3rd Floor, Sri Kamatchi Complex, Opp City Hospital, Salai Road, Trichy-18
Contact @ 7200021403/04
phone: 0431-4050403
This document summarizes a survey on routing algorithms for anycast in wireless mesh networks. It discusses how using anycast-based routing instead of traditional routing can improve network performance by better selecting gateways. Three popular anycast heuristics are examined: one optimizes load balancing, another improves quality of service and minimizes interference, and a third uses ant colony optimization. The survey compares these anycast implementations to AODV routing and determines the best approach for wireless mesh networks adapts to select gateways.
Improvement at Network Planning using Heuristic Algorithm to Minimize Cost of...Yayah Zakaria
Wireless Mesh Networks (WMN) consists of wireless stations that are connected with each other in a semi-static configuration. Depending on the configuration of a WMN, different paths between nodes offer different levels of efficiency. One areas of research with regard to WMN is cost minimization. A Modified Binary Particle Swarm Optimization (MBPSO) approach was used to optimize cost. However, minimized cost does not
guarantee network performance. This paper thus, modified the minimization function to take into consideration the distance between the different nodes so as to enable better performance while maintaining cost balance. The results were positive with the PDR showing an approximate increase of 17.83% whereas the E2E delay saw an approximate decrease of 8.33%.
This document summarizes a research paper that proposes a new cooperative channel load aware VoIP routing topology for 802.11 WLAN networks. It introduces the concept of cooperative channel transmitting technology for 802.11 WLAN networks and discusses some of the challenges in providing quality of service guarantees. It then presents a linear programming model and scheduling algorithm to implement cooperative channel transmissions while considering queue status and transitive node relationships to maximize throughput. Simulation results show that the proposed scheduling algorithm improves throughput and fairness compared to alternatives.
A New Efficient Cache Replacement Strategy for Named Data NetworkingIJCNCJournal
The Information-Centric Network (ICN) is a future internet architecture with efficient content retrieval and distribution. Named Data Networking (NDN) is one of the proposed architectures for ICN. NDN’s innetwork caching improves data availability, reduce retrieval delays, network load, alleviate producer load, and limit data traffic. Despite the existence of several caching decision algorithms, the fetching and distribution of contents with minimum resource utilization remains a great challenge. In this paper, we introduce a new cache replacement strategy called Enhanced Time and Frequency Cache Replacement strategy (ETFCR) where both cache hit frequency and cache retrieval time are used to select evicted data chunks. ETFCR adds time cycles between the last two requests to adjust data chunk’s popularity and cache hits. We conducted extensive simulations using the ccnSim simulator to evaluate the performance of ETFCR and compare it to that of some well-known cache replacement strategies. Simulations results show that ETFCR outperforms the other cache replacement strategies in terms of cache hit ratio, and lower content retrieval delay.
EFFECTS OF MAC PARAMETERS ON THE PERFORMANCE OF IEEE 802.11 DCF IN NS-3ijwmn
This paper presents the design procedure of the NS-3 script for WLAN that is organized according to the hierarchical manner of TCP/IP model. We configure all layers by using NS-3 model objects and set and modify the values used by objects to investigate the effects of MAC parameters (access mechanism, CWmin, CWmax and retry limit) on the performance metrics viz. packet delivery ratio, packet lost ratio, aggregated throughput, and average delay. The simulation results show that RTS/CTS access mechanism outperforms basic access mechanism in saturated state, whereas the MAC parameters have no significant impact on network performance in non-saturated state. A higher value of CWmin improves the aggregated throughput in expense of average delay. The tradeoff relationships among the performance metrics are also observed in results for the optimal values of MAC parameters. Our design procedure represents a good guideline for new NS-3 users to design and modify script and results greatly benefit the network design and management.
PROPOSED A HETEROGENEOUS CLUSTERING ALGORITHM TO IMPROVE QOS IN WSNIJCNCJournal
In this article it has presented leach extended hierarchical 3-level clustered heterogeneous and dynamics
algorithm. On suggested protocol (LEH3LA) with planning of selected auction cluster head, and
alternative cluster head node, problem of delay on processing, processing of selecting members, decrease
of expenses, and energy consumption, decrease of sending message, and receiving messages inside the
clusters, selecting of cluster heads in large sensor networks were solved. This algorithm uses hierarchical
heterogeneous network (3-levels), collective intelligence, and intra-cluster interaction for communications.
Also it will solve the problems of sending data in Multi-BS mobile networks, expanding inter-cluster
networks, overlap cluster, genesis orphan nodes, boundary change dynamically clusters, using backbone
networks, cloud sensor. Using sleep/wake scheduling algorithm or TDMA-schedule alternative cluster head
node provides redundancy, and fault tolerance. Local processing in cluster head nodes, and alternative
cluster head, intra-cluster and inter-cluster communications such as Multi-HOP cause increase on
processing speed, and sending data intra-cluster and inter-cluster. Decrease of overhead network, and
increase the load balancing among cluster heads. Using encapsulation of data method, by cluster head
nodes, energy consumption decrease during sending data. Also by improving quality of service (QoS) in
CBRP, LEACH, 802.15.4, decrease of energy consumption in sensors, cluster heads and alternative cluster
head nodes, cause increase on lift time of sensor networks.
Clustering effects on wireless mobile ad hoc networks performancesijcsit
A new era is dawning for wireless mobile ad hoc networks where communication will be done using a
group of mobile devices called cluster, hence clustered network. In a clustered network, protocols used by
these mobile devices are different from those used in a wired network; which helps to save computation
time and resources efficiently. This paper focuses on Cluster-Based Routing Protocol and Dynamic Source
Routing. The results presented in this paper illustrates the implementation of Ad-hoc On-Demand Distance
Vector routing protocol for enhancing mobile nodes performance and lifetime in a clustered network and to
demonstrate how this routing protocol results in time efficient and resource saving in wireless mobile ad
hoc networks.
Modified q aware scheduling algorithm for improved fairness in 802.16 j networksIJCNCJournal
Deployment of Multi-hop Relays in WiMax based Cellu
lar Networks is considered as a cost effective
solution to increase the Coverage area of Base Stat
ion and also to improve the Network Capacity with h
igh
quality short links. Scheduling became a challengin
g task in these Multi-hop Relay Wireless Cellular
Networks of IEEE 802.16j standard. H. Chen, X. Xie
and H. Wu proposed a Q-aware Scheduling
Algorithm in which back-pressure flow control mecha
nism is used to reflect current Q size of the Relay
s
and considered high back-pressure links to include
in Concurrent Transmission Scenarios, to maximize t
he
throughput. This focus on high back-pressure links,
leads to starvation of Mobile Stations having low
back-
pressure links, resulting unfairness in some cases.
To remedy this situation, a Fair Link Inclusion (F
LI)
mechanism is applied in Greedy Algorithm of Q-aware
Scheduling Algorithm. Simulation results show that
Modified Q-aware Scheduling Algorithm with FLI mech
anism has reasonable improvement in fairness and
maintaining steady throughput when compared with ex
isting algorithms.
AN EFFECTIVE CONTROL OF HELLO PROCESS FOR ROUTING PROTOCOL IN MANETSIJCNCJournal
In the mobile ad hoc network (MANET) update of link connectivity is necessary to refresh the neighbor tables in data transfer. A existing hello process periodically exchanges the link connectivity information, which is not adequate for dynamic topology. Here, slow update of neighbour table entries causes link failures which affect performance parameter as packet drop, maximum delay, energy consumption, and reduced throughput. In the dynamic hello technique, new neighbour nodes and lost neighbour nodes are used to compute link change rate (LCR) and hello-interval/refresh rate (r). Exchange of link connectivity information at a fast rate consumes unnecessary bandwidth and energy. In MANET resource wastage can be controlled by avoiding the re-route discovery, frequent error notification, and local repair in the entire network. We are enhancing the existing hello process, which shows significant improvement in performance.
Dear Student,
DREAMWEB TECHNO SOLUTIONS is one of the Hardware Training and Software Development centre available in
Trichy. Pioneer in corporate training, DREAMWEB TECHNO SOLUTIONS provides training in all software
development and IT-related courses, such as Embedded Systems, VLSI, MATLAB, JAVA, J2EE, CIVIL,
Power Electronics, and Power Systems. It’s certified and experienced faculty members have the
competence to train students, provide consultancy to organizations, and develop strategic
solutions for clients by integrating existing and emerging technologies.
ADD: No:73/5, 3rd Floor, Sri Kamatchi Complex, Opp City Hospital, Salai Road, Trichy-18
Contact @ 7200021403/04
phone: 0431-4050403
El documento describe tres estrategias de enseñanza-aprendizaje de informática que utilizan las TIC: 1) el blog personal del estudiante, que les permite publicar contenidos y reflexionar; 2) la organización del portafolio digital del estudiante, que muestra su progreso; y 3) hacer resúmenes de clase para mejorar la expresión escrita y la síntesis. El documento concluye que estas estrategias son útiles en el aula ya que motivan a los estudiantes y brindan diversidad al docente.
La oficina de Prevención en Violencia de Género de Nogoyá invita a la población a participar el 3 de junio en Plaza Libertad de las actividades de la marcha nacional contra la violencia hacia las mujeres bajo el lema Ni Una Menos, ya que es fundamental que toda la sociedad acompañe esta causa justa que se opone a la violencia contra la mujer y promueve la igualdad de género y el respeto a los derechos humanos.
A freelance engineer was retained by a major tool making company to create tools for a customer. The engineer was provided with digitized samples and point cloud data of a severely damaged component to create a 3D CAD model and technical drawing for manufacturing. The engineer then modified the model to make it suitable for die casting and designed moulding dies. Finally, the engineer created a process plan and simulated machining a prototype of the component in aluminum to optimize machining time.
"Effektive Code Reviews" - Abendvortrag bei oose.deFrank Sons
Abendvortrag bei oose.de am 24.03.2016
Code Reviews sind heute in vielen Teams Standard. Sei es als allgemeine Vier-Augen-Regel, bei pull requests oder tatsächlich durch Teammeetings. All diese Methoden haben Vor- und Nachteile, und nur in den seltensten Fällen kann man damit tatsächlich effektiv Bugs finden. Aber meist werden Code Reviews genau mit diesem Ziel eingeführt: Fehler vermeiden! Der Vortrag zeigt verschiedene Methoden für effektive Code Reviews auf und erklärt, warum toolbasierte Code Reviews eigentlich erst ein zweiter Schritt sein sollten und stattdessen das mindset der Entwickler im Vordergrund stehen sollte. Praktische Tipps um die eigenen Code Reviews zu verbessern runden den Vortrag ab.
O documento fala sobre o mês de maio dedicado à devoção de Nossa Senhora e celebra a Festa da Visitação de Maria à prima Isabel. Destaca a jornada de Maria para visitar Isabel levando Jesus em seu ventre e o encontro das duas, onde Isabel saúda Maria como a mãe do Senhor e Maria profere o Magnificat.
Emma Henningsson from UNEP held a presentation on the Portfolio Decarbonisation Coalition (CDP) at an event organised by Finsif, CDP and Sitra on 25 August 2015. The theme of the event was "Managing climate risk in investments".
El próximo 2 de marzo se celebrará en Frankfurt la feria regional para la tecnología de laboratorio. La Lab-Supply, que dura tan solo un día, es de cita obligada para profesionales del medio ambiente, la alimentación y el análisis industrial, la bioquímica, la biotecnología, la ingeniería genética, la biología molecular y celular, el diagnóstico médico y la farmacología.
El documento trata sobre la informática y la tecnología. Define la informática como la ciencia que estudia métodos para almacenar, procesar y transmitir información digitalmente. Define la tecnología como el conjunto de conocimientos y técnicas aplicadas para modificar el entorno y satisfacer necesidades humanas. Explica la importancia de la informática y tecnología para desarrollar competencias que permitan enfrentar el futuro.
Tran Vuong Hung is an engineer from Vietnam with experience in manufacturing, production, and oilfield operations. He received a Bachelor's degree in Automation Technology from Ho Chi Minh City University of Technical Education. His work experience includes serving as a Production Engineer at China Steel Sumikin Vietnam and currently working as a Wireline and Slickline Engineer at PVD Logging. He has strong English, computer, teamwork, and leadership skills from his education and career.
El ajedrez es un juego entre dos oponentes en un tablero de 64 casillas. Cada jugador controla 16 piezas: rey, reina, 2 torres, 2 caballos, 2 alfiles y 8 peones. El objetivo es dar jaque mate al rey enemigo mediante el movimiento y captura de piezas de acuerdo a las reglas específicas de cada una. Las piezas se mueven de forma diferente: el rey se mueve una casilla en cualquier dirección, la reina se mueve rectas tantas casillas como quiera, la torre
An optimized link state routing protocol based on a cross layer design for wi...IOSR Journals
This document discusses an optimized link state routing protocol based on a cross-layer design for wireless mesh networks. It proposes monitoring link quality at the MAC layer and notifying the network layer of changes, allowing routes to be automatically updated without a refresh phase. This provides seamless connectivity under varying load and mobility. Traditional routing protocols either have fast but vulnerable proactive routes or add overhead with reactive routes. The proposed cross-layer design monitors links continuously and performs vertical handovers to better links to avoid these issues.
Achieving Transmission Fairness in Distributed Medium Access Wireless Mesh Ne...ijwmn
Wireless mesh networking gained an international interest over the years as a result to high recognition in
the wireless industry as a cost effective, scalable, wider coverage and capacity capable wireless technology.
The contention based distributed medium access in wireless networks has advanced not only in supporting
the quality of multimedia but also achieving high throughput and to minimize packet delay overheads in
legacy systems. Unfortunately, the impact of such enhancement has not been fully justified with mesh
network environments yet. The medium access frames are required to be contended over multi-hops to
overcome the challenges of improving overall system performance through concurrent transmissions. The
goal of this paper is to discuss the issues and challenges of transmission fairness and the effect of
concurrent transmission on system performance. To mitigate transmission fairness issues, we review
existing open literature on mesh networking and provide guidelines for better system design and
deployment. Finally, we conclude the paper with future research directions. This study may help network
designer and planner to overcome the remaining challenging issues in the design and deployment of WMNs
worldwide.
Efficient Load Balancing Routing in Wireless Mesh Networksijceronline
International Journal of Computational Engineering Research (IJCER) is dedicated to protecting personal information and will make every reasonable effort to handle collected information appropriately. All information collected, as well as related requests, will be handled as carefully and efficiently as possible in accordance with IJCER standards for integrity and objectivity.
International Journal of Computational Engineering Research (IJCER) is dedicated to protecting personal information and will make every reasonable effort to handle collected information appropriately. All information collected, as well as related requests, will be handled as carefully and efficiently as possible in accordance with IJCER standards for integrity and objectivity.
Active Path Updation For Layered Routing (Apular) In Wireless Mesh Networkschetan1nonly
1) The document proposes an Active Path Updation procedure (APULAR) for layered routing in wireless mesh networks to quickly update broken paths and reduce packet loss.
2) In APULAR, the destination node takes responsibility for local repair restoration instead of the source node initiating a new path discovery when a link breaks, as is typically done.
3) The procedure is simulated and shown to outperform AODV and IWMRA routing protocols, achieving better packet delivery ratio, lower control overhead, higher throughput, and lower end-to-end delay.
Active path updation for layered routing (apular) in wirelessAlexander Decker
1) The document proposes an Active Path Updation procedure (APULAR) for layered routing in wireless mesh networks to quickly update broken paths and reduce packet loss.
2) In APULAR, the destination node takes responsibility for local repair restoration instead of the source node initiating a new path discovery when a link breaks, as is typically done.
3) The procedure is simulated and shown to outperform AODV and IWMRA routing protocols, achieving better packet delivery ratio, lower control overhead, higher throughput, and lower end-to-end delay.
Improvement at Network Planning using Heuristic Algorithm to Minimize Cost of...IJECEIAES
Wireless Mesh Networks (WMN) consists of wireless stations that are connected with each other in a semi-static configuration. Depending on the configuration of a WMN, different paths between nodes offer different levels of efficiency. One areas of research with regard to WMN is cost minimization. A Modified Binary Particle Swarm Optimization (MBPSO) approach was used to optimize cost. However, minimized cost does not guarantee network performance. This paper thus, modified the minimization function to take into consideration the distance between the different nodes so as to enable better performance while maintaining cost balance. The results were positive with the PDR showing an approximate increase of 17.83% whereas the E2E delay saw an approximate decrease of 8.33%.
A Professional QoS Provisioning in the Intra Cluster Packet Level Resource Al...GiselleginaGloria
Wireless mesh networking has transpired as a gifted technology for potential broadband wireless access. In a communication network, wireless mesh network plays a vital role in transmission and are structured in a mesh topology. The coordination of mesh routers and mesh clients forms the wireless mesh networks which are routed through the gateways. Wireless mesh networks uses IEEE 802.11 standards and has its wide applications broadband home networking and enterprise networking deployment such as Microsoft wireless mesh and MIT etc. A professional Qos provisioning in intra cluster packet level resource allocation for WMN approach takes power allocation, sub carrier allocation and packet scheduling. This approach combines the merits of a Karush-Kuhn-Tucker (KKT) algorithm and a genetic algorithm (GA) based approach. The KKT algorithm uses uniform power allocation over all the subcarriers, based on the optimal allocation criterion. The genetic algorithm is used to generate useful solutions to optimization and search problems and it is also used for search problems. By combining the intrinsic worth of both the approaches, it facilitates effective QOS provisioning at the packet level. It is concluded that, this approach achieves a preferred stability between system implementation and computational convolution.
WIRELESS MESH NETWORKS CAPACITY IMPROVEMENT USING CBF ijwmn
Wireless mesh network has recently received a great deal of attention as a promising technology to provideubiquitous high bandwidth access for a large number of users. Such network may face a significant broadcast traffic that may consequently degrade the network reliability.
In this paper, we have focused interest to wireless mesh network based IEEE 802.11s and we have designed
a self-pruning method to control and reduce the broadcast traffic forwarding. Our scheme, namely Control of Broadcast Forwarding (CBF), defines two behaviours to manage the broadcasting operation. Routing
packets are managed differently from data broadcast messages to avoid afflicting the routing process.
The simulations results show that CBF ameliorates the network capacity by reducing considerably the
number of redundant packets, improving the end to end delay and providing high reachability and packet
delivery ration.
This document summarizes research on congestion and fairness issues in wireless mesh networks. The researchers found that:
1) Wireless mesh networks using CSMA/CA MAC protocols can experience "starvation", where one-hop flows receive most bandwidth while competing multi-hop flows receive almost nothing.
2) Through experiments on an operational urban mesh network, they confirmed starvation occurs and isolated that only a one-hop TCP flow coupled with a two-hop TCP flow is needed to induce it.
3) They developed an analytical model to understand the causes of starvation as the interaction of MAC-layer biases, congestion control loops, and penalties of switching between network states.
4) Their model suggests a "
A Survey of Various Routing and Channel Assignment Strategies for MR-MC WMNsijsrd.com
One fundamental problem of WMNs with a limited number of radio interfaces and orthogonal channels is that the performance degrades significantly as the network size grows. This results from increased interference between nodes and diminished spatial reuse over the network. A WMN node needs to share a common channel with each of its neighbours in the communication range, requiring it to set up a virtual link. Moreover, to reduce network interference, a node should minimize the number of neighbours that it shares a common channel with. The objective of a channel assignment strategy is to ensure efficient utilization of the available channels (e.g., by minimizing interference) while maximizing connectivity in the network. However, since these two requirements are conflicting with each other, the goal is to achieve a balance between these two. The major constraints which need to be satisfied by a channel assignment scheme include fixed number of channels in the network, limited number of radios in mesh nodes, common channel between two communicating nodes, and limited channel capacity. Also, a channel assignment scheme should take the amount of traffic load supported by each mesh node into consideration.
The document proposes a clustering-based approach to dynamically allocate bandwidth in wireless networks. It extracts student data from a university's course timetable to predict user distributions over time. It then applies K-means clustering to group buildings into wireless nodes based on expected user loads. This clusters student devices and allows wireless nodes to adapt their bandwidth allocation according to predicted user demands at different times. The approach is tested on a university campus network, extracting student data to predict building loads and applying K-means clustering to allocate optimal bandwidth across wireless nodes over time.
This document provides an overview of wireless mesh networks (WMNs). It discusses the types of nodes in WMNs including wireless mesh routers and mesh clients. It describes the different architectures of WMNs and characteristics such as low cost, integration capabilities, and applications like broadband networking. Key challenges are also addressed around developing high-capacity radio interfaces and resource management. The document serves as an introduction to WMNs covering topics from architecture and standards to research opportunities.
DYNAMIC HYBRID CHANNEL (WMN) FOR BANDWIDTH GUARANTEES IN AD_HOC NETWORKSpharmaindexing
This document discusses bandwidth guarantees in wireless mesh networks. It proposes a new routing technique called dynamic hybrid channel, which uses both proactive and reactive routing protocols based on AOMDV. The goal is to provide bandwidth guarantees by selecting multiple paths and using the path with the highest available bandwidth for transmission. The performance of this approach is evaluated using the NS-2 network simulator. Several challenges of wireless mesh networks are also discussed, such as interference reduction and improving throughput across multiple hops.
Efficient and stable route selection by using cross layer concept for highly...Roopali Singh
Efficient and stable route selection by using cross layer concept for highly mobile network with predictive features by Rupali Singh, Gajendra Singh Dhakad
published in International Journal of Research & Technology, Volume 3, Issue 4_November_2015
Multipath Routing Protocol by Breadth First Search Algorithm in Wireless Mesh...IOSR Journals
This document proposes a multipath routing protocol for wireless mesh networks that uses a parallel layer-based approach and breadth-first search algorithm to discover multiple paths between a source and destination. It organizes nodes into layers based on distance from the destination and performs iterative breadth-first searches to find partial paths connecting nodes in lower layers, storing the partial paths. This process repeats until reaching the destination to find all possible paths. The primary path is then elected using an Expected Forwarding Counter metric to select the most reliable path. The protocol was evaluated in NS-2 and showed improved throughput, delivery ratio, and reduced delay compared to other protocols.
On the Tree Construction of Multi hop Wireless Mesh Networks with Evolutionar...CSCJournals
Abstract — in this paper, we study the structure of WiMAX mesh networks and the influence of tree’s structure on the performance of the network. From a given network’s graph, we search for trees, which fulfill some network, QoS requirements. Since the searching space is very huge, we use genetic algorithm in order to find solution in acceptable time. We use NetKey representation which is an unbiased representation with high locality, and due to high locality we expect standard genetic operators like n-point cross over and mutation work properly and there is no need for problem specific operators. This encoding belongs to class of weighted encoding family. In contrast to other representation such as characteristics vector encoding which can only indicate whether a link is established or not, weighted encodings use weights for genotype and can thus encode the importance of links. Moreover, by using proper fitness function we can search for any desired QOS constraint in the network.
Mesh networks have been used for over 40 years and provide flexible wireless connectivity. They work by having each node discover its neighboring nodes to create redundant connections across multiple hops. This allows the network to dynamically adapt to changes in signal quality or disconnected nodes. Mesh networks operate at the data link layer and treat the entire network as a single logical switch to transparently connect various local area networks.
INTERFERENCE-AWARE CHANNEL ASSIGNMENT FOR MAXIMIZING THROUGHPUT IN WMN pijans
Wireless Mesh network (WMN) is dynamically self-organizing and self-configured, with the nodes in the
network automatically establishing an ad-hoc network and maintaining the mesh connectivity. The ability
to use multiple-radios and multiple channels can be cashed to increase aggregate throughput of wireless
mesh network. Thus the efficient use of available interfaces and channels without interference becomes
the key factor. In this paper we propose interference aware clustered based channel assignment schemes
which minimizes the interference and increases throughput. In our proposed scheme we have given
priority to minimize interference from nearby mesh nodes in interference range than maximizing channel
diversity. We simulated our proposed work using NS-3 and results show that our scheme improves
network performance than BFSCA and Distributed Greedy CA.
This document summarizes a research paper on dynamic resource allocation in wireless sensor networks. It proposes a load balancing mechanism that measures traffic load at each access point and shares the communication load among neighboring access points. It also proposes resource allocation for sensor networks that considers uplink and downlink channel information and network path/congestion data. Shortest path and routing algorithms are used to select optimal paths for sending data packets from source to destination nodes via intermediate nodes while dynamically allocating bandwidth. The mechanism aims to improve quality of service parameters like packet delivery, throughput, and efficiency of bandwidth allocation.
Similar to A New Paradigm for Load Balancing in WMNs (20)
Philippine Edukasyong Pantahanan at Pangkabuhayan (EPP) CurriculumMJDuyan
(𝐓𝐋𝐄 𝟏𝟎𝟎) (𝐋𝐞𝐬𝐬𝐨𝐧 𝟏)-𝐏𝐫𝐞𝐥𝐢𝐦𝐬
𝐃𝐢𝐬𝐜𝐮𝐬𝐬 𝐭𝐡𝐞 𝐄𝐏𝐏 𝐂𝐮𝐫𝐫𝐢𝐜𝐮𝐥𝐮𝐦 𝐢𝐧 𝐭𝐡𝐞 𝐏𝐡𝐢𝐥𝐢𝐩𝐩𝐢𝐧𝐞𝐬:
- Understand the goals and objectives of the Edukasyong Pantahanan at Pangkabuhayan (EPP) curriculum, recognizing its importance in fostering practical life skills and values among students. Students will also be able to identify the key components and subjects covered, such as agriculture, home economics, industrial arts, and information and communication technology.
𝐄𝐱𝐩𝐥𝐚𝐢𝐧 𝐭𝐡𝐞 𝐍𝐚𝐭𝐮𝐫𝐞 𝐚𝐧𝐝 𝐒𝐜𝐨𝐩𝐞 𝐨𝐟 𝐚𝐧 𝐄𝐧𝐭𝐫𝐞𝐩𝐫𝐞𝐧𝐞𝐮𝐫:
-Define entrepreneurship, distinguishing it from general business activities by emphasizing its focus on innovation, risk-taking, and value creation. Students will describe the characteristics and traits of successful entrepreneurs, including their roles and responsibilities, and discuss the broader economic and social impacts of entrepreneurial activities on both local and global scales.
This document provides an overview of wound healing, its functions, stages, mechanisms, factors affecting it, and complications.
A wound is a break in the integrity of the skin or tissues, which may be associated with disruption of the structure and function.
Healing is the body’s response to injury in an attempt to restore normal structure and functions.
Healing can occur in two ways: Regeneration and Repair
There are 4 phases of wound healing: hemostasis, inflammation, proliferation, and remodeling. This document also describes the mechanism of wound healing. Factors that affect healing include infection, uncontrolled diabetes, poor nutrition, age, anemia, the presence of foreign bodies, etc.
Complications of wound healing like infection, hyperpigmentation of scar, contractures, and keloid formation.
Chapter wise All Notes of First year Basic Civil Engineering.pptxDenish Jangid
Chapter wise All Notes of First year Basic Civil Engineering
Syllabus
Chapter-1
Introduction to objective, scope and outcome the subject
Chapter 2
Introduction: Scope and Specialization of Civil Engineering, Role of civil Engineer in Society, Impact of infrastructural development on economy of country.
Chapter 3
Surveying: Object Principles & Types of Surveying; Site Plans, Plans & Maps; Scales & Unit of different Measurements.
Linear Measurements: Instruments used. Linear Measurement by Tape, Ranging out Survey Lines and overcoming Obstructions; Measurements on sloping ground; Tape corrections, conventional symbols. Angular Measurements: Instruments used; Introduction to Compass Surveying, Bearings and Longitude & Latitude of a Line, Introduction to total station.
Levelling: Instrument used Object of levelling, Methods of levelling in brief, and Contour maps.
Chapter 4
Buildings: Selection of site for Buildings, Layout of Building Plan, Types of buildings, Plinth area, carpet area, floor space index, Introduction to building byelaws, concept of sun light & ventilation. Components of Buildings & their functions, Basic concept of R.C.C., Introduction to types of foundation
Chapter 5
Transportation: Introduction to Transportation Engineering; Traffic and Road Safety: Types and Characteristics of Various Modes of Transportation; Various Road Traffic Signs, Causes of Accidents and Road Safety Measures.
Chapter 6
Environmental Engineering: Environmental Pollution, Environmental Acts and Regulations, Functional Concepts of Ecology, Basics of Species, Biodiversity, Ecosystem, Hydrological Cycle; Chemical Cycles: Carbon, Nitrogen & Phosphorus; Energy Flow in Ecosystems.
Water Pollution: Water Quality standards, Introduction to Treatment & Disposal of Waste Water. Reuse and Saving of Water, Rain Water Harvesting. Solid Waste Management: Classification of Solid Waste, Collection, Transportation and Disposal of Solid. Recycling of Solid Waste: Energy Recovery, Sanitary Landfill, On-Site Sanitation. Air & Noise Pollution: Primary and Secondary air pollutants, Harmful effects of Air Pollution, Control of Air Pollution. . Noise Pollution Harmful Effects of noise pollution, control of noise pollution, Global warming & Climate Change, Ozone depletion, Greenhouse effect
Text Books:
1. Palancharmy, Basic Civil Engineering, McGraw Hill publishers.
2. Satheesh Gopi, Basic Civil Engineering, Pearson Publishers.
3. Ketki Rangwala Dalal, Essentials of Civil Engineering, Charotar Publishing House.
4. BCP, Surveying volume 1
Level 3 NCEA - NZ: A Nation In the Making 1872 - 1900 SML.pptHenry Hollis
The History of NZ 1870-1900.
Making of a Nation.
From the NZ Wars to Liberals,
Richard Seddon, George Grey,
Social Laboratory, New Zealand,
Confiscations, Kotahitanga, Kingitanga, Parliament, Suffrage, Repudiation, Economic Change, Agriculture, Gold Mining, Timber, Flax, Sheep, Dairying,
Level 3 NCEA - NZ: A Nation In the Making 1872 - 1900 SML.ppt
A New Paradigm for Load Balancing in WMNs
1. Mohammad Shahverdy, Misagh Behnami & Mahmood Fathy
International Journal of Computer Networks (IJCN), Volume (3) : Issue (4) : 2011 239
A New Paradigm for Load Balancing in WMNs
Mohammad Shahverdy shahverdy@iautb.ac.ir
Department of Computer
Tafresh Branch, Islamic Azad University
Tafresh, 3951736874, IRAN
Misagh Behnami misagh_behnami@yahoo.com
Department of Computer
Arak Branch, Islamic Azad University
Arak, IRAN
Mahmood Fathy mahfathy@iust.ac.ir
Computer Engineering Faculty
Iran University of Science and Technology
Tehran, IRAN
Abstract
In this paper, we address the problem of load balancing in Wireless Mesh Networks. We
consider a Cluster Based Wireless Mesh Architecture in which the WMN is divided into
clusters that could minimize the updating overhead during topology change due to
mobility of mesh nodes or congestion of load on a cluster. Each cluster contains a
gateway that has complete knowledge about group memberships and link state
information in the cluster. The gateway is often elected in the cluster formation process.
We consider load of gateways and try to reduce it. As a matter of fact when a gateway
undertakes to be an interface for connecting nodes of a wireless mesh network to other
networks or internet, there would be some problems such as congestion and bottleneck,
so we introduce a new paradigm for these problems. For solving bottleneck we use
clustering to reduce load of gateways and after that by use of dividing cluster we prevent
from bottleneck on gateways. We study how to detect congestion on a gateway and how
can reduce loads of it that preventing from bottleneck on gateway and therefore
increasing throughput of network to encountering many loads. So we propose an
algorithm to detect bottleneck and remedies for load balancing in Wireless Mesh
Networks. We also use Ns2-Emultion for implementing and testing the framework. Some
qualitative results are provided to prove the correctness and the advantages of our
framework.
Keywords: Wireless Mesh Networks, Load Balancing, Clustering, Bottleneck
1. INTRODUCTION
Wireless mesh networking is a new paradigm for next generation wireless networks.
Wireless mesh networks (WMNs) consist of mesh clients and mesh routers, where the
mesh routers form a wireless infrastructure/backbone and interwork with the wired
networks to provide multi hop wireless Internet connectivity to the mesh clients. Wireless
mesh networking has generated as a self-organizing and auto-configurable wireless
networking to supply adaptive and flexible wireless Internet connectivity to mobile users.
This idea can be used for different wireless access technologies such as IEEE 802.11,
802.15, 802.16-based wireless local area network (WLAN), wireless personal area
network (WPAN), and wireless metropolitan area network (WMAN) technologies. WMNs
Potential application can be used in home networks, enterprise networks, community
networks, and intelligent transport system networks such as vehicular ad-hoc networks.
Wireless local area networks (WLANs) are used to serve mobile clients access to the
fixed network within broadband network connectivity with the network coverage [1]. The
clients in WLAN use of wireless access points that are interconnected by a wired
backbone network to connect to the external networks. Thus, the wireless network has
only a single hop of the path and the Clients need to be within a single hop to make
2. Mohammad Shahverdy, Misagh Behnami & Mahmood Fathy
International Journal of Computer Networks (IJCN), Volume (3) : Issue (4) : 2011 240
connectivity with wireless access point. Therefore to set up such networks need access
points and suitable backbone. As result a Deployment of large-scale WLANs are too
much cost and time consuming. However, The WMNs can provide wireless network
coverage of large areas without depending on a wired backbone or dedicated access
points [1, 2]. WMNs are the next generation of the wireless networks that to provide best
services without any infrastructure. WMNs can diminish the limitations and to improve the
performance of modern wireless networks such as ad hoc networks, wireless
metropolitan area networks (WMANs), and vehicular ad hoc networks [2,3,4 and 5].
WMNs are multi-hop wireless network which provide internet everywhere to a large
number of users. The WMNs are dynamically self-configured and all the nodes in the
network are automatically established and maintain mesh connectivity among themselves
in an ad hoc style. These networks are typically implemented at the network layer through
the use of ad hoc routing protocols when routing path is changed. This character brings
many advantages to WMNs such as low cost, easy network maintenance, more reliable
service coverage.
Wireless mesh network has different members such as access points, desktops with
wireless network interface cards (NICs), laptops, Pocket PCs, cell phones, etc. These
members can be connected to each other via multiple hops. In the full mesh topology this
feature brings many advantages to WMNs such as low cost, easy network maintenance
and more reliable service coverage. In the mesh topology, one or multiple mesh routers
can be connected to the Internet. These routers can serve as GWs and provide Internet
connectivity for the entire mesh network. One of the most important challenges in these
networks happens on GW, when number of nodes which connected to the internet via
GW, suddenly increased. It means that GWs will be a bottleneck of network and
performance of the network strongly decreases [4, 5, and 6].
In section 2 we first introduce related works. In section 3 system model and assumptions
are discussed. In section 4 we present a new method for load balancing via GW. Section
5 evaluates the performance of the proposed scheme by means of simulation. Finally we
conclude the paper in Section 6.
2. RELATED WORK
The problem of bottleneck in wireless mesh networks is an ongoing research problem
although much of the literature [7, 8, 9, 10] available, addresses the problem without an
introducing method for removing bottleneck and/or a well-defined way to prevent
congestion. In [11], the authors proposed the MeshCache system for exploiting the
locality in client request patterns in a wireless mesh network .The MeshCache system
alleviates the congestion bottleneck that commonly exists at the GW node in WMNs while
providing better client throughput by enabling content downloads from closer high-
throughput mesh routers. There is some papers related to optimization problems on
dynamic and static load balancing across meshes [11].Optimal load balancing across
meshes is known to be a hard problem. Akyildiz et al. [12] exhaustively survey the
research issues associated with wireless mesh networks and discusses the requirement
to explore multipath routing for load balancing in these networks. However, maximum
throughput scheduling and load balancing in wireless mesh networks is an unexplored
problem. In this paper we present for the first time, a load balancing scheme in wireless
mesh networks by using clustering and finding the best cluster head for new cluster by a
new formula and evaluate its performance.
3. MODELS AND ASSUMPTION
We consider an area with wireless nodes (figure 1). These nodes can connect together
and they can connect to internet or external networks via GW. GWs are wireless nodes
that can route internal traffic to external networks when number of requests to GW
increase then GW can’t service all requests punctually. Thus a load balancing method is
needed to decrease workload of GW. We use the following metrics for evaluation our
scheme.
Service ratio: service ratio is defined as the ratio of the number of nodes which receive
service to the total number of nodes that send request to GW. A good load balancing
method should service as many requests as possible in time confine.
3. Mohammad Shahverdy, Misagh Behnami & Mahmood Fathy
International Journal of Computer Networks (IJCN), Volume (3) : Issue (4) : 2011 241
Delay: delay is defined time distance between node request`s until node receive
responses by GW. Delay is a good parameter to present a suitable scheme to have a
good performance.
FIGURE 1: A wireless mesh network area
4. LOAD BALANCING VIA GATEWAY
The previous load balancing algorithms [7] do not spot fast traffic undulation. For
instance, when the numbers of nodes (that are transferring data with a gateway) are
increased suddenly then workload on transmission nodes and routers will be increased.
This problem decreases performance of network because packets are aggregated in
transmission nodes and cannot reach to destination on time. In first scheme for better
control of workload on nodes we cluster nodes in specific groups. it is done thereby we
put active nodes that are close together and can transmit data together directly in one
cluster. Each cluster has a master that is called Gateway (GW). Each node in one cluster
is aware of other nodes in this cluster. when a node wants to send data to a destination
there will be two states: 1) if destination node is in the same cluster, transmission is
occurred with one hop 2) if destination is not in the same cluster, at first data must be
send to GW of its cluster and then this GW sends data to the destination cluster which the
destination node exists in. The GW inside destination cluster sends data to destination
node with one hop.
In a first look essence of a GW that all data transmit via them is bottleneck. In other word,
when number of nodes that is sent data to outside of the cluster increased then workload
of the GW is increased too. We implement node clustering for control of active node that
worked with a GW. With this work we can control how many nodes are sending data via
GW in specific time and when the number of these nodes is increased, we must decrease
workload with suitable solution.
4.1 Breaking a Cluster
For controlling workload of a GW, we must control number of the nodes that transmit data
to the GW until the amount of nodes do not overreach more than specified limitation. To
attain to load balancing, GW should know its power and throughput. Namely GW must
know how many nodes can transmit data by itself simultaneously. After that if the number
of nodes that connected to the GW increases more than GW capacity, we have to
decrease the load of GW with a suitable method. Assume that a GW is working with
maximum capacity, the problem occurs when another node wants to get some services
from GW. Now the GW can’t respond to this request and the GW is converted to a
bottleneck point. To solve congestion in GW we offer breaking cluster to two equal
sections and then looking for a new GW for a new cluster (figure 2). After selecting new
GW, it must connect to other GWs and connect to new cluster nodes. Therefore new
cluster can operate such as the other clusters. Note that the nodes of a cluster must to be
closed together geographically because of power saving and simple routing. A
disadvantage of this breaking is time wasting for selecting a new suitable GW and making
routes between it and other nodes. On the other hand, ordinary nodes that are registering
in new cluster must reconstruct the routing table which will waste time again. For these
reasons performance will decrement. In the following we present a new formula for
4. Mohammad Shahverdy, Misagh Behnami & Mahmood Fathy
International Journal of Computer Networks (IJCN), Volume (3) : Issue (4) : 2011 242
selecting a new suitable GW for new cluster and then we propose a solution for above
problems.
FIGURE 2: Breaking a cluster
4.2 Selecting a Suitable GW
When a cluster splits into two clusters, one of them has a GW but another one (new one)
has no GW. So we need to find a suitable GW for the new cluster. Selecting Wrong GW
can have effect on network performance. For example assume that if an inappropriate
node is selected to be a GW then this GW may fail in its run time. So the cluster must
select a new GW and establish a route table which is time wasting and this new GW may
fail too. Therefore, random selecting GW causes low network performance because a
failing GW causes accumulation data in a cluster and then increasing workload
ascendant.
We survey parameters that effect on GW failures and then select a GW that has the best
conditions via these parameters. The most effective parameters in stability of GW are: a)
power supply, b) velocity of node, c) node constancy, d) distance to center of cluster and
e) processing power of node.
The effect of power supply is that if each node that has high energy or has perennial
power supply then it is more stable. Therefore the node that has this parameter is more
suitable for being a GW because in the future it may be alive. The node with low velocity
has less probability to go out from cluster. Therefore a node with low movement and low
velocity is more suitable for being GW. In other words, if the node that has high velocity is
accepted to be a GW then the GW may go out from the cluster and the cluster has to find
and select a new GW again. Node constancy includes the time that a node exists in the
cluster. For estimating this parameter each node can monitor a history of its lifetime in
specific cluster and then each node that has longer lifetime is more constancy and more
suitable for being GW. Central nodes have heavy workload rather than boundary nodes
[1], as all nodes select shortest paths for optimal routing and these paths commonly pass
from center of cluster. Hence traffic in central of cluster is very heavy. If a GW is selected
in the center of a cluster then internal workload will add to external workload thus it is
better that a GW is selected from the boundary of cluster. This parameter can be taken
from GPS data. At last final parameter that we express is power of processing. A node
with high processing power is more suitable for being a GW because it can do
computation quickly. We integrated these parameters to a formula that is shown below:
In the above formula, we can calculate G_Value for each node in a cluster and then each
node that has larger G_Value is more suitable for being a GW.
5. Mohammad Shahverdy, Misagh Behnami & Mahmood Fathy
International Journal of Computer Networks (IJCN), Volume (3) : Issue (4) : 2011 243
4.3 Breaking Cluster With Use of Threshold
In previous section we expressed that each GW knows the number of requests in service.
If requests amount surpasses the ability of GW then the cluster will be broken. Selecting
a new GW plus creating route table for GW and other nodes are time consuming,
therefore performance decreases. We present a solution for this problem. We suggest
selecting a new GW and creating a routing table before breaking the cluster. To
denouement it attends to an example. Assume that a GW can service requests up to 10.
It means that if 11th request is sent to the GW, it can`t respond to a new request, thus
cluster is broken and then a new GW must be selected and routing table must be
established.
In this new method each cluster has two thresholds. One threshold is for selecting a new
GW that is called TS_GW and another threshold for established routing table that is
called TS_routetable. For example assume that TS_GW is 5 and TS_routetable is 8. It
means that if number of nodes which send requests are larger than 5 then cluster must
select a new GW. The current GW can do it hereby current GW gets G_Value of all other
nodes and each node that has high G_Value is selected for being new GW. With this
method the new cluster does not waste any time for selecting a new GW because it is
done before breaking cluster.
Also if number of nodes that send requests larger than 8, then pre routing is occurred and
route table for GW and nodes of new cluster is made. When number of requests reaches
up to 10 then current cluster will be broken. Therefore with this method cluster does not
waste any time for selecting a GW and building route table. Simulation results show that
breaking the cluster with threshold conquest other algorithms.
4.4 Incorporating Two Clusters
We express that when workload of a GW is increased inordinately, the cluster will be
broken into two clusters. What will happen if we assume that workload of a cluster is
decreased to zero. In this situation we envisage to several clusters that have low
workload. Thus, it is necessary that clusters with low workload joint together. When two
clusters are merged together we have to select a suitable GW between two GWs of two
old clusters. So we choose the one which has more heavier workload and is more
suitable to be the final cluster because the number of nodes that are routed from this GW
is larger than the other GW, thereupon we can change previous formula to gain new
formula to selecting a new GW in this section. There is a formula as following as below:
Where the power supply, power CPU, node constancy, node distance and node velocity
parameters are like section 4.2 and n_routetable is number of nodes which are routed via
GW, power 2 is to emphasis of this parameter, lastly each node that has high
G_value_join is selected for GW of final cluster.
5. PERFORMANCE EVALUATION
We have performed several preliminary quantitative experiments. To this end, the
performance of our proposed schemes was evaluated by using NS2 [13], [14].
5.1 Experimental Setup
In order to keep the results closest to real experiment, we used NS2. The simulation area
is a 400*400 square as 200 nodes randomly positioned on it. Some of nodes move a little
on the simulation area, other simulation parameters listed in table 1.
6. Mohammad Shahverdy, Misagh Behnami & Mahmood Fathy
International Journal of Computer Networks (IJCN), Volume (3) : Issue (4) : 2011 244
TABLE 1: Parameters of NS2 Simulation
Parameter Value
Simulation time 100 sec
Transmission rate 64 Kbps
Node velocity 0-10 Kmph
Wireless coverage 50 meter
Packet size 1000 byte
Routing protocol DSR
Ratio propagation model Two ray. Ground
Antenna model Omni antenna
Mac type IEEE 802.11
5.2 Service Ratio Evaluation
A Major goal of load balancing is decreasing workload of GW and preventing from
bottlenecks. Figure 3 shows the service ratio for different load balancing schemes. The x
axis is the simulation time. In figure 3 three schemes are compared as follow: 1) load
balancing without clustering, 2) load balancing with simple threshold clustering and 3)
load balancing with hysteresis threshold clustering.
FIGURE 3: comparing service ratio for 3 schemes
As it follows from the figure 3 the third scheme leads to serving more requests in
comparison to the other two schemes. The first scheme can’t serve all requests because
some request aggregate in queue of GW. The second scheme has low service ratio in
each time in comparison to third scheme because delay of selecting GW and delay of
making route table affect on service ratio.
5.3 The Effect of Workload
Figure 4 shows the effect of number of requests on load balancing performance for three
schemes discussed in this paper. As shown in the figure 4 when the number of requests
increases the service ratio of third scheme descends with a lower slope in comparison to
the other two schemes. It follows figure 4 that in which the first scheme shows very poor
performance.
7. Mohammad Shahverdy, Misagh Behnami & Mahmood Fathy
International Journal of Computer Networks (IJCN), Volume (3) : Issue (4) : 2011 245
FIGURE 4: comparing service ratio with entered number of requests
5.4 Delay Evaluation
As shown in figure 5 when number of requests is increased then sum of delays in first
scheme is increased with a high slope. This delay is the waiting time of requests in the
GW queue. We dissemble other delays in network because they are similar in all
schemes. Third scheme has least delay.
FIGURE 5: Effect of workload on delay
6. CONCLUSION AND FUTURE WORKS
In this paper we proposed load balancing schemes for WMNs. In first step we clustered
all nodes to control the workload of them. If workload on a GW is increased up to
maximum ability of the GW then the cluster is broken. Because selecting a new GW and
establish a route table is time consuming, thus we propose a third scheme in which GW
selection and creating rout table is done before breaking the cluster. Simulation results
show that the proposed approach offers desirable performance and scalability. Although
the paper considers most of the design aspects of the proposed infrastructure, it leaves
some open issues and questions. For instance, surveying load balancing of multi channel
GWs in clustering wireless mesh networks, finding maximum throughput of nodes in
cluster based wireless mesh networks and how to find G_value for selecting a new GW
with minimum overhead. Another open issue is using fuzzy logic for breaking the clusters.
8. Mohammad Shahverdy, Misagh Behnami & Mahmood Fathy
International Journal of Computer Networks (IJCN), Volume (3) : Issue (4) : 2011 246
7. REFERENCES
[1] J. Bicket, D. Aguayo, S. Biswas, R. Morris, Architecture and evaluation of an
unplanned 802.11b mesh network, in: Proceedings of the 11th ACM Annual
International Conference on Mobile Computing and Networking (MobiCom), ACM
Press, Cologne, Germany, 2005, pp. 31–42.
[2] B. Aoun, R. Boutaba, Y. Iraqi, and G. Kenward, “Gateway Placement Optimization in
Wireless Mesh Networks with QoS Constraints,” IEEE Journal on Selected Areas in
Communications, vol. 24, Nov 2006.
[3] A.K.Hasan, A. A. Zaidan, A. Majeed, B. B. Zaidan, R. Salleh, O. Zakaria, and A.
Zuheir, “Enhancement Throughput of Unplanned Wireless Mesh Networks
Deployment Using Partitioning Hierarchical Cluster (PHC)”, World Academy of
Science, Engineering and Technology 54 2009
[4] I.F.Akyildiz, X.Wang, W.Wang,” Wireless mesh networks: a survey”, Elsevier
,Computer Networks 47 (2005) 445–487
[5] K. Jain, J. Padhye, V. N. Padmanabhan, and L. Qiu, “Impact of interference on multi-
hop wireless network performance,” in Proceeding of ACM MobiCom, 2003.
[6] I. Akyildiz and X. Wang, "A survey on wireless mesh networks," IEEE
Communication Magazine, vol. 43, no.9, pp.s23-s30,Sep. 2005.
[7] B.S. MANOJ AND RAMESH R. RAO ,” WIRELESS MESH NETWORKING”, Chapter
8 : Load Balancing in Wireless Mesh Networks, page 263
[8] Saumitra M. Das, Himabindu Pucha and Y. Charlie Hu School of Electrical and
Computer Engineering Purdue University, West Lafayette, “Mitigating the Gateway
Bottleneck via Transparent Cooperative Caching in Wireless Mesh Networks” NSF
grants CNS-0338856 and CNS-0626703.
[9] Jangeun Jun and Mihail L. Sichitiu Department of Electrical and Computer
Engineering
North Carolina State University Raleigh,”The Nominal Capacity of Wireless Mesh
Networks” NC 27695-7911
[10] Abu (Sayeem) Reaz1, Vishwanath Ramamurthi1, Dipak Ghosal1, John Benko2,
Wei Li2, Sudhir Dixit3, and Biswanath Mukherjee1 ,”Enhancing Multi-hop Wireless
Mesh Networks with a Ring Overlay”
[11] G. Horton, "A multi-level diffusion method for dynamic load balancing", Parallel
Computing. 19 (1993), pp. 209-229
[12] I. Akyildiz, X. Wang, W. Wang, ''Wireless Mesh Networks: A Survey'', Computer
Networks Journal 47, (Elsevier), March 2005. pp. 445-487.
[13] “The network simulator - ns2”,http://www.isi.edu/nsnam/ns/.
[14] Daniel Mahrenholz and Svilen Ivanov, "Real-Time Network Emulation with ns-2,"
Proceedings of The 8-th IEEE International Symposium on Distributed Simulation
and Real Time Applications, Budapest Hungary, October 21-23, 2004.
[15] M. Shahverdy, M. Fathy, S. Yousefi, “Scheduling Algorithm for Vehicle to Road-
Side Data Distribution”, ICHCC-ICTMF 2009, Berlin Heidelberg, CCIS 66, pp. 22–
30, 2010.