E2R2: Energy-Efficient and Reliable Routing for Mobile Wireless Sensor Networks

E2R2: Energy-Efficient and Reliable Routing for Mobile Wireless Sensor Networks DOWNLOAD PROJECT SYNOPSIS -JAVA DOWNLOAD PROJECT SYNOPSIS -NS2 Wireless sensor networks (WSNs) are resource constrained. Energy is one of the most important resources in such networks. Therefore, optimal use of energy is necessary. A novel energy-efficient routing protocol is proposed for WSNs. The protocol is reliable in terms of data delivery at the base station (BS). Mobility in sensor nodes and in the BS is considered. The proposed protocol is hierarchical and cluster based. Each cluster consists of one cluster…

Read More

A System for Denial-of-Service Attack Detection Based on Multivariate Correlation Analysis

A System for Denial-of-Service Attack Detection Based on Multivariate Correlation Analysis Interconnected systems, such as Web servers, database servers, cloud computing servers etc, are now under threads from network attackers. As one of most common and aggressive means, Denial-of-Service (DoS) attacks cause serious impact on these computing systems. A DoS attack detection system is proposed that uses Multivariate Correlation Analysis (MCA) for accurate network traffic characterization by extracting the geometrical correlations between network traffic features. MCA-based DoS attack detection system employs the principle of anomaly-based detection in attack recognition. This…

Read More

Hiding in the Mobile Crowd: Location Privacy through Collaboration

Hiding in the Mobile Crowd: Location Privacy through Collaboration Location-aware smartphones support various location-based services (LBSs): users query the LBS server and learn on the fly about their surroundings. However, such queries give away private information, enabling the LBS to track users. A user-collaborative privacy-preserving approach is proposed for LBSs. This solution does not require changing the LBS server architecture and does not assume third party servers; yet, it significantly improves users’ location privacy. The gain stems from the collaboration of mobile devices: they keep their context information in a…

Read More

Incentive Based Data Sharing in Delay Tolerant Mobile Networks

Incentive Based Data Sharing in Delay Tolerant Mobile Networks Mobile wireless devices play important roles in our daily life, e.g., users often use such devices to take pictures and share with friends via opportunistic peer-to-peer links, which however are intermittent in nature, and hence require the store and- forward feature proposed in Delay Tolerant Networks to provide useful data sharing opportunities. Moreover, mobile devices may not be willing to forward data items to other devices due to the limited resources. Hence, effective data dissemination schemes need to be designed to…

Read More

Bandwidth Distributed Denial of Service: Attacks and Defenses

Bandwidth Distributed Denial of Service: Attacks and Defenses Distributed denial of service (DDoS) attacks pose a serious threat to the Internet. We discuss the Internet vulnerability to Bandwidth Distributed Denial of Service (BW-DDoS) attacks, where many hosts send a huge number of packets exceeding network capacity and causing congestion and losses, thereby disrupting legitimate traffic. TCP and other protocols employ congestion control mechanisms that respond to losses and delays by reducing network usage, hence, their performance may be degraded sharply due to such attacks. Attackers may disrupt connectivity to servers,…

Read More

Toward trustworthy coordination of web services business activities

Toward trustworthy coordination of web services business activities To present a lightweight Byzantine fault tolerance (BFT) algorithm, which can be used to render the coordination of web services business activities (WS-BA) more trustworthy. The lightweight design of the BFT algorithm is the result of a comprehensive study of the threats to the WS-BA coordination services and a careful analysis of the state model of WS-BA. The lightweight BFT algorithm uses source ordering, rather than total ordering, of incoming requests to achieve Byzantine fault tolerant, state-machine replication of the WS-BA coordination…

Read More

Privacy Preserving Data Sharing With Anonymous ID Assignment

Privacy Preserving Data Sharing With Anonymous ID Assignment INFORMATION FORENSICS AND SECURITY, FEBRUARY 2013 An algorithm for anonymous sharing of private data among parties is developed. This technique is used iteratively to assign these nodes ID numbers ranging from 1 to . This assignment is anonymous in that the identities received are unknown to the other members of the group. Resistance to collusion among other members is verified in an information theoretic sense when private communication channels are used. This assignment of serial numbers allows more complex data to be…

Read More

A Highly Scalable Key Pre-Distribution Scheme for Wireless Sensor Networks

A Highly Scalable Key Pre-Distribution Scheme for Wireless Sensor Networks Technology Used: Dot Net Given the sensitivity of the potential WSN applications and because of resource limitations, key management emerges as a challenging issue for WSNs. One of the main concerns when designing a key management scheme is the network scalability. Indeed, the protocol should support a large number of nodes to enable a large scale deployment of the network. In this paper, we propose a new scalable key management scheme for WSNs which provides a good secure connectivity coverage.…

Read More

Cross-domain privacy-preserving cooperative firewall optimization

Cross-domain privacy-preserving cooperative firewall optimization Technology Used: Java Firewalls have been widely deployed on the Internet for securing private networks. A firewall checks each incoming or outgoing packet to decide whether to accept or discard the packet based on its policy. Optimizing firewall policies is crucial for improving network performance. Prior work on firewall optimization focuses on either intra-firewall or inter-firewall optimization within one administrative domain where the privacy of firewall policies is not a concern. Inter-firewall optimization is considered across administrative domains for the first time. The key technical…

Read More

Bidirectional Multi-Constrained Routing Algorithms

Bidirectional Multi-Constrained Routing Algorithms Technology Used: Java QoS routing plays a critical role in providing QoS support in the Internet. Most existing QoS routing algorithms employ the strategy of unidirectional search in route selection. Bidirectional search has been recognized as an effective strategy for fast route acquisition in identifying the shortest path connecting a pair of nodes. However, its efficiency has not been well established in the context of route selection subject to multiple additive constraints, which is in general NP-Complete. To employ bidirectional search to support efficient QoS routing…

Read More