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%.
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.
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.
An Adaptive Cluster Head Election Algorithm for Heterogeneous Mobile Ad-hoc N...IJLT EMAS
Mobile ad-hoc network characterized as a homogenous and heterogeneous on the basis of node capabilities. Heterogeneity property may make issues for mobile ad-hoc network in context of coverage area, link stability, lifetime etc. To resolve these issues, require a mechanism to adapt different characteristics and make decision for smooth functioning. Heterogeneity also leads effective routing problem that occurs instability in route or path. Though to make effective routing in this situation, efficient clustering algorithm may be apply. In this paper, the effects of heterogeneity property are studied and analyzed. A cluster head algorithm is also suggested to deal with the effects of the property. Suggested algorithm is simulated in network simulation and performance is evaluated in context of computation cost, lifetime and number of clusters.
To increase the network capacity, there is
need to minimize the interference among nodes and
optimum control of topology in the foundation of
network. Recently, technological development helps to
build of mobile ad-hoc networks (MANETs) in order to
improve the quality of service (QoS) in terms of delay. In
contradictory to the objective of minimizing interference,
it is important to concern topology control in delay
constrained environment. The present research work
attempts to control the delay-constrained topology with
jointly considering delay and interference concept.
Additionally, the study proposed an interference oriented
topology control algorithm for delay-constrained
MANETs by taking account of both the interference
constraint and the delay constraint under the specific
condition of transmission delay, contention delay and the
queuing delay. Further, the study investigated the impact
of node mobility on the interference oriented topology
control algorithm. Finally, the results of the present
study shows that the proposed algorithm controls the
topology to convince the interference constraint, and
increases the transmit range to congregate the delay
requirement. Also, the study conclude that the algorithm
could effectively reduce the delay protocol and improve
the performance effectively in delay-constrained mobile
ad hoc networks.
MESSAGE ROUTING IN WIRELESS AND MOBILE NETWORKS USING TDMA TECHNOLOGYijwmn
In an era where communication has a most important role in modern societies, designing efficient
algorithms for data transmission is of the outmost importance. TDMA is a technology used in many
communication systems such as satellite, cell phone as well as other wireless or mobile networks. Most 2G
cellular systems as well as some 3G are TDMA based. In order to transmit data in such systems we need
to cluster them in packages. To achieve a faster transmission we are allowed to preempt the transmission of
any packet in order to resume at a later time. Preemption can be used to reduce idleness of some stations.
Such preemptions though come with a reconfiguration cost in order to setup for the next transmission. In
this paper we propose two algorithms which yield improved transmission scheduling. These two algorithms
we call MGA and IMGA (Improved MGA). We have proven an approximation ratio for MGA and ran
experiments to establish that it works even better in practice. In order to conclude that MGA will be a very
helpful tool in constructing an improved schedule for packet routing using preemtion with a setup cost, we
compare its results to two other efficient algorithms designed by researchers in the past: A-PBS(d+1) and
GWA. To establish the efficiency of IMGA we ran experiments in comparison to MGA as well as APBS(d+1)
and GWA. IMGA has proven to produce the most efficient schedule on all counts.
International Journal of Computational Engineering Research(IJCER) is an intentional online Journal in English monthly publishing journal. This Journal publish original research work that contributes significantly to further the scientific knowledge in engineering and Technology.
A new clustering technique based on replication for MANET routing protocolsTELKOMNIKA JOURNAL
The cluster head nodes in most mobile ad hoc networks (MANET) clustering protocols take on an extraordinary role in managing routing information. The reliability, efficiency and scalability of the clustering in MANET will ultimately be dramatically impacted. In this work we establish a new approach to form the clusters in MANET called the square cluster-based routing protocol (SCBRP). That protocol is based on the theory of replication. The goal of the protocol is to achieve reliability, availability and scalability with in the MANET. The proposed protocol is evaluated by caring the performance analysis using the NS-3 simulator. The performance shows 50% improvementin data delivering ratio in large network size, also shows an improvement in network stability and availability which is reflected in energy consumption measurements and increase in the system lifetime to 20%.
Efficient routing mechanism using cycle based network and k hop security in a...ijait
In a multi-domain network, Topology Aggregation (TA) may be adopted to provide limited information
regarding intra cluster connectivity without revealing detailed topology information. Nodes are grouped
into the cluster. Every cluster has border nodes, which is used for data transmission between source and
destination. The K-hop security can be used for the purpose of securing the data communication. The
topologies are spanning tree and balanced tree that can be used to reduce bandwidth overhead, delivery
delay and to increase throughput and packet delivery ratio. The shortest path can be found using
Bhandari’s algorithm and Cycle-Based Minimum-Cost Domain-Disjoint Paths (CMCDP) Algorithm for
establish the second path in the network . These topologies are compared to demonstrate the advantage of
finding shortest path using Bhandari’s algorithm.
Ieee transactions 2018 on wireless communications Title and Abstracttsysglobalsolutions
Final year BE, B.Tech, ME, M.Tech projects along with our professionals for developing Real Time Applications in Emerging Technologies.
We can support to your final year projects in all domains with latest technologies and simulation tool like NS2, NS3, Glomosim, Opnet, Matlab, IDL, Sumo, Gridsim, Bonita tool & Cloud deployments (Cloudsim, Google App Engine, Amazon Deployment, and Real time Cloud Deployment)also we are support for JOURNAL and CONFERENCE Preparation.
?
TSYS Research and Development.
20/9 Sardar Patel Road, Janaki Complex,
4th Floor, Adyar, Chennai - 20?
Tel : 91 44 42607879, 98411 03123.
Website : http://www.tsysglobalsolutions.com/
http://tsysphdsupport.com/
The International Journal of Engineering & Science is aimed at providing a platform for researchers, engineers, scientists, or educators to publish their original research results, to exchange new ideas, to disseminate information in innovative designs, engineering experiences and technological skills. It is also the Journal's objective to promote engineering and technology education. All papers submitted to the Journal will be blind peer-reviewed. Only original articles will be published.
The papers for publication in The International Journal of Engineering& Science are selected through rigorous peer reviews to ensure originality, timeliness, relevance, and readability.
Mobile ad hoc network become nowadays more and more used in different
domains, due to its flexibility and low cost of deployment. However, this
kind of network still suffering from several problems as the lack of resources.
Many solutions are proposed to face these problems, among these solutions
there is the clustering approach. This approach tries to partition the network
into a virtual group. It is considered as a primordial solution that aims to
enhance the performance of the total network, and makes it possible to
guarantee basic levels of system performance. In this paper, we study some
schemes of clustering such as Dominating-Set-based clustering, Energyefficient
clustering, Low-maintenance clustering, Load-balancing clustering,
and Combined-metrics based clustering.
Algorithmic Construction of Optimal and Load Balanced Clusters in Wireless Se...M H
This paper proposes a clustering algorithm - Ba-lanced Minimum Radius Clustering (BMRC) - for use in large scale, distributed Wireless Sensor Networks (WSN). Cluster balancing is an intractable problem to solve in a distributed manner, and distribution is important, by reason of both avoiding specialised node vulnerability and minimising message overhead.The BMRC algorithm described here distributes several of the cluster balancing functions to the cluster-heads. In proposing this algorithm, several tentative claims have been made for it, namely that it is suitable for arbitrary number of cluster heads; that its pecifies a way to elect cluster heads and use them to create the local models; that it accomplishes optimal balanced clusters in distributed manner; that it is scalable and it uses the number-of-hops as a clustering parameter; that it is energy efficient. These claims were studied and verified by simulation.
A New Paradigm for Load Balancing in WMNsCSCJournals
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.
Mobile elements scheduling for periodic sensor applicationsijwmn
In this paper, we investigate the problem of designing the mobile elements tours such that the length of each tour is below a per-determined length and the depth of the multi-hop routing trees bounded by k. The path of the mobile element is designed to visit subset of the nodes (cache points). These cache points store other nodes data. To address this problem, we propose two heuristic-based solutions. Our solutions take into consideration the distribution of the nodes during the establishment of the tour. The results of our experiments indicate that our schemes significantly outperforms the best comparable scheme in the literature.
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
Optimized Traffic Flow over Multipath in Optical Networkspaperpublications3
Abstract: In optical networks, the delivery of a traffic flow with a certain bandwidth demand over a single network path is either not possible or not cost-effective. In these cases, it is very often possible to improve the network's bandwidth utilization by splitting the traffic flow over multiple efficient paths. While using multiple paths for the same traffic flow increases the efficiency of the network, it consumes expensive forwarding resources from the network nodes such as wavelengths/light paths of optical networks. The problem of reducing forwarding cost can be defined in two cases such as Routing with Minimum Overhead and Decomposition with Minimum Overhead. For Routing with Minimum Overhead only the traffic demand must be given and for Decomposition with Minimum Overhead both the traffic demand and network flow will be given. For both the problems forwarding cost can be minimized by measuring the number of paths and the number of nodes traversed by these paths.
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.
Multicast routing strategy for SDN-cluster based MANET IJECEIAES
The energy limitation and frequent movement of the mobile Ad hoc network (MANET) nodes (i.e., devices) make the routing process very difficult. The multicast routing problem is one of the NP-complete problems. Therefore, the need for a new power-aware approach to select an optimum multicast path with minimum power consumption that can enhance the performance and increase the lifetime of MANET has become urgent. Software defined network (SDN) is a new technique that can solve many problems of the traditional networks by dividing the architecture into data part and control part. This paper presents three power-aware multicast routing strategies for MANET. First one called a Reactive Multicast routing strategy for Cluster based MANET by using SDN (RMCMS), second one called Proactive Multicast routing strategy for Cluster based MANET by using SDN (PMCMS) and third one represents Modification of PMCMS called M-PMCMS. Moreover, it produces a new mathematical model to build a multicast tree with minimum power consumption and takes into account the remaining power in each node. All proposed multicast strategies operate based on this mathematical model and aim to maximize the MANET lifetime by exploiting the advantages of SDN and clustering concepts. They consider the multicast tree with minimum power consumption as an optimal one. The simulation results illustrated that RMCMS is better than PMCMS, M-PMCMS, and MAODV in terms of power consumption and network overhead while M-PMCMS is the best one in terms of dropped packets ratio (DPR) and average end to end (E2E) delay.
Active Path Updation For Layered Routing (Apular) In Wireless Mesh Networkschetan1nonly
Routing is the major research issues in the Wireless Mesh Network (WMN). Ad-hoc networks routing protocols can be applied for WMN, but due to limited success & less efficiency there is need of more efficient routing protocols. In Infrastructure Wireless Mesh Routing Architecture (IWMRA) routing protocol, source node initiates a path establishing process whenever path breaks. This is not an ideal method in WMN where every nodes rather than source and destination in the path are motionless. One way of overcoming this is by initiating the local route repair by destination node. In this paper, we propose an active path updating procedure APULAR for quickly repair the broken path. Moreover, to improve throughput and to reduce the co-channel interference, we use multiple interface with multi channels. We are considering 4-hop as an interference range and will use fixed channel assignment within the mesh routers to reduce the inter flow interference. Our procedure is simulated in NS2 and compared with AODV – MI3 and APULAR-MI2, APULAR-MI3, APULAR-MI5. Simulation results show that our protocol performs better AODV in key performance metrics like packet delivery ratio, control overhead, average throughput and end-to-end delay.
An Adaptive Cluster Head Election Algorithm for Heterogeneous Mobile Ad-hoc N...IJLT EMAS
Mobile ad-hoc network characterized as a homogenous and heterogeneous on the basis of node capabilities. Heterogeneity property may make issues for mobile ad-hoc network in context of coverage area, link stability, lifetime etc. To resolve these issues, require a mechanism to adapt different characteristics and make decision for smooth functioning. Heterogeneity also leads effective routing problem that occurs instability in route or path. Though to make effective routing in this situation, efficient clustering algorithm may be apply. In this paper, the effects of heterogeneity property are studied and analyzed. A cluster head algorithm is also suggested to deal with the effects of the property. Suggested algorithm is simulated in network simulation and performance is evaluated in context of computation cost, lifetime and number of clusters.
To increase the network capacity, there is
need to minimize the interference among nodes and
optimum control of topology in the foundation of
network. Recently, technological development helps to
build of mobile ad-hoc networks (MANETs) in order to
improve the quality of service (QoS) in terms of delay. In
contradictory to the objective of minimizing interference,
it is important to concern topology control in delay
constrained environment. The present research work
attempts to control the delay-constrained topology with
jointly considering delay and interference concept.
Additionally, the study proposed an interference oriented
topology control algorithm for delay-constrained
MANETs by taking account of both the interference
constraint and the delay constraint under the specific
condition of transmission delay, contention delay and the
queuing delay. Further, the study investigated the impact
of node mobility on the interference oriented topology
control algorithm. Finally, the results of the present
study shows that the proposed algorithm controls the
topology to convince the interference constraint, and
increases the transmit range to congregate the delay
requirement. Also, the study conclude that the algorithm
could effectively reduce the delay protocol and improve
the performance effectively in delay-constrained mobile
ad hoc networks.
MESSAGE ROUTING IN WIRELESS AND MOBILE NETWORKS USING TDMA TECHNOLOGYijwmn
In an era where communication has a most important role in modern societies, designing efficient
algorithms for data transmission is of the outmost importance. TDMA is a technology used in many
communication systems such as satellite, cell phone as well as other wireless or mobile networks. Most 2G
cellular systems as well as some 3G are TDMA based. In order to transmit data in such systems we need
to cluster them in packages. To achieve a faster transmission we are allowed to preempt the transmission of
any packet in order to resume at a later time. Preemption can be used to reduce idleness of some stations.
Such preemptions though come with a reconfiguration cost in order to setup for the next transmission. In
this paper we propose two algorithms which yield improved transmission scheduling. These two algorithms
we call MGA and IMGA (Improved MGA). We have proven an approximation ratio for MGA and ran
experiments to establish that it works even better in practice. In order to conclude that MGA will be a very
helpful tool in constructing an improved schedule for packet routing using preemtion with a setup cost, we
compare its results to two other efficient algorithms designed by researchers in the past: A-PBS(d+1) and
GWA. To establish the efficiency of IMGA we ran experiments in comparison to MGA as well as APBS(d+1)
and GWA. IMGA has proven to produce the most efficient schedule on all counts.
International Journal of Computational Engineering Research(IJCER) is an intentional online Journal in English monthly publishing journal. This Journal publish original research work that contributes significantly to further the scientific knowledge in engineering and Technology.
A new clustering technique based on replication for MANET routing protocolsTELKOMNIKA JOURNAL
The cluster head nodes in most mobile ad hoc networks (MANET) clustering protocols take on an extraordinary role in managing routing information. The reliability, efficiency and scalability of the clustering in MANET will ultimately be dramatically impacted. In this work we establish a new approach to form the clusters in MANET called the square cluster-based routing protocol (SCBRP). That protocol is based on the theory of replication. The goal of the protocol is to achieve reliability, availability and scalability with in the MANET. The proposed protocol is evaluated by caring the performance analysis using the NS-3 simulator. The performance shows 50% improvementin data delivering ratio in large network size, also shows an improvement in network stability and availability which is reflected in energy consumption measurements and increase in the system lifetime to 20%.
Efficient routing mechanism using cycle based network and k hop security in a...ijait
In a multi-domain network, Topology Aggregation (TA) may be adopted to provide limited information
regarding intra cluster connectivity without revealing detailed topology information. Nodes are grouped
into the cluster. Every cluster has border nodes, which is used for data transmission between source and
destination. The K-hop security can be used for the purpose of securing the data communication. The
topologies are spanning tree and balanced tree that can be used to reduce bandwidth overhead, delivery
delay and to increase throughput and packet delivery ratio. The shortest path can be found using
Bhandari’s algorithm and Cycle-Based Minimum-Cost Domain-Disjoint Paths (CMCDP) Algorithm for
establish the second path in the network . These topologies are compared to demonstrate the advantage of
finding shortest path using Bhandari’s algorithm.
Ieee transactions 2018 on wireless communications Title and Abstracttsysglobalsolutions
Final year BE, B.Tech, ME, M.Tech projects along with our professionals for developing Real Time Applications in Emerging Technologies.
We can support to your final year projects in all domains with latest technologies and simulation tool like NS2, NS3, Glomosim, Opnet, Matlab, IDL, Sumo, Gridsim, Bonita tool & Cloud deployments (Cloudsim, Google App Engine, Amazon Deployment, and Real time Cloud Deployment)also we are support for JOURNAL and CONFERENCE Preparation.
?
TSYS Research and Development.
20/9 Sardar Patel Road, Janaki Complex,
4th Floor, Adyar, Chennai - 20?
Tel : 91 44 42607879, 98411 03123.
Website : http://www.tsysglobalsolutions.com/
http://tsysphdsupport.com/
The International Journal of Engineering & Science is aimed at providing a platform for researchers, engineers, scientists, or educators to publish their original research results, to exchange new ideas, to disseminate information in innovative designs, engineering experiences and technological skills. It is also the Journal's objective to promote engineering and technology education. All papers submitted to the Journal will be blind peer-reviewed. Only original articles will be published.
The papers for publication in The International Journal of Engineering& Science are selected through rigorous peer reviews to ensure originality, timeliness, relevance, and readability.
Mobile ad hoc network become nowadays more and more used in different
domains, due to its flexibility and low cost of deployment. However, this
kind of network still suffering from several problems as the lack of resources.
Many solutions are proposed to face these problems, among these solutions
there is the clustering approach. This approach tries to partition the network
into a virtual group. It is considered as a primordial solution that aims to
enhance the performance of the total network, and makes it possible to
guarantee basic levels of system performance. In this paper, we study some
schemes of clustering such as Dominating-Set-based clustering, Energyefficient
clustering, Low-maintenance clustering, Load-balancing clustering,
and Combined-metrics based clustering.
Algorithmic Construction of Optimal and Load Balanced Clusters in Wireless Se...M H
This paper proposes a clustering algorithm - Ba-lanced Minimum Radius Clustering (BMRC) - for use in large scale, distributed Wireless Sensor Networks (WSN). Cluster balancing is an intractable problem to solve in a distributed manner, and distribution is important, by reason of both avoiding specialised node vulnerability and minimising message overhead.The BMRC algorithm described here distributes several of the cluster balancing functions to the cluster-heads. In proposing this algorithm, several tentative claims have been made for it, namely that it is suitable for arbitrary number of cluster heads; that its pecifies a way to elect cluster heads and use them to create the local models; that it accomplishes optimal balanced clusters in distributed manner; that it is scalable and it uses the number-of-hops as a clustering parameter; that it is energy efficient. These claims were studied and verified by simulation.
A New Paradigm for Load Balancing in WMNsCSCJournals
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.
Mobile elements scheduling for periodic sensor applicationsijwmn
In this paper, we investigate the problem of designing the mobile elements tours such that the length of each tour is below a per-determined length and the depth of the multi-hop routing trees bounded by k. The path of the mobile element is designed to visit subset of the nodes (cache points). These cache points store other nodes data. To address this problem, we propose two heuristic-based solutions. Our solutions take into consideration the distribution of the nodes during the establishment of the tour. The results of our experiments indicate that our schemes significantly outperforms the best comparable scheme in the literature.
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
Optimized Traffic Flow over Multipath in Optical Networkspaperpublications3
Abstract: In optical networks, the delivery of a traffic flow with a certain bandwidth demand over a single network path is either not possible or not cost-effective. In these cases, it is very often possible to improve the network's bandwidth utilization by splitting the traffic flow over multiple efficient paths. While using multiple paths for the same traffic flow increases the efficiency of the network, it consumes expensive forwarding resources from the network nodes such as wavelengths/light paths of optical networks. The problem of reducing forwarding cost can be defined in two cases such as Routing with Minimum Overhead and Decomposition with Minimum Overhead. For Routing with Minimum Overhead only the traffic demand must be given and for Decomposition with Minimum Overhead both the traffic demand and network flow will be given. For both the problems forwarding cost can be minimized by measuring the number of paths and the number of nodes traversed by these paths.
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.
Multicast routing strategy for SDN-cluster based MANET IJECEIAES
The energy limitation and frequent movement of the mobile Ad hoc network (MANET) nodes (i.e., devices) make the routing process very difficult. The multicast routing problem is one of the NP-complete problems. Therefore, the need for a new power-aware approach to select an optimum multicast path with minimum power consumption that can enhance the performance and increase the lifetime of MANET has become urgent. Software defined network (SDN) is a new technique that can solve many problems of the traditional networks by dividing the architecture into data part and control part. This paper presents three power-aware multicast routing strategies for MANET. First one called a Reactive Multicast routing strategy for Cluster based MANET by using SDN (RMCMS), second one called Proactive Multicast routing strategy for Cluster based MANET by using SDN (PMCMS) and third one represents Modification of PMCMS called M-PMCMS. Moreover, it produces a new mathematical model to build a multicast tree with minimum power consumption and takes into account the remaining power in each node. All proposed multicast strategies operate based on this mathematical model and aim to maximize the MANET lifetime by exploiting the advantages of SDN and clustering concepts. They consider the multicast tree with minimum power consumption as an optimal one. The simulation results illustrated that RMCMS is better than PMCMS, M-PMCMS, and MAODV in terms of power consumption and network overhead while M-PMCMS is the best one in terms of dropped packets ratio (DPR) and average end to end (E2E) delay.
Active Path Updation For Layered Routing (Apular) In Wireless Mesh Networkschetan1nonly
Routing is the major research issues in the Wireless Mesh Network (WMN). Ad-hoc networks routing protocols can be applied for WMN, but due to limited success & less efficiency there is need of more efficient routing protocols. In Infrastructure Wireless Mesh Routing Architecture (IWMRA) routing protocol, source node initiates a path establishing process whenever path breaks. This is not an ideal method in WMN where every nodes rather than source and destination in the path are motionless. One way of overcoming this is by initiating the local route repair by destination node. In this paper, we propose an active path updating procedure APULAR for quickly repair the broken path. Moreover, to improve throughput and to reduce the co-channel interference, we use multiple interface with multi channels. We are considering 4-hop as an interference range and will use fixed channel assignment within the mesh routers to reduce the inter flow interference. Our procedure is simulated in NS2 and compared with AODV – MI3 and APULAR-MI2, APULAR-MI3, APULAR-MI5. Simulation results show that our protocol performs better AODV in key performance metrics like packet delivery ratio, control overhead, average throughput and end-to-end delay.
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.
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.
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.
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.
A wireless network consists of a set of wireless nodes forming the network. The bandwidth allocation scheme used in wireless networks should automatically adapt to the network’s environments, where issues such as mobility are highly variable. This paper proposes a method to distribute the bandwidth for wireless network nodes depending on dynamic methodology;this methodology uses intelligent clustering techniques that depend on the student’s distribution at the university campus, rather than the classical allocation methods. We propose a clustering-based approach to solve the dynamic bandwidth allocation problem in wireless networks, enabling wireless nodes to adapt their bandwidth allocation according to the changing number of expected users over time. The proposed solution allows the optimal online bandwidth allocation based on the data extracted from the lectures timetable, and fed to the wireless network control nodes, allowing them to adapt to their environment. The environment data is processed and clustered using the KMeans clustering algorithm to identify potential peak times for every wireless node. The proposed solution feasibility is tested by applying the approach to a case study, at the Arab American University campus wireless network.
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.
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
Optimal Coverage Path Planningin a Wireless Sensor Network for Intelligent Tr...IJCNCJournal
With the enhancement of the intelligent and communication technology, an intelligent transportation plays a vital role to facilitate an essential service to many people, allowing them to travel quickly and conveniently from place to place. Wireless sensor networks (WSNs) are well-known for their ability to detect physical significant barriers due to their diverse movement, self-organizing capabilities, and the integration of this mobile node on the intelligent transportation system to gather data in WSN contexts is becoming more and more popular as these vehicles proliferate. Although these mobile devices might enhance network performance, however it is difficult to design a suitable transportation path with the limited energy resources with network connectivity. To solve this problem, we have proposed a novel itinerary planning schema data gatherer (IPS-DG) model. Furthermore, we use the path planning module (PPM) which finds the transportation path to travel the shortest distance. We have compared our results under different aspect such as life span, energy consumption, and path length with Low Energy Adaptive Clustering Hierarchy (LEACH), Multi-Hop Weighted Revenue (MWR), Single-Hop Data Gathering Procedure (SHDGP). Our model outperforms in terms of energy usage, shortest path, and longest life span of with LEACH, MWR, SHDGP routing protocols.
Optimal Coverage Path Planning in a Wireless Sensor Network for Intelligent T...IJCNCJournal
With the enhancement of the intelligent and communication technology, an intelligent transportation plays a vital role to facilitate an essential service to many people, allowing them to travel quickly and conveniently from place to place. Wireless sensor networks (WSNs) are well-known for their ability to detect physical significant barriers due to their diverse movement, self-organizing capabilities, and the integration of this mobile node on the intelligent transportation system to gather data in WSN contexts is becoming more and more popular as these vehicles proliferate. Although these mobile devices might enhance network performance, however it is difficult to design a suitable transportation path with the limited energy resources with network connectivity. To solve this problem, we have proposed a novel itinerary planning schema data gatherer (IPS-DG) model. Furthermore, we use the path planning module (PPM) which finds the transportation path to travel the shortest distance. We have compared our results under different aspect such as life span, energy consumption, and path length with Low Energy Adaptive Clustering Hierarchy (LEACH), Multi-Hop Weighted Revenue (MWR), Single-Hop Data Gathering Procedure (SHDGP). Our model outperforms in terms of energy usage, shortest path, and longest life span of with LEACH, MWR, SHDGP routing protocols.
CFMS: A CLUSTER-BASED CONVERGECAST FRAMEWORK FOR DENSE MULTI-SINK WIRELESS SE...ijwmn
Convergecast is one of the most challenging tasks in Wireless Sensor Networks (WSNs). Indeed, this data
collection process must be conducted while copying with packet collisions, nodes’ congestion or data
redundancy. These issues always result in energy waste which is detrimental to network efficiency and
lifetime. This paper is aimed to address these problems in large-scale multi-sink WSNs. Inspired by our
previous work MSCP, we designed a lightweight protocol stack that seamlessly combines clustering, pathvector routing, sinks’ duty cycling, data aggregation and transmission scheduling in order to minimise
message overhead and packet losses. Simulation results show that this solution can mitigate delay while
significantly increasing packet delivery and network lifetime.
CFMS: A Cluster-based Convergecast Framework for Dense Multi-Sink Wireless Se...ijwmn
Convergecast is one of the most challenging tasks in Wireless Sensor Networks (WSNs). Indeed, this data
collection process must be conducted while copying with packet collisions, nodes’ congestion or data
redundancy. These issues always result in energy waste which is detrimental to network efficiency and
lifetime. This paper is aimed to address these problems in large-scale multi-sink WSNs. Inspired by our
previous work MSCP, we designed a lightweight protocol stack that seamlessly combines clustering, pathvector routing, sinks’ duty cycling, data aggregation and transmission scheduling in order to minimise
message overhead and packet losses. Simulation results show that this solution can mitigate delay while
significantly increasing packet delivery and network lifetime.
CFMS: A CLUSTER-BASED CONVERGECAST FRAMEWORK FOR DENSE MULTI-SINK WIRELESS SE...ijwmn
Convergecast is one of the most challenging tasks in Wireless Sensor Networks (WSNs). Indeed, this data
collection process must be conducted while copying with packet collisions, nodes’ congestion or data
redundancy. These issues always result in energy waste which is detrimental to network efficiency and
lifetime. This paper is aimed to address these problems in large-scale multi-sink WSNs. Inspired by our
previous work MSCP, we designed a lightweight protocol stack that seamlessly combines clustering, pathvector routing, sinks’ duty cycling, data aggregation and transmission scheduling in order to minimise
message overhead and packet losses. Simulation results show that this solution can mitigate delay while
significantly increasing packet delivery and network lifetime.
Design and implementation of new routingIJCNCJournal
Energy consumption is a key element in the Wireless Sensor Networks (WSNs) design. Indeed, sensor nodes are really constrained by energy supply. Hence, how to improve the network lifetime is a crucial and challenging task. Several techniques are available at different levels of the OSI model to maximize the WSN lifetime and especially at the network layer which uses routing strategies to maintain the routes in the network and guarantee reliable communication. In this paper we intend to propose a new protocol called
Combined Energy and Distance Metrics Dynamic Routing Protocol (CEDM-DR). Our new approach considers not only the distance between wireless sensors but also the energy of node acting as a router in order to find the optimal path and achieve a dynamic and adaptive routing.
The performance metrics exploited for the evaluation of our protocol are average energy consumed, network lifetime and packets lost. By comparing our proposed routing strategy to protocol widely used in WSN namely Ad hoc On demand Distance Vector(AODV), simulation results show that CEDM-DR strategy might effectively balance the sensor power consumption and permits accordingly to enhance the network
lifetime. As well, this new protocol yields a noticeable energy saving compared to its counterpart.
Improving the Proactive Routing Protocol using Depth First Iterative Deepenin...Yayah Zakaria
Owing to the wireless and mobility nature, nodes in a mobile ad hoc network are not within the transmission range. It needs to transfer data through the multi-intermediate nodes. Opportunistic data forwarding is an assuring solution to make use of the broadcast environment of wireless communication links. Due to absence of source routing capability with efficient proactive routing protocol, it is not widely used. To rectify the
problem, we proposed memory and routing efficient proactive routing protocol using Depth-First Iterative-Deepening and hello messaging scheme. This protocol can conserve the topology information in every node in the network. In experimental analysis and discussion, we implemented the proposed work using NS2 simulator tool and proved that the proposed technique is performed well in terms of average delay, buffer and throughput.
A Vertical Handover Algorithm in Integrated Macrocell Femtocell Networks Yayah Zakaria
The explosion in wireless telecommunication technologies has lead to a huge increase in the number of mobile users. The greater dependency on the mobile devices has raised the user’s expectations to always remain best connected. In the process, the user is always desiringgood signal strength even at certain black spots and indoors. Moreover, the exponential growth of
the number of mobile devices has overloaded macrocells. Femtocells have emerged out as a good promising solution for complete coverage indoors and for offloading macrocell. Therefore, a new handover strategy between femtocells and macrocell is proposed in this paper. The proposed handover
algorithm is mainly based on calculating equivalent received signal strength along with dynamic margin for performing handover. The simulation results of proposed algorithm are compared with the traditional algorithm. The proposed strategy shows improvement in two major performance parameters
namely reduction in unnecessary handovers and Packet Loss Ratio. The quantitative analysis further shows 55.27% and 23.03% reduction in packet loss ratio and 61.85% and 36.78% reduction in unnecessary handovers at a speed of 120kmph and 30kmph respectively. Moreover, the proposed algorithm proves to be an efficient solution for both slow and fast moving vehicles.
Symmetric Key based Encryption and Decryption using Lissajous Curve EquationsYayah Zakaria
Sender and receiver both uses two large similar prime numbers and uses parametric equations for swapping values of kx and by product of kx and ky is the common secret key. Generated secret key is used for encryption and decryption using ASCII key matrix of order 16X16. Applying playfair rules for encryption and decryption. Playfair is a digraph substitution cipher. Playfair makes use of pairs of letters for encryption and decryption. This
application makes use of all ASCII characters which makes brute force attack impossible.
Gain Flatness and Noise Figure Optimization of C-Band EDFA in 16-channels WDM...Yayah Zakaria
In this paper, Gain Flatness and Noise Figure of Erbium Doped Fiber Amplifier (EDFA) have been investigated in 16-channels Wavelength Division Multiplexing (WDM). Fiber Bragg Grating (FBG) is used in C-band with the aim to achieve flat EDFA output gain. The proposed model has been studied in detail to evaluate and to enhance the performance of the transmission system in terms of gain, noise figure and eye diagram of the
received signals. To that end, various design parameters have been investigated and optimized, such as frequency spacing, EDF length and temperature. To enhance the transmission system performance in terms of gain flatness, the Gain Flattening Filter (GFF) has been introduced in the design. To prove the efficiency of the new design, the optical transmission
system with optimized design parameters has been compared with a previous works in the literature. The simulation results show satisfactory performance with quasi-equalized gain for each channel of the WDM transmission system.
In this paper partial H-plane band-pass waveguide filter, utilizing a novel resonant structure comprising a metal window along with metal posts has been proposed to compactthe filter size. The metal windows and postshave been implemented transversely in a partial H-plane waveguides, which have
one-quarter cross section size compared to the conventional waveguides in the same frequency range. Partial H-plane band-pass waveguide filter with novel proposed resonant structures has considerably shorter longitudinal length compared to the conventional partial H-plane filters, so that they reduce both cross section size and the total length of the filter compared to
conventional H-plane filters, in the same frequency range. In the presented design procedure, the size and shape of each metal window and metal posts has been determined by fitting the transfer function of the proposed resonant structure to that of a desiredone, which is obtained from a suitable equivalent
circuit model. The design process is based on optimization using
electromagnetic simulator software, HFSS. A proposed partial H-plane bandpass
filter has been designed and simulated to verify usefulness and
performanceof the design method.
Vehicular Ad Hoc Networks: Growth and Survey for Three Layers Yayah Zakaria
A vehicular ad hoc network (VANET) is a mobile ad hoc network that allows wireless communication between vehicles, as well as between vehicles and roadside equipment. Communication between vehicles promotes safety and reliability, and can be a source of entertainment. We investigated the historical development, characteristics, and application fields of VANET and briefly introduced them in this study. Advantages and disadvantages were discussed based on our analysis and comparison of various classes of MAC and routing protocols applied to VANET. Ideas and breakthrough directions for inter-vehicle communication designs were proposed based on the
characteristics of VANET. This article also illustrates physical, MAC, and network layer in details which represent the three layers of VANET. The main works of the active research institute on VANET were introduced to help researchers track related advanced research achievements on the subject.
Barriers and Challenges to Telecardiology Adoption in Malaysia Context Yayah Zakaria
Mainly in infrastructure deficient communities, telecardiology is considered as a complement to insufficient cardiac care. Telecardiology can reduce travelling and waiting time, enables information sharing in shorter time and facilitate care in rural and remote areas. A qualitative study examined the perspectives of health care providers: cardiologist and general physician and
health care service receivers: patient and public towards telecardiology adoption. The barriers in telecardiology adoption were identified in this paper. It includes practicality of telecardiology, the need of education for staffs and administrators, ease of use, preferred face-to-face consultation,
cost and confidentiality. Improvements can be done by the implementers based on this study in order to promote telecardiology successfully in Malaysia.
Novel High-Gain Narrowband Waveguide-Fed Filtenna using Genetic Algorithm Yayah Zakaria
Filtenna is an antenna with filtering feature. There are many ways to design a filtenna. In this paper, a high-gain narrowband waveguide-fed aperture filtenna has been proposed and designed. A patterned plane, which is designed using genetic algorithm has been used at the open end of the waveguide fed, mounted on a conducting ground plane. To design the patterned pattern, magnetic field integral equation of the structure has been derived, so it has been solved using method of moments. The proposed filtenna has been simulated with HFSS that confirms the results obtained by method of moments. Finally, an unprinted dielectric as a superstrate has been used to enhance the gain of the filtenna. The filtenna bandwidth is 1.76% (160 MHz) which has the gain of 15.91 dB at the central frequency
of 9.45 GHz.
Improved Algorithm for Pathological and Normal Voices Identification Yayah Zakaria
There are a lot of papers on automatic classification between normal and pathological voices, but they have the lack in the degree of severity estimation of the identified voice disorders. Building a model of pathological and normal voices identification, that can also evaluate the degree of severity
of the identified voice disorders among students. In the present work, we present an automatic classifier using acoustical measurements on registered sustained vowels /a/ and pattern recognition tools based on neural networks. The training set was done by classifying students’ recorded voices based on threshold from the literature. We retrieve the pitch, jitter, shimmer and harmonic-to-noise ratio values of the speech utterance /a/, which constitute the input vector of the neural network. The degree of severity is estimated to evaluate how the parameters are far from the standard values based on the percent of normal and pathological values. In this work, the base data used for testing the proposed algorithm of the neural network is formed by healthy
and pathological voices from German database of voice disorders. The
performance of the proposed algorithm is evaluated in a term of the accuracy
(97.9%), sensitivity (1.6%), and specificity (95.1%). The classification rate is
90% for normal class and 95% for pathological class.
Uncertain Systems Order Reduction by Aggregation Method Yayah Zakaria
In the field of control engineering, approximating the higher-order system with its reduced model copes with more intricateproblems. These complex problems are addressed due to the usage of computing technologies and advanced algorithms. Reduction techniques enable the system from higherorder to lower-order form retaining the properties of former even after reduction. This document renders a method for demotion of uncertain systems based on State Space Analysis. Numerical examples are illustrated to show the accuracy of the proposed method.
A Three-Point Directional Search Block Matching Algorithm Yayah Zakaria
This paper proposes compact directional asymmetric search patterns, which we have named as three-point directional search (TDS). In most fast search motion estimation algorithms, a symmetric search pattern is usually set at the minimum block distortion point at each step of the search. The design of the
symmetrical pattern in these algorithms relies primarily on the assumption that the direction of convergence is equally alike in each direction with respect to the search center. Therefore, the monotonic property of real -world video sequences is not properly used by these algorithms. The strategy of TDS is to keep searching for the minimum block distortion point in the most probable directions, unlike the previous fast search motion estimation algorithms where all the directions are checked. Therefore, the proposed method significantly reduces the number of search points for locating a motion vector. Compared to conventional fast algorithms, the proposed method has the fastest search speed and most satisfactory PSNR values for
all test sequences.
Human Data Acquisition through Biometrics using LabVIEW Yayah Zakaria
Human Data Acquisition is an innovative work done based on fingerprints of a particular person. Using the fingerprints we can get each and every detail of any individual. Through this, the data acquired can be used in many applications such as Airport Security System, Voting System, and Employee login System, in finding the thieves etc. We in our project have implemented
in Voting System. In this we use the components such as MyDAQ which is data acquisition device. The coding here is in done in a Graphical Programming language named LabVIEW where the execution of any program is done in a sequential way or step by step according to the data received.
A Survey on Block Matching Algorithms for Video Coding Yayah Zakaria
Block matching algorithm (BMA) for motion estimation (ME) is the heart to many motion-compensated video-coding techniques/standards, such as ISO MPEG-1/2/4 and ITU-T H.261/262/263/264/265, to reduce the temporal redundancy between different frames. During the last three decades,
hundreds of fast block matching algorithms have been proposed. The shape and size of search patterns in motion estimation will influence more on the searching speed and quality of performance. This article provides an overview of the famous block matching algorithms and compares their computational complexity and motion prediction quality.
An Accurate Scheme for Distance Measurement using an Ordinary Webcam Yayah Zakaria
Nowadays, image processing has become one of the widely used computer aided science. Two major branches of this scientific field are image enhancement and machine vision. Machine vision has many applications and demands in robotic and defense industries. Detecting distance of objects is
one of the extensive research in the defense industry and robotic industries that a lot of annual projects have been involved in this issue both inside and outside the country. So, in this paper, an accurate algorithm is presented for measuring the distance of the objects from a camera. In this method, a laser
transmitter is used alongside a regular webcam. The laser light is transmitted to the desired object and then the distance of the object is calculated using image processing methods and mathematical and geometric relations. The performance of the proposed algorithm was evaluated using MATLAB software. The accuracy rate of distance detection is up to 99.62%. The results
also has shown that the presented algorithms make the obstacle distance measurement more reliable. Finally, the performance of the proposed algorithm was compared with other methods from different literatures.
Identity Analysis of Egg Based on Digital and Thermal Imaging: Image Processi...Yayah Zakaria
This research was conducted to analyze the identification of eggs. The research processes use two tools, namely thermal imaging camera and smartphone camera. The identification process was done by using Matlab prototype tools. The image has been acquired by means of proficiency level, then analyzed and applied several methods. Image acquisition results of thermal imaging camera are processed using morphological dilation and do the complement in black and white (BW). While the digital image uses the merger method of morphological dilation and opening, and it doesn't need to be complemented. Labeling process is done, and the process of determining centroid and bounding box. The process has been done and it can be applied for identifying of chicken eggs with the accuracy rate of 100%. There are different methods of both images is obtained area (pixels) which is equivalent to the difference is very small as 6 x 10-3.
.
Recognition of Tomato Late Blight by using DWT and Component Analysis Yayah Zakaria
Plant disease recognition concept is one of the successful and important applications of image processing and able to provide accurate and useful information to timely prediction and control of plant diseases. In the study, the wavelet based features computed from RGB images of late blight infected images and healthy images. The extracted features submitted to Principal Component Analysis (PCA), Kernel Principal Component Analysis (KPCA) and Independent Component Analysis performed (ICA) for reducing dimensions in feature data processing and classification. To recognize and classify late blight from healthy plant images are classified into two classes i.e. late blight infected or healthy. The Euclidean Distance measure is used to compute the distance by these two classes of training and testing dataset for tomato late blight recognition and classification. Finally, the three-component analysis is compared for late blight recognition accuracy. The Kernel Principal Component Analysis (KPCA) yielded overall recognition accuracy with 96.4%.
Fuel Cell Impedance Model Parameters Optimization using a Genetic Algorithm Yayah Zakaria
The objective of this paper is the PEM fuel cell impedance model parameters identification. This work is a part of a larger work which is the diagnosis of the fuel cell which deals with the optimization and the parameters identification of the impedance complex model of the Nexa Ballard 1200 PEM fuel cell. The method used for the identification is a sample genetic algorithm and the proposed impedance model is based on electric parameters, which will be found from a sweeping of well determined frequency bands. In fact, the frequency spectrum is divided into bands according to the behavior of the fuel cell. So, this work is considered a first in the field of impedance spectroscopy So, this work is considered a first in the field of impedance spectroscopy. Indeed, the identification using genetic algorithm requires experimental measures of the fuel cell impedance to optimize and identify the impedance model parameters values. This method is characterized by a good precision compared to the numeric methods. The obtained results prove the effectiveness of this approach.
Noise Characterization in InAlAs/InGaAs/InP pHEMTs for Low Noise Applications Yayah Zakaria
In this paper, a noise revision of an InAlAs/InGaAs/InP psoeudomorphic high electron mobility transistor (pHEMT) in presented. The noise performances of the device were predicted over a range of frequencies from 1GHz to 100GHz. The minimum noise figure (NFmin), the noise resistance (Rn) and optimum source impedance (Zopt) were extracted using two
approaches. A physical model that includes diffusion noise and G-R noise models and an analytical model based on an improved PRC noise model that considers the feedback capacitance Cgd. The two approaches presented matched results allowing a good prediction of the noise behaviour. The
pHEMT was used to design a single stage S-band low noise amplifier (LNA). The LNA demonstrated a gain of 12.6dB with a return loss coefficient of 2.6dB at the input and greater than -7dB in the output and an overall noise figure less than 1dB.
Effect of Mobility on (I-V) Characteristics of Gaas MESFET Yayah Zakaria
We present in this paper an analytical model of the current–voltage (I-V) characteristics for submicron GaAs MESFET transistors. This model takes into account the analysis of the charge distribution in the active region and incorporate a field depended electron mobility, velocity saturation and charge
build-up in the channel. We propose in this frame work an algorithm of simulation based on mathematical expressions obtained previously. We propose a new mobility model describing the electric field-dependent. predictions of the simulator are compared with the experimental data [1] and
have been shown to be good.
Performance Analysis of Post Compensated Long Haul High Speed Coherent Optica...Yayah Zakaria
This paper addresses the performance analysis of OFDM transmission system based on coherent detection over high speed long haul optical links with high spectral efficiency modulation formats such as Quadrature Amplitude Modulation (QAM) as a mapping method prior to the OFDM multicarrier representation. Post compensation is used to compensate for
phase noise effects. Coherent detection for signal transmitted at bit rate of 40 Gbps is successfully achieved up to distance of 3200km. Performance is analyzed in terms of Symbol Error Rate and Error Vector Magnitude by varying Optical Signal to Noise Ratio (OSNR) and varying the length of the fiber i.e transmission distance. Transmission performance is also observed through constellation diagrams at different transmission distances and
different OSNRs.
Sachpazis:Terzaghi Bearing Capacity Estimation in simple terms with Calculati...Dr.Costas Sachpazis
Terzaghi's soil bearing capacity theory, developed by Karl Terzaghi, is a fundamental principle in geotechnical engineering used to determine the bearing capacity of shallow foundations. This theory provides a method to calculate the ultimate bearing capacity of soil, which is the maximum load per unit area that the soil can support without undergoing shear failure. The Calculation HTML Code included.
Hybrid optimization of pumped hydro system and solar- Engr. Abdul-Azeez.pdffxintegritypublishin
Advancements in technology unveil a myriad of electrical and electronic breakthroughs geared towards efficiently harnessing limited resources to meet human energy demands. The optimization of hybrid solar PV panels and pumped hydro energy supply systems plays a pivotal role in utilizing natural resources effectively. This initiative not only benefits humanity but also fosters environmental sustainability. The study investigated the design optimization of these hybrid systems, focusing on understanding solar radiation patterns, identifying geographical influences on solar radiation, formulating a mathematical model for system optimization, and determining the optimal configuration of PV panels and pumped hydro storage. Through a comparative analysis approach and eight weeks of data collection, the study addressed key research questions related to solar radiation patterns and optimal system design. The findings highlighted regions with heightened solar radiation levels, showcasing substantial potential for power generation and emphasizing the system's efficiency. Optimizing system design significantly boosted power generation, promoted renewable energy utilization, and enhanced energy storage capacity. The study underscored the benefits of optimizing hybrid solar PV panels and pumped hydro energy supply systems for sustainable energy usage. Optimizing the design of solar PV panels and pumped hydro energy supply systems as examined across diverse climatic conditions in a developing country, not only enhances power generation but also improves the integration of renewable energy sources and boosts energy storage capacities, particularly beneficial for less economically prosperous regions. Additionally, the study provides valuable insights for advancing energy research in economically viable areas. Recommendations included conducting site-specific assessments, utilizing advanced modeling tools, implementing regular maintenance protocols, and enhancing communication among system components.
Industrial Training at Shahjalal Fertilizer Company Limited (SFCL)MdTanvirMahtab2
This presentation is about the working procedure of Shahjalal Fertilizer Company Limited (SFCL). A Govt. owned Company of Bangladesh Chemical Industries Corporation under Ministry of Industries.
Final project report on grocery store management system..pdfKamal Acharya
In today’s fast-changing business environment, it’s extremely important to be able to respond to client needs in the most effective and timely manner. If your customers wish to see your business online and have instant access to your products or services.
Online Grocery Store is an e-commerce website, which retails various grocery products. This project allows viewing various products available enables registered users to purchase desired products instantly using Paytm, UPI payment processor (Instant Pay) and also can place order by using Cash on Delivery (Pay Later) option. This project provides an easy access to Administrators and Managers to view orders placed using Pay Later and Instant Pay options.
In order to develop an e-commerce website, a number of Technologies must be studied and understood. These include multi-tiered architecture, server and client-side scripting techniques, implementation technologies, programming language (such as PHP, HTML, CSS, JavaScript) and MySQL relational databases. This is a project with the objective to develop a basic website where a consumer is provided with a shopping cart website and also to know about the technologies used to develop such a website.
This document will discuss each of the underlying technologies to create and implement an e- commerce website.
Saudi Arabia stands as a titan in the global energy landscape, renowned for its abundant oil and gas resources. It's the largest exporter of petroleum and holds some of the world's most significant reserves. Let's delve into the top 10 oil and gas projects shaping Saudi Arabia's energy future in 2024.
2. IJECE ISSN: 2088-8708
Improvement at Network Planning using Heuristic Algorithm to Minimize Cost of Distance … (Shivan Q.A.)
310
In a mesh network communication, the devices can be generally categorized into three; clients,
routers and gateways. Gateways provide services for the network while routers relay the data that travels
between gateways and the network subscribers. Figure 1, shows the infrastructure of a WMN.
Figure 1. WMN infrastructure. Adapted from [14]
In Figure 1, the dashed and solid lines indicate wireless and wired links respectively. For medium
access control, the infrastructure can be reduced to base, relay and subscriber. In this case, it is assumed that
information or data packet must travel from a base station (BS) to a subscriber station (SS) via relay station
(RS) in an unsplittable flow although it is possible to route the packet in a multi-path manner.
Nodes may interfere with one another when they are rebroadcasting at the same time within a small
region on the same channel. This is called dense mesh network dilemma. Among the ways to resolve this
issue is splitting network resources in their own channel such as splitting time in time channel and frequency
in frequency channel [15]. Now that there are resources need to be handled, a question of how to allocate
these available resources arises while taking other factors into consideration as well.
In wireless network route planning, resource allocation plays an important role to give a cost-and-
energy-efficient solution. Heuristic approach to solve path planning in wireless network is seen as one of the
most popular research areas in the recent years [16].
Proposed a heuristic algorithm to minimize the number of transmission tree and indirectly conserve
bandwidth. The proposed algorithm however was built to allow multicast protocol instead of single-path. In
another paper [17], implemented ant colony optimization into their anycast routing protocol in the aim to
select proper access gateway in WMN. Combining distributed computing with heuristic searching of ant
colony algorithm, the gateway selection was treated as an anycast service [18.] Analyzed different meta-
heuristic methods to consider the placement of mesh routers in WMNs. Taking connectivity and coverage
problems, various schemes including genetic algorithm, simulated annealing, tabu search, and hill climbing
were used to analyze their behaviors. The authors then used Friedman test to compare the simulation results.
Here, it has been found that different algorithms work better than the others when subjected to different
situations [19]. In their effort to maximize the serviced number of clients or subscribers in WMN, they
developed load-based greedy algorithm integrated with load-based MCM algorithm to offer a delay-
contrained and interference-free solution to construct multicast trees for the network [20]. Proposed a genetic
algorithm to solve node placement problem in a wireless mesh network. By employing different mutation and
selection operators as well as size of giant component, the authors considered Weibull distribution for the
mesh clients [21]. Combined multi-objective Particle Swarm Optimization and Genetic Algorithm to devise a
swarm-based algorithm to solve WMN planning problems of three models. The three multi-objective models
3. ISSN: 2088-8708
IJECE Vol. 7, No. 1, February 2017 : 309 – 315
311
are load-balanced, interference and flow-capacity models [22]. Adapted a new approach of placing mesh
router nodes in WMN through heuristic tabu search. Acknowledging that a WMN optimization problem is
oftentimes NP-complete, the authors explore the solution space at the same time avoid getting stuck in local
minima by maximizing the size of giant components.
2. PREVIOUS APPROACH
Critical design factors of WMNs bring forth different challenging issues ranging from the physical
layer to the application layer and it is apparent that many problems still remain [15]. Presented various
heuristic methods to establish a wireless mesh network in IEEE 802.16j in an economical way. The work
proposed a low cost RS and BS in order to compensate for bandwidth demand of the clients. Although the
methods appear robust, they suffer from several limitations. After careful observations, it has been found that
[15] failed to reflect the significance of distance between stations in the network. For example, if a node is
dedicated to be a routing station or a base station to serve one subscriber, ignoring the node's distance from
the subscriber might impact the quality of communication if the subscriber’s distance from the node is small
even if the cost is higher. Figure 2, is a graph showing possible links between nodes where the best solution
is emboldened.
Figure 2. Example of an optimal solution. Adopted from [15]
It is known that digital signal attenuates during transmission. In instances where the distance
between two nodes gets larger, the attenuation also grows bigger. In their effort to minimize the cost of
establishing the network, they overlooked the affect that it does not always guarantee getting best
performance inside the network. Such trade-off is common in optimization problems. This paper proposes an
improvement for the method in network planning using heuristic algorithm where the primary purpose is to
minimize the cost by taking into account the distance between nodes in WMN.
3. PROPOSE APPROACH
The problem at hand is a binary optimization problem. We have decided to approach the problem
using Modified Binary Particle Swarm Optimization (MBPSO). MBPSO was chosen as it overcomes the
unreasonable behavior of its predecessor, BPSO [23]. Suppose that the number of SSs is , the number of
RSs is , and the number of BSs is . The sum of components in each particle is equal to [15],
(1)
Whenever a new particle is generated, whether it is randomly generated (initialization phase or due
to mutation) or due to the algorithm’s progression, it must be checked for validity. If a station presented
(by ―1‖) is invalid in real life due to it being out of the coverage area, it must be removed from the matrix that
represents it (by turning it into ―0‖).
The aim of solving the problem is to minimize the cost of establishing a network. The fitness value
of a network is as follows,
(2)
4. IJECE ISSN: 2088-8708
Improvement at Network Planning using Heuristic Algorithm to Minimize Cost of Distance … (Shivan Q.A.)
312
However, performance is not guaranteed just by minimizing the cost of establishing a network with
regard to metrics such as PDR and E2E delay. [15] approached the problem from the perspective of cost but
it ignored a crucial factor in network performance, i.e., the distance between network stations. Digital signals
attenuate during transmission with respect to distance. The greater the distance, the greater the attenuation.
Thus, ignoring such a consideration is detrimental to the performance of a network.
The mathematical model, ―Model Based on Flow Conservation and Capacity‖ proposed by [15] is
good and we have adapted it for the research at hand. Distance was taken into account during network
planning by updating the objective function 2 as follows,
(3)
Optimization will help minimize the previous function, which would balance minimizing cost and
the total distance possible between network stations. Thus, improving the overall performance of the
network.
4. EXPERIMENTS AND RESULTS
This section discusses the results from the conducted experiments in detail. A tripartite graph was
used as the simulation model in MATLAB and is shown in Figure 3.
Figure 3. Tripartite graph representation of a sample problem. Adopted from [15]
Firstly, MBPSO had to be evaluated for which the MATLAB environment was chosen. The original
objective function was used and the result presented as a matrix,
The result had the following pattern: , where elements:
1 and 2 represent .
3 and 4 represent .
5 to 10 represent .
11 to 16 represent .
17 to 20 represent . See Table 1.
Table 1. Particle Swarm Optimization parameters and chosen values
No. of Elements 20
No. of Result Matrices 50
Velocity Range [ ]
No. of Iterations 600
C1 1
C2 0.5
0.3
0.9
Mutation Rate 0.1
5. ISSN: 2088-8708
IJECE Vol. 7, No. 1, February 2017 : 309 – 315
313
The algorithm generated a solution with an establishment cost of 25, as follows:
[ ]
where [ ], [ ], [ ], [ ], and [ ]. In this solution,
BS 1 and RS 2 form the backbone of the network, where BS 1 serves RS 2, which in turn serves SSs 1, 2, and
3. Upon updating the objective function, MBPSO was performed with the same parameters. In order to
perform comparison between our approach and [15], the distances between the different network stations
have to be known. These distances have been assumed and are presented in Tables (2-3). The distance
between RS 1 and SS 2 (30) is less than that between RS 2 and SS 2 (80).
Table 2. Distances between BSs and RSs and SSs
distance distance Coverage Zone Radius
BS 1 [ ] [ ] 1 75 150
BS 2 [ ] [ ] 3 75 150
Table 3. Distances between RSs and SSs
distance Coverage Zone Radius
RS 1 [ ] [ ] 100
RS 2 [ ] [ ] 100
The experiment yields the following solution with an establishment cost of 35,
[ ]
where [ ], [ ], [ ], [ ] and [ ]. The backbone of the
network according to this solution is formed by BS 1 and RS 1, where RS 1 then serves SSs 1, 2, and 3. The
routes between stations for results obtained using the original and updated objective functions are presented
in Tables (4-5).
Table 4. Routes using original objective function
Subscriber Station Route
SS 1 RS 1 — BS 1
SS 2 RS 1 — BS 1
SS 3 RS 1 — BS 1
Table 5. Routes using the updated objective function
Subscriber Station Route
SS 1 RS 2 — BS 1
SS 2 RS 2 — BS 1
SS 3 RS 2 — BS 1
Secondly, real-world performance had to be evaluated using the PDR and E2E delay metrics. A
simulation of a real network was carried out in MATLAB. Every SS would generate data packets to be sent
to the allocated BS. The number of data packets and the interval of generation were determined using Poisson
random variables. The number of data packets had a mean value of 6 whereas the interval of generation had a
mean of 6 sec. We have assumed that each BS has a mechanism for detecting errors in received data packets.
If errors exist, the BS will send a message to the source station so that it may re-send the affected data
packets while the elapsed time is less than the packet life time (0.5 sec). The channels between SS — RS,
SS — BS, and RS — BS are based on the Gillbert-Elliot model. The quality of a channel is indirectly
proportional to the distance between any two stations. Two experiments were carried out to compare the
performance of the network with regard to PDR and E2E delay. The duration of each experiment was 1500
6. IJECE ISSN: 2088-8708
Improvement at Network Planning using Heuristic Algorithm to Minimize Cost of Distance … (Shivan Q.A.)
314
sec of which 25 sec was used for data logging. 60 samples for PDR and E2E delay values were logged and
the results are discussed in the following section.
5. EVALUATION AND DISCUSSION
Figures (4-5) clearly show that taking distance into consideration has a positive impact on the
performance of the network. The PDR values are better since RS 1 is used instead of RS 2; the distance
between SS 2 and a routing station is less and thus signal quality with regard to SS 2 is improved. This also
has a positive effect on the E2E delay; improved signal quality decreases the probability of errors in received
signals which in turn decreases the number of acknowledgments and re-sending of data packets, thus
reducing E2E delay time.
Figure 4. PDR comparison between original and
modified objective function
Figure 5. E2E Delay comparison between
original and modified objective function
Finally, the finding of this study is based on the result as shown in Figures (4-5), this study has a
positive effect on performance of the network through the quality of signal of routing station is less. Other
hand, reducing the time delay through decreases the number of acknowledgments and re-sending of data
packets.
6. CONCLUSION
Cost optimization is an area of research with regard to WMNs. This research was based upon
improving the solution proposed by [15] in this regard. They have considered cost optimization without
taking distance between nodes into consideration. This research considered the problem using a Modified
Binary Particle Swarm Optimization (MBPSO) approach by updating the optimization function to take into
consideration the distances between the different nodes. The results were positive and this approach showed
noticeable improvement compared to the benchmark. The PDR showed an approximate increase of 17.83%
whereas the E2E delay saw an approximate decrease of 8.33%.
ACKNOWLEDGEMENT
This work is supported by Ministry of Education of Malaysia, Grant no: FRGS/ 1/ 2015/ ICT04/
UKM/ 02/ 3
REFERENCES
[1] J. Coimbra, G. Schütz, and N. Correia. A game-based algorithm for fair bandwidth allocation in Fibre-Wireless
access networks, Optical Switching and Networking, vol. 10, pp. 149-162, 2013.
[2] J. Coimbra, G. Schütz, and N. Correia. Energy efficient routing algorithm for fiber-wireless access networks: A
network formation game approach, Computer Networks, vol. 60, pp. 201-216, 2014.
[3] F.L. Khaleel. Recruitment and Job Search Application, Universiti Utara Malaysia, 2011.
7. ISSN: 2088-8708
IJECE Vol. 7, No. 1, February 2017 : 309 – 315
315
[4] F.L. Khaleel, N.S. Ashaari, T.S. Meriam, T. Wook, and A. Ismail. The study of gamification application
architecture for programming language course, in Proceedings of the 9th International Conference on Ubiquitous
Information Management and Communication, 2015a, p. 17.
[5] F.L. Khaleel, N.S. Ashaari, T.S. Meriam, T. Wook, and A. Ismail. User-Enjoyable Learning Environment Based on
Gamification Elements, in International Conference on Computer, Communication, and Control Technology (I4CT
2015), Kuching, Sarawak, Malaysia, 2015b, p. 221.
[6] F.L. Khaleel, N.S. Ashaari, T.S. Meriam, T. Wook, and A. Ismail. The Architecture of Dynamic Gamification
Elements Based Learning Content, Journal of Convergence Information Technology, vol. 11, pp. 164-177, 2016a.
[7] F.L. Khaleel, T.S.M.T. Wook, N.S. Ashaari, and A. Ismail. Gamification Elements for Learning Applications,
International Journal on Advanced Science, Engineering and Information Technology, in press, 2016b.
[8] G. Ma, R. Gong, Q. Li, and G. Yao. A Improved Particle Swarm Optimization Algorithm with Dynamic
Acceleration Coefficients, Bulletin of Electrical Engineering and Informatics, vol. 5, 2016.
[9] S.M. Ali, P.S. Babu, and B. Gurusekhar. Reconfiguration with Simultaneous DG installation to Improve the
Voltage Profile in Distribution Network using Harmony Search Algorithm, Bulletin of Electrical Engineering and
Informatics, vol. 4, pp. 257-273, 2015.
[10] S. Middha and P. Singh. Channel Assignment with Greedy Algorithm for Wireless Mesh Network, Bulletin of
Electrical Engineering and Informatics, vol. 5, 2016.
[11] X. Zhang and L. Huang. A Density Control Based Adaptive Hexahedral Mesh Generation Algorithm, Indonesian
Journal of Electrical Engineering and Informatics (IJEEI), vol. 4, 2016.
[12] M. Anusha, S. Vemuru, and T. Gunasekhar. Transmission protocols in Cognitive Radio Mesh Networks,
International Journal of Electrical and Computer Engineering, vol. 5, 2015.
[13] Y. Bejerano, K.T. Lee, S.J. Han, and A. Kumar. Single-path routing for life time maximization in multi-hop
wireless networks, Wireless Networks, vol. 17, pp. 263-275, 2011.
[14] I.F. Akyildiz and X. Wang. A survey on wireless mesh networks, IEEE Communications magazine, vol. 43, pp.
S23-S30, 2005.
[15] S.M. Khaled. Heuristic algorithms for wireless mesh network planning, Lethbridge, Alta.: University of Lethbridge,
Dept. of Mathematics and Computer Science, c2012, 2012.
[16] R. Matam and S. Tripathy. Improved heuristics for multicast routing in wireless mesh networks, Wireless networks,
vol. 19, pp. 1829-1837, 2013.
[17] S. Ling, C. Jie, and Y. Xue-jun. Multi-path anycast routing based on ant colony optimization in multi-gateway
WMN, in Computer Science and Education (ICCSE), 2010 5th International Conference on, 2010, pp. 1694-1698.
[18] T. Oda, Y. Liu, S. Sakamoto, D. Elmazi, L. Barolli, and F. Xhafa. Analysis of mesh router placement in wireless
mesh networks using Friedman test considering different meta-heuristics, International Journal of Communication
Networks and Distributed Systems, vol. 15, pp. 84-106, 2015.
[19] W.L. Yang, C.C. Kao, and C.H. Tung. Heuristic Algorithms for Constructing Interference-Free and Delay-
Constrained Multicast Trees for Wireless Mesh Networks, TIIS, vol. 5, pp. 269-286, 2011.
[20] A. Barolli, T. Oda, F. Xhafa, L. Barolli, P. Papajorgji, and M. Takizawa. WMN-GA System for Node Placement in
WMNs: Performance Evaluation for Weibull Distribution of Mesh Clients, in Information Technology
Convergence, ed: Springer, 2013, pp. 223-231.
[21] D. Benyamina, A. Hafid, N. Hallam, M. Gendreau, and J. Maureira. A hybrid nature-inspired optimizer for wireless
mesh networks design, Computer Communications, vol. 35, pp. 1231-1246, 2012.
[22] F. Xhafa, A. Barolli, and M. Takizawa. A tabu search algorithm for efficient node placement in wireless mesh
networks, in Intelligent Networking and Collaborative Systems (INCoS), 2011 Third International Conference on,
2011, pp. 53-59.
[23] J. Yang, H. Zhang, Y. Ling, C. Pan, and W. Sun. Task allocation for wireless sensor network using modified binary
particle swarm optimization, IEEE Sensors Journal, vol. 14, pp. 882-892, 2014.