This paper compares the impact of mobile node arrival patterns in mobile ad hoc networks (MANETs) using Poisson and Pareto distribution models. Through MATLAB simulations, the study investigates how the arrival rate and size of the mobile node population are affected by these distributions. The results indicate that higher arrival rates can influence larger mobile node populations in a given area. Additionally, the Pareto distribution is found to better model mobile node mobility in MANETs compared to the Poisson distribution.
THE IMPACT OF MOBILE NODES ARRIVAL PATTERNS IN MANETS USING POISSON MODELSIJMIT JOURNAL
Mobile Ad hoc Networks (MANETs) are dynamic networks populated by mobile stations, or mobile nodes
(MNs). Specifically, MANETs consist of a collection of nodes randomly placed in a line (not necessarily
straight). MANETs do appear in many real-world network applications such as a vehicular MANETs built
along a highway in a city environment or people in a particular location. MNs in MANETs are usually
laptops, PDAs or mobile phones. These devices may use Bluetooth and/or IEEE 802.11 (Wi-Fi) network
interfaces and communicate in a decentralized manner. Mobility is a key feature of MANETs. Each node
may work as a router and the network can dynamically change with time; when new nodes can join, and
other nodes can leave the network.
This paper presents comparative results that have been carried out via Matlab software simulation. The
study investigates the impact of mobile nodes’ parameters such as the speed, the arrival rate and the size of
mobile nodes in a given area using Poisson distribution. The results have indicated that mobile nodes’
arrival rates may have influence on MNs population (as a larger number) in a location.
Derivative threshold actuation for single phase wormhole detection with reduc...ijdpsjournal
Communication in mobile Ad hoc networks is completed via multi
-
hop ways. Owing to the distributed
specification and restricted resource of nodes, MANET is a lot prone
to wormhole attacks i.e. wormhole
attacks place severe threats to each Ad hoc routing protocol and a few security enhancements. Thus,
so as
to discover wormholes, totally different techniques are in use. In all those techniques fixation of
threshold
is mer
ely by trial & error methodology or by random manner. Conjointly wormhole detection is in twin
part by putting the nodes that is higher than the edge in a suspicious set, however predicting the n
ode as a
wormhole by using some other algorithms. Our aim in
this paper is to deduce the traffic threshold level by
derivational approach for identifying wormholes in a very single phase in relay network having dissi
milar
characteristics.
Mobility models for delay tolerant network a surveyijwmn
Delay Tolerant Network (DTN) is an emerging networking technology that is widely used in the
environment where end-to-end paths do not exist. DTN follows store-carry-forward mechanism to route
data. This mechanism exploits the mobility of nodes and hence the performances of DTN routing and
application protocols are highly dependent on the underlying mobility of nodes and its characteristics.
Therefore, suitable mobility models are required to be incorporated in the simulation tools to evaluate DTN
protocols across many scenarios. In DTN mobility modelling literature, a number of mobility models have
been developed based on synthetic theory and real world mobility traces. Furthermore, many researchers
have developed specific application oriented mobility models. All these models do not provide accurate
evaluation in the all scenarios. Therefore, model selection is an important issue in DTN protocol
simulation. In this study, we have summarized various widely used mobility models and made a comparison
of their performances. Finally, we have concluded with future research directions in mobility modelling for
DTN simulation.
An Opportunistic AODV Routing Scheme : A Cognitive Mobile Agents Approachijasuc
In Manet’s Dynamics and Robustness are the key features of the nodes and are governed by several routing protocols such as AODV, DSR and so on. However in the network the growing resource demand leads to resource scarcity. The Node Mobility often leads to the link breakages and high routing overhead
decreasing the stability and reliability of the network connectivity. In this context, the paper proposes a novel opportunistic AODV routing scheme which implements a cognitive agent based intelligent technique to set up a stable connectivity over the Manet. The Scheme computes the routing metric (rf) based on the collaboration sensitivity levels of the nodes obtained based through the knowledge-based decision. This Routing Metric is subsequently used to set up the stable path for network connectivity. Thus minimizes the route overhead and increases the stability of the path. The Performance evaluation is conducted in comparison with the AODV and sleep AODV routing protocol and validated.
AN GROUP BEHAVIOR MOBILITY MODEL FOR OPPORTUNISTIC NETWORKS csandit
Mobility is regarded as a network transport mechanism for distributing data in many networks.
However, many mobility models ignore the fact that peer nodes often carried by people and
thus move in group pattern according to some kind of social relation. In this paper, we propose
one mobility model based on group behavior character which derives from real movement
scenario in daily life. This paper also gives the character analysis of this mobility model and
compares with the classic Random Waypoint Mobility model.
A ROUTING MECHANISM BASED ON SOCIAL NETWORKS AND BETWEENNESS CENTRALITY IN DE...ijcsit
With the growing popularity of mobile smart devices, the existing networks are unable to meet the requirement of many complex scenarios; current network architectures and protocols do not work well with the network with high latency and frequent disconnections. To improve the performance of these networks some scholars opened up a new research field, delay-tolerant networks, in which one of the important
research subjects is the forwarding and routing mechanism of data packets. This paper presents a routing
scheme based on social networks owing to the fact that nodes in computer networks and social networks
have high behavioural similarity. To further improve efficiency this paper also suggests a mechanism,which is the improved version of an existing betweenness centrality based routing algorithm [1]. The experiments showed that the proposed scheme has better performance than the existing friendship routing algorithms.
MODELING SOCIAL GAUSS-MARKOV MOBILITY FOR OPPORTUNISTIC NETWORK csandit
Mobility is attracting more and more interests due to its importance for data forwarding
mechanisms in many networks such as mobile opportunistic network. In everyday life mobile
nodes are often carried by human. Thus, mobile nodes’ mobility pattern is inevitable affected by
human social character. This paper presents a novel mobility model (HNGM) which combines
social character and Gauss-Markov process together. The performance analysis on this
mobility model is given and one famous and widely used mobility model (RWP) is chosen to
make comparison..
THE IMPACT OF MOBILE NODES ARRIVAL PATTERNS IN MANETS USING POISSON MODELSIJMIT JOURNAL
Mobile Ad hoc Networks (MANETs) are dynamic networks populated by mobile stations, or mobile nodes
(MNs). Specifically, MANETs consist of a collection of nodes randomly placed in a line (not necessarily
straight). MANETs do appear in many real-world network applications such as a vehicular MANETs built
along a highway in a city environment or people in a particular location. MNs in MANETs are usually
laptops, PDAs or mobile phones. These devices may use Bluetooth and/or IEEE 802.11 (Wi-Fi) network
interfaces and communicate in a decentralized manner. Mobility is a key feature of MANETs. Each node
may work as a router and the network can dynamically change with time; when new nodes can join, and
other nodes can leave the network.
This paper presents comparative results that have been carried out via Matlab software simulation. The
study investigates the impact of mobile nodes’ parameters such as the speed, the arrival rate and the size of
mobile nodes in a given area using Poisson distribution. The results have indicated that mobile nodes’
arrival rates may have influence on MNs population (as a larger number) in a location.
Derivative threshold actuation for single phase wormhole detection with reduc...ijdpsjournal
Communication in mobile Ad hoc networks is completed via multi
-
hop ways. Owing to the distributed
specification and restricted resource of nodes, MANET is a lot prone
to wormhole attacks i.e. wormhole
attacks place severe threats to each Ad hoc routing protocol and a few security enhancements. Thus,
so as
to discover wormholes, totally different techniques are in use. In all those techniques fixation of
threshold
is mer
ely by trial & error methodology or by random manner. Conjointly wormhole detection is in twin
part by putting the nodes that is higher than the edge in a suspicious set, however predicting the n
ode as a
wormhole by using some other algorithms. Our aim in
this paper is to deduce the traffic threshold level by
derivational approach for identifying wormholes in a very single phase in relay network having dissi
milar
characteristics.
Mobility models for delay tolerant network a surveyijwmn
Delay Tolerant Network (DTN) is an emerging networking technology that is widely used in the
environment where end-to-end paths do not exist. DTN follows store-carry-forward mechanism to route
data. This mechanism exploits the mobility of nodes and hence the performances of DTN routing and
application protocols are highly dependent on the underlying mobility of nodes and its characteristics.
Therefore, suitable mobility models are required to be incorporated in the simulation tools to evaluate DTN
protocols across many scenarios. In DTN mobility modelling literature, a number of mobility models have
been developed based on synthetic theory and real world mobility traces. Furthermore, many researchers
have developed specific application oriented mobility models. All these models do not provide accurate
evaluation in the all scenarios. Therefore, model selection is an important issue in DTN protocol
simulation. In this study, we have summarized various widely used mobility models and made a comparison
of their performances. Finally, we have concluded with future research directions in mobility modelling for
DTN simulation.
An Opportunistic AODV Routing Scheme : A Cognitive Mobile Agents Approachijasuc
In Manet’s Dynamics and Robustness are the key features of the nodes and are governed by several routing protocols such as AODV, DSR and so on. However in the network the growing resource demand leads to resource scarcity. The Node Mobility often leads to the link breakages and high routing overhead
decreasing the stability and reliability of the network connectivity. In this context, the paper proposes a novel opportunistic AODV routing scheme which implements a cognitive agent based intelligent technique to set up a stable connectivity over the Manet. The Scheme computes the routing metric (rf) based on the collaboration sensitivity levels of the nodes obtained based through the knowledge-based decision. This Routing Metric is subsequently used to set up the stable path for network connectivity. Thus minimizes the route overhead and increases the stability of the path. The Performance evaluation is conducted in comparison with the AODV and sleep AODV routing protocol and validated.
AN GROUP BEHAVIOR MOBILITY MODEL FOR OPPORTUNISTIC NETWORKS csandit
Mobility is regarded as a network transport mechanism for distributing data in many networks.
However, many mobility models ignore the fact that peer nodes often carried by people and
thus move in group pattern according to some kind of social relation. In this paper, we propose
one mobility model based on group behavior character which derives from real movement
scenario in daily life. This paper also gives the character analysis of this mobility model and
compares with the classic Random Waypoint Mobility model.
A ROUTING MECHANISM BASED ON SOCIAL NETWORKS AND BETWEENNESS CENTRALITY IN DE...ijcsit
With the growing popularity of mobile smart devices, the existing networks are unable to meet the requirement of many complex scenarios; current network architectures and protocols do not work well with the network with high latency and frequent disconnections. To improve the performance of these networks some scholars opened up a new research field, delay-tolerant networks, in which one of the important
research subjects is the forwarding and routing mechanism of data packets. This paper presents a routing
scheme based on social networks owing to the fact that nodes in computer networks and social networks
have high behavioural similarity. To further improve efficiency this paper also suggests a mechanism,which is the improved version of an existing betweenness centrality based routing algorithm [1]. The experiments showed that the proposed scheme has better performance than the existing friendship routing algorithms.
MODELING SOCIAL GAUSS-MARKOV MOBILITY FOR OPPORTUNISTIC NETWORK csandit
Mobility is attracting more and more interests due to its importance for data forwarding
mechanisms in many networks such as mobile opportunistic network. In everyday life mobile
nodes are often carried by human. Thus, mobile nodes’ mobility pattern is inevitable affected by
human social character. This paper presents a novel mobility model (HNGM) which combines
social character and Gauss-Markov process together. The performance analysis on this
mobility model is given and one famous and widely used mobility model (RWP) is chosen to
make comparison..
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
Word Recognition in Continuous Speech and Speaker Independent by Means of Rec...CSCJournals
Artificial neural networks have been applied successfully in many static systems but present some weaknesses if patterns involve a temporal component. Let’s note for example in speech recognition or contextual information, where different of the time interval, is crucial for comprehension. Speech, being a temporal form of sensory input, is a natural candidate for investigating temporal coding in neural networks. It is only through comprehension of the temporal relationship between different sounds which make up a spoken word or sentence that speech becomes intelligible. In fact we present in this paper presents three variants of self-organizing maps (SOM), the Leaky Integrators Neurons (LIN), the Spiking_SOM (SSOM) and the recurrent Spiking_SOM (RSSOM) models. The proposed variants is like the basic SOM, however it represents the characteristic to modify the learning function and the choice of the best matching unit (BMU). The case study of the proposed SOM variants is word recognition in continuous speech and speaker independent. The proposed SOM variants show good robustness and high word recognition rates.
Vertex covering has important applications for wireless sensor networks such as monitoring link failures,
facility location, clustering, and data aggregation. In this study, we designed three algorithms for
constructing vertex cover in wireless sensor networks. The first algorithm, which is an adaption of the
Parnas & Ron’s algorithm, is a greedy approach that finds a vertex cover by using the degrees of the
nodes. The second algorithm finds a vertex cover from graph matching where Hoepman’s weighted
matching algorithm is used. The third algorithm firstly forms a breadth-first search tree and then
constructs a vertex cover by selecting nodes with predefined levels from breadth-first tree. We show the
operation of the designed algorithms, analyze them, and provide the simulation results in the TOSSIM
environment. Finally we have implemented, compared and assessed all these approaches. The transmitted
message count of the first algorithm is smallest among other algorithms where the third algorithm has
turned out to be presenting the best results in vertex cover approximation ratio.
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.
EVOLUTIONARY CENTRALITY AND MAXIMAL CLIQUES IN MOBILE SOCIAL NETWORKSijcsit
This paper introduces an evolutionary approach to enhance the process of finding central nodes in mobile networks. This can provide essential information and important applications in mobile and social networks. This evolutionary approach considers the dynamics of the network and takes into consideration the central nodes from previous time slots. We also study the applicability of maximal cliques algorithms in mobile social networks and how it can be used to find the central nodes based on the discovered maximal cliques. The experimental results are promising and show a significant enhancement in finding the central nodes.
Distribution of maximal clique size underijfcstjournal
In this paper, we analyze the evolution of a small-world network and its subsequent transformation to a
random network using the idea of link rewiring under the well-known Watts-Strogatz model for complex
networks. Every link u-v in the regular network is considered for rewiring with a certain probability and if
chosen for rewiring, the link u-v is removed from the network and the node u is connected to a randomly
chosen node w (other than nodes u and v). Our objective in this paper is to analyze the distribution of the
maximal clique size per node by varying the probability of link rewiring and the degree per node (number
of links incident on a node) in the initial regular network. For a given probability of rewiring and initial
number of links per node, we observe the distribution of the maximal clique per node to follow a Poisson
distribution. We also observe the maximal clique size per node in the small-world network to be very close
to that of the average value and close to that of the maximal clique size in a regular network. There is no
appreciable decrease in the maximal clique size per node when the network transforms from a regular
network to a small-world network. On the other hand, when the network transforms from a small-world
network to a random network, the average maximal clique size value decreases significantly.
PERUSAL OF INTRUSION DETECTION AND PREVENTION SYSTEM ON A MANET WITH BLACK HO...ijsptm
MANET is a self configuring network of nodes which is a wireless . The nodes in this network move
randomly .Mobility of nodes is more. The nodes are dynamic and infrastructure less ,self maintainable. In
MANET there are many types of security attacks like Blackhole, greyhole attack, wormhole, jellyfish etc.
When the MANET is under blackhole attack there is a loss of energy which is high at the node resulting in
loss of battery backup and also excess of bandwidth may be consumed by the attacker. The attacker is an
insider. Among various mobility models to generate mobility patterns the Random waypoint mobility
model is used .To solve these issues an IDPS framework for MANET using image processing techniques
under blackhole attack is proposed to detect the blackhole attack RREP by providing security services like
authentication and confidentiality.
ABSTRACT
This paper introduces an evolutionary approach to enhance the process of finding central nodes in mobile networks. This can provide essential information and important applications in mobile and social networks. This evolutionary approach considers the dynamics of the network and takes into consideration the central nodes from previous time slots. We also study the applicability of maximal cliques algorithms in mobile social networks and how it can be used to find the central nodes based on the discovered maximal cliques. The experimental results are promising and show a significant enhancement in finding the central nodes.
Behavior study of entropy in a digital image through an iterative algorithmijscmcj
Image segmentation is a critical step in computer vision tasks constituting an essential issue for pattern recognition and visual interpretation. In this paper, we study the behavior of entropy in digital images through an iterative algorithm of mean shift filtering. The order of a digital image in gray levels is defined. The behavior of Shannon entropy is analyzed and then compared, taking into account the number of iterations of our algorithm, with the maximum entropy that could be achieved under the same order. The use of equivalence classes it induced, which allow us to interpret entropy as a hyper-surface in real m dimensional space. The difference of the maximum entropy of order n and the entropy of the image is used to group the the iterations, in order to caractrizes the performance of the algorithm.
Target Detection System (TDS) for Enhancing Security in Ad hoc Networkijdpsjournal
The idea of an ad hoc network is a new pattern that allows mobile hosts (nodes) to converse without relying
on a predefined communications to keep the network connected. Most nodes are implicit to be mobile and
communication is implicit to be wireless. Ad-hoc networks are collaborative in the sense that each node is
assumed to relay packets for other nodes that will in return relay their packets. Thus all nodes in an ad-hoc
network form part of the network’s routing infrastructure. The mobility of nodes in an ad-hoc network
denotes that both the public and the topology of the network are extremely active. It is very difficult to
design a once-for-all target detection system. Instead, an incremental enrichment strategy may be more
feasible. A safe and sound protocol should at least include mechanisms against known assault types. In
addition, it should provide a system to easily add new security features in the future. Due to the
significance of MANET routing protocols, we focus on the recognition of attacks targeted at MANET
routing protocols.
Intrusion detection techniques for cooperation of node in MANET have been chosen as the security
parameter. This includes Watchdog and Path rater approach. It also nearby Reputation Based Schemes in
which Reputation concerning every node is measured and will be move to every node in network.
Reputation is defined as Someone’s donation to network operation. CONFIDANT [23], CORE [25],
OCEAN [24] schemes are analyzed and will be here also compared based on various parameters.
Centrality Prediction in Mobile Social NetworksIJERA Editor
By analyzing evolving centrality roles using time dependent graphs, researchers may predict future centrality values. This may prove invaluable in designing efficient routing and energy saving strategies and have profound implications on evolving social behavior in dynamic social networks. In this paper, we propose a new method to predict centrality values of nodes in a dynamic environment. The proposed method is based on calculating the correlation between current and past measure of centrality for each corresponding node, which is used to form a composite vector to represent the given state of centralities. The performance of the proposed method is evaluated through simulated predictions on data sets from real mobile networks. Results indicate significantly low prediction error rate occurs, with a suitable implementation of the proposed method.
PRIVACY ENHANCEMENT OF NODE IN OPPORTUNISTIC NETWORK BY USING VIRTUAL-IDijsc
An entrepreneurial system is one of the sort of remote system. Delay resistance system is correspondence
organizing proposition which empowers the correspondence in such a situation where end to end way
might never be exist. Message is forward on the premise of chance. Time interim to convey a message is
long we can't evaluate or anticipate the time until we get the message. There is a security issue in these
sorts of system. In this paper we will proposed another procedure which will expand the protection of the
system and build execution of the system.
Multiview Alignment Hashing for Efficient Image Search1crore projects
IEEE PROJECTS 2015
1 crore projects is a leading Guide for ieee Projects and real time projects Works Provider.
It has been provided Lot of Guidance for Thousands of Students & made them more beneficial in all Technology Training.
Dot Net
DOTNET Project Domain list 2015
1. IEEE based on datamining and knowledge engineering
2. IEEE based on mobile computing
3. IEEE based on networking
4. IEEE based on Image processing
5. IEEE based on Multimedia
6. IEEE based on Network security
7. IEEE based on parallel and distributed systems
Java Project Domain list 2015
1. IEEE based on datamining and knowledge engineering
2. IEEE based on mobile computing
3. IEEE based on networking
4. IEEE based on Image processing
5. IEEE based on Multimedia
6. IEEE based on Network security
7. IEEE based on parallel and distributed systems
ECE IEEE Projects 2015
1. Matlab project
2. Ns2 project
3. Embedded project
4. Robotics project
Eligibility
Final Year students of
1. BSc (C.S)
2. BCA/B.E(C.S)
3. B.Tech IT
4. BE (C.S)
5. MSc (C.S)
6. MSc (IT)
7. MCA
8. MS (IT)
9. ME(ALL)
10. BE(ECE)(EEE)(E&I)
TECHNOLOGY USED AND FOR TRAINING IN
1. DOT NET
2. C sharp
3. ASP
4. VB
5. SQL SERVER
6. JAVA
7. J2EE
8. STRINGS
9. ORACLE
10. VB dotNET
11. EMBEDDED
12. MAT LAB
13. LAB VIEW
14. Multi Sim
CONTACT US
1 CRORE PROJECTS
Door No: 214/215,2nd Floor,
No. 172, Raahat Plaza, (Shopping Mall) ,Arcot Road, Vadapalani, Chennai,
Tamin Nadu, INDIA - 600 026
Email id: 1croreprojects@gmail.com
website:1croreprojects.com
Phone : +91 97518 00789 / +91 72999 51536
Mtadf multi hop traffic aware data for warding for congestion control in wir...ijwmn
In the past few years there is a remarkable change in the field of wireless sensor networks. Congestion occurs when there is a heavy traffic in the network. The heavy traffic in the network leads to wastage of energy and packet loss. Traffic Aware Dynamic Routing algorithm mitigates congestion by using one hop neighbor routing, hence throughput of the network is low. This paper proposed a Multi hop based Data Forwarding Technique to mitigate congestion. Queue length field and depth potential field play a major role to divert the traffic in the network to the alternate paths. The high traffic load leads to data queue overflow in the sensor nodes, these results in loss of important information about important events. Multi hop Traffic-Aware Dynamic Routing algorithm addresses congestion using depth potential field and queue length potential field. The algorithm forwards data packets around the congestion areas and scatters the excessive along multiple paths. The nodes with less load are efficiently utilized in response to congestion. The main aspect of the algorithm is to construct two independent potential fields using depth and queue length. Queue length field solves the traffic-aware problem. Depth field creates a backbone to forward packets to the sink. Both fields are combined to yield a hybrid potential field to make dynamic decision for data forwarding. Simulations are conducted to evaluate the performance of our proposed algorithm and our proposed scheme performs better compared to previous work.
LTE is an emerging wireless data communication technology to provide broadband ubiquitous Internet
access. Femtocells are included in 3GPP since Release 8 to enhance the indoor network coverage and
capacity. The main challenge of mobility management in hierarchical LTE structure is to guarantee
efficient handover to or from/to/between Femtocells. This paper focuses, on different types of Handover
and comparison performance between different decision algorithms. Furthermore, a speed based Handover
algorithm for macro-femto scenario is proposed with simulation results
Data gathering in wireless sensor networks using mobile elementsijwmn
In this paper, we investigate the problem of designing the minimum number of required mobile elements
tours such that each sensor node is either on the tour or one hop away from the tour, and the length of the
tour to be bounded by pre-determined value L. To address this problem, we propose heuristic-based
solution. This solution works by directing the mobile element tour towards the highly dense area in the
network. The experiment results show that our scheme outperform the benchmark scheme by 10% in most
scenarios.
The topology of mobile ad hoc networks (MANETs) change dynamically with time. Connected dominating sets (CDS) are considered to be an effective topology for network-wide broadcasts in MANETs as only the nodes that are part of the CDS need to broadcast the message and the rest of the nodes merely receive the message. However, 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 benchmarking algorithm to determine a sequence of CDSs (Maximum Stable CDS) such that the number of transitions is
the global minimum. In this paper, we analyze the impact of pause time and static nodes on the performance (CDS Lifetime and CDS Node Size) of the Maximum Stable CDS and degree-based CDS. Pause time refers to the time a node stops at a location before moving again. When a node is declared to be
a static node, it does not move at all during a simulation. We conduct the simulations by varying the
maximum node velocity, the pause time of the mobile nodes and the percentage of static nodes. As we
increase the maximum velocity with which any node could move, we observe to have greater chances of increasing the lifetime of the CDSs (especially the degree-based CDS) by letting all the nodes to move, but pause for an appreciable amount of time every now and then, rather than letting a certain a fraction of the
nodes to remain static all the time, but have the rest of the nodes to move all the time.
Realisation of awgn channel emulation modules under siso and simo environment...ijwmn
The testing of a wireless transmitter and receiver in the real-world channel is tedious. So, a channel
emulator using FPGA helps in the testing of transmitter and receiver by providing a test environment that
simulates a real-world wireless channel. Since FPGAs are flexible, cheap and reconfigurable, they are
used in designing an AWGN channel emulator for 4G LTE for Single Input Single Output (SISO) and
Single Input Multiple Output (SIMO) environments. In this paper, three basic modules: transmitter,
channel estimation and receiver modules are synthesized. In the transmitter module, the input data is 64-
QAM modulated and transmitted into the channel. In the channel estimation module, the transmitter data
gets multiplied with the channel coefficients and then added with the noise present in the channel. In the
receiver module, the data is detected using MMSE estimation. These are implemented in Virtex-5 device
using PlanAhead tool and the Resource and Power Estimations are discussed.
Availability is one of the most important concerns in the networking world. For any high available
network, we need to maintain 99.99999% availability. That is why it is one of the most important factors to
find out the single point of failure in the network architecture and eliminate that single point of failure
(SPOF) from physical network and logical network. SPOF in our server infrastructure has been analysed
in terms of communicating with the router for forwarding traffic with multiple routers. We have developed
an algorithm that will automatically select default gateway into the network interface card of virtual
machines. The proposed algorithm will automatically enable Default Gateway Weight settings (DGW)
protocol among routers by configuring Network interface card with default gateway of all routers. The
proposed protocol works based on weight settings for the multiple default gateway configuration in the
host. There will be heartbeat communication and re-convergence will be performed within the shortest
possible time. Lowest weight setting will select the path for packet forwarding through specified routers
related with the default gateway from the virtual machine.
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
Word Recognition in Continuous Speech and Speaker Independent by Means of Rec...CSCJournals
Artificial neural networks have been applied successfully in many static systems but present some weaknesses if patterns involve a temporal component. Let’s note for example in speech recognition or contextual information, where different of the time interval, is crucial for comprehension. Speech, being a temporal form of sensory input, is a natural candidate for investigating temporal coding in neural networks. It is only through comprehension of the temporal relationship between different sounds which make up a spoken word or sentence that speech becomes intelligible. In fact we present in this paper presents three variants of self-organizing maps (SOM), the Leaky Integrators Neurons (LIN), the Spiking_SOM (SSOM) and the recurrent Spiking_SOM (RSSOM) models. The proposed variants is like the basic SOM, however it represents the characteristic to modify the learning function and the choice of the best matching unit (BMU). The case study of the proposed SOM variants is word recognition in continuous speech and speaker independent. The proposed SOM variants show good robustness and high word recognition rates.
Vertex covering has important applications for wireless sensor networks such as monitoring link failures,
facility location, clustering, and data aggregation. In this study, we designed three algorithms for
constructing vertex cover in wireless sensor networks. The first algorithm, which is an adaption of the
Parnas & Ron’s algorithm, is a greedy approach that finds a vertex cover by using the degrees of the
nodes. The second algorithm finds a vertex cover from graph matching where Hoepman’s weighted
matching algorithm is used. The third algorithm firstly forms a breadth-first search tree and then
constructs a vertex cover by selecting nodes with predefined levels from breadth-first tree. We show the
operation of the designed algorithms, analyze them, and provide the simulation results in the TOSSIM
environment. Finally we have implemented, compared and assessed all these approaches. The transmitted
message count of the first algorithm is smallest among other algorithms where the third algorithm has
turned out to be presenting the best results in vertex cover approximation ratio.
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.
EVOLUTIONARY CENTRALITY AND MAXIMAL CLIQUES IN MOBILE SOCIAL NETWORKSijcsit
This paper introduces an evolutionary approach to enhance the process of finding central nodes in mobile networks. This can provide essential information and important applications in mobile and social networks. This evolutionary approach considers the dynamics of the network and takes into consideration the central nodes from previous time slots. We also study the applicability of maximal cliques algorithms in mobile social networks and how it can be used to find the central nodes based on the discovered maximal cliques. The experimental results are promising and show a significant enhancement in finding the central nodes.
Distribution of maximal clique size underijfcstjournal
In this paper, we analyze the evolution of a small-world network and its subsequent transformation to a
random network using the idea of link rewiring under the well-known Watts-Strogatz model for complex
networks. Every link u-v in the regular network is considered for rewiring with a certain probability and if
chosen for rewiring, the link u-v is removed from the network and the node u is connected to a randomly
chosen node w (other than nodes u and v). Our objective in this paper is to analyze the distribution of the
maximal clique size per node by varying the probability of link rewiring and the degree per node (number
of links incident on a node) in the initial regular network. For a given probability of rewiring and initial
number of links per node, we observe the distribution of the maximal clique per node to follow a Poisson
distribution. We also observe the maximal clique size per node in the small-world network to be very close
to that of the average value and close to that of the maximal clique size in a regular network. There is no
appreciable decrease in the maximal clique size per node when the network transforms from a regular
network to a small-world network. On the other hand, when the network transforms from a small-world
network to a random network, the average maximal clique size value decreases significantly.
PERUSAL OF INTRUSION DETECTION AND PREVENTION SYSTEM ON A MANET WITH BLACK HO...ijsptm
MANET is a self configuring network of nodes which is a wireless . The nodes in this network move
randomly .Mobility of nodes is more. The nodes are dynamic and infrastructure less ,self maintainable. In
MANET there are many types of security attacks like Blackhole, greyhole attack, wormhole, jellyfish etc.
When the MANET is under blackhole attack there is a loss of energy which is high at the node resulting in
loss of battery backup and also excess of bandwidth may be consumed by the attacker. The attacker is an
insider. Among various mobility models to generate mobility patterns the Random waypoint mobility
model is used .To solve these issues an IDPS framework for MANET using image processing techniques
under blackhole attack is proposed to detect the blackhole attack RREP by providing security services like
authentication and confidentiality.
ABSTRACT
This paper introduces an evolutionary approach to enhance the process of finding central nodes in mobile networks. This can provide essential information and important applications in mobile and social networks. This evolutionary approach considers the dynamics of the network and takes into consideration the central nodes from previous time slots. We also study the applicability of maximal cliques algorithms in mobile social networks and how it can be used to find the central nodes based on the discovered maximal cliques. The experimental results are promising and show a significant enhancement in finding the central nodes.
Behavior study of entropy in a digital image through an iterative algorithmijscmcj
Image segmentation is a critical step in computer vision tasks constituting an essential issue for pattern recognition and visual interpretation. In this paper, we study the behavior of entropy in digital images through an iterative algorithm of mean shift filtering. The order of a digital image in gray levels is defined. The behavior of Shannon entropy is analyzed and then compared, taking into account the number of iterations of our algorithm, with the maximum entropy that could be achieved under the same order. The use of equivalence classes it induced, which allow us to interpret entropy as a hyper-surface in real m dimensional space. The difference of the maximum entropy of order n and the entropy of the image is used to group the the iterations, in order to caractrizes the performance of the algorithm.
Target Detection System (TDS) for Enhancing Security in Ad hoc Networkijdpsjournal
The idea of an ad hoc network is a new pattern that allows mobile hosts (nodes) to converse without relying
on a predefined communications to keep the network connected. Most nodes are implicit to be mobile and
communication is implicit to be wireless. Ad-hoc networks are collaborative in the sense that each node is
assumed to relay packets for other nodes that will in return relay their packets. Thus all nodes in an ad-hoc
network form part of the network’s routing infrastructure. The mobility of nodes in an ad-hoc network
denotes that both the public and the topology of the network are extremely active. It is very difficult to
design a once-for-all target detection system. Instead, an incremental enrichment strategy may be more
feasible. A safe and sound protocol should at least include mechanisms against known assault types. In
addition, it should provide a system to easily add new security features in the future. Due to the
significance of MANET routing protocols, we focus on the recognition of attacks targeted at MANET
routing protocols.
Intrusion detection techniques for cooperation of node in MANET have been chosen as the security
parameter. This includes Watchdog and Path rater approach. It also nearby Reputation Based Schemes in
which Reputation concerning every node is measured and will be move to every node in network.
Reputation is defined as Someone’s donation to network operation. CONFIDANT [23], CORE [25],
OCEAN [24] schemes are analyzed and will be here also compared based on various parameters.
Centrality Prediction in Mobile Social NetworksIJERA Editor
By analyzing evolving centrality roles using time dependent graphs, researchers may predict future centrality values. This may prove invaluable in designing efficient routing and energy saving strategies and have profound implications on evolving social behavior in dynamic social networks. In this paper, we propose a new method to predict centrality values of nodes in a dynamic environment. The proposed method is based on calculating the correlation between current and past measure of centrality for each corresponding node, which is used to form a composite vector to represent the given state of centralities. The performance of the proposed method is evaluated through simulated predictions on data sets from real mobile networks. Results indicate significantly low prediction error rate occurs, with a suitable implementation of the proposed method.
PRIVACY ENHANCEMENT OF NODE IN OPPORTUNISTIC NETWORK BY USING VIRTUAL-IDijsc
An entrepreneurial system is one of the sort of remote system. Delay resistance system is correspondence
organizing proposition which empowers the correspondence in such a situation where end to end way
might never be exist. Message is forward on the premise of chance. Time interim to convey a message is
long we can't evaluate or anticipate the time until we get the message. There is a security issue in these
sorts of system. In this paper we will proposed another procedure which will expand the protection of the
system and build execution of the system.
Multiview Alignment Hashing for Efficient Image Search1crore projects
IEEE PROJECTS 2015
1 crore projects is a leading Guide for ieee Projects and real time projects Works Provider.
It has been provided Lot of Guidance for Thousands of Students & made them more beneficial in all Technology Training.
Dot Net
DOTNET Project Domain list 2015
1. IEEE based on datamining and knowledge engineering
2. IEEE based on mobile computing
3. IEEE based on networking
4. IEEE based on Image processing
5. IEEE based on Multimedia
6. IEEE based on Network security
7. IEEE based on parallel and distributed systems
Java Project Domain list 2015
1. IEEE based on datamining and knowledge engineering
2. IEEE based on mobile computing
3. IEEE based on networking
4. IEEE based on Image processing
5. IEEE based on Multimedia
6. IEEE based on Network security
7. IEEE based on parallel and distributed systems
ECE IEEE Projects 2015
1. Matlab project
2. Ns2 project
3. Embedded project
4. Robotics project
Eligibility
Final Year students of
1. BSc (C.S)
2. BCA/B.E(C.S)
3. B.Tech IT
4. BE (C.S)
5. MSc (C.S)
6. MSc (IT)
7. MCA
8. MS (IT)
9. ME(ALL)
10. BE(ECE)(EEE)(E&I)
TECHNOLOGY USED AND FOR TRAINING IN
1. DOT NET
2. C sharp
3. ASP
4. VB
5. SQL SERVER
6. JAVA
7. J2EE
8. STRINGS
9. ORACLE
10. VB dotNET
11. EMBEDDED
12. MAT LAB
13. LAB VIEW
14. Multi Sim
CONTACT US
1 CRORE PROJECTS
Door No: 214/215,2nd Floor,
No. 172, Raahat Plaza, (Shopping Mall) ,Arcot Road, Vadapalani, Chennai,
Tamin Nadu, INDIA - 600 026
Email id: 1croreprojects@gmail.com
website:1croreprojects.com
Phone : +91 97518 00789 / +91 72999 51536
Mtadf multi hop traffic aware data for warding for congestion control in wir...ijwmn
In the past few years there is a remarkable change in the field of wireless sensor networks. Congestion occurs when there is a heavy traffic in the network. The heavy traffic in the network leads to wastage of energy and packet loss. Traffic Aware Dynamic Routing algorithm mitigates congestion by using one hop neighbor routing, hence throughput of the network is low. This paper proposed a Multi hop based Data Forwarding Technique to mitigate congestion. Queue length field and depth potential field play a major role to divert the traffic in the network to the alternate paths. The high traffic load leads to data queue overflow in the sensor nodes, these results in loss of important information about important events. Multi hop Traffic-Aware Dynamic Routing algorithm addresses congestion using depth potential field and queue length potential field. The algorithm forwards data packets around the congestion areas and scatters the excessive along multiple paths. The nodes with less load are efficiently utilized in response to congestion. The main aspect of the algorithm is to construct two independent potential fields using depth and queue length. Queue length field solves the traffic-aware problem. Depth field creates a backbone to forward packets to the sink. Both fields are combined to yield a hybrid potential field to make dynamic decision for data forwarding. Simulations are conducted to evaluate the performance of our proposed algorithm and our proposed scheme performs better compared to previous work.
LTE is an emerging wireless data communication technology to provide broadband ubiquitous Internet
access. Femtocells are included in 3GPP since Release 8 to enhance the indoor network coverage and
capacity. The main challenge of mobility management in hierarchical LTE structure is to guarantee
efficient handover to or from/to/between Femtocells. This paper focuses, on different types of Handover
and comparison performance between different decision algorithms. Furthermore, a speed based Handover
algorithm for macro-femto scenario is proposed with simulation results
Data gathering in wireless sensor networks using mobile elementsijwmn
In this paper, we investigate the problem of designing the minimum number of required mobile elements
tours such that each sensor node is either on the tour or one hop away from the tour, and the length of the
tour to be bounded by pre-determined value L. To address this problem, we propose heuristic-based
solution. This solution works by directing the mobile element tour towards the highly dense area in the
network. The experiment results show that our scheme outperform the benchmark scheme by 10% in most
scenarios.
The topology of mobile ad hoc networks (MANETs) change dynamically with time. Connected dominating sets (CDS) are considered to be an effective topology for network-wide broadcasts in MANETs as only the nodes that are part of the CDS need to broadcast the message and the rest of the nodes merely receive the message. However, 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 benchmarking algorithm to determine a sequence of CDSs (Maximum Stable CDS) such that the number of transitions is
the global minimum. In this paper, we analyze the impact of pause time and static nodes on the performance (CDS Lifetime and CDS Node Size) of the Maximum Stable CDS and degree-based CDS. Pause time refers to the time a node stops at a location before moving again. When a node is declared to be
a static node, it does not move at all during a simulation. We conduct the simulations by varying the
maximum node velocity, the pause time of the mobile nodes and the percentage of static nodes. As we
increase the maximum velocity with which any node could move, we observe to have greater chances of increasing the lifetime of the CDSs (especially the degree-based CDS) by letting all the nodes to move, but pause for an appreciable amount of time every now and then, rather than letting a certain a fraction of the
nodes to remain static all the time, but have the rest of the nodes to move all the time.
Realisation of awgn channel emulation modules under siso and simo environment...ijwmn
The testing of a wireless transmitter and receiver in the real-world channel is tedious. So, a channel
emulator using FPGA helps in the testing of transmitter and receiver by providing a test environment that
simulates a real-world wireless channel. Since FPGAs are flexible, cheap and reconfigurable, they are
used in designing an AWGN channel emulator for 4G LTE for Single Input Single Output (SISO) and
Single Input Multiple Output (SIMO) environments. In this paper, three basic modules: transmitter,
channel estimation and receiver modules are synthesized. In the transmitter module, the input data is 64-
QAM modulated and transmitted into the channel. In the channel estimation module, the transmitter data
gets multiplied with the channel coefficients and then added with the noise present in the channel. In the
receiver module, the data is detected using MMSE estimation. These are implemented in Virtex-5 device
using PlanAhead tool and the Resource and Power Estimations are discussed.
Availability is one of the most important concerns in the networking world. For any high available
network, we need to maintain 99.99999% availability. That is why it is one of the most important factors to
find out the single point of failure in the network architecture and eliminate that single point of failure
(SPOF) from physical network and logical network. SPOF in our server infrastructure has been analysed
in terms of communicating with the router for forwarding traffic with multiple routers. We have developed
an algorithm that will automatically select default gateway into the network interface card of virtual
machines. The proposed algorithm will automatically enable Default Gateway Weight settings (DGW)
protocol among routers by configuring Network interface card with default gateway of all routers. The
proposed protocol works based on weight settings for the multiple default gateway configuration in the
host. There will be heartbeat communication and re-convergence will be performed within the shortest
possible time. Lowest weight setting will select the path for packet forwarding through specified routers
related with the default gateway from the virtual machine.
T HE I MPACT OF TCP C ONGESTION W INDOW S IZE ON THE P ERFORMANCE E VA...ijwmn
A mobile ad hoc network (MANET) is a temporary coll
ection of mobile nodes randomly moved within a
limited terrain area. The nodes are connected to fo
rm a wireless network without use any communication
infrastructure. Because of the limiting resources o
f MANET nodes, multiple hops
scheme is proposed for
data exchange
across the network. Varieties of mobile ad hoc rout
ing protocols have been developed to
support the multi-hop scheme of ad hoc networks. A
popular Transmission Control Protocol (TCP)
provides a reliable connection in a computer networ
k environment; it sets its congestion window size i
n
response to the behavior of the network to achieve
the best performance. This work aims to investigate
and
compare the MANET protocol
performance, such as DSDV, AODV and DSR in terms of
network
throughput, average routing load, the packet delive
ry ratio (PDR), and average end-to-end delay by
varying the maximum congestion window size. Our si
mulation has been implemented using a well-known
NS-2.35 network simulator. The simulated results sh
ow that the demonstrates of the concepts of MANET
routing protocols with respect to TCP congestion wi
ndow size in MANET environment
Macro with pico cells (hetnets) system behaviour using well known scheduling ...ijwmn
This paper demonstrates the concept of using Heterogeneous networks (HetNets) to improve Long Term Evolution (LTE) system by introducing the LTE Advance (LTE-A). The type of HetNets that has been chosen for this study is Macro with Pico cells. Comparing the system performance with and without Pico cells has clearly illustrated using three well-known scheduling algorithms (Proportional Fair PF, Maximum Largest Weighted Delay First MLWDF and Exponential/Proportional Fair EXP/PF). The system is judged based on throughput, Packet Loss Ratio PLR, delay and fairness.. A simulation platform called LTE-Sim has been used to collect the data and produce the paper’s outcomes and graphs. The results prove that adding Pico cells enhances the overall system performance. From the simulation outcomes, the overall system performance is as follows: throughput is duplicated or tripled based on the number of users, the PLR is almost quartered, the delay is nearly reduced ten times (PF case) and changed to be a half (MLWDF/EXP cases), and the fairness stays closer to value of 1. It is considered an efficient and cost effective way to increase the throughput, coverage and reduce the latency.
E NERGY D EGREE D ISTANCE C LUSTERING A LGORITHM FOR W Snsijwmn
Energy consumption is an important parameter in th
e context of the wireless sensor networks (WSNs).
Several factors can cause energy over consumption s
uch as mobility, node position (relay or gateway),
retransmissions... In this paper, we described a ne
w Energy-Degree Distance(EDD) Clustering Algorithm
for the WSNs. A node with higher residual energy,
higher degree and closer to the base station is mor
e
likely elected as a clusterhead (CH). The inter clu
ster and intra cluster communications are realized
on one
hop. The principal goal of our algorithm is to min
imize the energy consumption and balance energy
consumption among all nodes. By comparing EDD clust
ering algorithm with LEACH algorithm,
simulation results have shown its effectiveness i
n saving energy
A novel architecture for sdn based cellular network ijwmn
In this paper, we propose a novel SDN-based cellular network architecture that will be able to utilize the
opportunities of centralized administration of today’s emerging mobile network. Our proposed architecture
would not depend on a single controller, rather it divides the whole cellular area into clusters, and each
cluster is controlled by a separate controller. A number of controller services are provided on top of each
controller to manage all the major functionalities of the network and help to make the network
programmable and more agile, and create opportunities for policy-driven supervision and more
automation.
Modulation aware connection admission control and uplink scheduling algorithm...ijwmn
Mobile WiMAX standard defines air interface for mobile broadband wireless access (BWA) systems and aimed to provide high data rate with seamless mobility while maintaining the quality of service (QoS). However, QoS of real-time applications depends on the link quality, which necessitate the channel-aware connection admission control (CAC) and scheduling schemes. In this paper Modulation aware CAC scheme and base station (BS) uplink scheduling algorithm are proposed to improve the system capacity and QoS performance respectively. The proposed CAC scheme aims to increase the admission of higher priority real time services by degrading the bandwidth of admitted lower priority connections on the basis of their channel status without deteriorating their QoS performance much. The performances of proposed algorithms are evaluated through simulation by considering the metrics like throughput, delay and number of connections admitted.
Mobile Ad hoc Networks (MANETs) have drawn considerable attentions of the researchers for the last few years. MANETs, consisting of mobile nodes, are self-organizing and self-configuring and hence can be deployed without any infrastructure support. MANETs also have some limitations including short-life, unreliability, scalability, latency, high interference, and limited resources. In order to overcome these limitations many innovations and researches have been done in this field. Incorporating smart antenn system with the mobile nodes is one of them. It has been shown in the literatures that smart antenna can improve network capacity, increase network lifetime, reduce delay, and improve scalability by using directional radiation pattern. But, there are some unsolvedissues too. Smart antenna requires a large
number of antenna elements that a resource constraint mobile node can hardly handle. Hence, one major
design issue is to achieve a desired radiation pattern by using minimum number of antenna elements. Another important issue is the arrangement of antenna elements. Antenna elements can be arranged in linear, planar, and circular manners. In this paper we have addressed these issues. We have proposed a window based smart antenna design for MANETs. Our target is to improve the routing performance of
MANETs. We have shown that by using appropriate window function a desired radiation pattern can be achieved with a minimum number of antenna elements.
In this paper, the performances of adaptive noise cancelling system employing Least Mean Square (LMS) algorithm are studied considering both white Gaussian noise (Case 1) and colored noise (Case 2)
situations. Performance is analysed with varying number of iterations, Signal to Noise Ratio (SNR) and tap size with considering Mean Square Error (MSE) as the performance measurement criteria. Results show that the noise reduction is better as well as convergence speed is faster for Case 2 as compared with Case 1. It is also observed that MSE decreases with increasing SNR with relatively faster decrease of MSE in Case 2 as compared with Case 1, and on average MSE increases linearly with increasing number of filter
coefficients for both type of noise situations. All the experiments have been done using computer
simulations implemented on MATLAB platform.
O N THE E VALUATION OF G MSK S CHEME W ITH ECC T ECHNIQUES IN W IRELESS S...ijwmn
Wireless sensor nodes are powered by batteries, for
which replacement is very difficult. That is why,
optimization of energy consumption is a major objec
tive in the area of wireless sensor networks (WSNs)
.On
the other hand, noisy channel has a prominent influ
ence on the reliability of data transmission. There
fore,
an energy efficient transmission strategy should be
considered on the communication process of wireles
s
nodes in order to obtain optimal energy network con
sumption. Indeed, the choice of suitable modulation
format with the proper Error Correcting code (ECC)
played a great responsibility to obtain better ener
gy
conservation.In this work, we aim to evaluate the p
erformance analysis of Gaussian Minimum Shift Keyin
g
(GMSK) modulation with several combinations of codi
ng strategies using various analysis metrics such a
s
Bit Error Rate (BER), energy consumption.Through ex
tensive simulation, we disclose that he gain achiev
ed
through GMSK modulation with suitable channel codin
g mechanism is promising to obtain reliable
communication and energy conservation in WSN.
Quality of Service (QoS) provisioning in networks requires proper scheduling algorithm. Internet traffic,
especially real-time multimedia applications, is bursty in nature . Hence, in addition to the service rate
which is commonly used to isolate service of sessions, other parameters should be involved. In this paper
a scheduling algorithm is proposed that attempts to provide a balance between bursty and non-bursty
(smooth) traffic. We improve thewell-known packet scheduling algorithm, SCFQ.Our proposed algorithm
is proficient to compensate an adjustable amount of missed service to each session. The average delay of
the proposed algorithm is evaluated by simulation. An important advantage of our algorithm is that
byselecting correct parameter setting for each session, the average delay of a bursty session can be
reduced. Furthermore, compared to SCFQ our proposed algorithm does not necessitate any additional
computation.
Present new mechanisms for modelling multiple interfaces on a node, support for interference-limited links and a frame-work for modelling complex applications running on the nodes. Furthermore, provide an overview of concrete use cases where the simulator has been successfully exploited to study a variety of aspects related to opportunistic, message-based communications. Node movement is implemented by movement models. These are either synthetic models or existing movement traces. Connectivity between the nodes is based on their location, communication range and the bit-rate. The routing function is implemented by routing modules that decide which messages to forward over existing contacts. Finally, the messages themselves are generated either through event generators that generate random traffic between the nodes, or through applications that generate traffic based on application interactions. The main functions of the simulator are the modelling of node movement, inter-node contacts using various interfaces, routing, message handling and application interactions. Result collection and analysis are done through visualization, reports and post-processing tools.
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
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.
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.
Generating images from a text description is as challenging as it is interesting. The Adversarial network
performs in a competitive fashion where the networks are the rivalry of each other. With the introduction of
Generative Adversarial Network, lots of development is happening in the field of Computer Vision. With
generative adversarial networks as the baseline model, studied Stack GAN consisting of two-stage GANS
step-by-step in this paper that could be easily understood. This paper presents visual comparative study of
other models attempting to generate image conditioned on the text description. One sentence can be related
to many images. And to achieve this multi-modal characteristic, conditioning augmentation is also
performed. The performance of Stack-GAN is better in generating images from captions due to its unique
architecture. As it consists of two GANS instead of one, it first draws a rough sketch and then corrects the
defects yielding a high-resolution image.
Effect of multipath routing in autonomous mobile mesh networkseSAT Journals
Abstract
Autonomous mobile mesh networks are a combination of mobile ad hoc networks and mesh networks. Mobile ad hoc networks are temporarily formed for a specific purpose, without any fixed infrastructure. Mesh networks are fully connected networks with the support of fixed infrastructure. Autonomous mobile mesh networks (AMMNET in short) [1], is the framework designed for supporting mesh networks, which are mobile still expects connectivity as opposed to ad hoc networks. This paper proposes a multipath routing technology for AMMNETs which provides better packet delivery ratio in AMMNETs. The simulations are done in ns2. The results prove that, multipath routing technology works well with AMMNET framework.
Keywords: AMMNET, routing, multipath, ns2.
PERFORMANCE ANALYSIS OF OLSR PROTOCOL IN MANET CONSIDERING DIFFERENT MOBILITY...ijwmn
A Mobile Ad Hoc Network (MANET) is created when an independent mobile node network is connected
dynamically via wireless links. MANET is a self-organizing network that does not rely on pre-existing
infrastructure such as wired or wireless network routers. Mobile nodes in this network move randomly,
thus, the topology is always changing. Routing protocols in MANET are critical in ensuring dependable
and consistent connectivity between the mobile nodes. They conclude logically based on the interaction
between mobile nodes in MANET routing and encourage them to choose the optimum path between source
and destination. Routing protocols are classified as proactive, reactive, or hybrid. The focus of this project
will be on Optimized Link State Routing (OLSR) protocol, a proactive routing technique. OLSR is known as
the optimized variant of link state routing in which packets are sent throughout the network using the
multipoint relay (MPR) mechanism. This article evaluates the performance of the OLSR routing protocol
under condition of changing mobility speed and network density. The study's performance indicators are
average packet throughput, packet delivery ratio (PDR), and average packet latency. Network Simulator 2
(NS-2) and an external patch UM-OLSR are used to simulate and evaluate the performance of such
protocol. As a result of research, the approach of implementing the MPR mechanism are able to minimise
redundant data transmission during the normal message broadcast. The MPRs enhance the link state
protocols’ traditional diffusion mechanism by selecting the right MPRs. Hence, the number of undesired
broadcasts can be reduced and limited. Further research will focus on different scenario and environment
using different mobility model
PERFORMANCE ANALYSIS OF OLSR PROTOCOL IN MANET CONSIDERING DIFFERENT MOBILITY...ijwmn
A Mobile Ad Hoc Network (MANET) is created when an independent mobile node network is connected dynamically via wireless links. MANET is a self-organizing network that does not rely on pre-existing infrastructure such as wired or wireless network routers. Mobile nodes in this network move randomly, thus, the topology is always changing. Routing protocols in MANET are critical in ensuring dependable and consistent connectivity between the mobile nodes. They conclude logically based on the interaction between mobile nodes in MANET routing and encourage them to choose the optimum path between source and destination. Routing protocols are classified as proactive, reactive, or hybrid. The focus of this project will be on Optimized Link State Routing (OLSR) protocol, a proactive routing technique. OLSR is known as the optimized variant of link state routing in which packets are sent throughout the network using the multipoint relay (MPR) mechanism. This article evaluates the performance of the OLSR routing protocol under condition of changing mobility speed and network density. The study's performance indicators are average packet throughput, packet delivery ratio (PDR), and average packet latency. Network Simulator 2 (NS-2) and an external patch UM-OLSR are used to simulate and evaluate the performance of such protocol. As a result of research, the approach of implementing the MPR mechanism are able to minimise redundant data transmission during the normal message broadcast. The MPRs enhance the link state protocols’ traditional diffusion mechanism by selecting the right MPRs. Hence, the number of undesired broadcasts can be reduced and limited. Further research will focus on different scenario and environment using different mobility model.
New Generation Routing Protocol over Mobile Ad Hoc Wireless Networks based on...ijasuc
There is a vast amount of researched literature available on Route Finding and Link Establishment in
MANET protocols based on various concepts such as “pro-active”, “reactive”, “power awareness”,
“cross-layering” etc. Most of these techniques are rather restrictive, taking into account a few of the
several aspects that go into effective route establishment. When we look at practical implementations of
MANETs, we have to take into account various factors in totality, not in isolation. The several factors that
decide and influence the routing have to be considered as a whole in the difficult task of finding the best
solution in route finding and optimization. The inputs to the system are manifold and apparently unrelated.
Most of the parameters are imprecise or non-crisp in nature. The uncertainty and imprecision lead to think
that intelligent routing techniques are essential and important in evolving robust and dependable solutions
to route finding. The obvious method by which this can be achieved is the deployment of soft computing
techniques such as Neural Nets, Fuzzy Logic and Genetic algorithms. Neural Networks help us to solve the
complex problem of transforming the inputs to outputs without apriori knowledge of what the relationship
is between inputs and outputs. Fuzzy Logic helps us to deal with imprecise and ill-conditioned data.
Genetic Algorithms help us to select the best possible solution from the solution space in an optimal sense.
Our paper presented here below seeks to explore new horizons in this direction. The results of our
experimentation have been very satisfactory and we have achieved the goal of optimal route finding to a
large extent. There is of course considerable room for further refinements.
New Generation Routing Protocol over Mobile Ad Hoc Wireless Networks based on...ijasuc
There is a vast amount of researched literature available on Route Finding and Link Establishment in
MANET protocols based on various concepts such as “pro-active”, “reactive”, “power awareness”,
“cross-layering” etc. Most of these techniques are rather restrictive, taking into account a few of the
several aspects that go into effective route establishment. When we look at practical implementations of
MANETs, we have to take into account various factors in totality, not in isolation. The several factors that
decide and influence the routing have to be considered as a whole in the difficult task of finding the best
solution in route finding and optimization. The inputs to the system are manifold and apparently unrelated.
Most of the parameters are imprecise or non-crisp in nature. The uncertainty and imprecision lead to think
that intelligent routing techniques are essential and important in evolving robust and dependable solutions
to route finding. The obvious method by which this can be achieved is the deployment of soft computing
techniques such as Neural Nets, Fuzzy Logic and Genetic algorithms. Neural Networks help us to solve the
complex problem of transforming the inputs to outputs without apriori knowledge of what the relationship
is between inputs and outputs. Fuzzy Logic helps us to deal with imprecise and ill-conditioned data.
Genetic Algorithms help us to select the best possible solution from the solution space in an optimal sense.
Our paper presented here below seeks to explore new horizons in this direction. The results of our
experimentation have been very satisfactory and we have achieved the goal of optimal route finding to a
large extent. There is of course considerable room for further refinements.
Develop a mobility model for MANETs networks based on fuzzy Logiciosrjce
The study and research in the field of networks MANETs depends alleged understand the protocols
well of the simulation process before they are applied in the real world, so that we create an environment
similar to these networks. The problem of a set of nodes connected with each other wirelessly, this requires the
development of a comprehensive model and full and real emulator for the movement of the contract on behalf of
stochastic models. Many models came to address the problems of random models that restricted the movement
of decade barriers as well as the signals exchanged between them, but these models were not receiving a lot of
light on the movement of the contract, such as direction, speed and path that is going by the node. The main
goal is to get a comprehensive model and simulator for all parts of the environment of the barriers and
obstacles to the movement of the nodes and the mobile signal between them as well as to focus on the movement
transactions for the node of the direction, speed, and best way. . This research aims to provide a realistic
mobility model for MANET networks. It also addresses the problem of imprecision in social relationships and
the location where we apply Fuzzy logic.
The International Journal of Engineering & Science is aimed at providing a platform for researchers, engineers, scientists, or educators to publish their original research results, to exchange new ideas, to disseminate information in innovative designs, engineering experiences and technological skills. It is also the Journal's objective to promote engineering and technology education. All papers submitted to the Journal will be blind peer-reviewed. Only original articles will be published.
The papers for publication in The International Journal of Engineering& Science are selected through rigorous peer reviews to ensure originality, timeliness, relevance, and readability.
An Efficient DTN Routing Algorithm for Automatic Crime Information Sharing fo...IJSRD
Delay Tolerant Network shows many issues that are exist in traditional network. Opportunistic network emerge as interesting evolution in MANET. Mobile nodes in the opportunistic network communicate with each other even in case of no route connection. In this paper a kiosk (or hub station) that is connected to villages to establish internet connection. Such kiosk is placed where traffic frequency is high. We will use high frequency sensor in vehicles. When passing through kiosk, high frequency sensor will establish connection to kiosk & kiosk will connect villages to internet. This system is very useful in crime information sharing services. As an example, if there are a person who is victim of any crime or in a trouble condition. He/she have mobile devices connect to internet. They send a trouble message which is passed to near kiosk and passed on to vehicles and forward their information to police station. This system is helpful in villages, where network communication is not proper.
Performance Comparison and Analysis of Mobile Ad Hoc Routing ProtocolsCSEIJJournal
A mobile ad hoc network (MANET) is a wireless network that uses multi-hop peer-to-peer routing instead
of static network infrastructure to provide network connectivity. MANETs have applications in rapidly
deployed and dynamic military and civilian systems. The network topology in a MANET usually changes
with time. Therefore, there are new challenges for routing protocols in MANETs since traditional routing
protocols may not be suitable for MANETs. Researchers are designing new MANET routing protocols
and comparing and improving existing MANET routing protocols before any routing protocols are
standardized using simulations. However, the simulation results from different research groups are not
consistent with each other. This is because of a lack of consistency in MANET routing protocol models
and application environments, including networking and user traffic profiles. Therefore, the simulation
scenarios are not equitable for all protocols and conclusions cannot be generalized. Furthermore, it is
difficult for one to choose a proper routing protocol for a given MANET application. According to the
aforementioned issues, this paper focuses on MANET routing protocols. Specifically, my contribution
includes the characterization of different routing protocols and compare and analyze the performance of
different routing protocols.
A Novel Approach for Detection of Routes with Misbehaving Nodes in MANETsIDES Editor
Network nodes in MANET’s are free to move randomly.
Therefore, the network topology may change rapidly.
Routing protocol for MANET’s are used for delivery of data
packets from source to the desired destination, Routing protocols
are also designed based on the assumption that all the
participating nodes are fully cooperative. However, due to the
scarcely available battery based energy, node behaviours may
exist. One such routing misbehaviours is that some nodes may
be selfish by participating in route discovery and maintenance
process, but refuse to forward the packet in order to save its
energy. To solve this problem we propose a reputation based
scheme where the watch dog uses a passive overhearing of
nodes and assign a value to it as an appreciation or add nuggets
to them. In this proposal, nodes with highest value are
highly recommended for data forwarding and allow nodes to
avoid the use of misbehaving nodes in future route selection.
AdHoc On Demand Distance vector routing protocol may be
used to get the recommendation details of the node intended
to forward the packet from the neighbouring nodes. This paper
proposes a novel method to mitigate the route with misbehaving
nodes and also suggests a way to find if any intruder is
present in the cluster of participating nodes using security
aware AODV protocol.
Route Stability in Mobile Ad-Hoc Networksarpublication
A Mobile Ad Hoc Network (MANET) is a wireless network consisting of mobile nodes, which can communicate with each other without any infrastructure support. In these networks, nodes typically cooperate with each other, by forwarding packets for nodes which are not in the communication range of the source node. A fundamental issue arising in mobile ad-hoc networks (MANETs) is the selection of the optimal path between any two nodes. A method that has been advocated to improve routing efficiency is to select the most stable path so as to reduce the latency and the overhead due to route reconstruction. In this work we study the stability of a routing path, which is subject to link failures caused by node mobility, and we consider as metrics of interest the duration and the availability of a path. Moreover, using the results on path duration and availability, we show how to determine the optimal path in terms of route stability, under the Random Direction mobility models.
Similar to COMPARING THE IMPACT OF MOBILE NODES ARRIVAL PATTERNS IN MANETS USING POISSON AND PARETO MODELS (20)
Kubernetes & AI - Beauty and the Beast !?! @KCD Istanbul 2024Tobias Schneck
As AI technology is pushing into IT I was wondering myself, as an “infrastructure container kubernetes guy”, how get this fancy AI technology get managed from an infrastructure operational view? Is it possible to apply our lovely cloud native principals as well? What benefit’s both technologies could bring to each other?
Let me take this questions and provide you a short journey through existing deployment models and use cases for AI software. On practical examples, we discuss what cloud/on-premise strategy we may need for applying it to our own infrastructure to get it to work from an enterprise perspective. I want to give an overview about infrastructure requirements and technologies, what could be beneficial or limiting your AI use cases in an enterprise environment. An interactive Demo will give you some insides, what approaches I got already working for real.
Generating a custom Ruby SDK for your web service or Rails API using Smithyg2nightmarescribd
Have you ever wanted a Ruby client API to communicate with your web service? Smithy is a protocol-agnostic language for defining services and SDKs. Smithy Ruby is an implementation of Smithy that generates a Ruby SDK using a Smithy model. In this talk, we will explore Smithy and Smithy Ruby to learn how to generate custom feature-rich SDKs that can communicate with any web service, such as a Rails JSON API.
Essentials of Automations: Optimizing FME Workflows with ParametersSafe Software
Are you looking to streamline your workflows and boost your projects’ efficiency? Do you find yourself searching for ways to add flexibility and control over your FME workflows? If so, you’re in the right place.
Join us for an insightful dive into the world of FME parameters, a critical element in optimizing workflow efficiency. This webinar marks the beginning of our three-part “Essentials of Automation” series. This first webinar is designed to equip you with the knowledge and skills to utilize parameters effectively: enhancing the flexibility, maintainability, and user control of your FME projects.
Here’s what you’ll gain:
- Essentials of FME Parameters: Understand the pivotal role of parameters, including Reader/Writer, Transformer, User, and FME Flow categories. Discover how they are the key to unlocking automation and optimization within your workflows.
- Practical Applications in FME Form: Delve into key user parameter types including choice, connections, and file URLs. Allow users to control how a workflow runs, making your workflows more reusable. Learn to import values and deliver the best user experience for your workflows while enhancing accuracy.
- Optimization Strategies in FME Flow: Explore the creation and strategic deployment of parameters in FME Flow, including the use of deployment and geometry parameters, to maximize workflow efficiency.
- Pro Tips for Success: Gain insights on parameterizing connections and leveraging new features like Conditional Visibility for clarity and simplicity.
We’ll wrap up with a glimpse into future webinars, followed by a Q&A session to address your specific questions surrounding this topic.
Don’t miss this opportunity to elevate your FME expertise and drive your projects to new heights of efficiency.
Key Trends Shaping the Future of Infrastructure.pdfCheryl Hung
Keynote at DIGIT West Expo, Glasgow on 29 May 2024.
Cheryl Hung, ochery.com
Sr Director, Infrastructure Ecosystem, Arm.
The key trends across hardware, cloud and open-source; exploring how these areas are likely to mature and develop over the short and long-term, and then considering how organisations can position themselves to adapt and thrive.
Smart TV Buyer Insights Survey 2024 by 91mobiles.pdf91mobiles
91mobiles recently conducted a Smart TV Buyer Insights Survey in which we asked over 3,000 respondents about the TV they own, aspects they look at on a new TV, and their TV buying preferences.
The Art of the Pitch: WordPress Relationships and SalesLaura Byrne
Clients don’t know what they don’t know. What web solutions are right for them? How does WordPress come into the picture? How do you make sure you understand scope and timeline? What do you do if sometime changes?
All these questions and more will be explored as we talk about matching clients’ needs with what your agency offers without pulling teeth or pulling your hair out. Practical tips, and strategies for successful relationship building that leads to closing the deal.
Encryption in Microsoft 365 - ExpertsLive Netherlands 2024Albert Hoitingh
In this session I delve into the encryption technology used in Microsoft 365 and Microsoft Purview. Including the concepts of Customer Key and Double Key Encryption.
Neuro-symbolic is not enough, we need neuro-*semantic*Frank van Harmelen
Neuro-symbolic (NeSy) AI is on the rise. However, simply machine learning on just any symbolic structure is not sufficient to really harvest the gains of NeSy. These will only be gained when the symbolic structures have an actual semantics. I give an operational definition of semantics as “predictable inference”.
All of this illustrated with link prediction over knowledge graphs, but the argument is general.
Accelerate your Kubernetes clusters with Varnish CachingThijs Feryn
A presentation about the usage and availability of Varnish on Kubernetes. This talk explores the capabilities of Varnish caching and shows how to use the Varnish Helm chart to deploy it to Kubernetes.
This presentation was delivered at K8SUG Singapore. See https://feryn.eu/presentations/accelerate-your-kubernetes-clusters-with-varnish-caching-k8sug-singapore-28-2024 for more details.
Accelerate your Kubernetes clusters with Varnish Caching
COMPARING THE IMPACT OF MOBILE NODES ARRIVAL PATTERNS IN MANETS USING POISSON AND PARETO MODELS
1. International Journal of Wireless & Mobile Networks (IJWMN) Vol. 5, No. 4, August 2013
DOI : 10.5121/ijwmn.2013.5410 135
COMPARING THE IMPACT OF MOBILE NODES
ARRIVAL PATTERNS IN MANETS USING
POISSON AND PARETO MODELS
John Tengviel1
, and K. Diawuo2
1
Department of Computer Science, Sunyani Polytechnic, Sunyani, Ghana
john2001gh@yahoo.com
2
Department of Computer Engineering, KNUST, Kumasi, Ghana
kdiawuo@yahoo.com
ABSTRACT
Mobile Ad hoc Networks (MANETs) are dynamic networks populated by mobile stations, or mobile nodes
(MNs). Mobility model is a hot topic in many areas, for example, protocol evaluation, network
performance analysis and so on.How to simulate MNs mobility is the problem we should consider if we
want to build an accurate mobility model. When new nodes can join and other nodes can leave the network
and therefore the topology is dynamic.Specifically, MANETs consist of a collection of nodes randomly
placed in a line (not necessarily straight). MANETs do appear in many real-world network applications
such as a vehicular MANETs built along a highway in a city environment or people in a particular
location. MNs in MANETs are usually laptops, PDAs or mobile phones.
This paper presents comparative results that have been carried out via Matlab software simulation. The
study investigates the impact of mobility predictive models on mobile nodes’ parameters such as, the
arrival rate and the size of mobile nodes in a given area using Pareto and Poisson distributions. The
results have indicated that mobile nodes’ arrival rates may have influence on MNs population (as a larger
number) in a location. The Pareto distribution is more reflective of the modeling mobility for MANETs
than the Poisson distribution.
KEYWORDS
Mobility Models, MANETs, Mobile Nodes Distribution, Arrival Patterns, Pareto Distribution, Poisson
Distribution, Matlab Simulation.
1.INTRODUCTION
Mobile Ad-hoc NETworks (MANETs) is a collection of wireless mobile nodes configured to
communicate amongst each other without the aid of an existing infrastructure. MANETS are
Multi-Hop wireless networks since one node may not be indirect communication range of other
node. In such cases the data from the original sender has to travel a number of hops (hop is one
communication link) in order to reach the destination. The intermediate nodes act as routers and
forward the data packets till the destination is reached [1].
2. International Journal of Wireless & Mobile Networks (IJWMN) Vol. 5, No. 4, August 2013
136
Recently, with the deployment of all kinds of wireless devices, wireless communication is
becoming more important. In this research area, Ad-Hoc network is a hot topic which has
attracted much of research attentions. A wireless ad hoc network is a decentralized wireless
network. The network is ad hoc because it does not rely on a preexisting infrastructure, such
as routers in wired networks or access points in managed (infrastructure) wireless networks.
Instead, each node participates in routing by forwarding data for other nodes, and so the
determination of which nodes forward data is made dynamically based on the network
connectivity [2]. There are different kinds of routing protocol defined by how messages are sent
from the source node to the destination node.
Based on this, it’s reasonable to consider node mobility as an essential topic of ad-hoc network.
With an accurate mobility model which represents nodes movement, designers can evaluate
performance of protocols, predict user distribution, plan network resources allocation and so on.
It can also be used in healthcare or traffic control area rescue mission, and so on.
Ad hoc networks are viewed to be suitable for all situations in which a temporary communication
is desired. The technology was initially developed keeping in mind the military applications [3]
such as battle field in an unknown territory where an infrastructure network is almost impossible
to have or maintain. In such situations, the ad hoc networks having self-organizing [4] capability
can be effectively used where other technologies either fail or cannot be effectively deployed.
The entire network is mobile, and the individual terminals are allowed to move freely. Since, the
nodes are mobile; the network topology is thus dynamic. This leads to frequent and unpredictable
connectivity changes. In this dynamic topology, some pairs of terminals may not be able to
communicate directly with each other and have to rely on some other terminals so that the
messages are been delivered to their destinations. Such networks are often referred to as multi-
hops or store-and-forward networks [5].
This paper presents a study on mobile nodes arrival patterns in MANETs using Poisson and
Pareto models. Though not very realistic from a practical point of view, a model based on the
exponential distribution can be of great importance to provide an insight into the mobile nodes
arrival pattern. The section 2 illustrates a brief review on MANETs studies. The section 3
introduces the Poisson and Pareto distribution models. The simulation procedures and considered
parameters are presented in section 4. The obtained results are objects in section 5 and the section
6 closes the paper to further research works.
2. RELATED WORKS
Currently there are two types [6, 7]of mobility models used in simulation of networks. These are
traces and synthetic models. Traces are those mobility patterns that are observed in real-life
systems. Traces provide accurate information, especially when they involve a large number of
mobile nodes (MNs) and appropriate long observation period. On the other hand, synthetic
models attempt to realistically represent the behaviour of MNs without the use of traces. They are
divided into two categories, entity mobility models and group mobility models [1, 8, 9]. The
entity mobility models randomise the movements of each individual node and represent MNs
whose movements are independent of each other. However, the group mobility models are a set
of groups’ nodes that stay close to each other and then randomise the movements of the group
3. International Journal of Wireless & Mobile Networks (IJWMN) Vol. 5, No. 4, August 2013
137
and represent MNs whose movements are dependent on each other. The node positions may also
vary randomly around the group reference point. In [10], the mobility study in ad hoc has been
approximated to pedestrian in the street, willing to exchange content (multimedia files, mp3, etc.)
with their handset whilst walking at a relative low speed. Some researchers have proposed basic
mobility models such as Random Walk, Random Waypoint, [3, 4], etc. for performance
comparison of various routing protocols. The concern with these basic designed models is that
they represent a specific scenarios not often found in real lives. Hence their use in ad hoc network
studies is very limited. Random Walk or Random Waypoint model though simple and elegant,
produce random source of entry into a location with scattered pattern around the simulation area,
sudden stops and sharp turns. In real-life, this may not really be the case.
3. MODELS OF STUDY
3.1. POISSON ARRIVAL DISTRIBUTION (NUMBER OF NODES)
When arrivals occur at random, the information of interest is the probability of n arrivals in a
given time period, where n = 0, 1, 2, . ……n-1
Let ג be a constant representing the average rate of arrival of nodes and consider a small time
interval ∆t, with ∆t →0. The assumptions for this process are as follows:
• The probability of one arrival in an interval of ∆t seconds, say (t, t+∆t) is ג∆t,
independent of arrivals in any time interval not overlapping (t, t+∆t).
• The probability of no arrivals in ∆t seconds is 1-ג∆t, under such conditions, it can be
shown that the probability of exactly n nodes arriving during an interval of length of t is
given by the Poisson distribution law [11] in equation 1:
( ) =
( )
!
, where . (1)
The assumption of Poisson MN arrivals also implies a distribution of the time intervals between
the arrivals of successive MN in a location.
3.2. Pareto Distribution
The Pareto distributions [12-14] are characterized by two parameters: α and β. Parameter α is
called shape parameter that determines heavy-tailed characteristics and β =1 is called cutoff or
the location parameter that determines the average of inter-arrival time.
The node arrival times of the Pareto distribution are independent and identically distributed,
which means that each arrival time has the same probability distribution as the other arrival times
and all are mutually independent. The two main parameters of the Pareto process are the shape
and the scale parameter (x).
For one parameter Pareto ( shape only), the distribution function can be written as equation 2:
( ) = 1 − , ≥ 0 (2)
4. International Journal of Wireless & Mobile Networks (IJWMN) Vol. 5, No. 4, August 2013
138
The pdf is given as in equation 3:
( ) = ( )
(3)
and for the two – parameter Pareto distribution function defined over the real numbers can be
written as in (4):
⎩
⎪
⎨
⎪
⎧ ( ) = 1 −
,
≥ 0; , > 0
(4)
Its pdf is given as in equation 5:
( ) = ∗ (5)
4. METHODOLOGY
4.1. Varying of αin Pareto Arrival Distribution
We assume the arrival distribution on the MNs population by using Pareto distributions.
Table 1: Varying α parameter values
Scenario 1 2 3 4 5
α (B) 0.3 0.
4
0
.5
0.
8
0.9
For the simulations purposes, the varying α values are been considered. Heavy-tail is been
modeled by a Pareto distribution and the main principle can be attributed to the principle of
number of nodes. We have performed the simulations for a wide range of parameter values as in
Table 1 for both one-parameter and two-parameter Pareto models.
4.2.VARYING OF ARRIVAL RATES FOR NODE DISTRIBUTION
The arrival pattern of mobile nodes has an impact on the performance of the network. In this
scope, we have decided to analysis the effect of arrival distribution on the MNs population in a
given area by using Poisson distribution as in equation 1.In most real-world MANETs, the node
population in an area of interest varies with time. In this simulation, it is therefore necessary to
investigate the impact of arrivals of MNs on the MANETs mobility.
The simulation area does not change as the arrival rate changes. The different values of arrival
rates being considered in this study are shown in Table 2.
Table 2: Varying Arrival Rates
Scenario 1 2 3 4 5
Arrival rates 0.
3
0.
4
0
.5
0.
8
0.9
5. International Journal of Wireless & Mobile Networks (IJWMN) Vol. 5, No. 4, August 2013
139
0 2 4 6 8 10 12 14 16 18 20
0
0.5
1
1.5
Exponential Distribution
PDF
x - Number of Nodes
lam = 0.5
lam1 =0.8
lam2 = 1
lam3=1.5
0 2 4 6 8 10 12 14 16 18 20
0
0.2
0.4
0.6
0.8
1
1.2
1.4
1.6
1.8
2
PARETOPDF
Prob
x - Number of Nodes
B1= 0.5, k=1
B2= 0.8, k=1
B3= 1, k=1
B4= 1.5, k=1
B5= 2, k=1
During the simulation, nodes were allowed to enter the location from a common source (0
degrees) but not from different sources. The number of MNs that entered the location was
assumed to be Poisson distributed with varying arrival rates.
5. RESULTS AND DISCUSSION
5.1. Comparative Study using Pareto Arrival Pattern
In this section, the effect of arrival rates on MNs distribution and population in a defined location
is analyzed as shown in Figure 1. It was observed that the various arrival rates increased the
number of MNs also increased but to a certain limit. It is therefore the indication that every
location has a limit or capacity of MNs it can contain.
Figure 1: Single Parameter for Varying Values for B, and Exponential for Twenty Nodes
Figure 1may indicate that the exponential distribution was higher than the single parameter in the
initial stages but as time progresses the exponential decreases fast to zero. The single parameter
Pareto overtakes the exponential as the number of nodes increases and indication that the single
parameter performs better than exponential distribution.
The Pareto distribution may show tail that decays much more slowly than the exponential
distribution. The alpha is the shape parameter which determines the characteristics “decay” of the
distribution (tail index) and A is the location parameter which defines the minimum value of x
(number of nodes).
6. International Journal of Wireless & Mobile Networks (IJWMN) Vol. 5, No. 4, August 2013
140
0 2 4 6 8 10 12 14 16 18 20
0
0.2
0.4
0.6
0.8
1
1.2
1.4
1.6
1.8
2
PARETO PDF
Prob
x - Number of Nodes
B1 = 0.5, k=1
B2 = 0.8, k=1
B3 = 1, k=1
B4 = 1.5, k=1
B5 = 2, k=1
0 2 4 6 8 10 12 14 16 18 20
0
0.5
1
1.5
Exponential Distribution
PDF
x - Number of Nodes
lam = 0.5
lam1 =0.8
lam2 = 1
lam3=1.5
Figure 2: Two Parameter Pareto for Varying B Values and Exponential
In Figure2 the comparison between the two-parameter Pareto and exponential distributions is
illustrated. It is obvious that the two-parameter Pareto outweighs the exponential distribution as
the number of MNs increases. The exponential distributions decays very fast and finally get to
the a-axis unlike the two-parameter Pareto distribution where some of the arrival rates
distribution has not decay to zero.
However the two-parameter Pareto performed well than the one-parameter Pareto, since some of
the arrival of the two-parameter did not decay to zero. The long-tailed nature of the two-
parameter Pareto helped to clear out any congestion in a location when the arrival rate was small
and the reverse was also true.
5.2 Effect of Varying Arrival Rates
In Figure 3, the effect of varying nodes’ arrival rate is computed using Poisson model. Nodes
may arrive at a location either in some regular pattern or in a totally random fashion. The arrival
rates have shown to impact on the number of nodes in a particular location, although every
location has a limited capacity. A high number of nodes typically translate into a higher average
number of neighbours per node, which influences the route availability.
7. International Journal of Wireless & Mobile Networks (IJWMN) Vol. 5, No. 4, August 2013
141
Figure 3: For Twenty Number of Nodes for varying Arrival rates
In reality, the total connection time of a node over a specific interval depends on the nodes
encounter rate and the time in each encounter, both of which depend on the relative mobility of
nodes.
Although a high node arrivals results in more node encounters, the network would eventually
become congested. The impact of this relationship is that nodes can and will be tightly packed
(i.e. High density) if their arrival rates is high (congestion), but if the arrivals is lower, the nodes
must be farther apart (low density). For instance it is clear that there is some congestion for
arrivals of MNs, since they have to follow some holding paths.
As the value of arrival rate increases, the shape of the distribution changes dramatically to a more
symmetrical (”normal'') form and the probability of a larger number of arrivals increases with
increasing number of MNs. An interesting observation is that as the arrival rate increases, the
properties of the Poisson distribution approach those of the normal distribution as in Figure3.
The first arrival processes of nodes give higher contact probabilities at higher arriving rates. This
is due to the nodes’ contiguity one to another making mobility difficult. In practice, one may
record the actual number of arrivals over a period and then compare the frequency of distribution
of the observed number of arrival to the Poisson distribution to investigate its approximation of
the arrival distribution.
6. CONCLUSION
The arrival patterns have shown some impact on the network population, as the arrival rate
increases the MNs population also increases to a peak and then decays rapidly to the x-axis. It
was realized that the Poisson distribution is not good for the arrival distribution; therefore the
Pareto distribution was considered. It has come out clear that the Pareto distribution is good for
the arrival distribution, especially the two-parameter Pareto distribution which performed better
than the single Pareto and exponential distributions even though at the earlier stages the
exponential performed than the single Pareto distribution with a faster decay.
0 2 4 6 8 1 0 1 2 1 4 1 6 1 8 2 0
0
0 . 0 2
0 . 0 4
0 . 0 6
0 . 0 8
0 . 1
0 . 1 2
0 . 1 4
0 . 1 6
0 . 1 8
ProbabiltyDistribution
N u m b e r o f N o d e s
N o d e s A rrivin g D u rin g T im e t
A rriva l R a t e = 0 . 3
A rriva l R a t e = 0 . 4
A rriva l R a t e = 0 . 5
A rriva l R a t e = 0 . 8
A rriva l R a t e = 0 . 9
8. International Journal of Wireless & Mobile Networks (IJWMN) Vol. 5, No. 4, August 2013
142
It may subsequently be admitted that mobility in MANETs is a difficult work and actually. It is
an interesting research area that has been growing in recent years. Its difficulty is mainly
generated because of the continuous changes in the network topology with time. The topological
changes have impact on mobility techniques developed for infrastructure-based networks thus
may not be directly applied to mobile adhoc networks. We have investigated through simulation
mobility prediction of MNs using the queueing model.
REFERENCES
[1] J. Boleng, T. Camp, and V. Tolety. “A Suvey of Mobility Models for Ad hoc Network Research”, In Wireless
Communication and Mobile Computing (WCMC), Vol. 2, No. 5, pages 483 – 502, 2002.
[2] Subir Kumar Sarkar, T. G. Basavaraju, C. Puttamadappa, “Mobility Models for Mobile Ad Hoc Networks”,
2007, Page 267 – 277, Auerbach Publications – www.auerbach-publications.comVolume 2, No.5, 2002.
[3] C. Rajabhushanam and A. Kathirvel, “Survey of Wireless MANET Application in Battlefield Operations”,
(IJACSA) International Journal of Advanced Computer Science and Applications, Vol. 2, No.1, January 2011.
[4] Buttyan L., and Hubaux J. P., “Stimulating cooperation in self-organizing mobile ad hoc networks. Mobile
Networks andApplications: Special Issue on Mobile Ad Hoc Networks, 8(5), 2003.
[5] C.P.Agrawal, O.P.Vyas and M.K Tiwari, “Evaluation of Varying Mobility Models & Network Loads on DSDV
Protocol of MANETs”, International Journal on Computer Science and Engineering Vol.1 (2), 2009, pp. 40 - 46.
[6] P. N. Pathirana, A. V. Savkin& S. K. Jha. “Mobility modeling and trajectory prediction for cellular networks
with mobile base stations”. MobiHoc 2003: 213 -221.
[7] MohdIzuanMohdSaad and Zuriati Ahmad Zukarnain, “Performance Analysis of Random-Based Mobility
Models in MANET Routing Protocol, EuroJournals Publishing, Inc. 2009, ISSN 1450-216X Vol.32 No.4 (2009),
pp.444-454 http://www.eurojournals.com/ejsr.htm
[8] Zainab R. Zaidi, Brian L. Mark: “A Distributed Mobility Tracking Scheme for Ad-Hoc Networks Based on an
Autoregressive Model”. The 6th International Workshop of Distributed Computing, Kolkata, India (2004)
447(458)
[9] Abdullah, SohailJabbar, ShafAlam and Abid Ali Minhas, “Location Prediction for Improvement of
Communication Protocols in Wireless Communications: Considerations and Future Directions”, Proceedings of
the World Congress on Engineering and Computer Science 2011 Vol. II WCECS 2011, October 19-21, 2011,
San Francisco, USA
[10] Gunnar Karisson et al., “A Mobility Model for Pedestrian Content Distribution”, SIMUTools ’09 workshops,
March 2-6, 2009, Rome Italy.
[11] John Tengviel, K. A. Dotche and K. Diawuo, “The Impact of Mobile Nodes Arrival Patterns In Manets Using
Poisson Models”, International Journal of Managing Information Technology (IJMIT), Vol. 4, No. 3, August
2012, pp. 55 – 71.
[12] Martin J. Fischer and Carl M. Harris, “A Method for Analysing Congestion In Pareto and Related Queues”, pp.
15 – 18.
[13] K. Krishnamoorthy, “Handbook of Statistical Distributions with Applications”, University of Louisiana at
Lafayette, U.S.A. pp. 257 – 261.
[14] Kyunghan Lee, Seongik Hong, Seong Joon Kim, Injong Rhee and Song Chong, “SLAW: Self-Similar Least-
Action Human Walk”, published in the Proceedings of the IEEE Conference on Computer Communications
(INFOCOM), Rio de Janeiro, Brazil, April 19–25, 2009.. PP. 855 – 863.
Authors
John Tengvie
He is a holder of a BSc. Computer Science from Kwame Nkrumah University of Science and
Technology (KNUST) in 2001 and MSc. Telecommunication Engineering from College of
Engineering at the same university in 2012. He is currently a Lecturer with the Department of
Computer Science at Sunyani Polytechnic. His research interests include Mobile Ad hoc Networks,
Wireless Communication, Mobility modeling , MANETs and Database System.
Nana (Dr.) Kwasi Diawuo is a senior lecturer of the Department of Computer Engineering at Kwame Nkrumah
University of Science and Technology (KNUST), Kumasi, Ghana. He earned a BSc. (Electrical/ Electronic
Engineering) from KNUST, M.Sc., Ph.D, and MGhIE. He is a member of the Institution of Electrical and Electronic
Engineers (IEEE) and Computer Society (of IEEE).