Tracking Message Spread in Mobile Delay Tolerant Networks

Tracking Message Spread in Mobile Delay Tolerant Networks Delay Tolerant Network is considered under two message forwarding schemes – a non-replicative direct delivery scheme and a replicative epidemic routing scheme. The objective is to track the degree of spread of a message in the network. Such estimation can be used for on-line control of message dissemination. With a homogeneous mobility model with pairwise i.i.d. exponential intermeeting times, we rigorously derive the system dynamic and measurement equations for optimal tracking by a Kalman filter. Moreover, we provide a framework for tracking…

Read More

A Privacy-Preserving Framework for Managing Mobile Ad Requests and Billing Information

A Privacy-Preserving Framework for Managing Mobile Ad Requests and Billing Information Organizations are starting to realize the significant value of advertising on mobile devices, and a number of systems have been developed to exploit this opportunity. From a privacy perspective, practically all systems developed so far are based either on a trusted third-party model or on a generalized architecture. A system proposed for delivering context, location, time, and preference-aware advertisements to mobiles with a novel architecture to preserve privacy. The main adversary in this model is the server distributing the…

Read More

Maximizing P2P File Access Availability in Mobile Ad hoc Networks Though Replication for Efficient File Sharing

Maximizing P2P File Access Availability in Mobile Ad hoc Networks Though Replication for Efficient File Sharing File sharing applications in mobile ad hoc networks (MANETs) have attracted more and more attention in recent years. The efficiency of file querying suffers from the distinctive properties of such networks including node mobility and limited communication range and resource. An intuitive method to alleviate this problem is to create file replicas in the network. However, despite the efforts on file replication, no research has focused on the global optimal replica creation with minimum…

Read More

Secure and Distributed Data Discovery and Dissemination in Wireless Sensor Networks

Secure and Distributed Data Discovery and Dissemination in Wireless Sensor Networks Due to limited computational power and energy resources, aggregation of data from multiple sensor nodes done at the aggregating node is usually accomplished by simple methods such as averaging. However such aggregation is known to be highly vulnerable to node compromising attacks. Since WSN are usually unattended and without tamper resistant hardware, they are highly susceptible to such attacks. Thus, ascertaining trustworthiness of data and reputation of sensor nodes is crucial for WSN. As the performance of very low…

Read More

Neighbor Discovery in Wireless Networks with Multipacket Reception

Neighbor Discovery in Wireless Networks with Multipacket Reception Neighbor discovery is one of the first steps in configuring and managing a wireless network. Most existing studies on neighbor discovery assume a single-packet reception model where only a single packet can be received successfully at a receiver. Neighbor discovery in MPR networks is studied that allow packets from multiple simultaneous transmitters to be received successfully at a receiver. Starting with a clique of n nodes, a simple Aloha-like algorithm is analyzed and show that it takes time to discover all neighbors…

Read More

Neighbor Similarity Trust against Sybil Attack in P2P E-Commerce

Peer to peer (P2P) e-commerce applications exist at the edge of the Internet with vulnerabilities to passive and active attacks. These attacks have pushed away potential business firms and individuals whose aim is to get the best benefit in e-commerce with minimal losses. The attacks occur during interactions between the trading peers as a transaction takes place. How to address Sybil attack is studied, an active attack, in which peers can have bogus and multiple identities to fake their owns. Most existing work, which concentrates on social networks and trusted…

Read More

A Proximity-aware Interest-clustered P2P File Sharing System

A Proximity-aware Interest-clustered P2P File Sharing System Efficient file query is important to the overall performance of peer-to-peer (P2P) file sharing systems. Clustering peers by their common interests can significantly enhance the efficiency of file query. Clustering peers by their physical proximity can also improve file query performance. However, few current works are able to cluster peers based on both peer interest and physical proximity. Although structured P2Ps provide higher file query efficiency than unstructured P2Ps, it is difficult to realize it due to their strictly defined topologies. Proximity-Aware and…

Read More

Efficient two-server password-only authenticated key exchange

Efficient two-server password-only authenticated key, Password-authenticated key exchange (PAKE) is where a client and a server, who share a password, authenticate each other and meanwhile establish a cryptographic key by exchange of messages. In this setting, all the passwords necessary to authenticate clients are stored in a single server. If the server is compromised, due to, for example, hacking or even insider attack, passwords stored in the server are all disclosed. A scenario is considered, where two servers cooperate to authenticate a client and if one server is compromised, the…

Read More

Hop-by-hop message authentication and source privacy in wireless sensor networks

hop-by-hop message authentication and source privacy in wireless sensor networks Hop-By-Hop Message authentication is one of the most effective ways to thwart unauthorized and corrupted messages from being forwarded in wireless sensor networks (WSNs). For this reason, many message authentication schemes have been developed, based on either symmetric-key cryptosystems or public-key cryptosystems. Most of them, however, have the limitations of high computational and communication overhead in addition to lack of scalability and resilience to node compromise attacks. To address these issues, a polynomial-based scheme was recently introduced. However, this scheme…

Read More

Cross-Layer Approach for Minimizing Routing Disruption in IP Networks

Backup paths are widely used in IP networks to protect IP links from failures. However, existing solutions such as the commonly used independent model and Shared Risk Link Group (SRLG) model do not accurately reflect the correlation between IP link failures, and thus may not choose reliable backup paths. We propose a cross-layer approach for minimizing routing disruption caused by IP link failures. We develop a probabilistically correlated failure (PCF) model to quantify the impact of IP link failure on the reliability of backup paths. With the PCF model, we…

Read More