Multi Microcontroller Networking System

Multi Microcontroller Networking System

8051 Microcontroller, Networking
Multi Microcontroller Networking System Our system aims at connecting and coordinating multiple microcontrollers in order to achieve the desired output. Modern generation automobiles widely use this technology today. Increasing number of microcontrollers are used these days for various industrial and domestic applications. Today’s cars have a good variety and number of microcontrollers working in it. With an increase in the number of microcontrollers it becomes important to maintain proper coordination among them. The issue with such systems is that if one MC fails it is likely to affect the working of other connected MC’s. Our project is used to demonstrate this by making use of an RS232 based command monitoring tool. The system uses a combination of three microcontrollers for this purpose. One is used to operate the load, second…
Read More

Military Access Using Card Scanning With OTP

Security and Encryption, Sensor, Web | Desktop Application
Military Access Using Card Scanning With OTP Military access is the most secure access provision and needs to be kept that way considering national security issues. Usual military authentication and authorization techniques consist of one way authentication techniques with just one form of authentication, namely password or smart card or biometric. Here we propose a two stage authentication/authorization technique for secured military access to authorized personnel. The first stage is a card scanning system, each authorized personnel must have a smart card. On card scanning the system also asks of an additional 4 digit code associated with it, on entering the right code the personnel goes to the next stage of authentication. On the next stage, system generates a one time password and sends to the mobile phone registered to…
Read More

Secure Remote Communication Using DES Algorithm

Cloud Computing, Security and Encryption, Web | Desktop Application
Secure Remote Communication Using DES Algorithm The Data Encryption Standard (DES) algorithm is a widely accepted system for data encryption that makes use of a private (secret) key that was judged so hard to break by the U.s. government that it was confined for exportation to different nations. There are more than 71,000,000,000,000,000 (71 quadrillion) encryption keys to be used in this algorithm. For any given message, the key is picked at irregular interval from among this colossal number of keys. Like other private key cryptographic routines, both the sender and the collector must know and utilize a common private key. Many companies, governments, military and other fields make use of DES algorithm for secure data transfer over unsecure networks. We here propose a system for secured data transfer over…
Read More

Secure Data Transfer Over Internet Using Image Steganography

Cloud Computing, Networking, Parallel And Distributed System, Security and Encryption, Web | Desktop Application
Secure Data Transfer Over Internet Using Image Steganography Steganography is the technique of hiding private or sensitive information within something that appears to be nothing be a usual image. Steganography involves hiding Text so it appears that to be a normal image or other file. If a person views that object which has hidden information inside, he or she will have no idea that there is any secrete information. What steganography essentially does is exploit human perception, human senses are not trained to look for files that have information inside of them. What this system does is, it lets user to send text as secrete message inside an image file, user uploads the image and enters the text to send secretly, and gives a key or a pass word to…
Read More

Secure Data Retrieval for Decentralized Disruption-Tolerant Military Networks

Cloud Computing, Networking, Security and Encryption, Web | Desktop Application
Secure Data Retrieval for Decentralized Disruption-Tolerant Military Networks Mobile nodes in military environments such as a battlefield or a hostile region are likely to suffer from intermittent network connectivity and frequent partitions. Disruption-tolerant network (DTN) technologies are becoming successful solutions that allow wireless devices carried by soldiers to communicate with each other and access the confidential information or command reliably by exploiting external storage nodes. Some of the most challenging issues in this scenario are the enforcement of authorization policies and the policies update for secure data retrieval. Ciphertext-policy attribute-based encryption (CP-ABE) is a promising cryptographic solution to the access control issues. However, the problem of applying CP-ABE in decentralized DTNs introduces several security and privacy challenges with regard to the attribute revocation, key escrow, and coordination of attributes issued…
Read More

Analysis of Denial-of-Service attacks on Wireless Sensor Networks Using Simulation

Networking
Analysis of Denial-of-Service attacks on Wireless Sensor Networks Using Simulation Evaluation of Wireless Sensor Networks (WSN) for performance evaluation is a popular research area and a wealth of literature exists in this area. Denial-of-Service (DoS) attacks are recognized as one of the most serious threats due to the resources constrained property in WSN. The Zigbee model provided in OPNET 16 is suitable for modelling WSNs. This paper presents an evaluation of the impact of DoS attacks on the performances of Wireless Sensor Networks by using the OPNET modeller. Numerical results, discussions and comparisons are provided for various simulation scenarios. The results can be of great help for optimisation studies in WSN environments under DoS attacks as well as understanding the severity and critical nodes within the WSN. The effects of…
Read More

Network Traffic Monitoring Using Intrusion Detection System

Networking
Network Traffic Monitoring Using Intrusion Detection System Security is a big issue for all networks in today’s enterprise environment. Many methods have been developed to secure the network infrastructure and communication over the Internet, among them the use of firewalls, encryption, and virtual private networks. Intrusion detection is a relatively new addition to such techniques. IDS protect a system from attack, misuse, and compromise. It can also monitor network activity. Network traffic monitoring and measurement is increasingly regarded as an essential function for understanding and improving the performance and security of our cyber infrastructure.
Read More

Analyzing Network Traffic To Detect Self-Decrypting Exploit Code

Networking
Analyzing Network Traffic To Detect Self-Decrypting Exploit Code ABSTRACT Remotely-launched software exploits are a common way for attackers to intrude into vulnerable computer systems. As detection techniques improve, remote exploitation techniques are also evolving. Recent techniques for evasion of exploit detection include polymorphism (code encryption) and metamorphism (code obfuscation). This paper addresses the problem of detecting in network traffic polymorphic remote exploits that are encrypted, and that self-decrypt before launching the intrusion. Such exploits pose a great challenge to existing malware detection techniques, partly due to the non-obvious starting location of the exploit code in the network payload.
Read More

Genetic algorithm for energy efficient QoS Multicast Routing

Networking
Genetic algorithm for energy efficient QoS Multicast Routing The consideration of energy consumption in wireless ad hoc networks prevents the problem of the network exhausting batteries, thus partitioning the entire network. Power-aware multicasting is proposed to reduce the power consumption. This letter presents an energy-efficient genetic algorithm mechanism to resolve quality of service (QoS) multicast routing problem, which is NP-complete. The proposed genetic algorithm depends on bounded end-to-end delay and minimum energy cost of the multicast tree. Simulation results show that the proposed algorithm is effective and efficient.
Read More

Lightweight Sybil Attack Detection in MANETs

Networking
Lightweight Sybil Attack Detection in MANETs Fully self-organized mobile ad hoc networks (MANETs) represent complex distributed systems that may also be part of a huge complex system, such as a complex system-of-systems used for crisis management operations. Due to the complex nature of MANETs and its resource constraint nodes, there has always been a need to develop lightweight security solutions. Since MANETs require a unique, distinct, and persistent identity per node in order for their security protocols to be viable, Sybil attacks pose a serious threat to such networks. A Sybil attacker can either create more than one identity on a single physical device in order to launch a coordinated attack on the network or can switch identities in order to weaken the detection process, thereby promoting lack of accountability…
Read More

View-invariant action recognition based on Artificial Neural Networks.

Networking
View-invariant action recognition based on Artificial Neural Networks. In this paper, a novel view invariant action recognition method based on neural network representation and recognition is proposed. The project has employed the technique mentioned and excellent results were obtained for a number of widely used font types. The technical approach followed in processing input images, detecting graphic symbols, analyzing and mapping the symbols and training the network for a set of desired Unicode characters corresponding to the input images are discussed in the subsequent sections. Even though the implementation might have some limitations in terms of functionality and robustness, the researcher is confident that it fully serves the purpose of addressing the desired objectives. The novel representation of action images is based on learning spatially related prototypes using Self Organizing…
Read More

A New Cell Counting Based Attack Against Tor.

Networking
A New Cell Counting Based Attack Against Tor. Various low-latency anonymous communication systems such as Tor and Anonymizer have been designed to provide anonymity service for users. In order to hide the communication of users, most of the anonymity systems pack the application data into equal-sized cells. Via extensive experiments on Tor, we found that the size of IP packets in the Tor network can be very dynamic because a cell is an application concept and the IP layer may repack cells. Based on this finding, we investigate a new cell-counting-based attack against Tor, which allows the attacker to confirm anonymous communication relationship among users very quickly. In this attack, by marginally varying the number of cells in the target traffic at the malicious exit onion router, the attacker can…
Read More

Load Balancing Multipath Switching System with Flow Slice.

Networking
Load Balancing Multipath Switching System with Flow Slice. Multipath Switching systems are intensely used in state-of-the-art core routers to provide terabit or even petabit switching capacity. One of the most intractable issues in designing MPS is how to load balance traffic across its multiple paths while not disturbing the interflow packet orders. Previous packet-based solutions either suffer from delay penalties or lead to hardware complexity, hence do not scale. Flow-based hashing algorithms also perform badly due to the heavy-tailed flow-size distribution. In this paper, we develop a novel scheme, namely, Flow Slice that cuts off each flow into flow slices at every interflow interval larger than a slicing threshold and balances the load on a finer granularity. Based on the studies of tens of real Internet traces, we show that…
Read More

Optimal Power Allocation in Multi-Relay MIMO Cooperative Networks: Theory and Algorithms.

Networking
Optimal Power Allocation in Multi-Relay MIMO Cooperative Networks: Theory and Algorithms. Cooperative networking is known to have significant potential in increasing network capacity and transmission reliability. Although there have been extensive studies on applying cooperative networking in multi-hop ad hoc networks, most works are limited to the basic three-node relay scheme and single-antenna systems. These two limitations are interconnected and both are due to a limited theoretical understanding of the optimal power allocation structure in MIMO cooperative networks (MIMO-CN). In this paper, we study the structural properties of the optimal power allocation in MIMOCN with per-node power constraints. More specifically, we show that the optimal power allocations at the source and each relay follow a matching structure in MIMO-CN. This result generalizes the power allocation result under the basic three-node…
Read More

Assessing the Veracity of Identity Assertions via OSNs.

Networking
Assessing the Veracity of Identity Assertions via OSNs. Anonymity is one of the main virtues of the Internet, as it protects privacy and enables users to express opinions more freely. However, anonymity hinders the assessment of the veracity of assertions that online users make about their identity attributes, such as age or profession. We propose FaceTrust, a system that uses online social networks to provide lightweight identity credentials while preserving a user’s anonymity. Face-Trust employs a game with a purpose” design to elicit the opinions of the friends of a user about the user’s self-claimed identity attributes, and uses attack-resistant trust inference to assign veracity scores to identity attribute assertions. FaceTrust provides credentials, which a user can use to corroborate his assertions. We evaluate our proposal using a live Facebook…
Read More

Handling Multiple Failures in IP Networks through Localized On-Demand Link State Routing

Networking
Handling Multiple Failures in IP Networks through Localized On-Demand Link State Routing It has been observed that transient failures are fairly common in IP backbone networks and there have been several proposals based on local rerouting to provide high network availability despite failures. While most of these proposals are effective in handling single failures, they either cause loops or drop packets in the case of multiple independent failures. To ensure forwarding continuity even with multiple failures, we propose Localized On-demand Link State (LOLS) routing. Under LOLS, each packet carries a blacklist, which is a minimal set of failed links encountered along its path, and the next hop is determined by excluding the blacklisted links. We show that the blacklist can be reset when the packet makes forward progress towards the…
Read More

FireCol: A Collaborative Protection Network for the Detection of Flooding DDoS Attacks

Networking
FireCol: A Collaborative Protection Network for the Detection of Flooding DDoS Attacks Distributed denial-of-service (DDoS) attacks remain a major security problem, the mitigation of which is very hard especially when it comes to highly distributed botnet-based attacks. The early discovery of these attacks, although challenging, is necessary to protect end-users as well as the expensive network infrastructure resources. In this paper, we address the problem of DDoS attacks and present the theoretical foundation, architecture, and algorithms of FireCol. The core of FireCol is composed of intrusion prevention systems (IPSs) located at the Internet service providers (ISPs) level. The IPSs form virtual protection rings around the hosts to defend and collaborate by exchanging selected traffic information. The evaluation of FireCol using extensive simulations and a real dataset is presented, showing FireCol…
Read More

Participatory Privacy: Enabling Privacy in Participatory Sensing

Networking
Participatory Privacy: Enabling Privacy in Participatory Sensing Participatory Sensing is an emerging computing paradigm that enables the distributed collection of data by self-selected participants. It allows the increasing number of mobile phone users to share local knowledge acquired by their sensor-equipped devices, e.g., to monitor temperature, pollution level or consumer pricing information. While research initiatives and prototypes proliferate, their real-world impact is often bounded to comprehensive user participation. If users have no incentive, or feel that their privacy might be endangered, it is likely that they will not participate. In this article, we focus on privacy protection in Participatory Sensing and introduce a suitable privacy-enhanced infrastructure. First, we provide a set of definitions of privacy requirements for both data producers (i.e., users providing sensed information) and consumers (i.e., applications accessing…
Read More

A Fast Re-Route Method

Networking
A Fast Re-Route Method We present a method to find an alternate path, after a link failure, from a source node to a destination node, before the Interior Gateway Protocol (e.g., OSPF or IS-IS) has had a chance to reconverge in response to the failure. The target application is a small (up to tens of nodes) regional access subnetwork of a service provider’s network, which is a typical access scale encountered in practice. We illustrate the method and prove that it will find a path if one exists.
Read More

Optimum Relay Selection for Energy-Efficient Cooperative Ad Hoc Networks

Networking
Optimum Relay Selection for Energy-Efficient Cooperative Ad Hoc Networks The Cooperative Communication (CC) is a technology that allows multiple nodes to simultaneously transmit the same data. It can save power and extend transmission coverage. However, prior research work on topology control considers CC only in the aspect of energy saving, not that of coverage extension. We identify the challenges in the development of a centralized topology control scheme, named Cooperative Bridges, which reduces transmission power of nodes as well as increases network connectivity. Prior research on topology control with CC only focuses on maintaining the network connectivity, minimizing the transmission power of each node, whereas ignores the energy efficiency of paths in constructed topologies. This may cause inefficient routes and hurt the overall network performance in cooperative ad hoc networks.…
Read More

Detecting and Resolving Firewall Policy Anomalies

Networking
Detecting and Resolving Firewall Policy Anomalies As the network dramatically extended security considered as major issue in networks. There are many methods to increase the network security at the moment such as encryption, VPN, firewall etc. but all of these are too static to give an effective protection against attack and counter attack. We use data mining algorithm and apply it to the anomaly detection problem. In this work our aim to use data mining techniques including classification tree and support vector machines for anomaly detection. The result of experiments shows that the algorithm C4.5 has greater capability than SVM in detecting network anomaly and false alarm rate by using 1999 KDD cup data.
Read More

Detecting and Resolving Firewall Policy Anomalies

Networking
Detecting and Resolving Firewall Policy Anomalies As the network dramatically extended security considered as major issue in networks. There are many methods to increase the network security at the moment such as encryption, VPN, firewall etc. but all of these are too static to give an effective protection against attack and counter attack. We use data mining algorithm and apply it to the anomaly detection problem. In this work our aim to use data mining techniques including classification tree and support vector machines for anomaly detection. The result of experiments shows that the algorithm C4.5 has greater capability than SVM in detecting network anomaly and false alarm rate by using 1999 KDD cup data.
Read More

Denial of Service Defense through Web Referral

Networking
Denial of Service Defense through Web Referral The web is a complicated graph, with millions of websites interlinked together. In this paper, we propose to use this web sitegraph structure to mitigate flooding attacks on a website, using a new web referral architecture for privileged service (?WRAPS?). WRAPS allows a legitimate client to obtain a privilegeURL through a click on a referral hypherlink, from a website trusted by the target website. Using that URL, the client can get privileged access to the target website in a manner that is far less vulnerable to a DDoS flooding attack. WRAPS does not require changes to web client software and is extremely lightweight for referrer websites, which eases its deployment. The massive scale of the web sitegraph could deter attempts to isolate a…
Read More

Efficiency of content distribution via network coding

Networking
Efficiency of content distribution via network coding Content distribution via network coding has received a lot of attention lately. However, direct application of network coding may be insecure. In particular, attackers can inject “bogus” data to corrupt the content distribution process so as to hinder the information dispersal or even deplete the network resource. Therefore, content verification is an important and practical issue when network coding is employed. When random linear network coding is used, it is infeasible for the source of the content to sign all the data, and hence, the traditional “hash-and-sign” methods are no longer applicable. Recently, a new on-the-fly verification technique has been proposed by Krohn et al. (IEEE S&P ’04), which employs a classical homomorphic hash function. However, this technique is difficult to be applied…
Read More