We propose a Latency EQualization (LEQ) service, which equalizes the perceived latency for all clients participating in an interactive network application. To effectively implement the proposed LEQ service, network support is essential. The LEQ architecture uses a few routers in the network as hubs to redirect packets of interactive applications along paths with similar end-to-end […]
Archives for February 2013
Dynamic Cluster based Energy efficient protocol for wireless sensor networks
Wireless sensor networks (WSNs) are considered as energy constrained network because it contains sensor nodes with limited battery capacity and transmission range. In WSNs there is one mechanism used to enlarge the lifespan of network and provide more efficient functioning procedures that is clustering. Clustering is a process to subdivide the sensing field of sensor […]
Dynamic Cluster based Energy efficient protocol for wireless sensor networks
Wireless sensor networks (WSNs) are considered as energy constrained network because it contains sensor nodes with limited battery capacity and transmission range. In WSNs there is one mechanism used to enlarge the lifespan of network and provide more efficient functioning procedures that is clustering. Clustering is a process to subdivide the sensing field of sensor […]
Secure Data Forwarding and Integrity checking in Multi Cloud Storage system
A cloud storage system, consisting of a collection of storage servers, provides long-term storage services over the Internet. One of the important concerns that need to be addressed is to assure the customer of the integrity i.e. correctness of his data in the cloud. In this paper we provide a scheme which gives a proof […]
Dynamic Data Operation and Secure access control in cloud computing
The many advantages of cloud computing are increasingly attracting individuals and organizations to outsource their data from local to remote cloud servers. However, security and privacy concerns have arisen as obstacles to widespread adoption of clouds by users. While much cloud security research focuses on enforcing standard access control policies typical of centralized systems, such […]
Detecting and preventing a selfishness in Mobile Ad Hoc Network
A mobile ad-hoc network (MANET) is the collection of mobile nodes that are equipped by several wireless mobile devices which are using for communication. In MANET, most of the Replica allocation techniques are assuming that all mobile nodes cooperate fully in the network functionalities. Some nodes decide not to cooperate partially or fully. Network performance […]
Latency Equalization using greedy hub selection
In this paper, we design and implement network-based Latency EQualization (LEQ), which is a service that Internet service providers (ISPs) can provide for various interactive network applications. Our LEQ architecture provides a flexible routing framework that enables the network provider to implement different delay and delay difference optimization policies in order to meet the requirements […]
Selfish node detection in MANET
In this paper, we address the problem of selfishness in the context of replica allocation in a MANET, i.e., a selfish node may not share its own memory space to store replica for the benefit of other nodes. In this paper, we shall refer to such a problem as the selfish replica allocation. Simply, selfish […]
Co-distribution patterns Mining for Maximum crime datasets
Crime activities are geospatial phenomena and as such are geospatially, thematically and temporally correlated. We analyze crime datasets in conjunction with socio-economic and socio-demographic factors to discover co-distribution patterns that may contribute to the formulation of crime. We propose a graph based dataset representation that allows us to extract patterns from heterogeneous areal aggregated datasets […]
Class-dependent density-based feature Elimination
High-dimensional data sets are inherently sparse and hence, can be transformed to lower dimensions without losing too much information about the classes. In this paper we propose a new feature ranking algorithm, termed as, class-dependent density-based feature elimination, for binary data sets. CDFE uses a measure termed as, diff-criterion, to estimate the relevance of features. […]