2007
DOI: 10.1007/978-3-540-72606-7_13
|View full text |Cite
|
Sign up to set email alerts
|

Integrated Clustering and Routing Strategies for Large Scale Sensor Networks

Abstract: Abstract. In two-tiered sensor networks using relay nodes, sensor nodes are arranged in clusters and the higher-powered relay nodes can be used as cluster heads. The lifetime of the networks is determined primarily by the lifetime of the relay nodes. Clustering techniques and routing schemes play a crucial role in determining the useful network lifetime. Traditionally, the clustering and the routing problems, for these networks, have been considered independently and solved separately. In this paper, we presen… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
5
0

Year Published

2007
2007
2011
2011

Publication Types

Select...
3
3
1

Relationship

2
5

Authors

Journals

citations
Cited by 8 publications
(5 citation statements)
references
References 13 publications
0
5
0
Order By: Relevance
“…In [7], Gupta and Younis have focused on load balanced clustering and have proposed a heuristic solution for the optimization problem. Routing without flow splitting (i.e., single-path routing) has been studied in [9], [11], [13], [14], [24], and [25]. In [9], the authors have presented a transformation algorithm to convert a multiple outgoing flow routing model to a single outgoing flow routing model.…”
Section: Reviewmentioning
confidence: 99%
See 3 more Smart Citations
“…In [7], Gupta and Younis have focused on load balanced clustering and have proposed a heuristic solution for the optimization problem. Routing without flow splitting (i.e., single-path routing) has been studied in [9], [11], [13], [14], [24], and [25]. In [9], the authors have presented a transformation algorithm to convert a multiple outgoing flow routing model to a single outgoing flow routing model.…”
Section: Reviewmentioning
confidence: 99%
“…In [24], the authors propose a formulation for constructing minimum-energy data-aggregation trees, for a flat architecture. In [13], [11] and [14], minimizing the number of relay nodes and finding there locations were not considered.…”
Section: Reviewmentioning
confidence: 99%
See 2 more Smart Citations
“…Therefore, in addition to reducing energy dissipation, a routing scheme also needs to consider how to modify, quickly and efficiently, the routes to avoid the faulty relay node (s). A number of energy-aware routing schemes for two-tiered networks have been proposed in the literature [2], [3], [4], [9], [11], [12], [20], [25], [26]. However, these schemes typically do not consider the possibility of faults in the relay node network, and assume all nodes will be available for routing data.…”
Section: Introductionmentioning
confidence: 99%