| EPSRC Reference: |
EP/P021247/1 |
| Title: |
Compact Self-Healing and Routing Over Low Memory Nodes (COSHER) |
| Principal Investigator: |
Trehan, Dr A |
| Other Investigators: |
|
| Researcher Co-Investigators: |
|
| Project Partners: |
|
| Department: |
Computer Science |
| Organisation: |
Loughborough University |
| Scheme: |
First Grant - Revised 2009 |
| Starts: |
01 July 2017 |
Ends: |
30 April 2019 |
Value (£): |
100,868
|
| EPSRC Research Topic Classifications: |
| Networks & Distributed Systems |
|
|
| EPSRC Industrial Sector Classifications: |
| No relevance to Underpinning Sectors |
|
|
| Related Grants: |
|
| Panel History: |
| Panel Date | Panel Name | Outcome |
|
12 Jan 2017
|
EPSRC ICT Prioritisation Panel Jan 2017
|
Announced
|
|
|
Summary on Grant Application Form |
Computer Networks have permeated every sphere of our lives. For example, the Internet has almost instantaneously taken over global communications and networks now pervade every part of our professional, personal and social life. A major part of this revolution is computing devices coming together in an ad-hoc manner in the form of Peer-to-Peer (P2P) overlay networks. A good example is the digital currency Bitcoin built upon P2P technology. The next step in this revolution is the Internet of Things (IOT) which will involve everyday objects of our use fitted with small low memory sensors communicating with each other forming adhoc Peer-to-Peer networks. Such networks will also be highly dynamic with frequent additions, removals or failures of nodes.
In this scenario, my project will initiate research into the development of fault-tolerant routing for such large scale networks of devices with low memory. We plan to achieve this by developing mathematically rigorous novel compact self-healing routing distributed algorithms leveraging the intense research done in previous years in compact routing and in self-healing algorithms.
Self-healing is a paradigm for reconfigurable networks that restores the global state of a network by only local changes following an adversarial attack, and allows us to deal with node removals or additions. Routing is the essential requirement in any network of being able to transport packets of data from sender node(s) to receiver node(s) often using packet headers and routing tables on intermediate nodes. Compact routing attempts to make routing scalable for large networks by minimising the space requirements at the cost of some additional delay in delivery (this is called 'stretch'). In this proposal, I plan to design a series of self-healing compact routing algorithms for nodes with low memory. These algorithms shall be mathematically analysed and bench-tested for accuracy and efficiency (in terms of time, space and message complexities).
I will actively disseminate our algorithms and generate increased scientific interest in Queen's, the larger academic community and the general public towards this line of work. Success in development of such algorithms will have significant impact down the line in development of such technologies and contribute towards preparing the UK for technologies such as IOT.
|
|
Key Findings |
|
This information can now be found on Gateway to Research (GtR) http://gtr.rcuk.ac.uk
|
|
Potential use in non-academic contexts |
|
This information can now be found on Gateway to Research (GtR) http://gtr.rcuk.ac.uk
|
|
Impacts |
|
| Description |
This information can now be found on Gateway to Research (GtR) http://gtr.rcuk.ac.uk |
| Summary |
|
| Date Materialised |
|
|
|
|
Sectors submitted by the Researcher |
|
This information can now be found on Gateway to Research (GtR) http://gtr.rcuk.ac.uk
|
| Project URL: |
|
| Further Information: |
|
| Organisation Website: |
http://www.lboro.ac.uk |