A Distributed data extraction and visualisation service for wireless sensor networks
dc.contributor.advisor | Newman, Robert | |
dc.contributor.author | Hammoudeh, Mohammad | |
dc.date.accessioned | 2009-06-19T14:35:21Z | |
dc.date.available | 2009-06-19T14:35:21Z | |
dc.date.issued | 2009 | |
dc.identifier.uri | http://hdl.handle.net/2436/71053 | |
dc.description | A thesis submitted in partial fulfilment of the requirements of the University of Wolverhampton for the degree of Doctor of Philosophy | |
dc.description.abstract | With the increase in applications of wireless sensor networks, data extraction and visualisation have become a key issue to develop and operate these networks. Wireless sensor networks typically gather data at a discrete number of locations. By bestowing the ability to predict inter-node values upon the network, it is proposed that it will become possible to build applications that are unaware of the concrete reality of sparse data. The aim of this thesis is to develop a service for maximising information return from large scale wireless sensor networks. This aim will be achieved through the development of a distributed information extraction and visualisation service called the mapping service. In the distributed mapping service, groups of network nodes cooperate to produce local maps which are cached and merged at a sink node, producing a map of the global network. Such a service would greatly simplify the production of higher-level information-rich representations suitable for informing other network services and the delivery of field information visualisations. The proposed distributed mapping service utilises a blend of both inductive and deductive models to successfully map sense data and the universal physical principles. It utilises the special characteristics of the application domain to render visualisations in a map format that are a precise reflection of the concrete reality. This service is suitable for visualising an arbitrary number of sense modalities. It is capable of visualising from multiple independent types of the sense data to overcome the limitations of generating visualisations from a single type of a sense modality. Furthermore, the proposed mapping service responds to changes in the environmental conditions that may impact the visualisation performance by continuously updating the application domain model in a distributed manner. Finally, a newdistributed self-adaptation algorithm, Virtual Congress Algorithm,which is based on the concept of virtual congress is proposed, with the goal of saving more power and generating more accurate data visualisation. | |
dc.language.iso | en | |
dc.publisher | University of Wolverhampton | |
dc.subject | Wireless sensor networks | |
dc.subject | Visualisation | |
dc.subject | Data extraction | |
dc.subject | Mapping services | |
dc.subject | Interpolation | |
dc.subject | Self-adaptation | |
dc.subject | Routing algorithms for wireless sensor networks | |
dc.title | A Distributed data extraction and visualisation service for wireless sensor networks | |
dc.type | Thesis or dissertation | |
dc.type.qualificationname | PhD | |
dc.type.qualificationlevel | Doctoral | |
refterms.dateFOA | 2018-08-21T15:47:21Z | |
html.description.abstract | With the increase in applications of wireless sensor networks, data extraction and visualisation have become a key issue to develop and operate these networks. Wireless sensor networks typically gather data at a discrete number of locations. By bestowing the ability to predict inter-node values upon the network, it is proposed that it will become possible to build applications that are unaware of the concrete reality of sparse data. The aim of this thesis is to develop a service for maximising information return from large scale wireless sensor networks. This aim will be achieved through the development of a distributed information extraction and visualisation service called the mapping service. In the distributed mapping service, groups of network nodes cooperate to produce local maps which are cached and merged at a sink node, producing a map of the global network. Such a service would greatly simplify the production of higher-level information-rich representations suitable for informing other network services and the delivery of field information visualisations. The proposed distributed mapping service utilises a blend of both inductive and deductive models to successfully map sense data and the universal physical principles. It utilises the special characteristics of the application domain to render visualisations in a map format that are a precise reflection of the concrete reality. This service is suitable for visualising an arbitrary number of sense modalities. It is capable of visualising from multiple independent types of the sense data to overcome the limitations of generating visualisations from a single type of a sense modality. Furthermore, the proposed mapping service responds to changes in the environmental conditions that may impact the visualisation performance by continuously updating the application domain model in a distributed manner. Finally, a newdistributed self-adaptation algorithm, Virtual Congress Algorithm,which is based on the concept of virtual congress is proposed, with the goal of saving more power and generating more accurate data visualisation. |