Reliable and Energy-efficient Multi-hop Wireless Networks PDF Download

Author: Arnab Das
Publisher:
ISBN:
Category :
Languages : en
Pages :

Get Book Here

Book Description
In this thesis, we study multi-hop versions of two classes of wireless networks: (a) Mobile Ad HocNetworks (MANETs) and (b) Wireless Mesh Networks (WMNs). Our primary focus is to developreliable structures for MANETs and energy-efficient implementations for WMNs.We study a MANET setting where each node in the MANET engages in deliberate and discreetpacket-dropping at a certain rate, while relaying on behalf of other nodes. Assuming the nodesto be non-cooperative, we develop a scheme in which each source node would blame its nearestneighbor for any packet dropped along the multi-hop path vector. This is simple, but elegant, asit still reveals the true relative dropping rates of each packet-dropping node in the MANET.We then propose a novel scheme for improving the overall performance or robustness of such aMANET by adopting a routing strategy which considers the recent packet-dropping performance(reputation) of intermediate relaying nodes in determining the best route from a source to a destination.For deciding the best route, we propose the use of mechanisms based on the modification of theAd Hoc On-Demand Distance Vector (AODV) routing protocol. As opposed to the AODV scheme,which uses a broadcast mechanism for route discovery, the proposed scheme (called Robust AODVor RAODV) considers the reputation levels of neighboring nodes to determine the node(s) to whichthe route discovery packet should be sent.In connection with WMNs, we study a WMN structure deployed for residential broadband Internet access and WMN applications for Wireless Sensor Networks (WSNs).Our WMN model deployed for residential broadband Internet access has a specific topology ofthree tiers comprising WMN infrastructure nodes or Mesh Access Points (MAPs), fixed, in-rangeend-users or end-user Stations (STAs), and potentially mobile, out-of-range end-users or Mobile-STAs (M-STAs). Our interest is only at the edge as our primary focus is the range extension of the WMN to M-STAs via the relaying services of STAs. We develop an iterative game model in whichthe relaying STAs engage in deliberate packet-dropping of M-STA packets for their own throughputgain.We next extend the model to include the scenario in which the MAP and the STAs are networkservice providers in respectively a primary and a secondary market. The STAs do not engage indeliberate packet-dropping, since they are now wholly responsible for providing traffic to the M-STAs, and as a result will lose revenue. Obviously, the second model is better for mobile end-users(M-STAs) as they receive better service since STAs do not drop packets in this scenario for theirown selfish reasons.We then investigate WMNs used in Advanced Metering Infrastructure (AMI), which is a formof WSN. These WMNs usually consist of a collection of Neighborhood Area Networks (NANs),which include smart, wireless-enabled meters or sensor nodes.We present an elegant approach to reducing the cost of the AMIs by increasing the ratio of thenumber of sensors/meters in Neighborhood Area Networks (NANs) to the number of Access Points(APs) or gateways.Finally, we propose schemes for energy conservation in Industrial Wireless Sensor Networks(IWSNs), which are variants of WMNs. Our contribution integrates new approaches to partitioning an IWSN into energy-efficient clusters with a graph-theoretical framework for energy-efficient routing within a cluster. The concept of betweenness centrality is demonstrated to be a useful metric to optimize the placement of the cluster head within an IWSN cluster in our clustering approach.In addition, our strategy combines a novel scheme for duty cycling of the nodes in a cluster tofurther minimize energy expenditure in an IWSN. Betweenness centrality is also used as a metricfor developing a duty-cycling approach to further minimize the energy consumption in an IWSN.Most of the previous contributions have dealt with only one particular approach to minimizingenergy consumption in an IWSN. The emphasis in some of them has been on efficient partitioningof the IWSN into clusters, while others have dealt with energy-efficient routing or effective approachto duty cycling of sensor nodes.In contrast, this contribution integrates a new graph-theoretical framework for partitioning anIWSN into energy-efficient clusters, a minimum-cost (i.e., energy-efficient) routing scheme withina cluster, and a novel duty-cycling scheme to further minimize the cluster's energy consumption.