Energy-efficient priority-based routing scheme for the healthcare wireless sensor networks
- Authors: Saeed, Ather , Stranieri, Andrew , Dazeley, Richard
- Date: 2014
- Type: Text , Conference paper
- Relation: 9th WSEAS International Conference on Remote Sensing, Budapest 10/12/2103 pg 19-27
- Full Text: false
- Reviewed:
- Description: Abstract: - In time-critical and data intensive applications, efficient acquisition of sensitive datasets is a challenge because of network congestion, void regions and node failures that commonly occur in wireless sensor networks (WSN), while monitoring the wellbeing of patients with serious medical conditions. The sensor devices attached to such patients are used for monitoring the vital signs of those with serious heart problems, Parkinson disease, Epilepsy and high blood pressure. This paper typically focuses on the reliable acquisition of datasets and provides a fault-tolerant priority based routing scheme with Dynamic Jumping (FTMPR-DJ) for the energy-efficient acquisition and dissemination of datasets. A new fault-tolerant scheme has been proposed that will significantly minimize data loss and network congestion and is well supported with extensive experiments to show effectiveness of the proposed routing scheme.
Real-time self-stabilizing scheme for the localization of faults in wireless sensor networks
- Authors: Saeed, Ather , Stranieri, Andrew , Dazeley, Richard
- Date: 2014
- Type: Text , Book chapter
- Relation: Recents advances in Image, Audio and Signal Processing p. 233-242
- Full Text: false
- Reviewed:
- Description: Reliable acquisition of data from massively dense wireless sensor networks (WSN) is a challenge due to the unpredictable behaviour of nodes responsible for collecting and disseminating datasets of interest. Therefore, accurate sensing of events from nodes depend on several microscopic and macroscopic factors such as distance of a node from the sink, radio signal strength and connectedness of network for routing datasets to the nearest sink. Several Clustering schemes have been proposed for routing datasets, where major focus was on finding the next cluster-head with maximum energy for routing data. Such schemes are not suitable for the real-time dissemination of datasets because electing the next cluster-head is a computational intensive process. A new energy-efficient self-stabilizing sliding rectangle protocol (ESSRP) is proposed in this paper for ensuring reliability and connectedness of regions for minimizing data loss and prolonging network life. The proposed scheme not only looks at the energy-balance of a particular cluster but also ensures fault-localization and tolerance by providing self-stabilization to network in the event of nodes or links failure using Green’s Theorem. The WSN rectangular regions should be oriented counter-clockwise, piecewise regular and continuously differentiable so that faults can be efficiently localized, identified and rectified in a particular region
Fault-tolerant data aggregation scheme for monitoring of critical events in grid based healthcare sensor networks
- Authors: Saeed, Ather , Stranieri, Andrew , Dazeley, Richard
- Date: 2011
- Type: Text , Conference paper
- Relation: Paper presented at 19th High Peformance Computing Symposium (HPC 2011) part of SCS Spring Simulation Multiconference (SpringSim'11)
- Full Text:
- Reviewed:
- Description: Wireless sensor devices are used for monitoring patients with serious medical conditions. Communication of content-sensitive and context sensitive datasets is crucial for the survival of patients so that informed decisions can be made. The main limitation of sensor devices is that they work on a fixed threshold to notify the relevant Healthcare Professional (HP) about the seriousness of a patient’s current state. Further, these sensor devices have limited processor, memory capabilities and battery. A new grid-based information monitoring architecture is proposed to address the issues of data loss and timely dissemination of critical information to the relevant HP. The proposed approach provides an opportunity to efficiently aggregate datasets of interest by reducing network overhead and minimizing data latency. To narrow down the problem domain, in-network processing of datasets with Grid monitoring capabilities is proposed for the efficient execution of the computational, resource and data intensive tasks. Interactive wireless sensor networks do not guarantee that data gathered from the heterogeneous sources will always arrive at the sink (base) node, but the proposed aggregation technique will provide a fault tolerant solution to the timely notification of a patient’s critical state. Experimental results received are encouraging and clearly show a reduction in the network latency rate.
Grid-based information retrieval for the aggregation of legal datasets in online dispute resolution
- Authors: Saeed, Ather , Stranieri, Andrew , Dazeley, Richard , Ma, Liping
- Date: 2009
- Type: Text , Journal article
- Relation: Communications of SIWN Vol. 6, no. April (2009), p. 16-22
- Full Text: false
- Description: The Web is a stateless and complex environment when it comes to the retrieval of information from millions of computers connected to the Internet via WWW servers. Information Retrieval (IR) from heterogeneous data sources poses a great challenge as the information of interest is stored in a variety of different formats. Answering an enormous amount of queries is a resource and computational intensive task in ODR (Online Dispute Resolution). Information availability also poses a challenge when it comes to the mediation and arbitration processes in resolving eCommerce and legal disputes. A new Grid-based information retrieval model is proposed for the aggregation and replication of legal datasets from remote machines with indexed-based search facility. Datasets of interests will be indexed with a slight modification to the existing indexing scheme. A new strategy is proposed to deal with similar queries posted over and over again and how the commonality among the XML query trees are exploited and merged for the efficient retrieval of information.
Scalable continuous query architecture for eCommerce and legal disputes
- Authors: Saeed, Ather , Stranieri, Andrew , Dazeley, Richard , Ma, Liping
- Date: 2008
- Type: Text , Journal article
- Relation: Communications of SIWN Vol. 3, no. (2008), p. 1-6
- Full Text: false
- Reviewed:
- Description: Continuous Queries (CQ) are persistent, content sensitive and time dependent. Once the CQ is installed it will continuously poll the data sources and monitor updates of interest. This paper discusses major problems and issues with the existing CQ techniques for monitoring updates of interest on the web. A new Continuous Query based architecture is proposed to deal with the context sensitive problems of negotiation, mediation and arbitration to resolve Ecommerce and legal disputes. A business process model is given to automate mediation and arbitration processes in ODR (Online dispute resolution) to resolve disputes efficiently and in a timely manner. In the proposed CQ-Mediator architecture partial page update and web services are integrated for efficient monitoring and notification of updates to the disputants, mediators and arbitrators. Performance results of the proposed architecture and business process model for CQ-based ODR is also discussed in the experiment section.
- Description: 2003006852