In wireless heterogeneous network, nodes are mobile
equipment and can move freely from one area to another. A
group of users with a large range of mobility can access around
in the overall network cause high traffic. In these
heterogeneous networks, resources are shared among all users
and the amount of available resources is determined by traffic
load. The traffic load can seriously affect on quality of services
for users thus it requires efficient management in order to
improve service quality. If traffic load is concentrated in a
cell, this cell becomes the hotspot cell. There is a need to have
a proper traffic driven handoff management scheme, so that
users will automatically move from congested cell to allow
the network to dynamically self-balance. This research
proposed an approach which adopts a hard handoff scheme to
dynamically control the handoff time according to the load
status of cells. The result shows that the effect of hotspot
threshold is the most important in initiation the handoff
process. Therefore, by incorporating value of traffic load as
adaptive factors, it shows how the handoff initiation criteria
might be set in accordance with the quality of services
requested by users.
A scalable and power efficient solution for routing in mobile ad hoc network ...ijmnct
This document summarizes a research paper that proposes a scalable and power-efficient routing solution for mobile ad hoc networks (MANETs). The paper describes a cluster-based MANET architecture and develops a graph theoretic routing algorithm that finds paths from source to destination nodes using routes with minimum cumulative degree. Simulation results show that the algorithm provides efficient routing paths even as the number of nodes increases, and uses multi-hop connectivity to transmit packets using minimum power irrespective of the number of nodes in the network. The algorithm is shown to be scalable and power efficient compared to other routing methods.
Efficient energy, cost reduction, and QoS based routing protocol for wireless...IJECEIAES
Recent developments and widespread in wireless sensor network have led to many routing protocols, many of these protocols consider the efficiency of energy as the ultimate factor to maximize the WSN lifetime. The quality of Service (QoS) requirements for different applications of wireless sensor networks has posed additional challenges. Imaging and data transmission needs both QoS aware routing and energy to ensure the efficient use of sensors. In this paper, we propose an Efficient, Energy-Aware, Least Cost, (ECQSR) quality of service routing protocol for sensor networks which can run efficiently with best-effort traffic processing. The protocol aims to maximize the lifetime of the network out of balancing energy consumption across multiple nodes, by using the concept of service differentiation, finding lower cost by finding the shortest path using nearest neighbor algorithm (NN), also put certain constraints on the delay of the path for real-time data from where link cost that captures energy nodes reserve, energy of the transmission, error rate and other parameters. The results show that the proposed protocol improves the network lifetime and low power consumption.
1) The document analyzes how carrier aggregation (CA) in LTE-Advanced affects the total power transmitted by eNodeBs to meet users' quality of service (QoS) requirements.
2) It derives a general expression showing that the eNodeB's total transmit power is inversely proportional to the channel bandwidth and directly proportional to the cell radius and number of users.
3) Numerical analysis of single-cell and multi-cell scenarios show that using two-carrier CA can reduce the eNodeB's required transmit power by around 65% compared to a single carrier, improving energy efficiency.
Quality of Service for Video Streaming using EDCA in MANETijsrd.com
Mobile Ad-hoc network(MANET) is a collection of wireless terminals that are able to dynamically form a temporary network. To establish such a network no fixed infrastructure is required. Here, it is the responsibility of network nodes to forward each other's packets and thus these nodes also act as routers. In such a network resources are limited and also topology changes dynamically. So providing Quality of service(QoS) is also necessary. QoS is more important for real time applications for example Video Streaming. IEEE 802.11e network standard supports QoS through EDCA technique. This technique does not fulfill the requirements of QoS. So, in this project modified EDCA technique is proposed to enhance QoS for Video Streaming application. This technique is implemented in NS2 and compared with traditional EDCA.
Iaetsd increasing network life span of manet by usingIaetsd Iaetsd
This document proposes algorithms to maximize network lifetime in wireless sensor networks using cooperative MAC protocols. It formulates the problems of minimizing transmission power and maximizing network lifetime as cross-layer optimization problems considering routing, relay selection, and power allocation. Distributed algorithms are presented that solve these problems for both direct transmission and cooperative transmission modes. The algorithms select routes and relay nodes to minimize power consumption or equalize node lifetimes while meeting requirements for transmission success probability and rate.
PERFORMANCE ANALYSIS IN CELLULAR NETWORKS CONSIDERING THE QOS BY RETRIAL QUEU...IJCNCJournal
In this article, a retrial queueing model will be considered with persevering customers for wireless cellular
networks which can be frequently applied in the Fractional Guard Channel (FGC) policies, including
Limited FGC (LFGC), Uniform FGC (UFGC), Limited Average FGC (LAFGC) and Quasi Uniform FGC
(QUFGC). In this model, the examination on the retrial phenomena permits the analyses of important
effectiveness measures pertained to the standard of services undergone by users with the probability that a
fresh call first arrives the system and find all busy channels at the time, the probability that a fresh call
arrives the system from the orbit and find all busy channels at the time and the probability that a handover
call arrives the system and find all busy channels at the time. Comparison between four types of the FGC
policy can befound to evaluate the performance of the system.
This document discusses optimization of routing protocols in mobile ad hoc networks (MANETs) using a genetic algorithm. It begins with an abstract describing a novel energy-efficient routing algorithm based on mobile agents that collects network information to choose the shortest path and minimize energy consumption. It then provides background on proactive and reactive routing protocols like DSR, and discusses related work on low power routing protocols including minimum power routing, battery-cost-aware routing, and the route discovery process in DSR.
SECTOR TREE-BASED CLUSTERING FOR ENERGY EFFICIENT ROUTING PROTOCOL IN HETEROG...IJCNCJournal
The document proposes a new routing protocol called Sector Tree-Based Clustering for Energy Efficient Routing Protocol (STB-EE) for wireless sensor networks. STB-EE partitions the sensor field into dynamic sectors to balance the number of nodes per cluster. Within each sector, STB-EE constructs a minimum spanning tree to connect nodes and reduce long-distance communication. STB-EE selects cluster heads based on remaining energy and distance to the base station. Simulation results show STB-EE can improve network lifespan by about 15-16% compared to other protocols.
A scalable and power efficient solution for routing in mobile ad hoc network ...ijmnct
This document summarizes a research paper that proposes a scalable and power-efficient routing solution for mobile ad hoc networks (MANETs). The paper describes a cluster-based MANET architecture and develops a graph theoretic routing algorithm that finds paths from source to destination nodes using routes with minimum cumulative degree. Simulation results show that the algorithm provides efficient routing paths even as the number of nodes increases, and uses multi-hop connectivity to transmit packets using minimum power irrespective of the number of nodes in the network. The algorithm is shown to be scalable and power efficient compared to other routing methods.
Efficient energy, cost reduction, and QoS based routing protocol for wireless...IJECEIAES
Recent developments and widespread in wireless sensor network have led to many routing protocols, many of these protocols consider the efficiency of energy as the ultimate factor to maximize the WSN lifetime. The quality of Service (QoS) requirements for different applications of wireless sensor networks has posed additional challenges. Imaging and data transmission needs both QoS aware routing and energy to ensure the efficient use of sensors. In this paper, we propose an Efficient, Energy-Aware, Least Cost, (ECQSR) quality of service routing protocol for sensor networks which can run efficiently with best-effort traffic processing. The protocol aims to maximize the lifetime of the network out of balancing energy consumption across multiple nodes, by using the concept of service differentiation, finding lower cost by finding the shortest path using nearest neighbor algorithm (NN), also put certain constraints on the delay of the path for real-time data from where link cost that captures energy nodes reserve, energy of the transmission, error rate and other parameters. The results show that the proposed protocol improves the network lifetime and low power consumption.
1) The document analyzes how carrier aggregation (CA) in LTE-Advanced affects the total power transmitted by eNodeBs to meet users' quality of service (QoS) requirements.
2) It derives a general expression showing that the eNodeB's total transmit power is inversely proportional to the channel bandwidth and directly proportional to the cell radius and number of users.
3) Numerical analysis of single-cell and multi-cell scenarios show that using two-carrier CA can reduce the eNodeB's required transmit power by around 65% compared to a single carrier, improving energy efficiency.
Quality of Service for Video Streaming using EDCA in MANETijsrd.com
Mobile Ad-hoc network(MANET) is a collection of wireless terminals that are able to dynamically form a temporary network. To establish such a network no fixed infrastructure is required. Here, it is the responsibility of network nodes to forward each other's packets and thus these nodes also act as routers. In such a network resources are limited and also topology changes dynamically. So providing Quality of service(QoS) is also necessary. QoS is more important for real time applications for example Video Streaming. IEEE 802.11e network standard supports QoS through EDCA technique. This technique does not fulfill the requirements of QoS. So, in this project modified EDCA technique is proposed to enhance QoS for Video Streaming application. This technique is implemented in NS2 and compared with traditional EDCA.
Iaetsd increasing network life span of manet by usingIaetsd Iaetsd
This document proposes algorithms to maximize network lifetime in wireless sensor networks using cooperative MAC protocols. It formulates the problems of minimizing transmission power and maximizing network lifetime as cross-layer optimization problems considering routing, relay selection, and power allocation. Distributed algorithms are presented that solve these problems for both direct transmission and cooperative transmission modes. The algorithms select routes and relay nodes to minimize power consumption or equalize node lifetimes while meeting requirements for transmission success probability and rate.
PERFORMANCE ANALYSIS IN CELLULAR NETWORKS CONSIDERING THE QOS BY RETRIAL QUEU...IJCNCJournal
In this article, a retrial queueing model will be considered with persevering customers for wireless cellular
networks which can be frequently applied in the Fractional Guard Channel (FGC) policies, including
Limited FGC (LFGC), Uniform FGC (UFGC), Limited Average FGC (LAFGC) and Quasi Uniform FGC
(QUFGC). In this model, the examination on the retrial phenomena permits the analyses of important
effectiveness measures pertained to the standard of services undergone by users with the probability that a
fresh call first arrives the system and find all busy channels at the time, the probability that a fresh call
arrives the system from the orbit and find all busy channels at the time and the probability that a handover
call arrives the system and find all busy channels at the time. Comparison between four types of the FGC
policy can befound to evaluate the performance of the system.
This document discusses optimization of routing protocols in mobile ad hoc networks (MANETs) using a genetic algorithm. It begins with an abstract describing a novel energy-efficient routing algorithm based on mobile agents that collects network information to choose the shortest path and minimize energy consumption. It then provides background on proactive and reactive routing protocols like DSR, and discusses related work on low power routing protocols including minimum power routing, battery-cost-aware routing, and the route discovery process in DSR.
SECTOR TREE-BASED CLUSTERING FOR ENERGY EFFICIENT ROUTING PROTOCOL IN HETEROG...IJCNCJournal
The document proposes a new routing protocol called Sector Tree-Based Clustering for Energy Efficient Routing Protocol (STB-EE) for wireless sensor networks. STB-EE partitions the sensor field into dynamic sectors to balance the number of nodes per cluster. Within each sector, STB-EE constructs a minimum spanning tree to connect nodes and reduce long-distance communication. STB-EE selects cluster heads based on remaining energy and distance to the base station. Simulation results show STB-EE can improve network lifespan by about 15-16% compared to other protocols.
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
This document summarizes a research paper that proposes a novel cross-layer routing technique for mobile ad hoc networks. The technique calculates both signal strength and node mobility to select the most efficient and stable path for data transmission. It aims to improve on traditional ad hoc routing protocols like AODV by considering both link quality metrics from the physical layer (signal strength) and node mobility. The proposed method selects routes based on signal strength if mobility is high, and on traditional hop count if mobility is low, in order to find paths that reduce link failure and improve throughput.
Optimized Cluster Establishment and Cluster-Head Selection Approach in WSNIJCNCJournal
In recent years, limited resources of user products and energy-saving are recognized as the major challenges of Wireless Sensor Networks (WSNs). Clustering is a practical technique that can reduce all energy consumption and provide stability of workload that causes a larger difference in energy depletion among other nodes and cluster heads (CHs). In addition, clustering is the solution of energy-efficient for maximizing the network longevity and improvising energy efficiency. In this paper, a novel OCE-CHS (Optimized Cluster Establishment and Cluster-Head Selection) approach for sensor nodes is represented to improvise the packet success ratio and reduce the average energy-dissipation. The main contribution of this paper is categorized into two processes, first, the clustering algorithm is improvised that periodically chooses the optimal set of the CHs according to the speed of the average node and average-node energy. This is considerably distinguished from node-based clustering that utilizes a distributed clustering algorithm to choose CHs based on the speed of the current node and remaining node energy. Second, more than one factor is assumed for the detached node to join the optimal cluster. In the result section, we discuss our clustering protocols implementation of optimal CH-selection to evade the death of SNs, maximizing throughput, and further improvise the network lifetime by minimizing energy consumption.
IMPROVED QUALITY OF SERVICE PROTOCOL FOR REAL TIME TRAFFIC IN MANETIJCNCJournal
This document proposes an improved quality of service protocol for real-time traffic in mobile ad hoc networks. It presents a modified version of the AODV routing protocol that provides two key improvements: 1) A balanced best-effort traffic aware route discovery mechanism that selects paths with lower ratios of best-effort packets to minimize their impact on real-time traffic. 2) A packet forwarding procedure that gives transmission priority to real-time packets by transmitting them immediately from the queue while best-effort packets have to wait, improving throughput for real-time applications. Simulation results show the proposed protocol performs better than basic AODV in terms of throughput and delay for real-time traffic.
Enhanced Routing and Cluster Based Algorithms in WSNs to Improve Communicatio...IJSRED
This document summarizes a research paper that proposes and evaluates several routing algorithms to improve communication and energy efficiency in wireless sensor networks. It begins with an introduction to wireless sensor networks and discusses existing routing protocols. It then describes four proposed algorithms: RTP-AMODV, MAODV, MM-LEACH, and E-LEACH. The document outlines the methodology used to simulate and compare the performance of these proposed algorithms against existing routing protocols using metrics like packet delivery ratio, end-to-end delay, throughput, and node energy. The results show the enhanced LEACH (E-LEACH) algorithm achieved better performance than the others in terms of throughput, packet delivery ratio, delay, energy consumption, and network lifetime
Downlink beamforming and admissin control for spectrum sharing cognitive radi...acijjournal
n this paper, to detect the moving objects between frames in compressed video and to obtain the bes
t
compression video
and the noiseless video. We describe a video in which frames by classifying
macroblocks (MB), and describe motion estimation (ME), motion vector field (MV) and motion
compensation (MC). we propose to classify Macroblocks of each video frame into different
classes and use
this class information to describe the frame content based on the motion vector. MB class informatio
n
video applications such as shot change detection, motion discontinuity detection, Outlier rejection
for
global motion estimation. To reduc
e the noise and to improve the clarity of the compressed video by using
contrast limited adaptive histogram equalization (CLAHE) Algorithm
ENERGY LOCATION AWARE ROUTING PROTOCOL (ELARP) FOR WIRELESS MULTIMEDIA SENSOR...ijcsit
Wireless Sensor Networks (WSNs)have sensor nodes that sense and extract information from surrounding
environment, processing information locally then transmit it to sink wirelessly. Multimedia data is larger in
volume than scalar data, thus transmitting multimedia data via Wireless Multimedia Sensor Networks
(WMSNs) requires stick constraints on quality of services in terms of energy, throughput and end to end
delay.Multipath routing is to discover multipath during route discovery from source to sink. Discover
multipath and sending data via these different paths improve the bandwidth and decrease the end to end
delay. This paper introduces an Energy Location Aware Routing Protocol (ELARP) which is reactive
multipath routing protocol establishing three paths with awareness of node’s residual energy and distance.
ELARP has experimented with NS2 simulator. The simulation results show that ELARP enhances QoS for
multimedia data in terms of end to end delay and packet delivery ratio.
Design and implementation of new routingIJCNCJournal
Energy consumption is a key element in the Wireless Sensor Networks (WSNs) design. Indeed, sensor nodes are really constrained by energy supply. Hence, how to improve the network lifetime is a crucial and challenging task. Several techniques are available at different levels of the OSI model to maximize the WSN lifetime and especially at the network layer which uses routing strategies to maintain the routes in the network and guarantee reliable communication. In this paper we intend to propose a new protocol called
Combined Energy and Distance Metrics Dynamic Routing Protocol (CEDM-DR). Our new approach considers not only the distance between wireless sensors but also the energy of node acting as a router in order to find the optimal path and achieve a dynamic and adaptive routing.
The performance metrics exploited for the evaluation of our protocol are average energy consumed, network lifetime and packets lost. By comparing our proposed routing strategy to protocol widely used in WSN namely Ad hoc On demand Distance Vector(AODV), simulation results show that CEDM-DR strategy might effectively balance the sensor power consumption and permits accordingly to enhance the network
lifetime. As well, this new protocol yields a noticeable energy saving compared to its counterpart.
Nearest Adjacent Node Discovery Scheme for Routing Protocol in Wireless Senso...IOSR Journals
The broad significance of Wireless Sensor Networks is in most emergency and disaster rescue
domain. The routing process is the main challenges in the wireless sensor network due to lack of physical links.
The objective of routing is to find optimum path which is used to transferring packets from source node to
destination node. Routing should generate feasible routes between nodes and send traffic along the selected path
and also achieve high performance. This paper presents a nearest adjacent node scheme based on shortest path
routing algorithm. It is plays an important role in energy conservation. It finds the best location of nearest
adjacent nodes by involving the least number of nodes in transmission of data and set large number of nodes to
sleep in idle mode. Based on simulation result we shows the significant improvement in energy saving and
enhance the life of the network
Novel Position Estimation using Differential Timing Information for Asynchron...IJCNCJournal
Positioning techniques have been a common objective since the early development of wireless networks. However, current positioning methods in cellular networks, for instance, are still primarily focused on the use of the Global Navigation Satellite System (GNSS), which has several limitations, like high power drainage and failure in indoor scenarios. This study introduces a novel approach employing standard LTE signaling in order to provide high accuracy positioning estimation. The proposed technique is designed in analogy to the human sound localization system, eliminating the need of having information from three spatially diverse Base Stations (BSs). This is inspired by the perfect human 3D sound localization with two ears. A field study is carried out in a dense urban city to verify the accuracy of the proposed technique, with more than 20 thousand measurement samples collected. The achieved positioning accuracy is meeting the latest Federal Communications Commission (FCC) requirements in the planner dimension.
Link Stability Based On Qos Aware On - Demand Routing In Mobile Ad Hoc NetworksIOSR Journals
This document summarizes a research paper that proposes a new routing protocol for mobile ad hoc networks (MANETs) that considers link stability and quality of service (QoS) metrics. The protocol estimates link quality based on node mobility prediction using GPS data. It calculates a "cost" metric factoring in link stability and power consumption to select paths with more stable, lower-cost links. Simulation results show the proposed protocol achieves higher throughput and packet delivery ratio compared to existing protocols, with lower control overhead. Future work could incorporate additional link quality metrics and statistical classifiers to further optimize path selection in MANETs.
AN EFFECTIVE CONTROL OF HELLO PROCESS FOR ROUTING PROTOCOL IN MANETSIJCNCJournal
In the mobile ad hoc network (MANET) update of link connectivity is necessary to refresh the neighbor tables in data transfer. A existing hello process periodically exchanges the link connectivity information, which is not adequate for dynamic topology. Here, slow update of neighbour table entries causes link failures which affect performance parameter as packet drop, maximum delay, energy consumption, and reduced throughput. In the dynamic hello technique, new neighbour nodes and lost neighbour nodes are used to compute link change rate (LCR) and hello-interval/refresh rate (r). Exchange of link connectivity information at a fast rate consumes unnecessary bandwidth and energy. In MANET resource wastage can be controlled by avoiding the re-route discovery, frequent error notification, and local repair in the entire network. We are enhancing the existing hello process, which shows significant improvement in performance.
QOS ROUTING AND PERFORMANCE EVALUATION FOR MOBILE AD HOC NETWORKS USING OLSR ...ijasuc
Mobile Ad-Hoc network is a collection of mobile nodes in communication without using infrastructure.
As the real-time applications used in today’s wireless network grow, we need some schemes to provide
more suitable service for them. We know that most of actual schemes do not perform well on traffic which
is not strictly CBR. Therefore, in this paper we have studied the impact, respectively, of mobility models
and the density of nodes on the performances (End-to-End Delay, Throughput and Packet Delivery ratio)
of routing protocol (Optimized Link State Routing) OLSR by using in the first a real-time VBR (MPEG-4)
and secondly the Constant Bit Rate (CBR) traffic. Finally we compare the performance on both cases.
Experimentally, we considered the three mobility models as follows Random Waypoint, Random
Direction and Mobgen Steady State. The experimental results illustrate that the behavior of OLSR change
according to the model and the used traffics.
A Cluster-Based Routing Protocol and Fault Detection for Wireless Sensor NetworkIJCNCJournal
The document proposes a new clustering and routing algorithm for wireless sensor networks that aims to extend network lifetime. Key points:
- The algorithm divides nodes into sensing nodes and relay nodes, with relay nodes responsible for forwarding data to reduce cluster head burden.
- It selects cluster heads and relay nodes based on residual energy to distribute load and avoid early node death.
- A routing tree is constructed among relay nodes to transmit data to the base station in a multi-hop manner, selecting next hops based on residual energy and number of child nodes to balance energy usage.
- The goal is to improve energy efficiency, extend network lifetime, and increase data accuracy through mechanisms like clustering, load balancing, and fault detection
An Information Maximization approach of ICA for Gender ClassificationIDES Editor
In this paper, a novel and successful method for
gender classification from human faces using dimensionality
reduction technique is proposed. Independent Component
Analysis (ICA) is one of such techniques. In the current
scheme, a thrust is given on the different algorithms and
architectures of ICA. An information maximization ICA is
discussed with its two architecture and compared with the two
architectures of fast ICA. Support Vector Machine (SVM) is
used as a classifier for the separation of male and female
classes. All experiments are done on FERET database. Results
are obtained for the different combinations of train and test
database sizes. For larger
training set SVM is performing with an accuracy of 98%. The
accuracy values are varied for change in size of testing set and
the proposed system performs with an average accuracy of
96%. An improvement in performance is achieved using class
discriminability which performs with 100% accuracy.
An Iterative Improved k-means ClusteringIDES Editor
This document presents a new iterative improved k-means clustering algorithm.
The k-means clustering algorithm is widely used but depends on random initial starting points, which can impact the results. The new algorithm aims to provide better initial starting points to improve k-means clustering results.
The algorithm divides the data into K initial groups, calculates new cluster centers iteratively using a distance-based formula, assigns data points to clusters, and repeats until cluster centers no longer change. Experimental results on several datasets show the new algorithm converges in fewer iterations than standard k-means, demonstrating it finds better cluster solutions.
User Controlled Privacy in Participatory SensingIDES Editor
This document describes a proposed model for collaborative infrastructure monitoring using participatory sensing. The model involves:
1) Individual sensor networks deployed in homes/buildings that are connected to a cluster head. Cluster heads share some data with a central base station.
2) Users have control over what data they share and at what level of granularity. They can authorize other users to access their data at different levels.
3) Trust between users is calculated based on their past interactions, to determine how much data one user will share with others. If no past interactions exist, opinions from other trusted users can be used to establish an initial trust value.
4) The goal is to integrate individual sensor networks to monitor infrastructure
GR-FB Block Cleaning Scheme in Flash MemoryIDES Editor
Flash memory is a non-volatitle memory that offers
several superior advantages as a data storage device in many
electronic gadgets. However its two operational characteristics,
namely 1) Out-place updating and 2) Cleaning process will affect
its performance as an efficient storage sub-system if not
managed wisely. This paper proposes a new block cleaning
scheme, called Greedy and Frequency-based (GR-FB). The
scheme combines the victim block selection procedure and
the valid-data re-organizing procedure to improve the block
cleaning process performance. The trace-driven simulations
have shown the GR-FB scheme performs better than existing
cleaning process schemes where the cleaning cost is reduced
at least by 8% and the wear-leveling level for all blocks in the
memory array are nearly equal.
Assessment of Market Power in Deregulated Electricity Market with CongestionIDES Editor
Restructuring of electrical market worldwide has
brought the issue of market competition to the forefront. This
new perspective has given rise to competition with the goal of
price fall and technological innovation in the sector. In the last
few years a great deal of attention is given to the possibility of
a group of producers (agents) exercising market power by means
of congestion effects. The possibility of two agents acting in a
combined way on the Transmission System affecting the
accessibility by the others to a specific Market is analyzed. This
paper describes an algorithm used to detect measure and
evaluate the impact of these kinds of strategic actions on market
concentration. The results obtained from the study using 9 bus
example network shows that this kind of actions can affect
strongly market share and must be predicted by the Independent
System Operator (ISO).
Inverse Gamma Distribution based Delay and Slew Modeling for On- Chip VLSI RC...IDES Editor
The Elmore delay is fast becoming ineffective for
deep submicron technologies, and reduced order transfer
function delays are impractical for use as early-phase design
metrics or as design optimization cost functions. This paper
describes an accurate approach for fitting moments of the
impulse response to probability density functions so that delay
and slew metric can be estimated accurately at an early
physical design stage. PERI (Probability distribution function
Extension for Ramp Inputs) technique has been used that
extends the delay and slew metrics for step inputs to the more
general and realistic non-step or ramp inputs. The accuracy
of the proposed model is justified by the results obtained from
the proposed model and that of SPICE simulations
Energy Efficient Data Transmission through Relay Nodes in Wireless Sensor Net...IDES Editor
In a Wireless Sensor Network (WSN) having a single
sink, information is given to the distant nodes from beacons
by overhearing. Since it is out of the communication range,
information is not sent directly to the static sink (SS). If a
distant node is not able to communicate directly, then it should
send its own packet to another node which is closer to the
Base Station (BS) so that the received packets are relayed to
the BS by this node. In this paper, we propose a relay node
selection algorithm to reduce contention and improve energy
efficiency. In this algorithm, each data packet of direct
communication should include the received signal strength
(RSS) of the beacon packet. The distant node selects a node
with the maximum RSS value as a relay. The algorithm also
assigns transmitting intervals to each relay node. By our
simulation results, we show that our proposed algorithm
improves the packet delivery ratio and energy efficiency.
Depth-Image-based Facial Analysis between Age Groups and Recognition of 3D FacesIDES Editor
Face recognition is still an open problem. Many 2D
face recognition approaches came into light to achieve high
recognition rate. But these approaches are still challenged by
the changes in illuminations, expressions, pose, noise, etc. A
3D face recognition technique is proposed to overcome such
challenges and to enhance robustness to expression variations.
Here, we compare the person at different age groups with
higher recognition rate in comparison to 2D face recognition
techniques. We propose a two stage procedure of 3D face
recognition based on FLD (Fisher Linear Discriminant), SURF
operator and depth-image. First, FLD is used on depth-image
to perform recognition and then the SURF features of 2D
gray images to carry out the refined recognition. Finally, our
proposed work will increase the robustness in expression
variations.
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
This document summarizes a research paper that proposes a novel cross-layer routing technique for mobile ad hoc networks. The technique calculates both signal strength and node mobility to select the most efficient and stable path for data transmission. It aims to improve on traditional ad hoc routing protocols like AODV by considering both link quality metrics from the physical layer (signal strength) and node mobility. The proposed method selects routes based on signal strength if mobility is high, and on traditional hop count if mobility is low, in order to find paths that reduce link failure and improve throughput.
Optimized Cluster Establishment and Cluster-Head Selection Approach in WSNIJCNCJournal
In recent years, limited resources of user products and energy-saving are recognized as the major challenges of Wireless Sensor Networks (WSNs). Clustering is a practical technique that can reduce all energy consumption and provide stability of workload that causes a larger difference in energy depletion among other nodes and cluster heads (CHs). In addition, clustering is the solution of energy-efficient for maximizing the network longevity and improvising energy efficiency. In this paper, a novel OCE-CHS (Optimized Cluster Establishment and Cluster-Head Selection) approach for sensor nodes is represented to improvise the packet success ratio and reduce the average energy-dissipation. The main contribution of this paper is categorized into two processes, first, the clustering algorithm is improvised that periodically chooses the optimal set of the CHs according to the speed of the average node and average-node energy. This is considerably distinguished from node-based clustering that utilizes a distributed clustering algorithm to choose CHs based on the speed of the current node and remaining node energy. Second, more than one factor is assumed for the detached node to join the optimal cluster. In the result section, we discuss our clustering protocols implementation of optimal CH-selection to evade the death of SNs, maximizing throughput, and further improvise the network lifetime by minimizing energy consumption.
IMPROVED QUALITY OF SERVICE PROTOCOL FOR REAL TIME TRAFFIC IN MANETIJCNCJournal
This document proposes an improved quality of service protocol for real-time traffic in mobile ad hoc networks. It presents a modified version of the AODV routing protocol that provides two key improvements: 1) A balanced best-effort traffic aware route discovery mechanism that selects paths with lower ratios of best-effort packets to minimize their impact on real-time traffic. 2) A packet forwarding procedure that gives transmission priority to real-time packets by transmitting them immediately from the queue while best-effort packets have to wait, improving throughput for real-time applications. Simulation results show the proposed protocol performs better than basic AODV in terms of throughput and delay for real-time traffic.
Enhanced Routing and Cluster Based Algorithms in WSNs to Improve Communicatio...IJSRED
This document summarizes a research paper that proposes and evaluates several routing algorithms to improve communication and energy efficiency in wireless sensor networks. It begins with an introduction to wireless sensor networks and discusses existing routing protocols. It then describes four proposed algorithms: RTP-AMODV, MAODV, MM-LEACH, and E-LEACH. The document outlines the methodology used to simulate and compare the performance of these proposed algorithms against existing routing protocols using metrics like packet delivery ratio, end-to-end delay, throughput, and node energy. The results show the enhanced LEACH (E-LEACH) algorithm achieved better performance than the others in terms of throughput, packet delivery ratio, delay, energy consumption, and network lifetime
Downlink beamforming and admissin control for spectrum sharing cognitive radi...acijjournal
n this paper, to detect the moving objects between frames in compressed video and to obtain the bes
t
compression video
and the noiseless video. We describe a video in which frames by classifying
macroblocks (MB), and describe motion estimation (ME), motion vector field (MV) and motion
compensation (MC). we propose to classify Macroblocks of each video frame into different
classes and use
this class information to describe the frame content based on the motion vector. MB class informatio
n
video applications such as shot change detection, motion discontinuity detection, Outlier rejection
for
global motion estimation. To reduc
e the noise and to improve the clarity of the compressed video by using
contrast limited adaptive histogram equalization (CLAHE) Algorithm
ENERGY LOCATION AWARE ROUTING PROTOCOL (ELARP) FOR WIRELESS MULTIMEDIA SENSOR...ijcsit
Wireless Sensor Networks (WSNs)have sensor nodes that sense and extract information from surrounding
environment, processing information locally then transmit it to sink wirelessly. Multimedia data is larger in
volume than scalar data, thus transmitting multimedia data via Wireless Multimedia Sensor Networks
(WMSNs) requires stick constraints on quality of services in terms of energy, throughput and end to end
delay.Multipath routing is to discover multipath during route discovery from source to sink. Discover
multipath and sending data via these different paths improve the bandwidth and decrease the end to end
delay. This paper introduces an Energy Location Aware Routing Protocol (ELARP) which is reactive
multipath routing protocol establishing three paths with awareness of node’s residual energy and distance.
ELARP has experimented with NS2 simulator. The simulation results show that ELARP enhances QoS for
multimedia data in terms of end to end delay and packet delivery ratio.
Design and implementation of new routingIJCNCJournal
Energy consumption is a key element in the Wireless Sensor Networks (WSNs) design. Indeed, sensor nodes are really constrained by energy supply. Hence, how to improve the network lifetime is a crucial and challenging task. Several techniques are available at different levels of the OSI model to maximize the WSN lifetime and especially at the network layer which uses routing strategies to maintain the routes in the network and guarantee reliable communication. In this paper we intend to propose a new protocol called
Combined Energy and Distance Metrics Dynamic Routing Protocol (CEDM-DR). Our new approach considers not only the distance between wireless sensors but also the energy of node acting as a router in order to find the optimal path and achieve a dynamic and adaptive routing.
The performance metrics exploited for the evaluation of our protocol are average energy consumed, network lifetime and packets lost. By comparing our proposed routing strategy to protocol widely used in WSN namely Ad hoc On demand Distance Vector(AODV), simulation results show that CEDM-DR strategy might effectively balance the sensor power consumption and permits accordingly to enhance the network
lifetime. As well, this new protocol yields a noticeable energy saving compared to its counterpart.
Nearest Adjacent Node Discovery Scheme for Routing Protocol in Wireless Senso...IOSR Journals
The broad significance of Wireless Sensor Networks is in most emergency and disaster rescue
domain. The routing process is the main challenges in the wireless sensor network due to lack of physical links.
The objective of routing is to find optimum path which is used to transferring packets from source node to
destination node. Routing should generate feasible routes between nodes and send traffic along the selected path
and also achieve high performance. This paper presents a nearest adjacent node scheme based on shortest path
routing algorithm. It is plays an important role in energy conservation. It finds the best location of nearest
adjacent nodes by involving the least number of nodes in transmission of data and set large number of nodes to
sleep in idle mode. Based on simulation result we shows the significant improvement in energy saving and
enhance the life of the network
Novel Position Estimation using Differential Timing Information for Asynchron...IJCNCJournal
Positioning techniques have been a common objective since the early development of wireless networks. However, current positioning methods in cellular networks, for instance, are still primarily focused on the use of the Global Navigation Satellite System (GNSS), which has several limitations, like high power drainage and failure in indoor scenarios. This study introduces a novel approach employing standard LTE signaling in order to provide high accuracy positioning estimation. The proposed technique is designed in analogy to the human sound localization system, eliminating the need of having information from three spatially diverse Base Stations (BSs). This is inspired by the perfect human 3D sound localization with two ears. A field study is carried out in a dense urban city to verify the accuracy of the proposed technique, with more than 20 thousand measurement samples collected. The achieved positioning accuracy is meeting the latest Federal Communications Commission (FCC) requirements in the planner dimension.
Link Stability Based On Qos Aware On - Demand Routing In Mobile Ad Hoc NetworksIOSR Journals
This document summarizes a research paper that proposes a new routing protocol for mobile ad hoc networks (MANETs) that considers link stability and quality of service (QoS) metrics. The protocol estimates link quality based on node mobility prediction using GPS data. It calculates a "cost" metric factoring in link stability and power consumption to select paths with more stable, lower-cost links. Simulation results show the proposed protocol achieves higher throughput and packet delivery ratio compared to existing protocols, with lower control overhead. Future work could incorporate additional link quality metrics and statistical classifiers to further optimize path selection in MANETs.
AN EFFECTIVE CONTROL OF HELLO PROCESS FOR ROUTING PROTOCOL IN MANETSIJCNCJournal
In the mobile ad hoc network (MANET) update of link connectivity is necessary to refresh the neighbor tables in data transfer. A existing hello process periodically exchanges the link connectivity information, which is not adequate for dynamic topology. Here, slow update of neighbour table entries causes link failures which affect performance parameter as packet drop, maximum delay, energy consumption, and reduced throughput. In the dynamic hello technique, new neighbour nodes and lost neighbour nodes are used to compute link change rate (LCR) and hello-interval/refresh rate (r). Exchange of link connectivity information at a fast rate consumes unnecessary bandwidth and energy. In MANET resource wastage can be controlled by avoiding the re-route discovery, frequent error notification, and local repair in the entire network. We are enhancing the existing hello process, which shows significant improvement in performance.
QOS ROUTING AND PERFORMANCE EVALUATION FOR MOBILE AD HOC NETWORKS USING OLSR ...ijasuc
Mobile Ad-Hoc network is a collection of mobile nodes in communication without using infrastructure.
As the real-time applications used in today’s wireless network grow, we need some schemes to provide
more suitable service for them. We know that most of actual schemes do not perform well on traffic which
is not strictly CBR. Therefore, in this paper we have studied the impact, respectively, of mobility models
and the density of nodes on the performances (End-to-End Delay, Throughput and Packet Delivery ratio)
of routing protocol (Optimized Link State Routing) OLSR by using in the first a real-time VBR (MPEG-4)
and secondly the Constant Bit Rate (CBR) traffic. Finally we compare the performance on both cases.
Experimentally, we considered the three mobility models as follows Random Waypoint, Random
Direction and Mobgen Steady State. The experimental results illustrate that the behavior of OLSR change
according to the model and the used traffics.
A Cluster-Based Routing Protocol and Fault Detection for Wireless Sensor NetworkIJCNCJournal
The document proposes a new clustering and routing algorithm for wireless sensor networks that aims to extend network lifetime. Key points:
- The algorithm divides nodes into sensing nodes and relay nodes, with relay nodes responsible for forwarding data to reduce cluster head burden.
- It selects cluster heads and relay nodes based on residual energy to distribute load and avoid early node death.
- A routing tree is constructed among relay nodes to transmit data to the base station in a multi-hop manner, selecting next hops based on residual energy and number of child nodes to balance energy usage.
- The goal is to improve energy efficiency, extend network lifetime, and increase data accuracy through mechanisms like clustering, load balancing, and fault detection
An Information Maximization approach of ICA for Gender ClassificationIDES Editor
In this paper, a novel and successful method for
gender classification from human faces using dimensionality
reduction technique is proposed. Independent Component
Analysis (ICA) is one of such techniques. In the current
scheme, a thrust is given on the different algorithms and
architectures of ICA. An information maximization ICA is
discussed with its two architecture and compared with the two
architectures of fast ICA. Support Vector Machine (SVM) is
used as a classifier for the separation of male and female
classes. All experiments are done on FERET database. Results
are obtained for the different combinations of train and test
database sizes. For larger
training set SVM is performing with an accuracy of 98%. The
accuracy values are varied for change in size of testing set and
the proposed system performs with an average accuracy of
96%. An improvement in performance is achieved using class
discriminability which performs with 100% accuracy.
An Iterative Improved k-means ClusteringIDES Editor
This document presents a new iterative improved k-means clustering algorithm.
The k-means clustering algorithm is widely used but depends on random initial starting points, which can impact the results. The new algorithm aims to provide better initial starting points to improve k-means clustering results.
The algorithm divides the data into K initial groups, calculates new cluster centers iteratively using a distance-based formula, assigns data points to clusters, and repeats until cluster centers no longer change. Experimental results on several datasets show the new algorithm converges in fewer iterations than standard k-means, demonstrating it finds better cluster solutions.
User Controlled Privacy in Participatory SensingIDES Editor
This document describes a proposed model for collaborative infrastructure monitoring using participatory sensing. The model involves:
1) Individual sensor networks deployed in homes/buildings that are connected to a cluster head. Cluster heads share some data with a central base station.
2) Users have control over what data they share and at what level of granularity. They can authorize other users to access their data at different levels.
3) Trust between users is calculated based on their past interactions, to determine how much data one user will share with others. If no past interactions exist, opinions from other trusted users can be used to establish an initial trust value.
4) The goal is to integrate individual sensor networks to monitor infrastructure
GR-FB Block Cleaning Scheme in Flash MemoryIDES Editor
Flash memory is a non-volatitle memory that offers
several superior advantages as a data storage device in many
electronic gadgets. However its two operational characteristics,
namely 1) Out-place updating and 2) Cleaning process will affect
its performance as an efficient storage sub-system if not
managed wisely. This paper proposes a new block cleaning
scheme, called Greedy and Frequency-based (GR-FB). The
scheme combines the victim block selection procedure and
the valid-data re-organizing procedure to improve the block
cleaning process performance. The trace-driven simulations
have shown the GR-FB scheme performs better than existing
cleaning process schemes where the cleaning cost is reduced
at least by 8% and the wear-leveling level for all blocks in the
memory array are nearly equal.
Assessment of Market Power in Deregulated Electricity Market with CongestionIDES Editor
Restructuring of electrical market worldwide has
brought the issue of market competition to the forefront. This
new perspective has given rise to competition with the goal of
price fall and technological innovation in the sector. In the last
few years a great deal of attention is given to the possibility of
a group of producers (agents) exercising market power by means
of congestion effects. The possibility of two agents acting in a
combined way on the Transmission System affecting the
accessibility by the others to a specific Market is analyzed. This
paper describes an algorithm used to detect measure and
evaluate the impact of these kinds of strategic actions on market
concentration. The results obtained from the study using 9 bus
example network shows that this kind of actions can affect
strongly market share and must be predicted by the Independent
System Operator (ISO).
Inverse Gamma Distribution based Delay and Slew Modeling for On- Chip VLSI RC...IDES Editor
The Elmore delay is fast becoming ineffective for
deep submicron technologies, and reduced order transfer
function delays are impractical for use as early-phase design
metrics or as design optimization cost functions. This paper
describes an accurate approach for fitting moments of the
impulse response to probability density functions so that delay
and slew metric can be estimated accurately at an early
physical design stage. PERI (Probability distribution function
Extension for Ramp Inputs) technique has been used that
extends the delay and slew metrics for step inputs to the more
general and realistic non-step or ramp inputs. The accuracy
of the proposed model is justified by the results obtained from
the proposed model and that of SPICE simulations
Energy Efficient Data Transmission through Relay Nodes in Wireless Sensor Net...IDES Editor
In a Wireless Sensor Network (WSN) having a single
sink, information is given to the distant nodes from beacons
by overhearing. Since it is out of the communication range,
information is not sent directly to the static sink (SS). If a
distant node is not able to communicate directly, then it should
send its own packet to another node which is closer to the
Base Station (BS) so that the received packets are relayed to
the BS by this node. In this paper, we propose a relay node
selection algorithm to reduce contention and improve energy
efficiency. In this algorithm, each data packet of direct
communication should include the received signal strength
(RSS) of the beacon packet. The distant node selects a node
with the maximum RSS value as a relay. The algorithm also
assigns transmitting intervals to each relay node. By our
simulation results, we show that our proposed algorithm
improves the packet delivery ratio and energy efficiency.
Depth-Image-based Facial Analysis between Age Groups and Recognition of 3D FacesIDES Editor
Face recognition is still an open problem. Many 2D
face recognition approaches came into light to achieve high
recognition rate. But these approaches are still challenged by
the changes in illuminations, expressions, pose, noise, etc. A
3D face recognition technique is proposed to overcome such
challenges and to enhance robustness to expression variations.
Here, we compare the person at different age groups with
higher recognition rate in comparison to 2D face recognition
techniques. We propose a two stage procedure of 3D face
recognition based on FLD (Fisher Linear Discriminant), SURF
operator and depth-image. First, FLD is used on depth-image
to perform recognition and then the SURF features of 2D
gray images to carry out the refined recognition. Finally, our
proposed work will increase the robustness in expression
variations.
Neural Network Based Noise Identification in Digital ImagesIDES Editor
Image noise is unwanted information in an image
and can occur at any moment of time such as during image
capture, transmission, or processing and it may or may not
depend on image content. In order to remove the noise from
the noisy image, prior knowledge about the nature of noise
must be known otherwise noise removal causes the image
blurring. Identifying nature of noise is a challenging problem.
Many researchers have proposed their ideas on image noise
identification and each of the work has its assumptions,
advantages and limitations. In this paper, we proposed a new
methodology based on neural network for identifying the
different types of noise such as Non Gaussian, Gaussian white,
Salt and Pepper and Speckle noise.
FPGA Based Design of High Performance Decimator using DALUT AlgorithmIDES Editor
This paper presents a multiplier less approach
to implement high speed and area efficient decimator for
down converter of Software Defined Radios. This
technique substitutes multiply-and-accumulate (MAC)
operations with look up table (LUT) accesses. Proposed
decimator has been implemented using Partitioned
distributed arithmetic look up table (DALUT) algorithm
by taking optimal advantage of embedded LUTs of target
FPGA device. This method is useful to enhance the system
performance in terms of speed and area. The proposed
decimator has used half band polyphase decomposition
FIR structure. The decimator has been designed with
Matlab 7.6, simulated with Modelsim 6.3XE simulator,
synthesized with Xilinx Synthesis Tool (XST) 10.1 and
implemented on Spartan-3E based 3s500efg320-4 FPGA
device. The proposed DALUT approach has shown an
improvement of 24% in speed by saving almost 50%
resources of target device as compared to MAC based
approach.
LabVIEW - Teaching Aid for Process ControlIDES Editor
Process Instrumentation deals with measurement
and control process parameters to achieve the required quality.
While teaching process related subjects, it is observed that
students are not able to understand process equipment and
controls associated with it theoretically. So to make the subjects
understandable and interesting, simulation of processes are
carried out with displays as used with distributed control
system (DCS). Simulations are used across virtually in
engineering to improve the development process and design
quality, identify design errors earlier, cut down on physical
prototypes, and reduce time to market. Here dryer, boiler
control simulations are carried out to study dynamic behavior.
Application software LabVIEW is used with control design
and data logging with supervisory (DSC) module.
An Adaptive Energy Efficient Reliable Routing Protocol for Wireless Sensor Ne...IDES Editor
A reliable routing protocol for wireless sensor
networks (WSN) should be capable of adjusting to
constantly varying network conditions while conserving
maximum power. Existing Routing protocols provide
reliability at the cost of high energy consumption. In this
paper, we propose to develop an Adaptive Energy Efficient
Reliable Routing Protocol (AEERRP) with the aim of
keeping the energy consumption low while achieving high
reliability. In our proposed protocol, the data forwarding
probability is adaptively adjusted based on the measured
loss conditions at the sink. So only for high loss rates, a node
makes use of high transmission power to arrive at the sink.
Whenever the loss rate is low, it adaptively lessens the
transmission power. Since the source rebroadcasts the data,
until the packet loss is minimized, high data reliability is
achieved. By simulation results we show that the proposed
protocol achieves high reliability while ensuring low energy
consumption and overhead.
Genetic Algorithm based Optimal Placement of Distributed Generation Reducing ...IDES Editor
This paper proposes a genetic algorithm
optimization technique for optimal placement of distributed
generation in a radial distribution system to minimize the total
power loss and to improve the voltage sag performance. Load
flow algorithm and three phase short circuit analysis are
combined appropriately with GA, till access to acceptable
results of this operation. The suggested method is programmed
under MATLAB software. The implementation of the algorithm
is illustrated on a 34-node radial distribution system. Placement
of two DGs with fixed capacity has been considered for example.
Only the three phase symmetrical faults are considered for sag
analysis though other fault types are more common.
Black Box for Machine Tools; Based on Open CNC Architecture Control SystemsIDES Editor
Most computer numerical control (CNC) systems
are closed for users. Engineers typically can only program the
machine, nothing more. it cannot be freely modified by the
user. The introduction of open architecture philosophy
propitiated the evolution of a new generation of numeric
controllers. This brought the conventional CNC technology
to the standard PC microcomputer. As a consequence, the
characteristics of the CNC (positioning) and the micro
computer (easy of programming, system configuration, network
communication etc) are combined. There are also a number
of commercially available OAC (Open Architecture
controllers) (e.g. MDSI, Fanuc, Okuma, Siemens). There
are also a number of efforts at developing OAC standards [1-
4]. This paper uses Siemens [5] OAC to build the unique
BlackBox for machine tool industry. This new technology in
machine tool industry helps us in understanding the cause of
crash or malfunctioning of machine or machine health by
means of debugging the critical machine data such as Spindle
Speed, Axis positions, Feed rates, Type of Tool used etc which
are facilitated by this application just before the crash and
same can be accessed remotely via Internet/ Ethernet. This
application is successfully intergraded and tested with actual
Machine.
Interleaving Technique in Multiphase Buck & Boost ConverterIDES Editor
Some of the recent applications in the field of the
power supplies use multiphase converters to achieve fast
dynamic response, smaller input/output filters or better
packaging. Typically, these converters have several paralleled
power stages with a current loop in each phase and a unique
voltage loop. The presence of the current loops is necessary to
increase dynamic response (by using Current mode control)
and to avoid current unbalance among phases.
A 2-tier Data Hiding Technique Using Exploiting Modification Direction Method...IDES Editor
This paper proposes a 2-tier data hiding technique
that involves Exploiting Modification Direction (EMD) method
and Huffman Coding. Firstly, a secret message of an arbitrary
plain text is encrypted, compressed and transformed into a
stream of bits. Subsequently, the bits are converted into secret
digits by using the Huffman dictionary table. Secondly, a
cover image is segmented into groups of n pixels and each
group is embedded with one secret digit by modifying one
gray-scale value at most to hide the secret digit in (2n+1)-ary
notational system. The experimental results have shown that
both PSNR and payload of the proposed method are higher
than that of well-known methods namely, OPAP, EMD and
Opt EMD.
FTTCP: Fault Tolerant Two-level Clustering Protocol for WSNIDES Editor
1) FTTCP is a fault tolerant two-level clustering protocol for wireless sensor networks that uses an agreement-based approach for fault detection and recovery of cluster heads.
2) It allows each cluster member to independently detect the failure of its cluster head using a distributed agreement protocol to reach consensus among multiple members.
3) The detection process runs concurrently with normal network operations by periodically performing distributed detection where members exchange status information to determine if a cluster head has failed.
Performance Evaluation of Classifiers used for Identification of Encryption A...IDES Editor
Evaluating classifier performance is a critical
problem in pattern recognition and machine learning. In this
paper pattern recognition techniques were applied to identify
encryption algorithms. Four different block cipher algorithms
were considered, DES, IDEA, AES, and RC2 operating in
(Electronic Codebook) ECB mode. Eight different classification
techniques were used for this purpose, these are: Naïve
Bayesian (NB), Support Vector Machine (SVM), neural
network (MLP), Instance based learning (IBL), Bagging (Ba),
AdaBoostM1 (MdaBM1), Rotation Forest (RoFo), and Decision
Tree (C4. 5). The result shows that using pattern recognition
is a useful technique to identify the encryption algorithm,
and according to our simulation using one encryption of key
provide better classification than using different keys.
Furthermore, increase the number of the input files will
improve the accuracy.
Hybrid approaches in Network Optical Routing with QoS based on Genetic Algori...IDES Editor
Hybrid heuristics have been proposed by many
researches as a method to overcome problems in pure heuristic
implementation for multi-constrained QoS routing problems.
In this paper we present some hybrid approaches based on
Genetic Algorithms and Particle Swarm Optimization as well
as their performance to solve NP-complete routing problem. .
Adaptive weight factor estimation from user review 1ambitlick
This document proposes a novel technique called Adjacent Pair Priorities (APP) to estimate weight factors for quality of service parameters in vertical handoff decision algorithms. The APP technique allows users to set relative priority levels for adjacent pairs of QoS parameters in descending order using an exponential mapping. This adaptive approach controls the width of the weight distribution to provide flexibility for users. The document outlines the system requirements, block diagram, modules and references several research papers on vertical handoff decision schemes and network selection algorithms.
Call Admission Control (CAC) with Load Balancing Approach for the WLAN NetworksIJARIIT
The cell migrations take place between the different network operators, and require the significant information exchange between the operators to handle the migratory users. The new user registration requires the pre-shared information from the user’s equipment, which signifies the user recognition before registering the new user over the network. In this thesis, the proposed model has been aimed at the development of the new call admission control mechanism with the sub-channel assignment. The very basic utilization of the proposed model is to increase the number of the users over the given cell units, which is realized by using the sub-channel assignment to the users of the network. The proposed model is aimed at solving the issue by assigning the dual sub channels over the single communication channel. Also the proposed model is aimed at handling the minimum resource users by incorporating the load balancing approach over the given network segment. The load balancing approach shares the load of the overloaded cell with the cell with lowest resource utilization. The proposed model performance has been evaluated in the various scenarios and over all of the BTS nodes. The proposed model results have been obtained in the form of the resource utilization, network load, transmission delay, consumed bandwidth and data loss. The proposed model has shown the efficiency obtained by using the proposed call admission control (CAC) along with the new load balancing mechanism. The proposed model has shown the robustness of the proposed model in handling the cell overloading factors.
This document proposes a scheme to dynamically optimize cellular network utilization by encouraging subscribers to use services when certain cells are underutilized. It involves measuring cell load indicators like transmitted power and code usage. Cells with low load would be selected and subscribers in those cells would receive offers for reduced tariffs via cell broadcast to boost utilization. This aims to maximize revenue by increasing cellular yield without impacting highly loaded cells. Key performance indicators and an algorithm are presented for selecting candidate cells for this utilization enhancement scheme.
HANDOVER NECESSITY ESTIMATION FOR 4G HETEROGENEOUS NETWORKSijistjournal
One of the most challenges of 4G network is to have a unified network of heterogeneous wireless networks. To achieve seamless mobility in such a diverse environment, vertical hand off is still a challenging problem. In many situations handover failures and unnecessary handoffs are triggered causing degradation of services, reduction in throughput and increase the blocking probability and packet loss. In this paper a new vertical handoff decision algorithm handover necessity estimation (HNE), is proposed to minimize the number of handover failure and unnecessary handover in heterogeneous wireless networks. we have proposed a multi criteria vertical handoff decision algorithm based on two parts: traveling time estimation and time threshold calculation. Our proposed methods are compared against two other methods: (a) the fixed RSS threshold based method, in which handovers between the cellular network and the WLAN are initiated when the RSS from the WLAN reaches a fixed threshold, and (b) the hysteresis based method, in which a hysteresis is introduced to prevent the ping-pong effect. Simulation results show that, this method reduced the number of handover failures and unnecessary handovers up to 80% and 70%, respectively.
HANDOVER NECESSITY ESTIMATION FOR 4G HETEROGENEOUS NETWORKSijistjournal
One of the most challenges of 4G network is to have a unified network of heterogeneous wireless networks. To achieve seamless mobility in such a diverse environment, vertical hand off is still a challenging problem. In many situations handover failures and unnecessary handoffs are triggered causing degradation of services, reduction in throughput and increase the blocking probability and packet loss. In this paper a new vertical handoff decision algorithm handover necessity estimation (HNE), is proposed to minimize the number of handover failure and unnecessary handover in heterogeneous wireless networks. we have proposed a multi criteria vertical handoff decision algorithm based on two parts: traveling time estimation and time threshold calculation. Our proposed methods are compared against two other methods: (a) the fixed RSS threshold based method, in which handovers between the cellular network and the WLAN are initiated when the RSS from the WLAN reaches a fixed threshold, and (b) the hysteresis based method, in which a hysteresis is introduced to prevent the ping-pong effect. Simulation results show that, this method reduced the number of handover failures and unnecessary handovers up to 80% and 70%, respectively.
An efficient vertical handoff mechanism for future mobile networkBasil John
This document proposes a novel fuzzy logic based vertical handoff decision algorithm for heterogeneous wireless networks. It introduces a speed-adaptive system discovery scheme to improve the update rate of candidate networks based on the mobile terminal's speed. It also includes a pre-handoff decision method to quickly filter candidate networks and reduce unnecessary handoffs. The key aspects of the proposed algorithm are: 1) It uses a speed-adaptive scheme to dynamically adjust the discovery of candidate networks. 2) It employs a pre-handoff decision method to filter networks and reduce ping-pong effects. 3) It applies fuzzy logic to evaluate multiple parameters like bandwidth, RSS, and cost to select the best network. Simulations show it outperforms traditional RSS-based
Adaptive Routing in Wireless Sensor Networks: QoS Optimisation for Enhanced A...M H
The document describes a new routing protocol called Route Optimization and Load-balancing (ROL) for wireless sensor networks. ROL aims to balance several objectives like prolonging network lifetime, providing timely message delivery, and improving network robustness. It uses a combination of routing metrics that can be configured according to application priorities to optimize overall network performance. Simulation results show that ROL maintains balanced cluster sizes and populations, reduces overhead, end-to-end delays, and improves data delivery ratios compared to other protocols like Mires++.
An Enhanced Algorithm for Load-based Handover Decision-making in 5G Wireless ...IRJET Journal
This paper proposes an enhanced algorithm for load-based handover decision making in 5G wireless networks. The current handover decision making process does not consider the load of potential target cells, which can lead to handover failures if a user is handed over to an overloaded cell. The proposed algorithm uses fuzzy logic to determine if a candidate cell is suitable for handover based on its current load. Simulation results show the new algorithm improves network load balancing and reduces handover failures compared to existing methods.
ADAPTIVE HANDOVER HYSTERESIS AND CALL ADMISSION CONTROL FOR MOBILE RELAY NODESIJCNCJournal
The aim of equipping a wireless network with a mobile relay node is to support broadband wireless communications for vehicular users and their devices. The high mobility of vehicular users, possibly at a very high velocity in the area in which two cells overlap, could cause the network to suffer from a reduced handover success rate and, hence, increased radio link failure. The combined impact of these problems is service interruptions to vehicular users. Thus, the handover schemes are crucial in solving these problems. In this work, we first present the adaptive handover hysteresis scheme for the wireless network with mobile relay nodes in the high-speed train scenario. Specifically, our proposed adaptive hysteresis scheme is based on the velocity of the train. Second, the handover call dropping probability is reduced by introducing a modified call admission control scheme to support radio resource reservation for handover calls that prioritizes handover calls of mobile relay over the other calls. The proposed solution in which adaptive parameter is combined with call admission control is evaluated by system level simulation. Our simulation results illustrate an increased handover success rate and reduced radio link failures.
QoS controlled capacity offload optimization in heterogeneous networksjournalBEEI
An efficient resource allocation mechanism in the physical layer of wireless networks ensures that resources such as bandwidth and power are used with high efficiency in spite of low delay and high edge user data rate. Microcells in the network are typically set with bias settings to artificially increase the Signal-to-Interference-Plus-Noise Ratio, thus encouraging users to offload to the microcell. However, the artificial bias settings are tedious and often suboptimal. This work presents a low complexity algorithm for maximization of network capacity with load balancing in a heterogeneous network without the need for bias setting. The small cells were deployed in a grid topology at a selected distance from macrocell to enhance network capacity through coverage overlap. User association and minimum user throughput were incorporated as constraints to enable closer simulation to real word Quality of Service requirements. The results showed that the proposed algorithm was able to maintain less than 10% user drop rate. The proposed algorithm can increase user confidence as well as maintain load balancing, maintain the scalability, and reduce power consumption of the wireless network.
A Novel Handoff Necessity Estimation Approach Based on Travelling DistanceIJAAS Team
Mobility management is one of the most important challenges in Next
Generation Wireless Networks (NGWNs) as it enables users to move across
geographic boundaries of wireless networks. Nowadays, mobile
communications have heterogeneous wireless networks offering variable
coverage and Quality of Service (QoS). The availability of alternatives
generates a problem of occurrence of unnecessary handoff that results in
wastage of network resources. To avoid this, an efficient algorithm needs to
be developed to minimize the unnecessary handoffs. Conventionally,
whenever Wireless Local Area Network (WLAN) connectivity is available,
the mobile node switch from cellular network to wireless local area network
to gain maximum use of high bandwidth and low cost of wireless local area
network as much as possible. But to maintain call quality and minimum
number of call failure, a considerable proportion of these handovers should
be determined. Our algorithm makes the handoff to wireless local area
network only when the Predicted Received Signal Strength (PRSS) falls
below a threshold value and travelling distance inside the wireless local area
network is larger than a threshold distance.Through MATLAB simulation,
we show that our algorithm is able to improve handover performance.
Network assisted mobile computing with optimal uplink query processingJPINFOTECH JAYAPRAKASH
1) The document proposes a network-assisted mobile computing system where mid-network nodes can lease processing power to mobile devices to reduce latency and battery usage when processing queries.
2) It studies the tradeoff between battery usage, processing latency, transmission latency, and leasing costs to determine the optimal processing policy for allocating work across devices.
3) The proposed system divides query processing across the mobile station, relay nodes, and application server to minimize costs based on leasing, latency, and battery usage considerations.
Iaetsd use of mobile communication in data-intensiveIaetsd Iaetsd
This document summarizes a research paper on using mobile communication to improve energy efficiency in data-intensive wireless sensor networks. The paper proposes using mobile relay nodes that move to optimize positions for transmitting data from sensor sources to a base station. An algorithm is presented that iteratively relocates the mobile relay nodes to minimize the total energy used for both wireless transmission and node movement. The algorithm finds optimal positions for relay nodes within a fixed routing tree topology without changing the tree structure. This approach aims to reduce energy consumption in a holistic way compared to other mobility approaches.
This document proposes a QoS-Aware Self-Adaptive RAN Overload Control (QoS-Dracon) mechanism to reduce RAN overload in LTE/LTE-A networks while considering users' QoS requirements. It prioritizes delay-sensitive users over delay-tolerant ones during the random access procedure. The mechanism uses an Access Class Barring scheme in the eNodeB to monitor RAN load and block access of delay-tolerant devices when needed. It also employs a QCI-dependent backoff scheme to spread access attempts over time for congested networks. Simulation results show the mechanism maintains low access delays for delay-sensitive users regardless of device type attempting access.
Fuzzy Based Vertical Handoff Decision Controller for Future NetworksIJAEMSJORNAL
Abstract— In Next generation wireless Networks, the received signals (RSS) from different networks do not have a same meaning since each network is composed of its specific characteristics and there is no common pilot signal. Then, RSS comparisons are insufficient for handoff decision and may be inefficient and impractical. A more complex decision criterion that combines a large number of parameters or factors such as monetary cost, bandwidth, and power consumption and user profile is necessary. Though there are a lot works available for vertical handoff decision (VHD) for wireless networks, the selection of best network is still challenging problem. In this paper we propose a Fuzzy based vertical handoff decision controller (FVHDC) Which performs handover decision based on the output of fuzzy based rules.
This document describes a proposed approach called Resource Allocation with Connection Admission Control (RA-CAC) and Adaptive Rate Scheduling (ARS) to improve quality of service for real-time traffic in WCDMA networks. The RA-CAC algorithm determines the optimal number of users to admit while minimizing call rejection rates. The ARS then adjusts transmission rates of admitted sessions based on feedback to better utilize network resources. Simulation results showed this approach increased delivery ratio, throughput and reduced delays compared to other resource allocation methods.
A vertical handover decision approaches in next generation wireless networks ...ijmnct
In next generation wireless network the most desirable feature is its ability to move seamlessly over various
access network regardless of the network infrastructure is used. The handover between these dissimilar
networks can be explored by using vertical handover algorithms. This paper focuses on the vertical
handover decision methods and algorithms effectiveness. Most of the algorithms which are based on RSS
values provide vertical handover with small delay at a lower rate of throughput. There are such algorithms
which provide significant improvements in throughput but at a cost of higher delays. As per the need for the
real time applications in next generation wireless networks there is a requirement of developing new
optimized algorithms that are able to produce high throughput and minimizing signalling cost and delay.
Traffic-aware adaptive server load balancing for softwaredefined networks IJECEIAES
Servers in data center networks handle heterogeneous bulk loads. Load balancing, therefore, plays an important role in optimizing network bandwidth and minimizing response time. A complete knowledge of the current network status is needed to provide a stable load in the network. The process of network status catalog in a traditional network needs additional processing which increases complexity, whereas, in software defined networking, the control plane monitors the overall working of the network continuously. Hence it is decided to propose an efficient load balancing algorithm that adapts SDN. This paper proposes an efficient algorithm TAASLB-traffic-aware adaptive server load balancing to balance the flows to the servers in a data center network. It works based on two parameters, residual bandwidth, and server capacity. It detects the elephant flows and forwards them towards the optimal server where it can be processed quickly. It has been tested with the Mininet simulator and gave considerably better results compared to the existing server load balancing algorithms in the floodlight controller. After experimentation and analysis, it is understood that the method provides comparatively better results than the existing load balancing algorithms.
Dual-resource TCPAQM for Processing-constrained Networksambitlick
This document summarizes a research paper that examines congestion control issues for TCP flows that require in-network processing by network elements like routers. It proposes a new active queue management (AQM) scheme called Dual-Resource Queue (DRQ) that can approximate proportional fairness for bandwidth and CPU resources without changing TCP stacks. The study finds that current TCP/AQM schemes can lose throughput and cause unfairness in networks where CPU cycles are scarce. DRQ maintains separate queues for each resource and works with classes of flows based on their known processing requirements, making it scalable without per-flow state. Simulation results show DRQ achieves fair and efficient resource allocation with low implementation costs.
Call Admission Control Scheme With Multimedia Scheduling Service in WiMAX Net...Waqas Tariq
WiMAX network introduces a multimedia data scheduling service with different quality of service (QoS) requirements. Transmission opportunities are scheduled by the service according to the types of traffic data for the different connections or users. In the paper, we first propose a uniform definition of QoS level for the multimedia data types in the service. The QoS level of a connection are determined by the type of data of the connection and its allocated resources. Based on these QoS levels, we propose a call admission control (CAC) scheme for the entry admission of a new connection without degrading the network performance and the QoS of ongoing connections. The key idea of this scheme is to regulate the arriving traffic of the network such that the network can work at an optimal point, given under a heavy load traffic. Taking advantage of the simulation experiments, we confirm the fact that the proposed scheme can achieve better trade-off between the overall performance of network system and the QoS level of individual connection.
Similar to Adaptive Handoff Initiation Scheme in Heterogeneous Network (20)
Power System State Estimation - A ReviewIDES Editor
This document provides a review of power system state estimation techniques. It discusses both static and dynamic state estimation algorithms. For static state estimation, it covers weighted least squares, decoupled, and robust estimation methods. Weighted least squares is commonly used but can have numerical instability issues. Decoupled state estimation approximates the gain matrix for faster computation. Robust estimation uses M-estimators and other techniques to handle outliers and bad data. Dynamic state estimation applies Kalman filtering, leapfrog algorithms, and other methods to continuously monitor system states over time.
Artificial Intelligence Technique based Reactive Power Planning Incorporating...IDES Editor
This document summarizes a research paper that proposes using artificial intelligence techniques and FACTS controllers for reactive power planning in real-time power transmission systems. The paper formulates the reactive power planning problem and incorporates flexible AC transmission system (FACTS) devices like static VAR compensators (SVC), thyristor controlled series capacitors (TCSC), and unified power flow controllers (UPFC). Evolutionary algorithms like evolutionary programming (EP) and differential evolution (DE) are applied to find the optimal locations and settings of the FACTS controllers to minimize losses and costs. Simulation results on IEEE 30-bus and 72-bus Indian test systems show that UPFC performs best in reducing losses compared to SVC and TCSC.
Design and Performance Analysis of Genetic based PID-PSS with SVC in a Multi-...IDES Editor
Damping of power system oscillations with the help
of proposed optimal Proportional Integral Derivative Power
System Stabilizer (PID-PSS) and Static Var Compensator
(SVC)-based controllers are thoroughly investigated in this
paper. This study presents robust tuning of PID-PSS and
SVC-based controllers using Genetic Algorithms (GA) in
multi machine power systems by considering detailed model
of the generators (model 1.1). The effectiveness of FACTSbased
controllers in general and SVC-based controller in
particular depends upon their proper location. Modal
controllability and observability are used to locate SVC–based
controller. The performance of the proposed controllers is
compared with conventional lead-lag power system stabilizer
(CPSS) and demonstrated on 10 machines, 39 bus New England
test system. Simulation studies show that the proposed genetic
based PID-PSS with SVC based controller provides better
performance.
Optimal Placement of DG for Loss Reduction and Voltage Sag Mitigation in Radi...IDES Editor
This paper presents the need to operate the power
system economically and with optimum levels of voltages has
further led to an increase in interest in Distributed
Generation. In order to reduce the power losses and to improve
the voltage in the distribution system, distributed generators
(DGs) are connected to load bus. To reduce the total power
losses in the system, the most important process is to identify
the proper location for fixing and sizing of DGs. It presents a
new methodology using a new population based meta heuristic
approach namely Artificial Bee Colony algorithm(ABC) for
the placement of Distributed Generators(DG) in the radial
distribution systems to reduce the real power losses and to
improve the voltage profile, voltage sag mitigation. The power
loss reduction is important factor for utility companies because
it is directly proportional to the company benefits in a
competitive electricity market, while reaching the better power
quality standards is too important as it has vital effect on
customer orientation. In this paper an ABC algorithm is
developed to gain these goals all together. In order to evaluate
sag mitigation capability of the proposed algorithm, voltage
in voltage sensitive buses is investigated. An existing 20KV
network has been chosen as test network and results are
compared with the proposed method in the radial distribution
system.
Line Losses in the 14-Bus Power System Network using UPFCIDES Editor
Controlling power flow in modern power systems
can be made more flexible by the use of recent developments
in power electronic and computing control technology. The
Unified Power Flow Controller (UPFC) is a Flexible AC
transmission system (FACTS) device that can control all the
three system variables namely line reactance, magnitude and
phase angle difference of voltage across the line. The UPFC
provides a promising means to control power flow in modern
power systems. Essentially the performance depends on proper
control setting achievable through a power flow analysis
program. This paper presents a reliable method to meet the
requirements by developing a Newton-Raphson based load
flow calculation through which control settings of UPFC can
be determined for the pre-specified power flow between the
lines. The proposed method keeps Newton-Raphson Load Flow
(NRLF) algorithm intact and needs (little modification in the
Jacobian matrix). A MATLAB program has been developed to
calculate the control settings of UPFC and the power flow
between the lines after the load flow is converged. Case studies
have been performed on IEEE 5-bus system and 14-bus system
to show that the proposed method is effective. These studies
indicate that the method maintains the basic NRLF properties
such as fast computational speed, high degree of accuracy and
good convergence rate.
Study of Structural Behaviour of Gravity Dam with Various Features of Gallery...IDES Editor
The size and shape of opening in dam causes the
stress concentration, it also causes the stress variation in the
rest of the dam cross section. The gravity method of the analysis
does not consider the size of opening and the elastic property
of dam material. Thus the objective of study is comprises of
the Finite Element Method which considers the size of
opening, elastic property of material, and stress distribution
because of geometric discontinuity in cross section of dam.
Stress concentration inside the dam increases with the opening
in dam which results in the failure of dam. Hence it is
necessary to analyses large opening inside the dam. By making
the percentage area of opening constant and varying size and
shape of opening the analysis is carried out. For this purpose
a section of Koyna Dam is considered. Dam is defined as a
plane strain element in FEM, based on geometry and loading
condition. Thus this available information specified our path
of approach to carry out 2D plane strain analysis. The results
obtained are then compared mutually to get most efficient
way of providing large opening in the gravity dam.
Assessing Uncertainty of Pushover Analysis to Geometric ModelingIDES Editor
Pushover Analysis a popular tool for seismic
performance evaluation of existing and new structures and is
nonlinear Static procedure where in monotonically increasing
loads are applied to the structure till the structure is unable
to resist the further load .During the analysis, whatever the
strength of concrete and steel is adopted for analysis of
structure may not be the same when real structure is
constructed and the pushover analysis results are very sensitive
to material model adopted, geometric model adopted, location
of plastic hinges and in general to procedure followed by the
analyzer. In this paper attempt has been made to assess
uncertainty in pushover analysis results by considering user
defined hinges and frame modeled as bare frame and frame
with slab modeled as rigid diaphragm and results compared
with experimental observations. Uncertain parameters
considered includes the strength of concrete, strength of steel
and cover to the reinforcement which are randomly generated
and incorporated into the analysis. The results are then
compared with experimental observations.
Secure Multi-Party Negotiation: An Analysis for Electronic Payments in Mobile...IDES Editor
This document summarizes and analyzes secure multi-party negotiation protocols for electronic payments in mobile computing. It presents a framework for secure multi-party decision protocols using lightweight implementations. The main focus is on synchronizing security features to avoid agreement manipulation and reduce user traffic. The paper describes negotiation between an auctioneer and bidders, showing multiparty security is better than existing systems. It analyzes the performance of encryption algorithms like ECC, XTR, and RSA for use in the multiparty negotiation protocols.
Selfish Node Isolation & Incentivation using Progressive ThresholdsIDES Editor
The problems associated with selfish nodes in
MANET are addressed by a collaborative watchdog approach
which reduces the detection time for selfish nodes thereby
improves the performance and accuracy of watchdogs[1]. In
the related works they make use of credit based systems, reputation
based mechanisms, pathrater and watchdog mechanism
to detect such selfish nodes. In this paper we follow an approach
of collaborative watchdog which reduces the detection
time for selfish nodes and also involves the removal of such
selfish nodes based on some progressively assessed thresholds.
The threshold gives the nodes a chance to stop misbehaving
before it is permanently deleted from the network.
The node passes through several isolation processes before it
is permanently removed. Another version of AODV protocol
is used here which allows the simulation of selfish nodes in
NS2 by adding or modifying log files in the protocol.
Various OSI Layer Attacks and Countermeasure to Enhance the Performance of WS...IDES Editor
Wireless sensor networks are networks having non
wired infrastructure and dynamic topology. In OSI model each
layer is prone to various attacks, which halts the performance
of a network .In this paper several attacks on four layers of
OSI model are discussed and security mechanism is described
to prevent attack in network layer i.e wormhole attack. In
Wormhole attack two or more malicious nodes makes a covert
channel which attracts the traffic towards itself by depicting a
low latency link and then start dropping and replaying packets
in the multi-path route. This paper proposes promiscuous mode
method to detect and isolate the malicious node during
wormhole attack by using Ad-hoc on demand distance vector
routing protocol (AODV) with omnidirectional antenna. The
methodology implemented notifies that the nodes which are
not participating in multi-path routing generates an alarm
message during delay and then detects and isolate the
malicious node from network. We also notice that not only
the same kind of attacks but also the same kind of
countermeasures can appear in multiple layer. For example,
misbehavior detection techniques can be applied to almost all
the layers we discussed.
Responsive Parameter based an AntiWorm Approach to Prevent Wormhole Attack in...IDES Editor
The recent advancements in the wireless technology
and their wide-spread deployment have made remarkable
enhancements in efficiency in the corporate and industrial
and Military sectors The increasing popularity and usage of
wireless technology is creating a need for more secure wireless
Ad hoc networks. This paper aims researched and developed
a new protocol that prevents wormhole attacks on a ad hoc
network. A few existing protocols detect wormhole attacks but
they require highly specialized equipment not found on most
wireless devices. This paper aims to develop a defense against
wormhole attacks as an Anti-worm protocol which is based on
responsive parameters, that does not require as a significant
amount of specialized equipment, trick clock synchronization,
no GPS dependencies.
Cloud Security and Data Integrity with Client Accountability FrameworkIDES Editor
This document summarizes a proposed cloud security and data integrity framework that provides client accountability. The framework aims to address issues like lack of user control over cloud data, need for data transparency and tracking, and ensuring data integrity. It proposes using JAR (Java Archive) files for data sharing due to benefits like portability. The framework incorporates client-side verification using MD5 hashing, digital signature-based authentication of JAR files, and use of HMAC to ensure data integrity. It also uses password-based encryption of log files to keep them tamper-proof. The framework is intended to provide both accountability and security for data sharing in cloud environments.
Genetic Algorithm based Layered Detection and Defense of HTTP BotnetIDES Editor
A System state in HTTP botnet uses HTTP protocol
for the creation of chain of Botnets thereby compromising
other systems. By using HTTP protocol and port number 80,
attacks can not only be hidden but also pass through the
firewall without being detected. The DPR based detection
leads to better analysis of botnet attacks [3]. However, it
provides only probabilistic detection of the attacker and also
time consuming and error prone. This paper proposes a Genetic
algorithm based layered approach for detecting as well as
preventing botnet attacks. The paper reviews p2p firewall
implementation which forms the basis of filtering.
Performance evaluation is done based on precision, F-value
and probability. Layered approach reduces the computation
and overall time requirement [7]. Genetic algorithm promises
a low false positive rate.
Enhancing Data Storage Security in Cloud Computing Through SteganographyIDES Editor
This document summarizes a research paper that proposes a method for enhancing data security in cloud computing through steganography. The method hides user data in digital images stored on cloud servers. When data needs to be accessed, it is extracted from the images. The document outlines the cloud architecture and security issues addressed. It then describes the proposed system architecture, security model, and data storage and retrieval process. Data is partitioned and hidden in multiple images to improve security. The goal is to prevent unauthorized access to user data stored on cloud servers.
The main tasks of a Wireless Sensor Network
(WSN) are data collection from its nodes and communication
of this data to the base station (BS). The protocols used for
communication among the WSN nodes and between the WSN
and the BS, must consider the resource constraints of nodes,
battery energy, computational capabilities and memory. The
WSN applications involve unattended operation of the network
over an extended period of time. In order to extend the lifetime
of a WSN, efficient routing protocols need to be adopted. The
proposed low power routing protocol based on tree-based
network structure reliably forwards the measured data towards
the BS using TDMA. An energy consumption analysis of the
WSN making use of this protocol is also carried out. It is
found that the network is energy efficient with an average
duty cycle of 0:7% for the WSN nodes. The OmNET++
simulation platform along with MiXiM framework is made
use of.
Permutation of Pixels within the Shares of Visual Cryptography using KBRP for...IDES Editor
The security of authentication of internet based
co-banking services should not be susceptible to high risks.
The passwords are highly vulnerable to virus attacks due to
the lack of high end embedding of security methods. In order
for the passwords to be more secure, people are generally
compelled to select jumbled up character based passwords
which are not only less memorable but are also equally prone
to insecurity. Multiple use of distributed shares has been
studied to solve the problem of authentication by algorithms
based on thresholding of pixels in image processing and visual
cryptography concepts where the subset of shares is considered
for the recovery of the original image for authentication using
correlation function[1][2].The main disadvantage in the above
study is the plain storage of shares and also one of the shares
is being supplied to the customer, which will lead to the
possibility of misuse by a third party. This paper proposes a
technique for scrambling of pixels by key based random
permutation (KBRP) within the shares before the
authentication has been attempted. Total number of shares to
be created is dependent on the multiplicity of ownership of
the account. By this method the problem of uncertainty among
the customers with regard to security, storage, retrieval of
holding of half of the shares is minimized.
This paper presents a trifocal Rotman Lens Design
approach. The effects of focal ratio and element spacing on
the performance of Rotman Lens are described. A three beam
prototype feeding 4 element antenna array working in L-band
has been simulated using RLD v1.7 software. Simulated
results show that the simulated lens has a return loss of –
12.4dB at 1.8GHz. Beam to array port phase error variation
with change in the focal ratio and element spacing has also
been investigated.
Band Clustering for the Lossless Compression of AVIRIS Hyperspectral ImagesIDES Editor
Hyperspectral images can be efficiently compressed
through a linear predictive model, as for example the one
used in the SLSQ algorithm. In this paper we exploit this
predictive model on the AVIRIS images by individuating,
through an off-line approach, a common subset of bands, which
are not spectrally related with any other bands. These bands
are not useful as prediction reference for the SLSQ 3-D
predictive model and we need to encode them via other
prediction strategies which consider only spatial correlation.
We have obtained this subset by clustering the AVIRIS bands
via the clustering by compression approach. The main result
of this paper is the list of the bands, not related with the
others, for AVIRIS images. The clustering trees obtained for
AVIRIS and the relationship among bands they depict is also
an interesting starting point for future research.
Microelectronic Circuit Analogous to Hydrogen Bonding Network in Active Site ...IDES Editor
A microelectronic circuit of block-elements
functionally analogous to two hydrogen bonding networks is
investigated. The hydrogen bonding networks are extracted
from â-lactamase protein and are formed in its active site.
Each hydrogen bond of the network is described in equivalent
electrical circuit by three or four-terminal block-element.
Each block-element is coded in Matlab. Static and dynamic
analyses are performed. The resultant microelectronic circuit
analogous to the hydrogen bonding network operates as
current mirror, sine pulse source, triangular pulse source as
well as signal modulator.
Texture Unit based Monocular Real-world Scene Classification using SOM and KN...IDES Editor
In this paper a method is proposed to discriminate
real world scenes in to natural and manmade scenes of similar
depth. Global-roughness of a scene image varies as a function
of image-depth. Increase in image depth leads to increase in
roughness in manmade scenes; on the contrary natural scenes
exhibit smooth behavior at higher image depth. This particular
arrangement of pixels in scene structure can be well explained
by local texture information in a pixel and its neighborhood.
Our proposed method analyses local texture information of a
scene image using texture unit matrix. For final classification
we have used both supervised and unsupervised learning using
K-Nearest Neighbor classifier (KNN) and Self Organizing
Map (SOM) respectively. This technique is useful for online
classification due to very less computational complexity.
UiPath Test Automation using UiPath Test Suite series, part 5DianaGray10
Welcome to UiPath Test Automation using UiPath Test Suite series part 5. In this session, we will cover CI/CD with devops.
Topics covered:
CI/CD with in UiPath
End-to-end overview of CI/CD pipeline with Azure devops
Speaker:
Lyndsey Byblow, Test Suite Sales Engineer @ UiPath, Inc.
Driving Business Innovation: Latest Generative AI Advancements & Success StorySafe Software
Are you ready to revolutionize how you handle data? Join us for a webinar where we’ll bring you up to speed with the latest advancements in Generative AI technology and discover how leveraging FME with tools from giants like Google Gemini, Amazon, and Microsoft OpenAI can supercharge your workflow efficiency.
During the hour, we’ll take you through:
Guest Speaker Segment with Hannah Barrington: Dive into the world of dynamic real estate marketing with Hannah, the Marketing Manager at Workspace Group. Hear firsthand how their team generates engaging descriptions for thousands of office units by integrating diverse data sources—from PDF floorplans to web pages—using FME transformers, like OpenAIVisionConnector and AnthropicVisionConnector. This use case will show you how GenAI can streamline content creation for marketing across the board.
Ollama Use Case: Learn how Scenario Specialist Dmitri Bagh has utilized Ollama within FME to input data, create custom models, and enhance security protocols. This segment will include demos to illustrate the full capabilities of FME in AI-driven processes.
Custom AI Models: Discover how to leverage FME to build personalized AI models using your data. Whether it’s populating a model with local data for added security or integrating public AI tools, find out how FME facilitates a versatile and secure approach to AI.
We’ll wrap up with a live Q&A session where you can engage with our experts on your specific use cases, and learn more about optimizing your data workflows with AI.
This webinar is ideal for professionals seeking to harness the power of AI within their data management systems while ensuring high levels of customization and security. Whether you're a novice or an expert, gain actionable insights and strategies to elevate your data processes. Join us to see how FME and AI can revolutionize how you work with data!
GraphSummit Singapore | The Art of the Possible with Graph - Q2 2024Neo4j
Neha Bajwa, Vice President of Product Marketing, Neo4j
Join us as we explore breakthrough innovations enabled by interconnected data and AI. Discover firsthand how organizations use relationships in data to uncover contextual insights and solve our most pressing challenges – from optimizing supply chains, detecting fraud, and improving customer experiences to accelerating drug discoveries.
UiPath Test Automation using UiPath Test Suite series, part 6DianaGray10
Welcome to UiPath Test Automation using UiPath Test Suite series part 6. In this session, we will cover Test Automation with generative AI and Open AI.
UiPath Test Automation with generative AI and Open AI webinar offers an in-depth exploration of leveraging cutting-edge technologies for test automation within the UiPath platform. Attendees will delve into the integration of generative AI, a test automation solution, with Open AI advanced natural language processing capabilities.
Throughout the session, participants will discover how this synergy empowers testers to automate repetitive tasks, enhance testing accuracy, and expedite the software testing life cycle. Topics covered include the seamless integration process, practical use cases, and the benefits of harnessing AI-driven automation for UiPath testing initiatives. By attending this webinar, testers, and automation professionals can gain valuable insights into harnessing the power of AI to optimize their test automation workflows within the UiPath ecosystem, ultimately driving efficiency and quality in software development processes.
What will you get from this session?
1. Insights into integrating generative AI.
2. Understanding how this integration enhances test automation within the UiPath platform
3. Practical demonstrations
4. Exploration of real-world use cases illustrating the benefits of AI-driven test automation for UiPath
Topics covered:
What is generative AI
Test Automation with generative AI and Open AI.
UiPath integration with generative AI
Speaker:
Deepak Rai, Automation Practice Lead, Boundaryless Group and UiPath MVP
Unlock the Future of Search with MongoDB Atlas_ Vector Search Unleashed.pdfMalak Abu Hammad
Discover how MongoDB Atlas and vector search technology can revolutionize your application's search capabilities. This comprehensive presentation covers:
* What is Vector Search?
* Importance and benefits of vector search
* Practical use cases across various industries
* Step-by-step implementation guide
* Live demos with code snippets
* Enhancing LLM capabilities with vector search
* Best practices and optimization strategies
Perfect for developers, AI enthusiasts, and tech leaders. Learn how to leverage MongoDB Atlas to deliver highly relevant, context-aware search results, transforming your data retrieval process. Stay ahead in tech innovation and maximize the potential of your applications.
#MongoDB #VectorSearch #AI #SemanticSearch #TechInnovation #DataScience #LLM #MachineLearning #SearchTechnology
Removing Uninteresting Bytes in Software FuzzingAftab Hussain
Imagine a world where software fuzzing, the process of mutating bytes in test seeds to uncover hidden and erroneous program behaviors, becomes faster and more effective. A lot depends on the initial seeds, which can significantly dictate the trajectory of a fuzzing campaign, particularly in terms of how long it takes to uncover interesting behaviour in your code. We introduce DIAR, a technique designed to speedup fuzzing campaigns by pinpointing and eliminating those uninteresting bytes in the seeds. Picture this: instead of wasting valuable resources on meaningless mutations in large, bloated seeds, DIAR removes the unnecessary bytes, streamlining the entire process.
In this work, we equipped AFL, a popular fuzzer, with DIAR and examined two critical Linux libraries -- Libxml's xmllint, a tool for parsing xml documents, and Binutil's readelf, an essential debugging and security analysis command-line tool used to display detailed information about ELF (Executable and Linkable Format). Our preliminary results show that AFL+DIAR does not only discover new paths more quickly but also achieves higher coverage overall. This work thus showcases how starting with lean and optimized seeds can lead to faster, more comprehensive fuzzing campaigns -- and DIAR helps you find such seeds.
- These are slides of the talk given at IEEE International Conference on Software Testing Verification and Validation Workshop, ICSTW 2022.
How to Get CNIC Information System with Paksim Ga.pptxdanishmna97
Pakdata Cf is a groundbreaking system designed to streamline and facilitate access to CNIC information. This innovative platform leverages advanced technology to provide users with efficient and secure access to their CNIC details.
Building Production Ready Search Pipelines with Spark and MilvusZilliz
Spark is the widely used ETL tool for processing, indexing and ingesting data to serving stack for search. Milvus is the production-ready open-source vector database. In this talk we will show how to use Spark to process unstructured data to extract vector representations, and push the vectors to Milvus vector database for search serving.
Maruthi Prithivirajan, Head of ASEAN & IN Solution Architecture, Neo4j
Get an inside look at the latest Neo4j innovations that enable relationship-driven intelligence at scale. Learn more about the newest cloud integrations and product enhancements that make Neo4j an essential choice for developers building apps with interconnected data and generative AI.
Essentials of Automations: The Art of Triggers and Actions in FMESafe Software
In this second installment of our Essentials of Automations webinar series, we’ll explore the landscape of triggers and actions, guiding you through the nuances of authoring and adapting workspaces for seamless automations. Gain an understanding of the full spectrum of triggers and actions available in FME, empowering you to enhance your workspaces for efficient automation.
We’ll kick things off by showcasing the most commonly used event-based triggers, introducing you to various automation workflows like manual triggers, schedules, directory watchers, and more. Plus, see how these elements play out in real scenarios.
Whether you’re tweaking your current setup or building from the ground up, this session will arm you with the tools and insights needed to transform your FME usage into a powerhouse of productivity. Join us to discover effective strategies that simplify complex processes, enhancing your productivity and transforming your data management practices with FME. Let’s turn complexity into clarity and make your workspaces work wonders!
Dr. Sean Tan, Head of Data Science, Changi Airport Group
Discover how Changi Airport Group (CAG) leverages graph technologies and generative AI to revolutionize their search capabilities. This session delves into the unique search needs of CAG’s diverse passengers and customers, showcasing how graph data structures enhance the accuracy and relevance of AI-generated search results, mitigating the risk of “hallucinations” and improving the overall customer journey.
HCL Notes and Domino License Cost Reduction in the World of DLAUpanagenda
Webinar Recording: https://www.panagenda.com/webinars/hcl-notes-and-domino-license-cost-reduction-in-the-world-of-dlau/
The introduction of DLAU and the CCB & CCX licensing model caused quite a stir in the HCL community. As a Notes and Domino customer, you may have faced challenges with unexpected user counts and license costs. You probably have questions on how this new licensing approach works and how to benefit from it. Most importantly, you likely have budget constraints and want to save money where possible. Don’t worry, we can help with all of this!
We’ll show you how to fix common misconfigurations that cause higher-than-expected user counts, and how to identify accounts which you can deactivate to save money. There are also frequent patterns that can cause unnecessary cost, like using a person document instead of a mail-in for shared mailboxes. We’ll provide examples and solutions for those as well. And naturally we’ll explain the new licensing model.
Join HCL Ambassador Marc Thomas in this webinar with a special guest appearance from Franz Walder. It will give you the tools and know-how to stay on top of what is going on with Domino licensing. You will be able lower your cost through an optimized configuration and keep it low going forward.
These topics will be covered
- Reducing license cost by finding and fixing misconfigurations and superfluous accounts
- How do CCB and CCX licenses really work?
- Understanding the DLAU tool and how to best utilize it
- Tips for common problem areas, like team mailboxes, functional/test users, etc
- Practical examples and best practices to implement right away
GraphSummit Singapore | The Future of Agility: Supercharging Digital Transfor...Neo4j
Leonard Jayamohan, Partner & Generative AI Lead, Deloitte
This keynote will reveal how Deloitte leverages Neo4j’s graph power for groundbreaking digital twin solutions, achieving a staggering 100x performance boost. Discover the essential role knowledge graphs play in successful generative AI implementations. Plus, get an exclusive look at an innovative Neo4j + Generative AI solution Deloitte is developing in-house.
“An Outlook of the Ongoing and Future Relationship between Blockchain Technologies and Process-aware Information Systems.” Invited talk at the joint workshop on Blockchain for Information Systems (BC4IS) and Blockchain for Trusted Data Sharing (B4TDS), co-located with with the 36th International Conference on Advanced Information Systems Engineering (CAiSE), 3 June 2024, Limassol, Cyprus.
GraphRAG for Life Science to increase LLM accuracyTomaz Bratanic
GraphRAG for life science domain, where you retriever information from biomedical knowledge graphs using LLMs to increase the accuracy and performance of generated answers