2006 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology Workshops 2006
DOI: 10.1109/wi-iatw.2006.42
|View full text |Cite
|
Sign up to set email alerts
|

An Intelligent Multi-hop Routing for Wireless Sensor Networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
11
0

Year Published

2007
2007
2015
2015

Publication Types

Select...
3
3
2

Relationship

0
8

Authors

Journals

citations
Cited by 16 publications
(11 citation statements)
references
References 4 publications
0
11
0
Order By: Relevance
“…3) Evolutionary Algorithms: A GA based multi-hop routing technique named GA-Routing is proposed in [91] for maximizing network longevity in terms of time to first node death. The challenge here is to come up with a routing algorithm that maximizes the number of rounds before the first node dies.…”
Section: Securitymentioning
confidence: 99%
“…3) Evolutionary Algorithms: A GA based multi-hop routing technique named GA-Routing is proposed in [91] for maximizing network longevity in terms of time to first node death. The challenge here is to come up with a routing algorithm that maximizes the number of rounds before the first node dies.…”
Section: Securitymentioning
confidence: 99%
“…An important consideration with distributed approaches is that nodes require sufficient computational power and storage to collect and store information regarding local connectivity and compute the best routes based on available information. In comparison, centralised approaches, which mostly incorporate variants of heuristic algorithms (Chang and Tassiulas, 2004;Xue et al, 2006;Islam and Hussain, 2006;Yetgin et al, 2012) require lower computational power and storage at the nodes, as most of the computation and storage is conducted 2 Evolutionary Computation Volume x, Number x by the central base station. Nonetheless, there is a system-wide overhead incurred in gathering connectivity information and broadcasting routing information.…”
Section: Introductionmentioning
confidence: 99%
“…We therefore seek to optimise the lifetime of network nodes by modelling the charge held in their batteries and the energy expenditure at each node. Islam and Hussain (2006) and Kamath and Nasipuri (2011) have considered maximising only the minimum remaining lifetime among nodes. Such approaches can improve the individual node specific energy state, but can be sub-optimal from system-wide perspective.…”
Section: Introductionmentioning
confidence: 99%
“…Distributed approaches, in which responsibility for routing is distributed across the constituent nodes, involve techniques like reinforcement learning [7] and swarm intelligence [1], etc. On the other hand centralised systems, in which a centrally calculated route is broadcast to participating nodes, mostly incorporate variants of evolutionary algorithms (EAs) [11,13,8]. In the distributed approach, nodes need to have sufficient computational power to decide on the best path for sending data and sufficient storage for storing information about local connectivity.…”
Section: Introductionmentioning
confidence: 99%
“…We therefore seek to optimise the lifetime of network nodes by modelling the charge held in their batteries and the energy expenditure at each node. Islam et al [8], and Kamath et al [9] have considered maximising only the minimum remaining lifetime among nodes. Such approaches can improve individual node specific energy state, but can be sub-optimal from system-wide perspective.…”
Section: Introductionmentioning
confidence: 99%