journal publishing, how to publish research paper, Call For research paper, international journal, publishing a paper, IJERD, journal of science and technology, how to get a research paper published, publishing a paper, publishing of journal, publishing of research paper, reserach and review articles, IJERD Journal, How to publish your research paper, publish research paper, open access engineering journal, Engineering journal, Mathemetics journal, Physics journal, Chemistry journal, Computer Engineering, Computer Science journal, how to submit your paper, peer reviw journal, indexed journal, reserach and review articles, engineering journal, www.ijerd.com, research journals,
yahoo journals, bing journals, International Journal of Engineering Research and Development, google journals, hard copy of journal
QoS controlled capacity offload optimization in heterogeneous networksjournalBEEI
An efficient resource allocation mechanism in the physical layer of wireless networks ensures that resources such as bandwidth and power are used with high efficiency in spite of low delay and high edge user data rate. Microcells in the network are typically set with bias settings to artificially increase the Signal-to-Interference-Plus-Noise Ratio, thus encouraging users to offload to the microcell. However, the artificial bias settings are tedious and often suboptimal. This work presents a low complexity algorithm for maximization of network capacity with load balancing in a heterogeneous network without the need for bias setting. The small cells were deployed in a grid topology at a selected distance from macrocell to enhance network capacity through coverage overlap. User association and minimum user throughput were incorporated as constraints to enable closer simulation to real word Quality of Service requirements. The results showed that the proposed algorithm was able to maintain less than 10% user drop rate. The proposed algorithm can increase user confidence as well as maintain load balancing, maintain the scalability, and reduce power consumption of the wireless network.
PERFORMANCE COMPARISON OF QOS METRICS FOR A DISTRIBUTED PRICING SCHEMEijasuc
De-centralized nature of nodes, in ad-hoc networks, results in the users adapting their operations
independently. Such operations are mostly biased upon the figures and data available for the parameters
which are imperative for superior performance or, in other words, improved Quality of Performance (QoS)
of the nodes. In centrally controlled networks following cooperative game theory principles, collective
operations are performed by the nodes for better QoS of the network. Although nodes in decentralized
networks undertake individual operations, the final outcome of the whole network and thus the performance
of the nodes in the network are influenced by the operations of other nodes. Hence, a distributed resource
allocation approach in such a scenario can be modeled as a non-cooperative game. Asynchronous
Distributed Pricing (ADP) is one such virtual pricing algorithm in which a user’s payoff is determined by
the difference between how much a given performance metric is valued and how much is paid for it. User
service demands and priorities are modeled using numerically emulated QoS metrics termed as utility
functions. The network objective is to maximize the sum of all users’ payoff. However, for convergence of
the sum of all users’ payoff to a global maximum, the determination of the QoS metric’s utility function
with sufficient concavity is essential. Although supermodularity conditions have been previously defined
and determined to obtain suitable utility functions, we have numerically and analytically illustrated that the
convergence performance characteristics fluctuates with the choice of QoS metrics in the algorithm for
similar utility functions as well. We have assessed the optimality of utility functions under Signal-toInterference-plus-Noise ratio and Signal-to-Interference ratio based calculations. This paper also explores
into the difference in performance characteristics obtained by the addition of a significant value noise
variance in the ADP algorithm.
OPTIMUM NEIGHBORS FOR RESOURCECONSTRAINED MOBILE AD HOC NETWORKSijasuc
This paper presents an investigation on the optimum number of neighbors for mobile ad hoc networks
(MANETs). The MANETs are self-configuring and self-organizing networks. In such a network, energyconstrained mobile nodes share limited bandwidth to send their packets to the destinations. The mobile nodes
have a limited transmission range and they rely on their neighbors to deliver their packets. Hence, the mobile
nodes must be associated with the required (i.e., optimum) number of neighbors. As the number of neighbors
is varied, a trade-off exists between the network connectivity and available bandwidth per mobile node. To
investigate this issue, we consider Dynamic Source Routing (DSR) as the routing protocol and IEEE 802.11
as the MAC layer protocol in this work. We consider both static and dynamic scenarios in this work. We
simulated the ad hoc networks via network simulator (NS-2) and the simulation results show that there exists
an optimum number of neighbors for the static case. We also show that mobility has a grave impact on the
performance of the MANETs in terms of network throughput, end-to-end delay, energy consumption, and
packet loss. Hence, we need to increase the number of neighbors under mobility conditions. However, there
is no global optimum number of neighbors for the mobility case.
Clustering effects on wireless mobile ad hoc networks performancesijcsit
A new era is dawning for wireless mobile ad hoc networks where communication will be done using a
group of mobile devices called cluster, hence clustered network. In a clustered network, protocols used by
these mobile devices are different from those used in a wired network; which helps to save computation
time and resources efficiently. This paper focuses on Cluster-Based Routing Protocol and Dynamic Source
Routing. The results presented in this paper illustrates the implementation of Ad-hoc On-Demand Distance
Vector routing protocol for enhancing mobile nodes performance and lifetime in a clustered network and to
demonstrate how this routing protocol results in time efficient and resource saving in wireless mobile ad
hoc networks.
Routing Optimization with Load Balancing: an Energy Efficient ApproachEswar Publications
The area of Wireless Sensor Network (WSN) is covered with considerable range of problems, where majority of research attempts were carried out to enhance the network lifetime of WSN. But very few of the studies have proved successful. This manuscript discusses about a structure for optimizing routing and load balancing that uses standard radio and energy model to perform energy optimization by introducing a novel routing agent. The routing agent is built within aggregator node and base station to perform self motivated reconfiguration in case of energy depletion. Compared with standard LEACH algorithm, the proposed technique has better energy efficiency within optimal data aggregation duration.
QoS controlled capacity offload optimization in heterogeneous networksjournalBEEI
An efficient resource allocation mechanism in the physical layer of wireless networks ensures that resources such as bandwidth and power are used with high efficiency in spite of low delay and high edge user data rate. Microcells in the network are typically set with bias settings to artificially increase the Signal-to-Interference-Plus-Noise Ratio, thus encouraging users to offload to the microcell. However, the artificial bias settings are tedious and often suboptimal. This work presents a low complexity algorithm for maximization of network capacity with load balancing in a heterogeneous network without the need for bias setting. The small cells were deployed in a grid topology at a selected distance from macrocell to enhance network capacity through coverage overlap. User association and minimum user throughput were incorporated as constraints to enable closer simulation to real word Quality of Service requirements. The results showed that the proposed algorithm was able to maintain less than 10% user drop rate. The proposed algorithm can increase user confidence as well as maintain load balancing, maintain the scalability, and reduce power consumption of the wireless network.
PERFORMANCE COMPARISON OF QOS METRICS FOR A DISTRIBUTED PRICING SCHEMEijasuc
De-centralized nature of nodes, in ad-hoc networks, results in the users adapting their operations
independently. Such operations are mostly biased upon the figures and data available for the parameters
which are imperative for superior performance or, in other words, improved Quality of Performance (QoS)
of the nodes. In centrally controlled networks following cooperative game theory principles, collective
operations are performed by the nodes for better QoS of the network. Although nodes in decentralized
networks undertake individual operations, the final outcome of the whole network and thus the performance
of the nodes in the network are influenced by the operations of other nodes. Hence, a distributed resource
allocation approach in such a scenario can be modeled as a non-cooperative game. Asynchronous
Distributed Pricing (ADP) is one such virtual pricing algorithm in which a user’s payoff is determined by
the difference between how much a given performance metric is valued and how much is paid for it. User
service demands and priorities are modeled using numerically emulated QoS metrics termed as utility
functions. The network objective is to maximize the sum of all users’ payoff. However, for convergence of
the sum of all users’ payoff to a global maximum, the determination of the QoS metric’s utility function
with sufficient concavity is essential. Although supermodularity conditions have been previously defined
and determined to obtain suitable utility functions, we have numerically and analytically illustrated that the
convergence performance characteristics fluctuates with the choice of QoS metrics in the algorithm for
similar utility functions as well. We have assessed the optimality of utility functions under Signal-toInterference-plus-Noise ratio and Signal-to-Interference ratio based calculations. This paper also explores
into the difference in performance characteristics obtained by the addition of a significant value noise
variance in the ADP algorithm.
OPTIMUM NEIGHBORS FOR RESOURCECONSTRAINED MOBILE AD HOC NETWORKSijasuc
This paper presents an investigation on the optimum number of neighbors for mobile ad hoc networks
(MANETs). The MANETs are self-configuring and self-organizing networks. In such a network, energyconstrained mobile nodes share limited bandwidth to send their packets to the destinations. The mobile nodes
have a limited transmission range and they rely on their neighbors to deliver their packets. Hence, the mobile
nodes must be associated with the required (i.e., optimum) number of neighbors. As the number of neighbors
is varied, a trade-off exists between the network connectivity and available bandwidth per mobile node. To
investigate this issue, we consider Dynamic Source Routing (DSR) as the routing protocol and IEEE 802.11
as the MAC layer protocol in this work. We consider both static and dynamic scenarios in this work. We
simulated the ad hoc networks via network simulator (NS-2) and the simulation results show that there exists
an optimum number of neighbors for the static case. We also show that mobility has a grave impact on the
performance of the MANETs in terms of network throughput, end-to-end delay, energy consumption, and
packet loss. Hence, we need to increase the number of neighbors under mobility conditions. However, there
is no global optimum number of neighbors for the mobility case.
Clustering effects on wireless mobile ad hoc networks performancesijcsit
A new era is dawning for wireless mobile ad hoc networks where communication will be done using a
group of mobile devices called cluster, hence clustered network. In a clustered network, protocols used by
these mobile devices are different from those used in a wired network; which helps to save computation
time and resources efficiently. This paper focuses on Cluster-Based Routing Protocol and Dynamic Source
Routing. The results presented in this paper illustrates the implementation of Ad-hoc On-Demand Distance
Vector routing protocol for enhancing mobile nodes performance and lifetime in a clustered network and to
demonstrate how this routing protocol results in time efficient and resource saving in wireless mobile ad
hoc networks.
Routing Optimization with Load Balancing: an Energy Efficient ApproachEswar Publications
The area of Wireless Sensor Network (WSN) is covered with considerable range of problems, where majority of research attempts were carried out to enhance the network lifetime of WSN. But very few of the studies have proved successful. This manuscript discusses about a structure for optimizing routing and load balancing that uses standard radio and energy model to perform energy optimization by introducing a novel routing agent. The routing agent is built within aggregator node and base station to perform self motivated reconfiguration in case of energy depletion. Compared with standard LEACH algorithm, the proposed technique has better energy efficiency within optimal data aggregation duration.
A FASTER ROUTING SCHEME FOR STATIONARY WIRELESS SENSOR NETWORKS - A HYBRID AP...ijasuc
A wireless sensor network consists of light-weight, low power, small size sensor nodes. Routing in wireless
sensor networks is a demanding task. This demand has led to a number of routing protocols which
efficiently utilize the limited resources available at the sensor nodes. Most of these protocols are either
based on single hop routing or multi hop routing and typically find the minimum energy path without
addressing other issues such as time delay in delivering a packet, load balancing, and redundancy of data.
Response time is very critical in environment monitoring sensor networks where typically the sensors are
stationary and transmit data to a base station or a sink node. In this paper a faster load balancing routing
protocol based on location with a hybrid approach is proposed.
Mobile Ad HOC networks (MANET’S) are networks in which all nodes are mobile and
communicate with each other via wireless connections. Nodes can join or leave the network at any
time. There is no fixed infrastructure. Research and industries are recently more interesting and
attracting to the VANET and MANET development domain. A vehicular ad hoc network (VANET)
is a subclass of MANET. In this paper, we propose Bee Routing Protocol for Ad Hoc Network, in
which a new quality of service multipath routing protocol adapted for the VANET. This algorithm is
a reactive source routing algorithm and consumes less energy as compared to DSDV, AODV, DSR
routing algorithms because a fewer control packets for routing are sent as compared to other
networks.
Link Stability and Energy Aware routing Protocol for Mobile Adhoc NetworkIOSR Journals
Abstract: MOBILE ad hoc networks (MANETs) have more popularity among mobile network devices and
wireless communication technologies. A MANET is multihop mobile wireless network that have neither a fixed
infrastructure nor a central server. Every node in a MANET will act as a router, and also communicates with
each other. The mobility constraints in mobile nodes will lead to problems in link stability. Energy saving, path
duration and stability will be two major efforts and to satisfy them can be difficult task. A self node which is
present in the network may also consume little energy during the transmission. This proposed approach tries to
account for link stability and for minimum drain rate energy consumption. In order to verify the correctness of
the proposed solution a objective optimization formulation has been designed and a novel routing protocol
called Link-Stability and Energy aware Routing protocols is proposed. This novel routing scheme has been
compared with other two protocols: PERRA and GPSR. The protocol performance has been evaluated in terms
of Data Packet Delivery Ratio, Normalized Control Overhead, Link duration, Nodes lifetime, and Average
energy consumption.
Keywords-component; Energy Consumption, Link Stability, Routing, Self node
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.
Markovian Queueing Model for Throughput Maximization in D2D-Enabled Cellular ...IJECEIAES
Device-to-Device (D2D) communication has been considered a key enabling technol- ogy that can facilitate spectrum sharing in 4G and 5G cellular networks. In order to meet the high data rate demands of these new generation cellular networks, this paper considers the optimization of available spectrum resource through dynamic spectrum access. The utilization of continuous-time Markov chain (CTMC) model for efficient spectrum access in D2D-enabled cellular networks is investigated for the purpose of determining the impact of this model on the capacity improvement of cellular networks. The paper considers the use of CTMC model with both queueing and non-queueing cases called 13-Q CTMC and 6-NQ CTMC respectively with the aim of improving the overall capacity of the cellular network under a fairness constraint among all users. The proposed strategy consequently ensures that spectrum access for cellular and D2D users is optimally coordinated by designing optimal spectrum access probabilities. Numerical simulations are performed to observe the impact of the proposed Markovian queueing model on spectrum access and consequently on the capacity of D2D-enabled cellular networks. Results showed that the proposed 13-Q CTMC provide a more spectrumefficient sharing scheme, thereby enabling better network performances and larger capabilities to accommodate more users.
CUTTING DOWN ENERGY USAGE IN WIRELESS SENSOR NETWORKS USING DUTY CYCLE TECHNI...ijwmn
A wireless sensor network is composed of many sensor nodes, that have beengiven out in a
specific zoneandeach of them hadanability of collecting information from the environment and
sending collected data to the sink. The most significant issues in wireless sensor networks,
despite the recent progress is the trouble of the severe limitations of energy resources.Since that
in different applications of sensor nets, we could throw a static or mobile sink, then all aspects of
such networks should be planned with an awareness of energy.One of the most significant topics
related to these networks, is routing. One of the most widely used and efficient methods of
routing isa hierarchy (based on clustering) method.
In The present study with the objective of cutting down energy consumption and persistence of
network coverage, we have offered a novel algorithm based on clustering algorithms and multihop routing.To achieve this goal, first, we layer the network environment based on the size of the
network.We will identify the optimal number of cluster heads and every cluster head based on
the mechanism of topology control will start to accept members.Likewise, we set the first layer
as gate layer and subsequently identifying the gate’s nodes, we’d turn away half of the sensors
and then stop using energy and the remaining nodes in this layer will join the gate’s nodes
because they hold a critical part in bettering the functioning of the system. Cluster heads off
following layers send the information to cluster heads in the above layer until sent data will be
sent to gate’s nodes and finally will be sent to sink. We have tested the proposed algorithm in
two situations 1) when the sink is off and 2)when a sink is on and simulation data shows that
proposed algorithm has better performance in terms of the life span of a network than LEACH
and ELEACH protocols.
A Novel Grid Based Dynamic Energy Efficient Routing Approach for Highly Dense...ijasuc
A research work without considering the power constraint cannot be conceded a fine contribution towards
Mobile Ad Hoc Networks (MANET). As MANET comes into action for some special purpose, but its
fugacity sometimes result degrades in network performance. Although the many prominent features of
MANET like mobility, dynamic change in topology, multi radio relaying, quickly lay down the network
without depending upon fixed infrastructures and many more provides tremendous flexibilities for the end
user but challenges like limited power constraint, reliable data communication, band width utilization ,
network performance and throughput are still needed to be handle very sensibly. As limited battery power
and inefficient routing protocol mechanism are high prone to network partition, in such case the network
needs to be established more than once. Because communication establishment involves many costly
operations like route discovery and route maintenance. The more the network partition the more the packet
drops and packet loss which indeed requires a number of retransmission of packets, consuming network
bandwidth as well as depleting battery power of individual nodes with a higher rate, which are the major
destructive elements in network performance degradation as well as the major cause of reducing individual
node’s life time and network life time. So with all caveat in mind, we have proposed a novel Grid Based
Dynamic Energy Efficient Routing (GBDEER) approach which is aimed to construct an energy efficient
path from source to destination based on grid area, where each grid will have three deferent levels of
transmission power. Every grid will have its own grid supervisor node who will take the responsibility
during data communication, especially when the data is been passed through that specific grid. And
keeping the dynamic nature of MANET in mind, we have also provide the feature of grid subordinate
node, who will take the place of grid supervisor in case the supervisor is moving out of the grid area or
running out of energy from certain threshold level. So we our proposed method not only establishes an
energy efficient path but also concerned a dedicated path which can be used for data communication for a
long period of time without any network partition. Hence this approach will be less prone to all those
problems mentions above by the incorporating an efficient mobility handling mechanism.
Advanced antenna techniques and high order sectorization with novel network t...ijwmn
Mobile operators commonly use macro cells with trad
itional wide beam antennas for wider coverage in th
e
cell, but future capacity demands cannot be achieve
d by using them only. It is required to achieve max
imum
practical capacity from macro cells by employing hi
gher order sectorization and by utilizing all possi
ble
antenna solutions including smart antennas. This pa
per presents enhanced tessellation for 6-sector sit
es
and proposes novel layout for 12-sector sites. The
main target of this paper is to compare the perform
ance
of conventional wide beam antenna, switched beam sm
art antenna, adaptive beam antenna and different
network layouts in terms of offering better receive
d signal quality and user throughput. Splitting mac
ro cell
into smaller micro or pico cells can improve the ca
pacity of network, but this paper highlights the
importance of higher order sectorization and advanc
e antenna techniques to attain high Signal to
Interference plus Noise Ratio (SINR), along with im
proved network capacity. Monte Carlo simulations a
t
system level were done for Dual Cell High Speed Dow
nlink Packet Access (DC-HSDPA) technology with
multiple (five) users per Transmission Time Interva
l (TTI) at different Intersite Distance (ISD). The
obtained results validate and estimate the gain of
using smart antennas and higher order sectorization
with
proposed network layout.
Welcome to International Journal of Engineering Research and Development (IJERD)IJERD Editor
journal publishing, how to publish research paper, Call For research paper, international journal, publishing a paper, IJERD, journal of science and technology, how to get a research paper published, publishing a paper, publishing of journal, publishing of research paper, reserach and review articles, IJERD Journal, How to publish your research paper, publish research paper, open access engineering journal, Engineering journal, Mathemetics journal, Physics journal, Chemistry journal, Computer Engineering, Computer Science journal, how to submit your paper, peer reviw journal, indexed journal, reserach and review articles, engineering journal, www.ijerd.com, research journals,
yahoo journals, bing journals, International Journal of Engineering Research and Development, google journals, hard copy of journal
Welcome to International Journal of Engineering Research and Development (IJERD)IJERD Editor
journal publishing, how to publish research paper, Call For research paper, international journal, publishing a paper, IJERD, journal of science and technology, how to get a research paper published, publishing a paper, publishing of journal, publishing of research paper, reserach and review articles, IJERD Journal, How to publish your research paper, publish research paper, open access engineering journal, Engineering journal, Mathemetics journal, Physics journal, Chemistry journal, Computer Engineering, Computer Science journal, how to submit your paper, peer reviw journal, indexed journal, reserach and review articles, engineering journal, www.ijerd.com, research journals,
yahoo journals, bing journals, International Journal of Engineering Research and Development, google journals, hard copy of journal
Welcome to International Journal of Engineering Research and Development (IJERD)IJERD Editor
journal publishing, how to publish research paper, Call For research paper, international journal, publishing a paper, IJERD, journal of science and technology, how to get a research paper published, publishing a paper, publishing of journal, publishing of research paper, reserach and review articles, IJERD Journal, How to publish your research paper, publish research paper, open access engineering journal, Engineering journal, Mathemetics journal, Physics journal, Chemistry journal, Computer Engineering, Computer Science journal, how to submit your paper, peer reviw journal, indexed journal, reserach and review articles, engineering journal, www.ijerd.com, research journals,
yahoo journals, bing journals, International Journal of Engineering Research and Development, google journals, hard copy of journal
International Journal of Engineering Research and Development (IJERD)IJERD Editor
journal publishing, how to publish research paper, Call For research paper, international journal, publishing a paper, IJERD, journal of science and technology, how to get a research paper published, publishing a paper, publishing of journal, publishing of research paper, reserach and review articles, IJERD Journal, How to publish your research paper, publish research paper, open access engineering journal, Engineering journal, Mathemetics journal, Physics journal, Chemistry journal, Computer Engineering, Computer Science journal, how to submit your paper, peer reviw journal, indexed journal, reserach and review articles, engineering journal, www.ijerd.com, research journals,
yahoo journals, bing journals, International Journal of Engineering Research and Development, google journals, hard copy of journal
Welcome to International Journal of Engineering Research and Development (IJERD)IJERD Editor
journal publishing, how to publish research paper, Call For research paper, international journal, publishing a paper, IJERD, journal of science and technology, how to get a research paper published, publishing a paper, publishing of journal, publishing of research paper, reserach and review articles, IJERD Journal, How to publish your research paper, publish research paper, open access engineering journal, Engineering journal, Mathemetics journal, Physics journal, Chemistry journal, Computer Engineering, Computer Science journal, how to submit your paper, peer reviw journal, indexed journal, reserach and review articles, engineering journal, www.ijerd.com, research journals,
yahoo journals, bing journals, International Journal of Engineering Research and Development, google journals, hard copy of journal
Welcome to International Journal of Engineering Research and Development (IJERD)IJERD Editor
journal publishing, how to publish research paper, Call For research paper, international journal, publishing a paper, IJERD, journal of science and technology, how to get a research paper published, publishing a paper, publishing of journal, publishing of research paper, reserach and review articles, IJERD Journal, How to publish your research paper, publish research paper, open access engineering journal, Engineering journal, Mathemetics journal, Physics journal, Chemistry journal, Computer Engineering, Computer Science journal, how to submit your paper, peer reviw journal, indexed journal, reserach and review articles, engineering journal, www.ijerd.com, research journals,
yahoo journals, bing journals, International Journal of Engineering Research and Development, google journals, hard copy of journal
International Journal of Engineering Research and Development (IJERD)IJERD Editor
journal publishing, how to publish research paper, Call For research paper, international journal, publishing a paper, IJERD, journal of science and technology, how to get a research paper published, publishing a paper, publishing of journal, publishing of research paper, reserach and review articles, IJERD Journal, How to publish your research paper, publish research paper, open access engineering journal, Engineering journal, Mathemetics journal, Physics journal, Chemistry journal, Computer Engineering, Computer Science journal, how to submit your paper, peer reviw journal, indexed journal, reserach and review articles, engineering journal, www.ijerd.com, research journals,
yahoo journals, bing journals, International Journal of Engineering Research and Development, google journals, hard copy of journal
Dynamic Topology Re-Configuration in Multihop Cellular Networks Using Sequent...IJERA Editor
Cellular communications has experienced explosive growth in the past two decades. Today millions of people around the world use cellular phones. Cellular phones allow a person to make or receive a call from almost anywhere. Likewise, a person is allowed to continue the phone conversation while on the move. Cellular communications is supported by an infrastructure called a cellular network, which integrates cellular phones into the public switched telephone network. The cellular network has gone through three generations.The first generation of cellular networks is analog in nature. To accommodate more cellular phone subscribers, digital TDMA (time division multiple access) and CDMA (code division multiple access) technologies are used in the second generation (2G) to increase the network capacity. With digital technologies, digitized voice can be coded and encrypted. Therefore, the 2G cellular network is also more secure. The third generation (3G) integrates cellular phones into the Internet world by providing highspeed packet-switching data transmission in addition to circuit-switching voice transmission. The 3G cellular networks have been deployed in some parts of Asia, Europe, and the United States since 2002 and will be widely deployed in the coming years. The high increase in traffic and data rate for future generations of mobile communication systems, with simultaneous requirement for reduced power consumption, makes Multihop Cellular Networks (MCNs) an attractive technology. To exploit the potentials of MCNs a new network paradigm is proposed in this paper. In addition, a novel sequential genetic algorithm (SGA) is proposed as a heuristic approximation to reconfigure the optimum relaying topology as the network traffic changes. Network coding is used to combine the uplink and downlink transmissions, and incorporate it into the optimum bidirectional relaying with ICI awareness. Numerical results have shown that the algorithms suggested in this thesis provide significant improvement with respect to the existing results, and are expected to have significant impact in the analysis and design of future cellular networks.
A FASTER ROUTING SCHEME FOR STATIONARY WIRELESS SENSOR NETWORKS - A HYBRID AP...ijasuc
A wireless sensor network consists of light-weight, low power, small size sensor nodes. Routing in wireless
sensor networks is a demanding task. This demand has led to a number of routing protocols which
efficiently utilize the limited resources available at the sensor nodes. Most of these protocols are either
based on single hop routing or multi hop routing and typically find the minimum energy path without
addressing other issues such as time delay in delivering a packet, load balancing, and redundancy of data.
Response time is very critical in environment monitoring sensor networks where typically the sensors are
stationary and transmit data to a base station or a sink node. In this paper a faster load balancing routing
protocol based on location with a hybrid approach is proposed.
Mobile Ad HOC networks (MANET’S) are networks in which all nodes are mobile and
communicate with each other via wireless connections. Nodes can join or leave the network at any
time. There is no fixed infrastructure. Research and industries are recently more interesting and
attracting to the VANET and MANET development domain. A vehicular ad hoc network (VANET)
is a subclass of MANET. In this paper, we propose Bee Routing Protocol for Ad Hoc Network, in
which a new quality of service multipath routing protocol adapted for the VANET. This algorithm is
a reactive source routing algorithm and consumes less energy as compared to DSDV, AODV, DSR
routing algorithms because a fewer control packets for routing are sent as compared to other
networks.
Link Stability and Energy Aware routing Protocol for Mobile Adhoc NetworkIOSR Journals
Abstract: MOBILE ad hoc networks (MANETs) have more popularity among mobile network devices and
wireless communication technologies. A MANET is multihop mobile wireless network that have neither a fixed
infrastructure nor a central server. Every node in a MANET will act as a router, and also communicates with
each other. The mobility constraints in mobile nodes will lead to problems in link stability. Energy saving, path
duration and stability will be two major efforts and to satisfy them can be difficult task. A self node which is
present in the network may also consume little energy during the transmission. This proposed approach tries to
account for link stability and for minimum drain rate energy consumption. In order to verify the correctness of
the proposed solution a objective optimization formulation has been designed and a novel routing protocol
called Link-Stability and Energy aware Routing protocols is proposed. This novel routing scheme has been
compared with other two protocols: PERRA and GPSR. The protocol performance has been evaluated in terms
of Data Packet Delivery Ratio, Normalized Control Overhead, Link duration, Nodes lifetime, and Average
energy consumption.
Keywords-component; Energy Consumption, Link Stability, Routing, Self node
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.
Markovian Queueing Model for Throughput Maximization in D2D-Enabled Cellular ...IJECEIAES
Device-to-Device (D2D) communication has been considered a key enabling technol- ogy that can facilitate spectrum sharing in 4G and 5G cellular networks. In order to meet the high data rate demands of these new generation cellular networks, this paper considers the optimization of available spectrum resource through dynamic spectrum access. The utilization of continuous-time Markov chain (CTMC) model for efficient spectrum access in D2D-enabled cellular networks is investigated for the purpose of determining the impact of this model on the capacity improvement of cellular networks. The paper considers the use of CTMC model with both queueing and non-queueing cases called 13-Q CTMC and 6-NQ CTMC respectively with the aim of improving the overall capacity of the cellular network under a fairness constraint among all users. The proposed strategy consequently ensures that spectrum access for cellular and D2D users is optimally coordinated by designing optimal spectrum access probabilities. Numerical simulations are performed to observe the impact of the proposed Markovian queueing model on spectrum access and consequently on the capacity of D2D-enabled cellular networks. Results showed that the proposed 13-Q CTMC provide a more spectrumefficient sharing scheme, thereby enabling better network performances and larger capabilities to accommodate more users.
CUTTING DOWN ENERGY USAGE IN WIRELESS SENSOR NETWORKS USING DUTY CYCLE TECHNI...ijwmn
A wireless sensor network is composed of many sensor nodes, that have beengiven out in a
specific zoneandeach of them hadanability of collecting information from the environment and
sending collected data to the sink. The most significant issues in wireless sensor networks,
despite the recent progress is the trouble of the severe limitations of energy resources.Since that
in different applications of sensor nets, we could throw a static or mobile sink, then all aspects of
such networks should be planned with an awareness of energy.One of the most significant topics
related to these networks, is routing. One of the most widely used and efficient methods of
routing isa hierarchy (based on clustering) method.
In The present study with the objective of cutting down energy consumption and persistence of
network coverage, we have offered a novel algorithm based on clustering algorithms and multihop routing.To achieve this goal, first, we layer the network environment based on the size of the
network.We will identify the optimal number of cluster heads and every cluster head based on
the mechanism of topology control will start to accept members.Likewise, we set the first layer
as gate layer and subsequently identifying the gate’s nodes, we’d turn away half of the sensors
and then stop using energy and the remaining nodes in this layer will join the gate’s nodes
because they hold a critical part in bettering the functioning of the system. Cluster heads off
following layers send the information to cluster heads in the above layer until sent data will be
sent to gate’s nodes and finally will be sent to sink. We have tested the proposed algorithm in
two situations 1) when the sink is off and 2)when a sink is on and simulation data shows that
proposed algorithm has better performance in terms of the life span of a network than LEACH
and ELEACH protocols.
A Novel Grid Based Dynamic Energy Efficient Routing Approach for Highly Dense...ijasuc
A research work without considering the power constraint cannot be conceded a fine contribution towards
Mobile Ad Hoc Networks (MANET). As MANET comes into action for some special purpose, but its
fugacity sometimes result degrades in network performance. Although the many prominent features of
MANET like mobility, dynamic change in topology, multi radio relaying, quickly lay down the network
without depending upon fixed infrastructures and many more provides tremendous flexibilities for the end
user but challenges like limited power constraint, reliable data communication, band width utilization ,
network performance and throughput are still needed to be handle very sensibly. As limited battery power
and inefficient routing protocol mechanism are high prone to network partition, in such case the network
needs to be established more than once. Because communication establishment involves many costly
operations like route discovery and route maintenance. The more the network partition the more the packet
drops and packet loss which indeed requires a number of retransmission of packets, consuming network
bandwidth as well as depleting battery power of individual nodes with a higher rate, which are the major
destructive elements in network performance degradation as well as the major cause of reducing individual
node’s life time and network life time. So with all caveat in mind, we have proposed a novel Grid Based
Dynamic Energy Efficient Routing (GBDEER) approach which is aimed to construct an energy efficient
path from source to destination based on grid area, where each grid will have three deferent levels of
transmission power. Every grid will have its own grid supervisor node who will take the responsibility
during data communication, especially when the data is been passed through that specific grid. And
keeping the dynamic nature of MANET in mind, we have also provide the feature of grid subordinate
node, who will take the place of grid supervisor in case the supervisor is moving out of the grid area or
running out of energy from certain threshold level. So we our proposed method not only establishes an
energy efficient path but also concerned a dedicated path which can be used for data communication for a
long period of time without any network partition. Hence this approach will be less prone to all those
problems mentions above by the incorporating an efficient mobility handling mechanism.
Advanced antenna techniques and high order sectorization with novel network t...ijwmn
Mobile operators commonly use macro cells with trad
itional wide beam antennas for wider coverage in th
e
cell, but future capacity demands cannot be achieve
d by using them only. It is required to achieve max
imum
practical capacity from macro cells by employing hi
gher order sectorization and by utilizing all possi
ble
antenna solutions including smart antennas. This pa
per presents enhanced tessellation for 6-sector sit
es
and proposes novel layout for 12-sector sites. The
main target of this paper is to compare the perform
ance
of conventional wide beam antenna, switched beam sm
art antenna, adaptive beam antenna and different
network layouts in terms of offering better receive
d signal quality and user throughput. Splitting mac
ro cell
into smaller micro or pico cells can improve the ca
pacity of network, but this paper highlights the
importance of higher order sectorization and advanc
e antenna techniques to attain high Signal to
Interference plus Noise Ratio (SINR), along with im
proved network capacity. Monte Carlo simulations a
t
system level were done for Dual Cell High Speed Dow
nlink Packet Access (DC-HSDPA) technology with
multiple (five) users per Transmission Time Interva
l (TTI) at different Intersite Distance (ISD). The
obtained results validate and estimate the gain of
using smart antennas and higher order sectorization
with
proposed network layout.
Welcome to International Journal of Engineering Research and Development (IJERD)IJERD Editor
journal publishing, how to publish research paper, Call For research paper, international journal, publishing a paper, IJERD, journal of science and technology, how to get a research paper published, publishing a paper, publishing of journal, publishing of research paper, reserach and review articles, IJERD Journal, How to publish your research paper, publish research paper, open access engineering journal, Engineering journal, Mathemetics journal, Physics journal, Chemistry journal, Computer Engineering, Computer Science journal, how to submit your paper, peer reviw journal, indexed journal, reserach and review articles, engineering journal, www.ijerd.com, research journals,
yahoo journals, bing journals, International Journal of Engineering Research and Development, google journals, hard copy of journal
Welcome to International Journal of Engineering Research and Development (IJERD)IJERD Editor
journal publishing, how to publish research paper, Call For research paper, international journal, publishing a paper, IJERD, journal of science and technology, how to get a research paper published, publishing a paper, publishing of journal, publishing of research paper, reserach and review articles, IJERD Journal, How to publish your research paper, publish research paper, open access engineering journal, Engineering journal, Mathemetics journal, Physics journal, Chemistry journal, Computer Engineering, Computer Science journal, how to submit your paper, peer reviw journal, indexed journal, reserach and review articles, engineering journal, www.ijerd.com, research journals,
yahoo journals, bing journals, International Journal of Engineering Research and Development, google journals, hard copy of journal
Welcome to International Journal of Engineering Research and Development (IJERD)IJERD Editor
journal publishing, how to publish research paper, Call For research paper, international journal, publishing a paper, IJERD, journal of science and technology, how to get a research paper published, publishing a paper, publishing of journal, publishing of research paper, reserach and review articles, IJERD Journal, How to publish your research paper, publish research paper, open access engineering journal, Engineering journal, Mathemetics journal, Physics journal, Chemistry journal, Computer Engineering, Computer Science journal, how to submit your paper, peer reviw journal, indexed journal, reserach and review articles, engineering journal, www.ijerd.com, research journals,
yahoo journals, bing journals, International Journal of Engineering Research and Development, google journals, hard copy of journal
International Journal of Engineering Research and Development (IJERD)IJERD Editor
journal publishing, how to publish research paper, Call For research paper, international journal, publishing a paper, IJERD, journal of science and technology, how to get a research paper published, publishing a paper, publishing of journal, publishing of research paper, reserach and review articles, IJERD Journal, How to publish your research paper, publish research paper, open access engineering journal, Engineering journal, Mathemetics journal, Physics journal, Chemistry journal, Computer Engineering, Computer Science journal, how to submit your paper, peer reviw journal, indexed journal, reserach and review articles, engineering journal, www.ijerd.com, research journals,
yahoo journals, bing journals, International Journal of Engineering Research and Development, google journals, hard copy of journal
Welcome to International Journal of Engineering Research and Development (IJERD)IJERD Editor
journal publishing, how to publish research paper, Call For research paper, international journal, publishing a paper, IJERD, journal of science and technology, how to get a research paper published, publishing a paper, publishing of journal, publishing of research paper, reserach and review articles, IJERD Journal, How to publish your research paper, publish research paper, open access engineering journal, Engineering journal, Mathemetics journal, Physics journal, Chemistry journal, Computer Engineering, Computer Science journal, how to submit your paper, peer reviw journal, indexed journal, reserach and review articles, engineering journal, www.ijerd.com, research journals,
yahoo journals, bing journals, International Journal of Engineering Research and Development, google journals, hard copy of journal
Welcome to International Journal of Engineering Research and Development (IJERD)IJERD Editor
journal publishing, how to publish research paper, Call For research paper, international journal, publishing a paper, IJERD, journal of science and technology, how to get a research paper published, publishing a paper, publishing of journal, publishing of research paper, reserach and review articles, IJERD Journal, How to publish your research paper, publish research paper, open access engineering journal, Engineering journal, Mathemetics journal, Physics journal, Chemistry journal, Computer Engineering, Computer Science journal, how to submit your paper, peer reviw journal, indexed journal, reserach and review articles, engineering journal, www.ijerd.com, research journals,
yahoo journals, bing journals, International Journal of Engineering Research and Development, google journals, hard copy of journal
International Journal of Engineering Research and Development (IJERD)IJERD Editor
journal publishing, how to publish research paper, Call For research paper, international journal, publishing a paper, IJERD, journal of science and technology, how to get a research paper published, publishing a paper, publishing of journal, publishing of research paper, reserach and review articles, IJERD Journal, How to publish your research paper, publish research paper, open access engineering journal, Engineering journal, Mathemetics journal, Physics journal, Chemistry journal, Computer Engineering, Computer Science journal, how to submit your paper, peer reviw journal, indexed journal, reserach and review articles, engineering journal, www.ijerd.com, research journals,
yahoo journals, bing journals, International Journal of Engineering Research and Development, google journals, hard copy of journal
Dynamic Topology Re-Configuration in Multihop Cellular Networks Using Sequent...IJERA Editor
Cellular communications has experienced explosive growth in the past two decades. Today millions of people around the world use cellular phones. Cellular phones allow a person to make or receive a call from almost anywhere. Likewise, a person is allowed to continue the phone conversation while on the move. Cellular communications is supported by an infrastructure called a cellular network, which integrates cellular phones into the public switched telephone network. The cellular network has gone through three generations.The first generation of cellular networks is analog in nature. To accommodate more cellular phone subscribers, digital TDMA (time division multiple access) and CDMA (code division multiple access) technologies are used in the second generation (2G) to increase the network capacity. With digital technologies, digitized voice can be coded and encrypted. Therefore, the 2G cellular network is also more secure. The third generation (3G) integrates cellular phones into the Internet world by providing highspeed packet-switching data transmission in addition to circuit-switching voice transmission. The 3G cellular networks have been deployed in some parts of Asia, Europe, and the United States since 2002 and will be widely deployed in the coming years. The high increase in traffic and data rate for future generations of mobile communication systems, with simultaneous requirement for reduced power consumption, makes Multihop Cellular Networks (MCNs) an attractive technology. To exploit the potentials of MCNs a new network paradigm is proposed in this paper. In addition, a novel sequential genetic algorithm (SGA) is proposed as a heuristic approximation to reconfigure the optimum relaying topology as the network traffic changes. Network coding is used to combine the uplink and downlink transmissions, and incorporate it into the optimum bidirectional relaying with ICI awareness. Numerical results have shown that the algorithms suggested in this thesis provide significant improvement with respect to the existing results, and are expected to have significant impact in the analysis and design of future cellular networks.
Comprehensive Review on Base Energy Efficient Routing ProtocolIJRES Journal
With the faster growing in electronics industry, small inexpensive battery powered wireless sensors have made an impact on the communications with the physical world. The Wireless Sensor Networks (WSN) consists of hundreds of sensor nodes which are resource constrained. WSN nodes monitor various physical and environmental conditions very cooperatively. WSN uses various nodes for the communication. WSN has become one of the interested areas in the field of research from last few years. To enhance the lifetime of the whole networks energy reduction is the necessary consideration for design and analyse of the clustering and routing protocols. This paper describes the study of various energy efficient routing protocols in WSNs which are important for their designing purpose so as to meet the various resource constraints.
Mtadf multi hop traffic aware data for warding for congestion control in wir...ijwmn
In the past few years there is a remarkable change in the field of wireless sensor networks. Congestion occurs when there is a heavy traffic in the network. The heavy traffic in the network leads to wastage of energy and packet loss. Traffic Aware Dynamic Routing algorithm mitigates congestion by using one hop neighbor routing, hence throughput of the network is low. This paper proposed a Multi hop based Data Forwarding Technique to mitigate congestion. Queue length field and depth potential field play a major role to divert the traffic in the network to the alternate paths. The high traffic load leads to data queue overflow in the sensor nodes, these results in loss of important information about important events. Multi hop Traffic-Aware Dynamic Routing algorithm addresses congestion using depth potential field and queue length potential field. The algorithm forwards data packets around the congestion areas and scatters the excessive along multiple paths. The nodes with less load are efficiently utilized in response to congestion. The main aspect of the algorithm is to construct two independent potential fields using depth and queue length. Queue length field solves the traffic-aware problem. Depth field creates a backbone to forward packets to the sink. Both fields are combined to yield a hybrid potential field to make dynamic decision for data forwarding. Simulations are conducted to evaluate the performance of our proposed algorithm and our proposed scheme performs better compared to previous work.
Analysis of Neighbor Knowledge Based Bcast Protocol Performance For Multihop ...pijans
Reliable group communication is a challenging issue for most Mobile Ad-hoc Networks (MANETs) due to
dynamic nature of wireless mobile nodes, group key establishment and management, ensuring secure
information exchange and Quality of Service (QoS) in data transfer. Recently multicast and broadcast
routing protocols are emerging for supporting QoS aware group communication. In MANETs QoS
requirements can be quantified by a set of measurable pre-specified service attributes such as packet
delivery ratio, end-to-end delay, packet loss probability, network control overhead, throughput,
bandwidth, power consumption, service coverage area etc. In this paper, the performance of a neighbor
knowledge based broadcast protocol is analyzed using different QoS metrics (packet delivery ratio, end-toend delay, packet loss probability and network control overhead). BCAST is used as broadcast protocol.
The performance differentials are analyzed using NS-2 network simulator for varying number of data
senders (multicast group size) and data sending rate (offered traffic to the network) over QoS aware group
communication. Simulation results show that BCAST performs well in most cases and provides robust
performance even with high traffic environments.
Analysis of Neighbor Knowledge Based Bcast Protocol Performance For Multihop ...pijans
Reliable group communication is a challenging issue for most Mobile Ad-hoc Networks (MANETs) due to
dynamic nature of wireless mobile nodes, group key establishment and management, ensuring secure
information exchange and Quality of Service (QoS) in data transfer. Recently multicast and broadcast
routing protocols are emerging for supporting QoS aware group communication. In MANETs QoS
requirements can be quantified by a set of measurable pre-specified service attributes such as packet
delivery ratio, end-to-end delay, packet loss probability, network control overhead, throughput,
bandwidth, power consumption, service coverage area etc. In this paper, the performance of a neighbor
knowledge based broadcast protocol is analyzed using different QoS metrics (packet delivery ratio, end-toend delay, packet loss probability and network control overhead). BCAST is used as broadcast protocol.
The performance differentials are analyzed using NS-2 network simulator for varying number of data
senders (multicast group size) and data sending rate (offered traffic to the network) over QoS aware group
communication. Simulation results show that BCAST performs well in most cases and provides robust
performance even with high traffic environments.
Reduction of Topology Control Using Cooperative Communications in ManetsIJMER
International Journal of Modern Engineering Research (IJMER) is Peer reviewed, online Journal. It serves as an international archival forum of scholarly research related to engineering and science education.
Mobile ad hoc network is a reconfigurable network of mobile nodes connected by multi-hop wireless links and capable of operating without any fixed infrastructure support. In order to facilitate communication within such self-creating, self-organizing and self administrating network, a dynamic routing protocol is needed. The primary goal of such an ad hoc network routing protocol is to discover and establish a correct and efficient route between a pair of nodes so that messages may be delivered in a timely manner. Route construction should be done with a minimum of overhead and bandwidth consumption. This paper examines two routing protocols, both on-demand source routing, for mobile ad hoc networks– the Dynamic Source Routing (DSR), an flat architecture based and the Cluster Based Routing Protocol (CBRP), a cluster architecture based and evaluates both routing protocols in terms of packet delivery fraction, normalized routing load, average end to end delay, throughput by varying number of nodes per sq. km, traffic sources and mobility. Simulation results show that in high
mobility (pause time 0s) scenarios, CBRP outperforms DSR. CBRP scales well with increasing number of nodes.
Interference Revelation in Mobile Ad-hoc Networks and Confrontationirjes
In this paper, we utilize the Several interference revelation techniques proposed for mobile ad hoc
networks rely on each node passively monitoring the data forwarding by its next hop. This paper presents
quantitative evaluations of false positives and their impact on monitoring based interference revelation for ad
hoc networks. Experimental results show that, even for a simple three-node configuration, an actual ad-hoc
network suffers from high false positives; these results are validated by Markov and probabilistic models.
However, this false positive problem cannot be observed by simulating the same network using popular ad hoc
network simulators, such as ns-2, OPNET or Glomosim. To remedy this, a probabilistic noise generator model
is implemented in the Glomosim simulator. With this revised noise model, the simulated network exhibits the
aggregate false positive behavior similar to that of the experimental tested. Simulations of larger (50-node) ad
hoc networks indicate that monitoring-based interference revelation has very high false positives. These false
positives can reduce the network performance or increase the overhead. In a simple monitoring-based system
where no secondary and more accurate methods are used, the false positives impact the network performance in
two ways: reduced throughput in normal networks without attackers and inability to mitigate the effect of
attacks in networks with attackers.
MOVEMENT ASSISTED COMPONENT BASED SCALABLE FRAMEWORK FOR DISTRIBUTED WIRELESS...ijcsa
Intelligent networks are becoming more enveloping and dwelling a new generation of applications are
deployed over the peer-to-peer networks. Intelligent networks are very attractive because of their role in
improving the scalability and enhancing performance by enabling direct and real-time communication
among the participating network stations. A suitable solution for resource management in distributed wireless systems is required which should support fault-tolerant operations, requested resources (at shortest path), minimize overhead generation during network management, balancing the load distribution between the participating stations and high probability of lookup success and many more. This article
presents a Movement Assisted Component Based Scalable Framework (MAC-SF) for the distributed
network which manages the distributed wireless resources and applications; monitors the behavior of the
distributed wireless applications transparently and attains accurate resource projections, manages the
connections between the participating network stations and distributes the active objects in response to the
user requests and changing processing and network conditions. This system is also compared with some
exiting systems. Results shows that MAC-SF is a better system and can be used in any wireless network.
Characterization of directed diffusion protocol in wireless sensor networkijwmn
Wireless sensor network (WSN) has enormous applications in many places for monitoring the environments
of importance. Sensor nodes are capable of sensing, computing, and communicating. These sensor nodes
are energy constraint and operated by batteries. Since energy consumption is an important issue of WSN,
there have been many energy-efficient protocols proposed for the WSN. Directed diffusion (DD) is a datacentric
protocol that focuses on the energy efficiency of the networks. Since the first proposal of DD
protocol by Deborah, there have been various versions of DD protocols proposed by many scientists across
the globe. These upgraded versions of DD protocols add on various features to the original DD protocol
such as energy, scalability, network lifetime, security, reliability, and mobility. In this paper, we discuss
and classify various characteristics of themost populardirected diffusion protocols that have been proposed
over couple of years.
CUTTING DOWN ENERGY USAGE IN WIRELESS SENSOR NETWORKS USING DUTY CYCLE TECHNI...ijwmn
A wireless sensor network is composed of many sensor nodes, that have beengiven out in a
specific zoneandeach of them hadanability of collecting information from the environment and
sending collected data to the sink. The most significant issues in wireless sensor networks,
despite the recent progress is the trouble of the severe limitations of energy resources.Since that
in different applications of sensor nets, we could throw a static or mobile sink, then all aspects of
such networks should be planned with an awareness of energy.One of the most significant topics
related to these networks, is routing. One of the most widely used and efficient methods of
routing isa hierarchy (based on clustering) method.
Grid-Based Multipath with Congestion Avoidance Routing Protocolijtsrd
This Paper gives information about Grid base multipath wireless sensor network. We give a brief introduction about wireless sensor network, how sensor works in this network. How the Routing is done and if there is congestion detected in sensors networks and then how it can be solved. Routing protocols are also classified in several types like Proactive, Reactive, and Hybrid in also given here the details of that. Also here we describe various routing techniques like Traditional and Current techniques. In flooding based techniques, sensor broadcast the information and the destination sensor receives that information. In gossiping techniques, sensor sends information to neighbor sensor and so on. In this paper we also see that if any sensor id dies due to lack of power or any other problems then another path will be routed. Routing protocols are having 3 types Flat routing, Hierarchical routing and Location based routing. In Flat routing SPIN,DD, Rumor routing, etc protocols are used. In hierarchical routing LEACH, PEGASIS, TEEN protocols are used. Now a day LEACH and PEGASIS are widely used in cluster base Wireless Sensor Network. In leach protocol reduced the path using cluster head formulation in this method randomly any sensor make the cluster head n send messages in the network. In pegasis protocol use chaining concept and find the best path from base station to the destination station. PEGASIS and LEACH provide best routing techniques in wireless sensor network but they also have some disadvantages. We also differentiate flat and hierarchical routing techniques in which case which one gives best performances. Here we introduce the readers to Location based routing protocols GEAR and how it route the path is also briefly described here. Dr. Atul M Gosai | Lakshdeep M Raval"Grid-Based Multipath with Congestion Avoidance Routing Protocol" Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-1 | Issue-3 , April 2017, URL: http://www.ijtsrd.com/papers/ijtsrd72.pdf http://www.ijtsrd.com/computer-science/computer-network/72/grid-based-multipath-with-congestion-avoidance-routing-protocol/dr-atul-m-gosai
Enhanced Zigbee Tree Routing In Wireless Sensor Networkpaperpublications3
Abstract: Multipath routing is an efficient technique to route data in wireless sensor networks (WSNs) because it can provide reliability, security and load balance, which are particularly critical in the resource constrained system such as WSNs. The existing protocols are not fully satisfied. In this paper propose a new routing protocol that is enhanced zigbee tree routing (EZTR), to satisfy the QoS parameters. The new protocol provides less delay as compared with other protocol.
Optical Networks Automation Overview: A SurveySergio Cruzes
The increasing demand for data has driven the advancement of optical networks from traditional architectures to
more flexible, dynamic and efficient solutions. This includes technologies like flexgrid reconfigurable optical add-drop
multiplexers (ROADMs), variable bandwidth transponders (VBTs) providing different modulation, coding schemes
and baud rates. These advancements have brought about new challenges that concerns to the routing and spectrum
allocation (RSA), fragmented spectrum, need for rapid and efficient channel restoration, and operation and maintenance
management of optical networks. To address these challenges, a dynamic and flexible network requires a highly advanced
network operational system (OS) capable of efficiently managing and allocating network resources. It relies on network
abstraction, sensors, actuators, and software-defined networking (SDN) to enable algorithms, management, control, and
decision-making. Improving the sensing capabilities of the network is crucial. Modern hardware and sensor technology
can help forecast fiber breaks, equipment failures, and other potential issues in advance, allowing for proactive actions
to be taken. Machine learning (ML) methods have been proposed in the literature to enhance the accuracy of quality
of transmission (QoT) estimation, mitigate nonlinearities and provide decisions. This reduces the need for conservative
design margins, maximizes the capacity of optical network systems and reduces the investment in infrastructure. Failure
management is a critical aspect of optical networks. Providing early-warning and proactive protection is essential. This
includes detecting failures, localizing them, identifying the root causes, and estimating their magnitude. Quick response
to failures is vital to maintaining network reliability.
International Journal of Research in Engineering and Science is an open access peer-reviewed international forum for scientists involved in research to publish quality and refereed papers. Papers reporting original research or experimentally proved review work are welcome. Papers for publication are selected through peer review to ensure originality, relevance, and readability.
Similar to International Journal of Engineering Research and Development (IJERD) (20)
A Novel Method for Prevention of Bandwidth Distributed Denial of Service AttacksIJERD Editor
Distributed Denial of Service (DDoS) Attacks became a massive threat to the Internet. Traditional
Architecture of internet is vulnerable to the attacks like DDoS. Attacker primarily acquire his army of Zombies,
then that army will be instructed by the Attacker that when to start an attack and on whom the attack should be
done. In this paper, different techniques which are used to perform DDoS Attacks, Tools that were used to
perform Attacks and Countermeasures in order to detect the attackers and eliminate the Bandwidth Distributed
Denial of Service attacks (B-DDoS) are reviewed. DDoS Attacks were done by using various Flooding
techniques which are used in DDoS attack.
The main purpose of this paper is to design an architecture which can reduce the Bandwidth
Distributed Denial of service Attack and make the victim site or server available for the normal users by
eliminating the zombie machines. Our Primary focus of this paper is to dispute how normal machines are
turning into zombies (Bots), how attack is been initiated, DDoS attack procedure and how an organization can
save their server from being a DDoS victim. In order to present this we implemented a simulated environment
with Cisco switches, Routers, Firewall, some virtual machines and some Attack tools to display a real DDoS
attack. By using Time scheduling, Resource Limiting, System log, Access Control List and some Modular
policy Framework we stopped the attack and identified the Attacker (Bot) machines
Hearing loss is one of the most common human impairments. It is estimated that by year 2015 more
than 700 million people will suffer mild deafness. Most can be helped by hearing aid devices depending on the
severity of their hearing loss. This paper describes the implementation and characterization details of a dual
channel transmitter front end (TFE) for digital hearing aid (DHA) applications that use novel micro
electromechanical- systems (MEMS) audio transducers and ultra-low power-scalable analog-to-digital
converters (ADCs), which enable a very-low form factor, energy-efficient implementation for next-generation
DHA. The contribution of the design is the implementation of the dual channel MEMS microphones and powerscalable
ADC system.
Influence of tensile behaviour of slab on the structural Behaviour of shear c...IJERD Editor
-A composite beam is composed of a steel beam and a slab connected by means of shear connectors
like studs installed on the top flange of the steel beam to form a structure behaving monolithically. This study
analyzes the effects of the tensile behavior of the slab on the structural behavior of the shear connection like slip
stiffness and maximum shear force in composite beams subjected to hogging moment. The results show that the
shear studs located in the crack-concentration zones due to large hogging moments sustain significantly smaller
shear force and slip stiffness than the other zones. Moreover, the reduction of the slip stiffness in the shear
connection appears also to be closely related to the change in the tensile strain of rebar according to the increase
of the load. Further experimental and analytical studies shall be conducted considering variables such as the
reinforcement ratio and the arrangement of shear connectors to achieve efficient design of the shear connection
in composite beams subjected to hogging moment.
Gold prospecting using Remote Sensing ‘A case study of Sudan’IJERD Editor
Gold has been extracted from northeast Africa for more than 5000 years, and this may be the first
place where the metal was extracted. The Arabian-Nubian Shield (ANS) is an exposure of Precambrian
crystalline rocks on the flanks of the Red Sea. The crystalline rocks are mostly Neoproterozoic in age. ANS
includes the nations of Israel, Jordan. Egypt, Saudi Arabia, Sudan, Eritrea, Ethiopia, Yemen, and Somalia.
Arabian Nubian Shield Consists of juvenile continental crest that formed between 900 550 Ma, when intra
oceanic arc welded together along ophiolite decorated arc. Primary Au mineralization probably developed in
association with the growth of intra oceanic arc and evolution of back arc. Multiple episodes of deformation
have obscured the primary metallogenic setting, but at least some of the deposits preserve evidence that they
originate as sea floor massive sulphide deposits.
The Red Sea Hills Region is a vast span of rugged, harsh and inhospitable sector of the Earth with
inimical moon-like terrain, nevertheless since ancient times it is famed to be an abode of gold and was a major
source of wealth for the Pharaohs of ancient Egypt. The Pharaohs old workings have been periodically
rediscovered through time. Recent endeavours by the Geological Research Authority of Sudan led to the
discovery of a score of occurrences with gold and massive sulphide mineralizations. In the nineties of the
previous century the Geological Research Authority of Sudan (GRAS) in cooperation with BRGM utilized
satellite data of Landsat TM using spectral ratio technique to map possible mineralized zones in the Red Sea
Hills of Sudan. The outcome of the study mapped a gossan type gold mineralization. Band ratio technique was
applied to Arbaat area and a signature of alteration zone was detected. The alteration zones are commonly
associated with mineralization. The alteration zones are commonly associated with mineralization. A filed check
confirmed the existence of stock work of gold bearing quartz in the alteration zone. Another type of gold
mineralization that was discovered using remote sensing is the gold associated with metachert in the Atmur
Desert.
Reducing Corrosion Rate by Welding DesignIJERD Editor
The paper addresses the importance of welding design to prevent corrosion at steel. Welding is
used to join pipe, profiles at bridges, spindle, and a lot more part of engineering construction. The
problems happened associated with welding are common issues in these fields, especially corrosion.
Corrosion can be reduced with many methods, they are painting, controlling humidity, and also good
welding design. In the research, it can be found that reducing residual stress on the welding can be
solved in corrosion rate reduction problem.
Preheating on 500oC and 600oC give better condition to reduce corosion rate than condition after
preheating 400oC. For all welding groove type, material with 500oC and 600oC preheating after 14 days
corrosion test is 0,5%-0,69% lost. Material with 400oC preheating after 14 days corrosion test is 0,57%-0,76%
lost.
Welding groove also influence corrosion rate. X and V type welding groove give better condition to reduce
corrosion rate than use 1/2V and 1/2 X welding groove. After 14 days corrosion test, the samples with
X welding groove type is 0,5%-0,57% lost. The samples with V welding groove after 14 days corrosion test is
0,51%-0,59% lost. The samples with 1/2V and 1/2X welding groove after 14 days corrosion test is 0,58%-
0,71% lost.
Router 1X3 – RTL Design and VerificationIJERD Editor
Routing is the process of moving a packet of data from source to destination and enables messages
to pass from one computer to another and eventually reach the target machine. A router is a networking device
that forwards data packets between computer networks. It is connected to two or more data lines from different
networks (as opposed to a network switch, which connects data lines from one single network). This paper,
mainly emphasizes upon the study of router device, it‟s top level architecture, and how various sub-modules of
router i.e. Register, FIFO, FSM and Synchronizer are synthesized, and simulated and finally connected to its top
module.
Active Power Exchange in Distributed Power-Flow Controller (DPFC) At Third Ha...IJERD Editor
This paper presents a component within the flexible ac-transmission system (FACTS) family, called
distributed power-flow controller (DPFC). The DPFC is derived from the unified power-flow controller (UPFC)
with an eliminated common dc link. The DPFC has the same control capabilities as the UPFC, which comprise
the adjustment of the line impedance, the transmission angle, and the bus voltage. The active power exchange
between the shunt and series converters, which is through the common dc link in the UPFC, is now through the
transmission lines at the third-harmonic frequency. DPFC multiple small-size single-phase converters which
reduces the cost of equipment, no voltage isolation between phases, increases redundancy and there by
reliability increases. The principle and analysis of the DPFC are presented in this paper and the corresponding
simulation results that are carried out on a scaled prototype are also shown.
Mitigation of Voltage Sag/Swell with Fuzzy Control Reduced Rating DVRIJERD Editor
Power quality has been an issue that is becoming increasingly pivotal in industrial electricity
consumers point of view in recent times. Modern industries employ Sensitive power electronic equipments,
control devices and non-linear loads as part of automated processes to increase energy efficiency and
productivity. Voltage disturbances are the most common power quality problem due to this the use of a large
numbers of sophisticated and sensitive electronic equipment in industrial systems is increased. This paper
discusses the design and simulation of dynamic voltage restorer for improvement of power quality and
reduce the harmonics distortion of sensitive loads. Power quality problem is occurring at non-standard
voltage, current and frequency. Electronic devices are very sensitive loads. In power system voltage sag,
swell, flicker and harmonics are some of the problem to the sensitive load. The compensation capability
of a DVR depends primarily on the maximum voltage injection ability and the amount of stored
energy available within the restorer. This device is connected in series with the distribution feeder at
medium voltage. A fuzzy logic control is used to produce the gate pulses for control circuit of DVR and the
circuit is simulated by using MATLAB/SIMULINK software.
Study on the Fused Deposition Modelling In Additive ManufacturingIJERD Editor
Additive manufacturing process, also popularly known as 3-D printing, is a process where a product
is created in a succession of layers. It is based on a novel materials incremental manufacturing philosophy.
Unlike conventional manufacturing processes where material is removed from a given work price to derive the
final shape of a product, 3-D printing develops the product from scratch thus obviating the necessity to cut away
materials. This prevents wastage of raw materials. Commonly used raw materials for the process are ABS
plastic, PLA and nylon. Recently the use of gold, bronze and wood has also been implemented. The complexity
factor of this process is 0% as in any object of any shape and size can be manufactured.
Spyware triggering system by particular string valueIJERD Editor
This computer programme can be used for good and bad purpose in hacking or in any general
purpose. We can say it is next step for hacking techniques such as keylogger and spyware. Once in this system if
user or hacker store particular string as a input after that software continually compare typing activity of user
with that stored string and if it is match then launch spyware programme.
A Blind Steganalysis on JPEG Gray Level Image Based on Statistical Features a...IJERD Editor
This paper presents a blind steganalysis technique to effectively attack the JPEG steganographic
schemes i.e. Jsteg, F5, Outguess and DWT Based. The proposed method exploits the correlations between
block-DCTcoefficients from intra-block and inter-block relation and the statistical moments of characteristic
functions of the test image is selected as features. The features are extracted from the BDCT JPEG 2-array.
Support Vector Machine with cross-validation is implemented for the classification.The proposed scheme gives
improved outcome in attacking.
Secure Image Transmission for Cloud Storage System Using Hybrid SchemeIJERD Editor
- Data over the cloud is transferred or transmitted between servers and users. Privacy of that
data is very important as it belongs to personal information. If data get hacked by the hacker, can be
used to defame a person’s social data. Sometimes delay are held during data transmission. i.e. Mobile
communication, bandwidth is low. Hence compression algorithms are proposed for fast and efficient
transmission, encryption is used for security purposes and blurring is used by providing additional
layers of security. These algorithms are hybridized for having a robust and efficient security and
transmission over cloud storage system.
Application of Buckley-Leverett Equation in Modeling the Radius of Invasion i...IJERD Editor
A thorough review of existing literature indicates that the Buckley-Leverett equation only analyzes
waterflood practices directly without any adjustments on real reservoir scenarios. By doing so, quite a number
of errors are introduced into these analyses. Also, for most waterflood scenarios, a radial investigation is more
appropriate than a simplified linear system. This study investigates the adoption of the Buckley-Leverett
equation to estimate the radius invasion of the displacing fluid during waterflooding. The model is also adopted
for a Microbial flood and a comparative analysis is conducted for both waterflooding and microbial flooding.
Results shown from the analysis doesn’t only records a success in determining the radial distance of the leading
edge of water during the flooding process, but also gives a clearer understanding of the applicability of
microbes to enhance oil production through in-situ production of bio-products like bio surfactans, biogenic
gases, bio acids etc.
Gesture Gaming on the World Wide Web Using an Ordinary Web CameraIJERD Editor
- Gesture gaming is a method by which users having a laptop/pc/x-box play games using natural or
bodily gestures. This paper presents a way of playing free flash games on the internet using an ordinary webcam
with the help of open source technologies. Emphasis in human activity recognition is given on the pose
estimation and the consistency in the pose of the player. These are estimated with the help of an ordinary web
camera having different resolutions from VGA to 20mps. Our work involved giving a 10 second documentary to
the user on how to play a particular game using gestures and what are the various kinds of gestures that can be
performed in front of the system. The initial inputs of the RGB values for the gesture component is obtained by
instructing the user to place his component in a red box in about 10 seconds after the short documentary before
the game is finished. Later the system opens the concerned game on the internet on popular flash game sites like
miniclip, games arcade, GameStop etc and loads the game clicking at various places and brings the state to a
place where the user is to perform only gestures to start playing the game. At any point of time the user can call
off the game by hitting the esc key and the program will release all of the controls and return to the desktop. It
was noted that the results obtained using an ordinary webcam matched that of the Kinect and the users could
relive the gaming experience of the free flash games on the net. Therefore effective in game advertising could
also be achieved thus resulting in a disruptive growth to the advertising firms.
Hardware Analysis of Resonant Frequency Converter Using Isolated Circuits And...IJERD Editor
-LLC resonant frequency converter is basically a combo of series as well as parallel resonant ckt. For
LCC resonant converter it is associated with a disadvantage that, though it has two resonant frequencies, the
lower resonant frequency is in ZCS region[5]. For this application, we are not able to design the converter
working at this resonant frequency. LLC resonant converter existed for a very long time but because of
unknown characteristic of this converter it was used as a series resonant converter with basically a passive
(resistive) load. . Here, it was designed to operate in switching frequency higher than resonant frequency of the
series resonant tank of Lr and Cr converter acts very similar to Series Resonant Converter. The benefit of LLC
resonant converter is narrow switching frequency range with light load[6] . Basically, the control ckt plays a
very imp. role and hence 555 Timer used here provides a perfect square wave as the control ckt provides no
slew rate which makes the square wave really strong and impenetrable. The dead band circuit provides the
exclusive dead band in micro seconds so as to avoid the simultaneous firing of two pairs of IGBT’s where one
pair switches off and the other on for a slightest period of time. Hence, the isolator ckt here is associated with
each and every ckt used because it acts as a driver and an isolation to each of the IGBT is provided with one
exclusive transformer supply[3]. The IGBT’s are fired using the appropriate signal using the previous boards
and hence at last a high frequency rectifier ckt with a filtering capacitor is used to get an exact dc
waveform .The basic goal of this particular analysis is to observe the wave forms and characteristics of
converters with differently positioned passive elements in the form of tank circuits.
Simulated Analysis of Resonant Frequency Converter Using Different Tank Circu...IJERD Editor
LLC resonant frequency converter is basically a combo of series as well as parallel resonant ckt. For
LCC resonant converter it is associated with a disadvantage that, though it has two resonant frequencies, the
lower resonant frequency is in ZCS region [5]. For this application, we are not able to design the converter
working at this resonant frequency. LLC resonant converter existed for a very long time but because of
unknown characteristic of this converter it was used as a series resonant converter with basically a passive
(resistive) load. . Here, it was designed to operate in switching frequency higher than resonant frequency of the
series resonant tank of Lr and Cr converter acts very similar to Series Resonant Converter. The benefit of LLC
resonant converter is narrow switching frequency range with light load[6] . Basically, the control ckt plays a
very imp. role and hence 555 Timer used here provides a perfect square wave as the control ckt provides no
slew rate which makes the square wave really strong and impenetrable. The dead band circuit provides the
exclusive dead band in micro seconds so as to avoid the simultaneous firing of two pairs of IGBT’s where one
pair switches off and the other on for a slightest period of time. Hence, the isolator ckt here is associated with
each and every ckt used because it acts as a driver and an isolation to each of the IGBT is provided with one
exclusive transformer supply[3]. The IGBT’s are fired using the appropriate signal using the previous boards
and hence at last a high frequency rectifier ckt with a filtering capacitor is used to get an exact dc
waveform .The basic goal of this particular analysis is to observe the wave forms and characteristics of
converters with differently positioned passive elements in the form of tank circuits. The supported simulation
is done through PSIM 6.0 software tool
Amateurs Radio operator, also known as HAM communicates with other HAMs through Radio
waves. Wireless communication in which Moon is used as natural satellite is called Moon-bounce or EME
(Earth -Moon-Earth) technique. Long distance communication (DXing) using Very High Frequency (VHF)
operated amateur HAM radio was difficult. Even with the modest setup having good transceiver, power
amplifier and high gain antenna with high directivity, VHF DXing is possible. Generally 2X11 YAGI antenna
along with rotor to set horizontal and vertical angle is used. Moon tracking software gives exact location,
visibility of Moon at both the stations and other vital data to acquire real time position of moon.
“MS-Extractor: An Innovative Approach to Extract Microsatellites on „Y‟ Chrom...IJERD Editor
Simple Sequence Repeats (SSR), also known as Microsatellites, have been extensively used as
molecular markers due to their abundance and high degree of polymorphism. The nucleotide sequences of
polymorphic forms of the same gene should be 99.9% identical. So, Microsatellites extraction from the Gene is
crucial. However, Microsatellites repeat count is compared, if they differ largely, he has some disorder. The Y
chromosome likely contains 50 to 60 genes that provide instructions for making proteins. Because only males
have the Y chromosome, the genes on this chromosome tend to be involved in male sex determination and
development. Several Microsatellite Extractors exist and they fail to extract microsatellites on large data sets of
giga bytes and tera bytes in size. The proposed tool “MS-Extractor: An Innovative Approach to extract
Microsatellites on „Y‟ Chromosome” can extract both Perfect as well as Imperfect Microsatellites from large
data sets of human genome „Y‟. The proposed system uses string matching with sliding window approach to
locate Microsatellites and extracts them.
Importance of Measurements in Smart GridIJERD Editor
- The need to get reliable supply, independence from fossil fuels, and capability to provide clean
energy at a fixed and lower cost, the existing power grid structure is transforming into Smart Grid. The
development of a smart energy distribution grid is a current goal of many nations. A Smart Grid should have
new capabilities such as self-healing, high reliability, energy management, and real-time pricing. This new era
of smart future grid will lead to major changes in existing technologies at generation, transmission and
distribution levels. The incorporation of renewable energy resources and distribution generators in the existing
grid will increase the complexity, optimization problems and instability of the system. This will lead to a
paradigm shift in the instrumentation and control requirements for Smart Grids for high quality, stable and
reliable electricity supply of power. The monitoring of the grid system state and stability relies on the
availability of reliable measurement of data. In this paper the measurement areas that highlight new
measurement challenges, development of the Smart Meters and the critical parameters of electric energy to be
monitored for improving the reliability of power systems has been discussed.
Study of Macro level Properties of SCC using GGBS and Lime stone powderIJERD Editor
One of the major environmental concerns is the disposal of the waste materials and utilization of
industrial by products. Lime stone quarries will produce millions of tons waste dust powder every year. Having
considerable high degree of fineness in comparision to cement this material may be utilized as a partial
replacement to cement. For this purpose an experiment is conducted to investigate the possibility of using lime
stone powder in the production of SCC with combined use GGBS and how it affects the fresh and mechanical
properties of SCC. First SCC is made by replacing cement with GGBS in percentages like 10, 20, 30, 40, 50 and
by taking the optimum mix with GGBS lime stone powder is blended to mix in percentages like 5, 10, 15, 20 as
a partial replacement to cement. Test results shows that the SCC mix with combination of 30% GGBS and 15%
limestone powder gives maximum compressive strength and fresh properties are also in the limits prescribed by
the EFNARC.
Neuro-symbolic is not enough, we need neuro-*semantic*Frank van Harmelen
Neuro-symbolic (NeSy) AI is on the rise. However, simply machine learning on just any symbolic structure is not sufficient to really harvest the gains of NeSy. These will only be gained when the symbolic structures have an actual semantics. I give an operational definition of semantics as “predictable inference”.
All of this illustrated with link prediction over knowledge graphs, but the argument is general.
Smart TV Buyer Insights Survey 2024 by 91mobiles.pdf91mobiles
91mobiles recently conducted a Smart TV Buyer Insights Survey in which we asked over 3,000 respondents about the TV they own, aspects they look at on a new TV, and their TV buying preferences.
Software Delivery At the Speed of AI: Inflectra Invests In AI-Powered QualityInflectra
In this insightful webinar, Inflectra explores how artificial intelligence (AI) is transforming software development and testing. Discover how AI-powered tools are revolutionizing every stage of the software development lifecycle (SDLC), from design and prototyping to testing, deployment, and monitoring.
Learn about:
• The Future of Testing: How AI is shifting testing towards verification, analysis, and higher-level skills, while reducing repetitive tasks.
• Test Automation: How AI-powered test case generation, optimization, and self-healing tests are making testing more efficient and effective.
• Visual Testing: Explore the emerging capabilities of AI in visual testing and how it's set to revolutionize UI verification.
• Inflectra's AI Solutions: See demonstrations of Inflectra's cutting-edge AI tools like the ChatGPT plugin and Azure Open AI platform, designed to streamline your testing process.
Whether you're a developer, tester, or QA professional, this webinar will give you valuable insights into how AI is shaping the future of software delivery.
Elevating Tactical DDD Patterns Through Object CalisthenicsDorra BARTAGUIZ
After immersing yourself in the blue book and its red counterpart, attending DDD-focused conferences, and applying tactical patterns, you're left with a crucial question: How do I ensure my design is effective? Tactical patterns within Domain-Driven Design (DDD) serve as guiding principles for creating clear and manageable domain models. However, achieving success with these patterns requires additional guidance. Interestingly, we've observed that a set of constraints initially designed for training purposes remarkably aligns with effective pattern implementation, offering a more ‘mechanical’ approach. Let's explore together how Object Calisthenics can elevate the design of your tactical DDD patterns, offering concrete help for those venturing into DDD for the first time!
Connector Corner: Automate dynamic content and events by pushing a buttonDianaGray10
Here is something new! In our next Connector Corner webinar, we will demonstrate how you can use a single workflow to:
Create a campaign using Mailchimp with merge tags/fields
Send an interactive Slack channel message (using buttons)
Have the message received by managers and peers along with a test email for review
But there’s more:
In a second workflow supporting the same use case, you’ll see:
Your campaign sent to target colleagues for approval
If the “Approve” button is clicked, a Jira/Zendesk ticket is created for the marketing design team
But—if the “Reject” button is pushed, colleagues will be alerted via Slack message
Join us to learn more about this new, human-in-the-loop capability, brought to you by Integration Service connectors.
And...
Speakers:
Akshay Agnihotri, Product Manager
Charlie Greenberg, Host
GraphRAG is All You need? LLM & Knowledge GraphGuy Korland
Guy Korland, CEO and Co-founder of FalkorDB, will review two articles on the integration of language models with knowledge graphs.
1. Unifying Large Language Models and Knowledge Graphs: A Roadmap.
https://arxiv.org/abs/2306.08302
2. Microsoft Research's GraphRAG paper and a review paper on various uses of knowledge graphs:
https://www.microsoft.com/en-us/research/blog/graphrag-unlocking-llm-discovery-on-narrative-private-data/
Securing your Kubernetes cluster_ a step-by-step guide to success !KatiaHIMEUR1
Today, after several years of existence, an extremely active community and an ultra-dynamic ecosystem, Kubernetes has established itself as the de facto standard in container orchestration. Thanks to a wide range of managed services, it has never been so easy to set up a ready-to-use Kubernetes cluster.
However, this ease of use means that the subject of security in Kubernetes is often left for later, or even neglected. This exposes companies to significant risks.
In this talk, I'll show you step-by-step how to secure your Kubernetes cluster for greater peace of mind and reliability.
Dev Dives: Train smarter, not harder – active learning and UiPath LLMs for do...UiPathCommunity
💥 Speed, accuracy, and scaling – discover the superpowers of GenAI in action with UiPath Document Understanding and Communications Mining™:
See how to accelerate model training and optimize model performance with active learning
Learn about the latest enhancements to out-of-the-box document processing – with little to no training required
Get an exclusive demo of the new family of UiPath LLMs – GenAI models specialized for processing different types of documents and messages
This is a hands-on session specifically designed for automation developers and AI enthusiasts seeking to enhance their knowledge in leveraging the latest intelligent document processing capabilities offered by UiPath.
Speakers:
👨🏫 Andras Palfi, Senior Product Manager, UiPath
👩🏫 Lenka Dulovicova, Product Program Manager, UiPath
Slack (or Teams) Automation for Bonterra Impact Management (fka Social Soluti...Jeffrey Haguewood
Sidekick Solutions uses Bonterra Impact Management (fka Social Solutions Apricot) and automation solutions to integrate data for business workflows.
We believe integration and automation are essential to user experience and the promise of efficient work through technology. Automation is the critical ingredient to realizing that full vision. We develop integration products and services for Bonterra Case Management software to support the deployment of automations for a variety of use cases.
This video focuses on the notifications, alerts, and approval requests using Slack for Bonterra Impact Management. The solutions covered in this webinar can also be deployed for Microsoft Teams.
Interested in deploying notification automations for Bonterra Impact Management? Contact us at sales@sidekicksolutionsllc.com to discuss next steps.
JMeter webinar - integration with InfluxDB and GrafanaRTTS
Watch this recorded webinar about real-time monitoring of application performance. See how to integrate Apache JMeter, the open-source leader in performance testing, with InfluxDB, the open-source time-series database, and Grafana, the open-source analytics and visualization application.
In this webinar, we will review the benefits of leveraging InfluxDB and Grafana when executing load tests and demonstrate how these tools are used to visualize performance metrics.
Length: 30 minutes
Session Overview
-------------------------------------------
During this webinar, we will cover the following topics while demonstrating the integrations of JMeter, InfluxDB and Grafana:
- What out-of-the-box solutions are available for real-time monitoring JMeter tests?
- What are the benefits of integrating InfluxDB and Grafana into the load testing stack?
- Which features are provided by Grafana?
- Demonstration of InfluxDB and Grafana using a practice web application
To view the webinar recording, go to:
https://www.rttsweb.com/jmeter-integration-webinar
JMeter webinar - integration with InfluxDB and Grafana
International Journal of Engineering Research and Development (IJERD)
1. International Journal of Engineering Research and Development
e-ISSN: 2278-067X, p-ISSN: 2278-800X, www.ijerd.com
Volume7, Issue 12 (July 2013), PP. 33-39
33
Intelligent Routing and Bandwidth Allocation in Wireless
Networks
1
Pavan Kunchur, 2
Prasad Kulkarni, 3
Veeranna Kotagi,
1
MTech(Digital Communication and Networking),Bagalkot,Karnataka,
2
.MCA,Bagalkot,Karnataka,
3
AP,LNBCIET,Raigoan,Satara,Maharashtra,
Abstract:- Sensor networks and satellite constellations face a number of challenges for reliable and robust
communications. Increasingly heterogeneous nodes and a multitude of new emerging Earth science applications
put additional restrictions on throughput and delay requirements. These problems are further aggravated by
energy and bandwidth constraints on the network nodes. Quality of service and performance of such wireless
networks, in the presence of such issues, are greatly affected by network routing and bandwidth allocation. We
propose a new class of routing algorithms based on principles of biological swarms, which have the potential to
address these problems in an autonomous and intelligent fashion. Such swarm-based algorithms adapt well to
dynamic topologies, and, compared to the current state-of-the-art, have been shown to result in the highest
throughput and lowest delays in internet-style networks.
Swarm-based routing algorithms boast a number of attractive features, including autonomy, robustness
and fault-tolerance. They rely on the interaction of autonomous agents who communicate with each other
through the environment (a phenomenon known as stigmergy). Current swarm based routing algorithms focus
on wired circuit or packet switched networks. We propose new swarm routing algorithms suitable for wireless
sensor or satellite networks. Control for optimizing the transmitter power and data rate for network
communication is also considered. Biologically inspired methodologies such as evolutionary computing and
particle swarm optimization can be used for concurrent maximization of the data rate and minimization of
transmitter power, subject to constraints on the bit error rate (BER) at the receiver.
I. INTRODUCTION
The rapid speed of technological innovation has resulted in increasingly sophisticated means for earth
exploration and data collection from space. Without a pre-existing network infrastructure, nodes with wireless
communication capabilities are tasked with information collection, processing, and communication. Lack of a
fixed network and the nature of the nodes give rise to challenges for robust and reliable data routing, which must
now compensate for: a) dynamic network topologies b) changing environments c) limited node energies d)
limited bandwidth and e) background noise. These issues are, for example, typical for Mobile Ad-hoc Wireless
Networks (MANETS), and require different routing approaches than those used in current conventional
networks.
Swarm intelligence [1] forms the core of an enabling technology for a new class of routing and
optimization algorithms boasting attractive features, such as autonomy, robustness and fault-tolerance –
rendering it suitable for MANETS. Algorithms based on swarms have been developed in recent years for wired
networks [2-12], but their properties are also attractive for ad-hoc networks. We investigate the specific
challenges of wireless networks and propose adaptations of swarm-based algorithms to address them both for
network routing, and network bandwidth allocation.
II. ROUTING IN WIRELESS DATA NETWORKS
The usual performance metrics of a network are average throughput and delay. The interaction between
routing and flow control affects how well these metrics are jointly optimized. The balance of delay and
throughput is determined by the flow-control scheme [13] (see Fig. 1(a)). Good routing generally results in a
more favorable delay-throughput curve (Fig. 1(b)). These curves serve as the standard metric for comparison of
routing algorithm performance.
2. Intelligent Routing and Bandwidth Allocation in Wireless Networks
34
Fig. 1. a) Routing – flow control interaction, b) throughput delay curves.
Routing algorithms should handle different kinds of service requests, including unicast (one-to-one)
and multicast (one-to-many) communication. Users may request quality of service (QoS) guarantees, which can
involve a guaranteed allocation of bandwidth, a maximum delay, or a minimum hop-count. Such guarantees
only make sense for virtual-circuit networks. This is because in applications that require logical connections
there is demand for a minimum flow rate of data. This is unlike packet-switched types of service where best-
effort routing is implemented. Although logical connections use static routing, the establishment of the
connection is prone to the same problems that affect routing in the rest of the larger network.
In wireless networks, there are additional considerations to be taken into account. Node mobility and
the wireless nature of communication – prone to noise and dependent on various environmental conditions –
affect the connectivity of the network, causing its topology to change, often rather rapidly. This is aggravated by
further constraints on energy reserves and available bandwidth – and signal degradation by noise and limited
transceiver resources.
Therefore, instead of a traditional layered network control approach, a joint optimization scheme
affecting both the link and the routing layer is necessary. This idea is discussed by Wiesellthier et. al. [14],
where the Broadcast Incremental Power (BIP) algorithm for multicasting in ad-hoc networks is proposed.
Although BIP is an improvement compared to previous techniques, it is still sub-optimal. Furthermore, it does
not deal with unicast issues and assumes no mobility and no constraints on bandwidth or transceiver resources.
Although in a later paper [15] the authors discuss an extension of BIP addressing bandwidth and transceiver
limitations, there still remains ample room for improvement.
There are also numerous algorithms for ad-hoc networks that concentrate solely on the network layer.
These can be categorized into table driven – where each node maintains routing information to every other node
in the network and exchanges information when the state of the network changes – and on-demand routing
algorithms where routing tables are created only when needed. The former category includes: dynamic
destination-sequenced distance-vector routing; wireless routing protocol; global state routing; fisheye state
routing; hierarchical state routing; zone-based hierarchical link state routing protocol; and clusterhead gateway
switch routing. The later category includes on-demand routing protocols; cluster based routing; ad hoc on-
demand distance vector routing; dynamic source routing; temporally ordered routing; associativity based routing
and signal stability routing.
III. SWARM INTELLIGENCE
Swarm intelligence appears in biological swarms of certain social insect species. Flocking or group
behavior gives rise to complex and often intelligent behavior through simple direct or indirect interaction of
thousands of autonomous swarm members. The end result is emergence of very complex forms of social
behavior and fulfillment of a number of very complex tasks [1].
This emergent intelligent behavior derives primarily from two principles: self-organization and stigmergy. From
a very abstract perspective self-organization relies on four basic ingredients:
1. Positive feedback constitutes the basis for creation of intelligent structures (morphogenesis).
2. Negative feedback counterbalances positive feedback and helps stabilize the collective.
3. Amplification of random fluctuations. Randomness is crucial to discovery of new solutions (time-varying
optimization) that in turn may result in network robustness.
4. Interaction among multiple agents. Usually agents utilize results of their own activities as well as others.
3. Intelligent Routing and Bandwidth Allocation in Wireless Networks
35
Stigmergy, or indirect communication through the
environment, is the other primary principle behind swarm intelligence. This principle may be synthesized in
many real engineering systems, in particular wireline and wireless communications.
One form of stigmergy alters the environment in such a manner so as to promote further similar action by the
agents. This process is dubbed task-related stigmergy. An example is laying of sand grains by termites when
constructing nests. In the initial stages of construction, termites lay sand grains at random locations. This
stimulates further laying by other members of the swarm, until a single heap of sand grains randomly reaches a
critical mass that is larger than its neighboring heaps. At that point, most termites are attracted to that specific
heap, thereby selecting that site for construction of their nest.
Swarm intelligence boasts a number of advantages due to the use of mobile agents and stigmergy. These are:
1. Scalability: Population of the agents can be adapted according to the problem size. Scalability is also
promoted by local and distributed agent interactions.
2. Fault tolerance: Swarm intelligent processes do not rely on a centralized control mechanism. Therefore the
loss of a few agents does not result in catastrophic failure, but rather leads to graceful, scalable degradation.
3. Adaptation: Agents can change, die or reproduce, according to system changes.
4. Autonomy: Little or no human supervision is required.
5. Parallelism: Agent’s operations are inherently parallel.
These properties make swarm intelligence very attractive for ad-hoc wireless networks. They also render swarm
intelligence suitable for a variety of other applications, apart from routing, including robotics [16-19] and
optimization [20,2].
A. Swarm Routing
The first routing algorithm based on swarm intelligence, known as Ant-based Control (ABC), was
introduced by Schoonderwoerd et al [3], and was followed by AntNet, proposed first by Di Caro and Dorigo
[7,8,10], and many others [9,11,12,21]. The basic difference between swarm-based algorithms and current
routing schemes is the use of stochastic exploration for new route discovery in swarm based techniques. This
stochastic property is achieved by using routing tables which assign probabilities to next-hops, and special
agents that follow a next-hop based on these probabilities. Regular data packets, however, always follow the
next-hop with the highest probability. A sample routing table is given in Table I, where each row corresponds to
a destination and each column to neighbors of the node, with probabilities assigned to them.
TABLE I
SWARM-BASED ROUTING TABLE
Next Hop
Destinatio
n
B C
E 0.45 0.55
F 0.75 0.25
Special exploration agents, dubbed “ants”, who collect traveling time information as they traverse the
network, determine the probabilities of the routing table. The ants go through the same queues as regular data
packets, so that the travel-time information they collect is a valid estimate for data packet travel times as well.
There are two approaches to updating the routing tables. In ABC, the routing tables are updated as the ants move
from node to destination. In contrast, AntNet uses two classes of agents: forward ants and backward ants. Once
it reaches its destination each forward ant bequeaths the traveling time information to a backward ant, which
updates the routing tables as it traces the path of the forward ant in reverse. The advantage of this approach is
that routing tables are updated only when an ant is successful in reaching a destination, while in ABC ants that
might never reach a destination can update routing tables.
The principles of these algorithms are similar to reinforcement learning. This is better explained in Fig. 2, where
the trip-times are the raw reinforcement which is processed by the critic to produce an intermediate quantity r’,
which, in turn, updates the routing tables.
Fig. 2. Actor-Critic System
4. Intelligent Routing and Bandwidth Allocation in Wireless Networks
36
Swarm-based routing algorithms have so far been developed only for wired networks. They have not
been thoroughly tested, nor does a proof for their convergence exist yet. However, preliminary simulations for
AntNet [8] show that it outperforms all conventional algorithms, including OSPF, the internet standard.
B. Preliminary Results
To illustrate performance, AntNet, the most successful swarm routing procedure thus far demonstrated
was implemented on NS2, the standard research platform for network simulation. A simple 5-node wireline
network (Fig. 3), was used as the demonstration testbed. For comparison purposes we also implemented the
Distance Vector (DV) and Link-State (LS) algorithms [13]. The network considered had two sources of 500
kbps data rate at nodes 0 and 3, where the destination of source 0 is destination 4 and the destination of source 3
is destination 0. The capacity of all the links is 1 Mbps, and all links have a propagation delay of 10 ms, except
for links 0-2, 2-3, 1-4 which have a delay of 40 ms. Link 0-1 failures occurs at time 7.5s of the simulation and
the link recovers at 8.5s.
The test for AntNet was to see if (a) it could correctly identify the optimal path while the network is
stationary (until time 7.5 s) and (b) when a link fails, whether it would adapt to find the next best path. It was
shown that AntNet, indeed, is adept at dynamically adjusting to these changes, and for this small network,
performs comparably if not better than DV and LS algorithms in terms of average delay and percentage of
packets lost.
Fig. 3. Test Network
We expect that as the network grows in size, and more severe disruptions are inserted in its paths,
AntNet will indeed perform considerably better than DV and LS. AntNet’s distinguishing features such as
scalability and robustness will demonstrate themselves much better under more realistic scenarios, rather then
the proof of principle type network considered here as a first step.
C. Swarm Routing for Wireless Networks
Existing swarm-based algorithms have been developed for wired networks and have several features
unsuitable for mobile ad hoc networks.
1. Energy
The reinforcement signal used for wired networks is the trip-time from the current node to the
destination. This could be unsuitable for wireless networks, where energy is typically an important measure of
network performance. It is thus necessary for a successful routing mechanism to be able to distribute traffic
according to energy reserves of the current and downstream nodes. For this purpose, the routing tables shown in
Table I should be modified, so that either
(a) for each destination the probabilities correspond to complete paths instead of next-hops and are affected by
the energy reserves of all the nodes of the path (Table II) or (b) the probabilities correspond to next-hops, while
also reflecting the energy reserves of the remaining nodes to reach a destination. In both (a) and (b), data packets
should still always choose the option with the highest probability.
TABLE II
MODIFIED SWARM-BASED ROUTING TABLE
Path
Destinatio
n
ABE ACE
E 0.45 0.55
F 0.75 0.25
Another issue affecting energy consumption is the dispatch rate of the ants, which, if left uncontrolled,
can become a source of significant energy drain. The rate of dispatch of ants from each node should be adjusted
according to the traffic going through that node. The rate should increase if the node serves significant traffic
and vice versa.
5. Intelligent Routing and Bandwidth Allocation in Wireless Networks
37
2. Broadcasting and Connectivity
Wireless networks possess the broadcast advantage, where one transmission by a node can reach all
the nodes in its range, assuming use of omni-directional antennas and an isotropic environment. This property
can be used both in unicast and multicast scenarios by adjusting the transmission power of the sending node,
thus affecting the network connectivity. An interesting unicast approach would be to form the routing table of
each node so that it includes all the nodes that can be reached when transmitting with maximum power. In
addition, the probabilities should reflect the transmission power to the next-hop. For example, in Table III, the
amount of time and energy required to reach node E is the same from all next-hops, but nodes B and C can be
reached with the same transmitting power while node D requires more, thus its probability of being chosen as
next-hop is smaller. This should only apply to ants, while data packets will still choose the next-hop with the
highest probability.
TABLE III
MODIFIED SWARM-BASED ROUTING TABLE
Next-Hop
Destinatio
n
B C D
E 0.4 0.4 0.2
F 0.65 0.2 0.15
For the multicast scenario, adjustments need to be made to the update of the routing tables and the
generation of the backward ants. The ants now have more than one node to visit. Thus, for the multicast tree to
be optimal, a backward ant cannot be dispatched before all the destinations have been visited. Furthermore, the
reinforcement signal should not be the remaining trip-time to a single destination, but, rather, should be the
remaining time to reach all destinations.
The above modifications are currently being incorporated into a new swarm based routing algorithm for wireless
networks.
IV. OPTIMAL TRANSMITTER POWER AND DATA RATE FOR NETWORK
COMMUNICATIONS
In this section we consider another problem of interest to satellite and sensor networks, namely
optimization of transmit power and data rate with a given bit-error rate threshold.
The relationship between the signal power at the receiver due to the transmitter (PR), and the transmitter power
(PT) is given by
P KFP r −η
, (1)
R T
Where K is a proportionality constant accounting for transmitter/receiver antenna gains and other
factors, F is the channel fading factor, PT is the transmitter power, r is the distance between the transmitter and
the receiver, and η is the channel power loss exponent.
It can be shown that the actual Bit energy to noise ratio (BENR) at the receiver, Eact, is given by
P / D W
K.F.P .r−η
T
E
ac
t
R
(2)
N0 (PI /W ) WN0D
Where the second equality follows from using Eq. (1), W is the bandwidth in Hertz, and D is the data
rate in bits per second. Let Ydes be the minimum acceptable BENR at the receiver. When Eact > Ydes the transmit
power may be decreased (to conserve power) or the data rate may be increased (to increase throughput, and
ultimately save power as well). Given that the transmitter acquires an estimate of excess BENR (Eact – Ydes) from
the receiver, the data rate or power may be adjusted to achieve optimal power control. We define optimal power
control to accomplish one of the following while minimizing Eact – Ydes and maintaining Eact > Ydes at the same
time:
1. Maximize the data rate that may be transmitted while maximizing the battery life (the life of the network
node).
2. Minimize the power required to transmit a block of data in a given time.
To accomplish either one of these goals requires optimization constrained upon the nonlinear charging
and discharging curves of power storage devices (batteries). These curves generally change during the lifetime
of the power storage device. This necessitates an optimization algorithm that operates over the lifetime of the
network node. Furthermore, even though from Eq. (2) it is clear that transmit power and data rate trade linearly,
assuming the additive white Gaussian noise channel, it is generally desirable to change the data rate rather than
transmit power due to the physical constraints of the transmit power amplifier (these amplifiers are generally
6. Intelligent Routing and Bandwidth Allocation in Wireless Networks
38
designed for a specific efficient region of operation or output power).
The tradeoff between power and data rate in the case of multipath or fading multipath (frequency
selective and non-frequency selective) channels, often incurred in wireless communication networks is
frequently nonlinear. Finding the optimum data rate and transmit power corresponds to the point in the data
rate/power plane that minimizes Eact – Ydes while maintaining Eact > Ydes. The optimization may also be extended
to include the nonlinear charging and discharging cycles of batteries. Such an optimization could be done using
exhaustive search. However, particle swarm optimization routines or other biologically inspired optimization
methods (genetic algorithms) promise far more computationally efficient solutions. In addition, they offer the
ability to optimize highly dynamic systems (real-time optimization) with input parameter variations that would
be prohibitive to incorporate in an exhaustive search, rule-based, or look-up table optimization. In particular the
investigation of distributed resource allocation in biological swarms is a key component in developing
algorithms for such optimization and holds promise for extension to multiple sensor power/data rate
optimization. Applications for such technologies include maximizing the life of a sensor network or cluster of
sensors.
V. CONCLUSION
In this paper we have presented a brief description and simple performance analysis of swarm-based
algorithms for network routing, and proposed significant modifications to them to render them suitable for ad-
hoc wireless networks. We have also formulated the problem for computing the optimal transmitter power and
data rate for satellite to ground communication. Several optimization tools are being considered for solving this
problem in real-time.
REFERENCES
[1] E. Bonabeau, M. Dorigo, and G. Théraulaz, Swarm intelligence: from natural to artificial systems,
Oxford University Press, 1999.
[2] M. Dorigo, V. Maniezzo, and A. Colorni, “The ant system: optimization by a colony of cooperating
agents,” IEEE Transactions on Systems, Man, and Cybernetics, part B, vol. 26, no. 1, pp. 29-41, 1996.
[3] R. Schoonderwoerd, O. Holland, J. Bruten and L. Rothkrantz. “Ant-based Load Balancing in
Telecommunication Networks,” Adaptive Behavior, vol. 5, pp. 169-207, 1996.
[4] S. Guerin, “Optimisation multi-agents en environnement dynamique
[5] application au routage dans les reseaux de telecommunications,” DEA Dissertation, University of
Rennes I, France, 1997
[6] D. Subramanian, P. Druschel, and J. Chen. “Ants and reinforcement learning: a case study in routing in
dynamic networks,” Proc. 1997 International Joint Conf. on Artificial Intelligence, Palo Alto, CA, pp.
832-838, 1997.
[7] M. Heusse, D. Snyers, S. Guérin, and P. Kuntz, “Adaptive agent-driven routing and load balancing in
communication network,” Proc. ANTS'98, First International Workshop on Ant Colony Optimization,
Brussels, Belgium, October 15-16, 1998.
[8] G. Di Caro and M. Dorigo, “AntNet: distributed stigmergetic control for communications networks,”
Journal of Artificial Intelligence Research, vol. 9, pp. 317-365, 1998.
[9] G. Di Caro and M. Dorigo, “AntNet: a mobile agents approach to adaptive routing”, Tech. Rep.
IRIDIA/97-12, Université Libre de Bruxelles, Belgium, 1997
[10] T. White, B. Pagurek, and F. Oppacher, “Connection management using adaptive agents,” Proc.
International Conf. on Parallel & Distributed Processing Techniques & Applications, pp. 802-809,
1998.
[11] G. Di Caro and M. Dorigo, “Extending AntNet for best effort quality-of-service routing,” Proc.
ANTS'98 - First International Workshop on Ant Colony Optimization, Brussels, Belgium, October 15-
16, 1998.
[12] E. Bonabeau, F. Henaux, S. Guerin, D. Snyers, P. Kuntz, and G. Theraulaz, “Routing in
telecommunications networks with “smart”ant-like agents,” Proc. Intelligent Agents for
Telecommunications Applications, 1998.
[13] K. Oida and M. Sekido, “An agent-based routing system for QoS guarantees”, Proc. IEEE
International Conf. on Systems, Man, and Cybernetics, Oct. 12-15, pp. 833-838, 1999.
[14] D. Bertsekas and R. Gallager. Data Networks, Prentice-Hall, 1992.
[15] J.E. Wieselthier, G.D. Nguyen, and A. Ephremides, “On the construction of energy-efficient broadcast
and multicast trees in wireless networks,” Proc. IEEE INFOCOM, vol. 2, pp. 585-594, 2000.
[16] J.E. Wieselthier, G.D. Nguyen, and A. Ephremides, “Resource-
[17] limited energy-efficient wireless multicast of session traffic,”
[18] Proc. 34th Annual Hawaii International Conf. on System Sciences,
7. Intelligent Routing and Bandwidth Allocation in Wireless Networks
39
[19] pp. 3460–3469, 2001.
[20] C.R. Kube and H. Zhang, “Stagnation recovery behaviors for collective robotics,” Proc. IEEE/RSJ/GI
International Conf. on Intelligent Robots and Systems, vol. 3, pp. 1883 –1890, 1994.
[21] K. Kawabata, T. Suzuki, T. Hayama, and H. Kobayashi, “Distributed intelligent control structure for
multi-legged walking robots,” Proc. 4th International Workshop on Advanced Motion Control, vol. 1,
pp. 231-236, 1996.
[22] T. Fukuda, D. Funato, K. Sekiyama, and F. Arai, “Evaluation on flexibility of swarm intelligent
system,” Proc. IEEE International Conf. on Robotics and Automation, vol. 4, pp. 3210-3215. 1998.
[23] K. Sugawara, M. Sano, M. Yoshihara, I. Abe, and K. Watanabe, “Foraging behavior of multi-robot
system and emergence of swarm intelligence,” Proc. 1999 IEEE International Conf. on Systems, Man,
and Cybernetics, vol. 3, pp. 257-262, 1999.
[24] A. Colorni, M. Dorigo, and V. Maniezzo, “An investigation of some properties of an ant algorithm,”
Proc. Parallel Problem Solving from Nature Conference, Brussels, Belgium, pp. 509-520, 1992.
[25] S. Lipperts and B. Kreller, “Mobile agents in telecommunications networks – a simulative approach to
load balancing,” Proc. 5th Intl. Conf. on Information Systems, Analysis and Synthesis, 1999.
[26] E.W. Dijkstra, “A note on two problems in connection with graphs,” Numeric Mathematics, vol. 1, pp.
269-271,1959.
[27] G. Navarro Varela and M.C. Sinclair, “Ant colony optimization for
[28] virtual-wavelength-path routing and wavelength allocation,”
[29] Proc. 1999 Congress on Evolutionary Computation, pp. 1809-1816, July 1999.
[30] S. Chakrabarti and A. Mishra, “QoS issues in ad hoc wireless networks,” IEEE Communication
Magazine, February 2001.