Utilizing Joint Routing and Capacity Assignment Algorithms to Achieve Inter- and Intra-Group Delay Fairness in Multi-Rate Multicast Wireless Sensor Networks

Recent advance in wireless sensor network (WSN) applications such as the Internet of Things (IoT) have attracted a lot of attention. Sensor nodes have to monitor and cooperatively pass their data, such as temperature, sound, pressure, etc. through the network under constrained physical or environmental conditions. The Quality of Service (QoS) is very sensitive to network delays. When resources are constrained and when the number of receivers increases rapidly, how the sensor network can provide good QoS (measured as end-to-end delay) becomes a very critical problem. In this paper; a solution to the wireless sensor network multicasting problem is proposed in which a mathematical model that provides services to accommodate delay fairness for each subscriber is constructed. Granting equal consideration to both network link capacity assignment and routing strategies for each multicast group guarantees the intra-group and inter-group delay fairness of end-to-end delay. Minimizing delay and achieving fairness is ultimately achieved through the Lagrangean Relaxation method and Subgradient Optimization Technique. Test results indicate that the new system runs with greater effectiveness and efficiency.

[1]  Ronald L. Graham,et al.  On the History of the Minimum Spanning Tree Problem , 1985, Annals of the History of Computing.

[2]  Klara Nahrstedt,et al.  A QoS-aware multicast routing protocol , 2000, IEEE Journal on Selected Areas in Communications.

[3]  Dimitri P. Bertsekas,et al.  Data Networks , 1986 .

[4]  Klara Nahrstedt,et al.  An overview of quality of service routing for next-generation high-speed networks: problems and solutions , 1998, IEEE Netw..

[5]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[6]  Marshall L. Fisher,et al.  An Applications Oriented Guide to Lagrangian Relaxation , 1985 .

[7]  Panos M. Pardalos,et al.  A survey of combinatorial optimization problems in multicast routing , 2005, Comput. Oper. Res..

[8]  Aaron Striegel,et al.  A survey of QoS multicasting issues , 2002 .

[9]  Christophe Diot,et al.  Deployment issues for the IP multicast service and architecture , 2000, IEEE Netw..

[10]  Dimitri P. Bertsekas,et al.  Data networks (2nd ed.) , 1992 .

[11]  Frank Kelly,et al.  Rate control for communication networks: shadow prices, proportional fairness and stability , 1998, J. Oper. Res. Soc..

[12]  Richard M. Karp,et al.  The Traveling-Salesman Problem and Minimum Spanning Trees , 1970, Oper. Res..

[13]  Kwang-Ting Cheng,et al.  Minimax end-to-end delay routing and capacity assignment for virtual circuit networks , 1995, Proceedings of GLOBECOM '95.

[14]  Daniel Minoli,et al.  IP Multicast with Applications to IPTV and Mobile DVB-H: Minoli/IP Multicast , 2008 .

[15]  A. M. Geoffrion Lagrangean Relaxation and Its Uses in Integer Programming , 1972 .

[16]  Seth Pettie,et al.  An optimal minimum spanning tree algorithm , 2000, JACM.

[17]  Soung Chang Liew,et al.  Proportional fairness in wireless LANs and ad hoc networks , 2005, IEEE Wireless Communications and Networking Conference, 2005.

[18]  Douglas S. Reeves,et al.  The delay-constrained minimum spanning tree problem , 1997, Proceedings Second IEEE Symposium on Computer and Communications.

[19]  Laurent Massoulié,et al.  A queueing analysis of max-min fairness, proportional fairness and balanced fairness , 2006, Queueing Syst. Theory Appl..

[20]  Terence D. Todd,et al.  Multi-constraint QoS routing using a new single mixed metric , 2004, ICC.

[21]  Khalil S. Hindi,et al.  Minimum-weight spanning tree algorithms A survey and empirical study , 2001, Comput. Oper. Res..