Reactive routing overhead in networks with unreliable nodes

Mobility in mobile sensor networks causes frequent route breaks, and each routing scheme reacts differently during route breaks. It results in a performance degradation of the energy consumption to reestablish the route. Since routing schemes have various operational characteristics for rerouting, the impact of mobility on routing energy consumption shows significantly different results under varying network dynamics. Therefore, we should consider the mobility impact when analyzing the routing energy consumption in mobile sensor networks. However, most analysis of the routing energy consumption concentrates on the traffic condition and often neglects the mobility impact. We analyze the mobility impact on the routing energy consumption by deriving the expected energy consumption of reactive, proactive, and flooding scheme as a function of both the packet arrival rate and topology change rate. Routing energy consumption for mobile sensor networks is analytically shown to have a strong relationship with sensor mobility and traffic conditions. We then demonstrate the accuracy of our analysis through simulations. Our analysis can be used to decide a routing scheme that will operate most energy efficiently for a sensor application, taking into account the mobility as well as traffic condition.

show abstract

“…Several studies on analytical approaches have been proposed for routing schemes [10][11][12][13][14][15].…”

Section: Related Workmentioning

confidence: 99%

“…Zhou et al [12] proposed a mathematical and simulative framework for quantifying an overhead of reactive scheme. They presented a simplified model of OLSR and AODV protocols and studied the scalability of the reactive scheme.…”

Section: Related Workmentioning

confidence: 99%

Impact of Mobility on Routing Energy Consumption in Mobile Sensor Networks

Jung

Cho

Hong

2012

International Journal of Distributed Sensor Networks

View full text Add to dashboard Cite

show abstract

“…The derivations of the above four expressions are included in [4]. There are two levels of hierarchy; level-0 which refers to the flat network topology (i.e.…”

Section: Discussionmentioning

confidence: 99%

“…Thus, compared with the scalability results of flat routing protocols in [4], the introduction of 1-level hierarchy does not change the traffic condition required for infinite networks scalability. However, the overhead of route discovery decreases by a factor of O(1/M ) of flat routing protocols overhead [4]. The average number of RERR packets is bounded for an infinite grid if k > 3 and is independent of the cluster size.…”

Section: Scalability Of the Hierarchical Gridmentioning

confidence: 93%

See 1 more Smart Citation

Cluster-based routing overhead in networks with unreliable nodes

Abouzeid

2004 IEEE Wireless Communications and Networking Conference (IEEE Cat. No.04TH8733)

View full text Add to dashboard Cite

Abstract-While several cluster based routing algorithms have been proposed for ad hoc networks, there is a lack of formal mathematical analysis of these algorithms. Specifically, there is no published investigation of the relation between routing overhead on one hand and route request pattern (traffic) on the other. This paper provides a mathematical framework for quantifying the overhead of a cluster-based routing protocol. We explicitly model the application-level traffic in terms of the statistical description of the number of hops between a source and a destination. I. INTRODUCTION Ad hoc networks are comprised of nodes that perform multi hop packet forwarding over wireless links. The routing protocols for ad hoc networks can be divided into two categories based on when and how the routes are discovered: proactive and reactive. In proactive routing protocols, consistent and up-to-date routing information to all nodes is maintained at each node, whereas in reactive routing the routes are created only when needed. In this paper, we focus on reactive routing protocols.To support large scale ad hoc networks, numerous clusterbased routing algorithms have been proposed [1], [2]. In cluster-based routing, the network is dynamically organized into partitions called clusters with the objective of maintaining a relatively stable effective topology. The membership in each cluster changes over time in response to node mobility, node failure or new node arrival. Clustering techniques are expected to achieve better scalability since most of the topology changes within a cluster are hidden from the rest of the network. However, clustering incurs a cluster maintenance overhead, which is the amount of control packets needed to maintain the cluster membership information.In hierarchical routing protocols, intra-cluster (inter-cluster) routing refers to the routing algorithm used to find a route between a source and destination within the same (belonging to different) clusters. Typically, inter-cluster routing is reactive while intra-cluster routing is proactive.In this paper, we develop an analytical model that captures the essential characteristics of cluster-based routing

show abstract

Proactive or Reactive Routing: A Unified Analytical Framework in MANETs

Sadjadpour

et al. 2008

2008 Proceedings of 17th International Conference on Computer Communications and Networks

View full text Add to dashboard Cite

Abstract-We present a mathematical framework for the performance evaluation of proactive and reactive routing protocols operating in mobile ad hoc networks (MANETs). The model captures the functionality of the routing protocols together with the characterization of the performance of the medium access control protocol (MAC). It reveals the interplay between the protocol functionality and network parameters, and provides new insight on the relative benefits of proactive and on-demand routing in MANETS. The analytical results are corroborated with results obtained using discrete-event simulations.

show abstract

Reactive routing overhead in networks with unreliable nodes

Cited by 6 publications

References 0 publications

Impact of Mobility on Routing Energy Consumption in Mobile Sensor Networks

Impact of Mobility on Routing Energy Consumption in Mobile Sensor Networks

Cluster-based routing overhead in networks with unreliable nodes

Proactive or Reactive Routing: A Unified Analytical Framework in MANETs

Contact Info

Product

Resources

About