Upload
zebrosprojects
View
212
Download
0
Embed Size (px)
DESCRIPTION
Abstract We consider the problem of least-latency end-to-end routing over adaptively duty-cycled wireless sensor networks. Suchnetworks exhibit a time-dependent feature, where the link cost and transmission latency from one node to other nodes vary constantlyin different discrete time moments. We model the problem as the time-dependent Bellman-Ford problem. We show that such networkssatisfy the first-in-first-out (FIFO) property, which makes the time-dependent Bellman-Ford problem solvable in polynomial-time. Usingthe β_synchronizer, we propose a fast distributed algorithm to construct all-to-one shortest paths with polynomial message complexityand time complexity. The algorithm determines the shortest paths for all discrete times in a single execution, in contrast with multipleexecutions needed by previous solutions. We further propose an efficient distributed algorithm for time-dependent shortest path(TDSP) maintenance. The proposed algorithm is loop-free with low message complexit
Citation preview
ZEBROS PROJECTS
Office Address: No 4 / Flat No 3D, Sai Kiran Apts, First Main Road, Kasturba Nagar, Chennai-20 web: www.zebros.in e mail : [email protected] mob: 99400 98300,9500075001
WAY TO YOUR GOAL
NS2 PROJECTS
FINAL YEAR PROJECTS
IEEE PROJECTS 2013-2014
CONTACT: 9940098300, 9500075001
E-Mail:[email protected]
ZEBROS PROJECTS
Office Address: No 4 / Flat No 3D, Sai Kiran Apts, First Main Road, Kasturba Nagar, Chennai-20 web: www.zebros.in e mail : [email protected] mob: 99400 98300,9500075001
Least-Latency Routing over Time-Dependent Wireless Sensor Networks
Abstract
We consider the problem of least-latency end-to-end routing over adaptively
duty-cycled wireless sensor networks. Such networks exhibit a time-dependent feature,
where the link cost and transmission latency from one node to other nodes vary
constantly in different discrete time moments. We model the problem as the time-
dependent Bellman-Ford problem. We show that such networks satisfy the first-in-first-
out (FIFO) property, which makes the time-dependent Bellman-Ford problem solvable
in polynomial-time. Using the β_synchronizer, we propose a fast distributed algorithm
to construct all-to-one shortest paths with polynomial message complexity and time
complexity. The algorithm determines the shortest paths for all discrete times in a single
execution, in contrast with multiple executions needed by previous solutions. We
further propose an efficient distributed algorithm for time-dependent shortest path
(TDSP) maintenance. The proposed algorithm is loop-free with low message complexity
and low space complexity of O(maxdeg), where maxdeg is the maximum degree for all
nodes. We discuss a suboptimal implementation of our proposed algorithms that
reduces their memory requirement. The performance of our algorithms is
experimentally evaluated under diverse network configurations. The results reveal that
our algorithms are more efficient than previous solutions in terms of message cost and
space cost.
ZEBROS PROJECTS
Office Address: No 4 / Flat No 3D, Sai Kiran Apts, First Main Road, Kasturba Nagar, Chennai-20 web: www.zebros.in e mail : [email protected] mob: 99400 98300,9500075001
ZEBROS PROJECTS
SOFTWARE BASED HARDWARE BASED
Networking VLSI
Data Mining Mat lab
Grid Computing Robotics
Network Security Embedded
Image Processing Bio Medical
Web Applications Power Systems
Mobile Computing Power Electronics
Software Engineering Java with Embedded
Cloud Computing Android
What is IEEE?
The Institute of Electrical and Electronics Engineers or IEEE (read eye-triple-e) is Incorporated in the State of New York, United States. It was formed in 1963 by the merger of the Institute of Radio Engineers (IRE, founded 1912) and the American Institute of Electrical Engineers (AIEE, founded 1884). A membership organization comprised of engineers, scientists and students that sets standards for computers and communications. It is a nonprofit organization with more than 365,000 members in around 150 countries.
The IEEE describes itself as "the world's largest technical professional society -- promoting the development and application of electro technology and allied sciences for the benefit of humanity, the advancement of the profession, and the well-being of our members."
Why IEEE based projects?
It grantees for standard
It assured latest solution for problems
It delivers new patented technologies at an ever-increasing pace
It access world-class technical information provided by the IEEE and cut down your
research time.
ZEBROS PROJECTS
Office Address: No 4 / Flat No 3D, Sai Kiran Apts, First Main Road, Kasturba Nagar, Chennai-20 web: www.zebros.in e mail : [email protected] mob: 99400 98300,9500075001
OUR FEATURES
24*7 Call Support
Project Execution through Remote System
20 Days Technical classes taken by Corporate Trainer
Unlimited Project & Technical Support through your academic
Project software Installation support
PROJECT SUPPORT
0th Review 1st Review
Abstract Existing System Disadvantages Proposed System Advantages Objective System Requirements System Architecture
Literature Survey Module List Module Description Data Flow Diagram Level DFD Module Wise DFD Problem Definition Review Document Explanation
2nd Review 3rd Review
Use case Diagram Class Diagram Collaboration Diagram Sequence Diagram Activity Diagram Testing & test cases Partial Code Screenshot for First two
module Review Document Explanation
Conclusion References Future Enhancement 65% code (Executable Format) Required Software Review Document Explanation
Final Review
Complete Code with Enhancement
Final Document (University Standard Format)
Complete Explanation for Project Concept & Code