IJCERT Standard on-line Journal
ISSN(Online):2349-7084,(An ISO 9001:2008 Certified Journal)
iso nicir csir
http://www.ijcert.org offers Discount for Indian research Scholars
IJCERT (ISSN 2349–7084 (Online)) is approved by National Science Library (NSL), National Institute of Science Communication And Information Resources (NISCAIR), Council of Scientific and Industrial Research, New Delhi, India.
The document summarizes an Efficient Position-Based Opportunistic Routing (EPOR) protocol proposed for mobile ad hoc networks. EPOR takes advantage of geographic routing and the broadcast nature of wireless transmissions. When a packet is transmitted, overhearing nodes can act as forwarding candidates. The best forwarder is chosen, but if it fails to forward in time, a suboptimal candidate will forward instead to avoid transmission interruptions. Simulation results show EPOR achieves higher packet delivery ratios and lower end-to-end delays than GPSR and AOMDV routing protocols, even under high node mobility.
GRAPH THEORETIC ROUTING ALGORITHM (GTRA) FOR MOBILE AD-HOC NETWORKS (MANET)graphhoc
Battlefield theater applications require supporting large number of nodes. It can facilitate many multi-hop
paths between each source and destination pairs. For scalability, it is critical that for supporting network
centric applications with large set of nodes require hierarchical approach to designing networks. In this
research we consider using Mobile Ad Hoc Network (MANET) with multiple clusters. Each cluster
supports a few nodes with a cluster head. The intra-cluster 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. The selection of intra-cluster
communications and inter-cluster communications allow scalability of the network to support multiservices
applications end-to-end with a desired Quality of Service (QoS). This paper proposes graph
theoretic approach to establish efficient connection between a source and a destination within each cluster
in intra-cluster network and between clusters in inter-cluster network. Graph theoretic approach
traditionally was applied networks where nodes are static or fixed. In this paper, we have applied the
graph theoretic routing to MANET where nodes are mobile. One of the important challenges in MANET is
to support an efficient routing algorithm for multi-hop communications across many nodes which are
dynamic in nature. 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. 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-to-end. 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. Each cluster performs similarly and the algorithm is also used for inter-cluster communications.
Our simulation results show that the proposed graph theoretic routing approach will reduce the overall
delay and improves the physical layer data frame transmission.
A comparative study in wireless sensor networksijwmn
This document summarizes and compares several routing algorithms proposed for wireless sensor networks. It discusses algorithms that aim to improve reliability, power efficiency, lifetime, and fault tolerance. The evaluation section compares how each algorithm addresses challenges like reliability, energy conservation, and adapting to topology changes. While various algorithms achieve improvements in areas like power efficiency and lifetime, most still have limitations and do not fully address all the key challenges for wireless sensor networks.
This document summarizes a research paper that proposes a new Position Based Opportunistic Routing Protocol (POR) to improve reliable data delivery in mobile ad hoc networks. Existing geographic routing protocols have issues with route failures and delays in discovering new routes when nodes move. The proposed POR protocol selects multiple forwarding candidate nodes to opportunistically forward packets. If the primary forwarder fails, backup candidates can forward packets to avoid transmission interruptions. Simulation results show the POR protocol has lower delay and higher packet delivery ratio compared to existing protocols.
IMPROVING PACKET DELIVERY RATIO WITH ENHANCED CONFIDENTIALITY IN MANETijcsa
In Mobile Ad Hoc Network (MANET), the collection of mobile nodes gets communicated without the need of any customary infrastructure. In MANET, repeated topology changes and intermittent link breakage
causes the failure of existing path. This leads to rediscovery of new route by broadcasting RREQ packet.The number of RREQ packet in the network gets added due to the increased amount of link failures. This result in increased routing overhead which degrades the packet delivery ratio in MANET. While designing
routing protocols for MANET, it is indispensable to reduce the overhead in route discovery. In our previous
work[17], routing protocol based on neighbour details and probabilistic knowledge is utilized, additionally
the symmetric cipher AES is used for securing the data packet. Through this protocol, packet delivery ratio
gets increased and confidentiality is ensured. But there is a problem in secure key exchange among the
source and destination while using AES. To resolve that problem, hybrid cryptographic system i.e.,
combination of AES and RSA is proposed in this paper. By using this hybrid cryptographic scheme and the
routing protocol based on probability and neighbour knowledge, enhanced secure packet delivery is
ensured in MANET
Improving the scalability by contact information compression in routingijitjournal
The existence of reduced scalability and delivery leads to the development of scalable routing by contact
information compression. The previous work dealt with the result of consistent analysis in the performance
of DTN hierarchical routing (DHR). It increases as the source to destination distance increases with
decreases in the routing performance. This paper focuses on improving the scalability and delivery through
contact information compression algorithm and also addresses the problem of power awareness routing to
increase the lifetime of the overall network. Thus implementing the contact information compression (CIC)
algorithm the estimated shortest path (ESP) is detected dynamically. The scalability and release are more
improved during multipath multicasting, which delivers the information to a collection of target
concurrently in a single transmission from the source.
This document discusses various techniques for energy efficient unicast routing in wireless sensor networks. It describes algorithms such as Dijkstra's algorithm, minimizing energy per packet, maximizing network lifetime, and routing based on available battery energy. Additional algorithms covered include minimum battery cost routing, minimum-max battery cost routing, and conditional max-min battery capacity routing. The document also discusses multipath unicast routing techniques including constructing disjoint and braided paths, and simultaneously transmitting over multiple paths.
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
The document summarizes an Efficient Position-Based Opportunistic Routing (EPOR) protocol proposed for mobile ad hoc networks. EPOR takes advantage of geographic routing and the broadcast nature of wireless transmissions. When a packet is transmitted, overhearing nodes can act as forwarding candidates. The best forwarder is chosen, but if it fails to forward in time, a suboptimal candidate will forward instead to avoid transmission interruptions. Simulation results show EPOR achieves higher packet delivery ratios and lower end-to-end delays than GPSR and AOMDV routing protocols, even under high node mobility.
GRAPH THEORETIC ROUTING ALGORITHM (GTRA) FOR MOBILE AD-HOC NETWORKS (MANET)graphhoc
Battlefield theater applications require supporting large number of nodes. It can facilitate many multi-hop
paths between each source and destination pairs. For scalability, it is critical that for supporting network
centric applications with large set of nodes require hierarchical approach to designing networks. In this
research we consider using Mobile Ad Hoc Network (MANET) with multiple clusters. Each cluster
supports a few nodes with a cluster head. The intra-cluster 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. The selection of intra-cluster
communications and inter-cluster communications allow scalability of the network to support multiservices
applications end-to-end with a desired Quality of Service (QoS). This paper proposes graph
theoretic approach to establish efficient connection between a source and a destination within each cluster
in intra-cluster network and between clusters in inter-cluster network. Graph theoretic approach
traditionally was applied networks where nodes are static or fixed. In this paper, we have applied the
graph theoretic routing to MANET where nodes are mobile. One of the important challenges in MANET is
to support an efficient routing algorithm for multi-hop communications across many nodes which are
dynamic in nature. 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. 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-to-end. 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. Each cluster performs similarly and the algorithm is also used for inter-cluster communications.
Our simulation results show that the proposed graph theoretic routing approach will reduce the overall
delay and improves the physical layer data frame transmission.
A comparative study in wireless sensor networksijwmn
This document summarizes and compares several routing algorithms proposed for wireless sensor networks. It discusses algorithms that aim to improve reliability, power efficiency, lifetime, and fault tolerance. The evaluation section compares how each algorithm addresses challenges like reliability, energy conservation, and adapting to topology changes. While various algorithms achieve improvements in areas like power efficiency and lifetime, most still have limitations and do not fully address all the key challenges for wireless sensor networks.
This document summarizes a research paper that proposes a new Position Based Opportunistic Routing Protocol (POR) to improve reliable data delivery in mobile ad hoc networks. Existing geographic routing protocols have issues with route failures and delays in discovering new routes when nodes move. The proposed POR protocol selects multiple forwarding candidate nodes to opportunistically forward packets. If the primary forwarder fails, backup candidates can forward packets to avoid transmission interruptions. Simulation results show the POR protocol has lower delay and higher packet delivery ratio compared to existing protocols.
IMPROVING PACKET DELIVERY RATIO WITH ENHANCED CONFIDENTIALITY IN MANETijcsa
In Mobile Ad Hoc Network (MANET), the collection of mobile nodes gets communicated without the need of any customary infrastructure. In MANET, repeated topology changes and intermittent link breakage
causes the failure of existing path. This leads to rediscovery of new route by broadcasting RREQ packet.The number of RREQ packet in the network gets added due to the increased amount of link failures. This result in increased routing overhead which degrades the packet delivery ratio in MANET. While designing
routing protocols for MANET, it is indispensable to reduce the overhead in route discovery. In our previous
work[17], routing protocol based on neighbour details and probabilistic knowledge is utilized, additionally
the symmetric cipher AES is used for securing the data packet. Through this protocol, packet delivery ratio
gets increased and confidentiality is ensured. But there is a problem in secure key exchange among the
source and destination while using AES. To resolve that problem, hybrid cryptographic system i.e.,
combination of AES and RSA is proposed in this paper. By using this hybrid cryptographic scheme and the
routing protocol based on probability and neighbour knowledge, enhanced secure packet delivery is
ensured in MANET
Improving the scalability by contact information compression in routingijitjournal
The existence of reduced scalability and delivery leads to the development of scalable routing by contact
information compression. The previous work dealt with the result of consistent analysis in the performance
of DTN hierarchical routing (DHR). It increases as the source to destination distance increases with
decreases in the routing performance. This paper focuses on improving the scalability and delivery through
contact information compression algorithm and also addresses the problem of power awareness routing to
increase the lifetime of the overall network. Thus implementing the contact information compression (CIC)
algorithm the estimated shortest path (ESP) is detected dynamically. The scalability and release are more
improved during multipath multicasting, which delivers the information to a collection of target
concurrently in a single transmission from the source.
This document discusses various techniques for energy efficient unicast routing in wireless sensor networks. It describes algorithms such as Dijkstra's algorithm, minimizing energy per packet, maximizing network lifetime, and routing based on available battery energy. Additional algorithms covered include minimum battery cost routing, minimum-max battery cost routing, and conditional max-min battery capacity routing. The document also discusses multipath unicast routing techniques including constructing disjoint and braided paths, and simultaneously transmitting over multiple paths.
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
An optimistic sector oriented approach to mitigate broadcast storm problem in...IAEME Publication
In mobile ad hoc networks (MANETs), due to frequent changes in topology there exist more
link breakages which lead to high rate of path failures and route discoveries, which cause an
increased routing control overhead. Thus, it is necessary to reduce the overhead of route discovery in
the design of routing protocols for MANETs. In a route discovery, broadcasting may be an
elementary and effective data dissemination mechanism, wherever a mobile node blindly
rebroadcasts the first received route request packets unless it has a route to the destination, and
therefore it causes the broadcast storm problem. This paper proposes an optimistic approach OpSOA
to mitigate the broadcasting storm problem and to scale back the communication overheads of
routing protocols by forming sectors within the network and finding the route to destination by two
sectors at a time. The simulation result shows that the proposed mechanism substantially reduces
route requests. Since the proposed protocol searches for the destination sector wise thereby reducing
network wide broadcast of routing requests, traffic, collision and contention. There by there can be
an increase in the packet delivery ratio and decrease in the average end-to-end delay
A Review on Geographical Location Based Energy Efficient Direction Restricted...IJRES Journal
Delay Tolerant Network (DTNs) is a wireless network that experiences frequent connectivity and due to mobility of nodes long duration partitions occurred during transmission of data. DTN has the main feature that there is not full path present from source to destination. In Delay Tolerant Network (DTN), traditional routing protocol for mobile Ad-hoc protocol to be ineffective to extend of message transmission between different nodes. Delay tolerant networks (DTNs) are used in many applications like in deep space communications, under water Acoustic Network, Sparsely Populated Areas Networks Etc. In such network a routing with minimum energy congumption is major issue. In this paper, we try to explore a routing issue in DTN. First energy requirement and routing with their corresponding countermeasures in DTN are explained. Moving nodes in DTN keep the updating of network as well energy at every stage. By using the geographical concept the location of each node is maintained by updating in topology. There are many routing protocols are available for routing purpose in DTN.
LOAD BALANCING AND PROVIDING SECURITY USING RSA IN WIRELESS SENSOR NETWORKSIJARIIT
This paper presents load balancing and provides security using RSA algorithm. This is brief introduction to handle the traffic on node. This represents the converge-casting protocol in wireless sensor networks. The protocol is localized and distributed, and adapts efficiently to vary traffic. Graphs are analyzed using NS-2 simulator, here end-to-end packet latency, packet delivery ratio, throughput are analyzed. This is done for 30 nodes in NS-2 simulation.
INCREASE THE LIFETIME OF WIRELESS SENSOR NETWORKS USING HIERARCHICAL CLUSTERI...ijwmn
Wireless sensor networks consist of hundreds or thousands of nodes with limited energy. Since the life time
of each sensor is equivalent to the battery life, the energy issue is considered as a major challenge.
Clustering has been proposed as a strategy to extend the lifetime of wireless sensor networks. Cluster size,
number of Cluster head per cluster and the selection of cluster head are considered as important factors in
clustering. In this research by studying LEACH algorithm and optimized algorithms of this protocol and by
evaluating the strengths and weaknesses, a new algorithm based on hierarchical clustering to increase the
lifetime of the sensor network is proposed. In this study, with a special mechanism the environment of
network is layered and the optimal number of cluster head in each layer is selected and then recruit for the
formation of clusters in the same layer by controlling the topology of the clusters is done independently.
Then the data is sent through the by cluster heads through the multi- stage to the main station. Simulation
results show that the above mentioned method increases the life time about 70% compared to the LEACH.
International Journal of Engineering Research and Applications (IJERA) aims to cover the latest outstanding developments in the field of all Engineering Technologies & science.
International Journal of Engineering Research and Applications (IJERA) is a team of researchers not publication services or private publications running the journals for monetary benefits, we are association of scientists and academia who focus only on supporting authors who want to publish their work. The articles published in our journal can be accessed online, all the articles will be archived for real time access.
Our journal system primarily aims to bring out the research talent and the works done by sciaentists, academia, engineers, practitioners, scholars, post graduate students of engineering and science. This journal aims to cover the scientific research in a broader sense and not publishing a niche area of research facilitating researchers from various verticals to publish their papers. It is also aimed to provide a platform for the researchers to publish in a shorter of time, enabling them to continue further All articles published are freely available to scientific researchers in the Government agencies,educators and the general public. We are taking serious efforts to promote our journal across the globe in various ways, we are sure that our journal will act as a scientific platform for all researchers to publish their works online.
MuMHR: Multi-path, Multi-hop Hierarchical RoutingM H
This document proposes a new routing protocol called MuMHR for wireless sensor networks. MuMHR aims to improve energy efficiency and robustness over LEACH in three ways: 1) By enabling nodes to select cluster heads based on the number of hops away to reduce transmission distances. 2) By using a back-off timer and multiple paths for transmissions to reduce setup overhead and add reliability. 3) By electing backup cluster heads to substitute when primary heads fail. The protocol operates in setup and data transfer phases, with the setup phase selecting cluster heads and forming clusters in an energy-efficient multi-hop manner.
The novel applications of sensor networks impose some requirements in wireless sensor network design. With the energy efficiency and lifetime awareness, the throughput and network delayalso required to support emerging applications of sensor networks. In this paper, we propose
throughput and network delay aware intra-cluster routing protocol. We introduce the back-up links in the intra-cluster communication path. The link throughput, communication delay, packet loss ratio, interference, residual energy and node distance are the considered factors in finding efficient path of data communication among the sensor nodes within the cluster. The
simulation result shows the higher throughput and lower average packet delay rate for the proposed routing protocol than the existing benchmarks. The proposed routing protocol also shows energy efficiency and lifetime awareness with better connectivity rate.
A cross layer optimized reliable multicast routing protocol in wireless mesh ...ijdpsjournal
The Optimal way to create a protocol in Wireless Mesh Networks
is to take into account a cross layer due
to the interference among wireless transmissions.
In this paper
,
w
e focus on designing and implementing
a
reliable
multicast protocol
called Me
sh Reliable Multicast Protocol (MRMP).
A
recovery tree
built
dynamically
which is joining with
the multicast routing tree.
U
sing the recovery tree
the packet losses are
repaired locally
.
This Cross layer
Technique
between network layer (
multicast routing)
and transport layer
(
reliability) using simulation
results
prove
the effectiveness
and optimization
of
cross layer
in WMNs
compare with the conventional layer
IMPLEMENTATION OF BIOLOGICAL ROUTING PROTOCOL IN TUNNEL WIRELESS SENSOR NETWO...ijwmn
The document describes a new biological routing protocol called Biological Tunnel Routing Protocol (BioTROP) for Tunnel Wireless Sensor Networks (TWSN). BioTROP uses concepts from ant colony behavior and optimal forwarding calculations to determine the best next hop neighbor for packet transmission. It was tested on a 7 node TelosB sensor network in a tunnel, where over 70% of transmitted data packets were successfully delivered to the base station. BioTROP employs a cross-layer design between the physical and network layers to select next hops based on metrics like signal strength, link quality, and remaining power from the physical layer. It consists of routing management and neighborhood management modules to determine optimal routes and maintain neighbor tables.
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
Effective Path Identification Protocol for Wireless Mesh NetworksIDES Editor
Wireless Mesh Networks (WMNs) have emerged as
a key technology for next-generation wireless networking.
Routing is a key factor for transfer of packets from source to
destination. SrcRR is widely used protocol for transferring
packets from source to destination. This protocol often uses
Dijkstra’s algorithm on its link state database to find the next
alternative path to the destination when ever the ETX metric
of the link changes.This is a time consuming process if the
ETX metric of the links are changing frequently. So this paper
eliminates the use of Dijkistra’s algorithm and uses the a
search operation for finding the best paths.
EFFICIENT REBROADCASTING USING TRUSTWORTHINESS OF NODE WITH NEIGHBOUR KNOWLED...ijiert bestjournal
Mobile Ad hoc network is an infrastructure less communication network with limited resources. To maintain virtual
infrastructure for communication broadcasting mechanisms is used. Due to lack of energy efficiency in Mobile Ad
hoc network, there is a need to develop an efficient broadcasting model which enhances energy efficiency. Also
nodes with malicious behaviour cause an internal threat that disobeys the standard and degrades the performance of
routing protocols. This paper introduced an enhanced rebroadcasting algorithm, where rebroadcasting decision for
next hop is immediate or delayed on the basis of trust value and energy level of particular node. This approach helps
to decrease number of rebroadcast, energy consumption and also enhances security. The decision is made with trust
value associated with node, their remaining energy and total number of uncovered nodes.
Coverage and Connectivity Aware Neural Network Based Energy Efficient Routing...graphhoc
There are many challenges when designing and deploying wireless sensor networks (WSNs). One of the key challenges is how to make full use of the limited energy to prolong the lifetime of the network, because energy is a valuable resource in WSNs. The status of energy consumption should be continuously monitored after network deployment. In this paper, we propose coverage and connectivity aware neural network based energy efficient routing in WSN with the objective of maximizing the network lifetime. In the proposed scheme, the problem is formulated as linear programming (LP) with coverage and connectivity aware constraints. Cluster head selection is proposed using adaptive learning in neural networks followed by coverage and connectivity aware routing with data transmission. The proposed scheme is compared with existing schemes with respect to the parameters such as number of alive nodes, packet delivery fraction, and node residual energy. The simulation results show that the proposed scheme can be used in wide area of applications in WSNs.
Tree Based Proactive Source Routing Protocol for MANETspaperpublications3
bstract: A mobile adhoc network (MANET) is a wireless communication network and the node that does not lie within the direct transmission range of each other depends on the intermediate nodes to forward data. Opportunistic data forwarding has not been widely utilized in mobile adhoc networks (MANETs) and the main reason is the lack of an efficient lightweight proactive routing scheme with strong source routing capability. PSR protocol facilitates opportunistic data forwarding in MANETs. In PSR, each node maintains a breadth-first search spanning tree of the network rooted at it-self. This information is periodically exchanged among neighboring nodes for updated network topology information. Here added a Mobile sink to reduce the overhead in case of number of child node increases and also to reduce the delay.
AN EFFICIENT ROUTING PROTOCOL FOR DELAY TOLERANT NETWORKS (DTNs)cscpconf
Delay-Tolerant Networks are those which lacks continuous communications among mobile
nodes . Distributed clustering scheme and cluster-based routing protocol are used for DelayTolerant
Mobile Networks (DTMNs). The basic idea is to distributive group mobile nodes with
similar mobility pattern into a cluster, which can then interchangeably share their resources for
overhead reduction and load balancing, aiming to achieve efficient and scalable routing in DTMN. Load balancing is carried out in two ways, Intra cluster load balancing and Inter cluster load balancing. The Convergence and stability become major challenges in distributed clustering in DTMN. An efficient routing protocol will be provided for the delay tolerant networks through which the stability of the network is maintained .Based on nodal contact probabilities, a set of functions including Sync(), Leave(), and Join() are devised for cluster formation and gateway selection. Finally, the gateway nodes exchange network information and perform routing
This document summarizes the results of a study investigating energy consumption in mobile ad hoc networks (MANETs). It analyzes how varying packet size affects several network performance metrics through simulations. The simulations show that as packet size increases, packet delivery ratio decreases and packet loss ratio increases, due to greater network congestion. Throughput initially increases with packet size but then decreases. Control overhead and average energy consumption both rise with larger packet sizes. Increasing packet size negatively impacts network reliability and energy efficiency. The document concludes that packet size is an important factor influencing the performance of data transmission in MANETs.
A Survey on Web Page Recommendation and Data PreprocessingIJCERT
In today’s era, as we all know internet technologies are growing rapidly. Along with this, instantly, Web page recommendations are also improving. The aim of a Web page recommender system is to predict the Web page or pages, which will be visited from a given Web-page of a website. Data preprocessing is one basic and essential part of Web page recommendation. Data preprocessing consists of cleanup and constructing data to organize for extracting pattern. In this paper, we discuss and focus on Web page Recommendation and role of data preprocessing in Web page recommendation, considering how data preprocessing is related to Web page recommendation.
Robust Resource Allocation in Relay Node Networks for Optimization ProcessIJCERT
Overlay steering has risen as a promising way to deal with enhances unwavering quality and effectiveness of the Internet. For one-jump overlay source steering, when a given essential way experiences the connection disappointment or execution debasement, the source can reroute the movement to the destination by means of a deliberately set transfer hub. Be that as it may, the over-substantial activity going through the same transfer hub may bring about incessant bundle misfortune and postponement jitter, which can corrupt the throughput and usage of the system. To defeat this issue, we propose a Load-Balanced One-jump Overlay Multipath Routing calculation (LB-OOMR), in which the activity is first part at the source edge hubs and afterward transmitted along numerous one-bounce overlay ways. So as to decide an ideal split proportion for the activity, we plan the issue as a direct programming (LP) definition, whose objective is to minimize the more regrettable case system blockage proportion. Since it is hard to take care of this LP issue in commonsense time, a heuristic calculation is acquainted with select the transfer hubs for building the disjoint one-jump overlay ways, which enormously lessens the computational multifaceted nature of the LP calculation. Reproductions in light of a genuine ISP system and an engineered Internet topology demonstrate that our proposed calculation can diminish the system clog proportion significantly, and accomplish top notch overlay directing administration.
Handling Selfishness in Replica Allocation over a Mobile Ad-Hoc NetworkIJCERT
MANET is a collection of mobile devices that can communicate with each other without the use centralized administration. One of the interesting application of MANET is File Sharing. File Sharing in MANET is similar to that of the regular file sharing, what makes the difference is it allow user to access the data or memory of that nodes only which are connected to it. This File sharing many a times leads to Network Partitioning, i.e dividing a network into two different networks .Due to which the nodes may act selfishly. The selfishness of some of the nodes may lead in reduction of performance in terms of accessing data. The proposed system will use the SCF-tree technique for building a tree of Node which will share their data in terms of Replica, and as a result it detects the selfish node in the network. The replica insures that performance is not degraded.
OBD-II and Oxygen Sensor: Review the I.C Engine - Emissions related PerformanceIJCERT
Increased awareness regarding the adverse effects of pollutants from automobile exhaust gases has been the main driving force for implementation of more and more stringent legislation on automobile exhaust emissions in many Countries. On Board Diagnostic (OBD), regulations in the USA for light and medium duty vehicles (I. C. Engines) are introducing to implement the air quality standard. California and the Federal Government used a driving cycle to certify 1966 and newer models which referred to as either California Cycle or the Federal Test Procedure (FTP). The California Air Resource Board (CARB) and the objective to reduce hydrocarbon (HC) emission caused by malfunction of the vehicles emission control systems adopted the California code of Regulations (CCR) known as OBD – II. The diagnosis is based on the oxygen sensor response time that is the amount of time to complete a switch from rich to lean or lean to rich transition that gives the ability to control the engine at stochiometric Air Fuel ratio. Typical values of lean mean voltage and rich mean voltage are 300 to 600 mill volts respectively. For post-cat O2 sensor, in particular, voltage level checks and heater systems checked and done and the failure thresholds for the post O2 sensor, diagnostic must not be set at a point beyond the failure limit where the catalyst diagnostic is affected.
Speech recognition is the next big step that the technology needs to take for general users. An Automatic Speech Recognition (ASR) will play a major role in focusing new technology to users. Applications of ASR are speech to text conversion, voice input in aircraft, data entry, voice user interfaces such as voice dialing. Speech recognition involves extracting features from the input signal and classifying them to classes using pattern matching model. This can be done using feature extraction method. This paper involves a general study of automatic speech recognition and various methods to generate an ASR system. General techniques that can be used to implement an ASR includes artificial neural networks, Hidden Markov model, acoustic –phonetic approach
Prevention of Packet Hiding Methods In Selective Jamming AttackIJCERT
The sharing nature of wireless medium provides various challenging features among various set of users. It is very important in real world and it provides better transfer rate but authentication is ignored. The limitations of existing wired network are overcome by wireless network. These networks act as source for various types of jamming attacks. In analysis and detection of jamming attack various methods are available but sometime they fail. In case of external threat the analysis and reporting of jamming attack is very easy model but it is quite difficult in terms of internal threat model, these internal term uses the knowledge about network secrets and network protocols to launch various attacks with very low effort. Various cryptographic techniques are implemented to prevent these attacks. The main goal of this project is to prevent the information at the wireless physical layer and allowed the safe transmission among communicated nodes although the attacker is present.
An optimistic sector oriented approach to mitigate broadcast storm problem in...IAEME Publication
In mobile ad hoc networks (MANETs), due to frequent changes in topology there exist more
link breakages which lead to high rate of path failures and route discoveries, which cause an
increased routing control overhead. Thus, it is necessary to reduce the overhead of route discovery in
the design of routing protocols for MANETs. In a route discovery, broadcasting may be an
elementary and effective data dissemination mechanism, wherever a mobile node blindly
rebroadcasts the first received route request packets unless it has a route to the destination, and
therefore it causes the broadcast storm problem. This paper proposes an optimistic approach OpSOA
to mitigate the broadcasting storm problem and to scale back the communication overheads of
routing protocols by forming sectors within the network and finding the route to destination by two
sectors at a time. The simulation result shows that the proposed mechanism substantially reduces
route requests. Since the proposed protocol searches for the destination sector wise thereby reducing
network wide broadcast of routing requests, traffic, collision and contention. There by there can be
an increase in the packet delivery ratio and decrease in the average end-to-end delay
A Review on Geographical Location Based Energy Efficient Direction Restricted...IJRES Journal
Delay Tolerant Network (DTNs) is a wireless network that experiences frequent connectivity and due to mobility of nodes long duration partitions occurred during transmission of data. DTN has the main feature that there is not full path present from source to destination. In Delay Tolerant Network (DTN), traditional routing protocol for mobile Ad-hoc protocol to be ineffective to extend of message transmission between different nodes. Delay tolerant networks (DTNs) are used in many applications like in deep space communications, under water Acoustic Network, Sparsely Populated Areas Networks Etc. In such network a routing with minimum energy congumption is major issue. In this paper, we try to explore a routing issue in DTN. First energy requirement and routing with their corresponding countermeasures in DTN are explained. Moving nodes in DTN keep the updating of network as well energy at every stage. By using the geographical concept the location of each node is maintained by updating in topology. There are many routing protocols are available for routing purpose in DTN.
LOAD BALANCING AND PROVIDING SECURITY USING RSA IN WIRELESS SENSOR NETWORKSIJARIIT
This paper presents load balancing and provides security using RSA algorithm. This is brief introduction to handle the traffic on node. This represents the converge-casting protocol in wireless sensor networks. The protocol is localized and distributed, and adapts efficiently to vary traffic. Graphs are analyzed using NS-2 simulator, here end-to-end packet latency, packet delivery ratio, throughput are analyzed. This is done for 30 nodes in NS-2 simulation.
INCREASE THE LIFETIME OF WIRELESS SENSOR NETWORKS USING HIERARCHICAL CLUSTERI...ijwmn
Wireless sensor networks consist of hundreds or thousands of nodes with limited energy. Since the life time
of each sensor is equivalent to the battery life, the energy issue is considered as a major challenge.
Clustering has been proposed as a strategy to extend the lifetime of wireless sensor networks. Cluster size,
number of Cluster head per cluster and the selection of cluster head are considered as important factors in
clustering. In this research by studying LEACH algorithm and optimized algorithms of this protocol and by
evaluating the strengths and weaknesses, a new algorithm based on hierarchical clustering to increase the
lifetime of the sensor network is proposed. In this study, with a special mechanism the environment of
network is layered and the optimal number of cluster head in each layer is selected and then recruit for the
formation of clusters in the same layer by controlling the topology of the clusters is done independently.
Then the data is sent through the by cluster heads through the multi- stage to the main station. Simulation
results show that the above mentioned method increases the life time about 70% compared to the LEACH.
International Journal of Engineering Research and Applications (IJERA) aims to cover the latest outstanding developments in the field of all Engineering Technologies & science.
International Journal of Engineering Research and Applications (IJERA) is a team of researchers not publication services or private publications running the journals for monetary benefits, we are association of scientists and academia who focus only on supporting authors who want to publish their work. The articles published in our journal can be accessed online, all the articles will be archived for real time access.
Our journal system primarily aims to bring out the research talent and the works done by sciaentists, academia, engineers, practitioners, scholars, post graduate students of engineering and science. This journal aims to cover the scientific research in a broader sense and not publishing a niche area of research facilitating researchers from various verticals to publish their papers. It is also aimed to provide a platform for the researchers to publish in a shorter of time, enabling them to continue further All articles published are freely available to scientific researchers in the Government agencies,educators and the general public. We are taking serious efforts to promote our journal across the globe in various ways, we are sure that our journal will act as a scientific platform for all researchers to publish their works online.
MuMHR: Multi-path, Multi-hop Hierarchical RoutingM H
This document proposes a new routing protocol called MuMHR for wireless sensor networks. MuMHR aims to improve energy efficiency and robustness over LEACH in three ways: 1) By enabling nodes to select cluster heads based on the number of hops away to reduce transmission distances. 2) By using a back-off timer and multiple paths for transmissions to reduce setup overhead and add reliability. 3) By electing backup cluster heads to substitute when primary heads fail. The protocol operates in setup and data transfer phases, with the setup phase selecting cluster heads and forming clusters in an energy-efficient multi-hop manner.
The novel applications of sensor networks impose some requirements in wireless sensor network design. With the energy efficiency and lifetime awareness, the throughput and network delayalso required to support emerging applications of sensor networks. In this paper, we propose
throughput and network delay aware intra-cluster routing protocol. We introduce the back-up links in the intra-cluster communication path. The link throughput, communication delay, packet loss ratio, interference, residual energy and node distance are the considered factors in finding efficient path of data communication among the sensor nodes within the cluster. The
simulation result shows the higher throughput and lower average packet delay rate for the proposed routing protocol than the existing benchmarks. The proposed routing protocol also shows energy efficiency and lifetime awareness with better connectivity rate.
A cross layer optimized reliable multicast routing protocol in wireless mesh ...ijdpsjournal
The Optimal way to create a protocol in Wireless Mesh Networks
is to take into account a cross layer due
to the interference among wireless transmissions.
In this paper
,
w
e focus on designing and implementing
a
reliable
multicast protocol
called Me
sh Reliable Multicast Protocol (MRMP).
A
recovery tree
built
dynamically
which is joining with
the multicast routing tree.
U
sing the recovery tree
the packet losses are
repaired locally
.
This Cross layer
Technique
between network layer (
multicast routing)
and transport layer
(
reliability) using simulation
results
prove
the effectiveness
and optimization
of
cross layer
in WMNs
compare with the conventional layer
IMPLEMENTATION OF BIOLOGICAL ROUTING PROTOCOL IN TUNNEL WIRELESS SENSOR NETWO...ijwmn
The document describes a new biological routing protocol called Biological Tunnel Routing Protocol (BioTROP) for Tunnel Wireless Sensor Networks (TWSN). BioTROP uses concepts from ant colony behavior and optimal forwarding calculations to determine the best next hop neighbor for packet transmission. It was tested on a 7 node TelosB sensor network in a tunnel, where over 70% of transmitted data packets were successfully delivered to the base station. BioTROP employs a cross-layer design between the physical and network layers to select next hops based on metrics like signal strength, link quality, and remaining power from the physical layer. It consists of routing management and neighborhood management modules to determine optimal routes and maintain neighbor tables.
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
Effective Path Identification Protocol for Wireless Mesh NetworksIDES Editor
Wireless Mesh Networks (WMNs) have emerged as
a key technology for next-generation wireless networking.
Routing is a key factor for transfer of packets from source to
destination. SrcRR is widely used protocol for transferring
packets from source to destination. This protocol often uses
Dijkstra’s algorithm on its link state database to find the next
alternative path to the destination when ever the ETX metric
of the link changes.This is a time consuming process if the
ETX metric of the links are changing frequently. So this paper
eliminates the use of Dijkistra’s algorithm and uses the a
search operation for finding the best paths.
EFFICIENT REBROADCASTING USING TRUSTWORTHINESS OF NODE WITH NEIGHBOUR KNOWLED...ijiert bestjournal
Mobile Ad hoc network is an infrastructure less communication network with limited resources. To maintain virtual
infrastructure for communication broadcasting mechanisms is used. Due to lack of energy efficiency in Mobile Ad
hoc network, there is a need to develop an efficient broadcasting model which enhances energy efficiency. Also
nodes with malicious behaviour cause an internal threat that disobeys the standard and degrades the performance of
routing protocols. This paper introduced an enhanced rebroadcasting algorithm, where rebroadcasting decision for
next hop is immediate or delayed on the basis of trust value and energy level of particular node. This approach helps
to decrease number of rebroadcast, energy consumption and also enhances security. The decision is made with trust
value associated with node, their remaining energy and total number of uncovered nodes.
Coverage and Connectivity Aware Neural Network Based Energy Efficient Routing...graphhoc
There are many challenges when designing and deploying wireless sensor networks (WSNs). One of the key challenges is how to make full use of the limited energy to prolong the lifetime of the network, because energy is a valuable resource in WSNs. The status of energy consumption should be continuously monitored after network deployment. In this paper, we propose coverage and connectivity aware neural network based energy efficient routing in WSN with the objective of maximizing the network lifetime. In the proposed scheme, the problem is formulated as linear programming (LP) with coverage and connectivity aware constraints. Cluster head selection is proposed using adaptive learning in neural networks followed by coverage and connectivity aware routing with data transmission. The proposed scheme is compared with existing schemes with respect to the parameters such as number of alive nodes, packet delivery fraction, and node residual energy. The simulation results show that the proposed scheme can be used in wide area of applications in WSNs.
Tree Based Proactive Source Routing Protocol for MANETspaperpublications3
bstract: A mobile adhoc network (MANET) is a wireless communication network and the node that does not lie within the direct transmission range of each other depends on the intermediate nodes to forward data. Opportunistic data forwarding has not been widely utilized in mobile adhoc networks (MANETs) and the main reason is the lack of an efficient lightweight proactive routing scheme with strong source routing capability. PSR protocol facilitates opportunistic data forwarding in MANETs. In PSR, each node maintains a breadth-first search spanning tree of the network rooted at it-self. This information is periodically exchanged among neighboring nodes for updated network topology information. Here added a Mobile sink to reduce the overhead in case of number of child node increases and also to reduce the delay.
AN EFFICIENT ROUTING PROTOCOL FOR DELAY TOLERANT NETWORKS (DTNs)cscpconf
Delay-Tolerant Networks are those which lacks continuous communications among mobile
nodes . Distributed clustering scheme and cluster-based routing protocol are used for DelayTolerant
Mobile Networks (DTMNs). The basic idea is to distributive group mobile nodes with
similar mobility pattern into a cluster, which can then interchangeably share their resources for
overhead reduction and load balancing, aiming to achieve efficient and scalable routing in DTMN. Load balancing is carried out in two ways, Intra cluster load balancing and Inter cluster load balancing. The Convergence and stability become major challenges in distributed clustering in DTMN. An efficient routing protocol will be provided for the delay tolerant networks through which the stability of the network is maintained .Based on nodal contact probabilities, a set of functions including Sync(), Leave(), and Join() are devised for cluster formation and gateway selection. Finally, the gateway nodes exchange network information and perform routing
This document summarizes the results of a study investigating energy consumption in mobile ad hoc networks (MANETs). It analyzes how varying packet size affects several network performance metrics through simulations. The simulations show that as packet size increases, packet delivery ratio decreases and packet loss ratio increases, due to greater network congestion. Throughput initially increases with packet size but then decreases. Control overhead and average energy consumption both rise with larger packet sizes. Increasing packet size negatively impacts network reliability and energy efficiency. The document concludes that packet size is an important factor influencing the performance of data transmission in MANETs.
A Survey on Web Page Recommendation and Data PreprocessingIJCERT
In today’s era, as we all know internet technologies are growing rapidly. Along with this, instantly, Web page recommendations are also improving. The aim of a Web page recommender system is to predict the Web page or pages, which will be visited from a given Web-page of a website. Data preprocessing is one basic and essential part of Web page recommendation. Data preprocessing consists of cleanup and constructing data to organize for extracting pattern. In this paper, we discuss and focus on Web page Recommendation and role of data preprocessing in Web page recommendation, considering how data preprocessing is related to Web page recommendation.
Robust Resource Allocation in Relay Node Networks for Optimization ProcessIJCERT
Overlay steering has risen as a promising way to deal with enhances unwavering quality and effectiveness of the Internet. For one-jump overlay source steering, when a given essential way experiences the connection disappointment or execution debasement, the source can reroute the movement to the destination by means of a deliberately set transfer hub. Be that as it may, the over-substantial activity going through the same transfer hub may bring about incessant bundle misfortune and postponement jitter, which can corrupt the throughput and usage of the system. To defeat this issue, we propose a Load-Balanced One-jump Overlay Multipath Routing calculation (LB-OOMR), in which the activity is first part at the source edge hubs and afterward transmitted along numerous one-bounce overlay ways. So as to decide an ideal split proportion for the activity, we plan the issue as a direct programming (LP) definition, whose objective is to minimize the more regrettable case system blockage proportion. Since it is hard to take care of this LP issue in commonsense time, a heuristic calculation is acquainted with select the transfer hubs for building the disjoint one-jump overlay ways, which enormously lessens the computational multifaceted nature of the LP calculation. Reproductions in light of a genuine ISP system and an engineered Internet topology demonstrate that our proposed calculation can diminish the system clog proportion significantly, and accomplish top notch overlay directing administration.
Handling Selfishness in Replica Allocation over a Mobile Ad-Hoc NetworkIJCERT
MANET is a collection of mobile devices that can communicate with each other without the use centralized administration. One of the interesting application of MANET is File Sharing. File Sharing in MANET is similar to that of the regular file sharing, what makes the difference is it allow user to access the data or memory of that nodes only which are connected to it. This File sharing many a times leads to Network Partitioning, i.e dividing a network into two different networks .Due to which the nodes may act selfishly. The selfishness of some of the nodes may lead in reduction of performance in terms of accessing data. The proposed system will use the SCF-tree technique for building a tree of Node which will share their data in terms of Replica, and as a result it detects the selfish node in the network. The replica insures that performance is not degraded.
OBD-II and Oxygen Sensor: Review the I.C Engine - Emissions related PerformanceIJCERT
Increased awareness regarding the adverse effects of pollutants from automobile exhaust gases has been the main driving force for implementation of more and more stringent legislation on automobile exhaust emissions in many Countries. On Board Diagnostic (OBD), regulations in the USA for light and medium duty vehicles (I. C. Engines) are introducing to implement the air quality standard. California and the Federal Government used a driving cycle to certify 1966 and newer models which referred to as either California Cycle or the Federal Test Procedure (FTP). The California Air Resource Board (CARB) and the objective to reduce hydrocarbon (HC) emission caused by malfunction of the vehicles emission control systems adopted the California code of Regulations (CCR) known as OBD – II. The diagnosis is based on the oxygen sensor response time that is the amount of time to complete a switch from rich to lean or lean to rich transition that gives the ability to control the engine at stochiometric Air Fuel ratio. Typical values of lean mean voltage and rich mean voltage are 300 to 600 mill volts respectively. For post-cat O2 sensor, in particular, voltage level checks and heater systems checked and done and the failure thresholds for the post O2 sensor, diagnostic must not be set at a point beyond the failure limit where the catalyst diagnostic is affected.
Speech recognition is the next big step that the technology needs to take for general users. An Automatic Speech Recognition (ASR) will play a major role in focusing new technology to users. Applications of ASR are speech to text conversion, voice input in aircraft, data entry, voice user interfaces such as voice dialing. Speech recognition involves extracting features from the input signal and classifying them to classes using pattern matching model. This can be done using feature extraction method. This paper involves a general study of automatic speech recognition and various methods to generate an ASR system. General techniques that can be used to implement an ASR includes artificial neural networks, Hidden Markov model, acoustic –phonetic approach
Prevention of Packet Hiding Methods In Selective Jamming AttackIJCERT
The sharing nature of wireless medium provides various challenging features among various set of users. It is very important in real world and it provides better transfer rate but authentication is ignored. The limitations of existing wired network are overcome by wireless network. These networks act as source for various types of jamming attacks. In analysis and detection of jamming attack various methods are available but sometime they fail. In case of external threat the analysis and reporting of jamming attack is very easy model but it is quite difficult in terms of internal threat model, these internal term uses the knowledge about network secrets and network protocols to launch various attacks with very low effort. Various cryptographic techniques are implemented to prevent these attacks. The main goal of this project is to prevent the information at the wireless physical layer and allowed the safe transmission among communicated nodes although the attacker is present.
Cloud Partitioning of Load Balancing Using Round Robin ModelIJCERT
Abstract: The purpose of load balancing is to look up the performance of a cloud environment through an appropriate
circulation strategy. Good load balancing will construct cloud computing for more stability and efficiency. This paper
introduces a better round robin model for the public cloud based on the cloud partitioning concept with a switch mechanism
to choose different strategies for different situations. Load balancing is the process of giving out of workload among
different nodes or processor. It will introduces a enhanced approach for public cloud load distribution using screening and
game theory concept to increase the presentation of the system.
SecCloudPro: A Novel Secure Cloud Storage System for Auditing and DeduplicationIJCERT
In this paper, we show the trustworthiness evaluating and secure deduplication over cloud data utilizing imaginative secure frameworks .Usually cloud framework outsourced information at cloud storage is semi-trusted because of absence of security at cloud storage while putting away or sharing at cloud level because of weak cryptosystem information may be uncover or adjusted by the hackers keeping in mind the end goal to ensure clients information protection and security We propose novel progressed secure framework i.e SecCloudPro which empower the cloud framework secured and legitimate utilizing Verifier(TPA) benefit of Cloud Server. Additionally our framework performs data deduplication in a Secured way in requested to enhance the cloud Storage space too data transfer capacity i.e bandwidth.
Hard starting every initial stage: Study on Less Engine Pulling PowerIJCERT
Automobiles engine, it is a prime mover; and a machine in which power is applied to do work, often in the form of converting heat energy into mechanical work. We know that the power unit of an automobile is called I C engine. The power developed by the engine depends upon the calorific value of the fuel used. This value is equal to the total heat produced to combustion of hydrogen and carbon. Fuel injection pump (FIP), has to supply various quantities of fuel in accordance with the different engine load and in-line pumps, which correctly positioned connects the fuel supply from gallery. Diesel engines compress pure air during compression stroke and must have some means to force fuel into the combustion chamber with a pressure higher from the compression pressure. The injection nozzle atomizes the fuel very small droplets (3 to 30 microns) and delivers it to the combustion chamber. This achieved by small orifice.
GSM Based Device Controlling and Fault DetectionIJCERT
The mobile communication has expanded to a great extent such that it can be applied for controlling of electrical devices. These projects make use of this capability of mobile phone to control three electrical devices with some use of embedded technology which can be extended up to eight devices. Apart from controlling it also does the sensing of the devices. Thus a user can be able to know of the status of the devices and in addition to that the user get notified if any fault is detected. Here in the project controlling and sensing is done for three electrical devices only. According to the user need both of this can be expanded.
A Survey on: Sound Source Separation MethodsIJCERT
now a day’s multimedia databases are growing rapidly on large scale. For the effective management and exploration of large amount of music data the technology of singer identification is developed. With the help of this technology songs performed by particular singer can be clustered automatically. To improve the Performance of singer identification the technologies are emerged that can separate the singing voice from music accompaniment. One of the methods used for separating the singing voice from music accompaniment is non-negative matrix partial co factorization. This paper studies the different techniques for separation of singing voice from music accompaniment.
An Image representation using Compressive Sensing and Arithmetic Coding IJCERT
The demand for graphics and multimedia communication over intenet is growing day by day. Generally the coding efficiency achieved by CS measurements is below the widely used wavelet coding schemes (e.g., JPEG 2000). In the existing wavelet-based CS schemes, DWT is mainly applied for sparse representation and the correlation of DWT coefficients has not been fully exploited yet. To improve the coding efficiency, the statistics of DWT coefficients has been investigated. A novel CS-based image representation scheme has been proposed by considering the intra- and inter-similarity among DWT coefficients. Multi-scale DWT is first applied. The low- and high-frequency subbands of Multi-scale DWT are coded separately due to the fact that scaling coefficients capture most of the image energy. At the decoder side, two different recovery algorithms have been presented to exploit the correlation of scaling and wavelet coefficients well. In essence, the proposed CS-based coding method can be viewed as a hybrid compressed sensing schemes which gives better coding efficiency compared to other CS based coding methods.
Data Security Using Elliptic Curve CryptographyIJCERT
Cryptography technique is used to provide data security. In existing cryptography technique the key generation takes place randomly. Key generation require shared key. If shared key is access by unauthorized user then security becomes disoriented. Hence existing problems are alleviated to give more security to data. In proposed system a algorithm called as Elliptic Curve Cryptography is used. The ECC generates the key by using the point on the curve. The ECC is used for generating the key by using point on the curve and encryption and decryption operation takes place through curve. In the proposed system the encryption and key generation process takes place rapidly.
Efficient Multi Server Authentication and Hybrid Authentication MethodIJCERT
Password is used for authentication on many major client-server system, websites etc. Client and a server share a password using Password-authenticated key exchange to authenticate each other and establish a cryptographic key by exchanging generated exchanges. In this scenario, all the passwords are stored in a single server which will authenticate the client. If the server stopped working or compromised, for example, hacking or even insider attack, passwords stored in database will become publicly known. This system proposes that setting where multiple servers which are used to, so that the password can be split in these servers authenticate client and if one server is compromised, the attacker still cannot be able to view the client’s information from the compromised server. This system uses the Advance encryption standard algorithm encryption and for key exchange and some formulae to store the password in multiple server. This system also has the hybrid authentication as another phase to make it more secure and efficient. In the given authentication schema we also use SMS integration API for two step verification.
Online Payment System using Steganography and Visual CryptographyIJCERT
In recent time there is rapid growth in E-Commerce market. Major concerns for customers in online shopping are debit card or credit card fraud and personal information security. Identity theft and phishing are common threats of online shopping. Phishing is a method of stealing personal confidential information such as username, passwords and credit card details from victims. It is a social engineering technique used to deceive users. In this paper new method is proposed that uses text based steganography and visual cryptography. It represents new approach which will provide limited information for fund transfer. This method secures the customer's data and increases customer's confidence and prevents identity theft.
Review of Various Image Processing Techniques for Currency Note AuthenticationIJCERT
In cash transactions, the biggest challenge faced is counterfeit notes. This problem is only expanding due to the technology available and many fraud cases have been uncovered. Manual detection of counterfeit notes is time consuming and inefficient and hence the need of automated counterfeit detection has raised. To tackle this problem, we studied existing systems using Matlab, which used different methods to detect fake notes.
The document summarizes a paper that proposes a contact information compression algorithm to improve scalability and delivery in delay tolerant networks. The algorithm compresses contact information using three collective methods and dynamically estimates shortest paths. It is shown to improve scalability and delivery during multipath multicasting, which concurrently delivers information to multiple targets in a single transmission. The algorithm aims to address challenges of information aggregation, compression in time-space domains while maintaining routing information.
Mobile environment pretense a number of novel
theoretical and optimization issues such as position, operation
and following in that a lot of requests rely on them for
desirable information. The precedent works are sprinkled
across the entire network layer: from the medium of physical
to link layer to routing and then application layer. In this
invention, we present outline solutions in Medium Access
Control (MAC), data distribution, coverage resolve issues
under mobile ad-hoc network environment based on
congestion control technique using Transmission Control
Protocol (TCP). In mobile ad-hoc network issues can arise
such as link disconnections, channel contention and recurrent
path loss. To resolve this issue, we propose a Cross Layer
based Hybrid fuzzy ad-hoc rate based Congestion Control
(CLHCC) approach to maximize network performance. Based
on the destination report it regulates the speed of data flow to
control data loss by monitoring the present network status
and transmits this report to the source as advice. The source
adjusts the sending flow rate as per the advice. This is
monitored by channel usage, ultimate delay, short term
throughput.
IRJET-Mobility Aware Refined Counter Based Broadcasting Model of MANETIRJET Journal
Manjusha Deshmukh,Ratnadeep Deshmukh, Sangeeta Kakarwal, "Mobility Aware Refined Counter Based Broadcasting Model of MANET", International Research Journal of Engineering and Technology (IRJET), Vol2,issue-01 March 2015. p-ISSN:2395-0056, e-ISSN:2395-0072. www.irjet.net ,published by Fast Track Publications
Abstract
The MANET is a special type of wireles mobile network in which mobile hosts can communicate without any aid of established infrastructure. Broadcast or flooding is a dissemination technique oparamount importance in mobile ad-hoc networks MANETs are generating lots of interest due to their dynamic topology and decentralized administration Due to the mobility of nodes there are many problem occurred during the packet transmission. Basic routing protocols such as Ad hoc on Demand Distance Vecto(AODV), Dynamic source routing (DSR) could lead toissues such as Broadcast Storm Problem, Large power consumption, link failure due to mobility. Counter based approaches inhibit a node from broadcasting a packet based on number of copies of the broadcaspacket received by the node within a random accessdelay time. It relies on the threshold value to decide whether or not to forward broadcast packet. In this paper, model is proposed which refines the counter based threshold based on network density and the mobility of nodes. The paper refined the sparse threshold as low sparse threshold and high sparse threshold and dense threshold as low dense threshold and high dense threshold.
Data-Centric Routing Protocols in Wireless Sensor Network: A surveyAli Habeeb
This document summarizes several data-centric routing protocols for wireless sensor networks. It begins by outlining the challenges of routing in WSNs, including energy consumption, scalability, addressing, robustness, topology, and application-specific needs. It then describes several data-centric routing protocols, including flooding, directed flooding, constrained flooding, gossiping, fuzzy gossiping, location-based gossiping, and others. It notes advantages and disadvantages of these protocols for efficiently routing data in wireless sensor networks while minimizing energy consumption.
VHFRP: Virtual Hexagonal Frame Routing Protocol for Wireless Sensor NetworkIJCNCJournal
As physical and digital worlds become increasingly intertwined, wireless sensor networks are becoming an indispensable technology. A mobile sink may be required for some applications in the sensor field, where incomplete and/or delayed data delivery can lead to inappropriate conclusions. Therefore, latency and packet delivery ratios must be of high quality. In most existing schemes, mobile sinks are used to extend network lifetimes. By partitioning the sensor field into k equal sized frames, the proposed scheme creates a virtual hexagonal structure. Each frame header (FH) is linked together through the creation of a virtual backbone network. Frame headers are assigned to nodes near the centre of each frame. The virtual backbone network enables data collection from members of the frame and delivers it to the mobile sink. The proposed Virtual Hexagonal Frame Routing Protocol (VHFRP) improves throughput by 25%, energy consumption by 30% and delay by 9% as compared with static sink scenario.
VHFRP: VIRTUAL HEXAGONAL FRAME ROUTING PROTOCOL FOR WIRELESS SENSOR NETWORKIJCNCJournal
As physical and digital worlds become increasingly intertwined, wireless sensor networks are becoming an
indispensable technology. A mobile sink may be required for some applications in the sensor field, where
incomplete and/or delayed data delivery can lead to inappropriate conclusions. Therefore, latency and
packet delivery ratios must be of high quality. In most existing schemes, mobile sinks are used to extend
network lifetimes. By partitioning the sensor field into k equal sized frames, the proposed scheme creates a
virtual hexagonal structure. Each frame header (FH) is linked together through the creation of a virtual
backbone network. Frame headers are assigned to nodes near the centre of each frame. The virtual
backbone network enables data collection from members of the frame and delivers it to the mobile sink.
The proposed Virtual Hexagonal Frame Routing Protocol (VHFRP) improves throughput by 25%, energy
consumption by 30% and delay by 9% as compared with static sink scenario.
Abstract—Geographic routing also called as Geo routing is a routing principle which relies on the Geographic position information. Geographic routing is the most commonly used routing for MANETs. In Geographic routing each node should be aware of its neighbor’s location to maintain the local topology accuracy. Hence, each node should update its location information through a message called beacon. Existing mechanisms invoke periodic beacon update scheme which consumes the network resources such as energy and bandwidth specifically when the network traffic is high, it creates packet loss in the network and it leads to retransmission of data packet causing additional delay and energy consumption. In this work, adaptive position update is proposed which dynamically adjusts the beacon updation frequency according to the varying network conditions.APU makes use of mobility prediction rule and on demand learning rule for beacon updation.
Destination Aware APU Strategy for Geographic Routing in MANETEditor IJCATR
In this paper, we have explained the Enhanced Adaptive Position Update strategy for geographic routing in mobile ad hoc
network In Adaptive Position Update strategy, there are two techniques: Mobility prediction rule and On-demand learning rule. Proposed
system is based on the destination aware routing in which path to transfer the data over the network is based on the distance from highly
stable node to the destination node. Results of the proposed system are compared with Periodic Beaconing on the basis of packet delivery
ratio, beacon overhead, energy consumption. Experiment results show a high improvement in results on the parameters energy
consumption, packet delivery ratio and beacon overhead. Proposed work is implemented on the NS2 (Network Simulator) Environment
to perform experiments.
International Journal of Engineering Research and DevelopmentIJERD Editor
Electrical, Electronics and Computer Engineering,
Information Engineering and Technology,
Mechanical, Industrial and Manufacturing Engineering,
Automation and Mechatronics Engineering,
Material and Chemical Engineering,
Civil and Architecture Engineering,
Biotechnology and Bio Engineering,
Environmental Engineering,
Petroleum and Mining Engineering,
Marine and Agriculture engineering,
Aerospace Engineering.
A NOVEL HYBRID OPPORTUNISTIC SCALABLE ENERGY EFFICIENT ROUTING DESIGN FOR LOW...IJCNCJournal
Opportunistic Routing (OR) scheme increases the transmission reliability despite the lossy wireless radio links by exploiting the broadcast nature of the wireless medium. However, OR schemes in low power Wireless Sensor Network (WSN) leads to energy drain in constrained sensor nodes due to constant
overhearing, periodic beaconing for Neighbourhood Management (NM) and increase in packet header length to append priority wise sorted Forwarding Candidates Set (FCS) prior to data transmission. The timer-based coordination mechanism incurs the least overhead to coordinate among the FCS that has successfully received the data packet for relaying the data in a multi-hop manner. This timer-based mechanism suffers from duplicate transmissions if the FCS is either not carefully selected or coordinated. The focus of this work is to propose a hybrid opportunistic energy efficient routing design for large scale, low power and lossy WSN. This design avoids periodic 'hello' beacons for NM, limits constant overhearing and increase in packet header length. There are two modes of operation i) opportunistic ii) unicast mode. The sender node adopts opportunistic forwarding for its initial data packet transmission and instead of pre-computing the FCS, it is dynamically computed in a completely distributed manner. The
eligible nodes to be part of FCS will be neighbour nodes at lower corona level than the sender with respect to the sink and remaining energy above the minimum threshold. The nodes part of FCS based on crosslayered multi-metrics and fuzzy decision logic determines its priority level to compute Dynamic Holding
Delay (DHD) for effective timer coordination. The differentiated back off implementation along with DHD enables the higher priority candidate that had received data packet to forward the packet first and facilitates others to cancel its timer upon overhearing. The sender node switches to unicast mode of
forwarding for successive transmissions by choosing the forwarding node with maximum trust value as it
denotes the stability of the temporally varying link with respect to the forwarder. The sender node will revert to opportunistic mode to increase transmission reliability in case of link-level transmission error or no trustworthy forwarders. Simulation results in NS2 show significant increase in Packet Delivery Ratio (PDR),decrease in both average energy consumption per node and Normalized Energy Consumption (NEC) per packet in comparison with existing protocols.
Auction Game Theory Based Adaptive Position Update Strategy for Geographic Ro...IJSRD
The Auction game based Adaptive Position Update strategy for geographic routing, which dynamically adjusts the frequency of position updates based on the mobility dynamics of the nodes and the forwarding patterns in the network. Adaptive position update is based on three simple principles: first principle is nodes whose movements are harder to predict update their positions more frequently (and vice versa), then the second principle is nodes closer to forwarding paths update their positions more frequently (and vice versa) and last principle is Forwarding nodes are selected based on distance and residual energy with bidding among the neighbors. Several experimental analyses, which is validated by NS2 simulations of a well-known geographic routing protocol, Greedy Perimeter Stateless Routing Protocol (GPSR), shows that game based Adaptive Position Update strategy for geographic routing can significantly improve the packet delivery ratio and improve the routing performance in terms of throughput in comparison with periodic beaconing and other recently proposed updating schemes. Finally give a better result in throughput and packet delivery ration by incurring a relatively smaller delay in delivering the packets. As the no. of nodes increases, this results in better packet delivery ratio of around 98%. The tradeoff between packet delivery ratio and Routing Over Head is slightly increased, The benefits of our work further confirmed by undertaking evaluations in realistic network scenarios, which account for localization error, realistic radio propagation, and sparse network.
Auction Game Theory Based Adaptive Position Update Strategy for Geographic Ro...IJSRD
The Auction game based Adaptive Position Update strategy for geographic routing, which dynamically adjusts the frequency of position updates based on the mobility dynamics of the nodes and the forwarding patterns in the network. Adaptive position update is based on three simple principles: first principle is nodes whose movements are harder to predict update their positions more frequently (and vice versa), then the second principle is nodes closer to forwarding paths update their positions more frequently (and vice versa) and last principle is Forwarding nodes are selected based on distance and residual energy with bidding among the neighbors. Several experimental analyses, which is validated by NS2 simulations of a well-known geographic routing protocol, Greedy Perimeter Stateless Routing Protocol (GPSR), shows that game based Adaptive Position Update strategy for geographic routing can significantly improve the packet delivery ratio and improve the routing performance in terms of throughput in comparison with periodic beaconing and other recently proposed updating schemes. Finally give a better result in throughput and packet delivery ration by incurring a relatively smaller delay in delivering the packets. As the no. of nodes increases, this results in better packet delivery ratio of around 98%. The tradeoff between packet delivery ratio and Routing Over Head is slightly increased, The benefits of our work further confirmed by undertaking evaluations in realistic network scenarios, which account for localization error, realistic radio propagation, and sparse network.
Location-aware hybrid microscopic routing scheme for mobile opportunistic net...IAESIJAI
Mobile opportunistic networks (MON) have been used for provisioning delaytolerant applications. In MON the device communicates with each other with
no assured end-to-end paths from source and destination because of frequent
topology changes, node mobility, low density, and intermittent connectivity.
In MON the device battery drains very fast for performing activities such as
scanning, transceiver, and other computational processes, impacting the
overall performance thus, designing energy-efficient routing is a challenging
task. The routing employs a store-carry-and-forward mechanism for packet
communication, where the packet is composed of time-to-live (TTL) and is
kept in buffer till the opportunity arises. In improving delivery ratio message
replication has been adopted; however, induces high network congestion.
Here we present a location-aware hybrid microscopic routing (LAHMR)
scheme for MON. The LAHMR provides an effective packet transmission
scheme with location awareness and high reliability by limiting unnecessary
packets being circulated in the network. Experiment outcome shows the
LAHMR scheme achieves a much better delivery ratio with less delay, and
also reduces the number of a forwarder for transmitting a packet, aiding in the
reduction of network overhead concerning recent routing method namely the
social-aware reliable forwarding (SCARF) technique.
The document discusses performance exploration of quality of service (QoS) parameters in mobile ad hoc networks (MANETs). It contains 6 figures analyzing how different QoS parameters are affected by increasing the reporting rate of data packets in the MANET. Figure 2 shows that packet delivery ratio decreases as reporting rate increases due to congestion. Figure 3 shows that packet loss ratio increases with higher reporting rates. Figure 4 indicates that throughput initially increases then decreases with reporting rate. Control overheads and average energy consumption shown in Figures 5 and 6 also are affected by varying the reporting rate in the MANET. The document analyzes how the reporting rate impacts key QoS metrics during data transmission in a MANET.
Dvr based hybrid routing protocols in mobile ad-hoc network application and c...eSAT Publishing House
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
A scalable and power efficient solution for routing in mobile ad hoc network ...ijmnct
This document summarizes a research paper that proposes a scalable and power-efficient routing solution for mobile ad hoc networks (MANETs). The paper describes a cluster-based MANET architecture and develops a graph theoretic routing algorithm that finds paths from source to destination nodes using routes with minimum cumulative degree. Simulation results show that the algorithm provides efficient routing paths even as the number of nodes increases, and uses multi-hop connectivity to transmit packets using minimum power irrespective of the number of nodes in the network. The algorithm is shown to be scalable and power efficient compared to other routing methods.
This document proposes a secured-bandwidth reservation distance vector routing protocol for mobile ad hoc networks (MANETs). It aims to improve quality of service (QoS) parameters like bandwidth reservation while providing security. The protocol is an extension of the Destination Sequence Distance Vector Routing Protocol (DSDV) that additionally reserves bandwidth along routing paths and includes nodes' bandwidth information in routing table updates. It uses an intruder detection method and secure key agreement between source and destination nodes using RSA encryption to authenticate nodes and securely transmit data. The protocol is evaluated through network simulations which show it can authorize nodes, authenticate nodes, ensure non-repudiation and protect message integrity.
Throughput Maximization using Spatial Reusability in Multi Hop Wireless Networkijtsrd
Energy is a valuable resource in wireless networks. For many multi hop networking scenarios, nodes require power for performing their operation, so requiring capable power management to make certain connectivity across the network. Though when wireless networks are attached outside power source due to obstruction between lively links the network may demand excessive energy per unit time Power due to this the overall performance is reduced. Since network life time or network capacity is depend on the power efficiency, many efforts to study energy efficient networks in the wireless network community. In multi hop wireless networks well organized routing algorithms are significant for network performance. We dispute that by carefully considering spatial reusability of the wireless communication media, we can reduce the overhead in multi hop wireless networks. To support our argument, propose Broadcast Tree Construction BTC and compare them with existing routing and multi path routing protocols, respectively. Our estimate outcome shows that proposed protocols significantly improve the end to end throughput compared with existing protocols. We also introduce the sleep scheduling approach for energy consumption and hybrid cryptography for security of data that can be prevent the data leakage and jammer attacks. Twinkal P. Dudhagawali | Prof. L. K. Gautam | Prof. V. P. Vaidya ""Throughput Maximization using Spatial Reusability in Multi Hop Wireless Network"" Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-3 | Issue-3 , April 2019, URL: https://www.ijtsrd.com/papers/ijtsrd23489.pdf
Paper URL: https://www.ijtsrd.com/engineering/information-technology/23489/throughput-maximization-using-spatial-reusability-in-multi-hop-wireless-network/twinkal-p-dudhagawali
Abstract— A MANETs is a self-configuring network is a collection of mobile hosts that are connected via a wireless link. Opportunistic data forwarding has drawn much attention in the research community of multihop wireless networks. Opportunistic data forwarding is the lack of an efficient, lightweight proactive routing scheme with strong source routing capability. In this project proposed to a lightweight proactive source routing (PSR) protocol. PSR can be maintained at different network topology information than distance vector (DV), link state (LS), optimized link State routing (OLSR), then reactive source routing [e.g., dynamic source routing (DSR)]. In this project concentrate on reducing the overhead at the base line protocols, then testing to the better data transportation. Network Simulator (NS-2) help in testing and implementing to this project for effectively reduced to the overhead in the data transportation.
Shortest path algorithm for data transmission in wireless ad hoc sensor networksijasuc
Wireless sensor networks determine probable in military, environments, health and commercial
applications. The process of transferring of information from a remote sensor node to other nodes in a
network holds importance for such applications. Various constraints such as limited computation, storage
and power makes the process of transferring of information routing interesting and has opened new arenas
for researchers. The fundamental problem in sensor networks states the significance and routing of
information through a real path as path length decides some basic performance parameters for sensor
networks. This paper strongly focuses on a shortest path algorithm for wireless adhoc networks. The
simulations are performed on NS2 and the results obtained discuss the role of transferring of information
through a shortest path.
Similar to Consistent Data Release in MANET Using Light Weight Verification Algorithm with High Node Mobility (20)
Parametric Optimization of Rectangular Beam Type Load Cell Using Taguchi MethodIJCERT
In this work, Rectangular beam type load cell is considered for stress and strain analysis by using finite element method. The stress analysis is carried out to minimize the weight of Rectangular beam- type load cell without exceeding allowable stress. The intention of the work is to create the geometry of Rectangular beam-type load cell to find out the optimum solution. FEM software HyperWorks11.0.0.39 is using for parametric optimization of Rectangular beam type load cell. If the stress value is within the permissible range, then certain dimensions will be modified to reduce the amount of material needed. The procedure will be repeated until design changes satisfying all the criteria. Experimental verification will be carried out by photo-elasticity technique with the help of suitable instrumentation like Polariscope. Using Photo-elasticity technique, results are crosschecked which gives results very close to FEM technique. Experimental results will be compared with FEM results. With the aid of these tools the designer can develop and modify the design parameters from initial design stage to finalize basic geometry of load cell.
Software Engineering Domain Knowledge to Identify Duplicate Bug ReportsIJCERT
This document summarizes a research paper that proposes a technique to improve the detection of duplicate bug reports using contextual information extracted from software engineering literature. It describes extracting word lists from software engineering textbooks and project documentation to measure contextual features of bug reports. The technique was evaluated on real bug report datasets and showed potential to significantly reduce manual effort in contextual bug deduplication while maintaining accuracy. Key findings indicate that leveraging domain knowledge from software engineering texts can help automate and enhance the identification of duplicate bug reports.
Multiple Encryption using ECC and Its Time Complexity AnalysisIJCERT
Rapid growth of information technology in present era, secure communication, strong data encryption technique and trusted third party are considered to be major topics of study. Robust encryption algorithm development to secure sensitive data is of great significance among researchers at present. The conventional methods of encryption used as of today may not sufficient and therefore new ideas for the purpose are to be design, analyze and need to be fit into the existing system of security to provide protection of our data from unauthorized access. An effective encryption/ decryption algorithm design to enhance data security is a challenging task while computation, complexity, robustness etc. are concerned. The multiple encryption technique is a process of applying encryption over a single encryption process in a number of iteration. Elliptic Curve Cryptography (ECC) is well known and well accepted cryptographic algorithm and used in many application as of today. In this paper, we discuss multiple encryptions and analyze the computation overhead in the process and study the feasibility of practical application. In the process we use ECC as a multiple-ECC algorithm and try to analyze degree of security, encryption/decryption computation time and complexity of the algorithm. Performance measure of the algorithm is evaluated by analyzing encryption time as well as decryption time in single ECC as well as multiple-ECC are compared with the help of various examples.
Data Trend Analysis by Assigning Polynomial Function For Given Data SetIJCERT
This paper aims at explaining the method of creating a polynomial equation out of the given data set which can be used as a representation of the data itself and can be used to run aggregation against itself to find the results. This approach uses least-squares technique to construct a model of data and fit to a polynomial. Differential calculus technique is used on this equation to generate the aggregated results that represents the original data set.
A collection of mobile nodes is known as ad-hoc network in which wireless communication network is used to connect these mobile nodes. A major requirement on the MANET is to provide unidentifiability and unlinkability for mobile nodes During the last few decades, continuous progresses in wireless communications have opened new research fields in computer networking, goal of extending data networks connectivity to environments where wired solutions are impracticable. Among these, vehicular traffic is attracting a increasing attention from both academic and industry, due to the amount and importance of the related applications, ranging from road safety to traffic control, up to mobile entertainment. Vehicular Ad-hoc Network(VANETs) are self-organized networks built up from moving vehicles, and are part of the broader class of Mobile Ad-hoc Net- works(MANETs). Because of their peculiar characteristics, VANETs require the definition of specific networking techniques, whose feasibility and performance are usually tested by means of simulation. One of the main challenges posed by VANETs simulations is the faithful characterization of vehicular mobility at both macroscopic and microscopic levels, leads to realistic non-uniform distributions of cars and velocity, and unique connectivity dynamics. There are various secure routing protocols have been proposed, but the requirement is not satisfied. The existing protocols are unguarded to the attacks of fake routing packets. Simulation results have demonstrated the effectiveness of the proposed AODV protocol with improved performance as compared to the existing protocols.
Intelligent Device TO Device Communication Using IoTIJCERT
Internet is becoming the most intrinsic part of the human life. There are many users of the internet but the devices will be the main users in the Internet of Things (IoT). These devices communicate with each other efficiently and gather the information to transfer the data to particular device. The quality of this information depends on how smart the devices are. IoT coverage is very wide and consists of the things or devices connected in network like camera, android phones, sensors etc. Once all these devices are connected with each other, they are capable of processing smartly and satisfying basic needs of environment. Thus the communication between the devices is achieved using various technologies and devices.
Secure Routing for MANET in Adversarial EnvironmentIJCERT
Collection of mobile nodes is known as ad-hoc network in which wireless communication is used to connect these mobile nodes. A major requirement on the MANET is to provide unidentifiability and unlinkability for mobile nodes. There are various secure routing protocols have been proposed, but the requirement is not satisfied. The existing protocols are unguarded to the attacks of fake routing packets or denial-of-service broadcasting, even the node identities are protected by pseudonyms. We propose a new secure routing protocol which provides anonymity named as authenticated anonymous secure routing (AASR), to satisfy the requirement of mobile networks and defend the attacks. The route request packets are authenticated by a group signature and public key infrastructure, to defend the potential attacks without exposing the node identities. The cocept of key-encrypted onion routing which provides a route secret verification message, to prevent intermediate nodes from inferring a real destination. Simulation results have demonstrated the effectiveness of the proposed AASR protocol with improved performance as compared to the existing protocols.
Real Time Detection System of Driver FatigueIJCERT
The leading cause of vehicle crashes and accidents is the driver distraction. With the rapid development of motorization, driver fatigue has become a very serious traffic problem. Reasons for traffic accidents are driving after alcohol consumption, driving at night, driving without taking rest, aging, sleepiness, and fatigue occurred due to continuous driving, long working hours and night shifts. So to reduce rate of accidents due to above reasons, is aim of this project. This paper presents a method for detection of early signs of fatigue using feature extraction, Haar classifier and delivering of information and whereabouts of the driver to the emergency contact numbers.
This document does not contain any substantive information to summarize in 3 sentences or less. It only provides a generic instruction to visit an unspecified website for more information and does not include any details about the topic or content being referenced.
A System for Denial of Service Attack Detection Based On Multivariate Corelat...IJCERT
1. The document describes a system for detecting denial of service (DoS) attacks based on multivariate correlation analysis. It uses triangle area maps to obtain correlation information between IP addresses in network traffic.
2. The system first extracts features from network traffic samples, then performs multivariate correlation analysis to characterize legitimate traffic patterns. It generates normal profiles based on these patterns to identify anomalies indicative of attacks.
3. The system was tested on the KDD Cup 99 dataset and was able to detect DoS attacks with 94.2% accuracy, outperforming other state-of-the-art techniques. It can identify both known and unknown attack patterns.
MANETs (Mobile Ad hoc Network) is a self-governing system in which different mobile nodes are connected by wireless links. MANETs comprise of mobile nodes that are independent for moving in and out over the network. Nodes are the devices or systems that is laptops, mobile phone etc. those are participating in the network. These nodes can operate as router/host or both simultaneously. These nodes can form uninformed topologies as per their connectivity among nodes over the network. Security in MANETs is the prime anxiety for the fundamental working of network. MANETs frequently will be ill with security threats because of it having features like altering its topology dynamically, open medium, lack of central management & monitoring, cooperative algorithms and no apparent security mechanism. These factors draw an attention for the MANETs against the security intimidation. In this paper we have studied about security attack in MANET and its consequences, proposed technique for black hole detection is hybrid in nature which combines the benefit of proactive and reactive protocol and proposed technique is compared with AODV.
An Enhanced Predictive Proportion using TMP Algorithm in WSN NavigationIJCERT
visit http://www.ijcert.org for more research journals it offers discount for Indian Research scholars
IJCERT Standard on-line Journal
ISSN(Online):2349-7084,(An ISO 9001:2008 Certified Journal)
iso nicir csir
IJCERT (ISSN 2349–7084 (Online)) is approved by National Science Library (NSL), National Institute of Science Communication And Information Resources (NISCAIR), Council of Scientific and Industrial Research, New Delhi, India.
Ontology Based PMSE with Manifold PreferenceIJCERT
International journal from http://www.ijcert.org
IJCERT Standard on-line Journal
ISSN(Online):2349-7084,(An ISO 9001:2008 Certified Journal)
iso nicir csir
IJCERT (ISSN 2349–7084 (Online)) is approved by National Science Library (NSL), National Institute of Science Communication And Information Resources (NISCAIR), Council of Scientific and Industrial Research, New Delhi, India.
Green Computing: A Methodology of Saving Energy by Resource Virtualization.IJCERT
This document discusses green computing and methods for saving energy through resource virtualization. It begins with an abstract that introduces green computing and its goal of reducing energy consumption and environmental impact. The introduction provides more details on cloud computing and how green computing aims to make data center services more energy efficient. The document then discusses various energy saving approaches of green computing like virtualization, cloud computing, and N-computing systems. It also discusses challenges and the future of green computing, concluding that more energy can be saved through continued development and use of virtualization and other green computing methodologies.
A SYSTEMATIC RISK ASSESSMENT APPROACH FOR SECURING THE SMART IRRIGATION SYSTEMSIJNSA Journal
The smart irrigation system represents an innovative approach to optimize water usage in agricultural and landscaping practices. The integration of cutting-edge technologies, including sensors, actuators, and data analysis, empowers this system to provide accurate monitoring and control of irrigation processes by leveraging real-time environmental conditions. The main objective of a smart irrigation system is to optimize water efficiency, minimize expenses, and foster the adoption of sustainable water management methods. This paper conducts a systematic risk assessment by exploring the key components/assets and their functionalities in the smart irrigation system. The crucial role of sensors in gathering data on soil moisture, weather patterns, and plant well-being is emphasized in this system. These sensors enable intelligent decision-making in irrigation scheduling and water distribution, leading to enhanced water efficiency and sustainable water management practices. Actuators enable automated control of irrigation devices, ensuring precise and targeted water delivery to plants. Additionally, the paper addresses the potential threat and vulnerabilities associated with smart irrigation systems. It discusses limitations of the system, such as power constraints and computational capabilities, and calculates the potential security risks. The paper suggests possible risk treatment methods for effective secure system operation. In conclusion, the paper emphasizes the significant benefits of implementing smart irrigation systems, including improved water conservation, increased crop yield, and reduced environmental impact. Additionally, based on the security analysis conducted, the paper recommends the implementation of countermeasures and security approaches to address vulnerabilities and ensure the integrity and reliability of the system. By incorporating these measures, smart irrigation technology can revolutionize water management practices in agriculture, promoting sustainability, resource efficiency, and safeguarding against potential security threats.
ACEP Magazine edition 4th launched on 05.06.2024Rahul
This document provides information about the third edition of the magazine "Sthapatya" published by the Association of Civil Engineers (Practicing) Aurangabad. It includes messages from current and past presidents of ACEP, memories and photos from past ACEP events, information on life time achievement awards given by ACEP, and a technical article on concrete maintenance, repairs and strengthening. The document highlights activities of ACEP and provides a technical educational article for members.
Presentation of IEEE Slovenia CIS (Computational Intelligence Society) Chapte...University of Maribor
Slides from talk presenting:
Aleš Zamuda: Presentation of IEEE Slovenia CIS (Computational Intelligence Society) Chapter and Networking.
Presentation at IcETRAN 2024 session:
"Inter-Society Networking Panel GRSS/MTT-S/CIS
Panel Session: Promoting Connection and Cooperation"
IEEE Slovenia GRSS
IEEE Serbia and Montenegro MTT-S
IEEE Slovenia CIS
11TH INTERNATIONAL CONFERENCE ON ELECTRICAL, ELECTRONIC AND COMPUTING ENGINEERING
3-6 June 2024, Niš, Serbia
Low power architecture of logic gates using adiabatic techniquesnooriasukmaningtyas
The growing significance of portable systems to limit power consumption in ultra-large-scale-integration chips of very high density, has recently led to rapid and inventive progresses in low-power design. The most effective technique is adiabatic logic circuit design in energy-efficient hardware. This paper presents two adiabatic approaches for the design of low power circuits, modified positive feedback adiabatic logic (modified PFAL) and the other is direct current diode based positive feedback adiabatic logic (DC-DB PFAL). Logic gates are the preliminary components in any digital circuit design. By improving the performance of basic gates, one can improvise the whole system performance. In this paper proposed circuit design of the low power architecture of OR/NOR, AND/NAND, and XOR/XNOR gates are presented using the said approaches and their results are analyzed for powerdissipation, delay, power-delay-product and rise time and compared with the other adiabatic techniques along with the conventional complementary metal oxide semiconductor (CMOS) designs reported in the literature. It has been found that the designs with DC-DB PFAL technique outperform with the percentage improvement of 65% for NOR gate and 7% for NAND gate and 34% for XNOR gate over the modified PFAL techniques at 10 MHz respectively.
Using recycled concrete aggregates (RCA) for pavements is crucial to achieving sustainability. Implementing RCA for new pavement can minimize carbon footprint, conserve natural resources, reduce harmful emissions, and lower life cycle costs. Compared to natural aggregate (NA), RCA pavement has fewer comprehensive studies and sustainability assessments.
Advanced control scheme of doubly fed induction generator for wind turbine us...IJECEIAES
This paper describes a speed control device for generating electrical energy on an electricity network based on the doubly fed induction generator (DFIG) used for wind power conversion systems. At first, a double-fed induction generator model was constructed. A control law is formulated to govern the flow of energy between the stator of a DFIG and the energy network using three types of controllers: proportional integral (PI), sliding mode controller (SMC) and second order sliding mode controller (SOSMC). Their different results in terms of power reference tracking, reaction to unexpected speed fluctuations, sensitivity to perturbations, and resilience against machine parameter alterations are compared. MATLAB/Simulink was used to conduct the simulations for the preceding study. Multiple simulations have shown very satisfying results, and the investigations demonstrate the efficacy and power-enhancing capabilities of the suggested control system.
Embedded machine learning-based road conditions and driving behavior monitoringIJECEIAES
Car accident rates have increased in recent years, resulting in losses in human lives, properties, and other financial costs. An embedded machine learning-based system is developed to address this critical issue. The system can monitor road conditions, detect driving patterns, and identify aggressive driving behaviors. The system is based on neural networks trained on a comprehensive dataset of driving events, driving styles, and road conditions. The system effectively detects potential risks and helps mitigate the frequency and impact of accidents. The primary goal is to ensure the safety of drivers and vehicles. Collecting data involved gathering information on three key road events: normal street and normal drive, speed bumps, circular yellow speed bumps, and three aggressive driving actions: sudden start, sudden stop, and sudden entry. The gathered data is processed and analyzed using a machine learning system designed for limited power and memory devices. The developed system resulted in 91.9% accuracy, 93.6% precision, and 92% recall. The achieved inference time on an Arduino Nano 33 BLE Sense with a 32-bit CPU running at 64 MHz is 34 ms and requires 2.6 kB peak RAM and 139.9 kB program flash memory, making it suitable for resource-constrained embedded systems.
2. B.Natraj Kumar, M.Sri Lakshmi,Dr.S. Prem Kumar
International Journal of Computer Engineering In Research Trends (IJCERT ) 45 | P a g e
1. INTRODUCTION
Wireless sensor networks (WSNs) and MOBILE adhoc networks (MANETs) are used more and more in several
applications [1] like wild environment observance, fire detection, and military police work. Once preparation within
the field device nodes organize themselves into a multihop network, the bottom station being the central
management purpose. Sometimes device nodes are greatly hampered by thanks to computation capabilities and
energy reserves. an on the spot detected Information assortment technique from networks would be to forward every
device node’s reading to the bottom station, through alternative intermediate nodes, before the bottom station
processes received knowledge. However its disadvantage is its high value relating to communication overhead (or
energy spent).Wireless networks gained interest thanks to benefits led to by multihop, infrastructure-less
transmission. However, high node quality remains a difficulty thanks to error prone wireless channels and dynamic
configuration, moving even reliable knowledge delivery in MANETs, particularly in challenged environments.
standard topology-based MANET routing protocols (e.g., DSDV, AODV, DSR [1]) are at risk of node quality a
reason being predetermination of associate degree end-to-end route before knowledge transmission. Thanks to
perpetually and quick dynamic configuration, settled route maintenance may be a drawback. Discovery and recovery
procedures client each time and energy. Knowledge packets are either lost or delayed for long once a path break, till
route reconstruction resulting in transmission interruption.
Computing aggregates in-network (combining partial results at intermediate nodes throughout message routing) in
giant WSNs considerably lowers the quantity of communication and also the resultant energy consumed. Knowledge
acquisition systems for WSNs [2], [3] construct a spanning tree unmoving at the bottom station to perform
aggregation on the tree. Necessary aggregates thought-about embrace Count, and Sum. it's simple to generalize
aggregates to predicate Count (e.g., sensors with readings beyond a hundred units) and add. Also, Count and add are
often accustomed pc Average. Add formula also can figure variance and applied math Moment of any order. Tree-
based aggregation approaches don't settle for communication losses thanks to node and transmission failures,
common in WSNs.Location data is employed by geographic routing (GR) [2] to forward knowledge packets, in hop-
by-hop Routing fashion. Greedy forwarding selects following hop forwarder with biggest progress toward
destination whereas void handling mechanism to route around communication voids [3]. there ought no to maintain
end-to-end routes, resulting in GR’s potency and quantifiability; however it's sensitive to location data [4] quality.
In greedy forwarding operations, a comparatively isolated neighbor is chosen because the next hop. Once the node
goes far away from the Sender’s coverage space, transmission fails. In GPSR [5] (a noted geographic routing
protocol), the mackintosh layer Failure feedback offers packet another reroute probability. However simulation
reveals that it's incapable of maintaining performance once node quality will increase. One packet transmission
ends up in multiple receptions thanks to the printed nature of the wireless medium. Once such transmission is that
the backup, the routing protocol’s hardiness is greatly increased. Time serving routing [6], [7], [8] incontestable
multicast-like routing strategy. This paper addresses this drawback. The analysis community planned exploitation
multipath routing techniques to forward sub-aggregates [2]. Aggregates like Min and liquid ecstasy are duplicate-
insensitive and then this approach provides a fault-tolerant resolution. a unique Position-based timeserving Routing
(PTR) protocol wherever many forwarding candidates’ cache packets exploitation mackintosh interception was
4. B.Natraj Kumar, M.Sri Lakshmi,Dr.S. Prem Kumar
International Journal of Computer Engineering In Research Trends (IJCERT ) 47 | P a g e
progress towards destination becomes subsequent hop) in informatics layer and multiple reception is thru Macintosh
interception. Use of RTS/CTS/DATA/ACK greatly lowers the collision and nodes inside the sender’s transmission
vary may snoop on a packet with success with smart likelihood thanks to medium reservation.
As knowledge packets area unit transmitted multicast-like every is known with a novel tuple (src_ip, seq_no)
wherever src_ip becomes the informatics address of supply node and seq_no the corresponding sequence variety.
Every node encompasses a monotonically increasing sequence variety, associate degrees an ID Cache-to record
packets ID (src_ip,seq_no) that were received recently. Receipt of a packet with same ID ends up in it being
discarded. Otherwise, it's forwarded to the receiver to subsequent hop, or keep in a very Packet List if received by a
forwarding candidate. It’s born once the receiver isn't given. The packet within the Packet List is shipped out once
awaiting a selected variety of your time slots or discarded if identical packet is received once more throughout the
waiting amount (this suggests that a much better forwarder has already meted out the task).PTR’s routing situation is
illustrated in Fig. 1. in a very traditional scenario sans link break, the packet is forwarded by subsequent hop node
(nodes A, E) and forwarding candidates (nodes B, C; nodes F, G) area unit suppressed (the same packet in Packet
List is dropped) by subsequent hop node’s transmission. If node A fails to deliver the packet (node A has taken away
and then cannot receive the packet), node B, the forwarding candidate with high priority relays packet and
suppresses the lower priority candidate’s forwarding (node C) and node S. By mistreatment Macintosh layer
feedback, node S removes node A from neighbors list and selects a replacement next hop node for the next packets.
The interface queue packets taking node A because the next hop get a second likelihood to reroute. A packet force
back from Macintosh layer won't be rerouted if node S overhears node B’s forwarding.
Figure 1: Position-Based Opportunistic Routing
2.2 Selection and Prioritization of Forwarding Candidates
One of PTR’s main issues is choice and prioritization of forwarding candidates. only forwarding space nodes [14]
would be backup nodes. The sender decides the forwarding space and also the next hop node. A forward space node
meets the subsequent 2 conditions: 1) it makes positive progress toward the destination; and 2) its distance to future
hop node mustn't be over a wireless node’s 0.5 transmissions vary (i.e., R=2) in order that all forwarding will didates
can hear from each other. In Fig. 1, the forwarding space is that self-enclosed by the daring curve. the realm nodes
6. B.Natraj Kumar, M.Sri Lakshmi,Dr.S. Prem Kumar
International Journal of Computer Engineering In Research Trends (IJCERT ) 49 | P a g e
full utilization of the collision rejection supported by 802.11 MAC. On the receiver facet, MAC-layer address filter
is changed, even once knowledge packet’s next hop isn't the receiver. It’s delivered to the higher layer with a touch
within the packet header proving this packet was overheard. PTR more processes it. So, an edge of broadcast and
unicast (MAC support) is achieved.
3. ASSOCIATED MECHANISM
Castelluccia et al [13] projected an easy and incontrovertibly secure encoding permitting encrypted knowledge to be
with efficiency and additively aggregate.simply a standard addition is required for cipher-text aggregation. Theme
security is predicated on the in distinguish ability property of a pseudorandom operate (PRO), a typical crypto
graphical primitive. it had been established that aggregation supported this could with efficiency reckon applied
mathematics values, like mean, variance, and perceived data’s variance, whereas achieving nice information
measure savings. to shield aggregate data’s integrity, AN end-to-end combination authentication theme was created
that was secure against outsider-only attacks.Su et al [14] instructed a way to realize best rate allocation for
knowledge aggregation in wireless device networks. First, a rate allocation downside was developed as a network
utility maximization downside; some of variable substitutions on the initial downside was created attributable to its
non-convexity and reworked it into an approximate problem, which is plan convex. Then duality theory was applied
to decompose the approximate downside into a rate management sub-problem and a programming sub-problem.
Supported this, a distributed algorithmic program for joint rate management and programming is meant, and was
established to approach randomly near the optimum of the approximate downside. Theoretical analysis/simulations
prove that approximate resolutions are able to do near-optimal performance.Boppana et al [15] evaluated 2
representative SDA schemes realistically exploitation TOSSIM machine for analyses. To validate knowledge
aggregation techniques implementation of information was through use of an analytical model. Results reveal that
it's necessary to cut back transmitted packets range than the general range of bits transmitted. With low duty cycles
and low device knowledge generation likelihood, even straightforward concatenation of device knowledge, that
lowered the amount of packets transmitted, was as effective because the a lot of refined SDA schemes; once device
knowledge square measure generated a lot of of times, SDA schemes that don't need intermediate nodes decode
device knowledge to present 100 percent higher network lifespan. Daabaj et al [16] developed a reliable load-
balancing routing (RLBR) protocol for network lifespan maximization supported reliability-oriented protocols and
ancient energy-aware routing protocols. RLBR uses Channel State data (CSD) e.g., RSSI and LQI, link estimation
supported packet transmissions e.g., success reception magnitude relation (PRR) and packet error magnitude relation
(PER), and residual energy capability as well as alternative parameters, e.g., source id, CRC, hop count, aggregation
load, and latency to make a price operate for choosing the foremost reliable and energy economical route towards
the bottom station. In alternative words, RLBR lowered energy consumed for packet transmissions by embedding
routing data in overheard packets and lowering management traffic. Hence, it maintains low packet error magnitude
relation and improves packet delivery whereas minimizing redundant packet transmission and/or retransmissions
throughout the network. .
8. B.Natraj Kumar, M.Sri Lakshmi,Dr.S. Prem Kumar
International Journal of Computer Engineering In Research Trends (IJCERT ) 51 | P a g e
while not pausing is employed to model nodes’ quality with minimum node speed being set to one m/s. the most
speed is varied to vary network quality degree. The subsequent metrics compare performance:
Packet delivery quantitative relation: The ratio of knowledge packets variety received at the destination(s)
to the information packet variety sent by source(s).
End-to-end delay: the typical and median end-to-end delay square measure evaluated, alongside additive
delay distribution operate.
Path length: Average end-to-end path length (number of hops) for productive packet delivery.
Packet forwarding times per hop (FTH): Average times a packet is forwarded from routing layer
perspective to deliver information packet over every hop.
Packet forwarding times per packet (FTP): the days a packet is forwarded from routing layer perspective to
deliver information packet from supply to destination.
Among metrics, FTH and FTP appraise the quantity of duplicate forwarding. For unicast vogue routing protocols,
packet reroute caused by path break accounts for FTH being bigger than one. Except for packets that aren't delivered
to destination(s), efforts already created in forwarding packets remains thought of in FTH calculations.
Figure 2. Analytical delivery time ratio versus node ability
10. B.Natraj Kumar, M.Sri Lakshmi,Dr.S. Prem Kumar
International Journal of Computer Engineering In Research Trends (IJCERT ) 53 | P a g e
[3] Considine, J., Li, F., Kollios, G., & Byers, J. (2004, March). Approximate aggregation techniques for sensor
databases. In Data Engineering, 2004. Proceedings. 20th International Conference on (pp. 449-460). IEEE.
[4] Garofalakis, M., Hellerstein, J. M., &Maniatis, P. (2007,April). Proof sketches: Verifiable in-network
aggregation. In Data Engineering, 2007. ICDE 2007. IEEE 23rd International Conference on (pp. 996-1005). IEEE.
[5] Yu, H. (2011). Secure and highly-available aggregation queries in large-scale sensor networks via set
sampling.Distributed Computing, 23(5), 373-394.
[6] Frikken, K. B., & Dougherty IV, J. A. (2008, March). An efficient integrity-preserving scheme for hierarchical
sensor aggregation. In Proceedings of the first ACM conference on Wireless network security (pp. 68-76). ACM.
[7] Broch, J., Maltz, D. A., Johnson, D. B., Hu, Y. C., &Jetcheva, J. (1998, October). A performance comparison of
multi-hop wireless ad hoc network routing protocols. In Proceedings of the 4th annual ACM/IEEE international
conference on Mobile computing and networking (pp. 85-97). ACM.
[8] Karp, B., & Kung, H. T. (2000, August). GPSR: Greedy perimeter stateless routing for wireless networks. In
Proceedings of the 6th annual international conference on Mobile computing and networking (pp. 243-254). ACM.
[9] Arad, N., &Shavitt, Y. (2009). Minimizing recovery state in geographic ad hoc routing. Mobile Computing,
IEEE Transactions on, 8(2), 203-217.
[10] Ganesan, D., Govindan, R., Shenker, S., &Estrin, D. (2001).Highly-resilient, energy-efficient multipath routing
in wireless sensor networks. ACM SIGMOBILE Mobile Computing and Communications Review, 5(4), 11-25.
[11] Ye, Z., Krishnamurthy, S. V., &Tripathi, S. K. (2003, March). A framework for reliable routing in mobile ad
hoc networks.
In INFOCOM 2003. Twenty-Second Annual Joint Conference of the IEEE Computer and Communications. IEEE
Societies (Vol. 1, pp. 270-280). IEEE.