The document proposes a cross-layer solution to optimize energy and delay in mobile ad hoc networks (MANETs). It involves calculating a unique identifier using a pairing function for fields in packet headers that remain unchanged between source-destination pairs, such as IP addresses and port numbers. This identifier replaces those repeated fields in secondary packets, reducing header overhead compared to standard protocols. The approach is built on the Ad hoc On-Demand Distance Vector (AODV) routing protocol and is called Optimized-AODV (O-AODV). Mathematical analysis shows O-AODV reduces average header overhead as the number of packets increases in a communication session. By exchanging information across layers, O-AODV aims to provide an optimized path with
Wireless Mesh Network rose as a promising innovation for providing quick and productive communication for which numerous algorithms have been proposed in networking infrastructure. For routing there are various performance parameters such as throughput, network congestion, resiliency, fairness, robustness, network jitter, delay, stability, optimality, simplicity, completeness etc. Robustness provides the capability to deal with all the failures that come across during the connection in the network to increase the network performance. In this paper we have studied and analyzed three algorithms namely on robustness parameter Resilient multicasting [2], Resilient Opportunistic Mesh Routing for Wireless Mesh Network (ROMER) [3], and Buffer Based Routing (BBR) [4], in Wireless Mesh Networks. Analysis through various parameters such as network congestion, network throughput and resiliency [5], shows network performance of BBR is better.
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.
AN EFFICIENT BANDWIDTH OPTIMIZATION AND MINIMIZING ENERGY CONSUMPTION UTILIZI...IJCNCJournal
The bandwidth utilization plays a vital role in a Wireless Sensor Network (WSN) that transmits data packets from source peer to perspective destination peer without any packet loss and time delay. In a conventional system, two main features cannot be satisfied concurrently such as low delay and high data
reliability and then the peer was transferred fewer data packets and it optimized with regular bandwidth rate. Moreover, the convention of bandwidth in network routers influences the quality of service (QoS). To overcome the above issues, an Efficient Reliability and Interval Discrepant Routing (ERIDR) algorithm is proposed to optimize bandwidth utilization on the router network with the help of bandwidth optimizer. The
bandwidth optimizer allocates required bandwidth for data transmission to each peer simultaneously to ensure the bandwidth efficiency. The proposed design is to optimize bandwidth utilization of every peer and increase data processing via higher bandwidth rate that reduces time delay and minimizes energy consumption. The proposed method establishes a high bandwidth rate router to transmit data concurrently from source peer to destination peer (peer-to-peer) without any packet loss by initializing host IP address for every peer. Based on Experimental evaluations, proposed methodology reduces 3.32 AD (Average Delay), 0.05 ET (Execution Time), 5.44 EC (Energy Consumption) and 0.28 BU (Bandwidth Utilization)
compared than existing methodologies.
Abstract: Energy consumption is one of the constraints in Wireless Sensor Networks (WSNs). The routing protocols are the hot areas to address quality-of-service (QoS) related issues viz. Energy consumption, network lifetime, network scalability and packet overhead. In existing system a hybrid optimization based PEGASIS-DSR optimized routing protocol (PDORP) is presented which used cache and directional transmission concept of both proactive and reactive routing protocols. The performance of PDORP has been evaluated and the results indicated that it performs better in most significant parameters. The performance of the existing method is checked when it is evaluated and validated with the nodes which are highly dynamic in nature based on the application requirement. The current system finds the trusted nodes in the case of only static environment. To overcome the issue the proposed system is applied for dynamic WSN’s with the location frequently being changed. The PDORP-LC is applied with local caching (LC) to acquire the location information so that the path learning can be dynamic without depending on the fixed location. The proposed work is performing in dynamic environment with the dynamic derivation of trusted nodes.
Keywords: local caching (LC), Wireless Sensor Networks (WSNs), PEGASIS-DSR optimized routing protocol (PDORP).
Title: Energy Efficient Optimal Paths Using PDORP-LC
Author: ADARSH KUMAR B, BIBIN CHRISTOPHER, ISSAC SAJAN, AJ DEEPA
ISSN 2350-1022
International Journal of Recent Research in Mathematics Computer Science and Information Technology
Paper Publications
Distributed Three Hop Routing Protocol for Enhancing Routing Process in WSNpaperpublications3
Abstract: For Hybrid wireless network there is need of efficient data routing protocol for improvement of network capability and scalability. By using Distributed Three Hop routing protocol (DTR), we improve capacity of Hybrid network and Reduce overhead. In early Two- Hop Transmission protocol is used for eliminate route maintenance and limited number of hop in routing for Hybrid Wireless Network but it only considers the node transmission within a single cell while DTR can Also deals with Inter-cell communication in real word. DTR is Top-quality from Other routing Protocol to analyses the hybrid wireless networks with the parametric quantity such as throughput, QoS, packet loss, overhead (due to traffic), channel quality, load balancing, routing delivery, scalability and power consumption. DTR also has a congestion control algorithm to avoid load congestion in base station in the case of unbalanced traffic distributions in networks. DTR makes significantly lower overhead by eliminating route monitoring and maintenance. To enhance the efficiency of routing protocol in wireless network Weight Based Data Assignment technique is used for data allocation in distributed routing protocol using the technique of least delay detection to maintain less data congestion in the network . for that DTR divides a message data stream into segments and transmits the segments in a distributed manner.
Keywords: Data Fragmentation, Responses Delay, Hybrid Wireless Network, Three of Routing Protocol, Fuzzy Logic.
Title: Distributed Three Hop Routing Protocol for Enhancing Routing Process in WSN
Author: Amruta A. Mandhare, Kashmira J. Mayekar, Sayali L. Khanekar, Sarika V.Bodake, Sayali S. Bale.
ISSN 2350-1022
International Journal of Recent Research in Mathematics Computer Science and Information Technology
Paper Publications
SECTOR TREE-BASED CLUSTERING FOR ENERGY EFFICIENT ROUTING PROTOCOL IN HETEROG...IJCNCJournal
One of the main challenges for researchers to build routing protocols is how to use energy efficiently to extend the lifespan of the whole wireless sensor networks (WSN) because sensor nodes have limited battery power resources. In this work, we propose a Sector Tree-Based clustering routing protocol (STB-EE) for Energy Efficiency to cope with this problem, where the entire network area is partitioned into dynamic sectors (clusters), which balance the number of alive nodes. The nodes in each sector only communicate with their nearest neighbour by constructing a minimum tree based on the Kruskal algorithm and using mixed distance from candidate node to base station (BS) and remaining energy of candidate nodes to determine which node will become the cluster head (CH) in each cluster? By calculating the duration of time in each round for suitability, STB-EE increases the number of data packets sent to the BS. Our simulation results show that the network lifespan using STB-EE can be improved by about 16% and 10% in comparison to power-efficient gathering in sensor information system (PEGASIS) and energy-efficient PEGASIS-based protocol (IEEPB), respectively.
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.
Maximizing network capacity and reliable transmission in mimo cooperative net...eSAT Journals
Abstract Network capacity is an important factor to measure the performance of a network. Cooperative networking is a phenomenon which helps network to have significant gains in terms of transmission reliability and network capacity. Cooperating networking has been applied to multi-hop ad hoc networks. However, the existing works have two limitations. They support only single antenna model and three node relay scheme. The reason behind this limitation due to lack of complete understands of optimal power allocation structure Multiple Input and Multiple Output (MIMO) cooperative networks. Recently Liu et al. studied structural properties with respect to MIMO cooperative networks in presence of node power constraints. Each power allocation at source follows corresponding MIMO structure so as to ensure optimal power allocation. They establish relationship between cooperative relay and pure relay to quantify performance gain. In this paper we did experiments on this concept. Our simulations reveal that the proposed system for cooperative network is able to achieve both transmission reliability and network capacity. Keywords –Cooperative networking, MIMO, optimal power allocation, transmission reliability
Wireless Mesh Network rose as a promising innovation for providing quick and productive communication for which numerous algorithms have been proposed in networking infrastructure. For routing there are various performance parameters such as throughput, network congestion, resiliency, fairness, robustness, network jitter, delay, stability, optimality, simplicity, completeness etc. Robustness provides the capability to deal with all the failures that come across during the connection in the network to increase the network performance. In this paper we have studied and analyzed three algorithms namely on robustness parameter Resilient multicasting [2], Resilient Opportunistic Mesh Routing for Wireless Mesh Network (ROMER) [3], and Buffer Based Routing (BBR) [4], in Wireless Mesh Networks. Analysis through various parameters such as network congestion, network throughput and resiliency [5], shows network performance of BBR is better.
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.
AN EFFICIENT BANDWIDTH OPTIMIZATION AND MINIMIZING ENERGY CONSUMPTION UTILIZI...IJCNCJournal
The bandwidth utilization plays a vital role in a Wireless Sensor Network (WSN) that transmits data packets from source peer to perspective destination peer without any packet loss and time delay. In a conventional system, two main features cannot be satisfied concurrently such as low delay and high data
reliability and then the peer was transferred fewer data packets and it optimized with regular bandwidth rate. Moreover, the convention of bandwidth in network routers influences the quality of service (QoS). To overcome the above issues, an Efficient Reliability and Interval Discrepant Routing (ERIDR) algorithm is proposed to optimize bandwidth utilization on the router network with the help of bandwidth optimizer. The
bandwidth optimizer allocates required bandwidth for data transmission to each peer simultaneously to ensure the bandwidth efficiency. The proposed design is to optimize bandwidth utilization of every peer and increase data processing via higher bandwidth rate that reduces time delay and minimizes energy consumption. The proposed method establishes a high bandwidth rate router to transmit data concurrently from source peer to destination peer (peer-to-peer) without any packet loss by initializing host IP address for every peer. Based on Experimental evaluations, proposed methodology reduces 3.32 AD (Average Delay), 0.05 ET (Execution Time), 5.44 EC (Energy Consumption) and 0.28 BU (Bandwidth Utilization)
compared than existing methodologies.
Abstract: Energy consumption is one of the constraints in Wireless Sensor Networks (WSNs). The routing protocols are the hot areas to address quality-of-service (QoS) related issues viz. Energy consumption, network lifetime, network scalability and packet overhead. In existing system a hybrid optimization based PEGASIS-DSR optimized routing protocol (PDORP) is presented which used cache and directional transmission concept of both proactive and reactive routing protocols. The performance of PDORP has been evaluated and the results indicated that it performs better in most significant parameters. The performance of the existing method is checked when it is evaluated and validated with the nodes which are highly dynamic in nature based on the application requirement. The current system finds the trusted nodes in the case of only static environment. To overcome the issue the proposed system is applied for dynamic WSN’s with the location frequently being changed. The PDORP-LC is applied with local caching (LC) to acquire the location information so that the path learning can be dynamic without depending on the fixed location. The proposed work is performing in dynamic environment with the dynamic derivation of trusted nodes.
Keywords: local caching (LC), Wireless Sensor Networks (WSNs), PEGASIS-DSR optimized routing protocol (PDORP).
Title: Energy Efficient Optimal Paths Using PDORP-LC
Author: ADARSH KUMAR B, BIBIN CHRISTOPHER, ISSAC SAJAN, AJ DEEPA
ISSN 2350-1022
International Journal of Recent Research in Mathematics Computer Science and Information Technology
Paper Publications
Distributed Three Hop Routing Protocol for Enhancing Routing Process in WSNpaperpublications3
Abstract: For Hybrid wireless network there is need of efficient data routing protocol for improvement of network capability and scalability. By using Distributed Three Hop routing protocol (DTR), we improve capacity of Hybrid network and Reduce overhead. In early Two- Hop Transmission protocol is used for eliminate route maintenance and limited number of hop in routing for Hybrid Wireless Network but it only considers the node transmission within a single cell while DTR can Also deals with Inter-cell communication in real word. DTR is Top-quality from Other routing Protocol to analyses the hybrid wireless networks with the parametric quantity such as throughput, QoS, packet loss, overhead (due to traffic), channel quality, load balancing, routing delivery, scalability and power consumption. DTR also has a congestion control algorithm to avoid load congestion in base station in the case of unbalanced traffic distributions in networks. DTR makes significantly lower overhead by eliminating route monitoring and maintenance. To enhance the efficiency of routing protocol in wireless network Weight Based Data Assignment technique is used for data allocation in distributed routing protocol using the technique of least delay detection to maintain less data congestion in the network . for that DTR divides a message data stream into segments and transmits the segments in a distributed manner.
Keywords: Data Fragmentation, Responses Delay, Hybrid Wireless Network, Three of Routing Protocol, Fuzzy Logic.
Title: Distributed Three Hop Routing Protocol for Enhancing Routing Process in WSN
Author: Amruta A. Mandhare, Kashmira J. Mayekar, Sayali L. Khanekar, Sarika V.Bodake, Sayali S. Bale.
ISSN 2350-1022
International Journal of Recent Research in Mathematics Computer Science and Information Technology
Paper Publications
SECTOR TREE-BASED CLUSTERING FOR ENERGY EFFICIENT ROUTING PROTOCOL IN HETEROG...IJCNCJournal
One of the main challenges for researchers to build routing protocols is how to use energy efficiently to extend the lifespan of the whole wireless sensor networks (WSN) because sensor nodes have limited battery power resources. In this work, we propose a Sector Tree-Based clustering routing protocol (STB-EE) for Energy Efficiency to cope with this problem, where the entire network area is partitioned into dynamic sectors (clusters), which balance the number of alive nodes. The nodes in each sector only communicate with their nearest neighbour by constructing a minimum tree based on the Kruskal algorithm and using mixed distance from candidate node to base station (BS) and remaining energy of candidate nodes to determine which node will become the cluster head (CH) in each cluster? By calculating the duration of time in each round for suitability, STB-EE increases the number of data packets sent to the BS. Our simulation results show that the network lifespan using STB-EE can be improved by about 16% and 10% in comparison to power-efficient gathering in sensor information system (PEGASIS) and energy-efficient PEGASIS-based protocol (IEEPB), respectively.
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.
Maximizing network capacity and reliable transmission in mimo cooperative net...eSAT Journals
Abstract Network capacity is an important factor to measure the performance of a network. Cooperative networking is a phenomenon which helps network to have significant gains in terms of transmission reliability and network capacity. Cooperating networking has been applied to multi-hop ad hoc networks. However, the existing works have two limitations. They support only single antenna model and three node relay scheme. The reason behind this limitation due to lack of complete understands of optimal power allocation structure Multiple Input and Multiple Output (MIMO) cooperative networks. Recently Liu et al. studied structural properties with respect to MIMO cooperative networks in presence of node power constraints. Each power allocation at source follows corresponding MIMO structure so as to ensure optimal power allocation. They establish relationship between cooperative relay and pure relay to quantify performance gain. In this paper we did experiments on this concept. Our simulations reveal that the proposed system for cooperative network is able to achieve both transmission reliability and network capacity. Keywords –Cooperative networking, MIMO, optimal power allocation, transmission reliability
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.
An Enhanced Inter-Domain Communication among MANETs through selected Gatewaysidescitation
In Mobile Ad-hoc Networks(MANETs), enabling
communication among different domains is becoming one of
the areas of research topics as Border Gateway Protocol (BGP)
is not adequate to support MANETs (Mobile Ad-hoc Networks).
BGP does not scale to mobile and topological environment
[14]. So there is a need to develop an efficient inter-domain
routing protocol for heterogeneous MANETs. This is to
improve the connectivity of the nodes present in different
domains. Gateways as special nodes must be used for Inter-
Domain communication which acts as bridge between domains
and they play a major role in route updation, protocol
translation and policy enforcement. Due to mobility of nodes,
gateway functionality must be assigned dynamically for nodes
as static assignment will not be effective. In this paper an
attempt has been made to select minimum number of
gateways. Nodes in different domains can communicate
through the selected gateways. Data transmission occurs
through minimum hops (minimum geographical distance) and
least load path.
Social-sine cosine algorithm-based cross layer resource allocation in wireles...IJECEIAES
Cross layer resource allocation in the wireless networks is approached traditionally either by communications networks or information theory. The major issue in networking is the allocation of limited resources from the users of network. In traditional layered network, the resource are allocated at medium access control (MAC) and the network layers uses the communication links in bit pipes for delivering the data at fixed rate with the occasional random errors. Hence, this paper presents the cross-layer resource allocation in wireless network based on the proposed social-sine cosine algorithm (SSCA). The proposed SSCA is designed by integrating social ski driver (SSD) and sine cosine algorithm (SCA). Also, for further refining the resource allocation scheme, the proposed SSCA uses the fitness based on energy and fairness in which max-min, hard-fairness, proportional fairness, mixed-bias and the maximum throughput is considered. Based on energy and fairness, the cross-layer optimization entity makes the decision on resource allocation to mitigate the sum rate of network. The performance of resource allocation based on proposed model is evaluated based on energy, throughput, and the fairness. The developed model achieves the maximal energy of 258213, maximal throughput of 3.703, and the maximal fairness of 0.868, respectively.
Vitality productivity Multipath Routing for Wireless Sensor Networks: A Genet...dbpublications
Abstract-The two factors included for deployment of any Wireless Sensor Network, those factors are efficient energy and fault tolerance. An efficient solution for fault tolerance is the Multipath routing in WSNs. Genetic Algorithm is based on the meta-heuristic search technique. Base station (BS) already prepared routing schedule in its routing table, all the nodes share it with the entire network. In proposed algorithm various parameters are used for efficient fitness function such as distance between sender and receiver nodes, distance between BS to hop node and on the number of hop to send data from next hop node to the BS. Simulation and evaluation are tested with various performance metrics in the proposed algorithm.
Optimal Configuration of Network Coding in Ad Hoc Networks1crore 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
AN ENTROPIC OPTIMIZATION TECHNIQUE IN HETEROGENEOUS GRID COMPUTING USING BION...ijcsit
The wide usage of the Internet and the availability of powerful computers and high-speed networks as low cost
commodity components have a deep impact on the way we use computers today, in such a way that
these technologies facilitated the usage of multi-owner and geographically distributed resources to address
large-scale problems in many areas such as science, engineering, and commerce. The new paradigm of
Grid computing has evolved from these researches on these topics. Performance and utilization of the grid
depends on a complex and excessively dynamic procedure of optimally balancing the load among the
available nodes. In this paper, we suggest a novel two-dimensional figure of merit that depict the network
effects on load balance and fault tolerance estimation to improve the performance of the network
utilizations. The enhancement of fault tolerance is obtained by adaptively decrease replication time and
message cost. On the other hand, load balance is improved by adaptively decrease mean job response time.
Finally, analysis of Genetic Algorithm, Ant Colony Optimization, and Particle Swarm Optimization is
conducted with regards to their solutions, issues and improvements concerning load balancing in
computational grid. Consequently, a significant system utilization improvement was attained. Experimental
results eventually demonstrate that the proposed method's performance surpasses other methods.
Fuzzy Optimized Metric for Adaptive Network RoutingCSCJournals
Network routing algorithms used today calculate least cost (shortest) paths between nodes. The cost of a path is the sum of the cost of all links on that path. The use of a single metric for adaptive routing is insufficient to reflect the actual state of the link. In general, there is a limitation on the accuracy of the link state information obtained by the routing protocol. Hence it becomes useful if two or more metrics can be associated to produce a single metric that can describe the state of the link more accurately. In this paper, a fuzzy inference rule base is implemented to generate the fuzzy cost of each candidate path to be used in routing the incoming calls. This fuzzy cost is based on the crisp values of the different metrics; a fuzzy membership function is defined. The parameters of these membership functions reflect dynamically the requirement of the incoming traffic service as well as the current state of the links in the path. And this paper investigates how three metrics, the mean link bandwidth, queue utilization and the mean link delay, can be related using a simple fuzzy logic algorithm to produce a optimized cost of the link for a certain interval that is more „precise‟ than either of the single metric, to solve routing problem .
Dear Student,
DREAMWEB TECHNO SOLUTIONS is one of the Hardware Training and Software Development centre available in
Trichy. Pioneer in corporate training, DREAMWEB TECHNO SOLUTIONS provides training in all software
development and IT-related courses, such as Embedded Systems, VLSI, MATLAB, JAVA, J2EE, CIVIL,
Power Electronics, and Power Systems. It’s certified and experienced faculty members have the
competence to train students, provide consultancy to organizations, and develop strategic
solutions for clients by integrating existing and emerging technologies.
ADD: No:73/5, 3rd Floor, Sri Kamatchi Complex, Opp City Hospital, Salai Road, Trichy-18
Contact @ 7200021403/04
phone: 0431-4050403
Vehicular ad hoc networks (VANETs) have seen tremendous growth in the last decade, providing a vast
range of applications in both military and civilian activities. The temporary connectivity in the vehicles can also
increase the driver’s capability on the road. However, such applications require heavy data packets to be shared on
the same spectrum without the requirement of excessive radios. Thus, e-client approaches are required which can
provide improved data dissemination along with the better quality of services to allow heavy traffic to be easily
shared between the vehicles. In this paper, an e-client data dissemination approach is proposed which not only
improves the vehicle to vehicle connectivity but also improves the QoS between the source and the destination. The
proposed approach is analyzed and compared with the existing state-of-the-art approaches. The effectiveness of the
proposed approach is demonstrated in terms of the significant gains attained in the parameters namely, end to end
delay, packet delivery ratio, route acquisition time, throughput, and message dissemination rate in comparison with
the existing approaches.
Data aggregation in wireless sensor network based on dynamic fuzzy clusteringcsandit
Wireless Sensor Networks (WSN) use a plurality of s
ensor nodes that unceasingly collected and
sent data from a specific area to a base station. C
luster based data aggregation is one of the
popular protocols in WSN. Clustering is an importan
t procedure for extending the network
lifetime in WSNs. Cluster Heads (CH) aggregate data
from relevant cluster nodes and send it to
the base station. A main challenge in WSNs is to se
lect suitable CHs. In another communication
protocol based on a tree construction, energy consu
mption is low because there are short paths
between the sensors. In this paper, we propose Dyna
mic Fuzzy Clustering (DFC) data
aggregation. The proposed method first uses fuzzy d
ecision making approach for the selection
of CHs and then a minimum spanning tree is construc
ted based on CHs. CHs are selected
efficiently and accurately. The combining clusterin
g and tree structure is reclaiming the
advantages of the previous structures. Our method i
s compared to Low Energy Adaptive
Clustering Hierarchy (LEACH), Cluster and Tree Dara
Aggregation (CTDA), Modified Cluster
based and Tree based Data Aggregation (MCTDA) and C
luster based and Tree based Power
Efficient Data Collection and Aggregation (CTPEDCA)
.Our method decreases energy
consumption of each node. In DFC data aggregation,
the node lifetime is increased and the
survival of the WSN is improved.
A Comprehensive Study on Vehicular Ad-Hoc Delay Tolerant Networking for Infra...inventionjournals
Generally, traditional networks presume the presence of some path between endpoints. Today, however, new applications, environments and types of devices are challenging these assumptions. In Delay Tolerant Networks (DTNs), an end-to-end path from source to destination may not exist. Nodes may connect and exchange their information in an opportunistic way. This book represents a broad overview of DTNs, particularly focusing on Vehicular Ad-hoc DTNs, their main characteristics, challenges and our research on this field. In the near future, cars are expected to be equipped with devices that will allow them to communicate wirelessly i.e. Wi-Fi. However, there will be strict restrictions to the duration of their connections with other vehicles, whereas the conditions of their links will greatly vary; DTNs as well as Ad-hoc DTNs present an attractive solution. Therefore, Vehicular Ad-hoc DTNs constitute an attractive research field. For practical implementation, we have used two Android devices for a little range of Wi-Fi. So, by this we are trying to give us better accuracy to go further. Thorough out this document, we have mentioned those techniques we came across and also those techniques and algorithms that we used in our proposed method.
DYNAMIC TASK SCHEDULING BASED ON BURST TIME REQUIREMENT FOR CLOUD ENVIRONMENTIJCNCJournal
Cloud computing has an indispensable role in the modern digital scenario. The fundamental challenge of cloud systems is to accommodate user requirements which keep on varying. This dynamic cloud environment demands the necessity of complex algorithms to resolve the trouble of task allotment. The overall performance of cloud systems is rooted in the efficiency of task scheduling algorithms. The dynamic property of cloud systems makes it challenging to find an optimal solution satisfying all the evaluation metrics. The new approach is formulated on the Round Robin and the Shortest Job First algorithms. The Round Robin method reduces starvation, and the Shortest Job First decreases the average waiting time. In this work, the advantages of both algorithms are incorporated to improve the makespan of user tasks.
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 Modified Diagonal Mesh Shuffle Exchange Interconnection Network IJECEIAES
Interconnection network is an important part of the digital system. The interconnection mainly describes the topology of the network along with the routing algorithm and flow control mechanism. The topology of the network plays an important role on the performance of the system. Mesh interconnection network was the simplest topology, but has the limited bisection bandwidth on the other hand torus and diagonal mesh was having long links. The Modified diagonal mesh network tried to replace the torodial links but was having more average path length so in proposed topology we have tried to improve the average distance using shuffle exchange network over the boundary node. In this paper, we propose the architecture of Modified Diagonal Mesh Shuffle Exchange Interconnection Network. This Modified Diagonal Mesh Shuffle Exchange Interconnection network have been compared with four popular topologies that are simple 2D Mesh, 2D Torus, Diagonal Mesh and Modified Diagonal Mesh Interconnection Network on the four traffic patterns such as Bit Complement traffic, Neighbor traffic, Tornado traffic and Uniform traffic are used for comparisonand performance analysis. We have performed the analysis with a 5% and 10% of hotspot on the Uniform Traffic. The simulation results shows that the proposed topology is performed better on bit complement traffic and can also handle the other traffic up to certain level.
MULTICASTING BASED ENHANCED PROACTIVE SOURCE ROUTING IN MANETSIJCNCJournal
Mobile Ad-hoc Network (MANET) is an accumulation of movable nodes organizing a irregular topology without centralized administration. In a MANET, multicasting is a significant technique for utilizing data communication system. Multicasting based enhanced proactive source routing is proposed in this paper for Mobile Ad hoc Networks. It explains an innovative multicasting algorithm that considers the transmission energy and residual energy while forwarding the data packets. It improves the network throughput and raises the network lifetimes. Simulation analysis is carried in this proposed system and this method shows improved performance over the existing system.
Multicast routing strategy for SDN-cluster based MANET IJECEIAES
The energy limitation and frequent movement of the mobile Ad hoc network (MANET) nodes (i.e., devices) make the routing process very difficult. The multicast routing problem is one of the NP-complete problems. Therefore, the need for a new power-aware approach to select an optimum multicast path with minimum power consumption that can enhance the performance and increase the lifetime of MANET has become urgent. Software defined network (SDN) is a new technique that can solve many problems of the traditional networks by dividing the architecture into data part and control part. This paper presents three power-aware multicast routing strategies for MANET. First one called a Reactive Multicast routing strategy for Cluster based MANET by using SDN (RMCMS), second one called Proactive Multicast routing strategy for Cluster based MANET by using SDN (PMCMS) and third one represents Modification of PMCMS called M-PMCMS. Moreover, it produces a new mathematical model to build a multicast tree with minimum power consumption and takes into account the remaining power in each node. All proposed multicast strategies operate based on this mathematical model and aim to maximize the MANET lifetime by exploiting the advantages of SDN and clustering concepts. They consider the multicast tree with minimum power consumption as an optimal one. The simulation results illustrated that RMCMS is better than PMCMS, M-PMCMS, and MAODV in terms of power consumption and network overhead while M-PMCMS is the best one in terms of dropped packets ratio (DPR) and average end to end (E2E) delay.
Energy-aware strategy for data forwarding in IoT ecosystem IJECEIAES
The Internet of Things (IoT) is looming technology rapidly attracting many industries and drawing research attention. Although the scale of IoT-applications is very large, the capabilities of the IoT-devices are limited, especially in terms of energy. However, various research works have been done to alleviate these shortcomings, but the schemes introduced in the literature are complex and difficult to implement in practical scenarios. Therefore, considering the energy consumption of heterogeneous nodes in IoT eco-system, a simple energy-efficient routing technique is proposed. The proposed system has also employed an SDN controller that acts as a centralized manager to control and monitor network services, there by restricting the access of selfish nodes to the network. The proposed system constructs an analytical algorithm that provides reliable data transmission operations and controls energy consumption using a strategic mechanism where the path selection process is performed based on the remaining energy of adjacent nodes located in the direction of the destination node. The proposed energy-efficient data forwarding mechanism is compared with the existing AODV routing technique. The simulation result demonstrates that the protocol is superior to AODV in terms of packet delivery rate, throughput, and end-to-end delay.
Extended Bandwidth Optimized and Energy Efficient Dynamic Source Routing Prot...IJECEIAES
With the increase in the evolution of wireless communication, the ad-hoc networks are gaining attention and are significantly becoming the technology solutions to the various problems. Mobile ad-hoc Networks (MANETs) are envisaged to grow as a main component in the today 4G architecture, and ad hoc networks are projected to be a significant element of the whole future wireless communication. The MANETs are infrastructure less, self-forming and self-organizing network in which there is no control of any centralized entity. The nodes are free to move around the network with dynamic topology. But this self formation, flexibility and scalability create many challenges and design constraints like hidden terminal, limited bandwidth, limited energy of a node, unpredictable change in the topology etc. Bandwidth and energy are the scarce resources of the network. In order to effectively manage the consumption of bandwidth and energy, an algorithm is proposed which is the extension of traditional Dynamic Source Routing (DSR) reactive routing protocol. The extended protocol applies the mobile agents to carry the data. The proposed work is intended to optimize the bandwidth and making the protocol energy efficient.
The maximization of a networks lifetime is an important part of research in the present scenario. In ad hoc network, the topology of network changes frequently due to the mobility of mobile nodes where the communication is possible without any network infrastructure. Mobile nodes have limited energy resources so that the energy efficient routing should be provided which increases the life time of the network. The existing routing mechanisms do not consider energy of nodes for data transmission. In this paper a novel approach is analyzed to improve the networks lifetime where the data transfer is based on the minimum hop count and residual energy of the mobile nodes. The analysis is carried out by using the network simulator and the simulation results shows that the proposed work provides an energy efficient routing in ad hoc networks.
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.
An Enhanced Inter-Domain Communication among MANETs through selected Gatewaysidescitation
In Mobile Ad-hoc Networks(MANETs), enabling
communication among different domains is becoming one of
the areas of research topics as Border Gateway Protocol (BGP)
is not adequate to support MANETs (Mobile Ad-hoc Networks).
BGP does not scale to mobile and topological environment
[14]. So there is a need to develop an efficient inter-domain
routing protocol for heterogeneous MANETs. This is to
improve the connectivity of the nodes present in different
domains. Gateways as special nodes must be used for Inter-
Domain communication which acts as bridge between domains
and they play a major role in route updation, protocol
translation and policy enforcement. Due to mobility of nodes,
gateway functionality must be assigned dynamically for nodes
as static assignment will not be effective. In this paper an
attempt has been made to select minimum number of
gateways. Nodes in different domains can communicate
through the selected gateways. Data transmission occurs
through minimum hops (minimum geographical distance) and
least load path.
Social-sine cosine algorithm-based cross layer resource allocation in wireles...IJECEIAES
Cross layer resource allocation in the wireless networks is approached traditionally either by communications networks or information theory. The major issue in networking is the allocation of limited resources from the users of network. In traditional layered network, the resource are allocated at medium access control (MAC) and the network layers uses the communication links in bit pipes for delivering the data at fixed rate with the occasional random errors. Hence, this paper presents the cross-layer resource allocation in wireless network based on the proposed social-sine cosine algorithm (SSCA). The proposed SSCA is designed by integrating social ski driver (SSD) and sine cosine algorithm (SCA). Also, for further refining the resource allocation scheme, the proposed SSCA uses the fitness based on energy and fairness in which max-min, hard-fairness, proportional fairness, mixed-bias and the maximum throughput is considered. Based on energy and fairness, the cross-layer optimization entity makes the decision on resource allocation to mitigate the sum rate of network. The performance of resource allocation based on proposed model is evaluated based on energy, throughput, and the fairness. The developed model achieves the maximal energy of 258213, maximal throughput of 3.703, and the maximal fairness of 0.868, respectively.
Vitality productivity Multipath Routing for Wireless Sensor Networks: A Genet...dbpublications
Abstract-The two factors included for deployment of any Wireless Sensor Network, those factors are efficient energy and fault tolerance. An efficient solution for fault tolerance is the Multipath routing in WSNs. Genetic Algorithm is based on the meta-heuristic search technique. Base station (BS) already prepared routing schedule in its routing table, all the nodes share it with the entire network. In proposed algorithm various parameters are used for efficient fitness function such as distance between sender and receiver nodes, distance between BS to hop node and on the number of hop to send data from next hop node to the BS. Simulation and evaluation are tested with various performance metrics in the proposed algorithm.
Optimal Configuration of Network Coding in Ad Hoc Networks1crore 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
AN ENTROPIC OPTIMIZATION TECHNIQUE IN HETEROGENEOUS GRID COMPUTING USING BION...ijcsit
The wide usage of the Internet and the availability of powerful computers and high-speed networks as low cost
commodity components have a deep impact on the way we use computers today, in such a way that
these technologies facilitated the usage of multi-owner and geographically distributed resources to address
large-scale problems in many areas such as science, engineering, and commerce. The new paradigm of
Grid computing has evolved from these researches on these topics. Performance and utilization of the grid
depends on a complex and excessively dynamic procedure of optimally balancing the load among the
available nodes. In this paper, we suggest a novel two-dimensional figure of merit that depict the network
effects on load balance and fault tolerance estimation to improve the performance of the network
utilizations. The enhancement of fault tolerance is obtained by adaptively decrease replication time and
message cost. On the other hand, load balance is improved by adaptively decrease mean job response time.
Finally, analysis of Genetic Algorithm, Ant Colony Optimization, and Particle Swarm Optimization is
conducted with regards to their solutions, issues and improvements concerning load balancing in
computational grid. Consequently, a significant system utilization improvement was attained. Experimental
results eventually demonstrate that the proposed method's performance surpasses other methods.
Fuzzy Optimized Metric for Adaptive Network RoutingCSCJournals
Network routing algorithms used today calculate least cost (shortest) paths between nodes. The cost of a path is the sum of the cost of all links on that path. The use of a single metric for adaptive routing is insufficient to reflect the actual state of the link. In general, there is a limitation on the accuracy of the link state information obtained by the routing protocol. Hence it becomes useful if two or more metrics can be associated to produce a single metric that can describe the state of the link more accurately. In this paper, a fuzzy inference rule base is implemented to generate the fuzzy cost of each candidate path to be used in routing the incoming calls. This fuzzy cost is based on the crisp values of the different metrics; a fuzzy membership function is defined. The parameters of these membership functions reflect dynamically the requirement of the incoming traffic service as well as the current state of the links in the path. And this paper investigates how three metrics, the mean link bandwidth, queue utilization and the mean link delay, can be related using a simple fuzzy logic algorithm to produce a optimized cost of the link for a certain interval that is more „precise‟ than either of the single metric, to solve routing problem .
Dear Student,
DREAMWEB TECHNO SOLUTIONS is one of the Hardware Training and Software Development centre available in
Trichy. Pioneer in corporate training, DREAMWEB TECHNO SOLUTIONS provides training in all software
development and IT-related courses, such as Embedded Systems, VLSI, MATLAB, JAVA, J2EE, CIVIL,
Power Electronics, and Power Systems. It’s certified and experienced faculty members have the
competence to train students, provide consultancy to organizations, and develop strategic
solutions for clients by integrating existing and emerging technologies.
ADD: No:73/5, 3rd Floor, Sri Kamatchi Complex, Opp City Hospital, Salai Road, Trichy-18
Contact @ 7200021403/04
phone: 0431-4050403
Vehicular ad hoc networks (VANETs) have seen tremendous growth in the last decade, providing a vast
range of applications in both military and civilian activities. The temporary connectivity in the vehicles can also
increase the driver’s capability on the road. However, such applications require heavy data packets to be shared on
the same spectrum without the requirement of excessive radios. Thus, e-client approaches are required which can
provide improved data dissemination along with the better quality of services to allow heavy traffic to be easily
shared between the vehicles. In this paper, an e-client data dissemination approach is proposed which not only
improves the vehicle to vehicle connectivity but also improves the QoS between the source and the destination. The
proposed approach is analyzed and compared with the existing state-of-the-art approaches. The effectiveness of the
proposed approach is demonstrated in terms of the significant gains attained in the parameters namely, end to end
delay, packet delivery ratio, route acquisition time, throughput, and message dissemination rate in comparison with
the existing approaches.
Data aggregation in wireless sensor network based on dynamic fuzzy clusteringcsandit
Wireless Sensor Networks (WSN) use a plurality of s
ensor nodes that unceasingly collected and
sent data from a specific area to a base station. C
luster based data aggregation is one of the
popular protocols in WSN. Clustering is an importan
t procedure for extending the network
lifetime in WSNs. Cluster Heads (CH) aggregate data
from relevant cluster nodes and send it to
the base station. A main challenge in WSNs is to se
lect suitable CHs. In another communication
protocol based on a tree construction, energy consu
mption is low because there are short paths
between the sensors. In this paper, we propose Dyna
mic Fuzzy Clustering (DFC) data
aggregation. The proposed method first uses fuzzy d
ecision making approach for the selection
of CHs and then a minimum spanning tree is construc
ted based on CHs. CHs are selected
efficiently and accurately. The combining clusterin
g and tree structure is reclaiming the
advantages of the previous structures. Our method i
s compared to Low Energy Adaptive
Clustering Hierarchy (LEACH), Cluster and Tree Dara
Aggregation (CTDA), Modified Cluster
based and Tree based Data Aggregation (MCTDA) and C
luster based and Tree based Power
Efficient Data Collection and Aggregation (CTPEDCA)
.Our method decreases energy
consumption of each node. In DFC data aggregation,
the node lifetime is increased and the
survival of the WSN is improved.
A Comprehensive Study on Vehicular Ad-Hoc Delay Tolerant Networking for Infra...inventionjournals
Generally, traditional networks presume the presence of some path between endpoints. Today, however, new applications, environments and types of devices are challenging these assumptions. In Delay Tolerant Networks (DTNs), an end-to-end path from source to destination may not exist. Nodes may connect and exchange their information in an opportunistic way. This book represents a broad overview of DTNs, particularly focusing on Vehicular Ad-hoc DTNs, their main characteristics, challenges and our research on this field. In the near future, cars are expected to be equipped with devices that will allow them to communicate wirelessly i.e. Wi-Fi. However, there will be strict restrictions to the duration of their connections with other vehicles, whereas the conditions of their links will greatly vary; DTNs as well as Ad-hoc DTNs present an attractive solution. Therefore, Vehicular Ad-hoc DTNs constitute an attractive research field. For practical implementation, we have used two Android devices for a little range of Wi-Fi. So, by this we are trying to give us better accuracy to go further. Thorough out this document, we have mentioned those techniques we came across and also those techniques and algorithms that we used in our proposed method.
DYNAMIC TASK SCHEDULING BASED ON BURST TIME REQUIREMENT FOR CLOUD ENVIRONMENTIJCNCJournal
Cloud computing has an indispensable role in the modern digital scenario. The fundamental challenge of cloud systems is to accommodate user requirements which keep on varying. This dynamic cloud environment demands the necessity of complex algorithms to resolve the trouble of task allotment. The overall performance of cloud systems is rooted in the efficiency of task scheduling algorithms. The dynamic property of cloud systems makes it challenging to find an optimal solution satisfying all the evaluation metrics. The new approach is formulated on the Round Robin and the Shortest Job First algorithms. The Round Robin method reduces starvation, and the Shortest Job First decreases the average waiting time. In this work, the advantages of both algorithms are incorporated to improve the makespan of user tasks.
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 Modified Diagonal Mesh Shuffle Exchange Interconnection Network IJECEIAES
Interconnection network is an important part of the digital system. The interconnection mainly describes the topology of the network along with the routing algorithm and flow control mechanism. The topology of the network plays an important role on the performance of the system. Mesh interconnection network was the simplest topology, but has the limited bisection bandwidth on the other hand torus and diagonal mesh was having long links. The Modified diagonal mesh network tried to replace the torodial links but was having more average path length so in proposed topology we have tried to improve the average distance using shuffle exchange network over the boundary node. In this paper, we propose the architecture of Modified Diagonal Mesh Shuffle Exchange Interconnection Network. This Modified Diagonal Mesh Shuffle Exchange Interconnection network have been compared with four popular topologies that are simple 2D Mesh, 2D Torus, Diagonal Mesh and Modified Diagonal Mesh Interconnection Network on the four traffic patterns such as Bit Complement traffic, Neighbor traffic, Tornado traffic and Uniform traffic are used for comparisonand performance analysis. We have performed the analysis with a 5% and 10% of hotspot on the Uniform Traffic. The simulation results shows that the proposed topology is performed better on bit complement traffic and can also handle the other traffic up to certain level.
MULTICASTING BASED ENHANCED PROACTIVE SOURCE ROUTING IN MANETSIJCNCJournal
Mobile Ad-hoc Network (MANET) is an accumulation of movable nodes organizing a irregular topology without centralized administration. In a MANET, multicasting is a significant technique for utilizing data communication system. Multicasting based enhanced proactive source routing is proposed in this paper for Mobile Ad hoc Networks. It explains an innovative multicasting algorithm that considers the transmission energy and residual energy while forwarding the data packets. It improves the network throughput and raises the network lifetimes. Simulation analysis is carried in this proposed system and this method shows improved performance over the existing system.
Multicast routing strategy for SDN-cluster based MANET IJECEIAES
The energy limitation and frequent movement of the mobile Ad hoc network (MANET) nodes (i.e., devices) make the routing process very difficult. The multicast routing problem is one of the NP-complete problems. Therefore, the need for a new power-aware approach to select an optimum multicast path with minimum power consumption that can enhance the performance and increase the lifetime of MANET has become urgent. Software defined network (SDN) is a new technique that can solve many problems of the traditional networks by dividing the architecture into data part and control part. This paper presents three power-aware multicast routing strategies for MANET. First one called a Reactive Multicast routing strategy for Cluster based MANET by using SDN (RMCMS), second one called Proactive Multicast routing strategy for Cluster based MANET by using SDN (PMCMS) and third one represents Modification of PMCMS called M-PMCMS. Moreover, it produces a new mathematical model to build a multicast tree with minimum power consumption and takes into account the remaining power in each node. All proposed multicast strategies operate based on this mathematical model and aim to maximize the MANET lifetime by exploiting the advantages of SDN and clustering concepts. They consider the multicast tree with minimum power consumption as an optimal one. The simulation results illustrated that RMCMS is better than PMCMS, M-PMCMS, and MAODV in terms of power consumption and network overhead while M-PMCMS is the best one in terms of dropped packets ratio (DPR) and average end to end (E2E) delay.
Energy-aware strategy for data forwarding in IoT ecosystem IJECEIAES
The Internet of Things (IoT) is looming technology rapidly attracting many industries and drawing research attention. Although the scale of IoT-applications is very large, the capabilities of the IoT-devices are limited, especially in terms of energy. However, various research works have been done to alleviate these shortcomings, but the schemes introduced in the literature are complex and difficult to implement in practical scenarios. Therefore, considering the energy consumption of heterogeneous nodes in IoT eco-system, a simple energy-efficient routing technique is proposed. The proposed system has also employed an SDN controller that acts as a centralized manager to control and monitor network services, there by restricting the access of selfish nodes to the network. The proposed system constructs an analytical algorithm that provides reliable data transmission operations and controls energy consumption using a strategic mechanism where the path selection process is performed based on the remaining energy of adjacent nodes located in the direction of the destination node. The proposed energy-efficient data forwarding mechanism is compared with the existing AODV routing technique. The simulation result demonstrates that the protocol is superior to AODV in terms of packet delivery rate, throughput, and end-to-end delay.
Extended Bandwidth Optimized and Energy Efficient Dynamic Source Routing Prot...IJECEIAES
With the increase in the evolution of wireless communication, the ad-hoc networks are gaining attention and are significantly becoming the technology solutions to the various problems. Mobile ad-hoc Networks (MANETs) are envisaged to grow as a main component in the today 4G architecture, and ad hoc networks are projected to be a significant element of the whole future wireless communication. The MANETs are infrastructure less, self-forming and self-organizing network in which there is no control of any centralized entity. The nodes are free to move around the network with dynamic topology. But this self formation, flexibility and scalability create many challenges and design constraints like hidden terminal, limited bandwidth, limited energy of a node, unpredictable change in the topology etc. Bandwidth and energy are the scarce resources of the network. In order to effectively manage the consumption of bandwidth and energy, an algorithm is proposed which is the extension of traditional Dynamic Source Routing (DSR) reactive routing protocol. The extended protocol applies the mobile agents to carry the data. The proposed work is intended to optimize the bandwidth and making the protocol energy efficient.
The maximization of a networks lifetime is an important part of research in the present scenario. In ad hoc network, the topology of network changes frequently due to the mobility of mobile nodes where the communication is possible without any network infrastructure. Mobile nodes have limited energy resources so that the energy efficient routing should be provided which increases the life time of the network. The existing routing mechanisms do not consider energy of nodes for data transmission. In this paper a novel approach is analyzed to improve the networks lifetime where the data transfer is based on the minimum hop count and residual energy of the mobile nodes. The analysis is carried out by using the network simulator and the simulation results shows that the proposed work provides an energy efficient routing in ad hoc networks.
A hybrid objective function with empirical stability aware to improve RPL for...IJECEIAES
The diverse applications of the internet of things (IoT) require adaptable routing pro- tocol able to cope with several constraints. Thus, RPL protocol was designed to meet the needs for IoT networks categorized as low power and lossy networks (LLN). RPL uses an objective function based on specific metrics for preferred parents selection through these packets are sent to root. The single routing metric issue generally doesn’t satisfy all routing performance requirements, whereas some are improved others are degraded. In that purpose, we propose a hybrid objective function with empirical stability aware (HOFESA), implemented in the network layer of the embedded operating system CONTIKI, which combines linearly three weighty metrics namely hop count, RSSI and node energy consumption. Also, To remedy to frequent preferred parents changes problems caused by taking into account more than one metric, our proposal relies on static and empirical thresholds. The designed HOFESA, evaluated under COOJA emulator against Standard-RPL and EC-OF, showed a packet delivery ratio improvement, a decrease in the power consumption, the convergence time and DIO control messages as well as it gives network stability through an adequate churn.
M-EPAR to Improve the Quality of the MANETsIJERA Editor
In MANET, power aware is important challenge issue to improve the communication energy efficiency at individual nodes. We propose modified efficient power aware routing (M-EPAR), a new power aware routing protocol that increases the network lifetime of MANET. Designing a power aware routing algorithm or technique is one of the most important point considered in Mobile Ad Hoc Networks. These nodes are driven by reactive protocols where broadcasting is mandatory to form a path between two nodes. So in case of death of the node resulting out of less battery calls for re-routing. Since many existing techniques focuses on energy aware routing this paper presents combination of energy aware routing merged with link quality determined by packet drop rate. The proposed scheme has outperformed the existing technique in terms of packet delivery ratio, throughput and energy consumption.
Comparative Analysis of Green Algorithm within Active Queue Management for Mo...ijtsrd
The Queue Management Techniques play an important role in improving the Quality of Service in Mobile Ad hoc Networks. The need of congestion control and Queue management is inevitable in Mobile Ad hoc Network. Understanding and analyzing the latest AQM Techniques give an insight to improving throughput, packet loss rate, average end to end delay and other parameters that severely affect the performance. The performance of mobile ad hoc networks is evaluated by varying the Channel Error Rate, Bandwidth and Delay at different fragment sizes of different traffic flows. The proposed method performs the network analysis of new Routing protocols. The work proposes to evaluate various Active Queue Management Techniques in a multi traffic environment i.e., sources generating both TCP and UDP traffic classes. The UDP is propagated via CBR and TCP is propagated via FTP. The implementation of the proposed queue management technique has been done in NS 2. In the proposed work we have make NS 2 compatible with GREEN by integrating source code into the ns 2 installation files and using various AQMs in comparison with GREEN to calculate the throughput at various Bandwidths across network. Using various AQMs in comparison with GREEN we have calculated the throughput at various Delays across the network and we have also calculated the throughput at various channels Error Rate across the network. The proposed method has been compared with other primitive AQM techniques so that a repository of best available results can be obtained for design and research purposes. The proposed method has outperformed the existing queue management techniques in number of scenarios. Zulai Khan | Rashmi Raj ""Comparative Analysis of Green Algorithm within Active Queue Management for Mobile Ad Hoc Network"" Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-3 | Issue-4 , June 2019, URL: https://www.ijtsrd.com/papers/ijtsrd23950.pdf
Paper URL: https://www.ijtsrd.com/engineering/electronics-and-communication-engineering/23950/comparative-analysis-of-green-algorithm-within-active-queue-management-for-mobile-ad-hoc-network/zulai-khan
A novel routing technique for mobile ad hoc networks (manet)ijngnjournal
Actual network size depends on the application and the protocols developed for the routing for this kind of
networks should be scalable and efficient. Each routing protocol should support small as well as large
scale networks very efficiently. As the number of node increase, it increases the management functionality
of the network. Graph theoretic approach traditionally was applied to networks where nodes are static or
fixed. In this paper, we have applied the graph theoretic routing to MANET where nodes are mobile. Here,
we designed all identical nodes in the cluster except the cluster head and this criterion reduces the
management burden on the network. Each cluster supports a few nodes with a cluster head. The intracluster
connectivity amongst the nodes within the cluster is supported by multi-hop connectivity to ensure
handling mobility in such a way that no service disruption can occur. The inter-cluster connectivity is also
achieved by multi-hop connectivity. However, for inter-cluster communications, only cluster heads are
connected. This paper demonstrates graph theoretic approach produces an optimum multi-hop connectivity
path based on cumulative minimum degree that minimizes the contention and scheduling delay end-toend.
It is applied to both intra-cluster communications as well as inter-cluster communications. The
performance shows that having a multi-hop connectivity for intra-cluster communications is more power
efficient compared to broadcast of information with maximum power coverage. We also showed the total
number of required intermediate nodes in the transmission from source to destination. However, dynamic
behavior of the nodes requires greater understanding of the node degree and mobility at each instance of
time in order to maintain end-to-end QoS for multi-service provisioning. Our simulation results show that
the proposed graph theoretic routing approach will reduce the overall delay and improves the physical
layer data frame transmission.
LOAD BALANCING AND ENERGY EFFICIENCY IN WSN BY CLUSTER JOINING METHODIAEME Publication
In any WSN life of network is depending on life of sensor node. Thus, proper load balancing is very useful for improving life of network. The tree-based routing protocols like GSTEB used dynamic tree structures for routing without any formation of collections. In cases of larger networks, the scheme is not always feasible. In this proposed work cluster-based routing method is used. Cluster head is selected such that it should be close to the base station and should have maximum residential energy than other nodes selected for cluster formation. Size of cluster is controlled by using location-based cluster joining method such that nodes selects their nearest collection head based on the signal strength from cluster head and distance between node and cluster head. Nodes connect to head having the highest signal strength and closest to the base station, this minimizes size of cluster and reduces extra energy consumption. In addition to this cluster formation process starts only after availability of data due to an event. So proposed protocol performs better than existing tree based protocols like GSTEB in terms of energy efficiency
LOAD BALANCING AND ENERGY EFFICIENCY IN WSN BY CLUSTER JOINING METHODIAEME Publication
In any WSN life of network is depending on life of sensor node. Thus, proper load balancing is very useful for improving life of network. The tree-based routing protocols like GSTEB used dynamic tree structures for routing without any formation of collections. In cases of larger networks, the scheme is not always feasible. In this proposed work cluster-based routing method is used. Cluster head is selected such that it should be close to the base station and should have maximum residential energy than other nodes selected for cluster formation. Size of cluster is controlled by using location-based cluster joining method such that nodes selects their nearest collection head based on the signal strength from cluster head and distance between node and cluster head. Nodes connect to head having the highest signal strength and closest to the base station, this minimizes size of cluster and reduces extra energy consumption. In addition to this cluster formation process starts only after availability of data due to an event. So proposed protocol performs better than existing tree based protocols like GSTEB in terms of energy efficiency
Energy Behavior in Ad Hoc Network Minimizing the Number of Hops and Maintaini...CSCJournals
Wireless ad-hoc mesh network is a special kind of network, where all of the nodes move in time. The topology of the network changes as the nodes are in the proximity of each other. Ad-hoc networks are generally self-configuring no stable infrastructure takes a place. In this network, each node should help relaying packets of neighboring nodes using multi-hop routing mechanism. This mechanism is needed to reach far destination nodes to solve problem of dead communication. This multiple traffic "hops" within a wireless mesh network caused dilemma. Wireless mesh network that contain multiple hops become increasingly vulnerable to problems such as energy degradation and rapid increasing of overhead packets. This paper provides a generic routing framework that balances energy efficient broadcast schemes in Wireless (Ad-Hoc) Mesh Network and maintaining connectivity of nodes (mobile terminals). Typically, each node’s activities will consume energy, either for sending packets, receiving or preparing/processing packets. Number of hops, distance of nodes, and size of packet will determine the consumption of energy. The framework is based on the principle that additional relay nodes with appropriate energy and routing metric between source and final destination significantly reduces the energy consumption necessary to deliver packets in Wireless (Ad-Hoc) Mesh Network while keep the connectivity of dynamic nodes. Using the framework, the average network connectivity is kept 18% higher and the lifetime of network lasting more than 2.38% compared with network with Link State Routing mechanism. The simulation notes that the end-to-end delay may increase rapidly if relay nodes are more than five.
Developing QoS by Priority Routing for Real Time Data in Internet of Things (...IJCNCJournal
In networks, many application protocols such as CoAP, REST, XMPP ,AMQP have been proposed for IoT communication which includes p2p or S2S. In MANET Network convergence does the way for improvements in Internet of Things (IoT) communication with high potential for a wide range of applications. Each protocol focuses on some aspects of communication in the IoT. Hence, these application protocols have indicated of how IoT has integrated to enhanced and developed of a new service that require to guarantees
the wide range offered by the quality of services. In this paper, we will introduce a smart pathway that can be bridge the gap between IoT services with its real data traffic. Therefore, we enhanced the MANET routing protocol for computing two or more paths to pass the more that one high priority real traffic data via these paths to improve the gloomy picture of this protocol in the context of IoT. In particular, the good services
with high timely delivery of urgent data such as real time data environmental monitoring. After surveying the published and available protocol interoperability given for urban sensing. In this research, we have proposed a novel solution to integrate MANET overlays, and collaboratively formed over MANET, to boost urban data in IoT. Overlays are used to dynamic differentiate and fasten the delivery of high priority real application time data over low-latency MANET paths by integrating with the original specifications. Our experimental results showed the effectiveness on the network such as the overhead and network congestion. In addition, the initial
results of the light-weight improved the routing protocol over the baseline protocols in terms of the delay of reciveing the packets between nodes which lead to increase the throughput by reducing loss packets.
In this paper we discuss about how to increase the reliability, energy-efficiency in a wireless sensor network. Since energy saving has become the top factor on demand due to the increasing multimedia services in mobile devices. The existing batteries unfortunately do not provide the desirable lifetime. Therefore reducing energy consumption has become very crucial factor in all the tasks the mobile devices perform. This work presents an Opportunistic Routing Protocol, which supports energy consumption by increasing the networks performance and also providing reliability to the wireless sensor networks.
Analysing Mobile Random Early Detection for Congestion Control in Mobile Ad-h...IJECEIAES
This research paper suggests and analyse a technique for congestion control in mobile ad hoc networks. The technique is based on a new hybrid approach that uses clustering and queuing techniques. In clustering, in general cluster head transfers the data, following a queuing method based on a RED (Random Early Detection), the mobile environment makes it Mobile RED (or MRED), It majorly depends upon mobility of nodes and mobile environments leads to unpredictable queue size. To simulate this technique, the Network Simulator 2 (or NS2) is used for various scenarios. The simulated results are compared with NRED (Neighbourhood Random Early Detection) queuing technique of congestion control. It has been observed that the results are improved using MRED comparatively.
A RELIABLE AND ENERGY EFFICIENCT ROUTING PROTOCOL FOR MANETs cscpconf
A mobile ad-hoc network (MANETs) is an infrastructure less network in which the mobile nodes
communicate with each other. Due to its various characteristics like highly dynamic topology
and limited battery power of the nodes, routing is one of the key issue. Also, it is not possible to
give a significant amount of power to the mobile nodes of ad-hoc networks. Because of all this
the energy consumption is also an important issue. Due to limited battery power, some other
issues like if some node gets fail, which results in loss of data packets and no reliable data
transfer has been raised. In this paper, an algorithm is proposed for data transmission which
detects the node failure (due to energy) before it actually happens. Because of this network
lifetime gets improved. The proposed routing algorithm is energy efficient as compared to
AODV routing algorithm. The performance is analyzed on the basis of various performance
metrics like Energy Consumption, Packet Delivery Ratio, Network Life Time, Network Routing
Overhead and number of Exhausted nodes in the network by using the NS2 Simulator.
Enhancenig OLSR routing protocol using K-means clustering in MANETs IJECEIAES
The design of robust routing protocol schemes for MANETs is quite complex, due to the characteristics and structural constraints of this network. A numerous variety of protocol schemes have been proposed in literature. Most of them are based on traditional method of routing, which doesn’t guarantee basic levels of Qos, when the network becomes larger, denser and dynamic. To solve this problem we use one of the most popular methods named clustering. In this work we try to improve the Qos in MANETs. We propose an algorithm of clustering based in the new mobility metric and K-Means method to distribute the nodes into several clusters; it is implemented to standard OLSR protocol giving birth a new protocol named OLSR Kmeans-SDE. The simulations showed that the results obtained by OLSR Kmeans-SDE exceed those obtained by standard OLSR Kmeans and OLSR Kmed+ in terms of, traffic Control, delay and packet delivery ratio.
Similar to Cross Layer Solution for Energy and Delay Optimization in MANETs (20)
Bibliometric analysis highlighting the role of women in addressing climate ch...IJECEIAES
Fossil fuel consumption increased quickly, contributing to climate change
that is evident in unusual flooding and draughts, and global warming. Over
the past ten years, women's involvement in society has grown dramatically,
and they succeeded in playing a noticeable role in reducing climate change.
A bibliometric analysis of data from the last ten years has been carried out to
examine the role of women in addressing the climate change. The analysis's
findings discussed the relevant to the sustainable development goals (SDGs),
particularly SDG 7 and SDG 13. The results considered contributions made
by women in the various sectors while taking geographic dispersion into
account. The bibliometric analysis delves into topics including women's
leadership in environmental groups, their involvement in policymaking, their
contributions to sustainable development projects, and the influence of
gender diversity on attempts to mitigate climate change. This study's results
highlight how women have influenced policies and actions related to climate
change, point out areas of research deficiency and recommendations on how
to increase role of the women in addressing the climate change and
achieving sustainability. To achieve more successful results, this initiative
aims to highlight the significance of gender equality and encourage
inclusivity in climate change decision-making processes.
Voltage and frequency control of microgrid in presence of micro-turbine inter...IJECEIAES
The active and reactive load changes have a significant impact on voltage
and frequency. In this paper, in order to stabilize the microgrid (MG) against
load variations in islanding mode, the active and reactive power of all
distributed generators (DGs), including energy storage (battery), diesel
generator, and micro-turbine, are controlled. The micro-turbine generator is
connected to MG through a three-phase to three-phase matrix converter, and
the droop control method is applied for controlling the voltage and
frequency of MG. In addition, a method is introduced for voltage and
frequency control of micro-turbines in the transition state from gridconnected mode to islanding mode. A novel switching strategy of the matrix
converter is used for converting the high-frequency output voltage of the
micro-turbine to the grid-side frequency of the utility system. Moreover,
using the switching strategy, the low-order harmonics in the output current
and voltage are not produced, and consequently, the size of the output filter
would be reduced. In fact, the suggested control strategy is load-independent
and has no frequency conversion restrictions. The proposed approach for
voltage and frequency regulation demonstrates exceptional performance and
favorable response across various load alteration scenarios. The suggested
strategy is examined in several scenarios in the MG test systems, and the
simulation results are addressed.
Enhancing battery system identification: nonlinear autoregressive modeling fo...IJECEIAES
Precisely characterizing Li-ion batteries is essential for optimizing their
performance, enhancing safety, and prolonging their lifespan across various
applications, such as electric vehicles and renewable energy systems. This
article introduces an innovative nonlinear methodology for system
identification of a Li-ion battery, employing a nonlinear autoregressive with
exogenous inputs (NARX) model. The proposed approach integrates the
benefits of nonlinear modeling with the adaptability of the NARX structure,
facilitating a more comprehensive representation of the intricate
electrochemical processes within the battery. Experimental data collected
from a Li-ion battery operating under diverse scenarios are employed to
validate the effectiveness of the proposed methodology. The identified
NARX model exhibits superior accuracy in predicting the battery's behavior
compared to traditional linear models. This study underscores the
importance of accounting for nonlinearities in battery modeling, providing
insights into the intricate relationships between state-of-charge, voltage, and
current under dynamic conditions.
Smart grid deployment: from a bibliometric analysis to a surveyIJECEIAES
Smart grids are one of the last decades' innovations in electrical energy.
They bring relevant advantages compared to the traditional grid and
significant interest from the research community. Assessing the field's
evolution is essential to propose guidelines for facing new and future smart
grid challenges. In addition, knowing the main technologies involved in the
deployment of smart grids (SGs) is important to highlight possible
shortcomings that can be mitigated by developing new tools. This paper
contributes to the research trends mentioned above by focusing on two
objectives. First, a bibliometric analysis is presented to give an overview of
the current research level about smart grid deployment. Second, a survey of
the main technological approaches used for smart grid implementation and
their contributions are highlighted. To that effect, we searched the Web of
Science (WoS), and the Scopus databases. We obtained 5,663 documents
from WoS and 7,215 from Scopus on smart grid implementation or
deployment. With the extraction limitation in the Scopus database, 5,872 of
the 7,215 documents were extracted using a multi-step process. These two
datasets have been analyzed using a bibliometric tool called bibliometrix.
The main outputs are presented with some recommendations for future
research.
Use of analytical hierarchy process for selecting and prioritizing islanding ...IJECEIAES
One of the problems that are associated to power systems is islanding
condition, which must be rapidly and properly detected to prevent any
negative consequences on the system's protection, stability, and security.
This paper offers a thorough overview of several islanding detection
strategies, which are divided into two categories: classic approaches,
including local and remote approaches, and modern techniques, including
techniques based on signal processing and computational intelligence.
Additionally, each approach is compared and assessed based on several
factors, including implementation costs, non-detected zones, declining
power quality, and response times using the analytical hierarchy process
(AHP). The multi-criteria decision-making analysis shows that the overall
weight of passive methods (24.7%), active methods (7.8%), hybrid methods
(5.6%), remote methods (14.5%), signal processing-based methods (26.6%),
and computational intelligent-based methods (20.8%) based on the
comparison of all criteria together. Thus, it can be seen from the total weight
that hybrid approaches are the least suitable to be chosen, while signal
processing-based methods are the most appropriate islanding detection
method to be selected and implemented in power system with respect to the
aforementioned factors. Using Expert Choice software, the proposed
hierarchy model is studied and examined.
Enhancing of single-stage grid-connected photovoltaic system using fuzzy logi...IJECEIAES
The power generated by photovoltaic (PV) systems is influenced by
environmental factors. This variability hampers the control and utilization of
solar cells' peak output. In this study, a single-stage grid-connected PV
system is designed to enhance power quality. Our approach employs fuzzy
logic in the direct power control (DPC) of a three-phase voltage source
inverter (VSI), enabling seamless integration of the PV connected to the
grid. Additionally, a fuzzy logic-based maximum power point tracking
(MPPT) controller is adopted, which outperforms traditional methods like
incremental conductance (INC) in enhancing solar cell efficiency and
minimizing the response time. Moreover, the inverter's real-time active and
reactive power is directly managed to achieve a unity power factor (UPF).
The system's performance is assessed through MATLAB/Simulink
implementation, showing marked improvement over conventional methods,
particularly in steady-state and varying weather conditions. For solar
irradiances of 500 and 1,000 W/m2
, the results show that the proposed
method reduces the total harmonic distortion (THD) of the injected current
to the grid by approximately 46% and 38% compared to conventional
methods, respectively. Furthermore, we compare the simulation results with
IEEE standards to evaluate the system's grid compatibility.
Enhancing photovoltaic system maximum power point tracking with fuzzy logic-b...IJECEIAES
Photovoltaic systems have emerged as a promising energy resource that
caters to the future needs of society, owing to their renewable, inexhaustible,
and cost-free nature. The power output of these systems relies on solar cell
radiation and temperature. In order to mitigate the dependence on
atmospheric conditions and enhance power tracking, a conventional
approach has been improved by integrating various methods. To optimize
the generation of electricity from solar systems, the maximum power point
tracking (MPPT) technique is employed. To overcome limitations such as
steady-state voltage oscillations and improve transient response, two
traditional MPPT methods, namely fuzzy logic controller (FLC) and perturb
and observe (P&O), have been modified. This research paper aims to
simulate and validate the step size of the proposed modified P&O and FLC
techniques within the MPPT algorithm using MATLAB/Simulink for
efficient power tracking in photovoltaic systems.
Adaptive synchronous sliding control for a robot manipulator based on neural ...IJECEIAES
Robot manipulators have become important equipment in production lines, medical fields, and transportation. Improving the quality of trajectory tracking for
robot hands is always an attractive topic in the research community. This is a
challenging problem because robot manipulators are complex nonlinear systems
and are often subject to fluctuations in loads and external disturbances. This
article proposes an adaptive synchronous sliding control scheme to improve trajectory tracking performance for a robot manipulator. The proposed controller
ensures that the positions of the joints track the desired trajectory, synchronize
the errors, and significantly reduces chattering. First, the synchronous tracking
errors and synchronous sliding surfaces are presented. Second, the synchronous
tracking error dynamics are determined. Third, a robust adaptive control law is
designed,the unknown components of the model are estimated online by the neural network, and the parameters of the switching elements are selected by fuzzy
logic. The built algorithm ensures that the tracking and approximation errors
are ultimately uniformly bounded (UUB). Finally, the effectiveness of the constructed algorithm is demonstrated through simulation and experimental results.
Simulation and experimental results show that the proposed controller is effective with small synchronous tracking errors, and the chattering phenomenon is
significantly reduced.
Remote field-programmable gate array laboratory for signal acquisition and de...IJECEIAES
A remote laboratory utilizing field-programmable gate array (FPGA) technologies enhances students’ learning experience anywhere and anytime in embedded system design. Existing remote laboratories prioritize hardware access and visual feedback for observing board behavior after programming, neglecting comprehensive debugging tools to resolve errors that require internal signal acquisition. This paper proposes a novel remote embeddedsystem design approach targeting FPGA technologies that are fully interactive via a web-based platform. Our solution provides FPGA board access and debugging capabilities beyond the visual feedback provided by existing remote laboratories. We implemented a lab module that allows users to seamlessly incorporate into their FPGA design. The module minimizes hardware resource utilization while enabling the acquisition of a large number of data samples from the signal during the experiments by adaptively compressing the signal prior to data transmission. The results demonstrate an average compression ratio of 2.90 across three benchmark signals, indicating efficient signal acquisition and effective debugging and analysis. This method allows users to acquire more data samples than conventional methods. The proposed lab allows students to remotely test and debug their designs, bridging the gap between theory and practice in embedded system design.
Detecting and resolving feature envy through automated machine learning and m...IJECEIAES
Efficiently identifying and resolving code smells enhances software project quality. This paper presents a novel solution, utilizing automated machine learning (AutoML) techniques, to detect code smells and apply move method refactoring. By evaluating code metrics before and after refactoring, we assessed its impact on coupling, complexity, and cohesion. Key contributions of this research include a unique dataset for code smell classification and the development of models using AutoGluon for optimal performance. Furthermore, the study identifies the top 20 influential features in classifying feature envy, a well-known code smell, stemming from excessive reliance on external classes. We also explored how move method refactoring addresses feature envy, revealing reduced coupling and complexity, and improved cohesion, ultimately enhancing code quality. In summary, this research offers an empirical, data-driven approach, integrating AutoML and move method refactoring to optimize software project quality. Insights gained shed light on the benefits of refactoring on code quality and the significance of specific features in detecting feature envy. Future research can expand to explore additional refactoring techniques and a broader range of code metrics, advancing software engineering practices and standards.
Smart monitoring technique for solar cell systems using internet of things ba...IJECEIAES
Rapidly and remotely monitoring and receiving the solar cell systems status parameters, solar irradiance, temperature, and humidity, are critical issues in enhancement their efficiency. Hence, in the present article an improved smart prototype of internet of things (IoT) technique based on embedded system through NodeMCU ESP8266 (ESP-12E) was carried out experimentally. Three different regions at Egypt; Luxor, Cairo, and El-Beheira cities were chosen to study their solar irradiance profile, temperature, and humidity by the proposed IoT system. The monitoring data of solar irradiance, temperature, and humidity were live visualized directly by Ubidots through hypertext transfer protocol (HTTP) protocol. The measured solar power radiation in Luxor, Cairo, and El-Beheira ranged between 216-1000, 245-958, and 187-692 W/m 2 respectively during the solar day. The accuracy and rapidity of obtaining monitoring results using the proposed IoT system made it a strong candidate for application in monitoring solar cell systems. On the other hand, the obtained solar power radiation results of the three considered regions strongly candidate Luxor and Cairo as suitable places to build up a solar cells system station rather than El-Beheira.
An efficient security framework for intrusion detection and prevention in int...IJECEIAES
Over the past few years, the internet of things (IoT) has advanced to connect billions of smart devices to improve quality of life. However, anomalies or malicious intrusions pose several security loopholes, leading to performance degradation and threat to data security in IoT operations. Thereby, IoT security systems must keep an eye on and restrict unwanted events from occurring in the IoT network. Recently, various technical solutions based on machine learning (ML) models have been derived towards identifying and restricting unwanted events in IoT. However, most ML-based approaches are prone to miss-classification due to inappropriate feature selection. Additionally, most ML approaches applied to intrusion detection and prevention consider supervised learning, which requires a large amount of labeled data to be trained. Consequently, such complex datasets are impossible to source in a large network like IoT. To address this problem, this proposed study introduces an efficient learning mechanism to strengthen the IoT security aspects. The proposed algorithm incorporates supervised and unsupervised approaches to improve the learning models for intrusion detection and mitigation. Compared with the related works, the experimental outcome shows that the model performs well in a benchmark dataset. It accomplishes an improved detection accuracy of approximately 99.21%.
Developing a smart system for infant incubators using the internet of things ...IJECEIAES
This research is developing an incubator system that integrates the internet of things and artificial intelligence to improve care for premature babies. The system workflow starts with sensors that collect data from the incubator. Then, the data is sent in real-time to the internet of things (IoT) broker eclipse mosquito using the message queue telemetry transport (MQTT) protocol version 5.0. After that, the data is stored in a database for analysis using the long short-term memory network (LSTM) method and displayed in a web application using an application programming interface (API) service. Furthermore, the experimental results produce as many as 2,880 rows of data stored in the database. The correlation coefficient between the target attribute and other attributes ranges from 0.23 to 0.48. Next, several experiments were conducted to evaluate the model-predicted value on the test data. The best results are obtained using a two-layer LSTM configuration model, each with 60 neurons and a lookback setting 6. This model produces an R 2 value of 0.934, with a root mean square error (RMSE) value of 0.015 and a mean absolute error (MAE) of 0.008. In addition, the R 2 value was also evaluated for each attribute used as input, with a result of values between 0.590 and 0.845.
A review on internet of things-based stingless bee's honey production with im...IJECEIAES
Honey is produced exclusively by honeybees and stingless bees which both are well adapted to tropical and subtropical regions such as Malaysia. Stingless bees are known for producing small amounts of honey and are known for having a unique flavor profile. Problem identified that many stingless bees collapsed due to weather, temperature and environment. It is critical to understand the relationship between the production of stingless bee honey and environmental conditions to improve honey production. Thus, this paper presents a review on stingless bee's honey production and prediction modeling. About 54 previous research has been analyzed and compared in identifying the research gaps. A framework on modeling the prediction of stingless bee honey is derived. The result presents the comparison and analysis on the internet of things (IoT) monitoring systems, honey production estimation, convolution neural networks (CNNs), and automatic identification methods on bee species. It is identified based on image detection method the top best three efficiency presents CNN is at 98.67%, densely connected convolutional networks with YOLO v3 is 97.7%, and DenseNet201 convolutional networks 99.81%. This study is significant to assist the researcher in developing a model for predicting stingless honey produced by bee's output, which is important for a stable economy and food security.
A trust based secure access control using authentication mechanism for intero...IJECEIAES
The internet of things (IoT) is a revolutionary innovation in many aspects of our society including interactions, financial activity, and global security such as the military and battlefield internet. Due to the limited energy and processing capacity of network devices, security, energy consumption, compatibility, and device heterogeneity are the long-term IoT problems. As a result, energy and security are critical for data transmission across edge and IoT networks. Existing IoT interoperability techniques need more computation time, have unreliable authentication mechanisms that break easily, lose data easily, and have low confidentiality. In this paper, a key agreement protocol-based authentication mechanism for IoT devices is offered as a solution to this issue. This system makes use of information exchange, which must be secured to prevent access by unauthorized users. Using a compact contiki/cooja simulator, the performance and design of the suggested framework are validated. The simulation findings are evaluated based on detection of malicious nodes after 60 minutes of simulation. The suggested trust method, which is based on privacy access control, reduced packet loss ratio to 0.32%, consumed 0.39% power, and had the greatest average residual energy of 0.99 mJoules at 10 nodes.
Fuzzy linear programming with the intuitionistic polygonal fuzzy numbersIJECEIAES
In real world applications, data are subject to ambiguity due to several factors; fuzzy sets and fuzzy numbers propose a great tool to model such ambiguity. In case of hesitation, the complement of a membership value in fuzzy numbers can be different from the non-membership value, in which case we can model using intuitionistic fuzzy numbers as they provide flexibility by defining both a membership and a non-membership functions. In this article, we consider the intuitionistic fuzzy linear programming problem with intuitionistic polygonal fuzzy numbers, which is a generalization of the previous polygonal fuzzy numbers found in the literature. We present a modification of the simplex method that can be used to solve any general intuitionistic fuzzy linear programming problem after approximating the problem by an intuitionistic polygonal fuzzy number with n edges. This method is given in a simple tableau formulation, and then applied on numerical examples for clarity.
The performance of artificial intelligence in prostate magnetic resonance im...IJECEIAES
Prostate cancer is the predominant form of cancer observed in men worldwide. The application of magnetic resonance imaging (MRI) as a guidance tool for conducting biopsies has been established as a reliable and well-established approach in the diagnosis of prostate cancer. The diagnostic performance of MRI-guided prostate cancer diagnosis exhibits significant heterogeneity due to the intricate and multi-step nature of the diagnostic pathway. The development of artificial intelligence (AI) models, specifically through the utilization of machine learning techniques such as deep learning, is assuming an increasingly significant role in the field of radiology. In the realm of prostate MRI, a considerable body of literature has been dedicated to the development of various AI algorithms. These algorithms have been specifically designed for tasks such as prostate segmentation, lesion identification, and classification. The overarching objective of these endeavors is to enhance diagnostic performance and foster greater agreement among different observers within MRI scans for the prostate. This review article aims to provide a concise overview of the application of AI in the field of radiology, with a specific focus on its utilization in prostate MRI.
Seizure stage detection of epileptic seizure using convolutional neural networksIJECEIAES
According to the World Health Organization (WHO), seventy million individuals worldwide suffer from epilepsy, a neurological disorder. While electroencephalography (EEG) is crucial for diagnosing epilepsy and monitoring the brain activity of epilepsy patients, it requires a specialist to examine all EEG recordings to find epileptic behavior. This procedure needs an experienced doctor, and a precise epilepsy diagnosis is crucial for appropriate treatment. To identify epileptic seizures, this study employed a convolutional neural network (CNN) based on raw scalp EEG signals to discriminate between preictal, ictal, postictal, and interictal segments. The possibility of these characteristics is explored by examining how well timedomain signals work in the detection of epileptic signals using intracranial Freiburg Hospital (FH), scalp Children's Hospital Boston-Massachusetts Institute of Technology (CHB-MIT) databases, and Temple University Hospital (TUH) EEG. To test the viability of this approach, two types of experiments were carried out. Firstly, binary class classification (preictal, ictal, postictal each versus interictal) and four-class classification (interictal versus preictal versus ictal versus postictal). The average accuracy for stage detection using CHB-MIT database was 84.4%, while the Freiburg database's time-domain signals had an accuracy of 79.7% and the highest accuracy of 94.02% for classification in the TUH EEG database when comparing interictal stage to preictal stage.
Analysis of driving style using self-organizing maps to analyze driver behaviorIJECEIAES
Modern life is strongly associated with the use of cars, but the increase in acceleration speeds and their maneuverability leads to a dangerous driving style for some drivers. In these conditions, the development of a method that allows you to track the behavior of the driver is relevant. The article provides an overview of existing methods and models for assessing the functioning of motor vehicles and driver behavior. Based on this, a combined algorithm for recognizing driving style is proposed. To do this, a set of input data was formed, including 20 descriptive features: About the environment, the driver's behavior and the characteristics of the functioning of the car, collected using OBD II. The generated data set is sent to the Kohonen network, where clustering is performed according to driving style and degree of danger. Getting the driving characteristics into a particular cluster allows you to switch to the private indicators of an individual driver and considering individual driving characteristics. The application of the method allows you to identify potentially dangerous driving styles that can prevent accidents.
Hyperspectral object classification using hybrid spectral-spatial fusion and ...IJECEIAES
Because of its spectral-spatial and temporal resolution of greater areas, hyperspectral imaging (HSI) has found widespread application in the field of object classification. The HSI is typically used to accurately determine an object's physical characteristics as well as to locate related objects with appropriate spectral fingerprints. As a result, the HSI has been extensively applied to object identification in several fields, including surveillance, agricultural monitoring, environmental research, and precision agriculture. However, because of their enormous size, objects require a lot of time to classify; for this reason, both spectral and spatial feature fusion have been completed. The existing classification strategy leads to increased misclassification, and the feature fusion method is unable to preserve semantic object inherent features; This study addresses the research difficulties by introducing a hybrid spectral-spatial fusion (HSSF) technique to minimize feature size while maintaining object intrinsic qualities; Lastly, a soft-margins kernel is proposed for multi-layer deep support vector machine (MLDSVM) to reduce misclassification. The standard Indian pines dataset is used for the experiment, and the outcome demonstrates that the HSSF-MLDSVM model performs substantially better in terms of accuracy and Kappa coefficient.
Hybrid optimization of pumped hydro system and solar- Engr. Abdul-Azeez.pdffxintegritypublishin
Advancements in technology unveil a myriad of electrical and electronic breakthroughs geared towards efficiently harnessing limited resources to meet human energy demands. The optimization of hybrid solar PV panels and pumped hydro energy supply systems plays a pivotal role in utilizing natural resources effectively. This initiative not only benefits humanity but also fosters environmental sustainability. The study investigated the design optimization of these hybrid systems, focusing on understanding solar radiation patterns, identifying geographical influences on solar radiation, formulating a mathematical model for system optimization, and determining the optimal configuration of PV panels and pumped hydro storage. Through a comparative analysis approach and eight weeks of data collection, the study addressed key research questions related to solar radiation patterns and optimal system design. The findings highlighted regions with heightened solar radiation levels, showcasing substantial potential for power generation and emphasizing the system's efficiency. Optimizing system design significantly boosted power generation, promoted renewable energy utilization, and enhanced energy storage capacity. The study underscored the benefits of optimizing hybrid solar PV panels and pumped hydro energy supply systems for sustainable energy usage. Optimizing the design of solar PV panels and pumped hydro energy supply systems as examined across diverse climatic conditions in a developing country, not only enhances power generation but also improves the integration of renewable energy sources and boosts energy storage capacities, particularly beneficial for less economically prosperous regions. Additionally, the study provides valuable insights for advancing energy research in economically viable areas. Recommendations included conducting site-specific assessments, utilizing advanced modeling tools, implementing regular maintenance protocols, and enhancing communication among system components.
Student information management system project report ii.pdfKamal Acharya
Our project explains about the student management. This project mainly explains the various actions related to student details. This project shows some ease in adding, editing and deleting the student details. It also provides a less time consuming process for viewing, adding, editing and deleting the marks of the students.
Democratizing Fuzzing at Scale by Abhishek Aryaabh.arya
Presented at NUS: Fuzzing and Software Security Summer School 2024
This keynote talks about the democratization of fuzzing at scale, highlighting the collaboration between open source communities, academia, and industry to advance the field of fuzzing. It delves into the history of fuzzing, the development of scalable fuzzing platforms, and the empowerment of community-driven research. The talk will further discuss recent advancements leveraging AI/ML and offer insights into the future evolution of the fuzzing landscape.
Quality defects in TMT Bars, Possible causes and Potential Solutions.PrashantGoswami42
Maintaining high-quality standards in the production of TMT bars is crucial for ensuring structural integrity in construction. Addressing common defects through careful monitoring, standardized processes, and advanced technology can significantly improve the quality of TMT bars. Continuous training and adherence to quality control measures will also play a pivotal role in minimizing these defects.
Water scarcity is the lack of fresh water resources to meet the standard water demand. There are two type of water scarcity. One is physical. The other is economic water scarcity.
Welcome to WIPAC Monthly the magazine brought to you by the LinkedIn Group Water Industry Process Automation & Control.
In this month's edition, along with this month's industry news to celebrate the 13 years since the group was created we have articles including
A case study of the used of Advanced Process Control at the Wastewater Treatment works at Lleida in Spain
A look back on an article on smart wastewater networks in order to see how the industry has measured up in the interim around the adoption of Digital Transformation in the Water Industry.
NO1 Uk best vashikaran specialist in delhi vashikaran baba near me online vas...Amil Baba Dawood bangali
Contact with Dawood Bhai Just call on +92322-6382012 and we'll help you. We'll solve all your problems within 12 to 24 hours and with 101% guarantee and with astrology systematic. If you want to take any personal or professional advice then also you can call us on +92322-6382012 , ONLINE LOVE PROBLEM & Other all types of Daily Life Problem's.Then CALL or WHATSAPP us on +92322-6382012 and Get all these problems solutions here by Amil Baba DAWOOD BANGALI
#vashikaranspecialist #astrologer #palmistry #amliyaat #taweez #manpasandshadi #horoscope #spiritual #lovelife #lovespell #marriagespell#aamilbabainpakistan #amilbabainkarachi #powerfullblackmagicspell #kalajadumantarspecialist #realamilbaba #AmilbabainPakistan #astrologerincanada #astrologerindubai #lovespellsmaster #kalajaduspecialist #lovespellsthatwork #aamilbabainlahore#blackmagicformarriage #aamilbaba #kalajadu #kalailam #taweez #wazifaexpert #jadumantar #vashikaranspecialist #astrologer #palmistry #amliyaat #taweez #manpasandshadi #horoscope #spiritual #lovelife #lovespell #marriagespell#aamilbabainpakistan #amilbabainkarachi #powerfullblackmagicspell #kalajadumantarspecialist #realamilbaba #AmilbabainPakistan #astrologerincanada #astrologerindubai #lovespellsmaster #kalajaduspecialist #lovespellsthatwork #aamilbabainlahore #blackmagicforlove #blackmagicformarriage #aamilbaba #kalajadu #kalailam #taweez #wazifaexpert #jadumantar #vashikaranspecialist #astrologer #palmistry #amliyaat #taweez #manpasandshadi #horoscope #spiritual #lovelife #lovespell #marriagespell#aamilbabainpakistan #amilbabainkarachi #powerfullblackmagicspell #kalajadumantarspecialist #realamilbaba #AmilbabainPakistan #astrologerincanada #astrologerindubai #lovespellsmaster #kalajaduspecialist #lovespellsthatwork #aamilbabainlahore #Amilbabainuk #amilbabainspain #amilbabaindubai #Amilbabainnorway #amilbabainkrachi #amilbabainlahore #amilbabaingujranwalan #amilbabainislamabad
Immunizing Image Classifiers Against Localized Adversary Attacksgerogepatton
This paper addresses the vulnerability of deep learning models, particularly convolutional neural networks
(CNN)s, to adversarial attacks and presents a proactive training technique designed to counter them. We
introduce a novel volumization algorithm, which transforms 2D images into 3D volumetric representations.
When combined with 3D convolution and deep curriculum learning optimization (CLO), itsignificantly improves
the immunity of models against localized universal attacks by up to 40%. We evaluate our proposed approach
using contemporary CNN architectures and the modified Canadian Institute for Advanced Research (CIFAR-10
and CIFAR-100) and ImageNet Large Scale Visual Recognition Challenge (ILSVRC12) datasets, showcasing
accuracy improvements over previous techniques. The results indicate that the combination of the volumetric
input and curriculum learning holds significant promise for mitigating adversarial attacks without necessitating
adversary training.
Sachpazis:Terzaghi Bearing Capacity Estimation in simple terms with Calculati...Dr.Costas Sachpazis
Terzaghi's soil bearing capacity theory, developed by Karl Terzaghi, is a fundamental principle in geotechnical engineering used to determine the bearing capacity of shallow foundations. This theory provides a method to calculate the ultimate bearing capacity of soil, which is the maximum load per unit area that the soil can support without undergoing shear failure. The Calculation HTML Code included.
2. ISSN: 2088-8708
Int J Elec & Comp Eng, Vol. 8, No. 6, December 2018 : 4745 - 4754
4746
suitable for high traffic network at the cost of large delay. In S. Syes et. al. authors propose a method to
improve the performance of AODV and DSR reactive routing protocol in terms of delay and overhead [6].
The link residual life is estimated to reduce link failure and velocity of moving node is considered while
choosing the next node to forward data. The authors propose a method to find better routing path having
more energy than other routes through the analysis of average energy and minimum energy of paths
extending the network lifetime in [7]. An algorithm to effectively manage the consumption of bandwidth and
energy by applying mobile agents to carry the data is put forward by authors in [8].
The mobile agent will move to the neighbor node with the route request packet. It will look for
node’s route cache to find the path to the destination node. During this search process the mobile agent will
operate in the disconnected mode and hence will not use bandwidth. Thus the bandwidth and power are
optimized. In Rahul et. al. authors describe a new optimization technique based on reinforcement learning
where routing tables are replaced by estimation tables called as Q Values [9]. Q values are based on link
delay. The results show that the number of packet drops and delay is even low when the network size is
increased. In [10], authors present a new identifier based multihop IP header compression design.
Furthermore it also resolves problems with pure IP based adhoc networks emerged due to IP address auto
configuration service, distributed naming and name resolution and at application layer the role of an IP
address as an identifier. An approach to lower networking overhead and investigate the consequence of larger
packet sizes is focused in [11].
The article reviews different methods to reduce overhead by having large frame size, interrupt
coalescing, and copy avoidance by page remapping, integrated copy/checksum and hardware computation.
High bandwidth in the system can be achieved by reducing host overheads by applying optimizations above
and below the required layer, identifying the network interface support. Internet Engineering Task Force
(IETF) has developed two IPv6 applicable header compression schemes and their applicability to Global
Information Grid (GIG) infrastructure is discussed in article [12]. Several challenges necessary to be thought
of before applying header compression to a particular device is also discussed. A novel packet forwarding
key identification scheme in optical packet switched networks is presented in [13].
Neither header modification nor label distribution protocol is required, making network
management simple and also reduces the component cost. In Hooshiar authors put forward tunnelling based
route optimization, which reduces packet overhead and communication delay [14]. Bytes consumed to
establish mobile communication is the key comparison metric used. The results shows that more payloads are
transmitted as packets sent contain less packet overhead. In Fahim and Vilas authors aim to speed up the data
transmission, reducing the packet processing time by optimizing the current IP packet structure and reducing
header size [15]. In Bow-Nan et. al. authors introduce MANET IP Header Compression (MIPHC) protocol
that reduces 20 bytes header to 8 bytes [16]. Various header compression and decompression techniques are
introduced earlier, but compressing and decompressing involves various steps to be performed increasing the
processing time and energy consumption.
In M. Tamilarasi et. al. authors recommend to conserve battery power by transmitting packets with
minimum required energy generating less overhead and delay compared to standard DSR [17]. This
performance is achieved by modifying packet header format which excludes details of intermediate nodes
retaining only source and destination address. Minimum Total Transmission Power Routing (MTPR) which
concentrates on end-to-end energy efficiency selecting the minimum hop path has been addressed in [18]-
[19] while remaining energy of node is not taken into account for decision making. Location and the angular
displacement of nodes while selecting the intermediate nodes has been considered in [20]. This ensures stable
path between source and destination in turn reducing the frequent link-breaks and is developed over AODV
protocol. The method called stable and reduced link break routing protocol (S-AODV) reduces the process of
finding the new path oftenly.
Selecting minimum hop path, sending larger packet size, using header compression and
decompression are the different methods used to reduce header overhead. Concentrating on minimum hop
paths always attempts to select nodes lying at the center and their involvement in forwarding data is also
considerably high. Involving larger or variable packet size increases the percentage of data sent per attempt.
In a faulty environment, retransmission of larger packets comes with cost and recomputation. Compressing
and decompressing reduces the overall size to be transmitted but the overhead involved with compression
and decompression still continues.
The proposed method gives a simple and effective solution by calculating unique number based on
the fields of header which remains unchanged for communicating pairs involving very less computation. This
number is incorporated in first data packet and is noted down at all intermediate nodes that will be used
throughout the session. All the secondary nodes will be identified by this number and accordingly forwarding
decision is made. The proposed method gains information through interlayer communication and provides
3. Int J Elec & Comp Eng ISSN: 2088-8708
Cross Layer Solution for Energy and Delay Optimization … (Bhagyashri R Hanji)
4747
optimized path with respect two parameters namely energy and delay and is built over AODV reactive
routing protocol, named as Optimized –AODV (O-AODV).
2. PROPOSED METHOD
Faster networks transmit more packets and at the same time transmit more payload bytes of
specified packet size per unit time, increasing both per-packet and per-byte overhead on the host. Huge
portion of energy and time is consumed during the transmission or reception of packet which is used only for
the data administration purpose i.e. for processing of headers and trailers [21]. To prolong the service time of
devices efficient usage of energy is a requisite. A series of packets exchanged between the same pair of
source destination IP addresses, port addresses and using the same transport layer protocol can be treated in
the similar manner by a intermediate node for forwarding once the decision is made based on first
packet [22]. So instead of sending the same repeated data fields, those fields can be replaced by an identifier
field. The proposed method, O-AODV works in two steps:
Firstly when the data is received from higher layer, primary packet is created with all the necessary
calculations done and sent to lower layer for further processing and transmission. Next, all data received will
fit into secondary packets with compact header added and sent to lower layer for transmission as shown in
Figure 1. The header of primary packet is greater than secondary packet header. Every intermediate node
which first receives the primary packet stores all the details in its routing table to further identify the flow.
The secondary packet received next will be checked with the unique identifier if matched it will be forwarded
further to next node. This method leads to less processing time and the header size is also compact reducing
the overhead data which is carried with every packet ultimately reducing the energy consumption.
Figure 1. Primary and Secondary Packet transmission
Primary and secondary packet formats are detailed in Figure 2. Few fields remain constant for a
communication session between two nodes. For example, the source and destination port in UDP header
remains constant. These two fields are taken as input and unique identifier is calculated. Source and
destination IP Addresses remain same in IP header for a communicating pair. These two fields are taken as
input and Unique Address Pair Identification Number is calculated and stored. Version, Internet Header
Length, Type of service, Identification, Flags, Time to Live, Protocol remains unchanged. Every
communication starts with primary packet which contains all the fields along with unique identifiers. Every
intermediate node forming the path stores the details in routing table which will be further used to identify all
secondary packets. Secondary packets follow the primary packet containing compacted packet header and
increased payload maintaining same fragment size at the lower layers. M bit when 1 is used to indicate the
first/middle fragments and last fragment when set to 0. First field P/S bit is used to indicate Primary Packet
(P/S=1) and Secondary Packet (P/S=0).
Packet header structure is modified as shown in Figure 3, so as to work according to the
requirements. The amount of data stored in routing table also differs to support the requirements. The
incoming packet is first checked for primary or secondary with the first field (P/S) and the packet is
processed accordingly. For every primary packet received most of the details along with identification
4. ISSN: 2088-8708
Int J Elec & Comp Eng, Vol. 8, No. 6, December 2018 : 4745 - 4754
4748
number for the session are stored in each tuple and the secondary incoming packets are only checked for
matching identifier and forwarded accordingly.
Figure 2. Primary and secondary Packet Header Fields
class rt_entry {
nsaddr_t rt_dst;
nsaddr_t rt_src;
u_int32_t rt_uid;
u_int16_t rt_pid;
u_int8_t rt_ps;
…………….
}
recv-pkt (Packet *p)
{
Header_LS* rh = Header_LS :: access(p);
Header_IP* ih = Header_IP :: access(p);
Header_PP* pp = Header_PP :: access(p);
Header_SP* pp = Header_SP :: access(p);
……………………………………………
If(pp_ps == 1)
Process the received packet as primary packet
Else
Process the received packet as secondary packet
…………………………………………….
}
Figure 3. Modified packet header structure and its processing
The mathematical calculation (theoretical) for standard protocol header overhead is as shown in
Table 1. In IPv4 version, fields like version, Internet Header Length, Type of Service, Identification, flags,
protocols remains unchanged. The values depict that for the primary packet the overhead is increased while
for secondary packets the overhead is decreased. At the end the overall calculation shows that the proposed
method performs better. For example if system transmits 50, 100 and 200 IPv4/UDP packets in a session
which will have one primary Packet and 49, 99,199 secondary packets respectively.
Table 1. Overhead calculation for standard protocol header without options & padding
Protocol
Header
Total Packet
Header Size
Packet Header Size Overhead Overall efficiency calculation
Primary Secondary Primary Secondary Header Overhead Average
IPv4/TCP 40 bytes 67 bytes 27 bytes 67.5% (↑) 67.5% (↓)
10 packets 77.5%
65%-70% (↑)
25 packets 71.5%
50 packets 69.5%
100 packets 68.5%
200 packets 68%
IPv4/UDP 28 bytes 40 bytes 12 bytes 42.8 % (↑) 42.8% (↓)
10 packets 52.85%
35%-40% (↑)
25 packets 46.85%
50 packets 44.85%
100 packets 43.85%
200 packets 43.35%
5. Int J Elec & Comp Eng ISSN: 2088-8708
Cross Layer Solution for Energy and Delay Optimization … (Bhagyashri R Hanji)
4749
Pairing function [23] is a reversible process to uniquely encode two non-negative numbers into a
single unique number. Consider two positive integers a and b, PairFunc [a, b] yields a single positive integer
c uniquely associated with the input pair. Inverse function UnPairFunc[c] outputs the positive integer pair
[a, b] related to generation of c [24], [25]. Pairing function are bijections and is important in logic,
computation and mathematics on the whole [26]. Basic properties of a pairing functions are Injection,
Induction and onto as given in equation (1), (2) and (3) respectively. Injective function maps distinct input
arguments to distinct output values. Two pairs generating the same identifier is possible only when both pairs
are identical. Onto or surjective function maps every possible value to at least one argument.
22112,121, bababbaa (1)
babbaa ,, (2)
cbaba ,0 (3)
Equation (4) states that the function generates a unique number as output for any given pair of
integer numbers (Inum1, Inum2) as input. The output generated is equal only if two pairs of input are equal.
Equation (5) states that given a number K as input, then the two integers (Inum1, Inum2) can be generated as
output. The pairing function satisfies equation (4) and (5).
43214321 ,,,,, InumInumInumInumthenInumInumInumInum (4)
KInumInumthatsuch
NXNInumInumpairaisthereNfor each K
1
1
2
2
,
,
(5)
The Cantor Pairing function is a primitive recursive pairing function defined by equation (6) and (7) below.
Both equations describe the function used to produce Unique source destination Pair Identifier (UPI) taking
Inum1, Inum2 as input values and N as the set of values.
21,:: InumInumNNXN (6)
2212121 1
2
1
:, InumInumInumInumInumInumInum (7)
The limitation of Cantor pairing function is that the range of encoded result doesn't always stay
within the limits of 2N bit integer. If the inputs are two N-bit integers, then there are 2N
* (2N
-1) combination
of possible inputs. With Pigeon Hole Principle we need an output of size at least 2N
* (2N
-1) which is equal to
22N
-2N
in other words a size equal to 2N bit number. Malthew Szudzik method used in [18] overcomes the
above limitation and is defined by equation (8) below. Inum1 and Inum2 are two key input integers based on
which a unique number is calculated and returned.
0,
:2?
21
22111121
InumInumwhere
InumInumInumInumInumInumInumInumInum
(8)
Figure 3, illustrate different unique number key generated represented by dot on the graph for
around 500 pair of numbers taken as key1 and key2. The numbers included in pairs which are tested are as
small as two digit number till twelve digit numbers. At the other end when given a key value, then key1 and
key2 may also be generated easily.
6. ISSN: 2088-8708
Int J Elec & Comp Eng, Vol. 8, No. 6, December 2018 : 4745 - 4754
4750
Figure 3. Unique Identifier generated for 500 different source-destination pairs
3. RESULTS AND DISCUSSION
The experiment is carried out in NS-2.35[27]. Simulation area taken is 1500m x 1500m consisting
of 50 mobile nodes. All the nodes are initialized to 100J and nodes are arbitrarily positioned with Random
Waypoint Mobility Model with mobility in the range of 0m/s to 5m/s. 250m is taken as communication range
and data rate as 2Mbps. AODV is used as fundamental routing protocol and IEEE 802.11 as medium access
control protocol. The method discussed is measured in terms of packet overhead, packet processing time,
energy saved during this process and percentage of extra payload sent. The method is compared with AODV,
S-AODV and proves positively good in terms of the three metrics packet overhead, packet processing time
and energy consumption considered for evaluation. Packet overhead is defined as the proportion of number
of bytes in header to payload length. Packet processing time is measured as the time the node enters at input
interface of a node to the time when the packet is put out at the output interface. Total energy consumed is
calculated as the difference between remaining energy and initial energy.
The graphs in Figure 4 and 5 shows that the number of payload transmitted are more by 3 % to 5%
in AODV with IPv4/UDP and IPv4/TCP. Graph result is shown for 50 packets to 200 packets along X-axis
and number of bytes of payload sent along Y-axis. Payload carried in primary packet will be 1460bytes
(1518-40-18) and secondary packet will be 1488 bytes (1518-12-18) for IPv4 packets. Payload carried in
primary packet will be 1433 bytes (1518-67-18) and secondary packet will contain 1473 bytes (1518-27-18)
for IPv4/TCP.
Figure 4. Payload Sent in AODV and O-AODV with IPv4/UDP
7. Int J Elec & Comp Eng ISSN: 2088-8708
Cross Layer Solution for Energy and Delay Optimization … (Bhagyashri R Hanji)
4751
Figure 5. Payload Sent in AODV and O-AODV with IPv4/TCP
Figure 6, 7 and 8 shows the graphical results obtained for Routing load, Energy Consumption and
End to End delay of the proposed method, O-AODV compared to AODV, MTPR, and S-AODV. The
primary packet header for IP/UDP is increased to 40 bytes which is higher then regular packet header of 28
bytes, at the same time the secondary packet header is reduced to 12 bytes. As the ratio of primary to
secondary packets in general is taken as 1: (N-1), where N is the total number of packets sent, (N-1) is the
number of secondary packets following a primary packet the routing overhead is reduced reasonably as
depicted in Figure 6.
Figure 6. Normalized Routing Load Vs Number of Packets
Energy consumption is also reduced appropriately as shown in Figure 7. Average energy
consumption at the end of simulation is calculated and found to be improved by 6% to 8% less energy
consumption than S-AODV method. Figure 8 shows that end to end delay is also reduced as the packet
processing time is reduced as the number of fields to be checked is minimal. On an average around 3% to 5%
improvement is shown with respect to delay. The processing time is reduced which adds to the improvement
in overall delay.
AODV
MTPR
S-AODV
O-AODV
Normalized Routing Load
Packets
NormalizedRouting
Load
8. ISSN: 2088-8708
Int J Elec & Comp Eng, Vol. 8, No. 6, December 2018 : 4745 - 4754
4752
.
Figure 7. Energy Consumption Vs Number of Packets
Figure 8. End to End DelayVs Number of Packets
4. CONCLUSION
The work in this paper focusses on a novel method to lessen packet processing time. Delay is
becoming more and more noteworthy as networks put into practice complex protocols running on routers.
Minimizing host overhead in handling packets and their data achieve better performance. Optimized packet
header transmits more payloads with smaller headers and reduced processing time increasing the
effectiveness of the existing network. The primary packet is sent with regular header and few additional
fields, which will be processed by all intermediate nodes store the necessary details required to further
forward all the secondary packets belonging to the same communication session. The proposed work shows
improved performance with respect to the three metrics routing overhead, energy consumed and end to end
delay. The work is carried out with IPv4 addressing and can be extended to IPv6 addressing. The idea behind
O-AODV
S-AODV
MTPR
AODV
Energy
Consumption
Packe
ts
EnergyConsumed
O-AODV
S-AODV
MTPR
AODV
Packe
ts
End-To-EndDelay
End-to-End Delay
9. Int J Elec & Comp Eng ISSN: 2088-8708
Cross Layer Solution for Energy and Delay Optimization … (Bhagyashri R Hanji)
4753
calculating Unique Address Pair Identification Number using the IP addresses can be modified to include the
Source IP Address and the Start time of the session when primary packet is generated. This adds security as
the Unique Number generated will be valid for only one session communication.
REFERENCES
[1] S. Corson,J. Macker,"Mobile Ad Hoc Networking(MANET) : Rouitng protocol Performance Issues and evaluation
Considerations," Network Working Group,RFC: 2501,1999.
[2] Lei Chen,"Protocols for Supporting Quality of Service in Mobile Ad Hoc Networks," Ph.d Thesis,University of
Rochester,New York,2006.
[3] Sassan Ahamadi,"The IEEE 802.16m Convergence Sub-Layer,"Mobile WiMAX,2011.
[4] EFFNET AB, "An Introduction to IP Header Compression," White Paper,2004.
[5] Rahul Desai, B P Patil, Davinder Pal Sharma, “Routing Protocols for Mobile Ad Hoc Network: A Survey and
Analysis”. Indonesian Journal of Electrical Engineering and Computer Science. vol. 7, (3), 2017, pp. 795-801.
[6] S. Syes Abdul Syed,T. Senthil Kumaran,”Extremely Vibrant Routing Scheme for Mobile Adhoc Network”,
Indonesian Journal of Electrical Engineering and Computer Science,vol. 9(2), 2018,pp. 306-310.
[7] Hasan Awni Shakir,”Enhancement of Energy Control Routing Protocol for Mobile Ad Hoc Network Based on
Hybrid Particle Swarm Optimization with Ant Colony-based Energy Control Routing”, Indonesian Journal of
Electrical Engineering and Computer Science,vol. 8,(2),2017, pp. 308-314.
[8] Bindiya Bhatia, M. K. Soni, Parul Tomar,”Extended Bandwidth Optimized and Energy Efficient Dynamic Source
Routing Protocol in Mobile Ad-hoc Networks”, International Journal of Electrical and Computer Engineering
(IJECE), vol. 8, (3), 2018, pp.1460-1466.
[9] Rahul Desai, B P Patil, Davinder Pal Sharma. Learning Based Route Management in Mobile Ad Hoc Networks.
Indonesian Journal of Electrical Engineering and Computer Science. vol. 7, (3), 2017, pp. 718-723.
[10] Shahrukh Khalid,Athar Mahboob,Choudhry Fahad Azim,Aqeel Ur Rehman,"Design and Realization of a Novel
Header Compression Scheme for Ad Hoc Networks," ETRI Journal,vol. 38, (5), 2016,pp. 922-933.
[11] Jeffrey S. Chase, Andrew J. Gallatin,Kenneth G. Yocum,"End System Optimizations for High Speed TCP," IEEE
Communications Magazine,2001,pp. 68-74.
[12] Emre Ertekin,Chris Christou,Booz Allen Hamilton,"Internet Protocol Header Compression,Robust Header
Compression, and Their Applicability in the Globl Information Grid," IEEE Communications
Magazine,2004,pp.106-116.
[13] Henrik Wessing,Henrik Christiansen,Tina Fjelde,Lars Dittmann,"Novel Scheme for Packet Forwarding Without
Header Modifications in Optical Netwoks," Journal of Lightwave Technology,vol. 20,(8),2002,pp. 1277-1288.
[14] Hooshiar Zolfagharnasab,"Reducing Packet Overhead in Mobile IPv6," International Journal of Distributed and
Parallel Systems,vol. 3,(3),2012,pp. 1-8.
[15] Fahim A Ahmed Ghanem,Vilas M. Thakare,"Optimization Of IPv4 Packet’s Headers," International Journal of
Computer Science Issues,vol. 10,(1),2013,pp. 294-302.
[16] Bow-Nan Cheng,John Zuena,Jim Wheeler,Scott Moore,Brian Hung,"MANET IP Header Compression,"
Proceedings of the IEEE Military Communications Conference,2013,pp.494-503.
[17] M. Tamilarasi,S. Chandramathi,T. G. Palanivelu,"Overhead Reduction and Energy Management in DSR for
MANETs" proceedings of Third international Conference on COMmunication, COMSWARE,Bangalore,2008.
[18] Scott D, Toh C, Cobb H," Performance Evaluation of battery life aware routing schemes for wireless ad hoc
networks," Proceedings of IEEE ICC, vol. 9, 2001,pp.2824-2829.
[19] W. Su, S. J. Lee, M Gerla,"Mobility Prediction and Routing in Ad Hoc Wireless Networks," International Journal
of Network Management, vol. 11,(1),2001,pp.3-30.
[20] Bhagyashri R Hanji,Rajashree Shettar,"Stable Reduced Link Break Routing Technique in Mobile Ad Hoc
Network," Proceeding of the Second International Conference ICACDS,Dehradun,2018.
[21] Mobin Iftekharul,"Energy Efficient Packet Size Optimization for wireless Ad Hoc Networks,"Ph.d Thesis,Queen
Marry University of London,United Kingdom,2013.
[22] "Network Routing: Algorithms,Protocols, and Architectures,"2nd
Edition,Elsevier,2010.
[23] Steven Pigeon," Pairing Functions," FromMathworld-A Wolfram Web Resource,created byvEric W. Weisstein.
[24] Matthew Szudzik,"An Elegant Pairing Function," Proceedings of the Wolfram Science NKS 2006
Conference,2006. Available from http://szudzik.com/ElegantPairing.pdf.
[25] Dovier,Agostino,Enrico Pontelli, and Gianfranco Rossi,"Set unification", Theory and Practice of Logic
Programming,2006.
[26] Kenneth W Regan,"Minimum-Complexity Pairing Functions," Journal of Computer and System Sciences,vol.
45,2006,pp. 285-295.
[27] Kevin Fall,Annan Varadhan, The NS Manual, The VINT Project, 2011.
10. ISSN: 2088-8708
Int J Elec & Comp Eng, Vol. 8, No. 6, December 2018 : 4745 - 4754
4754
BIOGRAPHIES OF AUTHORS
Bhagyashri R Hanji received her B.E and Mtech degree from Visvesvaraya Technological
University, Belagavi. She is currently working towards her Ph. D. degree dealing with
improving the Quality of Service in Mobile Ad Hoc networks. She is currently working as
Assistant professor at Global Academy of Technology, Bengaluru.
Dr. Rajashree Shettar is currently working as Professor, Dept. of Computer Science, R. V
College of Engineering, Bengaluru. Her research work focuses on “Knowledge Discovery
in Semi-structured Data”. She has around 45 publications in various International Journals
and Conferences. She has authored a book on “Sequential Pattern Mining from Web Log
Data: Concepts, Techniques and Applications of Web Usage Mining”, published by
LAMBERT Academic Publishing company, Germany and co-authored book chapters