Dueto the limited communication range of WSN, the
sensor is unable to establish direct connection to the data collection station,
therefore the collaborative work of nodes is highly necessary. The data routing
is one of the most fundamental processes exploring how to transmit data from
the sensing field to the data collection station via the least possible number
of intermediate nodes.This
paper addresses the problem of data routing based on the sensors grouping; it
provides a deep insight on how to divide the sensors of a network into separate
independent groups, and how to organize these independent groups in order to
make them work collaboratively and accomplish the process of data routing
within the network.
E. Zanaj, M. Baldi and F. Chiaraluce, “Efficiency of the Gossip Algorithm for Wireless Sensor Networks,” In Proceedings of the 15th International Conference on Software, Telecommunications and Computer Networks (SoftCOM), Split-Dubrovnik, September 2007.
J. C. Martinez, J. Flich, A. Robels, P. Lopez and J. Duato, “Supporting Adaptive Routing in infiniband Networks,” Proceedings of the 11th Eromicro Conference on Parallel, Distributed and Network-Based Processing (Euro-pdp03) 2003.
S. C.-H. Huang, S. Y. Chang, H.-C. Wu and P.-J. Wan, “Analysis and Design of Novel Randomized Broadcast Algorithm for Scalable Wireless Networks in the Interference Channels,” IEEE Transactions on Wireless Communications, Vol. 9, No. 7, 2010, pp. 2206-2215.