Efficient flooding method using discrete particle swarm optimization forlong-term operation of sensor networks

ICIC Express Letters

Volumn 3, Issue 3, 2009, Pages 833-840

  Nagashima, Junya ^a   Utani, Akihide ^a   Yamamoto, Hisao ^a  

^a TOKYO CITY UNIVERSITY   (Japan)

Author keywords

Efficient flooding; Particle swarm optimization; Query dissemination; Savingenergy consumption; Selecting forwarding nodes; Wireless sensor networks

Indexed keywords

DISCRETE PARTICLE SWARM OPTIMIZATION; FORWARDING NODES; NETWORK LIFETIME; QUERY DISSEMINATION; SIMULATION EXPERIMENTS;

PARTICLE SWARM OPTIMIZATION (PSO); SENSOR NETWORKS; SENSOR NODES; TELECOMMUNICATION EQUIPMENT;

WIRELESS SENSOR NETWORKS;

EID: 77953893210     PISSN: 1881803X     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (11)

1. I. Akyildiz, W. Su, Y. Sankarasubramaniam and E. Cayirci, Wireless sensornetworks: A survey, Computer Networks Journal, Vol. 38, No. 4, pp. 393-422,2002.
2. M. J. Lin, K. Marzullo and S. Masini, Gossip versus deterministicflooding: Low message overhead and high reliability for broadcasting on smallnetworks, DISC, pp. 253-267, 2000.
3. C. Adjih, P. Jacquet and L. Viennot, Computing connected dominated setswith multipoint relays, Technical Report 4597, INRIA, pp. 1-16, 2002.
4. J. Nagashima, A. Utani and H. Yamamoto, A study on efficient flooding inwireless sensor networks, IEICE Technical Report, Vol. 108, No. 443, pp. 49-52,2009.
5. J. Kennedy, and R. C. Eberhart, Particle swarm optimization, Proc. of theIEEE Int. Conf. on Neural Networks, pp. 1942-1948, 1995.
6. R. C. Eberhart and Y. Shi, Tracking and optimizing dynamic systems withparticle swarms, Proc. of the 2001 IEEE Congr. Evolutionary Computation, pp.94-100, 2001.
7. M. Clerc, and J. Kennedy, The particle swarm-explosion, stability, andconvergence in a multidimensional complex space, IEEE Trans. Evol. Comput., Vol.6, No. 1, pp. 58-73, 2002.
8. M. Shen, and Y. Tsai, CPW-fed monopole antenna characterized by usingparticle swarm optimization incorporating decomposed objective functions, Int.J. Innovative Computing, Information and Control, Vol. 4, No. 8, pp. 1897-1919,2008.
9. Q. Zhang, R. Zhang and B. Wang, DNA sequence sets design by particleswarm optimization algorithm, Int. J. Innovative Computing, Information andControl, Vol. 5, No. 8, pp. 2249-2255, 2009.
10. A. Kumamoto, A. Utani and H. Yamamoto, Advanced particle swarmoptimization for computing plural acceptable solutions, Int. J. InnovativeComputing, Information and Control, Vol. 5, No. 12, (to appear), 2009.
11. J. Kennedy, and R. C. Eberhart, A discrete binary version of the particleswarm algorithm, Proc. of the IEEE Int. Conf. on Systems, Man &Cybernetics, pp. 4104-4108, 1997.