The International Journal of Engineering & Science is aimed at providing a platform for researchers, engineers, scientists, or educators to publish their original research results, to exchange new ideas, to disseminate information in innovative designs, engineering experiences and technological skills. It is also the Journal's objective to promote engineering and technology education. All papers submitted to the Journal will be blind peer-reviewed. Only original articles will be published.
The papers for publication in The International Journal of Engineering& Science are selected through rigorous peer reviews to ensure originality, timeliness, relevance, and readability.
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology.
Performance comparison of qo s based routing protocols mbrr, rear and speed f...eSAT Journals
Abstract A wireless sensor network (WSN) is a collection of small randomly dispersed micro sensor nodes that have capability to sense, establish wireless communication between each other and do computations and process operations. A network especially wireless network strongly depends on the routing protocols to route the sensed data to the Base Station (BS) via some intermediate nodes. Due to fast emergence of the wireless sensing, a lot of work has been done on the various categories of routing protocols of WSN like location-based, data-centric, hierarchal routing protocols etc. to measure the network performance. But recent studies are provided with the evidence that Quality-of-Service (QoS) routing can enhance the network performance by increasing the network utilization, compared to routing that is not sensitive to QoS requirements of traffic. So in this paper, the focus is on evaluation and comparison of the network performance in the WSN having QoS routing. The comparison of the three QoS routing protocols MBRR (Majority Based Re-Routing), REAR (Reliable Energy Aware Routing) and SPEED (Stateless Protocol for End-to-End Delay) on the basis of various performance metrics such as Bit Error Rate (BER) vs. Signal-to-Noise Ratio (SNR), Average End-to-End Delay vs. BER, Packet Delivery Ratio vs. BER, Energy Consumed vs. BER, Network Lifetime vs. Energy Consumption, Throughput vs. BER and Throughput vs. SNR has been done in this research paper. On the basis of observed simulation results, it is concluded that the performance of MBRR is better than the performance of other two comparing protocols i.e. REAR and SPEED. Index Terms: Wireless Sensor Networks, Routing Protocols, QoS Routing, and Performance Evaluation etc.
This document describes the design of an extensible telemetry and command architecture for small satellites. Key aspects include:
1) A centralized server stores telemetry data, software configurations, and acts as a backup. Distributed hardware gateways at each ground station receive data, convert beacons, and store all data on the centralized server.
2) Telemetry is parsed according to a master definition that allows new parameters to be added easily. Beacons and files are converted to engineering units and stored in a mySQL database for post-processing.
3) A file transfer protocol is used to exchange data and commands between the satellite and ground stations during short orbital passes, with an emphasis on reliability, efficiency, and security
Mobile Data Gathering with Load Balanced Clustering and Dual Data Uploading i...1crore projects
IEEE PROJECTS 2015
1 crore projects is a leading Guide for ieee Projects and real time projects Works Provider.
It has been provided Lot of Guidance for Thousands of Students & made them more beneficial in all Technology Training.
Dot Net
DOTNET Project Domain list 2015
1. IEEE based on datamining and knowledge engineering
2. IEEE based on mobile computing
3. IEEE based on networking
4. IEEE based on Image processing
5. IEEE based on Multimedia
6. IEEE based on Network security
7. IEEE based on parallel and distributed systems
Java Project Domain list 2015
1. IEEE based on datamining and knowledge engineering
2. IEEE based on mobile computing
3. IEEE based on networking
4. IEEE based on Image processing
5. IEEE based on Multimedia
6. IEEE based on Network security
7. IEEE based on parallel and distributed systems
ECE IEEE Projects 2015
1. Matlab project
2. Ns2 project
3. Embedded project
4. Robotics project
Eligibility
Final Year students of
1. BSc (C.S)
2. BCA/B.E(C.S)
3. B.Tech IT
4. BE (C.S)
5. MSc (C.S)
6. MSc (IT)
7. MCA
8. MS (IT)
9. ME(ALL)
10. BE(ECE)(EEE)(E&I)
TECHNOLOGY USED AND FOR TRAINING IN
1. DOT NET
2. C sharp
3. ASP
4. VB
5. SQL SERVER
6. JAVA
7. J2EE
8. STRINGS
9. ORACLE
10. VB dotNET
11. EMBEDDED
12. MAT LAB
13. LAB VIEW
14. Multi Sim
CONTACT US
1 CRORE PROJECTS
Door No: 214/215,2nd Floor,
No. 172, Raahat Plaza, (Shopping Mall) ,Arcot Road, Vadapalani, Chennai,
Tamin Nadu, INDIA - 600 026
Email id: 1croreprojects@gmail.com
website:1croreprojects.com
Phone : +91 97518 00789 / +91 72999 51536
Comparative analysis on Void Node Removal Routing algorithms for Underwater W...Editor IJCATR
The designing of routing algorithms faces many challenges in underwater environment like: propagation delay, acoustic channel behaviour, limited bandwidth, high bit error rate, limited battery power, underwater pressure, node mobility, localization 3D deployment, and underwater obstacles (voids). This paper focuses the underwater voids which affects the overall performance of the entire network. The majority of the researchers have used the better approaches for removal of voids through alternate path selection mechanism but still research needs improvement. This paper also focuses the architecture and its operation through merits and demerits of the existing algorithms. This research article further focuses the analytical method of the performance analysis of existing algorithms through which we found the better approach for removal of voids
Sdci scalable distributed cache indexing for cache consistency for mobile env...eSAT Publishing House
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology.
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.
A method for balancing heterogeneous request load in dht based p2 pIAEME Publication
This document proposes an adaptive load balancing method for distributed hash table (DHT)-based peer-to-peer (P2P) systems to address load imbalance caused by skewed access distributions. The method distinguishes between query routing load and query answering load. It uses three strategies: 1) adaptive object replication to balance query load by replicating popular objects, 2) adaptive routing replication to share routing load by duplicating overloaded nodes' routing tables, and 3) dynamic routing table reconfiguration to relieve overloaded nodes by replacing their entries with less loaded nodes. The strategies aim to dynamically redistribute load from overloaded to underloaded nodes. Experiments showed the balancing algorithms effectively improve system load balance and performance.
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology.
Performance comparison of qo s based routing protocols mbrr, rear and speed f...eSAT Journals
Abstract A wireless sensor network (WSN) is a collection of small randomly dispersed micro sensor nodes that have capability to sense, establish wireless communication between each other and do computations and process operations. A network especially wireless network strongly depends on the routing protocols to route the sensed data to the Base Station (BS) via some intermediate nodes. Due to fast emergence of the wireless sensing, a lot of work has been done on the various categories of routing protocols of WSN like location-based, data-centric, hierarchal routing protocols etc. to measure the network performance. But recent studies are provided with the evidence that Quality-of-Service (QoS) routing can enhance the network performance by increasing the network utilization, compared to routing that is not sensitive to QoS requirements of traffic. So in this paper, the focus is on evaluation and comparison of the network performance in the WSN having QoS routing. The comparison of the three QoS routing protocols MBRR (Majority Based Re-Routing), REAR (Reliable Energy Aware Routing) and SPEED (Stateless Protocol for End-to-End Delay) on the basis of various performance metrics such as Bit Error Rate (BER) vs. Signal-to-Noise Ratio (SNR), Average End-to-End Delay vs. BER, Packet Delivery Ratio vs. BER, Energy Consumed vs. BER, Network Lifetime vs. Energy Consumption, Throughput vs. BER and Throughput vs. SNR has been done in this research paper. On the basis of observed simulation results, it is concluded that the performance of MBRR is better than the performance of other two comparing protocols i.e. REAR and SPEED. Index Terms: Wireless Sensor Networks, Routing Protocols, QoS Routing, and Performance Evaluation etc.
This document describes the design of an extensible telemetry and command architecture for small satellites. Key aspects include:
1) A centralized server stores telemetry data, software configurations, and acts as a backup. Distributed hardware gateways at each ground station receive data, convert beacons, and store all data on the centralized server.
2) Telemetry is parsed according to a master definition that allows new parameters to be added easily. Beacons and files are converted to engineering units and stored in a mySQL database for post-processing.
3) A file transfer protocol is used to exchange data and commands between the satellite and ground stations during short orbital passes, with an emphasis on reliability, efficiency, and security
Mobile Data Gathering with Load Balanced Clustering and Dual Data Uploading i...1crore projects
IEEE PROJECTS 2015
1 crore projects is a leading Guide for ieee Projects and real time projects Works Provider.
It has been provided Lot of Guidance for Thousands of Students & made them more beneficial in all Technology Training.
Dot Net
DOTNET Project Domain list 2015
1. IEEE based on datamining and knowledge engineering
2. IEEE based on mobile computing
3. IEEE based on networking
4. IEEE based on Image processing
5. IEEE based on Multimedia
6. IEEE based on Network security
7. IEEE based on parallel and distributed systems
Java Project Domain list 2015
1. IEEE based on datamining and knowledge engineering
2. IEEE based on mobile computing
3. IEEE based on networking
4. IEEE based on Image processing
5. IEEE based on Multimedia
6. IEEE based on Network security
7. IEEE based on parallel and distributed systems
ECE IEEE Projects 2015
1. Matlab project
2. Ns2 project
3. Embedded project
4. Robotics project
Eligibility
Final Year students of
1. BSc (C.S)
2. BCA/B.E(C.S)
3. B.Tech IT
4. BE (C.S)
5. MSc (C.S)
6. MSc (IT)
7. MCA
8. MS (IT)
9. ME(ALL)
10. BE(ECE)(EEE)(E&I)
TECHNOLOGY USED AND FOR TRAINING IN
1. DOT NET
2. C sharp
3. ASP
4. VB
5. SQL SERVER
6. JAVA
7. J2EE
8. STRINGS
9. ORACLE
10. VB dotNET
11. EMBEDDED
12. MAT LAB
13. LAB VIEW
14. Multi Sim
CONTACT US
1 CRORE PROJECTS
Door No: 214/215,2nd Floor,
No. 172, Raahat Plaza, (Shopping Mall) ,Arcot Road, Vadapalani, Chennai,
Tamin Nadu, INDIA - 600 026
Email id: 1croreprojects@gmail.com
website:1croreprojects.com
Phone : +91 97518 00789 / +91 72999 51536
Comparative analysis on Void Node Removal Routing algorithms for Underwater W...Editor IJCATR
The designing of routing algorithms faces many challenges in underwater environment like: propagation delay, acoustic channel behaviour, limited bandwidth, high bit error rate, limited battery power, underwater pressure, node mobility, localization 3D deployment, and underwater obstacles (voids). This paper focuses the underwater voids which affects the overall performance of the entire network. The majority of the researchers have used the better approaches for removal of voids through alternate path selection mechanism but still research needs improvement. This paper also focuses the architecture and its operation through merits and demerits of the existing algorithms. This research article further focuses the analytical method of the performance analysis of existing algorithms through which we found the better approach for removal of voids
Sdci scalable distributed cache indexing for cache consistency for mobile env...eSAT Publishing House
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology.
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.
A method for balancing heterogeneous request load in dht based p2 pIAEME Publication
This document proposes an adaptive load balancing method for distributed hash table (DHT)-based peer-to-peer (P2P) systems to address load imbalance caused by skewed access distributions. The method distinguishes between query routing load and query answering load. It uses three strategies: 1) adaptive object replication to balance query load by replicating popular objects, 2) adaptive routing replication to share routing load by duplicating overloaded nodes' routing tables, and 3) dynamic routing table reconfiguration to relieve overloaded nodes by replacing their entries with less loaded nodes. The strategies aim to dynamically redistribute load from overloaded to underloaded nodes. Experiments showed the balancing algorithms effectively improve system load balance and performance.
A New Efficient Cache Replacement Strategy for Named Data NetworkingIJCNCJournal
The Information-Centric Network (ICN) is a future internet architecture with efficient content retrieval and distribution. Named Data Networking (NDN) is one of the proposed architectures for ICN. NDN’s innetwork caching improves data availability, reduce retrieval delays, network load, alleviate producer load, and limit data traffic. Despite the existence of several caching decision algorithms, the fetching and distribution of contents with minimum resource utilization remains a great challenge. In this paper, we introduce a new cache replacement strategy called Enhanced Time and Frequency Cache Replacement strategy (ETFCR) where both cache hit frequency and cache retrieval time are used to select evicted data chunks. ETFCR adds time cycles between the last two requests to adjust data chunk’s popularity and cache hits. We conducted extensive simulations using the ccnSim simulator to evaluate the performance of ETFCR and compare it to that of some well-known cache replacement strategies. Simulations results show that ETFCR outperforms the other cache replacement strategies in terms of cache hit ratio, and lower content retrieval delay.
Solving QoS multicast routing problem using ACO algorithmAbdullaziz Tagawy
The document discusses using an ant colony optimization (ACO) algorithm to solve the quality of service (QoS) constrained multicast routing problem. The ACO algorithm is inspired by how real ants find the shortest path to food sources. In the algorithm, artificial ants probabilistically construct multicast trees and update pheromone values on the paths/edges to gradually converge on high quality solutions. The document provides details of the ACO algorithm and gives an example of applying it to find the shortest path between a source and destination node to demonstrate how it works.
THRESHOLD BASED VM PLACEMENT TECHNIQUE FOR LOAD BALANCED RESOURCE PROVISIONIN...IJCNCJournal
The unbalancing load issue is a multi-variation, multi-imperative issue that corrupts the execution and productivity of processing assets. Workload adjusting methods give solutions of load unbalancing circumstances for two bothersome aspects over-burdening and under-stacking. Cloud computing utilizes planning and workload balancing for a virtualized environment, resource partaking in cloud foundation. These two factors must be handled in an improved way in cloud computing to accomplish ideal resource sharing. Henceforth, there requires productive resource, asset reservation for guaranteeing load advancement in the cloud. This work aims to present an incorporated resource, asset reservation, and workload adjusting calculation for effective cloud provisioning. The strategy develops a Priority-based Resource Scheduling Model to acquire the resource, asset reservation with threshold-based load balancing for improving the proficiency in cloud framework. Extending utilization of Virtual Machines through the suitable and sensible outstanding task at hand modifying is then practiced by intensely picking a job from submitting jobs using Priority-based Resource Scheduling Model to acquire resource asset reservation. Experimental evaluations represent, the proposed scheme gives better results by reducing execution time, with minimum resource cost and improved resource utilization in dynamic resource provisioning conditions.
Advanced delay reduction algorithm based on GPS with Load Balancingijdpsjournal
A Mobile Ad-Hoc Network (MANET) is a self-configuring network of mobile nodes connected by wireless
links, to form an arbitrary topology. The nodes are free to move arbitrarily in the topology. Thus, the
network's wireless topology may be random and may change quickly. An ad Hoc network is formed by
sensor networks consisting of sensing, data processing, and communication components. There is frequent
occurrence of congested links in such a network as wireless links inherently have significantly lower
capacity than hardwired links and are therefore more prone to congestion. Here we proposed a algorithm
which involves the reduction in the delay with the help of Request_set created on the basis of the location
information of the destination node. Across the paths found in the Route_reply (RREP) packets the load is
equally distributed
Data gathering in wireless sensor networks using intermediate nodesIJCNCJournal
Energy consumption is an essential concern to Wireless Sensor Networks (WSNs).The major cause of the energy consumption in WSNs is due to the data aggregation. A data aggregation is a process of collecting data from sensor nodes and transmitting these data to the sink node or base station. An effective way to perform such a task is accomplished by using clustering. In clustering, nodes are grouped into clusters where a number of nodes, called cluster heads, are responsible for gathering data from other nodes, aggregate them and transmit them to the Base Station (BS).
In this paper we produce a new algorithm which focused on reducing the transmission bath between sensor nodes and cluster heads. A proper utilization and reserving of the available power resources is achieved with this technique compared to the well-known LEACH_C algorithm.
Architecture and Evaluation on Cooperative Caching In Wireless P2PIOSR Journals
The document summarizes research on cooperative caching in wireless peer-to-peer (P2P) networks. It proposes using an asymmetric cooperative caching approach with Dynamic Source Routing (DSR) to improve performance. DSR routing is chosen over AODV routing because it supports one-way links and source routing. The key aspects of the proposed approach are:
1) Data requests follow the normal routing path but data responses can follow a different path if intermediate nodes need to cache the data. This reduces overhead.
2) Only nodes that need to cache data receive the full data, others just get the routing layer, minimizing copying overhead.
3) Route discovery in DSR works by broadcasting route requests
ORCHESTRATING BULK DATA TRANSFERS ACROSS GEO-DISTRIBUTED DATACENTERSShakas Technologies
This document discusses orchestrating bulk data transfers across geo-distributed datacenters using software defined networking (SDN). It proposes modeling data transfer requests as delay tolerant migration tasks with deadlines and optimally routing distinct data chunks to maximize timely completions. Three dynamic algorithms are presented with varying levels of optimality and scalability. The document also describes building an SDN system based on OpenFlow to implement the bulk data transfer algorithms and conduct experiments comparing their performance.
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
Stable and Reliable Route Identification Scheme for Efficient DSR Route Cache...IJASCSE
This document summarizes a research paper that proposes a Stable and Reliable Route Identification (SRRI) scheme to improve the Dynamic Source Routing (DSR) protocol for mobile ad hoc networks. The SRRI scheme aims to improve route stability by periodically updating node transmission ranges and improve reliability by considering bandwidth availability. Simulation results show that SRRI achieves higher packet delivery ratios and lower routing overhead compared to the existing Expected Link Expiration Time (ELET) scheme, especially with increased node mobility. SRRI also helps minimize bandwidth consumption by maintaining route bandwidth histories in node caches.
An Improved Greedy Parameter Stateless Routing in Vehicular Ad Hoc NetworkIJAAS Team
Congestion problem and packet delivery related issues in the vehicular ad hoc network environment is a widely researched problem in recent years. Many network designers utilize various algorithms for the design of ad hoc networks and compare their results with the existing approaches. The design of efficient network protocol is a major challenge in vehicular ad hoc network which utilizes the value of GPS and other parameters associated with the vehicles. In this paper GPSR protocol is improved and compared with the existing GPSR protocol and AODV protocol on the basis of various performance parameters like throughput of the network, delay and packet delivery ratio. The results also validate the performance of the proposed approach.
This document summarizes a research paper that proposes using swarm intelligence algorithms to develop a compact routing mechanism for multipath networks. It aims to decrease the size of routing lists at each node by dividing traffic across multiple paths instead of using a single path. The document provides background on routing techniques and swarm intelligence. It then describes how the proposed method uses a particle swarm optimization algorithm to find the shortest path between nodes and minimize the size of routing tables by updating particle positions and velocities in an iterative process. The goal is to design effective and scalable routing algorithms for large networks inspired by collective behaviors in natural systems.
IRJET - Evaluating and Comparing the Two Variation with Current Scheduling Al...IRJET Journal
This document presents two variations of a job-driven scheduling scheme called JOSS for efficiently executing MapReduce jobs on remote outsourced data across multiple data centers. The goal of JOSS is to improve data locality for map and reduce tasks, avoid job starvation, and improve job performance. Extensive experiments show that the two JOSS variations, called JOSS-T and JOSS-J, outperform other scheduling algorithms in terms of data locality and network overhead without significant overhead. JOSS-T performs best for workloads of small jobs, while JOSS-J provides the shortest workload time for jobs of varying sizes distributed across data centers.
Shortest path algorithm for data transmission in wireless ad hoc sensor networksijasuc
Wireless sensor networks determine probable in military, environments, health and commercial
applications. The process of transferring of information from a remote sensor node to other nodes in a
network holds importance for such applications. Various constraints such as limited computation, storage
and power makes the process of transferring of information routing interesting and has opened new arenas
for researchers. The fundamental problem in sensor networks states the significance and routing of
information through a real path as path length decides some basic performance parameters for sensor
networks. This paper strongly focuses on a shortest path algorithm for wireless adhoc networks. The
simulations are performed on NS2 and the results obtained discuss the role of transferring of information
through a shortest path.
This document provides a survey of different void handling techniques that are suitable for vehicular ad hoc networks (VANETs). It begins with an introduction to geographic routing and the void problem in networks. Then it describes six categories of void handling techniques: planar graph based, face routing based, restricted direction based, hierarchical based, trajectory based, and cluster based. For each category, it briefly explains one or two representative techniques. Finally, it provides a comparative survey of the techniques based on important performance features.
Wireless sensor network consists of several distributed sensor nodes. It is used for several environmental applications, military applications and health related applications. To prolong the lifetime of the sensor nodes, designing efficient routing protocols is critical. Most of the research in energy efficient data gathering in data centric applications of wireless sensor networks is motivated by LEACH (Low Energy Adaptive Clustering Hierarchy) scheme. It allows the rotation of cluster head role among the sensor nodes and tries to distribute the energy consumption over the network. Selection of sensor node for such role rotations greatly affects the energy efficiency of the network. Some of the routing protocol has a drawback that the cluster is not evenly distributed due to its randomized rotation of local cluster head. We have surveyed several existing methods for selecting energy efficient cluster head in wireless sensor networks. We have proposed an energy efficient cluster head selection method in which the cluster head selection and replacement cost is reduced and ultimately the network lifetime is increased. Using our proposed method, network life time is increased compared to existing methods. Keywords: WSN, CH, BS, LEACH, LEACH-B, LEACH-F
International Journal of Advanced Smart Sensor Network Systems ( IJASSN )ijassn
This document summarizes a research paper that proposes an improved clustering technique called Optimized Fair-Zone LEACH (OFZ-LEACH) for wireless sensor networks. OFZ-LEACH uses an exponential moving average to predict node mobility and identify cluster head movement. This helps overcome issues in the original LEACH protocol like hidden clusters and link failures caused by node mobility. Simulation results show that OFZ-LEACH achieves higher packet delivery ratio, lower end-to-end delay, and extends network lifetime compared to the original LEACH and Fair-Zone LEACH protocols.
JPJ1410 PACK: Prediction-Based Cloud Bandwidth and Cost Reduction Systemchennaijp
This paper presents PACK, a receiver-based end-to-end traffic redundancy elimination system for cloud computing. PACK aims to reduce bandwidth costs for cloud customers by having the client predict and eliminate redundant data sent by the cloud server. It does this by having the client maintain chunks of previously received data and use these to identify redundant chunks in newly received data, allowing it to send "predictions" to the server about future chunks. This avoids the need for the server to do processing for traffic redundancy elimination.
The International Journal of Engineering & Science is aimed at providing a platform for researchers, engineers, scientists, or educators to publish their original research results, to exchange new ideas, to disseminate information in innovative designs, engineering experiences and technological skills. It is also the Journal's objective to promote engineering and technology education. All papers submitted to the Journal will be blind peer-reviewed. Only original articles will be published.
The papers for publication in The International Journal of Engineering& Science are selected through rigorous peer reviews to ensure originality, timeliness, relevance, and readability.
The International Journal of Engineering & Science is aimed at providing a platform for researchers, engineers, scientists, or educators to publish their original research results, to exchange new ideas, to disseminate information in innovative designs, engineering experiences and technological skills. It is also the Journal's objective to promote engineering and technology education. All papers submitted to the Journal will be blind peer-reviewed. Only original articles will be published.
The papers for publication in The International Journal of Engineering& Science are selected through rigorous peer reviews to ensure originality, timeliness, relevance, and readability.
The International Journal of Engineering & Science is aimed at providing a platform for researchers, engineers, scientists, or educators to publish their original research results, to exchange new ideas, to disseminate information in innovative designs, engineering experiences and technological skills. It is also the Journal's objective to promote engineering and technology education. All papers submitted to the Journal will be blind peer-reviewed. Only original articles will be published.
The papers for publication in The International Journal of Engineering& Science are selected through rigorous peer reviews to ensure originality, timeliness, relevance, and readability.
A New Efficient Cache Replacement Strategy for Named Data NetworkingIJCNCJournal
The Information-Centric Network (ICN) is a future internet architecture with efficient content retrieval and distribution. Named Data Networking (NDN) is one of the proposed architectures for ICN. NDN’s innetwork caching improves data availability, reduce retrieval delays, network load, alleviate producer load, and limit data traffic. Despite the existence of several caching decision algorithms, the fetching and distribution of contents with minimum resource utilization remains a great challenge. In this paper, we introduce a new cache replacement strategy called Enhanced Time and Frequency Cache Replacement strategy (ETFCR) where both cache hit frequency and cache retrieval time are used to select evicted data chunks. ETFCR adds time cycles between the last two requests to adjust data chunk’s popularity and cache hits. We conducted extensive simulations using the ccnSim simulator to evaluate the performance of ETFCR and compare it to that of some well-known cache replacement strategies. Simulations results show that ETFCR outperforms the other cache replacement strategies in terms of cache hit ratio, and lower content retrieval delay.
Solving QoS multicast routing problem using ACO algorithmAbdullaziz Tagawy
The document discusses using an ant colony optimization (ACO) algorithm to solve the quality of service (QoS) constrained multicast routing problem. The ACO algorithm is inspired by how real ants find the shortest path to food sources. In the algorithm, artificial ants probabilistically construct multicast trees and update pheromone values on the paths/edges to gradually converge on high quality solutions. The document provides details of the ACO algorithm and gives an example of applying it to find the shortest path between a source and destination node to demonstrate how it works.
THRESHOLD BASED VM PLACEMENT TECHNIQUE FOR LOAD BALANCED RESOURCE PROVISIONIN...IJCNCJournal
The unbalancing load issue is a multi-variation, multi-imperative issue that corrupts the execution and productivity of processing assets. Workload adjusting methods give solutions of load unbalancing circumstances for two bothersome aspects over-burdening and under-stacking. Cloud computing utilizes planning and workload balancing for a virtualized environment, resource partaking in cloud foundation. These two factors must be handled in an improved way in cloud computing to accomplish ideal resource sharing. Henceforth, there requires productive resource, asset reservation for guaranteeing load advancement in the cloud. This work aims to present an incorporated resource, asset reservation, and workload adjusting calculation for effective cloud provisioning. The strategy develops a Priority-based Resource Scheduling Model to acquire the resource, asset reservation with threshold-based load balancing for improving the proficiency in cloud framework. Extending utilization of Virtual Machines through the suitable and sensible outstanding task at hand modifying is then practiced by intensely picking a job from submitting jobs using Priority-based Resource Scheduling Model to acquire resource asset reservation. Experimental evaluations represent, the proposed scheme gives better results by reducing execution time, with minimum resource cost and improved resource utilization in dynamic resource provisioning conditions.
Advanced delay reduction algorithm based on GPS with Load Balancingijdpsjournal
A Mobile Ad-Hoc Network (MANET) is a self-configuring network of mobile nodes connected by wireless
links, to form an arbitrary topology. The nodes are free to move arbitrarily in the topology. Thus, the
network's wireless topology may be random and may change quickly. An ad Hoc network is formed by
sensor networks consisting of sensing, data processing, and communication components. There is frequent
occurrence of congested links in such a network as wireless links inherently have significantly lower
capacity than hardwired links and are therefore more prone to congestion. Here we proposed a algorithm
which involves the reduction in the delay with the help of Request_set created on the basis of the location
information of the destination node. Across the paths found in the Route_reply (RREP) packets the load is
equally distributed
Data gathering in wireless sensor networks using intermediate nodesIJCNCJournal
Energy consumption is an essential concern to Wireless Sensor Networks (WSNs).The major cause of the energy consumption in WSNs is due to the data aggregation. A data aggregation is a process of collecting data from sensor nodes and transmitting these data to the sink node or base station. An effective way to perform such a task is accomplished by using clustering. In clustering, nodes are grouped into clusters where a number of nodes, called cluster heads, are responsible for gathering data from other nodes, aggregate them and transmit them to the Base Station (BS).
In this paper we produce a new algorithm which focused on reducing the transmission bath between sensor nodes and cluster heads. A proper utilization and reserving of the available power resources is achieved with this technique compared to the well-known LEACH_C algorithm.
Architecture and Evaluation on Cooperative Caching In Wireless P2PIOSR Journals
The document summarizes research on cooperative caching in wireless peer-to-peer (P2P) networks. It proposes using an asymmetric cooperative caching approach with Dynamic Source Routing (DSR) to improve performance. DSR routing is chosen over AODV routing because it supports one-way links and source routing. The key aspects of the proposed approach are:
1) Data requests follow the normal routing path but data responses can follow a different path if intermediate nodes need to cache the data. This reduces overhead.
2) Only nodes that need to cache data receive the full data, others just get the routing layer, minimizing copying overhead.
3) Route discovery in DSR works by broadcasting route requests
ORCHESTRATING BULK DATA TRANSFERS ACROSS GEO-DISTRIBUTED DATACENTERSShakas Technologies
This document discusses orchestrating bulk data transfers across geo-distributed datacenters using software defined networking (SDN). It proposes modeling data transfer requests as delay tolerant migration tasks with deadlines and optimally routing distinct data chunks to maximize timely completions. Three dynamic algorithms are presented with varying levels of optimality and scalability. The document also describes building an SDN system based on OpenFlow to implement the bulk data transfer algorithms and conduct experiments comparing their performance.
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
Stable and Reliable Route Identification Scheme for Efficient DSR Route Cache...IJASCSE
This document summarizes a research paper that proposes a Stable and Reliable Route Identification (SRRI) scheme to improve the Dynamic Source Routing (DSR) protocol for mobile ad hoc networks. The SRRI scheme aims to improve route stability by periodically updating node transmission ranges and improve reliability by considering bandwidth availability. Simulation results show that SRRI achieves higher packet delivery ratios and lower routing overhead compared to the existing Expected Link Expiration Time (ELET) scheme, especially with increased node mobility. SRRI also helps minimize bandwidth consumption by maintaining route bandwidth histories in node caches.
An Improved Greedy Parameter Stateless Routing in Vehicular Ad Hoc NetworkIJAAS Team
Congestion problem and packet delivery related issues in the vehicular ad hoc network environment is a widely researched problem in recent years. Many network designers utilize various algorithms for the design of ad hoc networks and compare their results with the existing approaches. The design of efficient network protocol is a major challenge in vehicular ad hoc network which utilizes the value of GPS and other parameters associated with the vehicles. In this paper GPSR protocol is improved and compared with the existing GPSR protocol and AODV protocol on the basis of various performance parameters like throughput of the network, delay and packet delivery ratio. The results also validate the performance of the proposed approach.
This document summarizes a research paper that proposes using swarm intelligence algorithms to develop a compact routing mechanism for multipath networks. It aims to decrease the size of routing lists at each node by dividing traffic across multiple paths instead of using a single path. The document provides background on routing techniques and swarm intelligence. It then describes how the proposed method uses a particle swarm optimization algorithm to find the shortest path between nodes and minimize the size of routing tables by updating particle positions and velocities in an iterative process. The goal is to design effective and scalable routing algorithms for large networks inspired by collective behaviors in natural systems.
IRJET - Evaluating and Comparing the Two Variation with Current Scheduling Al...IRJET Journal
This document presents two variations of a job-driven scheduling scheme called JOSS for efficiently executing MapReduce jobs on remote outsourced data across multiple data centers. The goal of JOSS is to improve data locality for map and reduce tasks, avoid job starvation, and improve job performance. Extensive experiments show that the two JOSS variations, called JOSS-T and JOSS-J, outperform other scheduling algorithms in terms of data locality and network overhead without significant overhead. JOSS-T performs best for workloads of small jobs, while JOSS-J provides the shortest workload time for jobs of varying sizes distributed across data centers.
Shortest path algorithm for data transmission in wireless ad hoc sensor networksijasuc
Wireless sensor networks determine probable in military, environments, health and commercial
applications. The process of transferring of information from a remote sensor node to other nodes in a
network holds importance for such applications. Various constraints such as limited computation, storage
and power makes the process of transferring of information routing interesting and has opened new arenas
for researchers. The fundamental problem in sensor networks states the significance and routing of
information through a real path as path length decides some basic performance parameters for sensor
networks. This paper strongly focuses on a shortest path algorithm for wireless adhoc networks. The
simulations are performed on NS2 and the results obtained discuss the role of transferring of information
through a shortest path.
This document provides a survey of different void handling techniques that are suitable for vehicular ad hoc networks (VANETs). It begins with an introduction to geographic routing and the void problem in networks. Then it describes six categories of void handling techniques: planar graph based, face routing based, restricted direction based, hierarchical based, trajectory based, and cluster based. For each category, it briefly explains one or two representative techniques. Finally, it provides a comparative survey of the techniques based on important performance features.
Wireless sensor network consists of several distributed sensor nodes. It is used for several environmental applications, military applications and health related applications. To prolong the lifetime of the sensor nodes, designing efficient routing protocols is critical. Most of the research in energy efficient data gathering in data centric applications of wireless sensor networks is motivated by LEACH (Low Energy Adaptive Clustering Hierarchy) scheme. It allows the rotation of cluster head role among the sensor nodes and tries to distribute the energy consumption over the network. Selection of sensor node for such role rotations greatly affects the energy efficiency of the network. Some of the routing protocol has a drawback that the cluster is not evenly distributed due to its randomized rotation of local cluster head. We have surveyed several existing methods for selecting energy efficient cluster head in wireless sensor networks. We have proposed an energy efficient cluster head selection method in which the cluster head selection and replacement cost is reduced and ultimately the network lifetime is increased. Using our proposed method, network life time is increased compared to existing methods. Keywords: WSN, CH, BS, LEACH, LEACH-B, LEACH-F
International Journal of Advanced Smart Sensor Network Systems ( IJASSN )ijassn
This document summarizes a research paper that proposes an improved clustering technique called Optimized Fair-Zone LEACH (OFZ-LEACH) for wireless sensor networks. OFZ-LEACH uses an exponential moving average to predict node mobility and identify cluster head movement. This helps overcome issues in the original LEACH protocol like hidden clusters and link failures caused by node mobility. Simulation results show that OFZ-LEACH achieves higher packet delivery ratio, lower end-to-end delay, and extends network lifetime compared to the original LEACH and Fair-Zone LEACH protocols.
JPJ1410 PACK: Prediction-Based Cloud Bandwidth and Cost Reduction Systemchennaijp
This paper presents PACK, a receiver-based end-to-end traffic redundancy elimination system for cloud computing. PACK aims to reduce bandwidth costs for cloud customers by having the client predict and eliminate redundant data sent by the cloud server. It does this by having the client maintain chunks of previously received data and use these to identify redundant chunks in newly received data, allowing it to send "predictions" to the server about future chunks. This avoids the need for the server to do processing for traffic redundancy elimination.
The International Journal of Engineering & Science is aimed at providing a platform for researchers, engineers, scientists, or educators to publish their original research results, to exchange new ideas, to disseminate information in innovative designs, engineering experiences and technological skills. It is also the Journal's objective to promote engineering and technology education. All papers submitted to the Journal will be blind peer-reviewed. Only original articles will be published.
The papers for publication in The International Journal of Engineering& Science are selected through rigorous peer reviews to ensure originality, timeliness, relevance, and readability.
The International Journal of Engineering & Science is aimed at providing a platform for researchers, engineers, scientists, or educators to publish their original research results, to exchange new ideas, to disseminate information in innovative designs, engineering experiences and technological skills. It is also the Journal's objective to promote engineering and technology education. All papers submitted to the Journal will be blind peer-reviewed. Only original articles will be published.
The papers for publication in The International Journal of Engineering& Science are selected through rigorous peer reviews to ensure originality, timeliness, relevance, and readability.
The International Journal of Engineering & Science is aimed at providing a platform for researchers, engineers, scientists, or educators to publish their original research results, to exchange new ideas, to disseminate information in innovative designs, engineering experiences and technological skills. It is also the Journal's objective to promote engineering and technology education. All papers submitted to the Journal will be blind peer-reviewed. Only original articles will be published.
The papers for publication in The International Journal of Engineering& Science are selected through rigorous peer reviews to ensure originality, timeliness, relevance, and readability.
The International Journal of Engineering and Science (The IJES)theijes
The International Journal of Engineering & Science is aimed at providing a platform for researchers, engineers, scientists, or educators to publish their original research results, to exchange new ideas, to disseminate information in innovative designs, engineering experiences and technological skills. It is also the Journal's objective to promote engineering and technology education. All papers submitted to the Journal will be blind peer-reviewed. Only original articles will be published.
The papers for publication in The International Journal of Engineering& Science are selected through rigorous peer reviews to ensure originality, timeliness, relevance, and readability.
The International Journal of Engineering and Science (IJES)theijes
The International Journal of Engineering & Science is aimed at providing a platform for researchers, engineers, scientists, or educators to publish their original research results, to exchange new ideas, to disseminate information in innovative designs, engineering experiences and technological skills. It is also the Journal's objective to promote engineering and technology education. All papers submitted to the Journal will be blind peer-reviewed. Only original articles will be published.
The International Journal of Engineering and Science (The IJES)theijes
The International Journal of Engineering & Science is aimed at providing a platform for researchers, engineers, scientists, or educators to publish their original research results, to exchange new ideas, to disseminate information in innovative designs, engineering experiences and technological skills. It is also the Journal's objective to promote engineering and technology education. All papers submitted to the Journal will be blind peer-reviewed. Only original articles will be published.
The papers for publication in The International Journal of Engineering& Science are selected through rigorous peer reviews to ensure originality, timeliness, relevance, and readability
The International Journal of Engineering & Science is aimed at providing a platform for researchers, engineers, scientists, or educators to publish their original research results, to exchange new ideas, to disseminate information in innovative designs, engineering experiences and technological skills. It is also the Journal's objective to promote engineering and technology education. All papers submitted to the Journal will be blind peer-reviewed. Only original articles will be published.
The papers for publication in The International Journal of Engineering& Science are selected through rigorous peer reviews to ensure originality, timeliness, relevance, and readability.
The International Journal of Engineering & Science is aimed at providing a platform for researchers, engineers, scientists, or educators to publish their original research results, to exchange new ideas, to disseminate information in innovative designs, engineering experiences and technological skills. It is also the Journal's objective to promote engineering and technology education. All papers submitted to the Journal will be blind peer-reviewed. Only original articles will be published.
The papers for publication in The International Journal of Engineering& Science are selected through rigorous peer reviews to ensure originality, timeliness, relevance, and readability.
The International Journal of Engineering & Science is aimed at providing a platform for researchers, engineers, scientists, or educators to publish their original research results, to exchange new ideas, to disseminate information in innovative designs, engineering experiences and technological skills. It is also the Journal's objective to promote engineering and technology education. All papers submitted to the Journal will be blind peer-reviewed. Only original articles will be published.
The papers for publication in The International Journal of Engineering& Science are selected through rigorous peer reviews to ensure originality, timeliness, relevance, and readability.
The International Journal of Engineering and Science (The IJES)theijes
The International Journal of Engineering & Science is aimed at providing a platform for researchers, engineers, scientists, or educators to publish their original research results, to exchange new ideas, to disseminate information in innovative designs, engineering experiences and technological skills. It is also the Journal's objective to promote engineering and technology education. All papers submitted to the Journal will be blind peer-reviewed. Only original articles will be published.
The papers for publication in The International Journal of Engineering& Science are selected through rigorous peer reviews to ensure originality, timeliness, relevance, and readability.
The International Journal of Engineering & Science is aimed at providing a platform for researchers, engineers, scientists, or educators to publish their original research results, to exchange new ideas, to disseminate information in innovative designs, engineering experiences and technological skills. It is also the Journal's objective to promote engineering and technology education. All papers submitted to the Journal will be blind peer-reviewed. Only original articles will be published.
The papers for publication in The International Journal of Engineering& Science are selected through rigorous peer reviews to ensure originality, timeliness, relevance, and readability.
The International Journal of Engineering and Science (The IJES)theijes
The International Journal of Engineering & Science is aimed at providing a platform for researchers, engineers, scientists, or educators to publish their original research results, to exchange new ideas, to disseminate information in innovative designs, engineering experiences and technological skills. It is also the Journal's objective to promote engineering and technology education. All papers submitted to the Journal will be blind peer-reviewed. Only original articles will be published.
The papers for publication in The International Journal of Engineering& Science are selected through rigorous peer reviews to ensure originality, timeliness, relevance, and readability.
The International Journal of Engineering and Science (The IJES)theijes
The International Journal of Engineering & Science is aimed at providing a platform for researchers, engineers, scientists, or educators to publish their original research results, to exchange new ideas, to disseminate information in innovative designs, engineering experiences and technological skills. It is also the Journal's objective to promote engineering and technology education. All papers submitted to the Journal will be blind peer-reviewed. Only original articles will be published.
The papers for publication in The International Journal of Engineering& Science are selected through rigorous peer reviews to ensure originality, timeliness, relevance, and readability.
The International Journal of Engineering & Science is aimed at providing a platform for researchers, engineers, scientists, or educators to publish their original research results, to exchange new ideas, to disseminate information in innovative designs, engineering experiences and technological skills. It is also the Journal's objective to promote engineering and technology education. All papers submitted to the Journal will be blind peer-reviewed. Only original articles will be published.
The papers for publication in The International Journal of Engineering& Science are selected through rigorous peer reviews to ensure originality, timeliness, relevance, and readability.
The International Journal of Engineering and Science (The IJES)theijes
The International Journal of Engineering & Science is aimed at providing a platform for researchers, engineers, scientists, or educators to publish their original research results, to exchange new ideas, to disseminate information in innovative designs, engineering experiences and technological skills. It is also the Journal's objective to promote engineering and technology education. All papers submitted to the Journal will be blind peer-reviewed. Only original articles will be published.
The International Journal of Engineering & Science is aimed at providing a platform for researchers, engineers, scientists, or educators to publish their original research results, to exchange new ideas, to disseminate information in innovative designs, engineering experiences and technological skills. It is also the Journal's objective to promote engineering and technology education. All papers submitted to the Journal will be blind peer-reviewed. Only original articles will be published.
The papers for publication in The International Journal of Engineering& Science are selected through rigorous peer reviews to ensure originality, timeliness, relevance, and readability.
The International Journal of Engineering & Science is aimed at providing a platform for researchers, engineers, scientists, or educators to publish their original research results, to exchange new ideas, to disseminate information in innovative designs, engineering experiences and technological skills. It is also the Journal's objective to promote engineering and technology education. All papers submitted to the Journal will be blind peer-reviewed. Only original articles will be published.
The papers for publication in The International Journal of Engineering& Science are selected through rigorous peer reviews to ensure originality, timeliness, relevance, and readability.
This document summarizes a research paper that examines issues related to waterfront redevelopment in Port Harcourt, Nigeria. Specifically, it looks at the demolition of waterfront slums, concerns of affected residents, and challenges of implementing demolition policies. It discusses the pros and cons of considering these areas as dysfunctional versus recognizing their social and economic functions. While complete sudden clearance may worsen problems, rehabilitation may not always be feasible. The document recommends a gradual phased redevelopment process to minimize negative impacts. It provides background on Port Harcourt's population growth and past government efforts to address slums. The research involved interviews and surveys of waterfront residents to understand perspectives on living conditions and awareness of redevelopment policies.
The International Journal of Engineering & Science is aimed at providing a platform for researchers, engineers, scientists, or educators to publish their original research results, to exchange new ideas, to disseminate information in innovative designs, engineering experiences and technological skills. It is also the Journal's objective to promote engineering and technology education. All papers submitted to the Journal will be blind peer-reviewed. Only original articles will be published.
The papers for publication in The International Journal of Engineering& Science are selected through rigorous peer reviews to ensure originality, timeliness, relevance, and readability.
This document proposes a system for efficient analysis of sensor data in wireless sensor networks using cloud storage and the Greedy Perimeter Stateless Routing (GPSR) algorithm. GPSR uses greedy forwarding and perimeter routing to route packets between nodes. The system stores sensor data in the cloud, allowing users to access data, information, and insights. The document summarizes existing routing protocols and their limitations. It then describes the proposed system's architecture and GPSR algorithm in more detail. A simulation is used to evaluate GPSR's performance compared to Dynamic Source Routing in terms of packet delivery ratio, energy consumption, and delay. The system aims to improve scalability as the number of nodes increases in large-scale wireless sensor networks.
Efficient IOT Based Sensor Data Analysis in Wireless Sensor Networks with Cloudiosrjce
This summary provides the key details from the document in 3 sentences:
The document proposes an efficient IoT-based sensor data analysis system in wireless sensor networks using cloud computing. It utilizes the Greedy Perimeter Stateless Routing (GPSR) algorithm to route sensor data to cloud storage. The system is evaluated through simulations analyzing parameters like packet delivery ratio, energy consumption, and delay.
Power Aware Geocast Based Geocast Region Tracking Using Mobile Node in Wirele...inventionjournals
The document proposes a Power Aware Geocast Based Geocast Region Tracking Using Mobile Node in Wireless Ad Hoc Network. It introduces Position-Aware Geocast Routing Mechanism (PAGRM) to improve reliability of data delivery and energy efficiency. PAGRM uses geographical locations for geocast routing and region tracking. It combines geographic routing with region flooding to achieve high delivery rates and low overhead. Simulation results show PAGRM has higher throughput and lower time complexity than other region tracking methods.
Geographical routing protocols for mobile ad hoc networks a survey on their ...eSAT Journals
Abstract Mobile Ad Hoc network is an autonomous system of mobile nodes connected by wireless links forming a temporary network without the aid of any centralized administration or infrastructure. Each node operates not only as an end system but also as a router to forward packets. The nodes are free to move themselves into a network. These networks have no fixed topology due to the high degree of node mobility. To accommodate the changing topology, special routing protocols are needed. The goal of the routing protocol is to have an efficient route establishment between a pair of nodes, so that messages can be delivered in a timely manner. Mobile Ad Hoc routing protocols are divided into Flat routing, Hierarchical routing, Geographical routing, Power aware routing and Multicast routing. It is difficult to determine which protocols may perform well under a number of different network scenarios. This paper provides an overview of geographical routing protocols proposed in the literature and performance comparison of geographical routing protocols. Index Terms: Mobile Ad Hoc Network, Geographical Routing protocols.
COMPRESSIVE DATA GATHERING TECHNIQUE BY AVOIDING CORRELATED DATA IN WSNpharmaindexing
This document proposes a technique for compressive data gathering in wireless sensor networks using mobile data collectors. It involves identifying correlated sensor data within clusters near polling points and defining a tour plan for mobile collectors that avoids visiting these correlated sensors. This is done using a spatial correlation method. The goal is to identify new optimal polling points by avoiding correlated sensors, which reduces the tour length of mobile collectors and the number of polling points needed. This extends the lifetime of the wireless sensor network. The document provides background on related work using mobile data collectors and discusses how the proposed approach improves upon prior methods.
A Review on Routing Algorithms for Lower Earth Orbit Satellite NetworksIRJET Journal
This document reviews and compares various routing algorithms that have been proposed for lower earth orbit (LEO) satellite networks. It first provides background on the importance and challenges of routing in LEO satellite networks due to their dynamic topology and bandwidth/latency constraints. It then summarizes 10 different routing algorithms that have been proposed in previous research, highlighting the key idea/method used by each one and their advantages. These algorithms use approaches like link reversal, dynamic clustering, ant colony optimization, software defined networking, and reinforcement learning. The document concludes by comparing the different algorithms in a table based on their approaches and benefits.
Survey on confidentiality of the user and query processing on spatial networkeSAT Journals
Abstract
The administration of transhipment systems has become increasingly important in many applications such as position-based services, supply cycle management, travel control, and so on. These applications usually involve queries over spatial networks with vigorously changing and problematical travel conditions. There may be possibilities of user's privacy violated when they are querying about the location information on the third party servers where the location information about the users will be tracked. The malicious attackers may steal the location information about the users. The k nearest neighbour query verification with location points on Voronoi diagram increases the verification cost on mobile clients. The reverse nearest neighbour queries by assigning each object and query with a safe region is applied such that the expensive recomputation is not required as long as the query and objects remain in their respective safe regions. The proposed system reduces the communication cost in client-server architectures because an object does not report its location to the server unless it leaves its safe region or the server sends a location update request. Hilbert curve is used here for the capability of partially retaining the neighbouring adjacency of the original data. The user data is protected by applying Hilbert transform over the original values and storing the transformed values in the Hilbert curve.
Keywords— Hilbert Curve, Voronoi diagram, Hilbert Transform
The International Journal of Engineering & Science is aimed at providing a platform for researchers, engineers, scientists, or educators to publish their original research results, to exchange new ideas, to disseminate information in innovative designs, engineering experiences and technological skills. It is also the Journal's objective to promote engineering and technology education. All papers submitted to the Journal will be blind peer-reviewed. Only original articles will be published.
The papers for publication in The International Journal of Engineering& Science are selected through rigorous peer reviews to ensure originality, timeliness, relevance, and readability.
IRJET-Mobility Aware Refined Counter Based Broadcasting Model of MANETIRJET Journal
Manjusha Deshmukh,Ratnadeep Deshmukh, Sangeeta Kakarwal, "Mobility Aware Refined Counter Based Broadcasting Model of MANET", International Research Journal of Engineering and Technology (IRJET), Vol2,issue-01 March 2015. p-ISSN:2395-0056, e-ISSN:2395-0072. www.irjet.net ,published by Fast Track Publications
Abstract
The MANET is a special type of wireles mobile network in which mobile hosts can communicate without any aid of established infrastructure. Broadcast or flooding is a dissemination technique oparamount importance in mobile ad-hoc networks MANETs are generating lots of interest due to their dynamic topology and decentralized administration Due to the mobility of nodes there are many problem occurred during the packet transmission. Basic routing protocols such as Ad hoc on Demand Distance Vecto(AODV), Dynamic source routing (DSR) could lead toissues such as Broadcast Storm Problem, Large power consumption, link failure due to mobility. Counter based approaches inhibit a node from broadcasting a packet based on number of copies of the broadcaspacket received by the node within a random accessdelay time. It relies on the threshold value to decide whether or not to forward broadcast packet. In this paper, model is proposed which refines the counter based threshold based on network density and the mobility of nodes. The paper refined the sparse threshold as low sparse threshold and high sparse threshold and dense threshold as low dense threshold and high dense threshold.
Integrated Resource Adaptive On Demand Geographic Routing (IRA-ODGR) for MANETijsrd.com
It is a big challenge to develop routing protocol that can meet different application needs and optimize routing paths according to the topology change in mobile ad hoc networks. The existing work presented two self-adaptive on-demand geographic routing schemes to build efficient paths based on the needs of user applications and adapt to various scenarios for provide efficient and reliable routing. To overcome the impact due to inaccurate local topology knowledge, the topology information is updated at a node in the specific time periods. The on-demand routing mechanism reduces to control overhead made on geographic routing. The route optimization scheme adapts routing path according to the topology changes and actual data traffic requirements. Adaptive parameter setting scheme is introduced to allow each node to determine and adjust the protocol parameter values independently. However, existing work did not address resource parameters such as energy, bandwidth and data loss. The proposal presents and Integrated Resource Adaptive on Demand Geographic Routing (IRA-ODGR) for MANET. The node energy resource is optimized with path energy consumption rate and bandwidth utilization of the path is analysed. Loss rate is reduced in geographic routing with dynamic routes. The simulation conducted to demonstrate IRA-ODGR routing protocols.
Redundant Actor Based Multi-Hole Healing System for Mobile Sensor NetworksEditor IJCATR
In recent years, the Mobile Wireless Sensor Network
is the emerging solution for monitoring of a specified region of
interest. Several anomalies can occur in WSNs that impair their
desired functionalities resulting in the formation of different
kinds of holes, namely: coverage holes, routing holes. Our
ultimate aim is to cover total area without coverage hole in
wireless sensor networks. We propose a comprehensive solution,
called holes detection and healing. We divided our proposed
work into two phases. The first phase consists of three sub- tasks;
Hole-identification, Hole-discovery and border detection. The
second phase treats the Hole-healing with novel concept, hole
healing area. It consists of two sub-tasks; Hole healing area
determination and node relocation.
International Journal of Computational Engineering Research(IJCER)ijceronline
International Journal of Computational Engineering Research(IJCER) is an intentional online Journal in English monthly publishing journal. This Journal publish original research work that contributes significantly to further the scientific knowledge in engineering and Technology.
Sdci scalable distributed cache indexing for cache consistency for mobile en...eSAT Journals
This document describes a new cache consistency maintenance scheme called Scalable Distributed Cache Indexing for Cache Consistency (SDCI) for mobile environments. SDCI uses three key features: 1) standard bits at the server and mobile node's cache to maintain consistency, 2) a local cache standard for invalidated entries to maximize broadcast efficiency, and 3) marking all valid cache entries as uncertain when the mobile node wakes up. Simulation results show SDCI has superior performance to existing algorithms, supporting more mobile nodes and lower average access delays. The algorithm aims to be scalable with minimal database overhead through its design.
Iaetsd a survey on geographic routing relay selection inIaetsd Iaetsd
The document summarizes research on geographic routing and relay selection in wireless sensor networks. It discusses how geographic routing uses location information to route packets towards a destination but faces challenges around connectivity holes and optimal relay selection. The document reviews several existing approaches and their limitations. It then describes an alternative method called ALBA-R that was proposed to more efficiently route around holes while enhancing relay selection to maximize node lifetime. Simulation results showed ALBA-R outperformed other methods with respect to metrics like overhead and end-to-end delay.
International Journal of Engineering Research and Applications (IJERA) aims to cover the latest outstanding developments in the field of all Engineering Technologies & science.
International Journal of Engineering Research and Applications (IJERA) is a team of researchers not publication services or private publications running the journals for monetary benefits, we are association of scientists and academia who focus only on supporting authors who want to publish their work. The articles published in our journal can be accessed online, all the articles will be archived for real time access.
Our journal system primarily aims to bring out the research talent and the works done by sciaentists, academia, engineers, practitioners, scholars, post graduate students of engineering and science. This journal aims to cover the scientific research in a broader sense and not publishing a niche area of research facilitating researchers from various verticals to publish their papers. It is also aimed to provide a platform for the researchers to publish in a shorter of time, enabling them to continue further All articles published are freely available to scientific researchers in the Government agencies,educators and the general public. We are taking serious efforts to promote our journal across the globe in various ways, we are sure that our journal will act as a scientific platform for all researchers to publish their works online.
Dvr based hybrid routing protocols in mobile ad-hoc network application and c...eSAT Publishing House
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
This document discusses using moments to estimate the performance of re-routing in vehicular ad hoc networks (VANETs). It first provides background on VANETs and their characteristics. It then discusses using an ant colony optimization algorithm to optimize re-routing and estimating the performance analytically using moments to allow for intermediate step analysis. This improves the accuracy of re-routing estimation by considering locations of nodes between the starting and ending points. The document provides an example algorithm and procedure for computing potential re-routes and identifying the shortest path using node locations and distances.
LOAD BALANCING AND PROVIDING SECURITY USING RSA IN WIRELESS SENSOR NETWORKSIJARIIT
This paper presents load balancing and provides security using RSA algorithm. This is brief introduction to handle the traffic on node. This represents the converge-casting protocol in wireless sensor networks. The protocol is localized and distributed, and adapts efficiently to vary traffic. Graphs are analyzed using NS-2 simulator, here end-to-end packet latency, packet delivery ratio, throughput are analyzed. This is done for 30 nodes in NS-2 simulation.
Performance Evaluation and Comparison of On-Demand Routing Protocols for Ad H...Eswar Publications
Routing in mobile ad-hoc networks is an integral aspect of communication between devices. Routing is considered to
be a challenging task in MANETs due to the drastic and unpredictable changes in network topologies as a result of
the random and frequent movement of the nodes and due to the absence of any centralized control. Several routing protocols have been designed and developed to perform under various network environments. In this work a systematic simulation based performance study of the four prominent routing protocols: Ad hoc on Demand Multipath Routing Distance Vector (AOMDV), Dynamic Source Routing (DSR), Ad Hoc On Demand Distance Vector (AODV) and Temporarily Ordered Routing (TORA) protocols in the simulated networking environment under varying number of nodes in various scenarios is performed. These protocols use on-demand routing and have different protocol mechanisms leading to differences in performance. The performance is analyzed and evaluated based on end to end delay, packet delivery ratio, routing overheads and through-put done by varying network load, and the size of the network. Based on the observations, we make recommendations about the performance of the
protocols.
Virtual Backbone Based Content Routing in Wireless Ad-Hoc Networkijwmn
We developed a new content routing based on the virtual backbone structure, which groups wireless nodes and contents into a virtual architecture. Our approach is scalable, works with local information, and does not rely on address information. The naming system uses flat naming to identify nodes and contents, and organizes these identifiers together. Backbone nodes can be selected automatically or predefined to direct their associated normal nodes in a local area. The normal nodes are guided by the backbone nodes to full fill the searching and routing processe
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!
Fueling AI with Great Data with Airbyte WebinarZilliz
This talk will focus on how to collect data from a variety of sources, leveraging this data for RAG and other GenAI use cases, and finally charting your course to productionalization.
Salesforce Integration for Bonterra Impact Management (fka Social Solutions A...Jeffrey Haguewood
Sidekick Solutions uses Bonterra Impact Management (fka Social Solutions Apricot) and automation solutions to integrate data for business workflows.
We believe integration and automation are essential to user experience and the promise of efficient work through technology. Automation is the critical ingredient to realizing that full vision. We develop integration products and services for Bonterra Case Management software to support the deployment of automations for a variety of use cases.
This video focuses on integration of Salesforce with Bonterra Impact Management.
Interested in deploying an integration with Salesforce for Bonterra Impact Management? Contact us at sales@sidekicksolutionsllc.com to discuss next steps.
Ocean lotus Threat actors project by John Sitima 2024 (1).pptxSitimaJohn
Ocean Lotus cyber threat actors represent a sophisticated, persistent, and politically motivated group that poses a significant risk to organizations and individuals in the Southeast Asian region. Their continuous evolution and adaptability underscore the need for robust cybersecurity measures and international cooperation to identify and mitigate the threats posed by such advanced persistent threat groups.
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
Main news related to the CCS TSI 2023 (2023/1695)Jakub Marek
An English 🇬🇧 translation of a presentation to the speech I gave about the main changes brought by CCS TSI 2023 at the biggest Czech conference on Communications and signalling systems on Railways, which was held in Clarion Hotel Olomouc from 7th to 9th November 2023 (konferenceszt.cz). Attended by around 500 participants and 200 on-line followers.
The original Czech 🇨🇿 version of the presentation can be found here: https://www.slideshare.net/slideshow/hlavni-novinky-souvisejici-s-ccs-tsi-2023-2023-1695/269688092 .
The videorecording (in Czech) from the presentation is available here: https://youtu.be/WzjJWm4IyPk?si=SImb06tuXGb30BEH .
In the rapidly evolving landscape of technologies, XML continues to play a vital role in structuring, storing, and transporting data across diverse systems. The recent advancements in artificial intelligence (AI) present new methodologies for enhancing XML development workflows, introducing efficiency, automation, and intelligent capabilities. This presentation will outline the scope and perspective of utilizing AI in XML development. The potential benefits and the possible pitfalls will be highlighted, providing a balanced view of the subject.
We will explore the capabilities of AI in understanding XML markup languages and autonomously creating structured XML content. Additionally, we will examine the capacity of AI to enrich plain text with appropriate XML markup. Practical examples and methodological guidelines will be provided to elucidate how AI can be effectively prompted to interpret and generate accurate XML markup.
Further emphasis will be placed on the role of AI in developing XSLT, or schemas such as XSD and Schematron. We will address the techniques and strategies adopted to create prompts for generating code, explaining code, or refactoring the code, and the results achieved.
The discussion will extend to how AI can be used to transform XML content. In particular, the focus will be on the use of AI XPath extension functions in XSLT, Schematron, Schematron Quick Fixes, or for XML content refactoring.
The presentation aims to deliver a comprehensive overview of AI usage in XML development, providing attendees with the necessary knowledge to make informed decisions. Whether you’re at the early stages of adopting AI or considering integrating it in advanced XML development, this presentation will cover all levels of expertise.
By highlighting the potential advantages and challenges of integrating AI with XML development tools and languages, the presentation seeks to inspire thoughtful conversation around the future of XML development. We’ll not only delve into the technical aspects of AI-powered XML development but also discuss practical implications and possible future directions.
Skybuffer SAM4U tool for SAP license adoptionTatiana Kojar
Manage and optimize your license adoption and consumption with SAM4U, an SAP free customer software asset management tool.
SAM4U, an SAP complimentary software asset management tool for customers, delivers a detailed and well-structured overview of license inventory and usage with a user-friendly interface. We offer a hosted, cost-effective, and performance-optimized SAM4U setup in the Skybuffer Cloud environment. You retain ownership of the system and data, while we manage the ABAP 7.58 infrastructure, ensuring fixed Total Cost of Ownership (TCO) and exceptional services through the SAP Fiori interface.
How to Interpret Trends in the Kalyan Rajdhani Mix Chart.pdfChart Kalyan
A Mix Chart displays historical data of numbers in a graphical or tabular form. The Kalyan Rajdhani Mix Chart specifically shows the results of a sequence of numbers over different periods.
Taking AI to the Next Level in Manufacturing.pdfssuserfac0301
Read Taking AI to the Next Level in Manufacturing to gain insights on AI adoption in the manufacturing industry, such as:
1. How quickly AI is being implemented in manufacturing.
2. Which barriers stand in the way of AI adoption.
3. How data quality and governance form the backbone of AI.
4. Organizational processes and structures that may inhibit effective AI adoption.
6. Ideas and approaches to help build your organization's AI strategy.
Have you ever been confused by the myriad of choices offered by AWS for hosting a website or an API?
Lambda, Elastic Beanstalk, Lightsail, Amplify, S3 (and more!) can each host websites + APIs. But which one should we choose?
Which one is cheapest? Which one is fastest? Which one will scale to meet our needs?
Join me in this session as we dive into each AWS hosting service to determine which one is best for your scenario and explain why!
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
Programming Foundation Models with DSPy - Meetup SlidesZilliz
Prompting language models is hard, while programming language models is easy. In this talk, I will discuss the state-of-the-art framework DSPy for programming foundation models with its powerful optimizers and runtime constraint system.
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
HCL Notes and Domino License Cost Reduction in the World of DLAU
B03202006011
1. The International Journal Of Engineering And Science (IJES)
||Volume|| 3 ||Issue|| 2 ||Pages|| 06 - 11 || 2014 ||
ISSN (e): 2319 – 1813 ISSN (p): 2319 – 1805
A Light Weight Multi-Copy Geocache Maintenance in Mobile
Disconnected networks
1,
M.Subalakshmi, 2, Dr.M.Prabakaran,
1,
Research Scholar of Bharathidasan University
Head of the Department, Department Of Computer Science
Sri Saradha College for Women, Perambalur, Tamilnadu, India
2,
Research advisor,
Asst, Professor, department of computer science
Government Arts College, ariyalur-621713, Tamilnadu, India
-------------------------------------------------------ABSTRACT--------------------------------------------------We present a light weight Geocache maintenance algorithm to maintain the information at a particular location
in mobile disconnected networks. In mobile disconnected networks the mobile nodes within the coverage of
particular location can carry the data for little while and pass to some other node when it moves away from the
location. The selection of nodes to carry the data by means of movement of the node and returning the data to
the location when it moves away from location doesn’t make sense. Because it increases the traffic in the
network and the traffic introduced in sending the data back to the location will increase the network overhead.
To challenge this issue we introduce a multi-copy Geocache maintenance algorithm, where the cache or data
will be maintained in few nodes around the location. In the proposed methodology the data will not be returned
to the origin but will be handover to some other node which is closer in origins perimeter. This reduces the
unnecessary routing of packets and data towards the origin and removes the failure introduced by the node
failure.
INDEX TERMS: Geocache Maintenance, Mobile Disconnected Networks, Location based information.
--------------------------------------------------------------------------------------------------------------------------------------Date of Submission: 11 January 2014
Date of Acceptance: 15 February 2014
---------------------------------------------------------------------------------------------------------------------------------------
I.
INTRODUCTION:
The peoples started using mobile phones and PDA’s in their daily life. Due to the technology
development these mobile devices could be used as a sensing device. Unlike few automatic special purpose
sensing machines, above said devices can sense anytime anywhere, so that the people can watch audio, video,
pictures and other format data’s independent of amount of data volume. These data can potentially bring great
convenience to the society as they can serve as traces of our lives and logs of the physical world.
Fully utilizing these data, however, demands the establishment of channels between data producers and
consumers. We have seen several methods that were used to establish such channels in earlier systems. In many
web applications, data producers upload their data to servers, and consumers can either directly contact the
server or locate the server through a search engine; in many peer-to-peer data sharing applications, directories
are used to map data names to their locations. Though these methods have proven success in their intended
systems, they are unsuitable for the anytime-anywhere personal sensing. In personal sensing, there is no fixed
relationship between data producers and consumers. Data are more likely to be produced unintentionally than
purposefully, and the value of the data is discovered postfacto. Consequently, we may end up having much more
data than what will be needed later, and uploading these data can place a huge burden on the underlying
network. In addition, privacy can be a serious concern in a server-centric solution as well. This relationship, i.e.,
having many more producers than consumers, is opposite from what we have observed in other systems, and
thus calls for a new data sharing architecture.
For example suppose you have lost your laptop somewhere around a location in Chennai (Guindy),
what we will do is we simply file a complaint in the police station and later we check for the updation in the
police station. This form of query becomes location based query and to facilitate this we have designed a
container where the information is stored and the information about the container is called Geocache. The
Geocache are maintained around the location in few mobile nodes, so that it could be fetched easily at the time
of location based query arises.
www.theijes.com
The IJES
Page 6
2. A Light Weight Multi-Copy Geocache Maintenance in Mobile Disconnected networks
1.
2.
In this paper we address the following challenges
Maintaining the Geocache persistent even at natural disaster and temporary node disconnection and
node failure.
Minimizing the network overhead induced by routing the Geocache towards location of interest.
II.
BACKGROUND:
The area of interest covers mobile computing, sensor networks and vehicular networks. There are
various methodologies have been discussed to support location based queries in vehicular networks. We discuss
few of them here and analyze the techniques proposed for the support of location based queries.
GHT: A Geographic Hash Table for Data-Centric Storage [1], have been proposed, which specifies
hash table mechanism to store geographic data in Data centric Storage. In this GHT hashes keys into geographic
coordinates, and stores a key-value pair at the sensor node geographically nearest the hash of its key. The
system replicates stored data locally to ensure persistence when nodes fail. A data object is associated with a
key and each node in the system is responsible for storing a certain range of keys. A name-based routing
algorithm allows any node in the system to locate the storage node for an arbitrary key. This enables nodes to
put and get files based on their key, thereby supporting a hash-table-like interface and it uses the GPSR
geographic routing algorithm as the underlying routing system.
In [2], an energy efficient computing for wildlife tracking is discussed with Zebranet. In this they place
sensors on zebras to collect valuable zoology data. In under water sensor network [3], mobile nodes are robots
that collect data from regions of interest. Several projects target specifically at vehicular sensing. CarTel [4], for
example, is a comprehensive distributed mobile computing system used to collect, process, and visualize data
from sensors located on mobile units. It aims at exploring in-network computing on individual mobile units, as
we do, but it does not use intervehicle communication, which in our project, is a main focus to enable
distributed aggregation of sensor readings from multiple cars. Another vehicular sensor network:
In vehicular delay tolerant networks Maxprop [5] is proposed, for the delivery of messages in delay
tolerant networks. It is a protocol for the effective routing of DTN messages. It is based on prioritizing both the
packets to be schedule for forwarding and dropping. It works based on the history of event like previous
intermediaries, head-start, and acknowledgements. In [6], mobile hosts actively modify their trajectories to
transmit messages. We develop algorithms that minimize the trajectory modifications under two different
assumptions: (a) the movements of all the nodes in the system are known and (b) the movements of the hosts in
the system are not known.
In carnet [8], it places radio nodes in the cars which communicate with grid. It uses a novel scalable
routing system for the delivery of messages. Geographic routing uses geographic forwarding and scalable
distributed location service to route packets from car to car without flooding the network. Both [7,8] transmit
messages to a predefined geographical region. They are suitable for location-based services such as positionbased advertising and publish-and-subscribe.
Repeated geocasts or time stable geocasts [10] could also be used to maintain Geocache in a certain
area and bear similarities to our baseline scheme. It is different in concept though in that it requires the
definition of a geographic region, which is not needed in our case. Most geocast schemes concentrate on routing
messages to the areas of interest, or distributing messages to all nodes [9], [11], while Geocache is established
close to the anchor location and needs only be known to very few nodes. Further, time-stable geocasts
continuously remain in the region of interest, while Geocache can travel away from the anchor location.
In [12], it mentions some trajectory concepts, but it fails to take into account the peculiarities of
vehicular networks and still only forwards data to a node that is physically closer to the destination. Geopps
[13], [14] are maybe the most similar works to ours; however, it requires each mobile node to have full topology
information which is not feasible in realistic scenario.
The Boomerang [15], has proposed a new technique to tying data to the geographic location, which
uses neighbor nodes for the maintenance of data. The node selection is based on the direction and distance from
anchor node. Whenever a carrier moves away from anchor node it sends back the Geocache to the anchor node.
This challenges the network conditions like node failure, because the data has to be route back to the anchor
node. The routing of packets of Geocache data introduces the traffic in the network and there is no solution
specified for the maintenance of Geocache when there is a carrier failure, for the support of location based query
processing.
We propose a solution for the identified problem with the following methodology, to support the
maintenance of Geocache even at natural disaster, carrier failures in order to execute the location based queries.
The proposed system contains the following components named Hook- the location of interest and the Carrierthe mobile node which keeps the data of Geocache and travelling nodes.
www.theijes.com
The IJES
Page 7
3. A Light Weight Multi-Copy Geocache Maintenance in Mobile Disconnected networks
III.
PROPOSED SYSTEM:
The proposed system maintains four numbers of carriers at four quarters of the perimeter of the
coverage of the Hook. It divides the coverage area into four quarters with each 90 degree and selects four
carriers at each part to maintain the Geocache.
The carrier sense for any update in the hook with a broadcast message in the network. Whenever it
moves away from the hook it broadcast a message in the network to handover the Geocache data. When it
receives reply for the handover message it analyses the replies. The selection of carrier is done by the previous
carrier using the location and direction and speed metrics. Based on the spatial and geometric metrics it
identifies a carrier which is moving towards the Hook. Each carrier is responsible for selection of its own next
coming carrier.
Fig1: shows the four quarters of hook with nodes with different direction at each.
The carrier is selected by a mobile vehicle based on the following metrics.
Number of forward vehicles (moving towards Hook).
Number of junctions present in available paths between vehicle and Hook.
The distance tolerant between vehicle and Hook.
Based on these metric a cumulative spatial closure factor is computed to select the next carrier to keep the
Geocache of the location of interest.
Fig2: architecture of the proposed system.
Multi-Copy Geocache maintenance:
In the multi copy Geocache maintenance algorithm, the hook maintains multiple copies of Geocache,
one at each quarter of the perimeter of coverage. It will select a carrier initially at each of its perimeter quarter
and stores the data in the node for initialization. At later stage when the vehicle moves out of hook then the
vehicle initializes the handover process with its neighbor to exchange the Geocache and selects a new carrier for
the cache what it has.
www.theijes.com
The IJES
Page 8
6. A Light Weight Multi-Copy Geocache Maintenance in Mobile Disconnected networks
CONCLUSION:
The proposed multi-copy Geocache methodology maintains the multiple copy of location information
around the location of interest. The maintenance of multiple copies reduces the failure of location based query
processing, because if a carrier failure occurs another copy of cache will be used for processing the query. This
increases the overall efficiency of the system. Keeping multi copy of cache also reduces the query processing
time and reduces the overall network overhead generated by data transfer between outgoing carrier to the hook.
REFERENCES:
[1]
[2]
[3]
[4]
S. Ratnasamy, B. Karp, L. Yin, F. Yu, D. Estrin, R. Govindan, and S. Shenker, “GHT: A Geographic Hash Table for Data Centric Storage,” Proc. First ACM Int’l Workshop Wireless Sensor Networks and Applications, pp. 78-87, 2002.
P. Juang, H. Oki, Y. Wang, M. Martonosi, L.S. Peh, and D.Rubenstein, “Energy-Efficient Computing for Wildlife Tracking:
Design Tradeoffs and Early Experiences with Zebranet,” ACM SIGOPS Operating Systems Rev., vol. 8, pp. 96-107, 2002.
I. Vasilescu, K. Kotay, and D. Rus, “Data Collection, Storage, and Retrieval with an Underwater Sensor Network,” Proc. Third
Int’l Conf. Embedded Networked Sensor Systems, pp. 154-165, 2004.
B. Hull, V. Bychkovsky, Y. Zhang, K. Chen, M. Goraczko, A. Miu, E. Shih, H. Balakrishnan, and S. Madden, “CarTel: A
Distributed Mobile Sensor Computing System,” Proc. Fourth Int’l Conf. Embedded Networked Sensor Systems, pp. 125-138, 2006.
[5]
[6]
[7]
[8]
[9]
[10]
[11]
[12]
[13]
[14]
[15]
[16]
[17]
[18]
[19]
J. Burgess, B. Gallagher, D. Jensen, and B. Levine, “Routing for Vehicle-Based Disruption-Tolerant Networks,” Proc. 25th
IEEE Int’l Conf. Computer Comm., pp. 1-11, 2006
Q. Li, D. Rus, M. Dunbabin, and P. Corke, “Sending Messages to Mobile Users in Disconnected Ad-Hoc Wireless Networks,”
Proc. Sixth Ann. Int’l Conf. Mobile Computing and Networking, pp. 44-55, 2000.
T. Small and Z.J. Haas, “The Shared Wireless Infostation Model: A New Ad Hoc Networking Paradigm (or Where There Is a
Whale, There Is a Way),” Proc. ACM MobiHoc, pp. 233-244, 2003.
R. Morris, J. Jannotti, F. Kaashoek, J. Li, and D. Decouto, “Carnet: A Scalable Ad Hoc Wireless Network System,” Proc. Ninth
ACM SIGOPS European Workshop, pp. 61-65, 2000.
Y.B. Ko and N.H. Vaidya, “Flooding-Based Geocasting Protocols for Mobile Ad Hoc Networks,” Mobile Networks and
Applications, vol. 7, pp. 471-480, 2002.
C. Maihofer, T. Leinmller, and E. Schoch, “Abiding Geocast: Time-Stable Geocast for Ad Hoc Networks,” Proc. Second ACM
Int’l Workshop Vehicular Ad Hoc Networks, pp. 20-29, 2005.
R. Morris, J. Jannotti, F. Kaashoek, J. Li, and D. Decouto, “Carnet: A Scalable Ad Hoc Wireless Network System,” Proc. Ninth
ACM SIGOPS European Workshop, pp. 61-65, 2000.
J. LeBrun, C.-N. Chuah, D. Ghosal, and M. Zhang, “Knowledge- Based Opportunistic Forwarding Invehicular Wireless Ad Hoc
Networks,” Proc. 61st IEEE Conf. Vehicular Technology, pp. 2289-2293, 2005.
I. Leontiadis and C. Mascolo, “GeOpps: Geographical Opportunistic Routing for Vehicular Networks,” Proc. IEEE Workshop
Autonomic and Opportunistic Comm., pp. 1-6, 2007.
I. Leontiadis and C. Mascolo, “Opportunistic Spatio-Temporal Dissemination System for Vehicular Networks,” Proc. First Int’l
MobiSys Workshop Mobile Opportunistic Networking, pp. 39-46, 2007.
Tingting Sun and Bin San, “The Boomerang Protocol: Tying Data to Geographic Locations in Mobile Disconnected Networks” ,
IEEE transactions on mobile computing, vol. 11, no. 7, july 2012.
U. Lee, E. Magistretti, B. Zhou, M. Gerla, P. Bellavista, and A. Corradi, “MobEyes: Smart Mobs for Urban Monitoring with a
Vehicular Sensor Network,” IEEE Wireless Comm., vol. 13, no. 5, pp. 52-57, Oct. 2006.
V. Park and M. S. Corson. A highly adaptive distributed algorithm for mobile wireless networks. In Proceedings of
INFOCOM’97, Kobe, Japan, April 1997.
C. E. Perkins and P. Bhagwat. Highly dynamic destination-sequenced distance-vector routing (dsdv) for mobile computers. In
Computer Communication review, volume 24, pages 234 –244, October 1994.
Elizabeth Royer and C-K. Toh. A review of current routing protocols for ad hoc mobile wireless networks. In IEEE Personal
Communication, volume 6, pages 46– 55, April 1999
www.theijes.com
The IJES
Page 11