Multipath routing in WSN has been a long wish in security scenario where nodes on next-hop may be
targeted to compromise. Many proposals of Multipath routing has been proposed in ADHOC Networks but
under constrained from keying environment most seems ignorant. In WSN where crucial data is reported by
nodes in deployment area to their securely located Sink, route security has to be guaranteed. Under
dynamic load and selective attacks, availability of multiple secure paths is a boon and increases the
attacker efforts by many folds. We propose to build a subset of neighbors as our front towards destination
node. We also identified forwarders for query by base station. The front is optimally calculated to maintain
the security credential and avail multiple paths. According to our knowledge ours is a novel secure
multipath routing protocol for WSN. We established effectiveness of our proposal with mathematical
analysis.
A NEW KEY ESTABLISHMENT SCHEME FOR WIRELESS SENSOR NETWORKSIJNSA Journal
Traditional key management techniques, such as public key cryptography or key distribution center (e.g., Kerberos), are often not effective for wireless sensor networks for the serious limitations in terms of computational power, energy supply, network bandwidth. In order to balance the security and efficiency, we propose a new scheme by employing LU Composition techniques for mutual authenticated pairwise key establishment and integrating LU Matrix with Elliptic Curve Diffie-Hellman for anonymous pathkey establishment. At the meantime, it is able to achieve efficient group key agreement and management. Analysis shows that the new scheme has better performance and provides authenticity and anonymity for sensor to establish multiple kinds of keys, compared with previous related works.
Risk-Aware Response Mechanism with Extended D-S theoryEditor IJCATR
Mobile Ad hoc Networks (MANET) are having dynamic nature of its network infrastructure and
it is vulnerable to all types of attacks. Among these attacks, the routing attacks getting more attention
because its changing the whole topology itself and it causes more damage to MANET. Even there are lot of
intrusion detection Systems available to diminish those critical attacks, existing causesunexpected network
partition, and causes additional damages to the infrastructure of the network , and it leads to uncertainty in
finding routing attacks in MANET. In this paper, we propose a adaptive risk-aware response mechanism with
extended Dempster-Shafer theory in MANET to identify the routing attacks and malicious node. Our
techniques find the malicious node with degree of evidence from the expert knowledge and detect the
important factors for each node.It creates black list and all those malicious nodes so that it may not enter the
network again
In remote sensor arrange messages are exchanged between the different source and goal matches agreeably such way that multi-jump parcel transmission is utilized. These information bundles are exchanged from the middle of the road hub to sink hub by sending a parcel to goal hubs. Where each hub overhears transmission close neighbor hub. To dodge this we propose novel approach with proficient steering convention i.e. most brief way directing and conveyed hub steering calculation. Proposed work additionally concentrates on Automatic Repeat Request and Deterministic Network coding. We spread this work by the end to end message encoding instrument. To upgrade hub security match shrewd key era is utilized, in which combined conveying hub is allocated with combine key to making secure correspondence. End to end. We dissect both single and numerous hubs and look at basic ARQ and deterministic system coding as strategies for transmission.
Efficient security approaches in mobile ad hoc networks a surveyeSAT 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
CLUSTER BASED FIDELITY TO SECURE DSDV PROTOCOL AGAINST BLACK HOLE ATTACKSpijans
In this paper, we introduce and discuss an approach that will be used to secure the DSDV routing protocol in an ad-hoc network. Due to mobility and absence of infrastructure, nodes are more vulnerable to several malicious attacks. The secure routing is essential to transmit packets from source to the destination. Our approach consists to model and manage fidelity concept in an ad-hoc clustering architecture. Clustering makes it possible to group the mobile nodes and to send data simultaneously to the each group. Our security model thus aims to integrate mechanisms against black hole attacks, forcing cooperation between nodes and detecting failing behaviors. The nodes present in the clusters will work more efficiently and the message passing within the nodes will also get more authenticated from the cluster heads. The simulation of our proposed algorithm is carried out using NS2 network simulator by evaluating some network performances such as average delay, throughput of communication and packets loss.
Defeating jamming with the power of silenceranjith kumar
Dear Student,
DREAMWEB TECHNO SOLUTIONS is one of the Hardware Training and Software Development centre available in
Trichy. Pioneer in corporate training, DREAMWEB TECHNO SOLUTIONS provides training in all software
development and IT-related courses, such as Embedded Systems, VLSI, MATLAB, JAVA, J2EE, CIVIL,
Power Electronics, and Power Systems. It’s certified and experienced faculty members have the
competence to train students, provide consultancy to organizations, and develop strategic
solutions for clients by integrating existing and emerging technologies.
ADD: No:73/5, 3rd Floor, Sri Kamatchi Complex, Opp City Hospital, Salai Road, Trichy-18
Contact @ 7200021403/04
phone: 0431-4050403
Modern-day computer security relies heavily on cryptography as a means to protect the data that we have
become increasingly reliant on. The main research in computer security domain is how to enhance the
speed of RSA algorithm. The computing capability of Graphic Processing Unit as a co-processor of the
CPU can leverage massive-parallelism. This paper presents a novel algorithm for calculating modulo
value that can process large power of numbers which otherwise are not supported by built-in data types.
First the traditional algorithm is studied. Secondly, the parallelized RSA algorithm is designed using
CUDA framework. Thirdly, the designed algorithm is realized for small prime numbers and large prime
number . As a result the main fundamental problem of RSA algorithm such as speed and use of poor or
small prime numbers that has led to significant security holes, despite the RSA algorithm's mathematical
soundness can be alleviated by this algorithm.
A NEW KEY ESTABLISHMENT SCHEME FOR WIRELESS SENSOR NETWORKSIJNSA Journal
Traditional key management techniques, such as public key cryptography or key distribution center (e.g., Kerberos), are often not effective for wireless sensor networks for the serious limitations in terms of computational power, energy supply, network bandwidth. In order to balance the security and efficiency, we propose a new scheme by employing LU Composition techniques for mutual authenticated pairwise key establishment and integrating LU Matrix with Elliptic Curve Diffie-Hellman for anonymous pathkey establishment. At the meantime, it is able to achieve efficient group key agreement and management. Analysis shows that the new scheme has better performance and provides authenticity and anonymity for sensor to establish multiple kinds of keys, compared with previous related works.
Risk-Aware Response Mechanism with Extended D-S theoryEditor IJCATR
Mobile Ad hoc Networks (MANET) are having dynamic nature of its network infrastructure and
it is vulnerable to all types of attacks. Among these attacks, the routing attacks getting more attention
because its changing the whole topology itself and it causes more damage to MANET. Even there are lot of
intrusion detection Systems available to diminish those critical attacks, existing causesunexpected network
partition, and causes additional damages to the infrastructure of the network , and it leads to uncertainty in
finding routing attacks in MANET. In this paper, we propose a adaptive risk-aware response mechanism with
extended Dempster-Shafer theory in MANET to identify the routing attacks and malicious node. Our
techniques find the malicious node with degree of evidence from the expert knowledge and detect the
important factors for each node.It creates black list and all those malicious nodes so that it may not enter the
network again
In remote sensor arrange messages are exchanged between the different source and goal matches agreeably such way that multi-jump parcel transmission is utilized. These information bundles are exchanged from the middle of the road hub to sink hub by sending a parcel to goal hubs. Where each hub overhears transmission close neighbor hub. To dodge this we propose novel approach with proficient steering convention i.e. most brief way directing and conveyed hub steering calculation. Proposed work additionally concentrates on Automatic Repeat Request and Deterministic Network coding. We spread this work by the end to end message encoding instrument. To upgrade hub security match shrewd key era is utilized, in which combined conveying hub is allocated with combine key to making secure correspondence. End to end. We dissect both single and numerous hubs and look at basic ARQ and deterministic system coding as strategies for transmission.
Efficient security approaches in mobile ad hoc networks a surveyeSAT 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
CLUSTER BASED FIDELITY TO SECURE DSDV PROTOCOL AGAINST BLACK HOLE ATTACKSpijans
In this paper, we introduce and discuss an approach that will be used to secure the DSDV routing protocol in an ad-hoc network. Due to mobility and absence of infrastructure, nodes are more vulnerable to several malicious attacks. The secure routing is essential to transmit packets from source to the destination. Our approach consists to model and manage fidelity concept in an ad-hoc clustering architecture. Clustering makes it possible to group the mobile nodes and to send data simultaneously to the each group. Our security model thus aims to integrate mechanisms against black hole attacks, forcing cooperation between nodes and detecting failing behaviors. The nodes present in the clusters will work more efficiently and the message passing within the nodes will also get more authenticated from the cluster heads. The simulation of our proposed algorithm is carried out using NS2 network simulator by evaluating some network performances such as average delay, throughput of communication and packets loss.
Defeating jamming with the power of silenceranjith kumar
Dear Student,
DREAMWEB TECHNO SOLUTIONS is one of the Hardware Training and Software Development centre available in
Trichy. Pioneer in corporate training, DREAMWEB TECHNO SOLUTIONS provides training in all software
development and IT-related courses, such as Embedded Systems, VLSI, MATLAB, JAVA, J2EE, CIVIL,
Power Electronics, and Power Systems. It’s certified and experienced faculty members have the
competence to train students, provide consultancy to organizations, and develop strategic
solutions for clients by integrating existing and emerging technologies.
ADD: No:73/5, 3rd Floor, Sri Kamatchi Complex, Opp City Hospital, Salai Road, Trichy-18
Contact @ 7200021403/04
phone: 0431-4050403
Modern-day computer security relies heavily on cryptography as a means to protect the data that we have
become increasingly reliant on. The main research in computer security domain is how to enhance the
speed of RSA algorithm. The computing capability of Graphic Processing Unit as a co-processor of the
CPU can leverage massive-parallelism. This paper presents a novel algorithm for calculating modulo
value that can process large power of numbers which otherwise are not supported by built-in data types.
First the traditional algorithm is studied. Secondly, the parallelized RSA algorithm is designed using
CUDA framework. Thirdly, the designed algorithm is realized for small prime numbers and large prime
number . As a result the main fundamental problem of RSA algorithm such as speed and use of poor or
small prime numbers that has led to significant security holes, despite the RSA algorithm's mathematical
soundness can be alleviated by this algorithm.
Ballpark Figure Algorithms for Data Broadcast in Wireless NetworksEditor IJCATR
In wireless system allocation is a necessary purpose and show industry expensive dependability in message protocol design. In multihop wireless networks, equally, imposition by a node by reason of immediate transmissions as its neighbors makes it nontrivial to graph a minimum-latency transmit algorithm, which is known to be NP-complete. A simple ballpark figure algorithm for the one-to-all transmit problem that improves all previously documented guarantees for this problem. In All-to-all transmit problem where every node sends its own consequence to all complementary nodes. In the all-to-all transmit problem, we current two algorithms with ballpark figure ratios of 20 and 34, civilizing the greatest result. A communication wants to be transmitted establishment its resource to all the previous nodes in the network. There may be different messages to be broadcasted from several sources. Two or more nodes broadcast a communication to an ordinary neighbor at the same time; the frequent node will not collect any of this communication. We say that collide has occurred at the ordinary node. So any message protocol for wireless networks must dispute with the distress of difficulty in the wireless intermediate.
International Journal of Computational Engineering Research(IJCER) is an intentional online Journal in English monthly publishing journal. This Journal publish original research work that contributes significantly to further the scientific knowledge in engineering and Technology.
ER Publication,
IJETR, IJMCTR,
Journals,
International Journals,
High Impact Journals,
Monthly Journal,
Good quality Journals,
Research,
Research Papers,
Research Article,
Free Journals, Open access Journals,
erpublication.org,
Engineering Journal,
Science Journals,
Analysis of Cluster Based Anycast Routing Protocol for Wireless Sensor NetworkIJMER
A wireless sensor network is a collection of nodes organized into a cooperative network.
Each node consists of processing capability, may contain multiple types of memory, have a RF
transceiver, have a power source, and accommodate various sensors and actuators. The nodes
communicate wirelessly and often self-organize after being deployed in an ad hoc fashion.
Routing protocols for wireless sensor networks are responsible for maintaining the routes in the
network and have to ensure reliable multi-hop communication .The performance of the network is
greatly influenced by the routing techniques. Routing is to find out the path to route the sensed data to
the base station. In this paper the features of WSNs are introduced and routing protocols are reviewed
for Wireless Sensor Network.
A black-hole attack in the Mobile Ad-hoc NETwork (MANET) is an attack occurs due to malicious nodes,
which attracts the data packets by falsely advertising a fresh route to the destination. In this paper, we
present a clustering approach in Ad-hoc On-demand Distance Vector (AODV) routing protocol for the
detection and prevention of black-hole attack in MANETs. In this approach every member of the cluster will
ping once to the cluster head, to detect the peculiar difference between the number of data packets received
and forwarded by the node. If anomalousness is perceived, all the nodes will obscure the malicious nodes
from the network.
CODE AWARE DYNAMIC SOURCE ROUTING FOR DISTRIBUTED SENSOR NETWORKIJNSA Journal
Sensor network facilitates monitoring and controlling of physical environments. These wireless networks consist of dense collection of sensors capable of collection and dissemination of data. They have application in variety of fields such as military purposes, environment monitoring etc. Typical deployment of sensor network assumes central processing station or a gateway to which all other nodes route their data using dynamic source routing (DSR). This causes congestion at central station and thus reduces the efficiency of the network. In this work we will propose a better dynamic source routing technique using network coding to reduce total number of transmission in sensor networks resulting in better efficiency.
Security in Wireless Sensor Networks: Key Management Module in SOOAWSN IJNSA Journal
Due to high restrictions in wireless sensor networks, where the resources are limited, clustering protocols for routing organization have been proposed in much research for increasing system throughput, decreasing system delay and saving energy. Even these algorithms have proposed some levels of security, but because of their dynamic nature of communication, most of their security solutions are not suitable. In this paper we focus on how to achieve the highest possible level of security by applying new keymanagement technique that can be used during wireless sensor networks communications. For our proposal to be more effective and applicable to a large number of wireless sensor networks applications, we work on a special kind of architecture that have been proposed to cluster hierarchy of wireless sensor networks and we pick one of the most interesting protocols that have been proposed for this kind of architecture, which is LEACH. This proposal is a module of a complete solution that we are developing to cover all the aspects of wireless sensor networks communication which is labeled Secure Object Oriented Architecture for Wireless Sensor Networks (SOOAWSN) .
Performance Comparison of Cluster based and Threshold based Algorithms for De...Eswar Publications
In mobile ad-hoc networks (MANET), the movement of the nodes may quickly change the networks topology resulting in the increase of the overhead message in topology maintenance. The nodes communicate with each other by exchanging the hello packet and constructing the neighbor list at each node. MANET is vulnerable to attacks such as black hole attack, gray hole attack, worm hole attack and sybil attack. A black hole attack makes a serious impact on routing, packet delivery ratio, throughput, and end to end delay of packets. In this paper, the performance comparison of clustering based and threshold based algorithms for detection and prevention of
cooperative in MANETs is examined. In this study every node is monitored by its own cluster head (CH), while server (SV) monitors the entire network by channel overhearing method. Server computes the trust value based on sent and receive count of packets of the receiver node. It is implemented using AODV routing protocol in the NS2 simulations. The results are obtained by comparing the performance of clustering based and threshold based methods by varying the concentration of black hole nodes and are analyzed in terms of throughput,
packet delivery ratio. The results demonstrate that the threshold based method outperforms the clustering based method in terms of throughput, packet delivery ratio and end to end delay.
Cluster Head and RREQ based Detection and Prevention of Gray hole and Denial ...IJSRD
Wireless sensor network is a type of network which have no communications pattern for communication between nodes, any node can easily join the network and leave the network so attacks are more probable. Gray hole is one of such attacks and it is tough to detect since malicious node switches behavior between normal node and malicious node. For detection and prevention of gray hole attacks our proposed technique is based on Cluster head and RREQ based approach in WSN. In our proposed technique we select a node which has the highest energy as a cluster head and remaining node are marked as work as cluster member. For each node we decide a threshold for sending RREQ if any node generate RREQ more than threshold then we check its RREP threshold value if it’s less than one than cluster head will conclude this node as a malicious node and broadcast its node id so that all other nodes also mark it as malicious node and drop the request arrive from this malicious node and for gray hole detection.
Modified AODV Algorithm using Data Mining Process: Classification and Clusteringidescitation
Security of Wireless Ad hoc network has a primary
concern to provide protected communication between mobile
nodes. When we routing some packet it can use both malicious
node or authenticate node for forwarding and receiving data.
Malicious node can attack like black hole, misuse of data or
hacked information. Our aim is to discuss the feasibility of
monitoring the node of different networks, to analyze it for
providing better security in AODV routing protocol. We
implement data mining techniques for search large amount
of data according characteristic rules and patterns to detect
malicious node. We have used growing neural gas (GNS)
clustering algorithm to make clusters and analysis data. Using
soft computing technique we find patterns, analysis node and
take decision based on decision tree.
A review on distributed beam forming techniques an approach in wireless rela...eSAT Journals
Abstract Physical layer security can be considered to solve the security problem from the point of view of information theory in wireless networks. The combination of cryptographic schemes with channel coding techniques is called for in the basic principle of information-theoretic security. Due to the presence of one or more eavesdropper in wireless relay networks, secrecy of communication is in jeopardy. For such a scenario secrecy rate of the network provide a good measure of performance of the system. In this paper our focus is on secrecy capacity and its optimization with appropriate weight designs of relays taking into consideration the channels through which the eavesdroppers are connected to the relays. We propose the AF and DF based optimal beam forming scheme to improve the wireless security against eavesdropping attack by detecting and removing the eavesdroppers from the wireless relay networks and thus finding measures to maximize the efficiency, response time and the throughput of the system It includes an auto-regression technique as first approach and the use of RC6 algorithm for encrypting the confidential messages. The scheme is a two way approach that will not only provides security to the confidential messages, to be communicated within a wireless relay network in presence of multiple relays and eavesdroppers, but also it will deal with the saving the consumed power by detecting and removing the nodes which are malicious or defected which in turn will consume more power in order to perform malicious activity on the messages or may try to create interferences in the network. The eavesdropper nodes in the proposed system are considered to be working as relays so it may either be connected to source or destination directly or in between the relays. Keywords: Beamforming, Channel State Information, Eavesdropper Attack, Power Consumption, Secrecy Capacity.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
Universal Network Coding-Based Opportunistic Routing for Unicast1crore projects
IEEE PROJECTS 2015
1 crore projects is a leading Guide for ieee Projects and real time projects Works Provider.
It has been provided Lot of Guidance for Thousands of Students & made them more beneficial in all Technology Training.
Dot Net
DOTNET Project Domain list 2015
1. IEEE based on datamining and knowledge engineering
2. IEEE based on mobile computing
3. IEEE based on networking
4. IEEE based on Image processing
5. IEEE based on Multimedia
6. IEEE based on Network security
7. IEEE based on parallel and distributed systems
Java Project Domain list 2015
1. IEEE based on datamining and knowledge engineering
2. IEEE based on mobile computing
3. IEEE based on networking
4. IEEE based on Image processing
5. IEEE based on Multimedia
6. IEEE based on Network security
7. IEEE based on parallel and distributed systems
ECE IEEE Projects 2015
1. Matlab project
2. Ns2 project
3. Embedded project
4. Robotics project
Eligibility
Final Year students of
1. BSc (C.S)
2. BCA/B.E(C.S)
3. B.Tech IT
4. BE (C.S)
5. MSc (C.S)
6. MSc (IT)
7. MCA
8. MS (IT)
9. ME(ALL)
10. BE(ECE)(EEE)(E&I)
TECHNOLOGY USED AND FOR TRAINING IN
1. DOT NET
2. C sharp
3. ASP
4. VB
5. SQL SERVER
6. JAVA
7. J2EE
8. STRINGS
9. ORACLE
10. VB dotNET
11. EMBEDDED
12. MAT LAB
13. LAB VIEW
14. Multi Sim
CONTACT US
1 CRORE PROJECTS
Door No: 214/215,2nd Floor,
No. 172, Raahat Plaza, (Shopping Mall) ,Arcot Road, Vadapalani, Chennai,
Tamin Nadu, INDIA - 600 026
Email id: 1croreprojects@gmail.com
website:1croreprojects.com
Phone : +91 97518 00789 / +91 72999 51536
Interference Minimization Protocol in Heterogeneous Wireless Sensor Network f...IJERA Editor
High-quality data transmission is the primary objective of WSN for achieving quality of service.
Heterogeneous wireless sensor networks (HTWSN) can be used to deploy in sensitive and unmanned areas
to monitor the objects. HTWSN is high configured network used to capture high-quality images and videos
of targeted objects. During the data transmission in HTWSN, we identified that, the formation of
interference with in the network due to link capacity overhead. Due to that, the quality data transmission is
not possible through the network. In this research paper, we described the deployment of HTWSN network
and identifying the primary sources for interference and introducing the proposed Interference
Minimization Protocol (IMP). The IM protocol has achieved better quality of service by minimizing the
interference in HTWSN.
Web image annotation by diffusion maps manifold learning algorithmijfcstjournal
Automatic image annotation is one of the most challenging problems in machine vision areas. The goal of this task is to predict number of keywords automatically for images captured in real data. Many methods are based on visual features in order to calculate similarities between image samples. But the computation cost of these approaches is very high. These methods require many training samples to be stored in memory. To lessen thisburden, a number of techniques have been developed to reduce the number
of features in a dataset. Manifold learning is a popular approach to nonlinear dimensionality reduction. In
this paper, we investigate Diffusion maps manifold learning method for webimage auto-annotation task.Diffusion maps
manifold learning method isused to reduce the dimension of some visual features. Extensive experiments and analysis onNUS-WIDE-LITE web image dataset with
different visual featuresshow how this manifold learning dimensionality reduction method can be applied effectively to image annotation.
Cloud computing is a way of delivery any or all information technology from computing power to
computing infrastructure, application, business processes and personal collaboration to an user as a
service wherever and whenever they need it. The cloud in cloud computing is set of hardware, network,
software, storage, service and interfaces that combine to deliver aspects of computing as a service. Shared
resource, software and information are providing to computers and other devices on demand basis. It
allows people to do things, they want to on a computer without the need for them to build an IT
infrastructure or to understand the underline technology. Cloud computing refers to application and
services that run on distributed network using virtualized resources and access by common internet
protocols and network standards. It is a moving computing and storage from the user desktop or laptop to
remote location where as huge collection of server storage system and network equipment from a seamless
infrastructure for an application and storage. Online file storage, social networking sites, webmail and
online business application are the example of cloud services. Now a day many people are connected to
internet and Social networking sites. Social network have become a powerful platform for sharing and
communication that focus on real world relationships. Social networking plays a major role in everyday
lives of many people. Facebook is one of the best examples of Social networking sites where more than 400
million active users are connected. Thus Social cloud is a scalable computing model where in virtualized
resource provided by users dynamically. In this paper we used concept of MapReduce with Multithreading.
MapReduce is a paradigm that allows for massive scalability across hundreds or thousands of servers in a
cluster. MapReduce job usually split the input data into independent chunks which are processed by the
map tasks in completely parallel manner. It sorts the output of the map which are than input to the reduce
task. Using mapping techniques is to find out a good performance in terms of cost and time.
Trilateration-based localization (TBL) has become a corner stone of modern technology. This study
formulates the concern on how wireless sensor networks can take advantage of the computational
intelligent techniques using both single- and multi-objective particle swarm optimization (PSO) with an
overall aim of concurrently minimizing the required time for localization, minimizing energy consumed
during localization, and maximizing the number of nodes fully localized through the adjustment of wireless
sensor transmission ranges while using TBL process. A parameter-study of the applied PSO variants is
performed, leading to results that show algorithmic improvements of up to 32% in the evaluated objectives.
Ballpark Figure Algorithms for Data Broadcast in Wireless NetworksEditor IJCATR
In wireless system allocation is a necessary purpose and show industry expensive dependability in message protocol design. In multihop wireless networks, equally, imposition by a node by reason of immediate transmissions as its neighbors makes it nontrivial to graph a minimum-latency transmit algorithm, which is known to be NP-complete. A simple ballpark figure algorithm for the one-to-all transmit problem that improves all previously documented guarantees for this problem. In All-to-all transmit problem where every node sends its own consequence to all complementary nodes. In the all-to-all transmit problem, we current two algorithms with ballpark figure ratios of 20 and 34, civilizing the greatest result. A communication wants to be transmitted establishment its resource to all the previous nodes in the network. There may be different messages to be broadcasted from several sources. Two or more nodes broadcast a communication to an ordinary neighbor at the same time; the frequent node will not collect any of this communication. We say that collide has occurred at the ordinary node. So any message protocol for wireless networks must dispute with the distress of difficulty in the wireless intermediate.
International Journal of Computational Engineering Research(IJCER) is an intentional online Journal in English monthly publishing journal. This Journal publish original research work that contributes significantly to further the scientific knowledge in engineering and Technology.
ER Publication,
IJETR, IJMCTR,
Journals,
International Journals,
High Impact Journals,
Monthly Journal,
Good quality Journals,
Research,
Research Papers,
Research Article,
Free Journals, Open access Journals,
erpublication.org,
Engineering Journal,
Science Journals,
Analysis of Cluster Based Anycast Routing Protocol for Wireless Sensor NetworkIJMER
A wireless sensor network is a collection of nodes organized into a cooperative network.
Each node consists of processing capability, may contain multiple types of memory, have a RF
transceiver, have a power source, and accommodate various sensors and actuators. The nodes
communicate wirelessly and often self-organize after being deployed in an ad hoc fashion.
Routing protocols for wireless sensor networks are responsible for maintaining the routes in the
network and have to ensure reliable multi-hop communication .The performance of the network is
greatly influenced by the routing techniques. Routing is to find out the path to route the sensed data to
the base station. In this paper the features of WSNs are introduced and routing protocols are reviewed
for Wireless Sensor Network.
A black-hole attack in the Mobile Ad-hoc NETwork (MANET) is an attack occurs due to malicious nodes,
which attracts the data packets by falsely advertising a fresh route to the destination. In this paper, we
present a clustering approach in Ad-hoc On-demand Distance Vector (AODV) routing protocol for the
detection and prevention of black-hole attack in MANETs. In this approach every member of the cluster will
ping once to the cluster head, to detect the peculiar difference between the number of data packets received
and forwarded by the node. If anomalousness is perceived, all the nodes will obscure the malicious nodes
from the network.
CODE AWARE DYNAMIC SOURCE ROUTING FOR DISTRIBUTED SENSOR NETWORKIJNSA Journal
Sensor network facilitates monitoring and controlling of physical environments. These wireless networks consist of dense collection of sensors capable of collection and dissemination of data. They have application in variety of fields such as military purposes, environment monitoring etc. Typical deployment of sensor network assumes central processing station or a gateway to which all other nodes route their data using dynamic source routing (DSR). This causes congestion at central station and thus reduces the efficiency of the network. In this work we will propose a better dynamic source routing technique using network coding to reduce total number of transmission in sensor networks resulting in better efficiency.
Security in Wireless Sensor Networks: Key Management Module in SOOAWSN IJNSA Journal
Due to high restrictions in wireless sensor networks, where the resources are limited, clustering protocols for routing organization have been proposed in much research for increasing system throughput, decreasing system delay and saving energy. Even these algorithms have proposed some levels of security, but because of their dynamic nature of communication, most of their security solutions are not suitable. In this paper we focus on how to achieve the highest possible level of security by applying new keymanagement technique that can be used during wireless sensor networks communications. For our proposal to be more effective and applicable to a large number of wireless sensor networks applications, we work on a special kind of architecture that have been proposed to cluster hierarchy of wireless sensor networks and we pick one of the most interesting protocols that have been proposed for this kind of architecture, which is LEACH. This proposal is a module of a complete solution that we are developing to cover all the aspects of wireless sensor networks communication which is labeled Secure Object Oriented Architecture for Wireless Sensor Networks (SOOAWSN) .
Performance Comparison of Cluster based and Threshold based Algorithms for De...Eswar Publications
In mobile ad-hoc networks (MANET), the movement of the nodes may quickly change the networks topology resulting in the increase of the overhead message in topology maintenance. The nodes communicate with each other by exchanging the hello packet and constructing the neighbor list at each node. MANET is vulnerable to attacks such as black hole attack, gray hole attack, worm hole attack and sybil attack. A black hole attack makes a serious impact on routing, packet delivery ratio, throughput, and end to end delay of packets. In this paper, the performance comparison of clustering based and threshold based algorithms for detection and prevention of
cooperative in MANETs is examined. In this study every node is monitored by its own cluster head (CH), while server (SV) monitors the entire network by channel overhearing method. Server computes the trust value based on sent and receive count of packets of the receiver node. It is implemented using AODV routing protocol in the NS2 simulations. The results are obtained by comparing the performance of clustering based and threshold based methods by varying the concentration of black hole nodes and are analyzed in terms of throughput,
packet delivery ratio. The results demonstrate that the threshold based method outperforms the clustering based method in terms of throughput, packet delivery ratio and end to end delay.
Cluster Head and RREQ based Detection and Prevention of Gray hole and Denial ...IJSRD
Wireless sensor network is a type of network which have no communications pattern for communication between nodes, any node can easily join the network and leave the network so attacks are more probable. Gray hole is one of such attacks and it is tough to detect since malicious node switches behavior between normal node and malicious node. For detection and prevention of gray hole attacks our proposed technique is based on Cluster head and RREQ based approach in WSN. In our proposed technique we select a node which has the highest energy as a cluster head and remaining node are marked as work as cluster member. For each node we decide a threshold for sending RREQ if any node generate RREQ more than threshold then we check its RREP threshold value if it’s less than one than cluster head will conclude this node as a malicious node and broadcast its node id so that all other nodes also mark it as malicious node and drop the request arrive from this malicious node and for gray hole detection.
Modified AODV Algorithm using Data Mining Process: Classification and Clusteringidescitation
Security of Wireless Ad hoc network has a primary
concern to provide protected communication between mobile
nodes. When we routing some packet it can use both malicious
node or authenticate node for forwarding and receiving data.
Malicious node can attack like black hole, misuse of data or
hacked information. Our aim is to discuss the feasibility of
monitoring the node of different networks, to analyze it for
providing better security in AODV routing protocol. We
implement data mining techniques for search large amount
of data according characteristic rules and patterns to detect
malicious node. We have used growing neural gas (GNS)
clustering algorithm to make clusters and analysis data. Using
soft computing technique we find patterns, analysis node and
take decision based on decision tree.
A review on distributed beam forming techniques an approach in wireless rela...eSAT Journals
Abstract Physical layer security can be considered to solve the security problem from the point of view of information theory in wireless networks. The combination of cryptographic schemes with channel coding techniques is called for in the basic principle of information-theoretic security. Due to the presence of one or more eavesdropper in wireless relay networks, secrecy of communication is in jeopardy. For such a scenario secrecy rate of the network provide a good measure of performance of the system. In this paper our focus is on secrecy capacity and its optimization with appropriate weight designs of relays taking into consideration the channels through which the eavesdroppers are connected to the relays. We propose the AF and DF based optimal beam forming scheme to improve the wireless security against eavesdropping attack by detecting and removing the eavesdroppers from the wireless relay networks and thus finding measures to maximize the efficiency, response time and the throughput of the system It includes an auto-regression technique as first approach and the use of RC6 algorithm for encrypting the confidential messages. The scheme is a two way approach that will not only provides security to the confidential messages, to be communicated within a wireless relay network in presence of multiple relays and eavesdroppers, but also it will deal with the saving the consumed power by detecting and removing the nodes which are malicious or defected which in turn will consume more power in order to perform malicious activity on the messages or may try to create interferences in the network. The eavesdropper nodes in the proposed system are considered to be working as relays so it may either be connected to source or destination directly or in between the relays. Keywords: Beamforming, Channel State Information, Eavesdropper Attack, Power Consumption, Secrecy Capacity.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
Universal Network Coding-Based Opportunistic Routing for Unicast1crore projects
IEEE PROJECTS 2015
1 crore projects is a leading Guide for ieee Projects and real time projects Works Provider.
It has been provided Lot of Guidance for Thousands of Students & made them more beneficial in all Technology Training.
Dot Net
DOTNET Project Domain list 2015
1. IEEE based on datamining and knowledge engineering
2. IEEE based on mobile computing
3. IEEE based on networking
4. IEEE based on Image processing
5. IEEE based on Multimedia
6. IEEE based on Network security
7. IEEE based on parallel and distributed systems
Java Project Domain list 2015
1. IEEE based on datamining and knowledge engineering
2. IEEE based on mobile computing
3. IEEE based on networking
4. IEEE based on Image processing
5. IEEE based on Multimedia
6. IEEE based on Network security
7. IEEE based on parallel and distributed systems
ECE IEEE Projects 2015
1. Matlab project
2. Ns2 project
3. Embedded project
4. Robotics project
Eligibility
Final Year students of
1. BSc (C.S)
2. BCA/B.E(C.S)
3. B.Tech IT
4. BE (C.S)
5. MSc (C.S)
6. MSc (IT)
7. MCA
8. MS (IT)
9. ME(ALL)
10. BE(ECE)(EEE)(E&I)
TECHNOLOGY USED AND FOR TRAINING IN
1. DOT NET
2. C sharp
3. ASP
4. VB
5. SQL SERVER
6. JAVA
7. J2EE
8. STRINGS
9. ORACLE
10. VB dotNET
11. EMBEDDED
12. MAT LAB
13. LAB VIEW
14. Multi Sim
CONTACT US
1 CRORE PROJECTS
Door No: 214/215,2nd Floor,
No. 172, Raahat Plaza, (Shopping Mall) ,Arcot Road, Vadapalani, Chennai,
Tamin Nadu, INDIA - 600 026
Email id: 1croreprojects@gmail.com
website:1croreprojects.com
Phone : +91 97518 00789 / +91 72999 51536
Interference Minimization Protocol in Heterogeneous Wireless Sensor Network f...IJERA Editor
High-quality data transmission is the primary objective of WSN for achieving quality of service.
Heterogeneous wireless sensor networks (HTWSN) can be used to deploy in sensitive and unmanned areas
to monitor the objects. HTWSN is high configured network used to capture high-quality images and videos
of targeted objects. During the data transmission in HTWSN, we identified that, the formation of
interference with in the network due to link capacity overhead. Due to that, the quality data transmission is
not possible through the network. In this research paper, we described the deployment of HTWSN network
and identifying the primary sources for interference and introducing the proposed Interference
Minimization Protocol (IMP). The IM protocol has achieved better quality of service by minimizing the
interference in HTWSN.
Web image annotation by diffusion maps manifold learning algorithmijfcstjournal
Automatic image annotation is one of the most challenging problems in machine vision areas. The goal of this task is to predict number of keywords automatically for images captured in real data. Many methods are based on visual features in order to calculate similarities between image samples. But the computation cost of these approaches is very high. These methods require many training samples to be stored in memory. To lessen thisburden, a number of techniques have been developed to reduce the number
of features in a dataset. Manifold learning is a popular approach to nonlinear dimensionality reduction. In
this paper, we investigate Diffusion maps manifold learning method for webimage auto-annotation task.Diffusion maps
manifold learning method isused to reduce the dimension of some visual features. Extensive experiments and analysis onNUS-WIDE-LITE web image dataset with
different visual featuresshow how this manifold learning dimensionality reduction method can be applied effectively to image annotation.
Cloud computing is a way of delivery any or all information technology from computing power to
computing infrastructure, application, business processes and personal collaboration to an user as a
service wherever and whenever they need it. The cloud in cloud computing is set of hardware, network,
software, storage, service and interfaces that combine to deliver aspects of computing as a service. Shared
resource, software and information are providing to computers and other devices on demand basis. It
allows people to do things, they want to on a computer without the need for them to build an IT
infrastructure or to understand the underline technology. Cloud computing refers to application and
services that run on distributed network using virtualized resources and access by common internet
protocols and network standards. It is a moving computing and storage from the user desktop or laptop to
remote location where as huge collection of server storage system and network equipment from a seamless
infrastructure for an application and storage. Online file storage, social networking sites, webmail and
online business application are the example of cloud services. Now a day many people are connected to
internet and Social networking sites. Social network have become a powerful platform for sharing and
communication that focus on real world relationships. Social networking plays a major role in everyday
lives of many people. Facebook is one of the best examples of Social networking sites where more than 400
million active users are connected. Thus Social cloud is a scalable computing model where in virtualized
resource provided by users dynamically. In this paper we used concept of MapReduce with Multithreading.
MapReduce is a paradigm that allows for massive scalability across hundreds or thousands of servers in a
cluster. MapReduce job usually split the input data into independent chunks which are processed by the
map tasks in completely parallel manner. It sorts the output of the map which are than input to the reduce
task. Using mapping techniques is to find out a good performance in terms of cost and time.
Trilateration-based localization (TBL) has become a corner stone of modern technology. This study
formulates the concern on how wireless sensor networks can take advantage of the computational
intelligent techniques using both single- and multi-objective particle swarm optimization (PSO) with an
overall aim of concurrently minimizing the required time for localization, minimizing energy consumed
during localization, and maximizing the number of nodes fully localized through the adjustment of wireless
sensor transmission ranges while using TBL process. A parameter-study of the applied PSO variants is
performed, leading to results that show algorithmic improvements of up to 32% in the evaluated objectives.
Providing a model for selecting information security control objectives using...ijfcstjournal
Todays, establishing of information security in organizations is inevitable. Implementation of information
security in organizations is carried out through the implementation of information security control
objectives and controls. Since there are 39 control objectives and 133 controls so implementation of all
objectives / controls in terms of scheduling and budget would be difficult and costly for managers and
ISMS executives. Organization managers are trying to choice high risk and critical controls among all
controls for implementation or improvement. On the other hand previous quantitative methods for ranking
areas / objectives / controls, in addition to the mathematical complexity have divergence problem. As well
as organization managers and individuals concerned with ISMS have little information about the objectives
and controls. Therefore in this paper Fuzzy Screening technique is used for selection of critical controls. In
the present study, fuzzy screening process is discussed for selecting and prioritizing of security control
objectives.
Protect mobile agent against malicious host using partial mobility mechanismijfcstjournal
A
mobile agent is a promising area in distributed systems
.
It is a new
technology for computers to
communicate. Despite the multiple benefits of the mobile agent, but there are several obstacles to i
ts
spread.
The mobile agent protection is one of these obstacles. In this paper a new mechanism has been
proposed to protect mobile. The mechanism
is
called Partial
-
Mobility Mechanism (PMM). The main idea
behind this mechanism is to allow to mobile agent
s
to visit ma
licious hosts partially by using a
O
ne
-
H
op
-
Agent (
OHA)
.
OHA
is a type of
the mobile agent that
contains only a task that will be executed in a
malicious host.
By avoiding the mobile agent to visit the malicious host,
PMM completely protect
s
the
mobile age
nt’s secrecy and integrity. PMM has been implemented using .Net framework and C#
technologies
. Some experiments have been conducted to test the feasibility and performance of the
mechanism. Full analysis of the results have been presented and discussed.
GA-CFS APPROACH TO INCREASE THE ACCURACY OF ESTIMATES IN ELECTIONS PARTICIPATIONijfcstjournal
Prediction the main indexes of participation in election and its effective factors are serious challenges for
political and social planners. By respect to abnormal nature of offered analyzes by political scientists, data
searchers tried to solve the problems of other methods by discovering hidden sciences of data. In this
paper, we represent combined method of Genetic Algorithm (GA) and Correlation-based feature selection
(CFS) for increasing precision of classifying in methods based on data searching for participation in
election which identifies and removes noised Feature of total set of them. Results of our paper indicated
that our offered method could increase precision of other methods prediction.
Tracking number plate from vehicle usingijfcstjournal
In Traffic surveillance, Tracking of the number plate from the vehicle is an important task, which demands
intelligent solution. In this document, extraction and Recognization of number plate from vehicles image
has been done using Matlab. It is assumed that images of the vehicle have been captured from Digital
Camera. Alphanumeric Characters on plate has been Extracted and recognized using template images of
alphanumeric characters.
This paper presents a new algorithm in MATLAB which has been used to extract the number plate from the
vehicle in various luminance conditions. Extracted image of the number plate can be seen in a text file for
verification purpose. Number plate identification is helpful in finding stolen cars, car parking management
system and identification of vehicle in traffic.
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.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
Based on Heterogeneity and Electing Probability of Nodes Improvement in LEACHijsrd.com
In heterogeneous sensor networks, certain nodes become cluster heads which aggregate the data of their cluster nodes and transfer it to the sink. An Improved Energy leach protocol for cluster head selection in a hierarchically clustered heterogeneous network to reorganize the network topology efficiently is proposed in this research work. The proposed algorithm will use thresholding to improve the cluster head selection. The presented algorithm considers the sensor nodes in wireless network and randomly distributed in the heterogeneous network. The coordinates of the sink and the dimensions of the sensor field are known in prior.
Random Key Pre-distribution Schemes using Multi-Path in Wireless Sensor Networksijceronline
International Journal of Computational Engineering Research (IJCER) is dedicated to protecting personal information and will make every reasonable effort to handle collected information appropriately. All information collected, as well as related requests, will be handled as carefully and efficiently as possible in accordance with IJCER standards for integrity and objectivity.
Characterization of directed diffusion protocol in wireless sensor networkijwmn
Wireless sensor network (WSN) has enormous applications in many places for monitoring the environments
of importance. Sensor nodes are capable of sensing, computing, and communicating. These sensor nodes
are energy constraint and operated by batteries. Since energy consumption is an important issue of WSN,
there have been many energy-efficient protocols proposed for the WSN. Directed diffusion (DD) is a datacentric
protocol that focuses on the energy efficiency of the networks. Since the first proposal of DD
protocol by Deborah, there have been various versions of DD protocols proposed by many scientists across
the globe. These upgraded versions of DD protocols add on various features to the original DD protocol
such as energy, scalability, network lifetime, security, reliability, and mobility. In this paper, we discuss
and classify various characteristics of themost populardirected diffusion protocols that have been proposed
over couple of years.
Survey on Routing in Opportunistic Networks
this paper basically overviews and disused those potential methods and Techniques to select next hop to forward the packets (message) to destination.
Designing an opportunistic routing scheme for adaptive clustering in mobile a...eSAT Publishing House
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology.
Designing an opportunistic routing scheme for adaptive clustering in mobile a...eSAT Journals
Abstract Mobile networks have received great deal of attention during last few decades due to their potential applications such as large scale, improved flexibility and reduced costs. This proposed work addresses two problems associated with mobile network such as method to reduce overhead between the nodes, and energy balanced routing of packets by Co-Operative opportunistic routing for cluster based communication. We propose a modified algorithm that uses On-Demand Opportunistic Group mobility based clustering (ODOGMBC) for forming the cluster and predicting the cluster mobility by neighbourhood update algorithm. Cluster formation involves election of a mobile node as Cluster head. Each cluster comprises of cluster head and non-cluster head node that forms a cluster dynamically. Each node in the network continuously finds it neighbour by communicating with them, and nodes have consistent updated routing information in route cache by neighbourhood update algorithm. In routing process packet forwarded by the source node is updated by intermediate forwarder if topology undergo changes. This opportunistic routing scheme provides responsive data transportation and managing the node effectively, even in heavily loaded environment. Thus, our proposed routing technique helps us to reduce overhead, increases efficiency and better control of path selection. Keywords- Clustering, Forwarder, MANET, Prediction, Reactive, opportunistic routing.
DATA FORWARDING IN OPPORTUNISTIC NETWORK USING MOBILE TRACEScscpconf
Opportunistic networks are usually formed spontaneously by mobile devices equipped with
short range wireless communication interfaces. The idea is that an end-to-end connection may
never be present. Designing and implementing a routing protocol to support both service
discovery and delivery in such kinds of networks is a challenging problem on account of
frequent disconnections and topology changes. In these networks one of the most important
issues relies on the selection of the best intermediate node to forward the messages towards the
destination. This paper presents a mobile trace based routing protocol that uses the location
information of the nodes in the network. Using the trace information, next hop is selected to forward the packets to destination. Data forwarding is done via the selected nodes. The effectiveness is shown using simulation
CLUSTER BASED FIDELITY TO SECURE DSDV PROTOCOL AGAINST BLACK HOLE ATTACKSpijans
In this paper, we introduce and discuss an approach that will be used to secure the DSDV routing
protocol in an ad-hoc network. Due to mobility and absence of infrastructure, nodes are more vulnerable
to several malicious attacks. The secure routing is essential to transmit packets from source to the
destination. Our approach consists to model and manage fidelity concept in an ad-hoc clustering
architecture. Clustering makes it possible to group the mobile nodes and to send data simultaneously to
the each group. Our security model thus aims to integrate mechanisms against black hole attacks, forcing cooperation between nodes and detecting failing behaviors. The nodes present in the clusters will work
more efficiently and the message passing within the nodes will also get more authenticated from the
cluster heads. The simulation of our proposed algorithm is carried out using NS2 network simulator by evaluating some network performances such as average delay, throughput of communication and packets
loss
CLUSTER BASED FIDELITY TO SECURE DSDV PROTOCOL AGAINST BLACK HOLE ATTACKSpijans
In this paper, we introduce and discuss an approach that will be used to secure the DSDV routing
protocol in an ad-hoc network. Due to mobility and absence of infrastructure, nodes are more vulnerable
to several malicious attacks. The secure routing is essential to transmit packets from source to the
destination. Our approach consists to model and manage fidelity concept in an ad-hoc clustering
architecture. Clustering makes it possible to group the mobile nodes and to send data simultaneously to
the each group. Our security model thus aims to integrate mechanisms against black hole attacks, forcing
cooperation between nodes and detecting failing behaviors. The nodes present in the clusters will work
more efficiently and the message passing within the nodes will also get more authenticated from the
cluster heads. The simulation of our proposed algorithm is carried out using NS2 network simulator by
evaluating some network performances such as average delay, throughput of communication and packets
loss.
Key Establishment using Selective Repeat Automatic Repeat Request Mechanism f...ijceronline
International Journal of Computational Engineering Research (IJCER) is dedicated to protecting personal information and will make every reasonable effort to handle collected information appropriately. All information collected, as well as related requests, will be handled as carefully and efficiently as possible in accordance with IJCER standards for integrity and objectivity.
CLUSTER BASED FIDELITY TO SECURE DSDV PROTOCOL AGAINST BLACK HOLE ATTACKSpijans
In this paper, we introduce and discuss an approach that will be used to secure the DSDV routing
protocol in an ad-hoc network. Due to mobility and absence of infrastructure, nodes are more vulnerable
to several malicious attacks. The secure routing is essential to transmit packets from source to the
destination. Our approach consists to model and manage fidelity concept in an ad-hoc clustering
architecture. Clustering makes it possible to group the mobile nodes and to send data simultaneously to
the each group. Our security model thus aims to integrate mechanisms against black hole attacks, forcing
cooperation between nodes and detecting failing behaviors. The nodes present in the clusters will work
more efficiently and the message passing within the nodes will also get more authenticated from the
cluster heads. The simulation of our proposed algorithm is carried out using NS2 network simulator by
evaluating some network performances such as average delay, throughput of communication and packets
loss.
MULTI-HOP DISTRIBUTED ENERGY EFFICIENT HIERARCHICAL CLUSTERING SCHEME FOR HET...ijfcstjournal
Wireless sensor network (WSNs) are network of Sensor Nodes (SNs) with inherent sensing, processing and
communicating abilities. One of current concerns in wireless sensor networks is developing a stable
clustered heterogeneous protocol prolonging the network lifetime with minimum consumption of battery
power. In the recent times, many routing protocols have been proposed increasing the network lifetime,
stability in short proposing a reliable and robust routing protocol. In this paper we study the impact of
hierarchical clustered network with sensor nodes of two-level heterogeneity. The main approach in this
research is to develop an enhanced multi-hop DEEC routing protocol unlike DEEC. Simulation results
show the proposed protocol is better than DEEC in terms of FDN (First Dead Node), energy consumption
and Packet transmission.
MULTI-HOP DISTRIBUTED ENERGY EFFICIENT HIERARCHICAL CLUSTERING SCHEME FOR H...ijfcstjournal
Wireless sensor network (WSNs) are network of Sensor Nodes (SNs) with inherent sensing, processing and
communicating abilities. One of current concerns in wireless sensor networks is developing a stable
clustered heterogeneous protocol prolonging the network lifetime with minimum consumption of battery
power. In the recent times, many routing protocols have been proposed increasing the network lifetime,
stability in short proposing a reliable and robust routing protocol. In this paper we study the impact of
hierarchical clustered network with sensor nodes of two-level heterogeneity. The main approach in this
research is to develop an enhanced multi-hop DEEC routing protocol unlike DEEC. Simulation results
show the proposed protocol is better than DEEC in terms of FDN (First Dead Node), energy consumption
and Packet transmission.
ENERGY EFFICIENT, LIFETIME IMPROVING AND SECURE PERIODIC DATA COLLECTION PROT...ijcsa
The most emerging prominent sensor network applications collect data from sensor nodes and monitors
periodically. Resource constraint Sensor motes sense the environment and transit data to the remote sink
via multiple hops. Minimum energy dissipation and secure data transmission are crucial to such
applications. This paper delivers an energy efficient, lifetime improving, secure periodic Data Gathering
scheme that is a hybrid of heuristic path establishment and secure data transmission. This protocol uses
artificial intelligence (AI) based A* heuristic search algorithm to establish energy efficient admissible
optimal path to sink in terms of high residual energy, minimum hop counts and high link quality. This
scheme also adopts block encryption Rivest Cipher (RC6) Algorithm to secure the transmission of packets.
This code and speed optimized block encryption provides confidentiality against critical data and
consumes less energy for encryption. This proposed method increases the network lifetime there by
reducing the total traffic load. Evaluation of performance analysis of this algorithm using Network
Simulator (NS2) shows the superiority of the proposed scheme
Similar to Secure multipath routing scheme using key (20)
ENHANCING ENGLISH WRITING SKILLS THROUGH INTERNET-PLUS TOOLS IN THE PERSPECTI...ijfcstjournal
This investigation delves into incorporating a hybridized memetic strategy within the framework of English
composition pedagogy, leveraging Internet Plus resources. The study aims to provide an in-depth analysis
of how this method influences students’ writing competence, their perceptions of writing, and their
enthusiasm for English acquisition. Employing an explanatory research design that combines qualitative
and quantitative methods, the study collects data through surveys, interviews, and observations of students’
writing performance before and after the intervention. Findings demonstrate a beneficial impact of
integrating the memetic approach alongside Internet Plus tools on the writing aptitude of English as a
Foreign Language (EFL) learners. Students reported increased engagement with writing, attributing it to
the use of Internet plus tools. They also expressed that the memetic approach facilitated a deeper
understanding of cultural and social contexts in writing. Furthermore, the findings highlight a significant
improvement in students’ writing skills following the intervention. This study provides significant insights
into the practical implementation of the memetic approach within English writing education, highlighting
the beneficial contribution of Internet Plus tools in enriching students' learning journeys.
A SURVEY TO REAL-TIME MESSAGE-ROUTING NETWORK SYSTEM WITH KLA MODELLINGijfcstjournal
Messages routing over a network is one of the most fundamental concept in communication which requires
simultaneous transmission of messages from a source to a destination. In terms of Real-Time Routing, it
refers to the addition of a timing constraint in which messages should be received within a specified time
delay. This study involves Scheduling, Algorithm Design and Graph Theory which are essential parts of
the Computer Science (CS) discipline. Our goal is to investigate an innovative and efficient way to present
these concepts in the context of CS Education. In this paper, we will explore the fundamental modelling of
routing real-time messages on networks. We study whether it is possible to have an optimal on-line
algorithm for the Arbitrary Directed Graph network topology. In addition, we will examine the message
routing’s algorithmic complexity by breaking down the complex mathematical proofs into concrete, visual
examples. Next, we explore the Unidirectional Ring topology in finding the transmission’s
“makespan”.Lastly, we propose the same network modelling through the technique of Kinesthetic Learning
Activity (KLA). We will analyse the data collected and present the results in a case study to evaluate the
effectiveness of the KLA approach compared to the traditional teaching method.
A COMPARATIVE ANALYSIS ON SOFTWARE ARCHITECTURE STYLESijfcstjournal
Software architecture is the structural solution that achieves the overall technical and operational
requirements for software developments. Software engineers applied software architectures for their
software system developments; however, they worry the basic benchmarks in order to select software
architecture styles, possible components, integration methods (connectors) and the exact application of
each style.
The objective of this research work was a comparative analysis of software architecture styles by its
weakness and benefits in order to select by the programmer during their design time. Finally, in this study,
the researcher has been identified architectural styles, weakness, and Strength and application areas with
its component, connector and Interface for the selected architectural styles.
SYSTEM ANALYSIS AND DESIGN FOR A BUSINESS DEVELOPMENT MANAGEMENT SYSTEM BASED...ijfcstjournal
A design of a sales system for professional services requires a comprehensive understanding of the
dynamics of sale cycles and how key knowledge for completing sales is managed. This research describes
a design model of a business development (sales) system for professional service firms based on the Saudi
Arabian commercial market, which takes into account the new advances in technology while preserving
unique or cultural practices that are an important part of the Saudi Arabian commercial market. The
design model has combined a number of key technologies, such as cloud computing and mobility, as an
integral part of the proposed system. An adaptive development process has also been used in implementing
the proposed design model.
AN ALGORITHM FOR SOLVING LINEAR OPTIMIZATION PROBLEMS SUBJECTED TO THE INTERS...ijfcstjournal
Frank t-norms are parametric family of continuous Archimedean t-norms whose members are also strict
functions. Very often, this family of t-norms is also called the family of fundamental t-norms because of the
role it plays in several applications. In this paper, optimization of a linear objective function with fuzzy
relational inequality constraints is investigated. The feasible region is formed as the intersection of two
inequality fuzzy systems defined by frank family of t-norms is considered as fuzzy composition. First, the
resolution of the feasible solutions set is studied where the two fuzzy inequality systems are defined with
max-Frank composition. Second, some related basic and theoretical properties are derived. Then, a
necessary and sufficient condition and three other necessary conditions are presented to conceptualize the
feasibility of the problem. Subsequently, it is shown that a lower bound is always attainable for the optimal
objective value. Also, it is proved that the optimal solution of the problem is always resulted from the
unique maximum solution and a minimal solution of the feasible region. Finally, an algorithm is presented
to solve the problem and an example is described to illustrate the algorithm. Additionally, a method is
proposed to generate random feasible max-Frank fuzzy relational inequalities. By this method, we can
easily generate a feasible test problem and employ our algorithm to it.
LBRP: A RESILIENT ENERGY HARVESTING NOISE AWARE ROUTING PROTOCOL FOR UNDER WA...ijfcstjournal
Underwater detector network is one amongst the foremost difficult and fascinating analysis arenas that
open the door of pleasing plenty of researchers during this field of study. In several under water based
sensor applications, nodes are square measured and through this the energy is affected. Thus, the mobility
of each sensor nodes are measured through the water atmosphere from the water flow for sensor based
protocol formations. Researchers have developed many routing protocols. However, those lost their charm
with the time. This can be the demand of the age to supply associate degree upon energy-efficient and
ascendable strong routing protocol for under water actuator networks. During this work, the authors tend
to propose a customary routing protocol named level primarily based routing protocol (LBRP), reaching to
offer strong, ascendable and energy economical routing. LBRP conjointly guarantees the most effective use
of total energy consumption and ensures packet transmission which redirects as an additional reliability in
compare to different routing protocols. In this work, the authors have used the level of forwarding node,
residual energy and distance from the forwarding node to the causing node as a proof in multicasting
technique comparisons. Throughout this work, the authors have got a recognition result concerning about
86.35% on the average in node multicasting performances. Simulation has been experienced each in a
wheezy and quiet atmosphere which represents the endorsement of higher performance for the planned
protocol.
STRUCTURAL DYNAMICS AND EVOLUTION OF CAPSULE ENDOSCOPY (PILL CAMERA) TECHNOLO...ijfcstjournal
This research paper examined and re-evaluates the technological innovation, theory, structural dynamics
and evolution of Pill Camera(Capsule Endoscopy) technology in redirecting the response manner of small
bowel (intestine) examination in human. The Pill Camera (Endoscopy Capsule) is made up of sealed
biocompatible material to withstand acid, enzymes and other antibody chemicals in the stomach is a
technology that helps the medical practitioners especially the general physicians and the
gastroenterologists to examine and re-examine the intestine for possible bleeding or infection. Before the
advent of the Pill camera (Endoscopy Capsule) the colonoscopy was the local method used but research
showed that some parts (bowel) of the intestine can’t be reach by mere traditional method hence the need
for Pill Camera. Countless number of deaths from stomach disease such as polyps, inflammatory bowel
(Crohn”s diseases), Cancers, Ulcer, anaemia and tumours of small intestines which ordinary would have
been detected by sophisticated technology like Pill Camera has become norm in the developing nations.
Nevertheless, not only will this paper examine and re-evaluate the Pill Camera Innovation, theory,
Structural dynamics and evolution it unravelled and aimed to create awareness for both medical
practitioners and the public.
AN OPTIMIZED HYBRID APPROACH FOR PATH FINDINGijfcstjournal
Path finding algorithm addresses problem of finding shortest path from source to destination avoiding
obstacles. There exist various search algorithms namely A*, Dijkstra's and ant colony optimization. Unlike
most path finding algorithms which require destination co-ordinates to compute path, the proposed
algorithm comprises of a new method which finds path using backtracking without requiring destination
co-ordinates. Moreover, in existing path finding algorithm, the number of iterations required to find path is
large. Hence, to overcome this, an algorithm is proposed which reduces number of iterations required to
traverse the path. The proposed algorithm is hybrid of backtracking and a new technique(modified 8-
neighbor approach). The proposed algorithm can become essential part in location based, network, gaming
applications. grid traversal, navigation, gaming applications, mobile robot and Artificial Intelligence.
EAGRO CROP MARKETING FOR FARMING COMMUNITYijfcstjournal
The Major Occupation in India is the Agriculture; the people involved in the Agriculture belong to the poor
class and category. The people of the farming community are unaware of the new techniques and Agromachines, which would direct the world to greater heights in the field of agriculture. Though the farmers
work hard, they are cheated by agents in today’s market. This serves as a opportunity to solve
all the problems that farmers face in the current world. The eAgro crop marketing will serve as a better
way for the farmers to sell their products within the country with some mediocre knowledge about using
the website. This would provide information to the farmers about current market rate of agro-products,
their sale history and profits earned in a sale. This site will also help the farmers to know about the market
information and to view agricultural schemes of the Government provided to farmers.
EDGE-TENACITY IN CYCLES AND COMPLETE GRAPHSijfcstjournal
It is well known that the tenacity is a proper measure for studying vulnerability and reliability in graphs.
Here, a modified edge-tenacity of a graph is introduced based on the classical definition of tenacity.
Properties and bounds for this measure are introduced; meanwhile edge-tenacity is calculated for cycle
graphs and also for complete graphs.
COMPARATIVE STUDY OF DIFFERENT ALGORITHMS TO SOLVE N QUEENS PROBLEMijfcstjournal
This Paper provides a brief description of the Genetic Algorithm (GA), the Simulated Annealing (SA)
Algorithm, the Backtracking (BT) Algorithm and the Brute Force (BF) Search Algorithm and attempts to
explain the way as how the Proposed Genetic Algorithm (GA), the Proposed Simulated Annealing (SA)
Algorithm using GA, the Backtracking (BT) Algorithm and the Brute Force (BF) Search Algorithm can be
employed in finding the best solution of N Queens Problem and also, makes a comparison between these
four algorithms. It is entirely a review based work. The four algorithms were written as well as
implemented. From the Results, it was found that, the Proposed Genetic Algorithm (GA) performed better
than the Proposed Simulated Annealing (SA) Algorithm using GA, the Backtracking (BT) Algorithm and
the Brute Force (BF) Search Algorithm and it also provided better fitness value (solution) than the
Proposed Simulated Annealing Algorithm (SA) using GA, the Backtracking (BT) Algorithm and the Brute
Force (BF) Search Algorithm, for different N values. Also, it was noticed that, the Proposed GA took more
time to provide result than the Proposed SA using GA.
PSTECEQL: A NOVEL EVENT QUERY LANGUAGE FOR VANET’S UNCERTAIN EVENT STREAMSijfcstjournal
In recent years, the complex event processing technology has been used to process the VANET’s temporal
and spatial event streams. However, we usually cannot get the accurate data because the device sensing
accuracy limitations of the system. We only can get the uncertain data from the complex and limited
environment of the VANET. Because the VANET’s event streams are consist of the uncertain data, so they
are also uncertain. How effective to express and process these uncertain event streams has become the core
issue for the VANET system. To solve this problem, we propose a novel complex event query language
PSTeCEQL (probabilistic spatio-temporal constraint event query language). Firstly, we give the definition
of the possible world model of VANET’s uncertain event streams. Secondly, we propose an event query
language PSTeCEQL and give the syntax and the operational semantics of the language. Finally, we
illustrate the validity of the PSTeCEQL by an example.
CLUSTBIGFIM-FREQUENT ITEMSET MINING OF BIG DATA USING PRE-PROCESSING BASED ON...ijfcstjournal
Now a day enormous amount of data is getting explored through Internet of Things (IoT) as technologies
are advancing and people uses these technologies in day to day activities, this data is termed as Big Data
having its characteristics and challenges. Frequent Itemset Mining algorithms are aimed to disclose
frequent itemsets from transactional database but as the dataset size increases, it cannot be handled by
traditional frequent itemset mining. MapReduce programming model solves the problem of large datasets
but it has large communication cost which reduces execution efficiency. This proposed new pre-processed
k-means technique applied on BigFIM algorithm. ClustBigFIM uses hybrid approach, clustering using kmeans algorithm to generate Clusters from huge datasets and Apriori and Eclat to mine frequent itemsets
from generated clusters using MapReduce programming model. Results shown that execution efficiency of
ClustBigFIM algorithm is increased by applying k-means clustering algorithm before BigFIM algorithm as
one of the pre-processing technique.
A MUTATION TESTING ANALYSIS AND REGRESSION TESTINGijfcstjournal
Software testing is a testing which conducted a test to provide information to client about the quality of the
product under test. Software testing can also provide an objective, independent view of the software to
allow the business to appreciate and understand the risks of software implementation. In this paper we
focused on two main software testing –mutation testing and mutation testing. Mutation testing is a
procedural testing method, i.e. we use the structure of the code to guide the test program, A mutation is a
little change in a program. Such changes are applied to model low level defects that obtain in the process
of coding systems. Ideally mutations should model low-level defect creation. Mutation testing is a process
of testing in which code is modified then mutated code is tested against test suites. The mutations used in
source code are planned to include in common programming errors. A good unit test typically detects the
program mutations and fails automatically. Mutation testing is used on many different platforms, including
Java, C++, C# and Ruby. Regression testing is a type of software testing that seeks to uncover
new software bugs, or regressions, in existing functional and non-functional areas of a system after
changes such as enhancements, patches or configuration changes, have been made to them. When defects
are found during testing, the defect got fixed and that part of the software started working as needed. But
there may be a case that the defects that fixed have introduced or uncovered a different defect in the
software. The way to detect these unexpected bugs and to fix them used regression testing. The main focus
of regression testing is to verify that changes in the software or program have not made any adverse side
effects and that the software still meets its need. Regression tests are done when there are any changes
made on software, because of modified functions.
GREEN WSN- OPTIMIZATION OF ENERGY USE THROUGH REDUCTION IN COMMUNICATION WORK...ijfcstjournal
Advances in micro fabrication and communication techniques have led to unimaginable proliferation of
WSN applications. Research is focussed on reduction of setup operational energy costs. Bulk of operational
energy costs are linked to communication activities of WSN. Any progress towards energy efficiency has a
potential of huge savings globally. Therefore, every energy efficient step is an endeavour to cut costs and
‘Go Green’. In this paper, we have proposed a framework to reduce communication workload through: Innetwork compression and multiple query synthesis at the base-station and modification of query syntax
through introduction of Static Variables. These approaches are general approaches which can be used in
any WSN irrespective of application.
A NEW MODEL FOR SOFTWARE COSTESTIMATION USING HARMONY SEARCHijfcstjournal
Accurate and realistic estimation is always considered to be a great challenge in software industry.
Software Cost Estimation (SCE) is the standard application used to manage software projects. Determining
the amount of estimation in the initial stages of the project depends on planning other activities of the
project. In fact, the estimation is confronted with a number of uncertainties and barriers’, yet assessing the
previous projects is essential to solve this problem. Several models have been developed for the analysis of
software projects. But the classical reference method is the COCOMO model, there are other methods
which are also applied such as Function Point (FP), Line of Code(LOC); meanwhile, the expert`s opinions
matter in this regard. In recent years, the growth and the combination of meta-heuristic algorithms with
high accuracy have brought about a great achievement in software engineering. Meta-heuristic algorithms
which can analyze data from multiple dimensions and identify the optimum solution between them are
analytical tools for the analysis of data. In this paper, we have used the Harmony Search (HS)algorithm for
SCE. The proposed model which is a collection of 60 standard projects from Dataset NASA60 has been
assessed.The experimental results show that HS algorithm is a good way for determining the weight
similarity measures factors of software effort, and reducing the error of MRE.
AGENT ENABLED MINING OF DISTRIBUTED PROTEIN DATA BANKSijfcstjournal
Mining biological data is an emergent area at the intersection between bioinformatics and data mining
(DM). The intelligent agent based model is a popular approach in constructing Distributed Data Mining
(DDM) systems to address scalable mining over large scale distributed data. The nature of associations
between different amino acids in proteins has also been a subject of great anxiety. There is a strong need to
develop new models and exploit and analyze the available distributed biological data sources. In this study,
we have designed and implemented a multi-agent system (MAS) called Agent enriched Quantitative
Association Rules Mining for Amino Acids in distributed Protein Data Banks (AeQARM-AAPDB). Such
globally strong association rules enhance understanding of protein composition and are desirable for
synthesis of artificial proteins. A real protein data bank is used to validate the system.
International Journal on Foundations of Computer Science & Technology (IJFCST)ijfcstjournal
International Journal on Foundations of Computer Science & Technology (IJFCST) is a Bi-monthly peer-reviewed and refereed open access journal that publishes articles which contribute new results in all areas of the Foundations of Computer Science & Technology. Over the last decade, there has been an explosion in the field of computer science to solve various problems from mathematics to engineering. This journal aims to provide a platform for exchanging ideas in new emerging trends that needs more focus and exposure and will attempt to publish proposals that strengthen our goals. Topics of interest include, but are not limited to the following:
Because the technology is used largely in the last decades; cybercrimes have become a significant
international issue as a result of the huge damage that it causes to the business and even to the ordinary
users of technology. The main aims of this paper is to shed light on digital crimes and gives overview about
what a person who is related to computer science has to know about this new type of crimes. The paper has
three sections: Introduction to Digital Crime which gives fundamental information about digital crimes,
Digital Crime Investigation which presents different investigation models and the third section is about
Cybercrime Law.
DISTRIBUTION OF MAXIMAL CLIQUE SIZE UNDER THE WATTS-STROGATZ MODEL OF EVOLUTI...ijfcstjournal
In this paper, we analyze the evolution of a small-world network and its subsequent transformation to a
random network using the idea of link rewiring under the well-known Watts-Strogatz model for complex
networks. Every link u-v in the regular network is considered for rewiring with a certain probability and if
chosen for rewiring, the link u-v is removed from the network and the node u is connected to a randomly
chosen node w (other than nodes u and v). Our objective in this paper is to analyze the distribution of the
maximal clique size per node by varying the probability of link rewiring and the degree per node (number
of links incident on a node) in the initial regular network. For a given probability of rewiring and initial
number of links per node, we observe the distribution of the maximal clique per node to follow a Poisson
distribution. We also observe the maximal clique size per node in the small-world network to be very close
to that of the average value and close to that of the maximal clique size in a regular network. There is no
appreciable decrease in the maximal clique size per node when the network transforms from a regular
network to a small-world network. On the other hand, when the network transforms from a small-world
network to a random network, the average maximal clique size value decreases significantly
The Art of the Pitch: WordPress Relationships and SalesLaura Byrne
Clients don’t know what they don’t know. What web solutions are right for them? How does WordPress come into the picture? How do you make sure you understand scope and timeline? What do you do if sometime changes?
All these questions and more will be explored as we talk about matching clients’ needs with what your agency offers without pulling teeth or pulling your hair out. Practical tips, and strategies for successful relationship building that leads to closing the deal.
Key Trends Shaping the Future of Infrastructure.pdfCheryl Hung
Keynote at DIGIT West Expo, Glasgow on 29 May 2024.
Cheryl Hung, ochery.com
Sr Director, Infrastructure Ecosystem, Arm.
The key trends across hardware, cloud and open-source; exploring how these areas are likely to mature and develop over the short and long-term, and then considering how organisations can position themselves to adapt and thrive.
State of ICS and IoT Cyber Threat Landscape Report 2024 previewPrayukth K V
The IoT and OT threat landscape report has been prepared by the Threat Research Team at Sectrio using data from Sectrio, cyber threat intelligence farming facilities spread across over 85 cities around the world. In addition, Sectrio also runs AI-based advanced threat and payload engagement facilities that serve as sinks to attract and engage sophisticated threat actors, and newer malware including new variants and latent threats that are at an earlier stage of development.
The latest edition of the OT/ICS and IoT security Threat Landscape Report 2024 also covers:
State of global ICS asset and network exposure
Sectoral targets and attacks as well as the cost of ransom
Global APT activity, AI usage, actor and tactic profiles, and implications
Rise in volumes of AI-powered cyberattacks
Major cyber events in 2024
Malware and malicious payload trends
Cyberattack types and targets
Vulnerability exploit attempts on CVEs
Attacks on counties – USA
Expansion of bot farms – how, where, and why
In-depth analysis of the cyber threat landscape across North America, South America, Europe, APAC, and the Middle East
Why are attacks on smart factories rising?
Cyber risk predictions
Axis of attacks – Europe
Systemic attacks in the Middle East
Download the full report from here:
https://sectrio.com/resources/ot-threat-landscape-reports/sectrio-releases-ot-ics-and-iot-security-threat-landscape-report-2024/
Connector Corner: Automate dynamic content and events by pushing a buttonDianaGray10
Here is something new! In our next Connector Corner webinar, we will demonstrate how you can use a single workflow to:
Create a campaign using Mailchimp with merge tags/fields
Send an interactive Slack channel message (using buttons)
Have the message received by managers and peers along with a test email for review
But there’s more:
In a second workflow supporting the same use case, you’ll see:
Your campaign sent to target colleagues for approval
If the “Approve” button is clicked, a Jira/Zendesk ticket is created for the marketing design team
But—if the “Reject” button is pushed, colleagues will be alerted via Slack message
Join us to learn more about this new, human-in-the-loop capability, brought to you by Integration Service connectors.
And...
Speakers:
Akshay Agnihotri, Product Manager
Charlie Greenberg, Host
UiPath Test Automation using UiPath Test Suite series, part 3DianaGray10
Welcome to UiPath Test Automation using UiPath Test Suite series part 3. In this session, we will cover desktop automation along with UI automation.
Topics covered:
UI automation Introduction,
UI automation Sample
Desktop automation flow
Pradeep Chinnala, Senior Consultant Automation Developer @WonderBotz and UiPath MVP
Deepak Rai, Automation Practice Lead, Boundaryless Group and UiPath MVP
Essentials of Automations: Optimizing FME Workflows with ParametersSafe Software
Are you looking to streamline your workflows and boost your projects’ efficiency? Do you find yourself searching for ways to add flexibility and control over your FME workflows? If so, you’re in the right place.
Join us for an insightful dive into the world of FME parameters, a critical element in optimizing workflow efficiency. This webinar marks the beginning of our three-part “Essentials of Automation” series. This first webinar is designed to equip you with the knowledge and skills to utilize parameters effectively: enhancing the flexibility, maintainability, and user control of your FME projects.
Here’s what you’ll gain:
- Essentials of FME Parameters: Understand the pivotal role of parameters, including Reader/Writer, Transformer, User, and FME Flow categories. Discover how they are the key to unlocking automation and optimization within your workflows.
- Practical Applications in FME Form: Delve into key user parameter types including choice, connections, and file URLs. Allow users to control how a workflow runs, making your workflows more reusable. Learn to import values and deliver the best user experience for your workflows while enhancing accuracy.
- Optimization Strategies in FME Flow: Explore the creation and strategic deployment of parameters in FME Flow, including the use of deployment and geometry parameters, to maximize workflow efficiency.
- Pro Tips for Success: Gain insights on parameterizing connections and leveraging new features like Conditional Visibility for clarity and simplicity.
We’ll wrap up with a glimpse into future webinars, followed by a Q&A session to address your specific questions surrounding this topic.
Don’t miss this opportunity to elevate your FME expertise and drive your projects to new heights of efficiency.
Neuro-symbolic is not enough, we need neuro-*semantic*Frank van Harmelen
Neuro-symbolic (NeSy) AI is on the rise. However, simply machine learning on just any symbolic structure is not sufficient to really harvest the gains of NeSy. These will only be gained when the symbolic structures have an actual semantics. I give an operational definition of semantics as “predictable inference”.
All of this illustrated with link prediction over knowledge graphs, but the argument is general.
Generating a custom Ruby SDK for your web service or Rails API using Smithyg2nightmarescribd
Have you ever wanted a Ruby client API to communicate with your web service? Smithy is a protocol-agnostic language for defining services and SDKs. Smithy Ruby is an implementation of Smithy that generates a Ruby SDK using a Smithy model. In this talk, we will explore Smithy and Smithy Ruby to learn how to generate custom feature-rich SDKs that can communicate with any web service, such as a Rails JSON API.
Elevating Tactical DDD Patterns Through Object CalisthenicsDorra BARTAGUIZ
After immersing yourself in the blue book and its red counterpart, attending DDD-focused conferences, and applying tactical patterns, you're left with a crucial question: How do I ensure my design is effective? Tactical patterns within Domain-Driven Design (DDD) serve as guiding principles for creating clear and manageable domain models. However, achieving success with these patterns requires additional guidance. Interestingly, we've observed that a set of constraints initially designed for training purposes remarkably aligns with effective pattern implementation, offering a more ‘mechanical’ approach. Let's explore together how Object Calisthenics can elevate the design of your tactical DDD patterns, offering concrete help for those venturing into DDD for the first time!
Software Delivery At the Speed of AI: Inflectra Invests In AI-Powered QualityInflectra
In this insightful webinar, Inflectra explores how artificial intelligence (AI) is transforming software development and testing. Discover how AI-powered tools are revolutionizing every stage of the software development lifecycle (SDLC), from design and prototyping to testing, deployment, and monitoring.
Learn about:
• The Future of Testing: How AI is shifting testing towards verification, analysis, and higher-level skills, while reducing repetitive tasks.
• Test Automation: How AI-powered test case generation, optimization, and self-healing tests are making testing more efficient and effective.
• Visual Testing: Explore the emerging capabilities of AI in visual testing and how it's set to revolutionize UI verification.
• Inflectra's AI Solutions: See demonstrations of Inflectra's cutting-edge AI tools like the ChatGPT plugin and Azure Open AI platform, designed to streamline your testing process.
Whether you're a developer, tester, or QA professional, this webinar will give you valuable insights into how AI is shaping the future of software delivery.
Accelerate your Kubernetes clusters with Varnish CachingThijs Feryn
A presentation about the usage and availability of Varnish on Kubernetes. This talk explores the capabilities of Varnish caching and shows how to use the Varnish Helm chart to deploy it to Kubernetes.
This presentation was delivered at K8SUG Singapore. See https://feryn.eu/presentations/accelerate-your-kubernetes-clusters-with-varnish-caching-k8sug-singapore-28-2024 for more details.
Accelerate your Kubernetes clusters with Varnish Caching
Secure multipath routing scheme using key
1. International Journal in Foundations of Computer Science & Technology (IJFCST), Vol.4, No.4, July 2014
DOI:10.5121/ijfcst.2014.4404 49
SECURE MULTIPATH ROUTING SCHEME USING KEY
PRE-DISTRIBUTION IN WIRELESS SENSOR
NETWORKS
Kamal Kumar1
, A. K. Verma2
and R. B. Patel3
1
M.M. Engineering College, Haryana, 133207 - India
2
Thapar University, Patiala, Punjab, 147004- India
3
G. B. Pant College of Engineering. Pauri, Uttrakhand, 131039- India
ABSTRACT
Multipath routing in WSN has been a long wish in security scenario where nodes on next-hop may be
targeted to compromise. Many proposals of Multipath routing has been proposed in ADHOC Networks but
under constrained from keying environment most seems ignorant. In WSN where crucial data is reported by
nodes in deployment area to their securely located Sink, route security has to be guaranteed. Under
dynamic load and selective attacks, availability of multiple secure paths is a boon and increases the
attacker efforts by many folds. We propose to build a subset of neighbors as our front towards destination
node. We also identified forwarders for query by base station. The front is optimally calculated to maintain
the security credential and avail multiple paths. According to our knowledge ours is a novel secure
multipath routing protocol for WSN. We established effectiveness of our proposal with mathematical
analysis.
KEYWORDS
Multipath, Wireless Sensor Network, Security, Forwarder, Routing.
1. INTRODUCTION
WSN network evolved as monitoring tool in adverse, dynamically changing environment.
Besides being used for security critical applications it surfaced into daily life monitoring systems
ranging from mining applications to steel furnace reporting, from libraries to under-water
monitoring, from moisture controlling to dam-reservoir controller, from toll-plaza to grocery-
stores. Applications are in abundance and so are the issues. With increasing demands for
customized setups of WSNs new issues also surfaced. It needs custom solutions to demanding
situations. Many works has addressed the specific issues in WSN. We specifically limit ourselves
to problem of maintaining multiple routes not necessarily node-disjoint through networks which
are equally secure and have qualified under a complex qualifying criterion in threat prone
deployment areas. Besides improving upon best-effort delivery we tried to maintain high value of
protection keys in the links. We are working on the principle that route is as strong as the weakest
link in the route. We have proposed a probabilistic model for selecting our front towards a
specific destination. Proposal has been generic and we specialized it to achieve security
requirements in the threat prone deployments. Probabilistic model can be specialized for other
requirements like distance, energy, throughput and delay. Section 2 discusses related work in the
area with section 3 and 4presenting network and probabilistic analytical model of proposal and
routing scheme. Section 5 we present performance analysis. With Section 6 we finally conclude
and cite future directions.
2. International Journal in Foundations of Computer Science & Technology (IJFCST), Vol.4, No.4, July 2014
50
1
2
2. RELATED WORKS
Several works in security and key management in WSN have been reported and most addressed
the security of single path from sender to destination. Proposals in [2] and [3] addressed the the
provisioning of security in WSN using Single Network-Wide Key. Compromising one key will
compromise the security of whole network. In [3] an approach for establishing Pair-wise between
every pair of nodes was proposed but the initialization of scheme is based on master key. Master
key is erased after initialization and thus not scalable. A proposal in [55] proposed Trusted Base
Station based key management scheme SPINS using SNEP and μTESLA as building blocks.
SNEP offers data confidentiality, authentication, integrity, and freshness, while μTESLA offers
broadcast data authentication. SPINS uses less of a sensor node’s memory and the
communication costs for SPINS are small, with security properties like data freshness,
authentication and confidentiality. Several proposals [4] [5] [6] [8] addressed the security using
key pre-distribution schemes. Most of these schemes allow the probabilistic approach to decide
the security credential. In [7] and [9] authors proposed a scheme using deployment knowledge. A
scheme in [10] was proposed for using location dependence in clustered hierarchical sensor
networks. We have proposed few key management schemes in [11] [12] [13] [14] and [15].
Scheme in [11] guarantee connectivity using location effect in pre distributed keying
environment. In [12] we proposed a scheme implementing framework for key management
schemes in heterogeneous wireless sensor networks. In [13] we proposed a key management
which is most computation efficient and storage efficient. In [14] we proposed a key management
scheme which build secure route from source to destination using variance of keys on links on
route while selecting next link on route being built. In [15] we implemented a key management
scheme which exploits location information. None of the scheme cited above offers multiple and
equally secure paths between source and destination.
3. OUR PROPOSAL
In this section we present our proposal with network elements and network model. We could
address the query and data routing in our proposal using Query Relays (QR) and
Figure 1. Wireless Environment Scenario
Data Relays DR). QR relays the query from sink to a deployment area or single node. DR route
reply back to sink using data relays. The routes for query and reply may have same or disjoint
routes and ensures minimum delay.
3. International Journal in Foundations of Computer Science & Technology (IJFCST), Vol.4, No.4, July 2014
51
3.1 Preliminary
We consider a list of forward nodes as proposed in [1] for selecting nodes out of one hop
neighbours towards a particular destination. This is as shown in figure.1. Single destination in
WSN happens to be Base Station. Nodes are homogeneous in nature and have fixed transmission
range. Diagram in figure represents an example scenario. Each link in figure1 cost some energy to
sender and receiver. With error prone environment each link suffers some error. Node has
selected nodes { , , … , } as possible set of forwarding nodes. This is treated as priority list
and node considered to most preferred node. Opportunistically nodes forward message sent by
towards BS. There is possibility of multiple copies of message being forwarded by forwarder
nodes because of hidden node problems. Opportunistic routing may suffer from duplicated
packets as there is no solution for schedule for nodes forwarding packets via forwarder nodes and
security is not considered and thus prone threats.
3.2 Network Model and Elements
We consider a wireless Sensor Network consisting of Large Number of L-Sensors and a few
number of H-Sensors. Initially, we assume 15% of total nodes consist of H-Sensors. Nodes are
given unique IDs and are assigned by Sink. Each Sensor has fixed transmission range. We may
assume that H-Sensor has comparatively larger transmission range and more storage capacity to
entail larger number of keys. The resultant network is modeled as multi-hop network and fits the
definition of graph. An edge between a pair implies connectivity between concerned nodes.
Consider a WSN with nodes having unique identities (IDs). We assume that every wireless node
has fixed transmission power. Assume = { , , , , , , , } where denotes
deployment area dimensions, denotes number of H-Sensors, describes the strength of L-
Sensors, is the key pool, denotes number of keys given to L-Sensors, denotes number of
keys pre-distributed to H-Sensors. Denote the undirected/undirected edge set and denotes
nodes set respectively. Each directed link ⟶ has a nonnegative weight, denoted by ( , )
which is the number of shared randomly pre-distributed keys and to be used by node together to
send a packet to node for encryption during forwarding. In addition, each link has a failure
probability, denoted by ( , ), which is the probability that a transmission over link ( , ) is
not successful because of unavailability or schedule, i.e., to have a chance of 1 − ( , ) for
successful secure transmission a packet to node ; node must be active or not simultaneously
receiving other transmission. No transmission is possible if node’s shares no key. To illustrate the
idea let us consider a network example in Figure 2.
Figure 2. Example Scenario
3
2
1
4. International Journal in Foundations of Computer Science & Technology (IJFCST), Vol.4, No.4, July 2014
52
The unavailability probability from the source node to each node is and is same for all links.
In our proposal instead of relaying through one node, say ; we propose to use a set of nodes
forming a forwarding relays which is a priority list for routing packets towards a fixed destination
i.e. base station. We call such nodes forward relays ( ). We can compute that the expected
number of transmissions will be for the intended node to receive the packet correctly.
Let node is selected as member of by , and nodes, such set of nodes i.e.
, , is Selectors Set and we will use them as query relays and named as backward relays(
) on reverse path from sink to node(s).
On the other hand, by having multiple to counter for unavailability or outage and
considering multiple one-hop nodes in the role of , in symmetric-paired-key environment, the
expected numbers of transmissions for at least one node to receive the packet by increase
to ( )
. The denominator term is raised to power , because of paired keying environment in
random key pre-distribution which contrasts from broadcast environment. Assume that are
maintained as priority list. The list is prioritized to indicate which nodes have higher priority
to forward the packet. The node in list, which received the packet successfully, will act as
new source nodes and route the packet to the target node via its . Finally; main idea of our
secure forwarding which we named as Expected Secure Relaying (ESR) is as follows: we
let ( ) denote the Effective Average Key harnessed on the route from node
to , where ( ) is chosen by as . During initial step is initialized to 0
along with all other nodes. The updates on , ( ) and ( ) are computed periodically.
3.3 Setting up Forward Relay Key ( )
Equation
( )
specifies the number of retransmissions to be performed for at least one in
receive and forward the packet from its selector. If we can increase the denominator to (1 − )
by providing a broadcast environment with nodes in we can reduce number of broadcast for
at least one node in receive successfully. In case of encryption using all pair-wise keys
obtained it is difficult to have broadcast environment. We strive to establish a secure broadcast
key between node and its using following method. Let we identify nodes , as nodes in
of node . Figure 3 and 4 shows the steps for establishing forward key. Consider node being
selector sends encrypted messages to members & in steps 1 to 6 are performed in sequence as
shown in figure above.
Messages in step 1 and 2 are encrypted using all pre-distributed shared keys between − and
− pairs. On verifying the integrity of messages; & compute their shares individually and
sends messages to encrypted using all pre-distributed shared keys between − and − in
steps 3 and 4 respectively. Having received all shares from ( ) selector node generates its
unique share and using X-OR of all shares with its own share generates a unique for
communication with only. In step 5 and 6 selector node dispatches key message
destined for & . Now & can generate key using the contents from message
and own share there by verify the identity of sender and integrity of message. Following equation
(1) gives an insight of operation:
= ⨁ ⨁ (1)
5. International Journal in Foundations of Computer Science & Technology (IJFCST), Vol.4, No.4, July 2014
53
Figure 3. Forward Key Establishment from Shares
Step 1: || { ( )|| }
Step 2: || { ( )|| }
Step 3: || ℎ { ( )|| }
Step 4: || ℎ ||
Step 5: || ⨁ ⨁ || ⨁
Step 6: || ⨁ ⨁ || ⨁
Step 7: = ⨁ ⨁
Figure 4. Steps for Establishing Forward Key
Thus key is established using shares from contributors. As the numbers of forwarders are
one or more so are the contributions. To compromise the every path between selector and
it’s has to be compromised. As is common among selectors and ; we now are
able to exploit the broadcast advantage in wireless medium and reduce the number of trials for at
least one of forwarders receive and forward the packet. Increasing the denominator in equation
from (1 − ) to 1 − will decrease the number of trials for successful receiving and
forwarding of message.
1
|| { ( )|| }
|| { ( )|| }
2
|| { ( )|| }
3 || ||
4|| ⨁ ⨁ || ⨁
|| ⨁ ⨁ || ⨁5
6
6. International Journal in Foundations of Computer Science & Technology (IJFCST), Vol.4, No.4, July 2014
54
3.4 Setting up Backward Relay Key
Consider that a particular node has obtained distinct for use with distinct selector.
Assume that a node was in of set where = { , , }. We identify set
{ , , } as possible backward Relay ( ) set of node . Let ( ) denotes set of
node and ( ) = { , , }. Assuming
,
,
,
and
,
denotes
between − , − and − , node can now compute for use as query
broadcast key by node . Following steps outline the generation and distribution
of .
Step 1: || { ( )|| } ,
Step 2: || { ( )|| } ,
Step 3: || { ( )|| } ,
Step 4: || ℎ
,
⨁
,
||
,
⨁
,
,
Step 5: || ℎ
,
⨁
,
||
,
⨁
,
,
Step 6: || ℎ
,
⨁
,
||
,
⨁
,
,
Step 7:
( ),
=
,
⨁
,
⨁
,
Figure 5. Steps for Establishing Backward Key
Figure 5 shows the steps for establishing backward key. Step 1 to step 3 is encrypted
communication from node to each of it’s ( ) for key setup. Step 4 to step 6 results
into dispatch of partial key to selectors. Step 7 finally establishes at node and
selectors { , , }.
3.5 Expected Key Average
Now, we present the main idea of calculating the Effective Key Average ( ) for each node
and selecting the forward Relays ( ). We define as the average keys used to provide a
broadcast environment in pre-distributed keying environment. As in above section has
been established using all shared pre-distributed keys on links between selectors and nodes,
which implies that effectiveness of routing in our customized broadcast environment using
is as effective as is the average number of keys used in setting up of .
Consider a node and its one-hop neighbors. We will compute the, and
( ) of node based on the of its neighbors whose of sending data to the
has already been computed. We want to choose a subset of neighboring nodes ( ) as
( )of node such that the on the route from node to send a packet to is
maximized.
7. International Journal in Foundations of Computer Science & Technology (IJFCST), Vol.4, No.4, July 2014
55
Consider as our destination node. Given a set of nodes , let #
defines the sorted
list of based on to send data (via possible relay) to .
If ( ) denote the priority next hop list of node then #( ) represents
sorted next hop list on in decreasing order. i.e, #( ) = , , … , | ( )|
where < ⟹ ≤ .Using the theory of probability let denotes the probability
of total failure i.e. a packet sent by node is not received by any node in #( ). Clearly,
= ∏| #( )|
(2)
The probability of at least one node in #( ) will receive packets successfully,
can be computed as = 1 − . We can compute the number of trials that node must perform
in order to achieve first success by 1
. For e.g. if probability of success is 0.5 then number of
trial to have first success can be given by 1 0.5 = 2⁄ . If 1
gives the number of trials that a
node must perform to send a packet which is received by at least one in the #( ) then
using trials information for nodes #( ) we can compute possible delay incurred to get
the packet at .
Let, ( #
) denote the expected key average on next hop from through one
of the node in #
then that will be used can be computed as:
∈ #( )
=
∗ + ∗ + ⋯+
| #( )|
∗
| #( )|
1 − | #( )|
(3)
Where represent the probability of forwarding to in #( ). As one of the
forwarder has to forward ultimately (may require many trials) requires that ∑
| #( )|
=
1. For e.g. If | #( )| = 3 then #( ) = { , , } . If forwarder has been
assigned highest priority of among three forwarders with assigned second then we have
4 + 2 + 1 = 1 where = 2 ∗ ( − 1) ∗ . This implies = 4 ∗ , = 2 ∗
, = 1 ∗ . This leads to = 0.57, = .29, = .14. If ( , ) = .5
If we assume that = 30, = 27, = 22 then ( ∗) = 54.
When at least one node in the forwarder list of node received the packet successfully,
we need to calculate the expected cost to forward the packet sent by node . Let
#( ) denotes for to forward (using some nodes in the forwarder list
of ) the packet to the .If #( ) represent Effective Average Keys of
route through #( ) can be calculated as follows: assume the relays list is #
=
, , … , | ( )| . The probability that node forwards the packet is 1 − ( , ) and
Effective Keys Average of is ; then node will forward the packet with probability
( , ) ∗ (1 − ( , ) and the Effective Keys Average will be . Basically, node
forwards the packet if it receives the packet and nodes ; 0 < < did not receive the packet,
8. International Journal in Foundations of Computer Science & Technology (IJFCST), Vol.4, No.4, July 2014
56
and in this case, the Effective Average Keys will be . Hence, can be
computed as follows:
∈ #( )
= 1 − ∗
+ ∗ 1 − ∗ (4)
| #|
Finally; ( #) the on route from to is computed as follows:
#( ) =
∈ #( )
1 − | #( )|
(4.1)
= ∈ #( ) + #( ) (4.2)
Equation (4) illustrated how to compute of a sender to broadcast a packet if the current
chosen forwarder list is #( ). Equation (4.1) computes tentative which finalizes
#( ) and equation (4.2) computes real by augmenting tentative with last-
hop cost computed in equation (3). Thus first part i.e. equation (4.1) is for the sender to
successfully transmit a packet to at least one receiver in #
. The second part i.e. (4.2)
corresponds to that one of node in the #
finally to relays the packet to the final
destination node.
3.6 Finding the
Instead of random selection of nodes from ( ), we choose a prefix of sorted neighbor list
#( ) as our result i.e. #( ) . For a given #( ) there can be at the most | #( )| +
1 prefixes. Selecting nodes from #( ) , one at each step provided > . If fails
to satisfy the required condition; every node ahead of in #( )fails to satisfy the said
condition.
4. ROUTING ALGORITHM
How nodes will select their forwarder list and how to use expected cost is highlighted in previous
section. Now we are able standardize the steps as collection of three algorithms, namely;
_ , _ _ _ , ℎ_ . These algorithms are presumed to
be hardcoded and can be executed as per their requirements. After execution of
_ _ _ sink has information of about selectors and Relays. Each selector may
have multiple relays and each node may possess multiple selectors. In each case we have a subset
of one-hop neighbors as selector or relays or selectors-relays combined. Using the information
received from nodes in deployment area sink is able to compute routes from sink to nodes. Sink
may use these routes to periodically diffuse query in the network, whereas nodes may use their
forwarders towards sink to report any urgent event. The algorithm’s pseudo code is described in
figure 6.
9. International Journal in Foundations of Computer Science & Technology (IJFCST), Vol.4, No.4, July 2014
57
4.2 Exchanging ( ) List Information
Each node prioritized their relays in . Selection along with priority is informed to relays
by selectors. This process may be initiated by nodes after completing the execution of
_ _ _ , , #( )
{ _ _ _ }
_ _
_ : #( ) = 0 , #( ) =
_ _ +
ℎ in decreasing order to get #
: #( ) = _ #( ) , ( )
∈ , #( ) = 0 , #( ) = 0
_ _
∀ ∈ ( ) : #( ) = _ #( ) , ( )
= − { } = { }
= _ { }
= ∪ { } = − { }
∀ ∈ ( ) ∩ ∶ = #( )
∀ ∈ ( ) ∩ ∶ #( ) = #( )
∀ ∈ ( ) ∩ : #( )
= _ #( ) , ( )
= ∅
∀ ∈ , _ _ _ ( ): #( )
∀ ∈ : #( )
= _ #( ) , ( )
ℎ #
ℎ_ #
;
{ _ _ _ }
_ #( ) , ( )
{ _ }
Sort the neighboring nodes ( ) = , , … , | ( )| based on their EAK in decreasing order
and get #( ).
( = 1; < | #( )|; + +)
#( ) < ∉ #( ) ℎ
#( ) = #( ) ∪ { } and update
Update #( ) using equation(5) in steps (5.1) and (5.2)
#( )
{ _ }
ℎ_ #
()
{ ℎ_ #}
∈ , ⇛ #
( )
{ ℎ_ #}
Figure 6 Routing Scheme
10. International Journal in Foundations of Computer Science & Technology (IJFCST), Vol.4, No.4, July 2014
58
_ _ _ . Relays node in are like vectors disclosing direction towards
sink. Reverse channel is always available. Now relays have information of their relays and
selectors. This information is propagated to sink using unicast messages through relays
in . Aggregating the information by relays nodes help reduce the number of messages.
Selectors are proposed to be used for routing any query towards a region or node and path
through relays to route a reply to destination sink respectively. We have classified the Selector
nodes as Query Forwarder and Relay Nodes as Data Forwarders.
4.3 Route Construction
Sink has information of node wise selectors and relays. For query forwarding sink constructs
query route using pairs like:
( , { ( )}),
({ ( )}, { ({ ( )})} )
…
… { ({ ( )})} , .
Each such pair gives a possible hop on the respective paths. As a result sink may obtain all
possible paths towards a specific node i.e. D or vice-versa. may choose any of such paths for
propagation of query. Sink may choose any of the route on the basis of optimization criterion
which may be delay, energy, hop count or else. Query with specified route is encrypted
/decrypted on the path as it travels from sink to D.
5. PERFORMANCE ANALYSIS
In this section we present a simple and effective validation of our schemes using theorems.
Theorem 1: #( ) of node u must be a prefix of ∗( ).
Proof: we proof this theorem by contradiction. Let , are two nodes such that node is
in # = ∪ { } and is not. Let ( #)is expected key value after and ( )is
expected key values before considering . Let ∆ represent the increment achieved, i.e.
( #) = ( ) + ∆ . Had it been then ^
= ∪ { }. In #( ) , comes
earlier than as #( )is sorted on effective key averages. This implies ∆ ≥ ∆
and ( ^) ≥ ( #) . Thus selection of ahead of contradicts our selection
criterion. Hence #( ) is prefix of #( ).
We further study the properties of forwarder list by introducing another three theorems. The first
theorem, Theorem 2, shows that if a node, whose expected cost is less than the expected cost of a
prefix forwarder list, is added to the forwarder list, then the expected cost of the newly created
forwarder list will decrease while it will still be greater than the expected cost of the newly added
node. The second theorem, Theorem 3, shows that if a node, whose expected cost is greater than
the expected cost of a prefix forwarder list, is added to the forwarder list, then the expected cost
of the newly created forwarder list will increase. Theorem 4 establishes connectivity issues.
Theorem 2: Consider a node , a prefix #
and a node ∈ ( )/ #
. if >
( #) then ( # ∪ { }) > ( #) and
( #) is monotonically non-decreasing.
11. International Journal in Foundations of Computer Science & Technology (IJFCST), Vol.4, No.4, July 2014
59
Proof: We can prove above theorem by induction. Let us assume that node to be considered first
from #( ), is and #
= ∪ { }. Let us assume that | | = 0 and ( ) = 0. Using
equation (5.1) ( #) = ( ) + ∆ where ∆= (1 − ) ∗ #( ) and
represents non-negative error probability. This implies ( #) ≥ ( ).
Induction step: Considering next from #( ), is and #
= ∪ { }. Let us assume
that | | = − 1 and ( ) is expected key average earned. ( #) = ( ) + ∆
Where ∆= ∗ ∗ … ( − 1 ) ∗ (1 − ) ∗ #( ) and represents non-
negative error probability. This implies ( #) ≥ ( ). Hence, adding next node
increments in case qualifies feasibility criterion of being a member in #
.
Considering next from #( ), is provided ≥ and #
= ∪ { }. Let
us assume that | | = and ( ) is expected key average earned. ( #) =
( ) + ∆ where ∆= ∗ ∗ … ( ) ∗ (1 − ) ∗ #( ) and
represents non-negative error probability. This implies ( #) ≥ ( ). Hence, adding
next node increments in any case.
Theorem 3: Querying any node ∈ will reach concerned in O (n) time.
Proof: As Sink has information about relays and selectors in the network. Sink computes all
possible paths towards . Sink unicast the query consisting of route to to node at one-hop. One
hop nodes sends query to one of his selectors mentioned in the path. During query forwarding
process relay nodes (selectively) forwards query to selector mentioned in the path of query. Query
follows specified path in the network, and reaches in limited number of hops. As in the worst
case path length is ( − 1). Reply node becomes new source of reply and will route reply on
encrypted paths through its Data-Relays.
Theorem 4: All Nodes (∀ ∈ ) in the network are reachable.
Proof: Let we prove theorem by contradiction. Let there be a node which is unreachable as
there is no route to at sink. This implies is not selector of any node. It implies ( ) =
∅. With no doubt we can be concluded that ( ) = ∅. This suggests a partitioned network.
Otherwise; in a connected network ∀ ∈ , ( ) ≠ ∅ and equation (5) ensures that only
neighbour will be in ( ). Thus, in a connected network we have ( ) ≠ ∅. As a
fact sink will have route(s) to ∀ ∈ .
6. CONCLUSION AND FUTURE DIRECTIONS
We have proposed a new kind of multi path secure routing which distinguishes relays for query
and reply, classified as Data-Relays (DRs) and Query-Relays (QRs). With provision of multiple
DRs and QRs we have reduced the number of trials for successful traversal of packets from
source to sink. The optimal selection of DRs in the network has been proposed, with objective of
maximizing the Effective Average Keys on the routes from random node to sink. As the route
was specified by sink and Forwarders are selected by nodes on the path, any masquerading and
modification attack rendered ineffective. The analytical modelling supported the objectives and
supports the strength of proposal. An implementation of the scheme is our next assignment. The
scheme may be specialized for study of different parameters in demanding environments.
12. International Journal in Foundations of Computer Science & Technology (IJFCST), Vol.4, No.4, July 2014
60
References
[1] X. Mao, S. Tang, X. Xu, X. Y. Li, and H. Ma, “ Energy-Efficient Opportunistic Routing in Wireless
Sensor Networks”, in IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS,
VOL. 22, NO. 11, pp. 1934-1942, NOVEMBER 2011.
[2] Stefano Basagni, Kris Herrin, Denilo Bruschi and Emilia Rosti, “ Secure Pebblenets,” In proceedings
of Mobihoc, CA, USA, pp. 156-163, 2001.
[3] Sencun Zhu , Sanjeev Setia , Sushil Jajodia, LEAP: efficient security mechanisms for large-scale
distributed sensor networks, Proceedings of the 10th ACM conference on Computer and
communications security, October 27-30, Washington D.C., USA, 2003.L.
[4] Eschenauer and V. D. Gligor. “A key management scheme for distributed sensor networks”, In the
Proceedings of the 9th ACM Conference on Computer and Communication Security.
[5] H. Chan, A. Perrig, and D. Song, “Random Key Predistribution Schemes for Sensor Networks”, In the
Proceedings of the 2003 IEEE Symposium on Security and Privacy, pp. 197 – 213, May 11-14, 2003.
[6] D. Liu and P. Ning, “Establishing pairwise keys in distributed sensor networks,” In the Proceedings of
the 10th ACM Conference on Computer and Communications Security (CCS ’03), pp. 52-61. 2003.
[7] W. Du, J. Deng, Y. S. Han, S. Chen and P. K. Varshney, “A Key Management Scheme for Wireless
Sensor Networks Using Deployment Knowledge,” In the Proceedings of IEEE INFOCOM 2004.
[8] P. Ning, R. Li, and D. Liu, “Establishing Pairwise Keys in Distributed Sensor Networks,” ACM
Transactions on Information and System Security, Vol. 8, No. 1, Pages 41-77, February 2005.
[9] F. Anjum, “Location Dependent Key Management Using Random Key-predistribution In Sensor
Networks,” In the Proceedings of WiSe’06, 2006.
[10] M. F. Younis, K. Ghumman, and M. Eltoweissy, “Location-Aware Combinatorial Key Management
Scheme for Clustered Sensor Networks,” IEEE Transactions on Parallel and Distributed Systems,
Vol. 17, pp. 865–82, 2006.
[11] K. Kumar, A.K. Verma, R.B. Patel., “A Location Dependent Connectivity Guarantee Key
Management Scheme for Heterogeneous Wireless Sensor Networks”, In Special Issue on Ubiquitous
and Mobile Computing, Journal of advances in Information Technology, Vol. 1, No. 1, Feb., 2010.
[12] K. Kumar, A.K. Verma, R.B. Patel., “Framework for Key Management Scheme in Heterogeneous
Wireless Sensor Networks”, In Journal of Emerging Technologies in Web Intelligence, North
America, Vol. 3, No. 4, pp. 286-96, Nov. 2011.
[13] K. Kumar, A.K. Verma, R.B. Patel., “An Inexpensive Key Management Scheme for Heterogeneous
Wireless Sensor Networks”, In the proceedings of International Conference on Wireless Networks &
Embedded Systems WECON 2009, pp. 302-308, 23rd – 24th October, 2009.
[14] K. Kumar, A.K. Verma, R.B. Patel., “Variance Aware Secure Routing for Heterogeneous Wireless
Sensor Networks,” In Malaysian Journal of Computer Science, Vol. 26, No. 2, pp. 159-169, 2013
(SCI).
[15] K. Kumar, P. Sharma, “Location Dependent Key management Scheme for Wireless Sensor Network,”
in International Journal of Innovative Technology and Exploring Engineering (IJITEE), Vol. 1, No. 5,
October 2012.
AUTHORS
Kamal Kumar received his M.Tech. as well as B.Tech degree from Kurukshetra
University, Kurukshetra, India.Presently he is working as Associate Professor in
Computer Engineering Department in M.M. Engineering College, Ambala, India. He is
pursuing Ph. D from Thapar University, Patiala, India.
A. K. Verma is currently working as Associatet Professor in the department of
Computer Science and Engineering at Thapar University, Patiala in Punjab (INDIA). He
received his B.S. and M.S. in 1991 and 2001 respectively, majoring in Computer
Science and Engineering. He has worked as Lecturer at M.M.M. Engg. College,
Gorakhpur from 1991 to 1996. From 1996 he is associated with the same University. He
has been a visiting faculty to many institutions. He has published over 80 papers in
referred journals and conferences (India and Abroad). He is member of various program
committees for different International/National Conferences and is on the review board
13. International Journal in Foundations of Computer Science & Technology (IJFCST), Vol.4, No.4, July 2014
61
of various journals. He is a senior member (ACM), LMCSI (Mumbai), GMAIMA (New Delhi). He is a
certified software quality auditor by MoCIT, Govt. of India. His main areas of interests are: Programming
Languages, Soft Computing, Bioinformatics and Computer Networks. His research interests include
wireless networks, routing algorithms and securing ad hoc networks.
R. B. Patel received a PDF, Highest Institute of Education,Science & Technology
(HIEST), Athens, Greece, 2005. He received a PhD in Computer Science and
Technology from Indian Institute of Technology (IIT), Roorkee, India. He is member
IEEE, ISTE. His current research interests are in Mobile and Distributed Computing,
Security, Fault Tolerance Systems, Peer-to-Peer Computing, Cluster Computing and
Sensor networks. He has published more than 100 papers in International Journals and
Conferences and 17 papers in national journal/conferences. Two patents are also in the
credits of Dr. Patel in the field of Mobile Agent Technology and Sensor Networks.