To Get any Project for CSE, IT ECE, EEE Contact Me @ 09666155510, 09849539085 or mail us - ieeefinalsemprojects@gmail.com-Visit Our Website: www.finalyearprojects.org
A brief look at visionOS - How to develop app on Apple's Vision Pro
IEEE 2014 JAVA NETWORKING PROJECTS Data retrieval scheduling for multi item requests in multi-channel wireless broadcast environments
1. GLOBALSOFT TECHNOLOGIES
IEEE PROJECTS & SOFTWARE DEVELOPMENTS
IEEE FINAL YEAR PROJECTS|IEEE ENGINEERING PROJECTS|IEEE STUDENTS PROJECTS|IEEE
BULK PROJECTS|BE/BTECH/ME/MTECH/MS/MCA PROJECTS|CSE/IT/ECE/EEE PROJECTS
CELL: +91 98495 39085, +91 99662 35788, +91 98495 57908, +91 97014 40401
Visit: www.finalyearprojects.org Mail to:ieeefinalsemprojects@gmai l.com
Data Retrieval Scheduling for Multi-Item Requests in Multi-
Channel Wireless Broadcast Environments
Abstract
Wireless data broadcast is an efficient way of disseminating data to users in the mobile
computing environments. From the server's point of view, how to place the data items on
channels is a crucial issue, with the objective of minimizing the average access time and
tuning time. Similarly, how to schedule the data retrieval process for a given request at the
client side such that all the requested items can be downloaded in a short time is also an
important problem. In this paper, we investigate the multi-item data retrieval scheduling in
the push-based multichannel broadcast environments. We prove the decision version of this
problem is NP-complete, and we devise an algebraic algorithm to search for the best
solution. We also develop a heuristic that can employ the algebraic algorithm to download a
large number of items efficiently. When there is no replicated item in a broadcast cycle, we
show that an optimal retrieval schedule can be obtained in polynomial time. The
performances of proposed algorithms are analyzed theoretically and evaluated through
simulation. The experimental results show that our algorithms can significantly reduce the
access time for multi-item requests.
Existing system
Wireless data broadcast is an efficient way of disseminating data to users in the mobile
computing environments. From the server's point of view, how to place the data items on
channels is a crucial issue, with the objective of minimizing the average access time and
tuning time. Similarly, how to schedule the data retrieval process for a given request at the
client side such that all the requested items can be downloaded in a short time is also an
important problem.
2. Proposed system
In this paper, we investigate the multi-item data retrieval scheduling in the push-based
multichannel broadcast environments. We prove the decision version of this problem is NP-complete,
and we devise an algebraic algorithm to search for the best solution. We also
develop a heuristic that can employ the algebraic algorithm to download a large number of
items efficiently. When there is no replicated item in a broadcast cycle, we show that an
optimal retrieval schedule can be obtained in polynomial time. The performances of
proposed algorithms are analyzed theoretically and evaluated through simulation. The
experimental results show that our algorithms can significantly reduce the access time for
multi-item requests.
SYSTEM CONFIGURATION:-
HARDWARE CONFIGURATION:-
Processor - Pentium –IV
Speed - 1.1 Ghz
RAM - 256 MB(min)
Hard Disk - 20 GB
Key Board - Standard Windows Keyboard
Mouse - Two or Three Button Mouse
Monitor - SVGA
SOFTWARE CONFIGURATION:-
Operating System : Windows XP
Programming Language : JAVA
Java Version : JDK 1.6 & above.