Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
Search
Supervisory routing control for dynamic load balancing in low data rate wireless sensor networks
Kamal A., Hamid M. Wireless Networks23 (4):1085-1099,2017.Type:Article
Date Reviewed: Jun 16 2017

Penetration of wireless sensor networking (WSN) technology in different aspects of human life has made its problems more salient than ever. Routing is one of the important problems in WSN, and different algorithms have been devised to promote its efficiency and performance. In WSN, wherein normally tiny sensors have limited longevity, asymmetric load distribution among the network nodes potentially can endanger the robustness and sustainability of the network. With this aim, the paper provides a routing control framework for dynamic load balancing among the additional referral nodes.

After a good, smooth, and fluent literature review, the paper criticizes routing policies, aiming mostly at the packet delivery rates or lower delay mechanisms, mechanisms that potentially would sacrifice the overloaded nodes, cause early death, and decrease the longevity of the whole network.

In-network path tagging is the key topic of the paper. Leveraging this policy, a server in the sink point receives the information of the load ratio of nodes. Next, an unbalanced routing load detection algorithm is utilized to detect the over/under balanced nodes, and a mitigation algorithm is invoked for any possible parent exchange. The routing load balance algorithm assumes that at the same depth in the collection tree, with direct communication range, there should exist over/under loaded nodes to balance the loads with each other. It would be essential to prove that there certainly exist some such favorite pair nodes; otherwise, the algorithm is useless. It is not comprehensive.

Although the algorithm provides a nice method to increase the robustness of the network, the impact of the method on the performance and efficiency of the network (for instance, the packet delivery rate and delay, which are important criteria in the network) are vague. Empirical analysis of the algorithms via the experiments normally is not as reasonable as the algorithm analysis methodology, which was expected from the paper. The centralized nature of the proposed policies would enforce great overhead for the system as the number of nodes increases; normally in WSNs, distributed, local policies are prescribed to mitigate the issues.

The paper has good and novel ideas, with a nice structure and writing style, but I do not have an optimistic view concerning its applicability in industrial use cases.

Reviewer:  Mohammad Sadegh Kayhani Pirdehi Review #: CR145357 (1708-0541)
Bookmark and Share
  Featured Reviewer  
 
Sensor Networks (C.2.1 ... )
 
Would you recommend this review?
yes
no
Other reviews under "Sensor Networks": Date
Performance analysis of opportunistic broadcast for delay-tolerant wireless sensor networks
Nayebi A., Sarbazi-Azad H., Karlsson G. Journal of Systems and Software 83(8): 1310-1317, 2010. Type: Article
Nov 8 2010
Heartbeat of a nest: using imagers as biological sensors
Ko T., Ahmadian S., Hicks J., Rahimi M., Estrin D., Soatto S., Coe S., Hamilton M. ACM Transactions on Sensor Networks 6(3): 1-31, 2010. Type: Article
Jan 10 2011
Efficient clustering-based data aggregation techniques for wireless sensor networks
Jung W., Lim K., Ko Y., Park S. Wireless Networks 17(5): 1387-1400, 2011. Type: Article
May 8 2012
more...

E-Mail This Printer-Friendly
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy