Abuarqoub, Abdelrahman (2014) Cooperative mobility maintenance techniques for information extraction from mobile wireless sensor networks. Doctoral thesis (PhD), Manchester Metropolitan University.
|
Available under License Creative Commons Attribution Non-commercial No Derivatives. Download (3MB) | Preview |
Abstract
Recent advances in the development of microprocessors, microsensors, ad-hoc wireless networking and information fusion algorithms led to increasingly capable Wireless Sensor Networks (WSNs). Besides severe resource constraints, sensor nodes mobility is considered a fundamental characteristic of WSNs. Information Extraction (IE) is a key research area within WSNs that has been characterised in a variety of ways, ranging from a description of its purposes to reasonably abstract models of its processes and components. The problem of IE is a challenging task in mobile WSNs for several reasons including: the topology changes rapidly; calculation of trajectories and velocities is not a trivial task; increased data loss and data delivery delays; and other context and application specific challenges. These challenges offer fundamentally new research problems. There is a wide body of literature about IE from static WSNs. These approaches are proved to be effective and efficient. However, there are few attempts to address the problem of IE from mobile WSNs. These attempts dealt with mobility as the need arises and do not deal with the fundamental challenges and variations introduced by mobility on the WSNs. The aim of this thesis is to develop a solution for IE from mobile WSNs. This aim is achieved through the development of a middle-layer solution, which enables IE approaches that were designed for the static WSNs to operate in the presence of multiple mobile nodes. This thesis contributes toward the design of a new self-stabilisation algorithm that provides autonomous adaptability against nodes mobility in a transparent manner to both upper network layers and user applications. In addition, this thesis proposes a dynamic network partitioning protocol to achieve high quality of information, scalability and load balancing. The proposed solution is flexible, may be applied to different application domains, and less complex than many existing approaches. The simplicity of the solutions neither demands great computational efforts nor large amounts of energy conservation. Intensive simulation experiments with real-life parameters provide evidence of the efficiency of the proposed solution. Performance experimentations demonstrate that the integrated DNP/SS protocol outperforms its rival in the literature in terms of timeliness (by up to 22%), packet delivery ratio (by up to 13%), network scalability (by up to 25%), network lifetime (by up to 40.6%), and energy consumption (by up to 39.5%). Furthermore, it proves that DNP/SS successfully allows the deployment of static-oriented IE approaches in hybrid networks without any modifications or adaptations.
Impact and Reach
Statistics
Additional statistics for this dataset are available via IRStats2.