Mobile agent for efficient routing among source nodes in wireless sensor networks

Elhadi Shakshuki, Xinyu Xing, Haroon Malik

Research output: Chapter in Book/Report/Conference proceedingConference contribution

13 Citations (Scopus)

Abstract

In wireless sensor network, a lot of sensory traffic with redundancy is produced due to massive node density and their diverse placement. This causes the decline of scarce network resources such as bandwidth and energy, thus decreasing the lifetime of sensor network. Recently, mobile agent is proposed as a solution to overcome these problems. Mobile agent accounts for performing data processing and making data aggregation decisions at nodes rather than bring data back to a central processor (sink). Using this approach, redundant sensory data will be eliminated. However, carrying a huge amount of aggregated data among source nodes, using mobile agent, requires immensely planned routing. This is to avoid hastily burning source nodes energy in interest region. Towards this end, we propose a novel approach to achieve optimal routing path for mobile agent. Our proposed approach has two folds. Firstly, Dijkstra's algorithm is used to generate a complete graph to connect all source nodes. Secondly, genetic algorithm is performed on a completed graph to generate best approximated route. To demonstrate the feasibility of our approach, formal analysis and experimental results are presented.

Original languageEnglish (US)
Title of host publication3rd International Conference on Autonomic and Autonomous Systems, ICAS 2007
DOIs
StatePublished - 2007
Event3rd International Conference on Autonomic and Autonomous Systems, ICAS 2007 - Athens, United States
Duration: Jun 19 2007Jun 25 2007

Other

Other3rd International Conference on Autonomic and Autonomous Systems, ICAS 2007
CountryUnited States
CityAthens
Period6/19/076/25/07

Fingerprint

Mobile agents
Wireless sensor networks
Sensor networks
Redundancy
Agglomeration
Genetic algorithms
Bandwidth

All Science Journal Classification (ASJC) codes

  • Computer Science Applications
  • Software
  • Electrical and Electronic Engineering

Cite this

Shakshuki, E., Xing, X., & Malik, H. (2007). Mobile agent for efficient routing among source nodes in wireless sensor networks. In 3rd International Conference on Autonomic and Autonomous Systems, ICAS 2007 [4437916] https://doi.org/10.1109/CONIELECOMP.2007.83
Shakshuki, Elhadi ; Xing, Xinyu ; Malik, Haroon. / Mobile agent for efficient routing among source nodes in wireless sensor networks. 3rd International Conference on Autonomic and Autonomous Systems, ICAS 2007. 2007.
@inproceedings{08344169fe784dafa59daff1cb1e3ee2,
title = "Mobile agent for efficient routing among source nodes in wireless sensor networks",
abstract = "In wireless sensor network, a lot of sensory traffic with redundancy is produced due to massive node density and their diverse placement. This causes the decline of scarce network resources such as bandwidth and energy, thus decreasing the lifetime of sensor network. Recently, mobile agent is proposed as a solution to overcome these problems. Mobile agent accounts for performing data processing and making data aggregation decisions at nodes rather than bring data back to a central processor (sink). Using this approach, redundant sensory data will be eliminated. However, carrying a huge amount of aggregated data among source nodes, using mobile agent, requires immensely planned routing. This is to avoid hastily burning source nodes energy in interest region. Towards this end, we propose a novel approach to achieve optimal routing path for mobile agent. Our proposed approach has two folds. Firstly, Dijkstra's algorithm is used to generate a complete graph to connect all source nodes. Secondly, genetic algorithm is performed on a completed graph to generate best approximated route. To demonstrate the feasibility of our approach, formal analysis and experimental results are presented.",
author = "Elhadi Shakshuki and Xinyu Xing and Haroon Malik",
year = "2007",
doi = "10.1109/CONIELECOMP.2007.83",
language = "English (US)",
isbn = "076952799X",
booktitle = "3rd International Conference on Autonomic and Autonomous Systems, ICAS 2007",

}

Shakshuki, E, Xing, X & Malik, H 2007, Mobile agent for efficient routing among source nodes in wireless sensor networks. in 3rd International Conference on Autonomic and Autonomous Systems, ICAS 2007., 4437916, 3rd International Conference on Autonomic and Autonomous Systems, ICAS 2007, Athens, United States, 6/19/07. https://doi.org/10.1109/CONIELECOMP.2007.83

Mobile agent for efficient routing among source nodes in wireless sensor networks. / Shakshuki, Elhadi; Xing, Xinyu; Malik, Haroon.

3rd International Conference on Autonomic and Autonomous Systems, ICAS 2007. 2007. 4437916.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

T1 - Mobile agent for efficient routing among source nodes in wireless sensor networks

AU - Shakshuki, Elhadi

AU - Xing, Xinyu

AU - Malik, Haroon

PY - 2007

Y1 - 2007

N2 - In wireless sensor network, a lot of sensory traffic with redundancy is produced due to massive node density and their diverse placement. This causes the decline of scarce network resources such as bandwidth and energy, thus decreasing the lifetime of sensor network. Recently, mobile agent is proposed as a solution to overcome these problems. Mobile agent accounts for performing data processing and making data aggregation decisions at nodes rather than bring data back to a central processor (sink). Using this approach, redundant sensory data will be eliminated. However, carrying a huge amount of aggregated data among source nodes, using mobile agent, requires immensely planned routing. This is to avoid hastily burning source nodes energy in interest region. Towards this end, we propose a novel approach to achieve optimal routing path for mobile agent. Our proposed approach has two folds. Firstly, Dijkstra's algorithm is used to generate a complete graph to connect all source nodes. Secondly, genetic algorithm is performed on a completed graph to generate best approximated route. To demonstrate the feasibility of our approach, formal analysis and experimental results are presented.

AB - In wireless sensor network, a lot of sensory traffic with redundancy is produced due to massive node density and their diverse placement. This causes the decline of scarce network resources such as bandwidth and energy, thus decreasing the lifetime of sensor network. Recently, mobile agent is proposed as a solution to overcome these problems. Mobile agent accounts for performing data processing and making data aggregation decisions at nodes rather than bring data back to a central processor (sink). Using this approach, redundant sensory data will be eliminated. However, carrying a huge amount of aggregated data among source nodes, using mobile agent, requires immensely planned routing. This is to avoid hastily burning source nodes energy in interest region. Towards this end, we propose a novel approach to achieve optimal routing path for mobile agent. Our proposed approach has two folds. Firstly, Dijkstra's algorithm is used to generate a complete graph to connect all source nodes. Secondly, genetic algorithm is performed on a completed graph to generate best approximated route. To demonstrate the feasibility of our approach, formal analysis and experimental results are presented.

UR - http://www.scopus.com/inward/record.url?scp=44949201064&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=44949201064&partnerID=8YFLogxK

U2 - 10.1109/CONIELECOMP.2007.83

DO - 10.1109/CONIELECOMP.2007.83

M3 - Conference contribution

AN - SCOPUS:44949201064

SN - 076952799X

SN - 9780769527994

BT - 3rd International Conference on Autonomic and Autonomous Systems, ICAS 2007

ER -

Shakshuki E, Xing X, Malik H. Mobile agent for efficient routing among source nodes in wireless sensor networks. In 3rd International Conference on Autonomic and Autonomous Systems, ICAS 2007. 2007. 4437916 https://doi.org/10.1109/CONIELECOMP.2007.83