An entrepreneurial system is one of the sort of remote system. Delay resistance system is correspondence
organizing proposition which empowers the correspondence in such a situation where end to end way
might never be exist. Message is forward on the premise of chance. Time interim to convey a message is
long we can't evaluate or anticipate the time until we get the message. There is a security issue in these
sorts of system. In this paper we will proposed another procedure which will expand the protection of the
system and build execution of the system.
Delay Tolerant Networking routing as a Game Theory problem – An OverviewCSCJournals
This paper explores the theoretical approach to improve existing Delay and Disruption Tolerant Networking routing algorithms using Game Theory. Game Theory is a systematic study of strategic interaction among rational individuals. DTN deals with networks in challenged environment. DTN focuses on deep space to a broader class of heterogeneous networks that may suffer disruptions, affected by design decisions such as naming and addressing, message formats, data encoding methods, routing, congestion management and security. DTN is part of the Inter Planetary Internet with primary application being deep space networks. The hypothesis behind modeling DTN routing as a game is based on understanding that routing is also a strategic interaction between the DTN nodes. This brings cognitive abilities leading to automated routing decisions.
Multicasting in Delay Tolerant Networks: Implementation and Performance AnalysisNagendra Posani
Delay Tolerant Networks(DTN) are a class of emerg- ing networks which experience intermittent connectivity and lack end-to-end paths due to absence of well-defined infrastructure. In this paper we explore the nuances of multicasting in DTNs. Multicasting enables efficient distribution of messages to a group of users, a paradigm that can be applicable in the context of DTNs. While multicasting in internet and ad-hoc networks has been studied extensively, realizing the same in DTNs is non- trivial given that many factors have to be considered. This paper, presents an implementation of multicast routing for various protocols in DTNs using ONE simulator. It also provides the analysis and performance results for the various protocols studies against the different movement models.
An Efficient DTN Routing Algorithm for Automatic Crime Information Sharing fo...IJSRD
Delay Tolerant Network shows many issues that are exist in traditional network. Opportunistic network emerge as interesting evolution in MANET. Mobile nodes in the opportunistic network communicate with each other even in case of no route connection. In this paper a kiosk (or hub station) that is connected to villages to establish internet connection. Such kiosk is placed where traffic frequency is high. We will use high frequency sensor in vehicles. When passing through kiosk, high frequency sensor will establish connection to kiosk & kiosk will connect villages to internet. This system is very useful in crime information sharing services. As an example, if there are a person who is victim of any crime or in a trouble condition. He/she have mobile devices connect to internet. They send a trouble message which is passed to near kiosk and passed on to vehicles and forward their information to police station. This system is helpful in villages, where network communication is not proper.
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.
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
Delay Tolerant Networking routing as a Game Theory problem – An OverviewCSCJournals
This paper explores the theoretical approach to improve existing Delay and Disruption Tolerant Networking routing algorithms using Game Theory. Game Theory is a systematic study of strategic interaction among rational individuals. DTN deals with networks in challenged environment. DTN focuses on deep space to a broader class of heterogeneous networks that may suffer disruptions, affected by design decisions such as naming and addressing, message formats, data encoding methods, routing, congestion management and security. DTN is part of the Inter Planetary Internet with primary application being deep space networks. The hypothesis behind modeling DTN routing as a game is based on understanding that routing is also a strategic interaction between the DTN nodes. This brings cognitive abilities leading to automated routing decisions.
Multicasting in Delay Tolerant Networks: Implementation and Performance AnalysisNagendra Posani
Delay Tolerant Networks(DTN) are a class of emerg- ing networks which experience intermittent connectivity and lack end-to-end paths due to absence of well-defined infrastructure. In this paper we explore the nuances of multicasting in DTNs. Multicasting enables efficient distribution of messages to a group of users, a paradigm that can be applicable in the context of DTNs. While multicasting in internet and ad-hoc networks has been studied extensively, realizing the same in DTNs is non- trivial given that many factors have to be considered. This paper, presents an implementation of multicast routing for various protocols in DTNs using ONE simulator. It also provides the analysis and performance results for the various protocols studies against the different movement models.
An Efficient DTN Routing Algorithm for Automatic Crime Information Sharing fo...IJSRD
Delay Tolerant Network shows many issues that are exist in traditional network. Opportunistic network emerge as interesting evolution in MANET. Mobile nodes in the opportunistic network communicate with each other even in case of no route connection. In this paper a kiosk (or hub station) that is connected to villages to establish internet connection. Such kiosk is placed where traffic frequency is high. We will use high frequency sensor in vehicles. When passing through kiosk, high frequency sensor will establish connection to kiosk & kiosk will connect villages to internet. This system is very useful in crime information sharing services. As an example, if there are a person who is victim of any crime or in a trouble condition. He/she have mobile devices connect to internet. They send a trouble message which is passed to near kiosk and passed on to vehicles and forward their information to police station. This system is helpful in villages, where network communication is not proper.
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.
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
Content Sharing over Smartphone-Based Delay-Tolerant NetworksIJERA Editor
With the growing number of smartphone end users, peer-to-peer ad hoc content giving is likely to occur often. Thus, new articles sharing mechanisms must be developed since traditional information delivery schemes will not be efficient with regard to content sharing due to the sporadic connectivity between smartphones on the market. To obtain data delivery such challenging environments, researchers include proposed the employment of store-carry-forward methodologies, in which a node stores a communication and holds it until a forwarding prospect arises through an encounter together with other nodes. Most past works in this field have dedicated to the conjecture of whether two nodes could encounter the other, without thinking about the place and also time from the encounter. In this particular paper, we propose to her discover-predict-deliver as a possible efficient articles sharing scheme for delay-tolerant touch screen phone networks. In this proposed scheme, contents are usually shared while using the mobility information of people. Specifically, our strategy employs the mobility understanding algorithm to spot places inside your own home and outdoor.
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
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.
A Novel Approach To Detect Trustworthy Nodes Using Audit Based Scheme For WSNIJERDJOURNAL
ABSTRACT: In multi-hop ad hoc networks there exists a problem of identifying and isolating misbehaving nodes which refuses to forward packets. Audit-based Misbehavior Detection (AMD) is a comprehensive system that effectively and efficiently isolates both continuous and selective packet droppers. The AMD system integrates reputation management, trustworthy route discovery, and identification of misbehaving nodes based on behavioral audits. Compared to previous methods, AMD evaluates node behavior on a per-packet basis, without employing energy-expensive overhearing techniques or intensive acknowledgment schemes. Moreover, AMD can detect selective dropping attacks even if end-to-end traffic is encrypted and can be applied to multichannel networks or networks consisting of nodes with directional antennas. This work implements the AMD approach by considering the rushing attack. The analysis of the results confirms that AMD based method with rushing attack performs better as compared to the non rushing attack.
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.
The peer-reviewed International Journal of Engineering Inventions (IJEI) is started with a mission to encourage contribution to research in Science and Technology. Encourage and motivate researchers in challenging areas of Sciences and Technology.
A ROUTING MECHANISM BASED ON SOCIAL NETWORKS AND BETWEENNESS CENTRALITY IN DE...ijcsit
With the growing popularity of mobile smart devices, the existing networks are unable to meet the requirement of many complex scenarios; current network architectures and protocols do not work well with the network with high latency and frequent disconnections. To improve the performance of these networks some scholars opened up a new research field, delay-tolerant networks, in which one of the important
research subjects is the forwarding and routing mechanism of data packets. This paper presents a routing
scheme based on social networks owing to the fact that nodes in computer networks and social networks
have high behavioural similarity. To further improve efficiency this paper also suggests a mechanism,which is the improved version of an existing betweenness centrality based routing algorithm [1]. The experiments showed that the proposed scheme has better performance than the existing friendship routing algorithms.
ANALYSE THE PERFORMANCE OF MOBILE PEER TO PEER NETWORK USING ANT COLONY OPTIM...ijcsity
A mobile peer-to-peer computer network is the one in which each computer in the network can act as a
client or server for the other computers in the network. The communication process among the nodes in the
mobile peer to peer network requires more no of messages. Due to this large number of messages passing,
propose an interconnection structure called distributed Spanning Tree (DST) and it improves the efficiency
of the mobile peer to peer network. The proposed method improves the data availability and consistency
across the entire network and also reduces the data latency and the required number of message passes for
any specific application in the network. Further to enhance the effectiveness of the proposed system, the
DST network is optimized with the Ant Colony Optimization method. It gives the optimal solution of the
DST method and increased availability, enhanced consistency and scalability of the network. The
simulation results shows that reduces the number of message sent for any specific application and average
delay and increases the packet delivery ratio in the network.
Enhance the Throughput of Wireless Network Using Multicast RoutingIOSR Journals
Wireless Mesh Network is designed static or limited mobility environment .In multicast routing for
wireless mesh networks has focused on metrics that estimate link quality to maximize throughput
andtoprovide secure communication. Nodes must collaborate in order to compute the path metric and
forward data.Node identify the novel attacks against high- throughput multicast protocols in wireless
mesh network.. The attacks exploit the local estimation and global aggregation of the metric to allow
attackers to attract a large amount of traffic These attacks are very effective b a s e d on high
throughput metrics. The aggressive path selection is a double-edged sword: It is maximizes throughput,
it also increases attack effectiveness. so Rate guard mechanism will be used.Rate guard mechanism
means combines Measurement-based detection and accusation-based reaction techniques.The attacks
and the defense using ODMRP, a representative multicast protocol for wireless mesh networks, and
SPP, an adaptation of the well-known ETX unicast metric to the multicast setting
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
EAASR: Enhanced AASR Protocol to Reduce Traffic and Eliminate the Malicious N...paperpublications3
Abstract: Mobile ad hoc networks (MANETs) are self-organizing the mobile nodes. It placed in adversary environments and it is vulnerable to security threats due to the characteristics of such networks. The main requirement on the networks is to provide unidentifiability and unlinkability for mobile networks. The existing protocols are not fully satisfied in this requirements. In this paper propose a new routing protocol that is enhanced authenticated anonymous secure routing (EAASR), to satisfy the unidentifiability and unlinkability. The new protocol provides less delay as compared with other protocol.
A new design reuse approach for voip implementation into fpsocs and asicsijsc
The aim of this paper is to present a new design reuse approach for automatic generation of Voice over Internet protocol (VOIP) hardware description and implementation into FPSOCs and ASICs. Our motivation behind this work is justified by the following arguments: first, VOIP based System on chip (SOC) implementation is an emerging research and development area, where innovative applications can be implemented. Second, these systems are very complex and due to time to market pressure, there is a need to built platforms that help the designer to explore with different architectural possibilities and choose the circuit that best correspond to the specifications. Third, we aim to develop in hardware, design, methods and tools that are used in software like the MATLAB tool for VOIP implementation. To achieve our goal, the proposed design approach is based on a modular design of the VOIP architecture. The originality of our approach is the application of the design for reuse (DFR) and the design with reuse (DWR) concepts. To validate the approach, a case study of a SOC based on the OR1K processor is studied. We demonstrate that the proposed SoC architecture is reconfigurable, scalable and the final RTL code can be reused for any FPSOC or ASIC technology. As an example, Performances measures, in the VIRTEX-5 FPGA device family, and ASIC 65nm technology are shown through this paper.
In this study the controller for three tank multi loop system is designed using coefficient Diagram
method. Coefficient Diagram Method is one of the polynomial methods in control design. The
controller designed by using CDM technique is based on the coefficients of the characteristics
polynomial of the closed loop system according to the convenient performance such as equivalent
time constant, stability indices and stability limit. Controller is designed for the three tank process
by using CDM Techniques; the simulation results show that the proposed control strategies have
good set point tracking and better response capability.
An Artificial Neural Network Model for Classification of Epileptic Seizures U...ijsc
Epilepsy is one of the most common neurological disorders characterized by transient and unexpected
electrical disturbance in the brain. In This paper the EEG signals are decomposed into a finite set of band
limited signals termed as Intrinsic mode functions. The Hilbert transom is applied on these IMF’s to
calculate instantaneous frequencies. The 2nd,3rd and 4th IMF's are used to extract features of epileptic
signal. A neural network using back propagation algorithm is implemented for classification of epilepsy.
An overall accuracy of 99.8% is achieved in classification..
An artificial neural network model for classification of epileptic seizures u...ijsc
Epilepsy is one of the most common neurological disorders characterized by transient and unexpected
electrical disturbance in the brain. In This paper
the EEG signals are decomposed into a finite set of
bandlimited signals termed as Intrinsic mode functions.
The Hilbert transom is applied on these IMF’s to
calculate instantaneous frequencies. The 2nd,3rd an
d 4th IMF's are used to extract features of epilepticsignal. A neural network using back propagation alg
orithm is implemented for classification of epilepsy.An overall accuracy of 99.8% is achieved in classification..
Content Sharing over Smartphone-Based Delay-Tolerant NetworksIJERA Editor
With the growing number of smartphone end users, peer-to-peer ad hoc content giving is likely to occur often. Thus, new articles sharing mechanisms must be developed since traditional information delivery schemes will not be efficient with regard to content sharing due to the sporadic connectivity between smartphones on the market. To obtain data delivery such challenging environments, researchers include proposed the employment of store-carry-forward methodologies, in which a node stores a communication and holds it until a forwarding prospect arises through an encounter together with other nodes. Most past works in this field have dedicated to the conjecture of whether two nodes could encounter the other, without thinking about the place and also time from the encounter. In this particular paper, we propose to her discover-predict-deliver as a possible efficient articles sharing scheme for delay-tolerant touch screen phone networks. In this proposed scheme, contents are usually shared while using the mobility information of people. Specifically, our strategy employs the mobility understanding algorithm to spot places inside your own home and outdoor.
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
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.
A Novel Approach To Detect Trustworthy Nodes Using Audit Based Scheme For WSNIJERDJOURNAL
ABSTRACT: In multi-hop ad hoc networks there exists a problem of identifying and isolating misbehaving nodes which refuses to forward packets. Audit-based Misbehavior Detection (AMD) is a comprehensive system that effectively and efficiently isolates both continuous and selective packet droppers. The AMD system integrates reputation management, trustworthy route discovery, and identification of misbehaving nodes based on behavioral audits. Compared to previous methods, AMD evaluates node behavior on a per-packet basis, without employing energy-expensive overhearing techniques or intensive acknowledgment schemes. Moreover, AMD can detect selective dropping attacks even if end-to-end traffic is encrypted and can be applied to multichannel networks or networks consisting of nodes with directional antennas. This work implements the AMD approach by considering the rushing attack. The analysis of the results confirms that AMD based method with rushing attack performs better as compared to the non rushing attack.
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.
The peer-reviewed International Journal of Engineering Inventions (IJEI) is started with a mission to encourage contribution to research in Science and Technology. Encourage and motivate researchers in challenging areas of Sciences and Technology.
A ROUTING MECHANISM BASED ON SOCIAL NETWORKS AND BETWEENNESS CENTRALITY IN DE...ijcsit
With the growing popularity of mobile smart devices, the existing networks are unable to meet the requirement of many complex scenarios; current network architectures and protocols do not work well with the network with high latency and frequent disconnections. To improve the performance of these networks some scholars opened up a new research field, delay-tolerant networks, in which one of the important
research subjects is the forwarding and routing mechanism of data packets. This paper presents a routing
scheme based on social networks owing to the fact that nodes in computer networks and social networks
have high behavioural similarity. To further improve efficiency this paper also suggests a mechanism,which is the improved version of an existing betweenness centrality based routing algorithm [1]. The experiments showed that the proposed scheme has better performance than the existing friendship routing algorithms.
ANALYSE THE PERFORMANCE OF MOBILE PEER TO PEER NETWORK USING ANT COLONY OPTIM...ijcsity
A mobile peer-to-peer computer network is the one in which each computer in the network can act as a
client or server for the other computers in the network. The communication process among the nodes in the
mobile peer to peer network requires more no of messages. Due to this large number of messages passing,
propose an interconnection structure called distributed Spanning Tree (DST) and it improves the efficiency
of the mobile peer to peer network. The proposed method improves the data availability and consistency
across the entire network and also reduces the data latency and the required number of message passes for
any specific application in the network. Further to enhance the effectiveness of the proposed system, the
DST network is optimized with the Ant Colony Optimization method. It gives the optimal solution of the
DST method and increased availability, enhanced consistency and scalability of the network. The
simulation results shows that reduces the number of message sent for any specific application and average
delay and increases the packet delivery ratio in the network.
Enhance the Throughput of Wireless Network Using Multicast RoutingIOSR Journals
Wireless Mesh Network is designed static or limited mobility environment .In multicast routing for
wireless mesh networks has focused on metrics that estimate link quality to maximize throughput
andtoprovide secure communication. Nodes must collaborate in order to compute the path metric and
forward data.Node identify the novel attacks against high- throughput multicast protocols in wireless
mesh network.. The attacks exploit the local estimation and global aggregation of the metric to allow
attackers to attract a large amount of traffic These attacks are very effective b a s e d on high
throughput metrics. The aggressive path selection is a double-edged sword: It is maximizes throughput,
it also increases attack effectiveness. so Rate guard mechanism will be used.Rate guard mechanism
means combines Measurement-based detection and accusation-based reaction techniques.The attacks
and the defense using ODMRP, a representative multicast protocol for wireless mesh networks, and
SPP, an adaptation of the well-known ETX unicast metric to the multicast setting
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
EAASR: Enhanced AASR Protocol to Reduce Traffic and Eliminate the Malicious N...paperpublications3
Abstract: Mobile ad hoc networks (MANETs) are self-organizing the mobile nodes. It placed in adversary environments and it is vulnerable to security threats due to the characteristics of such networks. The main requirement on the networks is to provide unidentifiability and unlinkability for mobile networks. The existing protocols are not fully satisfied in this requirements. In this paper propose a new routing protocol that is enhanced authenticated anonymous secure routing (EAASR), to satisfy the unidentifiability and unlinkability. The new protocol provides less delay as compared with other protocol.
A new design reuse approach for voip implementation into fpsocs and asicsijsc
The aim of this paper is to present a new design reuse approach for automatic generation of Voice over Internet protocol (VOIP) hardware description and implementation into FPSOCs and ASICs. Our motivation behind this work is justified by the following arguments: first, VOIP based System on chip (SOC) implementation is an emerging research and development area, where innovative applications can be implemented. Second, these systems are very complex and due to time to market pressure, there is a need to built platforms that help the designer to explore with different architectural possibilities and choose the circuit that best correspond to the specifications. Third, we aim to develop in hardware, design, methods and tools that are used in software like the MATLAB tool for VOIP implementation. To achieve our goal, the proposed design approach is based on a modular design of the VOIP architecture. The originality of our approach is the application of the design for reuse (DFR) and the design with reuse (DWR) concepts. To validate the approach, a case study of a SOC based on the OR1K processor is studied. We demonstrate that the proposed SoC architecture is reconfigurable, scalable and the final RTL code can be reused for any FPSOC or ASIC technology. As an example, Performances measures, in the VIRTEX-5 FPGA device family, and ASIC 65nm technology are shown through this paper.
In this study the controller for three tank multi loop system is designed using coefficient Diagram
method. Coefficient Diagram Method is one of the polynomial methods in control design. The
controller designed by using CDM technique is based on the coefficients of the characteristics
polynomial of the closed loop system according to the convenient performance such as equivalent
time constant, stability indices and stability limit. Controller is designed for the three tank process
by using CDM Techniques; the simulation results show that the proposed control strategies have
good set point tracking and better response capability.
An Artificial Neural Network Model for Classification of Epileptic Seizures U...ijsc
Epilepsy is one of the most common neurological disorders characterized by transient and unexpected
electrical disturbance in the brain. In This paper the EEG signals are decomposed into a finite set of band
limited signals termed as Intrinsic mode functions. The Hilbert transom is applied on these IMF’s to
calculate instantaneous frequencies. The 2nd,3rd and 4th IMF's are used to extract features of epileptic
signal. A neural network using back propagation algorithm is implemented for classification of epilepsy.
An overall accuracy of 99.8% is achieved in classification..
An artificial neural network model for classification of epileptic seizures u...ijsc
Epilepsy is one of the most common neurological disorders characterized by transient and unexpected
electrical disturbance in the brain. In This paper
the EEG signals are decomposed into a finite set of
bandlimited signals termed as Intrinsic mode functions.
The Hilbert transom is applied on these IMF’s to
calculate instantaneous frequencies. The 2nd,3rd an
d 4th IMF's are used to extract features of epilepticsignal. A neural network using back propagation alg
orithm is implemented for classification of epilepsy.An overall accuracy of 99.8% is achieved in classification..
The increasing popularity of animes makes it vulnerable to unwanted usages like copyright violations and
pornography. That’s why, we need to develop a method to detect and recognize animation characters. Skin
detection is one of the most important steps in this way. Though there are some methods to detect human
skin color, but those methods do not work properly for anime characters. Anime skin varies greatly from
human skin in color, texture, tone and in different kinds of lighting. They also vary greatly among
themselves. Moreover, many other things (for example leather, shirt, hair etc.), which are not skin, can
have color similar to skin. In this paper, we have proposed three methods that can identify an anime
character’s skin more successfully as compared with Kovac, Swift, Saleh and Osman methods, which are
primarily designed for human skin detection. Our methods are based on RGB values and their comparative
relations.
Soft computing is likely to play aprogressively important role in many applications including image enhancement. The paradigm for soft computing is the human mind. The soft computing critique has been particularly strong with fuzzy logic. The fuzzy logic is facts representationas a
rule for management of uncertainty. Inthis paperthe Multi-Dimensional optimized problem is addressed by discussing the optimal thresholding usingfuzzyentropyfor Image enhancement. This technique is compared with bi-level and multi-level thresholding and obtained optimal
thresholding values for different levels of speckle noisy and low contrasted images. The fuzzy entropy method has produced better results compared to bi-level and multi-level thresholding techniques.
Methodological study of opinion mining and sentiment analysis techniquesijsc
Decision making both on individual and organizational level is always accompanied by the search of
other’s opinion on the same. With tremendous establishment of opinion rich resources like, reviews, forum
discussions, blogs, micro-blogs, Twitter etc provide a rich anthology of sentiments. This user generated
content can serve as a benefaction to market if the semantic orientations are deliberated. Opinion mining
and sentiment analysis are the formalization for studying and construing opinions and sentiments. The
digital ecosystem has itself paved way for use of huge volume of opinionated data recorded. This paper is
an attempt to review and evaluate the various techniques used for opinion and sentiment analysis.
HYBRID PARTICLE SWARM OPTIMIZATION FOR SOLVING MULTI-AREA ECONOMIC DISPATCH P...ijsc
We consider the Multi-Area Economic Dispatch problem (MAEDP) in deregulated power system
environment for practical multi-area cases with tie line constraints. Our objective is to generate allocation
to the power generators in such a manner that the total fuel cost is minimized while all operating
constraints are satisfied. This problem is NP-hard. In this paper, we propose Hybrid Particle Swarm
Optimization (HGAPSO) to solve MAEDP. The experimental results are reported to show the efficiency of
proposed algorithms compared to Particle Swarm Optimization with Time-Varying Acceleration
Coefficients (PSO-TVAC) and RCGA.
Solving the associated weakness of biogeography based optimization algorithmijsc
Biogeography-based optimization (BBO) is a new population-based evolutionary algorithm and is based on an old theory of island biogeography that explains the geographical distribution of biological organisms. BBO was introduced in 2008 and then a lot of modifications and hybridizations were employed to enhance its performance. The researchers found that the original version of BBO has some weakness on its exploration. This paper tries to solve the root problems itself instead of solving its effect by using different techniques. It proposes two modifications; firstly, modifying the probabilistic selection process of the migration and mutation stages to give a fairly randomized selection for all the features of the islands. Secondly, the clear duplication process, which is located after the mutation stage, is sized to avoid any corruption on the suitability index variables of the non-mutated islands. The proposed modifications are extensively tested on 120 test functions with different dimensions and complexities. The results proved that the BBO performance can be enhanced effectively without embedding any additional sub-algorithm, and without using any complicated form of the immigration and emigration rates. In addition, the new BBO algorithm requires less CPU time and becomes even faster than the original simplified partial migration-based BBO. These essential modifications have to be considered as an initial step for any other modifications.
METAHEURISTIC OPTIMIZATION ALGORITHM FOR THE SYNCHRONIZATION OF CHAOTIC MOBIL...ijsc
We provide a scheme for the synchronization of two chaotic mobile robots when a mismatch between the
parameter values of the systems to be synchronized is present. We have shown how meta-heuristic
optimization can be used to adapt the parameters in two coupled systems such that the two systems are
synchronized, although their behavior is chaotic and they have started with different initial conditions and
parameter settings. The controlled system synchronizes its dynamics with the control signal in the periodic
as well as chaotic regimes. The method can be seen also as another way of controlling the chaotic
behavior of a coupled system. In the case of coupled chaotic systems, under the interaction between them,
their chaotic dynamics can be cooperatively self-organized. A synergistic approach to meta-heuristic
optimization search algorithm is developed. To avoid being trapped into local optimum and to enrich the
searching behavior, chaotic dynamics is incorporated into the proposed search algorithm. A chaotic Levy
flight is firstly incorporated in the proposed search algorithm for efficiently generating new solutions. And
secondly, chaotic sequence and a psychology factor of emotion are introduced for move acceptance in the
search algorithm. We illustrate the application of the algorithm by estimating the complete parameter
vector of a chaotic mobile robot.
In order to cope with real-world problems more effectively, we tend to design a decision support system for tuberculosis bacterium class identification. In this paper, we are concerned to propose a fuzzy diagnosability approach, which takes value between {0, 1} and based on observability of events, we
formalized the construction of diagnoses that are used to perform diagnosis. In particular, we present a
framework of the fuzzy expert system; discuss the suitability of artificial intelligence as a novel soft paradigm and reviews work from the literature for the development of a medical diagnostic system. The newly proposed approach allows us to deal with problems of diagnosability for both crisp and fuzzy value of input data. Accuracy analysis of designed decision support system based on demographic data was done
by comparing expert knowledge and system generated response. This basic emblematic approach using
fuzzy inference system is presented that describes a technique to forecast the existence of bacterium and
provides support platform to pulmonary researchers in identifying the ailment effectively.
PERFUSION SYSTEM CONTROLLER STRATEGIES DURING AN ECMO SUPPORTijsc
In this work modelling and control of Perfusion system is presented. The Perfusion system simultaneously
controls the partial pressures during Extra Corporeal Membrane Oxygenation (ECMO) support. The
main Problem in ECMO system is exchange of Blood Gases in the Artificial Lung (Oxygenator).It is a
highly Nonlinear Process comprising time-varying parameters, and varying time delays, it is currently
being controlled manually by trained Perfusionist. The new control strategy implemented here has a
feedback linearization routine with time-delay compensation for the Partial pressuresof Oxygen and
Carbon dioxide. The controllers were tuned robustly and tested in simulations with a detailed artificial
Lung (Oxygenator) model in Cardiopulmonary bypass conditions. This Automatic control strategy is
proposed to improve the patient’s safety by fast control reference tracking and good disturbance rejection
under varying conditions.
A reliable gait features are required to extract the gait sequences from an images. In this paper suggested a
simple method for gait identification which is based on moments. Moment values are extracted on different
number of frames of Gray Scale and Silhouette images of CASIA database. These moment values are
considered as feature values. Fuzzy logic and Nearest Neighbor Classifier are used for classification. Both
achieved higher recognition.
EXPLORING SOUND SIGNATURE FOR VEHICLE DETECTION AND CLASSIFICATION USING ANNijsc
This paper attempts to explore the possibility of using sound signatures for vehicle detection and
classification purposes. Sound emitted by vehicles are captured for a two lane undivided road carrying
moderate traffic. Simultaneous arrival of different types vehicles, overtaking at the study location, sound of
horns, random but identifiable back ground noises, continuous high energy noises on the back ground are
the different challenges encountered in the data collection. Different features were explored out of which
smoothed log energy was found to be useful for automatic vehicle detection by locating peaks. Melfrequency
ceptral coefficients extracted from fixed regions around the detected peaks along with the
manual vehicle labels are utilised to train an Artificial Neural Network (ANN). The classifier for four
broad classes heavy, medium, light and horns was trained. The ANN classifier developed was able to
predict categories well.
Integrating vague association mining with markov modelijsc
The increasing demand of World Wide Web raises the need of predicting the user’s web page request. The
most widely used approach to predict the web pages is the pattern discovery process of Web usage mining.
This process involves inevitability of many techniques like Markov model, association rules and clustering.
Fuzzy theory with different techniques has been introduced for the better results. Our focus is on Markov
models. This paper is introducing the vague Rules with Markov models for more accuracy using the vague
set theory.
Recently, many studies are carried out with inspirations from ecological phenomena for developing
optimization techniques. The new algorithm that is motivated by a common phenomenon in agriculture is
colonization of invasive weeds. In this paper, a modified invasive weed optimization (IWO) algorithm is
presented for optimization of multiobjective flexible job shop scheduling problems (FJSSPs) with the
criteria to minimize the maximum completion time (makespan), the total workload of machines and the
workload of the critical machine. IWO is a bio-inspired metaheuristic that mimics the ecological behaviour
of weeds in colonizing and finding suitable place for growth and reproduction. IWO is developed to solve
continuous optimization problems that’s why the heuristic rule the Smallest Position Value (SPV) is used to
convert the continuous position values to the discrete job sequences. The computational experiments show
that the proposed algorithm is highly competitive to the state-of-the-art methods in the literature since it is
able to find the optimal and best-known solutions on the instances studied.
Broad phoneme classification using signal based featuresijsc
Speech is the most efficient and popular means of human communication Speech is produced as a sequence
of phonemes. Phoneme recognition is the first step performed by automatic speech recognition system. The
state-of-the-art recognizers use mel-frequency cepstral coefficients (MFCC) features derived through short
time analysis, for which the recognition accuracy is limited. Instead of this, here broad phoneme
classification is achieved using features derived directly from the speech at the signal level itself. Broad
phoneme classes include vowels, nasals, fricatives, stops, approximants and silence. The features identified
useful for broad phoneme classification are voiced/unvoiced decision, zero crossing rate (ZCR), short time
energy, most dominant frequency, energy in most dominant frequency, spectral flatness measure and first
three formants. Features derived from short time frames of training speech are used to train a multilayer
feedforward neural network based classifier with manually marked class label as output and classification
accuracy is then tested. Later this broad phoneme classifier is used for broad syllable structure prediction
which is useful for applications such as automatic speech recognition and automatic language
identification.
Classical methods for classification of pixels in multispectral images include supervised classifiers such as
the maximum-likelihood classifier, neural network classifiers, fuzzy neural networks, support vector
machines, and decision trees. Recently, there has been an increase of interest in ensemble learning – a
method that generates many classifiers and aggregates their results. Breiman proposed Random Forestin
2001 for classification and clustering. Random Forest grows many decision trees for classification. To
classify a new object, the input vector is run through each decision tree in the forest. Each tree gives a
classification. The forest chooses the classification having the most votes. Random Forest provides a robust
algorithm for classifying large datasets. The potential of Random Forest is not been explored in analyzing
multispectral satellite images. To evaluate the performance of Random Forest, we classified multispectral
images using various classifiers such as the maximum likelihood classifier, neural network, support vector
machine (SVM), and Random Forest and compare their results.
Fault diagnosis of a high voltage transmission line using waveform matching a...ijsc
This paper is based on the problem of accurate fault diagnosis by incorporating a waveform matching technique. Fault isolation and detection of a double circuit high voltage power transmission line is of immense importance from point of view of Energy Management services. Power System Fault types namely single line to ground faults, line to line faults, double line to ground faults etc. are responsible for transients in current and voltage waveforms in Power Systems. Waveform matching deals with the approximate superimposition of such waveforms in discretized versions obtained from recording devices and Software respectively. The analogy derived from these waveforms is obtained as an error function of voltage and current, from the considered metering devices. This assists in modelling the fault identification as an optimization problem of minimizing the error between these sets of waveforms. In other words, it utilizes the benefit of software discrepancies between these two waveforms. Analysis has been done using the Bare Bones Particle Swarm Optimizer on an IEEE 2 bus, 6 bus and 14 bus system. The performance of the algorithm has been compared with an analogous meta-heuristic algorithm called BAT optimization on a 2 bus level. The primary focus of this paper is to demonstrate the efficiency of such methods and state the common peculiarities in measurements, and the possible remedies for such distortions.
TRIDNT: THE TRUST-BASED ROUTING PROTOCOL WITH CONTROLLED DEGREE OF NODE SELFI...IJNSA Journal
In Mobile ad-hoc network, nodes must cooperate to achieve the routing purposes. Node misbehaviour due to selfish or malicious intention could significantly degrade the performance of MANET because most existing routing protocols in MANET are aiming at finding most efficiency path. In this paper, we propose a Two node-disjoint Routes protocol for Isolating Dropper Node in MANET (TRIDNT) to deal with misbehaviour in MANET. TRIDNT allows some degree of selfishness to give an incentive to the selfish nodes to declare itself to its neighbours, which reduce the misbehaving nodes searching time. In TRIDNT two node-disjoint routes between the source and destination are selected based on their trust values. We use both DLL-ACK and end-to-end TCP-ACK to monitor the behaviour of routing path nodes: if a malicious behaviour is detected then the path searching tool starts to identify the malicious nodes and isolate them. Finally by using a mathematical analysis we find that our proposed protocol reduces the searching time of malicious nodes comparing to the route expected life time, and avoids the isolated misbehaving node from sharing in all future routes, which improve the overall network throughput.
Intrusion detection in heterogeneous network by multipath routing based toler...eSAT Journals
Abstract The key theory of our redundancy management is to achieve the tradeoff between energy consumption vs. the gain in timeliness, security, and reliability to increase the system useful lifetime. A Innovative probability model to analyze the best redundancy level in terms of source redundancy, path redundancy and as well as the best intrusion detection settings in terms of the number of voters and the intrusion invocation break under which the lifetime of a HWSN [Heterogeneous Wireless Sensor Network] is maximized. In redundancy management “badmouthing” is the major problem in managing the redundancy. This badmouthing is malicious node which will never drop the packet even after knowing that the packet has been sent already. In this paper we propose a new scheme to overcome the problem of badmouthing by weighted based voting, this protocol will weight (Success Rate) all the nodes in the network to find the non-malicious node in the network which having more packet drop. In “weighted voting” main function is to find trust/reputation of neighbor nodes, as well as to tackle the “what paths to use” problem in multipath routing decision making for intrusion tolerance in WSNs. Keywords: Bad mouthing, Wireless Sensor Network, Weighted Based Voting, HWSN.
Intrusion detection in heterogeneous network by multipath routing based toler...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
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
Improving the scalability by contact information compression in routingijitjournal
The existence of reduced scalability and delivery leads to the development of scalable routing by contact
information compression. The previous work dealt with the result of consistent analysis in the performance
of DTN hierarchical routing (DHR). It increases as the source to destination distance increases with
decreases in the routing performance. This paper focuses on improving the scalability and delivery through
contact information compression algorithm and also addresses the problem of power awareness routing to
increase the lifetime of the overall network. Thus implementing the contact information compression (CIC)
algorithm the estimated shortest path (ESP) is detected dynamically. The scalability and release are more
improved during multipath multicasting, which delivers the information to a collection of target
concurrently in a single transmission from the source.
A Trust Conscious Secure Route Data Communication in MANETSCSCJournals
Security in mobile adhoc networks is difficult to achieve, notably because of the vulnerability of wireless links, the limited physical protection of nodes, the dynamically changing topology, the absence of a certification authority, and the lack of a centralized monitoring or management point. The major difficulty in adhoc network occurs when a new node join network but not having any trusts relation with other node of network. We have proposed a new mechanism that provides trust conscious and secure data communication between the nodes. In this mechanism we will dynamically increase the trust from (Low to High) between the mobile nodes using proxy node. When mobile node needs secure data communication, it will generate a dynamic secret session key with the desired destination mobile node directly or via proxy mobile node. These dynamic secret session keys are generated using message digest and Diffie-Hellmann protocol.
Implementation of New Routing Protocol for Node Security in a Mobile Ad Hoc N...CSCJournals
A routing protocol plays important role to handle entire network for communication and determines the paths of packets. A node is a part of the defined network for transferring information in form of packets. If all packets transferred from source to destination successfully, it has been assumed that the routing protocol is good. But, an attacker turns this dealing as a speed breaker and turning point of a highway. So, prevention from attacks and secure packets, a new routing protocol is being introduced in this paper. The proposed routing protocol is called by SNAODV (Secure Node AODV). This paper is also tried to maximize throughput as compared with AODV and SAODV.
Defending against collaborative attacks byranjith 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
International Journal of Engineering and Science Invention (IJESI) inventionjournals
International Journal of Engineering and Science Invention (IJESI) is an international journal intended for professionals and researchers in all fields of computer science and electronics. IJESI publishes research articles and reviews within the whole field Engineering Science and Technology, new teaching methods, assessment, validation and the impact of new technologies and it will continue to provide information on the latest trends and developments in this ever-expanding subject. The publications of papers are selected through double peer reviewed to ensure originality, relevance, and readability. The articles published in our journal can be accessed online
AN EFFICIENT ROUTING PROTOCOL FOR DELAY TOLERANT NETWORKS (DTNs)cscpconf
Delay-Tolerant Networks are those which lacks continuous communications among mobile
nodes . Distributed clustering scheme and cluster-based routing protocol are used for DelayTolerant
Mobile Networks (DTMNs). The basic idea is to distributive group mobile nodes with
similar mobility pattern into a cluster, which can then interchangeably share their resources for
overhead reduction and load balancing, aiming to achieve efficient and scalable routing in DTMN. Load balancing is carried out in two ways, Intra cluster load balancing and Inter cluster load balancing. The Convergence and stability become major challenges in distributed clustering in DTMN. An efficient routing protocol will be provided for the delay tolerant networks through which the stability of the network is maintained .Based on nodal contact probabilities, a set of functions including Sync(), Leave(), and Join() are devised for cluster formation and gateway selection. Finally, the gateway nodes exchange network information and perform routing
SECURITY CONSIDERATION IN PEER-TO-PEER NETWORKS WITH A CASE STUDY APPLICATIONIJNSA Journal
Peer-to-Peer (P2P) overlay networks wide adoption has also created vast dangers due to the millions of users who are not conversant with the potential security risks. Lack of centralized control creates great risks to the P2P systems. This is mainly due to the inability to implement proper authentication approaches for threat management. The best possible solutions, however, include encryption, utilization of administration, implementing cryptographic protocols, avoiding personal file sharing, and unauthorized downloads. Recently a new non-DHT based structured P2P system is very suitable for designing secured communication protocols. This approach is based on Linear Diophantine Equation (LDE) [1]. The P2P architectures based on this protocol offer simplified methods to integrate symmetric and asymmetric cryptographies’ solutions into the P2P architecture with no need of utilizing Transport Layer Security (TLS), and its predecessor, Secure Sockets Layer (SSL) protocols.
To Get any Project for CSE, IT ECE, EEE Contact Me @ 09849539085, 09966235788 or mail us - ieeefinalsemprojects@gmail.co¬m-Visit Our Website: www.finalyearprojects.org
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.
Dev Dives: Train smarter, not harder – active learning and UiPath LLMs for do...UiPathCommunity
💥 Speed, accuracy, and scaling – discover the superpowers of GenAI in action with UiPath Document Understanding and Communications Mining™:
See how to accelerate model training and optimize model performance with active learning
Learn about the latest enhancements to out-of-the-box document processing – with little to no training required
Get an exclusive demo of the new family of UiPath LLMs – GenAI models specialized for processing different types of documents and messages
This is a hands-on session specifically designed for automation developers and AI enthusiasts seeking to enhance their knowledge in leveraging the latest intelligent document processing capabilities offered by UiPath.
Speakers:
👨🏫 Andras Palfi, Senior Product Manager, UiPath
👩🏫 Lenka Dulovicova, Product Program Manager, UiPath
Transcript: Selling digital books in 2024: Insights from industry leaders - T...BookNet Canada
The publishing industry has been selling digital audiobooks and ebooks for over a decade and has found its groove. What’s changed? What has stayed the same? Where do we go from here? Join a group of leading sales peers from across the industry for a conversation about the lessons learned since the popularization of digital books, best practices, digital book supply chain management, and more.
Link to video recording: https://bnctechforum.ca/sessions/selling-digital-books-in-2024-insights-from-industry-leaders/
Presented by BookNet Canada on May 28, 2024, with support from the Department of Canadian Heritage.
"Impact of front-end architecture on development cost", Viktor TurskyiFwdays
I have heard many times that architecture is not important for the front-end. Also, many times I have seen how developers implement features on the front-end just following the standard rules for a framework and think that this is enough to successfully launch the project, and then the project fails. How to prevent this and what approach to choose? I have launched dozens of complex projects and during the talk we will analyze which approaches have worked for me and which have not.
Builder.ai Founder Sachin Dev Duggal's Strategic Approach to Create an Innova...Ramesh Iyer
In today's fast-changing business world, Companies that adapt and embrace new ideas often need help to keep up with the competition. However, fostering a culture of innovation takes much work. It takes vision, leadership and willingness to take risks in the right proportion. Sachin Dev Duggal, co-founder of Builder.ai, has perfected the art of this balance, creating a company culture where creativity and growth are nurtured at each stage.
UiPath Test Automation using UiPath Test Suite series, part 4DianaGray10
Welcome to UiPath Test Automation using UiPath Test Suite series part 4. In this session, we will cover Test Manager overview along with SAP heatmap.
The UiPath Test Manager overview with SAP heatmap webinar offers a concise yet comprehensive exploration of the role of a Test Manager within SAP environments, coupled with the utilization of heatmaps for effective testing strategies.
Participants will gain insights into the responsibilities, challenges, and best practices associated with test management in SAP projects. Additionally, the webinar delves into the significance of heatmaps as a visual aid for identifying testing priorities, areas of risk, and resource allocation within SAP landscapes. Through this session, attendees can expect to enhance their understanding of test management principles while learning practical approaches to optimize testing processes in SAP environments using heatmap visualization techniques
What will you get from this session?
1. Insights into SAP testing best practices
2. Heatmap utilization for testing
3. Optimization of testing processes
4. Demo
Topics covered:
Execution from the test manager
Orchestrator execution result
Defect reporting
SAP heatmap example with demo
Speaker:
Deepak Rai, Automation Practice Lead, Boundaryless Group and UiPath MVP
Search and Society: Reimagining Information Access for Radical FuturesBhaskar Mitra
The field of Information retrieval (IR) is currently undergoing a transformative shift, at least partly due to the emerging applications of generative AI to information access. In this talk, we will deliberate on the sociotechnical implications of generative AI for information access. We will argue that there is both a critical necessity and an exciting opportunity for the IR community to re-center our research agendas on societal needs while dismantling the artificial separation between the work on fairness, accountability, transparency, and ethics in IR and the rest of IR research. Instead of adopting a reactionary strategy of trying to mitigate potential social harms from emerging technologies, the community should aim to proactively set the research agenda for the kinds of systems we should build inspired by diverse explicitly stated sociotechnical imaginaries. The sociotechnical imaginaries that underpin the design and development of information access technologies needs to be explicitly articulated, and we need to develop theories of change in context of these diverse perspectives. Our guiding future imaginaries must be informed by other academic fields, such as democratic theory and critical theory, and should be co-developed with social science scholars, legal scholars, civil rights and social justice activists, and artists, among others.
Kubernetes & AI - Beauty and the Beast !?! @KCD Istanbul 2024Tobias Schneck
As AI technology is pushing into IT I was wondering myself, as an “infrastructure container kubernetes guy”, how get this fancy AI technology get managed from an infrastructure operational view? Is it possible to apply our lovely cloud native principals as well? What benefit’s both technologies could bring to each other?
Let me take this questions and provide you a short journey through existing deployment models and use cases for AI software. On practical examples, we discuss what cloud/on-premise strategy we may need for applying it to our own infrastructure to get it to work from an enterprise perspective. I want to give an overview about infrastructure requirements and technologies, what could be beneficial or limiting your AI use cases in an enterprise environment. An interactive Demo will give you some insides, what approaches I got already working for real.
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
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/
GDG Cloud Southlake #33: Boule & Rebala: Effective AppSec in SDLC using Deplo...James Anderson
Effective Application Security in Software Delivery lifecycle using Deployment Firewall and DBOM
The modern software delivery process (or the CI/CD process) includes many tools, distributed teams, open-source code, and cloud platforms. Constant focus on speed to release software to market, along with the traditional slow and manual security checks has caused gaps in continuous security as an important piece in the software supply chain. Today organizations feel more susceptible to external and internal cyber threats due to the vast attack surface in their applications supply chain and the lack of end-to-end governance and risk management.
The software team must secure its software delivery process to avoid vulnerability and security breaches. This needs to be achieved with existing tool chains and without extensive rework of the delivery processes. This talk will present strategies and techniques for providing visibility into the true risk of the existing vulnerabilities, preventing the introduction of security issues in the software, resolving vulnerabilities in production environments quickly, and capturing the deployment bill of materials (DBOM).
Speakers:
Bob Boule
Robert Boule is a technology enthusiast with PASSION for technology and making things work along with a knack for helping others understand how things work. He comes with around 20 years of solution engineering experience in application security, software continuous delivery, and SaaS platforms. He is known for his dynamic presentations in CI/CD and application security integrated in software delivery lifecycle.
Gopinath Rebala
Gopinath Rebala is the CTO of OpsMx, where he has overall responsibility for the machine learning and data processing architectures for Secure Software Delivery. Gopi also has a strong connection with our customers, leading design and architecture for strategic implementations. Gopi is a frequent speaker and well-known leader in continuous delivery and integrating security into software delivery.
PHP Frameworks: I want to break free (IPC Berlin 2024)Ralf Eggert
In this presentation, we examine the challenges and limitations of relying too heavily on PHP frameworks in web development. We discuss the history of PHP and its frameworks to understand how this dependence has evolved. The focus will be on providing concrete tips and strategies to reduce reliance on these frameworks, based on real-world examples and practical considerations. The goal is to equip developers with the skills and knowledge to create more flexible and future-proof web applications. We'll explore the importance of maintaining autonomy in a rapidly changing tech landscape and how to make informed decisions in PHP development.
This talk is aimed at encouraging a more independent approach to using PHP frameworks, moving towards a more flexible and future-proof approach to PHP development.
PHP Frameworks: I want to break free (IPC Berlin 2024)
PRIVACY ENHANCEMENT OF NODE IN OPPORTUNISTIC NETWORK BY USING VIRTUAL-ID
1. DOI:10.5121/ijsc.2015.6403 21
PRIVACY ENHANCEMENT OF NODE IN
OPPORTUNISTIC NETWORK BY USING
VIRTUAL-ID
Sandeepak Bhandari and Satish Arora
Department of Computer Science & Engineering, PTU University, Punjab, India
ABSTRACT
An entrepreneurial system is one of the sort of remote system. Delay resistance system is correspondence
organizing proposition which empowers the correspondence in such a situation where end to end way
might never be exist. Message is forward on the premise of chance. Time interim to convey a message is
long we can't evaluate or anticipate the time until we get the message. There is a security issue in these
sorts of system. In this paper we will proposed another procedure which will expand the protection of the
system and build execution of the system.
KEYWORDS
Opportunistic Network, Architecture and Working of Opportunistic Network, Selective packet drop attack,
Proposed Methodology, Simulation Results
1. INTRODUCTION
A pioneering system is a class of deferral resistance system. It is shaped by the hubs having
capacity to bolster this system, the hubs are joined remotely. The hubs are portable or stable so no
settled framework is available in this system and this system can work even in disengaged
environment. Each hub have a limited reach in which the can impart or can forward the message.
A hub can forward a message just when whatever other hub comes in his extent. The hubs need to
store the back rub until another hub is not come in his extent. All hubs need to work in the store-
convey forward way in this system. In this system, gathering of middle of the road hubs
communicate something specific from source to destination. Hubs have no predefine topology of
the system, two hub may be or never joined, no fix course between two hub is use to send
message. System topology may change because of enactment and deactivation of the hub. On the
off chance that destination hub is not in the scope of source hub then it passes the message to the
closest hub in its extent thus on hub by hub closer to the destination. This system is anything but
difficult to actualize in any circumstance or any environment like war and debacle inclined ranges
where correspondence is for brief time and needs rapidly. In such environment we have less time
to execute the system topology or to make a foundation. At such an area or time this system is
extremely valuable to encourage the client to impart. At the point when two hubs found one
another effectively then no one but they can share the message or information. A hub can trade
information to its nearest hub inside of the immediate extent. At that point hubs pass the
information to its nearest hub and after that the following neighbor hub store the message and sit
tight for the chance to forward the message to next hub. On the off chance that a hub is deactivate
because of some reason and convey the information, then at whatever point it is actuate it can
continues the correspondence as entrepreneurial system is same as deferral resilience organize so
time to communicate something specific is not a stress in this system the main concern is message
2. International Journal on Soft Computing (IJSC) Vol.6, No. 4, November 2015
22
is compasses to the destination.An data sprinkler is a committed and a steady hub which is altered
in a devoted area in a bunch of crafty system or we can say a steady hub is available in each
group of the deft system. Data sprinkler works same as different hubs in deft system it can
likewise forward the message like other moderate hubs. It utilizes information sharing
convention. It gather data from deft hubs that in its extent. One data sprinkler is associated with
other data sprinkler (stable hub) through wired or wireless systems which have different hubs in
its extent. In any case, there is an issue in the security of the entrepreneurial system. In this paper
we will talked about security of the system.
1.1Working of Opportunistic Network
In deft system, correspondence opportunities (contacts) are irregular, so a conclusion to-end way
between the source and the destination might never exist. One of the conceivable answers for
intention the above issues is to endeavours hub portability and neighbourhood sending so as to
exchange information. Information can be put away and conveyed by exploiting hub portability
and afterward sent amid deft contacts. The accompanying three stages show working of astute
system.
1. Message sending to a middle of the road hub by source.
2. Message sending between middle of the road hubs.
3. Message sending in the middle of halfway and destination.
2. LITERATURE SURVEY
K. Fall (2003) observer that mobility of nodes is not a drawback, it is a technique to provide
communication even in disconnected mode. In opportunistic network path between two nodes
who wishes to communicate is unavailable. This network approach removes the assumption of
physical end to end communication and allows nodes to forward message by a new technique
store-carry-forward. Intermediate nodes can forward the message only when he gets opportunity
to forward it. The message move closer to the destination when a mobile node which contains
message gets an opportunity to send it. D. Nain, N. Petigara, and H. Balakrishnan (2003)
studied about the Mobile Relay Protocol. MRP has been conceived to integrate pre-existing ad
hoc routing protocols and manage message forwarding when no route towards the destination
node of a message is found and the application that has generated the message can tolerate some
form of extra delay. Messages that can be forwarded in opportunistic fashion are assigned two
parameters: x and y. x represents the upper bound limit for the number of times the message can
be relayed, i.e., the maximum number of relays that it can visit. Each time the message reaches a
new relay node, x is decreased by one so as to correspond to the residual number of relays that it
is allowed to visit from then on. On the other hand, y represents the upper bound limit for the
length of a multi-hop path towards the destination node according to a traditional routing
protocol. Therefore, a message can overall traverse x hops over a non-connected path and y hops
over a connected path. S. Jain, K. Fall (2004) found that routing as a big challenge in such a
network which is work even in disconnected mode and message can only forward when node get
an opportunity. It is a difficult to provide an efficient routing protocol, as routing performance is
depend on the network topology. But in opportunistic network, topology information is absent. A
node can only find the existence of another node when the come in their communication range. In
such a scenario context base knowledge is best method to design a routing protocol for this type
of network.G. Ding, B. K. Bhargava (2004), in this article, five routing approaches are defined
with different complexity are to enable peer to peer file sharing over MANET. Peer to peer
system aims to share file without having any fixed infrastructure to a large number of users,
without using any intermediate routing device, it is motivated by the file sharing application over
the internet. They compare and evaluate the complexity of proposed approaches and conclude
3. International Journal on Soft Computing (IJSC) Vol.6, No. 4, November 2015
23
that the cross layer protocol perform well than simple overlaying peer to peer searching protocol
in MANETs. They focus on the route discovery in this paper. They introduce five approaches to
integrate the protocols of P2P and MANETs.
3. SELECTIVE PACKET DROP ATTACK
Particular Packet drop is trigger just when sticking assault falls flat. Once the bundle is normal by
the bargained hub, it can look at the parcel headers, order the bundle, and choose whether to
forward it or not. This activity is known as rowdiness. Post-gathering dropping is less bendy than
particular sticking in light of the fact that the challenger is restricted to dropping just the parcels
directed through it. Particular strategy known as the Jellyfish assault which is a traded off hub that
is once in a while drops a little piece of continuous parcels and can be productively decreasing the
throughput of a TCP stream to close to zero. This assault can be accomplish even by remind
arbitrary postponements to TCP parcels, without dropping them, while left over convention
consistent. Comparable particular dropping assaults can be develops for other system capacities,
for example, the affiliation/de-relationship of STAs, and topology administration.
4. PROPOSED METHODOLOGY
The point of the actualizing protection in the entrepreneurial system is to pull in more clients to
utilize this system. As protection is the fundamental concern and in this system there is not a
settled foundation is available and the message is forward through numerous halfway hubs, there
may be an egotistical hub which is not fascinating to forward the message to a specific
destination, or the client wouldn't like to demonstrate his personality when need to impart or send
message to a specific destination, then it is danger to the security of client or the bundle dropped
by the childish hub. Additionally the substance of message is likewise access by the transitional
hubs, so there is an issue that how to encode the message and share a key in the middle of source
and destination without demonstrating to it to halfway hubs. To defeat this issue another
philosophy will be proposed which confirm client with ID and Password. Along these lines a
security of the system improved.
Figure 1: Proposed Methodology
4. International Journal on Soft Computing (IJSC) Vol.6, No. 4, November 2015
24
4. SIMULATION SETUP
Opportunistic remote system is executed with 13 hubs in NS2. In entrepreneurial remote system
source and destination hubs are convey through different middle of the road hubs. The source hub
forward parcels to that middle of the road hub which is in the scope of source hub, then halfway
hub forward bundles to another transitional hub or destination hub which is in the scope of
moderate hub, this procedure proceeds until bundles reach at the destination.
Figure 2: Opportunistic Wireless Network design.
In above figure an Opportunistic Wireless Network is configuration with 13 Nodes. It is
separated into two bunches (displayed by shading). Hub 2 is the steady hub of bunch having blue
shading and Node 9 is the steady hub of group having red shading. Crafty remote system is work
on store-convey forward way i.e. a hub which needs to correspond with other hub it may speak
with one another through different middle of the road hubs .The source hub forward bundles to
transitional hub and moderate hub forward to the destination hub. In the event that hub character
is appeared to all, then it causes numerous issues. A few hubs would prefer not to investigate
their personality while utilizing the system. In this system the message is just forward when both
hubs are in the correspondence range, so when a hub forward bundles then it area is additionally
recognize such that the Node x and Node y meets at the area at a specific time. Presently for this
situation transitional hub is the narrow minded hub, which check the destination address and not
wishes to forward the bundles. Presently for this situation middle of the road hub is narrow
minded hub, which check the destination address and not wishes to forward the bundles. Middle
of the road hub drops the parcels of the destination hub henceforth correspondence is not finished
in the middle of source and destination.
For giving secure correspondence in the middle of source and destination hub, two systems are
utilized to be specific verification and Virtual-ID. Validation instrument is utilized for verify
substantial hub of bunch and Virtual-ID is utilized for protection of hub, which conceal the area
of hub. The hub which needs to impart to the next hub will first correspond with the settled hub
to get the virtual ID. At the point when a hub needs to send message, it first sends a solicitation
message to the steady hub to get a virtual ID. This message is forward by the middle of the road
hubs to the steady hub. In the solicitation message source hub send its NODE_ID and
PASSWORD which is use by the steady hub to verify the substantial hub of the group. When the
source hub verifies the hub then stable hub correspond with the steady hub of destination bunch
and trade data and overhaul their table. Presently steady hub of source group will sends another
virtual ID to the source , new ID of destination and a session key with which the source hub
encode the message. This message is presently scramble by general society key of the source
5. International Journal on Soft Computing (IJSC) Vol.6, No. 4, November 2015
25
hub. Furthermore, stable hub additionally sends another virtual ID to the destination, virtual id of
source hub and session unscrambling key. This message is encoded by people in general key of
destination hub.
Figure 3: Authentication by stable node.
In above figure stable (hub 2) validates the hub 4 as a substantial hub of bunch. Stable hub verifies the
hub by coordinating its NODE_ID and PASSWORD.
Figure 4: Ticket Receiving by the Source Node
In above figure stable hub sends ticket to the source hub after confirmation and imparting data to the
steady hub of bunch in which destination is present.Ticket contains taking after:
• A new virtual-ID of Source Node.
• A new virtual-ID of Destination Node.
• A session key to encode the message.
6. International Journal on Soft Computing (IJSC) Vol.6, No. 4, November 2015
26
Virtual-ID is utilized for conceal the character of hub which is utilized to improve the protection of
node.The personality of hub is uncovered when two hubs accompanies in scope of one another by
trading parcels with one another so when a hub forward bundles then it area is likewise distinguish
such that the Node x and Node y meets at the area at a specific time. A middle of the road hub is
egotistical hub, which check the destination address and not wishes to forward the packets.To conceal
the personality of hub, stable hub allots virtual-id to source hub which is just known by source hub,
destination hub and stable hub itself. Presently when source hub send bundles to halfway hub it send
its virtual-id and virtual-id of destination hub alongside parcels alloted by stable hub and virtual-id is
dependably time distinctive when correspondence begin in the middle of source and destination so it is
unrealistic for moderate hub to recognize the personality of hub in light of the fact that just stable hub
gift virtual-id to source hub and destination hub and which specific virtual-id is appoint to a specific
hub for specific time of correspondence. Along these lines, as number of secured parcels is expanded
the more protection is upgraded on the grounds that character of hub is uncovered through bundles
transmission between nodes.Now Source hub utilized new Virtual-ID for correspondence with
destinatio
6. SIMULATION RESULTS
In this segment the execution of astute system is broke down with upgraded method and existing
procedure. The execution of system is analyzed on four parameters to be specific Throughput,
Packetloss,Delay and Privacy.
The X-hub speak to the recreation time in seconds and Y-hub speak to Number of Packets.
Figure 5: Packet loss Graph
7. International Journal on Soft Computing (IJSC) Vol.6, No. 4, November 2015
27
The above figure demonstrates the examination of both systems as far as bundle misfortune. The
outcome demonstrates that improved instrument lessened the considerable quantities of bundle
misfortune in sharp remote system as contrast and existing component. The Y-hub speak to number of
bundles and X-hub speak to time in seconds.
Figure 6: Throughput Graph
The above figure demonstrates the correlation of throughput of both components. The above chart
demonstrates that upgraded component enhance the throughput of astute remote system. The Y-hub
speak to number of parcels and X-hub speak to time in seconds.
Figure 7: Delay Graph
8. International Journal on Soft Computing (IJSC) Vol.6, No. 4, November 2015
28
The above figure demonstrates that improved instruments extraordinarily diminished the postponement
of bundles in shrewd when contrasted with existing component. The Y-hub speak to number of parcels
and X-pivot speak to time in seconds.
Figure 8: Privacy Graph
The above chart demonstrates the protection of hub in astute remote system is improved with
upgraded component. The Y-pivot speaks to the quantity of secure bundles and X-hub speak to
the recreation time
7. CONCLUSION
In this examination we find that sharp system is exceptionally valuable if security is kept up. We
propose a system construction modeling in which a hub need to make an impression on a
destination and he wouldn't like to investigate his way of life and also destination personality then
he first correspond with stable node(trusted hub) and get a virtual id for a period a period. Stable
hub go about as exceptional hub, which contains data of each hub of the bunch and confirm the
hubs who wishes to impart and give virtual id to that hubs. Furthermore a session key is given to
encryption of message to the source and unscrambling key to the destination for keeping up the
secrecy of the message. This methodology gives protection to the client and decreases the parcel
misfortune by a narrow minded hub. What's more, the charts speak to the adjustment in parcel
misfortune and throughput of pioneering system.
8. FUTURE SCOPE
In our work we reason a method to give security to a client in deft system on the premise of
giving virtual id by a steady hub, which is available in each bunch. Be that as it may, this system
expands the work heap of a sender who wishes to convey. In future we attempt to discover a way
9. International Journal on Soft Computing (IJSC) Vol.6, No. 4, November 2015
29
which diminishes the client work by giving some new instrument to conceal the id of client.
Because of foundation less building design and versatility of the hubs, sharp system faces
numerous issues identified with security, protection, hubs verification and proficient steering
convention.
REFERENCES
[1] Jia Jianbin, Chen Yingwen, Xu Ming, Xia Geming, and Xiao Xiaoqiang,(2013) “Towards the Benefit
of Multi-Hop Relaying in Opportunistic Networking”,IEEE International Conference on Green
Computing and Communications and IEEE Internet of Things and IEEE Cyber, Physical and Social
Computing ,pp.658-662.
[2] Augustin Chaintreau, Pan Hui, Jon Crowcroft, Christophe Diot, Richard Gass, and James Scott,(2006)
“ Impact of Human Mobility on the Design of Opportunistic Forwarding Algorithms”, IEEE Infocom.
IEEE Computer Society
[3] Papaj Jan, Dobos Eubomir and Cumar,(2012)“ Opportunistic Networks and Security”Journal of
Electrical and Electronics Engineering, vol. 5,no.1.
[4] L. Lilien, Z. H. Kamal, V. Bhuse, and A. Gupta,(2006) “The Concept of Opportunistic Network and
their Research Challenges in Privacy and Security”,”Mobile and Wireless Network Security and
Privacy”, Book Chapter, pp. 85-117.
[5] L. Pelusi, A. Passarella, and M. Conti,(2006) “Opportunistic Networking: data forwarding in
disconnected mobile ad hoc networks”, IEEE Communications Magazine, vol. 44, no.11, Nov.
[6] D. Nain, N. Petigara, and H. Balakrishnan,(2003) “Integrated Routing and Storage for Messaging
Applications in Mobile Ad Hoc Networks”, in Proceedings of WiOpt, Autiplis, France, March.
[7] S. Jain, K. Fall and R. Patra,(2004) “Routing in a delay tolerant network”, Proceedings of the ACM
Conference on Applications, Technologies, Architectures, and Protocols for Computer
Communications, pp.145–158.
[8] Abdullatif shikfa, Melek Onen and Refik Molva(2010),“Privacy and Confidentiality in context based
and epidemic forwarding” published by Elsevier,pp.1493-1504.
[9] Abdullatif shikfa,Melek Onen and Refik Molva,(2012)“ Local key management in Opportunistic
network”.International Journal Networks and distributed Systems,Vol.9,Nos.1/,pp.97-116.
[10] B.Poonguzharselvi1 and V.Vetriselvi,(2012) “Trust Framework for Data Forwarding in opportunistic
Network Using Mobile Traces”,International Journal of.Wireless Networks Vol.4,No.6.
[11] K. Fall,(2013) “ A delay-tolerant network architecture for challenged internets”, Paper presented in
the Proceedings of the ACM Conference on Applications, Technologies, Architectures, and Protocols
for Computer Communications , pp.27–34.
[12] Xingguang Xie, Yong Zhang, Chao Dai and Mei Song,(2011)"Social relationship enhanced
predicable routing in opportunistic network" Seventh International Conference on Mobile Ad-hoc and
Sensor Networks.
[13] L. Dora, T. Holczer ,Hide and Lie,"Enhancing(2010) Application-level Privacy in Opportunistic
Networks",Proceedings of the Second International Workshop on Mobile Opportunistic Networking
,pp.135-142..
[14] G. Costantino ,F. Martinelli and P.santi,(2012)“ Privacy-preserving interest-casting in opportunistic
networks”,IEEE wireless communications and networking conference: mobile and wireless networks.
AUTHORS
Sandeepak Bhandari seeking his Master of Technology in C.S.E from P.T.U University,
Punjab, India. This paper portrays the examination work Which he finished amid his expert
of innovation.