Notice Board :

Call for Paper
Vol. 11 Issue 6

Submission Start Date:
June 01, 2019

Acceptence Notification Start:
June 10, 2019

Submission End:
June 20, 2019

Final MenuScript Due:
June 22, 2019

Publication Date:
June 25, 2019
                         Notice Board: Call for PaperVol. 11 Issue 6      Submission Start Date: June 01, 2019      Acceptence Notification Start: June 10, 2019      Submission End: June 20, 2019      Final MenuScript Due: June 22, 2019      Publication Date: June 25, 2019




Volume III Issue VI

Author Name
C Nwachukwu
Year Of Publication
2011
Volume and Issue
Volume 3 Issue 6
Abstract
In India Windows is the most widely used O perating System. Due to the unavailability of windows source code, evidence collection in the windows environment is tedious job. The available evidence sources in windows environment are heterogeneous in nature so their integration is also major challenge. In this paper the various sources of evidence in windows environment are identified and issues related to the evidence collections are discussed. A framework for investigation in windows environment is also proposed.
PaperID
2011/eusrm/03/06/1014

Author Name
O Olayide
Year Of Publication
2011
Volume and Issue
Volume 3 Issue 6
Abstract
Cloud computing is an emerging computing paradigm that has received enormous attention of late owing to the great promise it bears. It envisions flexible and dynamic IT infrastructures, Q oS (Quality of Service) guaranteed computing environments and configurable software services to end users over a network. An attractive promise of cloud computing is the provision of different levels of Q oS to different end users in accordance to their pay levels as per an agreed upon service level agreement (SLA). An end user requests for any of the variegated services to the cloud that the cloud computing service provider (CCSP) has to make available. Submission of such job requests to a cloud is a stochastic process. In this paper, an effort is made to embark upon a set of parameters that can act as deciding factors to schedule job requests submitted by the users to a cloud using a M/G/1 queuing model.
PaperID
2011/eusrm/03/06/1020

Author Name
B Omoleke
Year Of Publication
2011
Volume and Issue
Volume 3 Issue 6
Abstract
The rapid advancement of hardware technology has enabled the development of small, powerful, and inexpensive sensor nodes, which are capable of sensing, computation and wireless communication. This revolutionizes the deployment of wireless sensor network for monitoring some area and collecting regarding information. However, limited energy constraint presents a major challenge such vision to become reality. We consider energy constrained wireless sensor network deployed over a region. The main task of such a network is to gather information from node and transmit it to base station for further processing. So the aim of any data forwarding protocol is to conserve energy to maximize the network lifetime. Sensor nodes are capable of performing in network aggregation of data coming from more than one source. In this thesis we have concentrated on energy consumption issue and aim to develop an energy efficient data aggregation protocol. To provide energy efficiency we have considered a cluster-based wireless sensor network. Our protocol executes on each cluster independently and provides an energy efficient data aggregation in a cluster and hence maximize network lifetime for whole network.
PaperID
2011/eusrm/03/06/1025

Author Name
S Bondock
Year Of Publication
2011
Volume and Issue
Volume 3 Issue 6
Abstract
Mobile self-organizing ad hoc networks (MANETs) are seen as the future in distributed and ad hoc networking. In addition to the longstanding problems of wireless systems such as overhead costs, bandwidth scarcity, overloading and link degradation, MANETs have to grapple with routing protocols, caching protocols and energy conversion algorithms, along with the associated trade-offs. Node mobility creates high overheads with frequent routing protocols rapidly depleting battery energy. There is a need to develop energy aware and efficient routing protocols that still respond sensitively to node mobility. In this paper we float the concept of a virtual multi- hop ad hoc routing algorithm for MANETs. The concept clearly indicates a niche area for further research into increasing energy conservation without sacrificing performance, careful section of casting methods, and efficient use of bandwidth.
PaperID
2011/eusrm/03/06/1029