Student research opportunities
Data gathering in Wireless Sensor Networks via Mobile Sinks
Project Code: CECS_159
This project is available at the following levels:
CS single semester, Honours, Summer Scholar, Masters, PhD
Keywords:
Energy optimisation, trajectory finding, wireless sensor networks, approximation and heuristic algorithms.
Supervisor:
Assoc Professor Weifa LiangOutline:
In this project we are given a wireless sensor network with fixed numbers of mobile sinks, assume that the total travel distance by each mobile sink is bounded by L, the problem is to find a trajectory for each of the mobile sink such that the network lifetime is maximised, subject to the maximum length constraint L among the trajectories of mobile sinks.
Goals of this project
Study the non-trivial tradeoff between L and the network lifetime.
Devise fast approximation and/or heuristic algorithms for the problem
Perform experimental evaluation to the proposed algorithms
Requirements/Prerequisites
Program skills like C, C++, or Java
basic algorithm's backgrounds like maximum matching, shortest paths and minimum spanning trees. It will be a plus if the candidate has the knowledge of linear programming
Student Gain
Participate in the emerging hot topic research
Expand the knowledge base
learn how to deal with constrained optimisation problems
