A new clustering technique based on replication for MANET routing protocolsTELKOMNIKA JOURNAL
The cluster head nodes in most mobile ad hoc networks (MANET) clustering protocols take on an extraordinary role in managing routing information. The reliability, efficiency and scalability of the clustering in MANET will ultimately be dramatically impacted. In this work we establish a new approach to form the clusters in MANET called the square cluster-based routing protocol (SCBRP). That protocol is based on the theory of replication. The goal of the protocol is to achieve reliability, availability and scalability with in the MANET. The proposed protocol is evaluated by caring the performance analysis using the NS-3 simulator. The performance shows 50% improvementin data delivering ratio in large network size, also shows an improvement in network stability and availability which is reflected in energy consumption measurements and increase in the system lifetime to 20%.
Performance of the Maximum Stable Connected Dominating Sets in the Presence o...csandit
The topology of mobile ad hoc networks
(
MANETs
)
change dynamically with time. Connected
dominating sets
(
CDS
)
are considered to be an effective topology for net
work-wide broadcasts
in MANETs as only the nodes that are part of the CD
S need to broadcast the message and the
rest of the nodes merely receive the message. Howev
er, with node mobility, a CDS does not exist
for the entire duration of the network session and
has to be regularly refreshed
(
CDS
transition
)
. In an earlier work, we had proposed a benchmarkin
g algorithm to determine a
sequence of CDSs
(
Maximum Stable CDS
)
such that the number of transitions is the global
minimum. In this research, we study the performance
(
CDS Lifetime and CDS Node Size
)
of the
Maximum Stable CDS when a certain fraction of the n
odes in the network are static and
compare the performance with that of the degree-bas
ed CDSs. We observe the lifetime of the
Maximum Stable CDS to only moderately increase
(
by a factor of 2.3
)
as we increase the
percentage of the static nodes in the network; on t
he other hand, the lifetime of the degree-based
CDS increases significantly
(
as large as 13 times
)
as we increase the percentage of static nodes
from 0 to 80
.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
A comparative analysis on qos multicast routing protocols in MANETsIOSR Journals
Abstract: Simultaneous transmission of data from one sender to multiple receivers is called multicasting.
Several widely used applications require multicasting at least at the logical level. Examples include audio video
teleconferencing, real time video streaming and the maintenance of distributed databases. In many cases it is
advantageous to implement multicasting at the level of the routing algorithm (other approaches would be oneto-all
unicast or the implementation of multicasting at the application layer). In this paper we are presenting a
comparative analysis on various multicast routing protocols in adhoc networks.
Keywords: multicasting, multicast protocols,dynamic core, performance evaluation,Qos Parameters
Haqr the hierarchical ant based qos aware on demand routing for manetscsandit
A Mobile Ad Hoc Network (MANET) is a collection of wireless mobile devices with no pre
existing infrastructure or centralized control. Supporting QoS during routing is a very
challenging task. Clustering is an effective method for resource management regarding network
performance, routing protocol design, QoS etc. In real time various types of nodes with different
computing and transmission power, different rolls and different mobility pattern may exist.
Hierarchical routing provides routing through this kind of heterogeneous nodes. In this paper,
HAQR, a novel ant based QoS aware routing is proposed on a three level hierarchical cluster
based topology in MANET which will be more scalable and efficient compared to flat
architecture and will give better throughput.
International Journal of Computational Engineering Research(IJCER) is an intentional online Journal in English monthly publishing journal. This Journal publish original research work that contributes significantly to further the scientific knowledge in engineering and Technology.
A new clustering technique based on replication for MANET routing protocolsTELKOMNIKA JOURNAL
The cluster head nodes in most mobile ad hoc networks (MANET) clustering protocols take on an extraordinary role in managing routing information. The reliability, efficiency and scalability of the clustering in MANET will ultimately be dramatically impacted. In this work we establish a new approach to form the clusters in MANET called the square cluster-based routing protocol (SCBRP). That protocol is based on the theory of replication. The goal of the protocol is to achieve reliability, availability and scalability with in the MANET. The proposed protocol is evaluated by caring the performance analysis using the NS-3 simulator. The performance shows 50% improvementin data delivering ratio in large network size, also shows an improvement in network stability and availability which is reflected in energy consumption measurements and increase in the system lifetime to 20%.
Performance of the Maximum Stable Connected Dominating Sets in the Presence o...csandit
The topology of mobile ad hoc networks
(
MANETs
)
change dynamically with time. Connected
dominating sets
(
CDS
)
are considered to be an effective topology for net
work-wide broadcasts
in MANETs as only the nodes that are part of the CD
S need to broadcast the message and the
rest of the nodes merely receive the message. Howev
er, with node mobility, a CDS does not exist
for the entire duration of the network session and
has to be regularly refreshed
(
CDS
transition
)
. In an earlier work, we had proposed a benchmarkin
g algorithm to determine a
sequence of CDSs
(
Maximum Stable CDS
)
such that the number of transitions is the global
minimum. In this research, we study the performance
(
CDS Lifetime and CDS Node Size
)
of the
Maximum Stable CDS when a certain fraction of the n
odes in the network are static and
compare the performance with that of the degree-bas
ed CDSs. We observe the lifetime of the
Maximum Stable CDS to only moderately increase
(
by a factor of 2.3
)
as we increase the
percentage of the static nodes in the network; on t
he other hand, the lifetime of the degree-based
CDS increases significantly
(
as large as 13 times
)
as we increase the percentage of static nodes
from 0 to 80
.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
A comparative analysis on qos multicast routing protocols in MANETsIOSR Journals
Abstract: Simultaneous transmission of data from one sender to multiple receivers is called multicasting.
Several widely used applications require multicasting at least at the logical level. Examples include audio video
teleconferencing, real time video streaming and the maintenance of distributed databases. In many cases it is
advantageous to implement multicasting at the level of the routing algorithm (other approaches would be oneto-all
unicast or the implementation of multicasting at the application layer). In this paper we are presenting a
comparative analysis on various multicast routing protocols in adhoc networks.
Keywords: multicasting, multicast protocols,dynamic core, performance evaluation,Qos Parameters
Haqr the hierarchical ant based qos aware on demand routing for manetscsandit
A Mobile Ad Hoc Network (MANET) is a collection of wireless mobile devices with no pre
existing infrastructure or centralized control. Supporting QoS during routing is a very
challenging task. Clustering is an effective method for resource management regarding network
performance, routing protocol design, QoS etc. In real time various types of nodes with different
computing and transmission power, different rolls and different mobility pattern may exist.
Hierarchical routing provides routing through this kind of heterogeneous nodes. In this paper,
HAQR, a novel ant based QoS aware routing is proposed on a three level hierarchical cluster
based topology in MANET which will be more scalable and efficient compared to flat
architecture and will give better throughput.
International Journal of Computational Engineering Research(IJCER) is an intentional online Journal in English monthly publishing journal. This Journal publish original research work that contributes significantly to further the scientific knowledge in engineering and Technology.
International Journal of Computational Engineering Research(IJCER) is an intentional online Journal in English monthly publishing journal. This Journal publish original research work that contributes significantly to further the scientific knowledge in engineering and Technology.
ENERGY EFFICIENT MULTICAST ROUTING IN MANET ijac journal
In this paper, we have presented the Modified Multicasting through Time Reservation using Adaptive
Control for Excellent Energy efficiency (MMC-TRACE). It is a real time multicasting architecture for
Mobile Ad-Hoc networks to make their work an energy efficient one .MMC-TRACE is a cross layer design
where the network layer and medium access control layer functionality are done in a single integrated
layer design. The basic design of the architecture is to establish and maintain an active multicast tree
surrounded by a passive mesh within a mobile ad hoc network. Energy efficiency is maximized by enabling
the particular node from sleep to awake mode while the remaining nodes of the same path are maintained
at sleep mode. Energy efficiency too achieved by eliminating most of the redundant data receptions across
nodes. The performance of MMC-TRACE are evaluated with the help of ns-2 simulations and comparisons
are made with its predecessor such as MC-TRACE. The results show that the MMC-TRACE provides
superior energy efficiency, competitive QoS performance and bandwidth efficiency.
Communication synchronization in cluster based wireless sensor network a re...eSAT Journals
Abstract A wireless sensor network is acquiring more popularity in different sectors. A scalable, low latency and energy efficient are desire challenges that should meet by wireless sensor network. Clustering permits sensors to systematically communicate among clusters. Cluster based sensor network satisfies these challenges as it provides flexible, energy saving and QoS. The communication efficiency and network performance degrades if the interaction between inter-cluster and intra-cluster communication are not managed properly. The proposed work uses two approaches to solve this problem. At aiming low packet delay and high throughput first approach uses cycle- based synchronous scheduling. By completely removing necessity of communication synchronization second approach send packets with no synchronization delay. The combined scheme can take benefit of both approaches. Keywords: Wireless sensor network, clustering, communication synchronization, QoS.
ADAPTIVE AODV ROUTING PROTOCOL FOR MOBILE ADHOC NETWORKSijasuc
Enhancing route request broadcasting efficiency in protocols constitutes a substantial part of research in
Mobile Adhoc NETwork (MANET) routing. We suggest a novel approach to constrain route request
broadcast based on mobility of nodes. This technique is best suited for networks where the movement of
the nodes is with different random velocities in different random directions. This protocol adapts itself
automatically to two mobility conditions i.e. moderate and high speed. Intuition behind this technique is
that the nodes moving with higher mobility rates will have better recent routes compared to slow moving
nodes which may not be aware of the drastic changes happening in the network .In this approach we
select the neighbourhood nodes for broadcasting route requests based on their mobility rate and recent
involvement in routing so that blind flooding of the route request in the network can be avoided.
Our contributions include: (i) Two new enhancement technique to reduce route request broadcast for
reactive ad hoc routing protocols; (ii) Implementation of Enhanced Ad-hoc On-demand Distance Vector
routing 1 (EAODV1) for moderate speed of node movement;(iii) Implementation of Enhanced Ad-hoc Ondemand Distance Vector routing 2 (EAODV2) for high speed of node movement; (iv) Implementation of
Adaptive AODV (AAODV) which automatically switches over between EAODV1 and EAODV2 based on
the mobility of the nodes. (v) An extensive simulation study of EAODV1, EAODV2 and AAODV using
Glomosim showing significant improvement in overhead, packet delivery ratio and the end-to-end delay
MULTIUSER BER ANALYSIS OF CS-QCSK MODULATION SCHEME IN A CELLULAR SYSTEM ijwmn
In recent years, chaotic communication is a hot research topic and it suits better for the emerging wireless networks because of its excellent features. Different chaos based modulation schemes have evolved, of which the CS-DCSK modulation technique provides better BER performance and bandwidth
efficiency, due to its code domain approach. The QCSK modulation technique provides double benefit: higher data rate with similar BER performance and same bandwidth occupation as DCSK. By combining the advantage of code shifted differential chaos shift keying (CS-DCSK) and Quadrature chaos shift keying (QCSK) scheme, a novel modulation scheme called code shifted Quadrature chaos shift keying (CS-QCSK) is proposed and its suitability in a multiuser scenario is tested in this paper. The analytical expressions for the bit-error rate for Multi-user CS-QCSK scheme (MU-CS-QCSK) under Rayleigh
multipath fading channel is derived. The simulation result shows that, in multiuser scenario the proposed method outperforms classical chaotic modulation schemes in terms of bit error rate (BER).
A cross layer optimized reliable multicast routing protocol in wireless mesh ...ijdpsjournal
The Optimal way to create a protocol in Wireless Mesh Networks
is to take into account a cross layer due
to the interference among wireless transmissions.
In this paper
,
w
e focus on designing and implementing
a
reliable
multicast protocol
called Me
sh Reliable Multicast Protocol (MRMP).
A
recovery tree
built
dynamically
which is joining with
the multicast routing tree.
U
sing the recovery tree
the packet losses are
repaired locally
.
This Cross layer
Technique
between network layer (
multicast routing)
and transport layer
(
reliability) using simulation
results
prove
the effectiveness
and optimization
of
cross layer
in WMNs
compare with the conventional layer
Designing an opportunistic routing scheme for adaptive clustering in mobile a...eSAT Publishing House
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology.
PERFORMANCE STUDY AND SIMULATION OF AN ANYCAST PROTOCOL FOR WIRELESS MOBILE A...ijwmn
This paper conducts a detailed simulation study of stateless anycast routing in a mobile wireless ad hoc
network. The model covers all the fundamental aspects of such networks with a routing mechanism using
a scheme of orientation-dependent inter-node communication links. The simulation system Winsim is used
which explicitly represents parallelism of events and processes in the network. The purpose of these
simulations is to investigate the effect of node’s maximum speed, and different TTL over the network
performance under two different scenarios. Simulation study investigates five practically important
performance metrics of a wireless mobile ad hoc network and shows the dependence of this metrics on
the transmission radius, link availability, and maximal possible node speed
Manets: Increasing N-Messages Delivery Probability Using Two-Hop Relay with E...ijceronline
International Journal of Computational Engineering Research(IJCER) is an intentional online Journal in English monthly publishing journal. This Journal publish original research work that contributes significantly to further the scientific knowledge in engineering and Technology.
Coverage and Connectivity Aware Neural Network Based Energy Efficient Routing...graphhoc
There are many challenges when designing and deploying wireless sensor networks (WSNs). One of the key challenges is how to make full use of the limited energy to prolong the lifetime of the network, because energy is a valuable resource in WSNs. The status of energy consumption should be continuously monitored after network deployment. In this paper, we propose coverage and connectivity aware neural network based energy efficient routing in WSN with the objective of maximizing the network lifetime. In the proposed scheme, the problem is formulated as linear programming (LP) with coverage and connectivity aware constraints. Cluster head selection is proposed using adaptive learning in neural networks followed by coverage and connectivity aware routing with data transmission. The proposed scheme is compared with existing schemes with respect to the parameters such as number of alive nodes, packet delivery fraction, and node residual energy. The simulation results show that the proposed scheme can be used in wide area of applications in WSNs.
AN EFFICIENT ROUTING PROTOCOL FOR DELAY TOLERANT NETWORKS (DTNs)cscpconf
Delay-Tolerant Networks are those which lacks continuous communications among mobile
nodes . Distributed clustering scheme and cluster-based routing protocol are used for DelayTolerant
Mobile Networks (DTMNs). The basic idea is to distributive group mobile nodes with
similar mobility pattern into a cluster, which can then interchangeably share their resources for
overhead reduction and load balancing, aiming to achieve efficient and scalable routing in DTMN. Load balancing is carried out in two ways, Intra cluster load balancing and Inter cluster load balancing. The Convergence and stability become major challenges in distributed clustering in DTMN. An efficient routing protocol will be provided for the delay tolerant networks through which the stability of the network is maintained .Based on nodal contact probabilities, a set of functions including Sync(), Leave(), and Join() are devised for cluster formation and gateway selection. Finally, the gateway nodes exchange network information and perform routing
Smart nanotechnology materials have been recently utilized in sensing applications. Carbon
nanotube (CNT) based SoC sensor systems have potential applications in various fields,
including medical, energy, consumer electronics, computers, and HVAC (heating, ventilation,
and air conditioning) among others. In this study, a nanotechnology multisensory system was
designed and simulated using Labview Software. The mathematical models were developed for
sensing three physical quantities: temperature, gas, and pressure. Four CNT groups on a chip
(two for gas sensor, one for temperature, and a fourth one for pressure) were utilized in order to
perform sensing multiple parameters. The proposed fabrication processes and the materials
used were chosen to avoid the interference of these parameters on each other when detecting
one of them. The simulation results were translated into analog voltage from Labview software,
transmitted via Bluetooth network, and received on desktop computers within the vicinity of the
sensor system. The mathematical models and simulation results showed as high as 95%
accuracy in measuring temperature, and the 5% error was caused from the interference of the surrounding gas. Within 7% change in pressure was impacted by both temperature and gas interference.
OpenFlow is one of the most commonly used protocols for communication between the
controller and the forwarding element in a software defined network (SDN). A model based on
M/M/1 queues is proposed in [1] to capture the communication between the forwarding element
and the controller. Albeit the model provides useful insight, it is accurate only for the case when
the probability of expecting a new flow is small.
Secondly, it is not straight forward to extend the model in [1] to more than one forwarding
element in the data plane. In this work we propose a model which addresses both these
challenges. The model is based on Jackson assumption but with corrections tailored to the
OpenFlow based SDN network. Performance analysis using the proposed model indicates that
the model is accurate even for the case when the probability of new flow is quite large. Further
we show by a toy example that the model can be extended to more than one node in the data plane.
Model transformation is widely recognized as a key issue in model engineering approaches. In
previous work, we have developed an ATL transformation that implements a strategy to obtain a
set of Raise Specification Language (RSL) modules from Feature Models (FM). In this paper,
we present an improvement to this strategy by defining another complementary and independent
model, allowing the incorporation of traceability information to the original transformation.
The proposed mechanism allows capturing and representing the relationships created by the
application of the transformation rules.
Majority of the computer or mobile phone enthusiasts make use of the web for searching
activity. Web search engines are used for the searching; The results that the search engines get
are provided to it by a software module known as the Web Crawler. The size of this web is
increasing round-the-clock. The principal problem is to search this huge database for specific
information. To state whether a web page is relevant to a search topic is a dilemma. This paper
proposes a crawler called as “PDD crawler” which will follow both a link based as well as a
content based approach. This crawler follows a completely new crawling strategy to compute
the relevance of the page. It analyses the content of the page based on the information contained
in various tags within the HTML source code and then computes the total weight of the page. The page with the highest weight, thus has the maximum content and highest relevance.
International Journal of Computational Engineering Research(IJCER) is an intentional online Journal in English monthly publishing journal. This Journal publish original research work that contributes significantly to further the scientific knowledge in engineering and Technology.
ENERGY EFFICIENT MULTICAST ROUTING IN MANET ijac journal
In this paper, we have presented the Modified Multicasting through Time Reservation using Adaptive
Control for Excellent Energy efficiency (MMC-TRACE). It is a real time multicasting architecture for
Mobile Ad-Hoc networks to make their work an energy efficient one .MMC-TRACE is a cross layer design
where the network layer and medium access control layer functionality are done in a single integrated
layer design. The basic design of the architecture is to establish and maintain an active multicast tree
surrounded by a passive mesh within a mobile ad hoc network. Energy efficiency is maximized by enabling
the particular node from sleep to awake mode while the remaining nodes of the same path are maintained
at sleep mode. Energy efficiency too achieved by eliminating most of the redundant data receptions across
nodes. The performance of MMC-TRACE are evaluated with the help of ns-2 simulations and comparisons
are made with its predecessor such as MC-TRACE. The results show that the MMC-TRACE provides
superior energy efficiency, competitive QoS performance and bandwidth efficiency.
Communication synchronization in cluster based wireless sensor network a re...eSAT Journals
Abstract A wireless sensor network is acquiring more popularity in different sectors. A scalable, low latency and energy efficient are desire challenges that should meet by wireless sensor network. Clustering permits sensors to systematically communicate among clusters. Cluster based sensor network satisfies these challenges as it provides flexible, energy saving and QoS. The communication efficiency and network performance degrades if the interaction between inter-cluster and intra-cluster communication are not managed properly. The proposed work uses two approaches to solve this problem. At aiming low packet delay and high throughput first approach uses cycle- based synchronous scheduling. By completely removing necessity of communication synchronization second approach send packets with no synchronization delay. The combined scheme can take benefit of both approaches. Keywords: Wireless sensor network, clustering, communication synchronization, QoS.
ADAPTIVE AODV ROUTING PROTOCOL FOR MOBILE ADHOC NETWORKSijasuc
Enhancing route request broadcasting efficiency in protocols constitutes a substantial part of research in
Mobile Adhoc NETwork (MANET) routing. We suggest a novel approach to constrain route request
broadcast based on mobility of nodes. This technique is best suited for networks where the movement of
the nodes is with different random velocities in different random directions. This protocol adapts itself
automatically to two mobility conditions i.e. moderate and high speed. Intuition behind this technique is
that the nodes moving with higher mobility rates will have better recent routes compared to slow moving
nodes which may not be aware of the drastic changes happening in the network .In this approach we
select the neighbourhood nodes for broadcasting route requests based on their mobility rate and recent
involvement in routing so that blind flooding of the route request in the network can be avoided.
Our contributions include: (i) Two new enhancement technique to reduce route request broadcast for
reactive ad hoc routing protocols; (ii) Implementation of Enhanced Ad-hoc On-demand Distance Vector
routing 1 (EAODV1) for moderate speed of node movement;(iii) Implementation of Enhanced Ad-hoc Ondemand Distance Vector routing 2 (EAODV2) for high speed of node movement; (iv) Implementation of
Adaptive AODV (AAODV) which automatically switches over between EAODV1 and EAODV2 based on
the mobility of the nodes. (v) An extensive simulation study of EAODV1, EAODV2 and AAODV using
Glomosim showing significant improvement in overhead, packet delivery ratio and the end-to-end delay
MULTIUSER BER ANALYSIS OF CS-QCSK MODULATION SCHEME IN A CELLULAR SYSTEM ijwmn
In recent years, chaotic communication is a hot research topic and it suits better for the emerging wireless networks because of its excellent features. Different chaos based modulation schemes have evolved, of which the CS-DCSK modulation technique provides better BER performance and bandwidth
efficiency, due to its code domain approach. The QCSK modulation technique provides double benefit: higher data rate with similar BER performance and same bandwidth occupation as DCSK. By combining the advantage of code shifted differential chaos shift keying (CS-DCSK) and Quadrature chaos shift keying (QCSK) scheme, a novel modulation scheme called code shifted Quadrature chaos shift keying (CS-QCSK) is proposed and its suitability in a multiuser scenario is tested in this paper. The analytical expressions for the bit-error rate for Multi-user CS-QCSK scheme (MU-CS-QCSK) under Rayleigh
multipath fading channel is derived. The simulation result shows that, in multiuser scenario the proposed method outperforms classical chaotic modulation schemes in terms of bit error rate (BER).
A cross layer optimized reliable multicast routing protocol in wireless mesh ...ijdpsjournal
The Optimal way to create a protocol in Wireless Mesh Networks
is to take into account a cross layer due
to the interference among wireless transmissions.
In this paper
,
w
e focus on designing and implementing
a
reliable
multicast protocol
called Me
sh Reliable Multicast Protocol (MRMP).
A
recovery tree
built
dynamically
which is joining with
the multicast routing tree.
U
sing the recovery tree
the packet losses are
repaired locally
.
This Cross layer
Technique
between network layer (
multicast routing)
and transport layer
(
reliability) using simulation
results
prove
the effectiveness
and optimization
of
cross layer
in WMNs
compare with the conventional layer
Designing an opportunistic routing scheme for adaptive clustering in mobile a...eSAT Publishing House
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology.
PERFORMANCE STUDY AND SIMULATION OF AN ANYCAST PROTOCOL FOR WIRELESS MOBILE A...ijwmn
This paper conducts a detailed simulation study of stateless anycast routing in a mobile wireless ad hoc
network. The model covers all the fundamental aspects of such networks with a routing mechanism using
a scheme of orientation-dependent inter-node communication links. The simulation system Winsim is used
which explicitly represents parallelism of events and processes in the network. The purpose of these
simulations is to investigate the effect of node’s maximum speed, and different TTL over the network
performance under two different scenarios. Simulation study investigates five practically important
performance metrics of a wireless mobile ad hoc network and shows the dependence of this metrics on
the transmission radius, link availability, and maximal possible node speed
Manets: Increasing N-Messages Delivery Probability Using Two-Hop Relay with E...ijceronline
International Journal of Computational Engineering Research(IJCER) is an intentional online Journal in English monthly publishing journal. This Journal publish original research work that contributes significantly to further the scientific knowledge in engineering and Technology.
Coverage and Connectivity Aware Neural Network Based Energy Efficient Routing...graphhoc
There are many challenges when designing and deploying wireless sensor networks (WSNs). One of the key challenges is how to make full use of the limited energy to prolong the lifetime of the network, because energy is a valuable resource in WSNs. The status of energy consumption should be continuously monitored after network deployment. In this paper, we propose coverage and connectivity aware neural network based energy efficient routing in WSN with the objective of maximizing the network lifetime. In the proposed scheme, the problem is formulated as linear programming (LP) with coverage and connectivity aware constraints. Cluster head selection is proposed using adaptive learning in neural networks followed by coverage and connectivity aware routing with data transmission. The proposed scheme is compared with existing schemes with respect to the parameters such as number of alive nodes, packet delivery fraction, and node residual energy. The simulation results show that the proposed scheme can be used in wide area of applications in WSNs.
AN EFFICIENT ROUTING PROTOCOL FOR DELAY TOLERANT NETWORKS (DTNs)cscpconf
Delay-Tolerant Networks are those which lacks continuous communications among mobile
nodes . Distributed clustering scheme and cluster-based routing protocol are used for DelayTolerant
Mobile Networks (DTMNs). The basic idea is to distributive group mobile nodes with
similar mobility pattern into a cluster, which can then interchangeably share their resources for
overhead reduction and load balancing, aiming to achieve efficient and scalable routing in DTMN. Load balancing is carried out in two ways, Intra cluster load balancing and Inter cluster load balancing. The Convergence and stability become major challenges in distributed clustering in DTMN. An efficient routing protocol will be provided for the delay tolerant networks through which the stability of the network is maintained .Based on nodal contact probabilities, a set of functions including Sync(), Leave(), and Join() are devised for cluster formation and gateway selection. Finally, the gateway nodes exchange network information and perform routing
Smart nanotechnology materials have been recently utilized in sensing applications. Carbon
nanotube (CNT) based SoC sensor systems have potential applications in various fields,
including medical, energy, consumer electronics, computers, and HVAC (heating, ventilation,
and air conditioning) among others. In this study, a nanotechnology multisensory system was
designed and simulated using Labview Software. The mathematical models were developed for
sensing three physical quantities: temperature, gas, and pressure. Four CNT groups on a chip
(two for gas sensor, one for temperature, and a fourth one for pressure) were utilized in order to
perform sensing multiple parameters. The proposed fabrication processes and the materials
used were chosen to avoid the interference of these parameters on each other when detecting
one of them. The simulation results were translated into analog voltage from Labview software,
transmitted via Bluetooth network, and received on desktop computers within the vicinity of the
sensor system. The mathematical models and simulation results showed as high as 95%
accuracy in measuring temperature, and the 5% error was caused from the interference of the surrounding gas. Within 7% change in pressure was impacted by both temperature and gas interference.
OpenFlow is one of the most commonly used protocols for communication between the
controller and the forwarding element in a software defined network (SDN). A model based on
M/M/1 queues is proposed in [1] to capture the communication between the forwarding element
and the controller. Albeit the model provides useful insight, it is accurate only for the case when
the probability of expecting a new flow is small.
Secondly, it is not straight forward to extend the model in [1] to more than one forwarding
element in the data plane. In this work we propose a model which addresses both these
challenges. The model is based on Jackson assumption but with corrections tailored to the
OpenFlow based SDN network. Performance analysis using the proposed model indicates that
the model is accurate even for the case when the probability of new flow is quite large. Further
we show by a toy example that the model can be extended to more than one node in the data plane.
Model transformation is widely recognized as a key issue in model engineering approaches. In
previous work, we have developed an ATL transformation that implements a strategy to obtain a
set of Raise Specification Language (RSL) modules from Feature Models (FM). In this paper,
we present an improvement to this strategy by defining another complementary and independent
model, allowing the incorporation of traceability information to the original transformation.
The proposed mechanism allows capturing and representing the relationships created by the
application of the transformation rules.
Majority of the computer or mobile phone enthusiasts make use of the web for searching
activity. Web search engines are used for the searching; The results that the search engines get
are provided to it by a software module known as the Web Crawler. The size of this web is
increasing round-the-clock. The principal problem is to search this huge database for specific
information. To state whether a web page is relevant to a search topic is a dilemma. This paper
proposes a crawler called as “PDD crawler” which will follow both a link based as well as a
content based approach. This crawler follows a completely new crawling strategy to compute
the relevance of the page. It analyses the content of the page based on the information contained
in various tags within the HTML source code and then computes the total weight of the page. The page with the highest weight, thus has the maximum content and highest relevance.
The Aviation Administration policy prohibits the use of mobile phones in Aircraft during
transition for the reason it may harm their communication system due to Electromagnetic
interference. In case the user wants to access cellular network at higher altitudes, base station
access is a problem. Large number of channels are allocated to a single user moving at high
speed by various Base Stations in the vicinity to service the request requiring more resources.
Low Altitude Platforms (LAPs) are provided in the form of Base stations in the Airships with
antennas projected upwards which has direct link with the Ground Station. LAPs using Long-
Endurance Multi-Intelligence Vehicle (LEMVs) equipped with an engine for mobility and stable
positioning against rough winds are utilized. This paper proposes a system that allows the
passengers to use their mobiles in Aircraft using LAPs as an intermediate system between
Aircraft and Ground station. As the Aircraft is dynamic, it has to change its link frequently with
the Airships, MANETs using AODV protocol is established in the prototype using NS2 to
provide the service and the results are encouraging.
A CLOUD COMPUTING USING ROUGH SET THEORY FOR CLOUD SERVICE PARAMETERS THROUGH...csandit
Cloud Computing is an awesome technology which have go ahead and annex the computing world. The development of cloud computing embed its sprouting continually in the recent era. Cloud Computing have contrived clan very lavish comfortable to perform their chore. As its fundamental defnition says that As You Pay As You Go. In this delving work talk about the cloud simulator working in our algorithm which is prepared with the help of rough set theory. The algorithm is implemented in the cloud simulator in which cloudlets, datacenters, cloud brokers are created to perform the algorithms with the help of rough sets. The Ontology is the system consists of cloud services in which cloud service discovery system is maintained. At last there is the implementation of work done using the rough set in cloud simulator using net beans and sql as back end. The net beans is loaded with the cloud Sim packages in which some of the packages are prepared according to our algorithm and gives the expected output of the optimization using rough set as a new concept.
AUTO-MOBILE VEHICLE DIRECTION IN ROAD TRAFFIC USING ARTIFICIAL NEURAL NETWORKScsandit
So far Most of the current work on this area deals with traffic volume prediction during peak hours and the reasons behind accidents only. This work presents the analysis of automobile vehicle directing in various traffic flow conditions using Artificial neural network architecture.
Now a days, due to unprecedented increase in automobile vehicular traffic especially in metro-Politian cities, it has become highly imperative that we must choose an optimum road route in accordance with our requirements. The requirements are : volume of the traffic, Distance
between source and destination, no of signals in between the source and destination, the nature of the road condition , fuel consumption and Travel Timing. Artificial Neural networks, a soft computing technique, modeled after brain biological neuron functioning, helps to obtain the
required road way or route as per the training given to it. Here we make use of Back propagation network, which changes the weights value of the hidden layers, thereby activation function value which fires the neuron to get the required output.
SINGLE FAULT DETECTION AND DIAGNOSIS TECHNIQUE FOR DIGITAL MICRO-FLUIDIC BASE...csandit
This paper presents an integrated offline testing of Single-Fault detection technique for themicro-
fluidic based biochips and also diagnosis single defects in order to achieve higherthroughput
and less time complexity of the execution process. In the field operation, this is to be used to
increase chip dependability and reusability of the biochips. In this paper, a pipelined technique
is presented to traverse all the edges in much more less time in comparison with some previous
techniques.
Stemming is the process of clipping off the affixes from the input word to obtain the respective root word, but it is not necessary that stemming provide us the genuine and meaningful root word. To overcome this problem we come up with a solution- Lemmatizer. It is the process by
which we crave out the lemma from the given word and can also add additional rules to make the clipped word a proper stem. In this paper we have created an inflectional lemmatizer which generates the rules for extracting the suffixes and also added rules for generating a proper
meaningful root word.
AN APPROACH FOR SOFTWARE EFFORT ESTIMATION USING FUZZY NUMBERS AND GENETIC AL...csandit
One of the most critical tasks during the software development life cycle is that of estimating the effort and time involved in the development of the software product. Estimation may be performed by many ways such as: Expert judgments, Algorithmic effort estimation, Machine
learning and Analogy-based estimation. In which Analogy-based software effort estimation is the process of identifying one or more historical projects that are similar to the project being developed and then using the estimates from them. Analogy-based estimation is integrated with Fuzzy numbers in order to improve the performance of software project effort estimation during
the early stages of a software development lifecycle. Because of uncertainty associated with attribute measurement and data availability, fuzzy logic is introduced in the proposed model.But hardly a historical project is exactly same as the project being estimated due to some distance associated in similarity distance. This means that the most similar project still has a
similarity distance with the project being estimated in most of the cases. Therefore, the effort needs to be adjusted when the most similar project has a similarity distance with the project being estimated. To adjust the reused effort, we build an adjustment mechanism whose
algorithm can derive the optimal adjustment on the reused effort using Genetic Algorithm. The proposed model Combine the fuzzy logic to estimate software effort in early stages with Genetic algorithm based adjustment mechanism may result to near the correct effort estimation.
Performance Evaluation of a Layered WSN Using AODV and MCF Protocols in NS-2csandit
In layered networks, reliability is a major concern
as link failures at lower layer will have a
great impact on network reliability. Failure at a l
ower layer may lead to multiple failures at the
upper layers which deteriorate the network performa
nce. In this paper, the scenario of such a
layered wireless sensor network is considered for A
d hoc On-Demand Distance Vector (AODV)
and Multi Commodity Flow (MCF) routing protocols. M
CF is
developed using
polynomial time
approximation algorithms for the failure polynomial
. Both protocols are compared in terms of
different network parameters such as throughput, pa
cket loss and end to end delay. It was
shown that the network reliability is better when M
CF protocol is used. It was also shown that
maximizing the min cut of the layered network maxim
izes reliability in the terms of successful
packet transmission of network. Thetwo routing prot
ocolsare implemented in the scenario of
discrete network event simulator NS-2.
A fuzzy inference system for assessment of the severity of the peptic ulcerscsandit
Peptic ulcer disease is the most common ulcer of an area of the gastro- intestinal tract. The aim
of this study is to utilize soft computing techniques to manage uncertainty and imprecision in
measurements related to the size, shape of the abnormality. For this, we designed a fuzzy
inference system (FIS) which emulates the process of human experts in detection and analysis of
the peptic ulcer. The proposed approach models the vagueness and uncertainty associated to
measurements of small objects in low resolution images In this study, for the first time, we
applied soft computing technique based upon fuzzy inference system (FIS) for assessment of the
severity of the peptic ulcer. Performance results reveal the FIS with maximum accuracy of
98.1%, which reveals superiority of the approach. The intelligent FIS system can help medical
experts as a second reader for detection of the peptic ulcer in the decision making process and
consequently, improves the treatment process.
An unsupervised method for real time video shot segmentationcsandit
Segmentation of a video into its constituent shots is a fundamental task for indexing and
analysis in content based video retrieval systems. In this paper, a novel approach is presented
for accurately detecting the shot boundaries in real time video streams, without any a priori
knowledge about the content or type of the video. The edges of objects in a video frame are
detected using a spatio-temporal fuzzy hostility index. These edges are treated as features of the
frame. The correlation between the features is computed for successive incoming frames of the
video. The mean and standard deviation of the correlation values obtained are updated as new
video frames are streamed in. This is done to dynamically set the threshold value using the
three-sigma rule for detecting the shot boundary (abrupt transition). A look back mechanism
forms an important part of the proposed algorithm to detect any missed hard cuts, especially
during the start of the video. The proposed method is shown to be applicable for online video
analysis and summarization systems. In an experimental evaluation on a heterogeneous test set,
consisting of videos from sports, movie songs and music albums, the proposed method achieves
99.24% recall and 99.35% precision on the average.
An unsupervised method for real time video shot segmentation
Similar to A GENERIC ALGORITHM TO DETERMINE CONNECTED DOMINATING SETS FOR MOBILE AD HOC NETWORKS AND PERFORMANCE EVALUATION UNDER DIFFERENT MOBILITY MODELS
Constructing Minimum Connected Dominating Set in Mobile Ad Hoc NetworksGiselleginaGloria
One of the most important challenges of a Mobile Ad Hoc Network (MANET) is to ensure efficient routing among its nodes. A Connected Dominating Set (CDS) is a widely used concept by many protocols for broadcasting and routing in MANETs. Those existing protocols require significant message overhead in construction of CDS. In this paper, we propose a simple, inexpensive and novel algorithm of computing a minimum CDS. The proposed algorithm saves time and message overhead in forming a CDS while supporting node mobility efficiently. Simulation results show that the proposed algorithm is efficient in terms of both message complexity and the size of the CDS.
Connectivity aware and adaptive multipath routing algorithm for mobile adhoc ...ijwmn
We propose in this paper a connectivity-aware routing algorithm and a set of related theorems. This algorithm allows nodes in Mobile Adhoc and Sensor Networks (MASNets) to provide the highest connectivity life time to a specific destination since the issuance of data becomes a necessity for MASNets. In the proposed Solution, nodes in MASNets are able to specify the disjointness degree of the available paths allowing the discovery of the optimal set of backup routes and consequently enhance the survivability of the connectivity. These nodes perform an on-demand discovery and a generation of a set of routes, by specifying a disjointness threshold, representing the maximal number of nodes shared between any two paths in the set of k established paths. The proposed multipath routing algorithm, is adaptive, secure, and uses labels to carry the disjointness-threshold between nodes during the route discovery. A set of security mechanisms, based on the Watchdog and the digital signature concepts, is used to protect the route discovery process.
AN INVERTED LIST BASED APPROACH TO GENERATE OPTIMISED PATH IN DSR IN MANETS –...Editor IJCATR
In this paper, we design and formulate the inverted list based approach for providing safer path and effective
communication in DSR protocol.Some nodes in network can participate in network more frequenctly whereas some nodes are not
participating. Because of this there is the requirement of such an approach that will take an intelligent decision regarding the sharing of
bandwidth or the resource to a node or the node group. Dynamic source routing protocol (DSR) is an on-demand, source routing
protocol , whereby all the routing information is maintained (continually updated) at mobile nodes.
An Enhanced DSR Protocol for Improving QoS in MANETKhushbooGupta145
Ad hoc network is a network without centralized administration in which different users can communicate and exchange information. In such a structure, all the nodes participate in order to achieve the network and ensure the travel of the information. Hence, multihopping techniques are used to achieve this task. The communication reliability within an ad hoc network and how the different nodes act are managed by routing protocols. Nowadays, different types of protocols exist. Nevertheless, the source routing ones, based on information known at the source of the communication, seem to attract more studies. Source routing protocols had shown interesting results in realistic scenarios in areas such as military battlefields or airport stations.
This Paper deals with DSR Protocol and is focused on the multipath aspect of this routing protocol. Since, it is necessary to understand that multipath techniques enhance reliability and can ensure security. We have simulated a new multipath algorithm. The solution had been evaluated with the network Simulator 2. Since we want to know how our protocol reacts in different mobility cases, the random waypoint model which allows us to present relevant results, due to the fact this situation is taken into account.
Simulation results show that the multipath protocol behaves better than DSR, the main actual reactive protocol. The Proposed protocol MSR performs well in high mobility by using much less overhead than DSR. Additionally, it is interesting to see that DSR without any modifications manage poorly in high mobility situation.
Comparative Simulation Study Of LEACH-Like And HEED-Like Protocols Deployed I...IOSRJECE
WSNs represents one of the most interesting research areas with deep impact on technological development because of their potential usage in a wide variety of applications such as fire monitoring, border surveillance medical care, and highway traffic coordination. Therefore, WSNs researchers have defined many routing protocols for this type of network. In this paper, we have implemented and analyzed different clustering protocols, namely LEACH, LEACH-C, LEACH-1R, and HEED using MATLAB environment. These routing protocols are compared in different terms such as residual energy, data delivery to the base station, number of rounds and live nodes
Optimised Proactive Link State Routing For DOS Attack PreventionEditor IJCATR
A Mobile Ad hoc Network is a collection of independent mobile nodes that can communicate to each other via radio waves. The mobile nodes that are in radio range of each other can directly communicate, whereas others need the aid of intermediate nodes to route their packets. Each node has a wireless interface to communicate with each other. These networks are fully distributed, and can work at any place without the help of any fixed infrastructure as access points or base stations. Routing protocols are divided into two broad classes – Reactive and Proactive. In Reactive or on demand routing protocols the routes are created only when they are needed. The application of this protocol can be seen in the Dynamic Source Routing Protocol (DSR) and the Ad-hoc On-demand Distance Vector Routing Protocol (AODV). Wherein Proactive or Table-driven routing protocols the nodes keep updating their routing tables by periodical messages. OPSR proposes a proactive mechanism in source routing.
Dynamic K-Means Algorithm for Optimized Routing in Mobile Ad Hoc Networks IJCSES Journal
In this paper, a dynamic K-means algorithm to improve the routing process in Mobile Ad-Hoc networks
(MANETs) is presented. Mobile ad-hoc networks are a collocation of mobile wireless nodes that can
operate without using focal access points, pre-existing infrastructures, or a centralized management point.
In MANETs, the quick motion of nodes modifies the topology of network. This feature of MANETS is lead
to various problems in the routing process such as increase of the overhead massages and inefficient
routing between nodes of network. A large variety of clustering methods have been developed for
establishing an efficient routing process in MANETs. Routing is one of the crucial topics which are having
significant impact on MANETs performance. The K-means algorithm is one of the effective clustering
methods aimed to reduce routing difficulties related to bandwidth, throughput and power consumption.
This paper proposed a new K-means clustering algorithm to find out optimal path from source node to
destinations node in MANETs. The main goal of proposed approach which is called the dynamic K-means
clustering methods is to solve the limitation of basic K-means method like permanent cluster head and fixed
cluster members. The experimental results demonstrate that using dynamic K-means scheme enhance the
performance of routing process in Mobile ad-hoc networks.
21 9149 simulation analysis for consistent path identification edit septianIAESIJEECS
As the demand for Mobile Ad hoc Network (MANET) applications grows, so does their use of many essential services where node consistent and stability of the communication paths are of great importance. In this scheme, we propose Simulation Analysis for Consistent Path Identification to Refine the Network Lifetime (CPIR). This technique offers more stable path and transmits the data through the consistent nodes. This article is focused on protecting the route from the inconsistent node in mobile communications to improve the network performance and reduce the energy consumption in the network. The simulation results demonstrate that CPIR provided reduce the energy utilization and improved both the longer lifetimes and increased number of packets delivered.
A MANET is an autonomous collection of mobile users that communicate over relatively bandwidth constrained wireless links. When designing mobile ad hoc networks, several interesting and difficult problems arise because of the shared nature of the wireless medium, limited transmission power (range) of wireless devices, node mobility, and battery limitations. This paper aims at providing a new schema to improve Dynamic Source Routing (DSR) Protocol. The aim
behind the proposed enhancement is to find the best route in acceptable time limit without having broadcast storm. Moreover, O-DSR enables network not only to overcome congestion but also maximize the lifetime of mobile nodes. Some simulations results show that the Route Request (RREQ) and the Control Packet Overhead decrease by 15% when O-DSR is used, consequently. Also the global energy consumption in O-DSR is lower until to 60 % , which leads to a long lifetime of the network.
Designing an opportunistic routing scheme for adaptive clustering in mobile a...eSAT Journals
Abstract Mobile networks have received great deal of attention during last few decades due to their potential applications such as large scale, improved flexibility and reduced costs. This proposed work addresses two problems associated with mobile network such as method to reduce overhead between the nodes, and energy balanced routing of packets by Co-Operative opportunistic routing for cluster based communication. We propose a modified algorithm that uses On-Demand Opportunistic Group mobility based clustering (ODOGMBC) for forming the cluster and predicting the cluster mobility by neighbourhood update algorithm. Cluster formation involves election of a mobile node as Cluster head. Each cluster comprises of cluster head and non-cluster head node that forms a cluster dynamically. Each node in the network continuously finds it neighbour by communicating with them, and nodes have consistent updated routing information in route cache by neighbourhood update algorithm. In routing process packet forwarded by the source node is updated by intermediate forwarder if topology undergo changes. This opportunistic routing scheme provides responsive data transportation and managing the node effectively, even in heavily loaded environment. Thus, our proposed routing technique helps us to reduce overhead, increases efficiency and better control of path selection. Keywords- Clustering, Forwarder, MANET, Prediction, Reactive, opportunistic routing.
Influence of Clustering on the Performance of MobileAd Hoc Networks (MANETs)Narendra Singh Yadav
Clustering is an important research area for mobile ad hoc networks (MANETs) as it increases the capacity of network, reduces the routing overhead and makes the network more scalable in the presence of both high mobility and a large number of mobile nodes. Routing protocols based on flat topology are not scalable because of their built-in characteristics. However, clustering cause overhead which consumes considerable bandwidth, drain mobile nodes energy quickly, likely cause congestion, collision and data delay in larger networks. This paper uses an implementation of the Dynamic Source Routing (DSR), an flat architecture based and the Cluster Based Routing Protocol (CBRP), a cluster architecture based routing protocol to examine the influence of clustering on the performance of mobile ad hoc networks. This paper evaluates channel utilization and control overhead as a function of number of nodes per sq. km to show the effect of clustering. Simulation results show that in high mobility scenarios, CBRP outperforms DSR. CBRP scales well with increasing number of nodes.
Performance Comparison of Different Routing Protocols for Wireless Sensor Net...ijtsrd
Wireless sensor network is a wireless network consisting of small nodes with sensing, computation, and wireless communication capabilities. One of the most important issues in Wireless sensor networks WSNs is collecting and processing data perceived from the environment and sending that data to be processed and evaluated. Routing data towards the destination node is a fundamental task in WSNs. The data exchange is supported by multihop communications. Routing protocols are in charge of discovering and maintaining the routes in the networks. In this research work, the performance of the different routing protocols in wireless sensor network based on air pollution area is derived. Sensor nodes are deployed in two types of scenario grid and random. And, simulation result outcomes are evaluated using the different routing protocols like Ad hoc On Demand Distance Vector AODV Destination Sequenced Distance Vector Routing DSDV and Dynamic Source Routing DSR in two scenarios. This system is implemented in Network Simulator NS2 . The main focus of this paper is to evaluate the performance of the different routing protocols in random scenarios. The comparison between three different routing protocols is simulated between 10, 50 and 100 nodes. Khaing Khaing Maw "Performance Comparison of Different Routing Protocols for Wireless Sensor Network in Air Pollution Area" Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-3 | Issue-5 , August 2019, URL: https://www.ijtsrd.com/papers/ijtsrd26760.pdf Paper URL: https://www.ijtsrd.com/engineering/electronics-and-communication-engineering/26760/performance-comparison-of-different-routing-protocols-for-wireless-sensor-network-in-air-pollution-area/khaing-khaing-maw
Based on Heterogeneity and Electing Probability of Nodes Improvement in LEACHijsrd.com
In heterogeneous sensor networks, certain nodes become cluster heads which aggregate the data of their cluster nodes and transfer it to the sink. An Improved Energy leach protocol for cluster head selection in a hierarchically clustered heterogeneous network to reorganize the network topology efficiently is proposed in this research work. The proposed algorithm will use thresholding to improve the cluster head selection. The presented algorithm considers the sensor nodes in wireless network and randomly distributed in the heterogeneous network. The coordinates of the sink and the dimensions of the sensor field are known in prior.
Mobile Relay Configuration in Data-Intensuive Wireless Sensor with Three Rout...IJERA Editor
Wireless sensor network are increasingly used in data-intensive applications such as micro-climate monitoring,
precision agriculture and audio/video surveillance. A key challenges faced by data-intensive wsn’s is to transmit
all the data generated with an application’s lifetime to the base station despite the fact that sensor nodes have
limited power supply. We propose using low-cost disposable mobile really and our work in the following
aspects First, it does not require complex motion planning of mobile nodes. Second we integrate the energy
consumption due to both mobility and wireless transmission. Our framework consists of first algorithm
computes an optimal routing tree. The second, we integrate the energy consumption due to both mobility and
wireless transmissions .The second algorithm improves the topology of the routing tree by greedily adding new
nodes. The third algorithm improves the routing tree by relocating its nodes without changing its topology.
Frequently forming a network topology without the use of any existing network infrastructure. We compare the
performance of the three prominent routing protocols for the mobile relay is Adhoc on Demand Distance Vector
(ADVO), Destination Sequenced Distance Vector (DSDV) and Temporally Ordered Routing Protocols (TORA).
We have chosen four performance metrics such as Average Delay, Packet Delivery Fraction, Routing load and
varying Mobility nodes, simulation for the popular routing protocols AODV, DSDV, and TORA. The
simulation is carried out on NS-2. The performance differentials are analyzed using varying network size and
simulations times. The simulation results confirm that ADVO performs well in terms of Average Delay, Packet
Delivery Fraction. As far as routing load concers TORA performs well.
A Survey of Routing Protocols for Structural Health MonitoringIJEEE
Wireless sensor networks have emerged in recent years as a promising technology that can impact the field of structural monitoring and infrastructure asset management. Various routing protocols are used to define communication among sensor nodes of the wireless sensor network for purpose of disseminating information. These routing protocols can be designed to improve the network performance in terms of energy consumption, delay and security issues. This paper discusses the requirements of routing protocol for Structural health monitoring and presents summary of various routing protocols used for WSNs for Structural health monitoring.
Similar to A GENERIC ALGORITHM TO DETERMINE CONNECTED DOMINATING SETS FOR MOBILE AD HOC NETWORKS AND PERFORMANCE EVALUATION UNDER DIFFERENT MOBILITY MODELS (20)
From the Editor's Desk: 115th Father's day Celebration - When we see Father's day in Hindu context, Nanda Baba is the most vivid figure which comes to the mind. Nanda Baba who was the foster father of Lord Krishna is known to provide love, care and affection to Lord Krishna and Balarama along with his wife Yashoda; Letter’s to the Editor: Mother's Day - Mother is a precious life for their children. Mother is life breath for her children. Mother's lap is the world happiness whose debt can never be paid.
From Slave to Scourge: The Existential Choice of Django Unchained. The Philos...Rodney Thomas Jr
#SSAPhilosophy #DjangoUnchained #DjangoFreeman #ExistentialPhilosophy #Freedom #Identity #Justice #Courage #Rebellion #Transformation
Welcome to SSA Philosophy, your ultimate destination for diving deep into the profound philosophies of iconic characters from video games, movies, and TV shows. In this episode, we explore the powerful journey and existential philosophy of Django Freeman from Quentin Tarantino’s masterful film, "Django Unchained," in our video titled, "From Slave to Scourge: The Existential Choice of Django Unchained. The Philosophy of Django Freeman!"
From Slave to Scourge: The Existential Choice of Django Unchained – The Philosophy of Django Freeman!
Join me as we delve into the existential philosophy of Django Freeman, uncovering the profound lessons and timeless wisdom his character offers. Through his story, we find inspiration in the power of choice, the quest for justice, and the courage to defy oppression. Django Freeman’s philosophy is a testament to the human spirit’s unyielding drive for freedom and justice.
Don’t forget to like, comment, and subscribe to SSA Philosophy for more in-depth explorations of the philosophies behind your favorite characters. Hit the notification bell to stay updated on our latest videos. Let’s discover the principles that shape these icons and the profound lessons they offer.
Django Freeman’s story is one of the most compelling narratives of transformation and empowerment in cinema. A former slave turned relentless bounty hunter, Django’s journey is not just a physical liberation but an existential quest for identity, justice, and retribution. This video delves into the core philosophical elements that define Django’s character and the profound choices he makes throughout his journey.
Link to video: https://youtu.be/GszqrXk38qk
Meet Crazyjamjam - A TikTok Sensation | Blog EternalBlog Eternal
Crazyjamjam, the TikTok star everyone's talking about! Uncover her secrets to success, viral trends, and more in this exclusive feature on Blog Eternal.
Source: https://blogeternal.com/celebrity/crazyjamjam-leaks/
Panchayat Season 3 - Official Trailer.pdfSuleman Rana
The dearest series "Panchayat" is set to make a victorious return with its third season, and the fervor is discernible. The authority trailer, delivered on May 28, guarantees one more enamoring venture through the country heartland of India.
Jitendra Kumar keeps on sparkling as Abhishek Tripathi, the city-reared engineer who ends up functioning as the secretary of the Panchayat office in the curious town of Phulera. His nuanced depiction of a young fellow exploring the difficulties of country life while endeavoring to adjust to his new environmental factors has earned far and wide recognition.
Neena Gupta and Raghubir Yadav return as Manju Devi and Brij Bhushan Dubey, separately. Their dynamic science and immaculate acting rejuvenate the hardships of town administration. Gupta's depiction of the town Pradhan with an ever-evolving outlook, matched with Yadav's carefully prepared exhibition, adds profundity and credibility to the story.
New Difficulties and Experiences
The trailer indicates new difficulties anticipating the characters, as Abhishek keeps on wrestling with his part in the town and his yearnings for a superior future. The series has reliably offset humor with social editorial, and Season 3 looks ready to dig much more profound into the intricacies of rustic organization and self-awareness.
Watchers can hope to see a greater amount of the enchanting and particular residents who have become fan top picks. Their connections and the one of a kind cut of-life situations give a reviving and interesting portrayal of provincial India, featuring the two its appeal and its difficulties.
A Mix of Humor and Heart
One of the signs of "Panchayat" is its capacity to mix humor with sincere narrating. The trailer features minutes that guarantee to convey giggles, as well as scenes that pull at the heartstrings. This equilibrium has been a critical calculate the show's prosperity, resounding with crowds across different socioeconomics.
Creation Greatness
The creation quality remaining parts first rate, with the beautiful setting of Phulera town filling in as a scenery that upgrades the narrating. The meticulousness in portraying provincial life, joined with sharp composition and solid exhibitions, guarantees that "Panchayat" keeps on hanging out in the packed web series scene.
Expectation and Delivery
As the delivery date draws near, expectation for "Panchayat" Season 3 is at a record-breaking high. The authority trailer has previously created critical buzz, with fans enthusiastically anticipating the continuation of Abhishek Tripathi's excursion and the new undertakings that lie ahead in Phulera.
All in all, the authority trailer for "Panchayat" Season 3 recommends that watchers are in for another drawing in and engaging ride. Yet again with its charming characters, convincing story, and ideal mix of humor and show, the new season is set to enamor crowds. Write in your schedules and prepare to get back to the endearing universe of "Panchayat."
As a film director, I have always been awestruck by the magic of animation. Animation, a medium once considered solely for the amusement of children, has undergone a significant transformation over the years. Its evolution from a rudimentary form of entertainment to a sophisticated form of storytelling has stirred my creativity and expanded my vision, offering limitless possibilities in the realm of cinematic storytelling.
Maximizing Your Streaming Experience with XCIPTV- Tips for 2024.pdfXtreame HDTV
In today’s digital age, streaming services have become an integral part of our entertainment lives. Among the myriad of options available, XCIPTV stands out as a premier choice for those seeking seamless, high-quality streaming. This comprehensive guide will delve into the features, benefits, and user experience of XCIPTV, illustrating why it is a top contender in the IPTV industry.
Tom Selleck Net Worth: A Comprehensive Analysisgreendigital
Over several decades, Tom Selleck, a name synonymous with charisma. From his iconic role as Thomas Magnum in the television series "Magnum, P.I." to his enduring presence in "Blue Bloods," Selleck has captivated audiences with his versatility and charm. As a result, "Tom Selleck net worth" has become a topic of great interest among fans. and financial enthusiasts alike. This article delves deep into Tom Selleck's wealth, exploring his career, assets, endorsements. and business ventures that contribute to his impressive economic standing.
Follow us on: Pinterest
Early Life and Career Beginnings
The Foundation of Tom Selleck's Wealth
Born on January 29, 1945, in Detroit, Michigan, Tom Selleck grew up in Sherman Oaks, California. His journey towards building a large net worth began with humble origins. , Selleck pursued a business administration degree at the University of Southern California (USC) on a basketball scholarship. But, his interest shifted towards acting. leading him to study at the Hills Playhouse under Milton Katselas.
Minor roles in television and films marked Selleck's early career. He appeared in commercials and took on small parts in T.V. series such as "The Dating Game" and "Lancer." These initial steps, although modest. laid the groundwork for his future success and the growth of Tom Selleck net worth. Breakthrough with "Magnum, P.I."
The Role that Defined Tom Selleck's Career
Tom Selleck's breakthrough came with the role of Thomas Magnum in the CBS television series "Magnum, P.I." (1980-1988). This role made him a household name and boosted his net worth. The series' popularity resulted in Selleck earning large salaries. leading to financial stability and increased recognition in Hollywood.
"Magnum P.I." garnered high ratings and critical acclaim during its run. Selleck's portrayal of the charming and resourceful private investigator resonated with audiences. making him one of the most beloved television actors of the 1980s. The success of "Magnum P.I." played a pivotal role in shaping Tom Selleck net worth, establishing him as a major star.
Film Career and Diversification
Expanding Tom Selleck's Financial Portfolio
While "Magnum, P.I." was a cornerstone of Selleck's career, he did not limit himself to television. He ventured into films, further enhancing Tom Selleck net worth. His filmography includes notable movies such as "Three Men and a Baby" (1987). which became the highest-grossing film of the year, and its sequel, "Three Men and a Little Lady" (1990). These box office successes contributed to his wealth.
Selleck's versatility allowed him to transition between genres. from comedies like "Mr. Baseball" (1992) to westerns such as "Quigley Down Under" (1990). This diversification showcased his acting range. and provided many income streams, reinforcing Tom Selleck net worth.
Television Resurgence with "Blue Bloods"
Sustaining Wealth through Consistent Success
In 2010, Tom Selleck began starring as Frank Reagan i
Are the X-Men Marvel or DC An In-Depth Exploration.pdfXtreame HDTV
The world of comic books is vast and filled with iconic characters, gripping storylines, and legendary rivalries. Among the most famous groups of superheroes are the X-Men. Created in the early 1960s, the X-Men have become a cultural phenomenon, featuring in comics, animated series, and blockbuster movies. A common question among newcomers to the comic book world is: Are the X-Men Marvel or DC? This article delves into the history, creators, and significant moments of the X-Men to provide a comprehensive answer.
In the vast landscape of cinema, stories have been told, retold, and reimagined in countless ways. At the heart of this narrative evolution lies the concept of a "remake". A successful remake allows us to revisit cherished tales through a fresh lens, often reflecting a different era's perspective or harnessing the power of advanced technology. Yet, the question remains, what makes a remake successful? Today, we will delve deeper into this subject, identifying the key ingredients that contribute to the success of a remake.
Scandal! Teasers June 2024 on etv Forum.co.zaIsaac More
Monday, 3 June 2024
Episode 47
A friend is compelled to expose a manipulative scheme to prevent another from making a grave mistake. In a frantic bid to save Jojo, Phakamile agrees to a meeting that unbeknownst to her, will seal her fate.
Tuesday, 4 June 2024
Episode 48
A mother, with her son's best interests at heart, finds him unready to heed her advice. Motshabi finds herself in an unmanageable situation, sinking fast like in quicksand.
Wednesday, 5 June 2024
Episode 49
A woman fabricates a diabolical lie to cover up an indiscretion. Overwhelmed by guilt, she makes a spontaneous confession that could be devastating to another heart.
Thursday, 6 June 2024
Episode 50
Linda unwittingly discloses damning information. Nhlamulo and Vuvu try to guide their friend towards the right decision.
Friday, 7 June 2024
Episode 51
Jojo's life continues to spiral out of control. Dintle weaves a web of lies to conceal that she is not as successful as everyone believes.
Monday, 10 June 2024
Episode 52
A heated confrontation between lovers leads to a devastating admission of guilt. Dintle's desperation takes a new turn, leaving her with dwindling options.
Tuesday, 11 June 2024
Episode 53
Unable to resort to violence, Taps issues a verbal threat, leaving Mdala unsettled. A sister must explain her life choices to regain her brother's trust.
Wednesday, 12 June 2024
Episode 54
Winnie makes a very troubling discovery. Taps follows through on his threat, leaving a woman reeling. Layla, oblivious to the truth, offers an incentive.
Thursday, 13 June 2024
Episode 55
A nosy relative arrives just in time to thwart a man's fatal decision. Dintle manipulates Khanyi to tug at Mo's heartstrings and get what she wants.
Friday, 14 June 2024
Episode 56
Tlhogi is shocked by Mdala's reaction following the revelation of their indiscretion. Jojo is in disbelief when the punishment for his crime is revealed.
Monday, 17 June 2024
Episode 57
A woman reprimands another to stay in her lane, leading to a damning revelation. A man decides to leave his broken life behind.
Tuesday, 18 June 2024
Episode 58
Nhlamulo learns that due to his actions, his worst fears have come true. Caiphus' extravagant promises to suppliers get him into trouble with Ndu.
Wednesday, 19 June 2024
Episode 59
A woman manages to kill two birds with one stone. Business doom looms over Chillax. A sobering incident makes a woman realize how far she's fallen.
Thursday, 20 June 2024
Episode 60
Taps' offer to help Nhlamulo comes with hidden motives. Caiphus' new ideas for Chillax have MaHilda excited. A blast from the past recognizes Dintle, not for her newfound fame.
Friday, 21 June 2024
Episode 61
Taps is hungry for revenge and finds a rope to hang Mdala with. Chillax's new job opportunity elicits mixed reactions from the public. Roommates' initial meeting starts off on the wrong foot.
Monday, 24 June 2024
Episode 62
Taps seizes new information and recruits someone on the inside. Mary's new job
Hollywood Actress - The 250 hottest galleryZsolt Nemeth
Hollywood Actress amazon album eminent worldwide media, female-singer, actresses, alhletina-woman, 250 collection.
Highest and photoreal-print exclusive testament PC collage.
Focused television virtuality crime, novel.
The sheer afterlife of the work is activism-like hollywood-actresses point com.
173 Illustrate, 250 gallery, 154 blog, 120 TV serie logo, 17 TV president logo, 183 active hyperlink.
HD AI face enhancement 384 page plus Bowker ISBN, Congress LLCL or US Copyright.
Skeem Saam in June 2024 available on ForumIsaac More
Monday, June 3, 2024 - Episode 241: Sergeant Rathebe nabs a top scammer in Turfloop. Meikie is furious at her uncle's reaction to the truth about Ntswaki.
Tuesday, June 4, 2024 - Episode 242: Babeile uncovers the truth behind Rathebe’s latest actions. Leeto's announcement shocks his employees, and Ntswaki’s ordeal haunts her family.
Wednesday, June 5, 2024 - Episode 243: Rathebe blocks Babeile from investigating further. Melita warns Eunice to stay clear of Mr. Kgomo.
Thursday, June 6, 2024 - Episode 244: Tbose surrenders to the police while an intruder meddles in his affairs. Rathebe's secret mission faces a setback.
Friday, June 7, 2024 - Episode 245: Rathebe’s antics reach Kganyago. Tbose dodges a bullet, but a nightmare looms. Mr. Kgomo accuses Melita of witchcraft.
Monday, June 10, 2024 - Episode 246: Ntswaki struggles on her first day back at school. Babeile is stunned by Rathebe’s romance with Bullet Mabuza.
Tuesday, June 11, 2024 - Episode 247: An unexpected turn halts Rathebe’s investigation. The press discovers Mr. Kgomo’s affair with a young employee.
Wednesday, June 12, 2024 - Episode 248: Rathebe chases a criminal, resorting to gunfire. Turf High is rife with tension and transfer threats.
Thursday, June 13, 2024 - Episode 249: Rathebe traps Kganyago. John warns Toby to stop harassing Ntswaki.
Friday, June 14, 2024 - Episode 250: Babeile is cleared to investigate Rathebe. Melita gains Mr. Kgomo’s trust, and Jacobeth devises a financial solution.
Monday, June 17, 2024 - Episode 251: Rathebe feels the pressure as Babeile closes in. Mr. Kgomo and Eunice clash. Jacobeth risks her safety in pursuit of Kganyago.
Tuesday, June 18, 2024 - Episode 252: Bullet Mabuza retaliates against Jacobeth. Pitsi inadvertently reveals his parents’ plans. Nkosi is shocked by Khwezi’s decision on LJ’s future.
Wednesday, June 19, 2024 - Episode 253: Jacobeth is ensnared in deceit. Evelyn is stressed over Toby’s case, and Letetswe reveals shocking academic results.
Thursday, June 20, 2024 - Episode 254: Elizabeth learns Jacobeth is in Mpumalanga. Kganyago's past is exposed, and Lehasa discovers his son is in KZN.
Friday, June 21, 2024 - Episode 255: Elizabeth confirms Jacobeth’s dubious activities in Mpumalanga. Rathebe lies about her relationship with Bullet, and Jacobeth faces theft accusations.
Monday, June 24, 2024 - Episode 256: Rathebe spies on Kganyago. Lehasa plans to retrieve his son from KZN, fearing what awaits.
Tuesday, June 25, 2024 - Episode 257: MaNtuli fears for Kwaito’s safety in Mpumalanga. Mr. Kgomo and Melita reconcile.
Wednesday, June 26, 2024 - Episode 258: Kganyago makes a bold escape. Elizabeth receives a shocking message from Kwaito. Mrs. Khoza defends her husband against scam accusations.
Thursday, June 27, 2024 - Episode 259: Babeile's skillful arrest changes the game. Tbose and Kwaito face a hostage crisis.
Friday, June 28, 2024 - Episode 260: Two women face the reality of being scammed. Turf is rocked by breaking
2. 240 Computer Science & Information Technology (CS & IT)
to be on-demand in nature rather than using a proactive strategy of determining the routes
irrespective of the need [1][2]. MANET on-demand routing protocols typically use a network-
wide broadcast route-reply cycle (called flooding) to discover the appropriate communication
topology (path, tree or mesh) [2]. A source node initiates the flooding of the Route-Request
(RREQ) packets that propagate through several paths and reach the targeted destination (for
unicasting) or receiver nodes (for multicasting). These nodes choose the path that best satisfies
the principles of the routing protocol in use and respond with a Route-Reply (RREP) packet to the
source on the selected route. With flooding, every node in the network is required to broadcast the
RREQ packet exactly once in its neighborhood. Nevertheless, the redundancy of retransmissions
and the resulting control overhead incurred with flooding is still too high, as every node spends
energy and bandwidth to receive the RREQ packet from each of its neighbors.
A Connected Dominating Set (CDS) of a network graph comprises of a subset of the nodes such
that every node in the graph is either in the CDS or is a neighbor of a node in the CDS. Recent
studies (e.g. [3][4]) have shown the CDS to be a viable backbone for network-wide broadcasting
of a message (such as the RREQ message), initiated from one node. The message is broadcast
only by the CDS nodes (nodes constituting the CDS) and the non-CDS nodes (who are neighbors
of the CDS nodes) merely receive the message, once from each of their neighboring CDS nodes.
The efficiency of broadcasting depends on the CDS Node Size that directly influences the number
of redundant retransmissions. One category of CDS algorithms for MANETs aim to determine
CDSs with reduced Node Size (i.e., constituent nodes) such that whole network could be covered
with as fewer nodes as possible. The other two categories of CDS algorithms are those based on
node ids and those based on stability. The node-id based algorithm prefers to include nodes with
lower id into the CDS until all the nodes in the network are covered. The stability-based category
of CDS algorithms focus on maximizing the CDS Lifetime such that the control overhead
incurred in frequently reconfiguring a CDS is reduced.
In this paper, we first present a generic algorithm that can be used to obtain a CDS under each of
the above three categories. We pick the maximum density-based CDS (MaxD-CDS) [5] and ID-
based CDS (ID-CDS) [6] to be representatives of the minimum node size and node id-based CDS
algorithms respectively; the minimum velocity-based CDS (MinV-CDS) [7] algorithm is chosen
to be the representative for the stability-driven CDS. The second half of the paper evaluates the
three CDS algorithms under diverse conditions of network density and node mobility with respect
to two critical metrics: CDS Lifetime and CDS Node Size, and under three different mobility
models. The mobility models considered are the Random Waypoint model [8] that is often used
to simulate the mobility of nodes in classical MANETs; and the City Section [9] and Manhattan
[9] mobility models that are used to simulate the mobility of nodes in vehicular ad hoc networks
(VANETs). This is the first such comprehensive comparison study of the CDS algorithms for ad
hoc networks under different mobility models. The paper also identifies any potential CDS
lifetime-node size tradeoff existing for the three categories of CDS algorithms.
The rest of the paper is organized as follows: Section 2 presents a generic CDS algorithm that can
be used to study each of the three CDS algorithms (MaxD-CDS, ID-CDS and MinV-CDS) that
will be analyzed in the simulations. Section 3 outlines the simulation environment, discusses the
mobility models and presents the simulation results observed for the three CDS algorithms under
the three mobility models. Section 4 presents the conclusions by outlining the significant
observations and contributions of this paper. Throughout the report, the terms ‘vertex’ and ‘node’,
‘edge’ and ‘link’ are used interchangeably. They mean the same.
3. Computer Science & Information Technology (CS & IT) 241
2. GENERIC ALGORITHM TO CONSTRUCT THE DIFFERENT
CONNECTED DOMINATING SETS
In this section, we present a generic algorithm that can be used to construct the four different
CDSs, with appropriate changes in the data structure (Priority-Queue) used to store the list of
covered nodes that could be the candidate CDS nodes and the use of the appropriate criteria in
each of the iterations of the algorithm to evolve the particular CDS of interest. The advantage
with proposing a generic algorithm is that the different CDSs can be constructed with virtually
the same time complexity.
Network Model: We assume a homogeneous network of wireless nodes, each operating at a fixed
transmission range, R. We use the unit-disk graph model [10] according to which there exists a
link between any two nodes in the network as long as the Euclidean distance is within the
transmission range per node. The set of neighbors of a node i, Neighbors(i), comprises of nodes
that are connected to vertex i in the unit-disk graph model. A node learns about its own location
through location service schemes such as the Global Positioning System (GPS) [11]. A node
learns the location and mobility parameters (velocity and direction of movement – measured as
the angle subscribed with respect to the positive X-axis) of its neighbor nodes through the beacon
messages periodically broadcast by their nodes in the neighborhood.
Data Structures: The data structures used by the generic CDS algorithm is as follows: (i) CDS-
Nodes-List: This list includes all the nodes that are part of the CDS. (ii) Covered-Nodes-List:
This list includes all the nodes that are either part of the CDS or is at least a neighbor node of a
node in the CDS; (iii) Priority-Queue: This list includes all nodes in the Covered-Nodes-List (but
not in the CDS-Nodes-List) and are considered the candidate nodes for the next node to be
selected for inclusion in the CDS-Nodes-List. To be placed in the priority queue, a node should
have at least one uncovered neighbor. Nodes are placed in the Priority-Queue in the decreasing
order of node density and node ID for the MaxD-CDS and ID-CDS algorithms respectively and
in the increasing order of node velocity for the MinV-CDS algorithm. Any tie between the nodes
is broken based on the node IDs (the contending node with a relatively larger ID is placed ahead
of the other contending nodes).
Description of Generic CDS Algorithm: The algorithm forms and outputs a list (CDS-Node-List)
of all nodes based on a given input graph representing a snapshot of the MANET at a particular
time instant. The generic description and pseudo code given here (Figure 1) can be adapted for
the particular CDS construction by appropriately incorporating the criteria for choosing the CDS-
Select-node for each of the iterations and the criteria for maintaining the Priority-Queue during
the different iterations of the algorithm on a particular instance of the network graph.
The node to be included in the CDS-Node-List is the CDS-Select-node at the front of the Priority-
Queue, chosen according to the selection criteria of largest node density (MaxD-CDS) or largest
node ID (ID-CDS) or minimum node velocity (MinV-CDS), as long as the node has at least one
uncovered neighbor. The uncovered neighbors of the CDS node are also added to the Covered-
Nodes-List and the Priority-Queue. If the Covered-Nodes-List does not contain all the vertices of
the input graph and the Priority-Queue is not empty, we dequeue the Priority-Queue to extract a
CDS-Select-node s that is not yet in the CDS-Node-List. All the uncovered neighbor nodes of
node s are added to the Covered-Nodes-List and to the Priority-Queue; node s is also added to the
4. 242 Computer Science & Information Technology (CS & IT)
CDS-Node-List. This procedure is repeated until the Covered-Nodes-List contains all the vertices
of the graph or the Priority-Queue becomes empty. If the Priority-Queue becomes empty and the
Covered-Nodes-List does not have at least one node that is present in the network graph, then the
underlying network is considered to be disconnected.
Figure 1: Pseudo Code for the Generic CDS Construction Algorithm
The time complexity of the generic CDS algorithm can be given as: Θ((|E| + |V|)*log|V|) on a
network graph of |V| nodes and |E| edges – each of the |V| nodes and their associated edges have to
be explored for inclusion in the CDS. If the Priority-Queue is implemented as a binary heap, it
takes Θ(log|V|) time to reorganize the heap after each dequeue and enqueue operation. There
could be a total of |V| dequeue operations, one for each of the iterations and a total of |E| enqueue
operations, one for every edge that is traversed across all the iterations.
3. SIMULATIONS
The network dimensions are 1000m x 1000m. Each node moves independent of the other nodes
under all the three mobility models. The Random Waypoint (RWP) model works by assuming an
open network field without any grid constraints. Each node moves randomly from one location to
5. Computer Science & Information Technology (CS & IT) 243
another location (within the network boundary) with a velocity randomly chosen from [0…vmax],
where vmax is the maximum node velocity. After reaching the targeted location, the node continues
to move to another randomly chosen location with a different randomly chosen velocity. The
mobility pattern of a node is repeated like this until the end of the simulation.
For the City Section and Manhattan mobility models, the network is divided into grids: square
blocks of length (side) 100m, composed of a number of horizontal and vertical streets. Each street
has two lanes, one for each direction. A node is allowed to move only along the grids of
horizontal and vertical streets. With the City Section model, nodes move from one street
intersection to a randomly chosen different street intersection on the shortest path (sequence of
street intersections with minimum total distance) with a randomly chosen velocity from [0…vmax];
after reaching the targeted the street intersection, the node continues to move to another randomly
chosen street intersection (on the shortest path) with a randomly chosen velocity. With the
Manhattan model, the velocity (chosen from 0… vmax) and direction to move is decided for every
street intersection that is come across. If a node can continue to move in the same direction or can
also change directions, the node has 50% chance of continuing in the same direction, 25% chance
of turning to east/north and 25% chance of turning to the west/south, depending on the direction
of the previous movement. If a node has only two options, then the node has an equal (50%)
chance of exploring either of the two options. If a node has only one option to move (this occurs
when the node reaches any of the four corners of the network), then the node has no other choice
except to explore that option. Simulations are conducted for grid block lengths (BL) of 50m,
100m and 200m. The wireless transmission range of a node is 250m.
The network density is varied by performing the simulations with 50 (low-moderate) and 100
(moderate-high) nodes. The vmax values used for each of the three mobility models are 5 m/s
(about 10 miles per hour) and 50 m/s (about 100 miles per hour), representing levels of low and
high node mobility respectively. The pause time is 0 seconds; so, all the nodes are constantly in
motion. Each data point in the performance figures shown in this section is an average computed
over 5 mobility trace files and 20 randomly selected s-d pairs from each of the mobility trace
files. The starting time of each s-d session is uniformly distributed between 1 to 20 seconds.
Overall Simulation Methodology: For each mobility model, snapshots (static graphs) of the
network topology are constructed for every 0.25 seconds, starting from time 0 to the simulation
time of 1000 seconds. If a CDS is not known at a particular time instant, the appropriate CDS
construction algorithm is run on the network snapshot. The CDS determined at a particular time
instant is used in the subsequent time instants until the CDS ceases to exist. For a CDS to be
considered to exist at a particular time instant, two conditions have to hold good: (i) All the CDS
nodes have to stay connected – i.e. reachable from one another directly or through multi-hop
paths; and (ii) Every non-CDS node should have at least one CDS node as its neighbor. If a CDS
ceases to exist at a particular time instant, the appropriate CDS construction algorithm is again
run and the new CDS is continued to be used as explained above. This procedure is continued for
the duration of the simulation time.
Performance Metrics: The following two performance metrics are measured under the three
mobility models: (i) Effective CDS Lifetime: The product of the absolute CDS lifetime (observed
from the simulations) and the CDS connectivity. (ii) CDS Node Size: This is a time-averaged
value for the number of nodes that are part of the CDS used for every time instant over the entire
simulation.
6. 244 Computer Science & Information Technology (CS & IT)
City Section vs. Random Waypoint Manhattan vs. Random Waypoint
Figure 2: Effective CDS Lifetime [50 nodes, vmax = 5 m/s]
City Section vs. Random Waypoint Manhattan vs. Random Waypoint
Figure 3: CDS Node Size [50 nodes, vmax = 5 m/s]
Effective MaxD-CDS Lifetime: The MaxD-CDS incurs the largest lifetime under the RWP
model (followed by the Manhattan model) for all the four simulation conditions. For a given
simulation condition, it is observed that the difference in the effective MaxD-CDS lifetime
incurred with the two VANET mobility models decreases with increase in the block length (from
50m to 200m). It is also observed that for a given block length and node mobility, for most of the
simulation conditions, the absolute values for the effective MaxD-CDS lifetime decreases with
increase in network density. For both the VANET mobility models, it is observed that the
effective MaxD-CDS lifetime decreases with increase in the block length from 50m to 200m.
This could be attributed to the nature of the MaxD-CDS algorithm to include only as minimal
nodes as possible in the CDS; with a larger block length, even though the number of nodes
constituting the MaxD-CDS reduces, the physical distance between the edges that are part of the
CDS edges increases. As a result, a MaxD-CDS is more vulnerable to failure when operated in a
VANET grid of larger block length.
MaxD-CDS Node Size: The MaxD-CDS incurs the lowest value for the node size under the
RWP model for 3 of the 4 simulation conditions (except for the condition of low-moderate
density and low node mobility). Thus, it is possible to simultaneously maximize the MaxD-CDS
lifetime as well as minimize the node size when operated under the RWP model; there is no
significant tradeoff. Between the two VANET mobility models, the MaxD-CDS is observed to
sustain a lower node size for the City Section model. This indicates a CDS lifetime-node size
7. Computer Science & Information Technology (CS & IT) 245
tradeoff between the two VANET mobility models. Under a given simulation condition, the
MaxD-CDS incurs a larger effective CDS lifetime under the Manhattan model; but, this is
accompanied by a larger CDS node size. The relative difference in the MaxD-CDS node size
between the Manhattan and City Section models could be as large as 25%, and the relative
difference decreases with increase in the grid block length from 50m to 200m. For the RWP
model, as the network density is doubled from 50 to 100 nodes for a given mobility level, the
MaxD-CDS node size decreases by about 10-25%. This decrease, rather than an increase that is
typically expected, could be attributed to the nature of the MaxD-CDS algorithm to include only
those nodes as part of the CDS so that as many non-CDS nodes could be covered as possible. The
negative impact of this greedy approach is observed in the effective CDS lifetime that decreases
with increase in network density, due to the need to cover an increased number of non-CDS
nodes with a reduced number of CDS nodes at high network density. The MaxD-CDS node size
is not significantly affected with increase in network density under the two VANET mobility
models.
City Section vs. Random Waypoint Manhattan vs. Random Waypoint
Figure 4: Effective CDS Lifetime [100 nodes, vmax = 5 m/s]
City Section vs. Random Waypoint Manhattan vs. Random Waypoint
Figure 5: CDS Node Size [100 nodes, vmax = 5 m/s]
Effective ID-CDS Lifetime: The ID-CDS incurs a larger effective lifetime under the two
VANET mobility models compared to the RWP model under all the simulation conditions. The
effective ID-CDS lifetime was the largest under the Manhattan model (with a block length of
50m) for 3 of the 4 operating conditions and under the City Section model (block length of 50 and
200m) in scenarios with low-moderate network density and moderate-high node mobility.
Overall, it is also observed that for the two VANET models, the effective ID-CDS lifetime
decreases with increase in the grid block length from 50m to 200m.
8. 246 Computer Science & Information Technology (CS & IT)
City Section vs. Random Waypoint Manhattan vs. Random Waypoint
Figure 6: Effective CDS Lifetime [50 nodes, vmax = 50 m/s]
City Section vs. Random Waypoint Manhattan vs. Random Waypoint
Figure 7: CDS Node Size [50 nodes, vmax = 50 m/s]
ID-CDS Node Size: The ID-CDS exhibits a significant lifetime-node size tradeoff. The ID-CDS
node size is the lowest under the RWP model and is the largest under the Manhattan model that
also yielded the largest effective ID-CDS lifetime. Thus, it is not possible to simultaneously
maximize the effective ID-CDS lifetime by incurring a lower node size under any mobility
model. The ratio of the maximum ID-CDS node size to that of the minimum node size ranges
from 1.2 to 1.8; the difference increases with increase in the network density and/or node
mobility. Between the two VANET mobility models, the ID-CDS node size is larger when run
the Manhattan mobility model compared to the City Section model. Another interesting
observation is that the grid block length does not significantly impact the ID-CDS node size
under both the VANET mobility models.
Effective MinV-CDS Lifetime: The MinV-CDS incurs the largest effective lifetime under the
RWP model for all the simulation conditions. The difference in the effective MinV-CDS lifetime
between the RWP model and that of the two VANET mobility models decreases with increase in
the network density (for a fixed node mobility) and increases with increase in node mobility (for a
fixed network density). Between the two VANET mobility models, it is observed that the
effective MinV-CDS lifetime incurred under the Manhattan model is greater (by about 20%) than
that incurred under the City Section model in low-moderate network density and low-moderate
node mobility scenarios. With increase in the network density and/or node mobility, the effective
MinV-CDS lifetime incurred under the City Section model is larger (at most by about 25%)
compared to that incurred under the Manhattan model. The grid block length significantly
influences the effective MinV-CDS lifetime under both the VANET mobility models. The
9. Computer Science & Information Technology (CS & IT) 247
effective MinV-CDS lifetime incurred under a grid block length of 50m could be as large as twice
the grid block lengths of 100m and 200m. This could be attributed to the presence of physically
longer edges in the MinV-CDS determined under larger values of the grid block lengths.
City Section vs. Random Waypoint Manhattan vs. Random Waypoint
Figure 8: Effective CDS Lifetime [100 nodes, vmax = 50 m/s]
City Section vs. Random Waypoint Manhattan vs. Random Waypoint
Figure 9: CDS Node Size [100 nodes, vmax = 50 m/s]
MinV-CDS Node Size: The MinV-CDS node size is the lowest under the RWP model for all the
simulation conditions. Thus, one could obtain a larger MinV-CDS lifetime and a lower MinV-
CDS node size when operated under the RWP model. The difference (ranging from 25% to
100%) in the MinV-CDS node size incurred with the RWP model and the two VANET mobility
models increases predominantly with increase in the network density and with increase in the grid
block length. Between the two VANET mobility models, it is observed that the MinV-CDS node
size is larger when run under the Manhattan mobility model for all the simulation conditions, with
the difference increasing with increase in network density and/or node mobility. For a given
condition of network density and node mobility, the difference in the MinV-CDS node size
decreases with increase in the grid block length from 50m to 200m. Between the two VANET
mobility models, it is possible to simultaneously optimize both the MinV-CDS lifetime and the
node size when operated under the City Section model vis-à-vis the Manhattan model.
4. CONCLUSIONS
The MinV-CDS incurs the largest effective lifetime under all the three mobility models; and at
the same time incurs the largest node size, indicating a CDS lifetime-node size tradeoff. The
MaxD-CDS and MinV-CDS incur the largest effective lifetime and lowest node size under the
RWP model vis-à-vis the two VANET mobility models. On the other hand, the ID-CDS incurs
the largest effective lifetime under the VANET mobility models (predominantly with the
10. 248 Computer Science & Information Technology (CS & IT)
Manhattan model) and the lowest node size with the RWP model. Thus, there is a CDS lifetime-
node size tradeoff with respect to using an appropriate mobility model for the ID-CDS. With
regards to the two VANET mobility models, the MaxD-CDS and ID-CDS yielded the largest
effective lifetime under the Manhattan model for most of the simulation conditions; whereas the
MinV-CDS yielded the largest effective lifetime under the City Section model for a majority of
the simulation conditions. On the other hand, all the three connected dominating sets sustained a
larger CDS node size under the Manhattan mobility model compared to the City Section model.
This illustrates a CDS lifetime – node size tradeoff for the MaxD-CDS and ID-CDS with respect
to the choice of usage between the two VANET mobility models. With regards to the impact of
the grid block length on the stability of the connected dominating sets, one can conclude that the
lower grid block lengths yielded more stable connected dominating sets compared to larger grid
block lengths. Also, there is no appreciable increase in the CDS node size when operated at lower
grid block lengths for all the three CDS algorithms under both the VANET mobility models.
REFERENCES
[1] Broch, J., Maltz, D. A., Johnson, D. B., Hu, Y. C., and Jetcheva, J.: A Performance Comparison of
Multi-hop Wireless Ad hoc Network Routing Protocols. In: International Conference on Mobile
Computing and Networking, pp. 85--97, ACM, Dallas, USA (1998)
[2] Siva Ram Murthy, C., and Manoj, B. S.: Ad hoc Wireless Networks – Architectures and Protocols,
Prentice Hall, USA (2004).
[3] Sinha, P., Sivakumar, R., and Bhargavan. V.: Enhancing Ad hoc Routing with Dynamic Virtual
Infrastructures. In: The 20th International Conference on Computer and Communications Societies,
pp. 1763--1772, IEEE, Anchorage, Alaska, USA (2001).
[4] Wang, F., Min, M., Li, Y., and Du, D.: On the Construction of Stable Virtual Backbones in Mobile
Ad hoc Networks. In: The International Performance Computing and Communications Conference
(IPCCC), IEEE, Phoenix, Arizona, USA (2005).
[5] Meghanathan, N.: An Algorithm to Determine the Sequence of Stable Connected Dominating Sets in
Mobile Ad Hoc Networks. In: The 2nd Advanced International Conference on Telecommunications,
IARIA, French Caribbean (2006).
[6] Velummylum, N., and Meghanathan, N.: On the Utilization of ID-based Connected Dominating Sets
for Mobile Ad hoc Networks, International Journal of Advanced Research in Computer Science, 1, 3,
36--43 (2010).
[7] Meghanathan, N.: An Algorithm to Determine Minimum Velocity-based Stable Connected
Dominating Sets for Ad hoc Networks, Communications in Computer and Information Science
Series, 94, 206--217 (2010).
[8] Bettstetter, C., Hartenstein, H., and Perez-Costa, X.: Stochastic Properties of the Random-Way Point
Mobility Model, Wireless Networks, 10, 5, 555--567 (2004).
[9] Camp, T., Boleng, J., and Davies, V.: A Survey of Mobility Models for Ad hoc Network Research,
Wireless Communication and Mobile Computing, 2, 5, 483--502 (2002).
[10] Kuhn, F., Moscibroda, T., and Wattenhofer, R.: Unit Disk Graph Approximation. In: The Workshop
on Foundations of Mobile Computing, Philadelphia, USA (2004).
[11] Hofmann-Wellenhof, B., Lichtenegger, H., and Collins, J.: Global Positioning System: Theory and
Practice, Springer Wien, New York, USA (2004).