City Research Online

Graph-theoretic channel modeling and topology control protocols for wireless sensor networks

Qureshi, Hassaan Khaliq (2011). Graph-theoretic channel modeling and topology control protocols for wireless sensor networks. (Unpublished Doctoral thesis, City University London)

Abstract

This report addresses two different research problems: (i) It presents a wireless channel model that reduces the complexity associated with high order Markov chains; and (ii) presents energy efficient topology control protocols which provide reliability while maintaining the topology in an energy efficient manner. For the above problems, real wireless sensor network traces were collected and extensive simulations were performed for evaluating the proposed protocols.

Accurate simulation and analysis of wireless networks are inherently dependent on accurate models which are able to provide real-time channel characterization. High-order Markov chains are typically used to model errors and losses over wireless channels. However, complexity (i.e., the number of states) of a high-order Markov model increases exponentially with the memory-length of the underlying channel.

In this report, a novel graph-theoretic methodology that uses Hamiltonian circuits to reduce the complexity of a high-order Markov model to a desired state budget is presented. The implication of unused states in complexity reduction of higher order Markov model is also explained. The trace-driven performance evaluations for real wireless local area network (WLAN) and wireless sensor network (WSN) channels demonstrate that the proposed Hamiltonian Model, while providing orders of magnitude reduction in complexity, renders an accuracy that is comparable to the Markov model and better than the existing reduced state models.

Furthermore, a methodology to preserve energy is presented to increase the network lifetime by reducing the node degree forming an active backbone while considering network connectivity. However, in energy stringent wireless sensor networks, it is of utmost importance to construct the reduced topology with the minimal control overhead. Moreover, most wireless links in practice are lossy links with connectivity probability which desires that a routing protocol provides routing flexibility and reliability at a minimum energy consumption cost. For this purpose, distributed and semi-distributed novel graph-theoretic topology construction protocols are presented that exploit cliques and polygons in a WSN to achieve energy efficiency and reliability. The proposed protocols also facilitate load rotation under topology maintenance, thereby extending the network lifetime. In addition to the above, the report also evaluates why the backbone construction using connected dominating set (CDS) in certain cases remains unable to provide connected sensing coverage in the area covered. For this purpose, a novel protocol that reduces the topology while considering sensing area coverage is presented.

Publication Type: Thesis (Doctoral)
Additional Information: © 2011 Hassaan Khaliq Qureshi
Subjects: T Technology > TA Engineering (General). Civil engineering (General)
Departments: Doctoral Theses
School of Science & Technology > Engineering
School of Science & Technology > School of Science & Technology Doctoral Theses
[thumbnail of Qureshi,_Hassaan_Khaliq.pdf]
Preview
PDF
Download (2MB) | Preview

Export

Add to AnyAdd to TwitterAdd to FacebookAdd to LinkedinAdd to PinterestAdd to Email

Downloads

Downloads per month over past year

View more statistics

Actions (login required)

Admin Login Admin Login