TITLE

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

AUTHOR(S)
Frank Yeong-Sung Lin; Chiu-Han Hsiao; Leo Shih-Chang Lin; Yean-Fu Wen
PUB. DATE
March 2013
SOURCE
Sensors (14248220);Mar2013, Vol. 13 Issue 3, p3588
SOURCE TYPE
Academic Journal
DOC. TYPE
Article
ABSTRACT
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.
ACCESSION #
86666338

 

Related Articles

  • Performance Comparison of LEACH and LEACH-N Protocols BY MATLAB. Parashar, Sunita; Sharma, Poonam // International Journal of Advanced Research in Computer Science;Jul/Aug2012, Vol. 3 Issue 4, p216 

    In recent years, there has been a growing interest in wireless sensor networks. In Wireless Sensor Networks sensor nodes life time is the most critical parameter. Minimizing energy dissipation and maximizing network lifetime are important issues in the design of applications and protocols for...

  • Energy Balance Based Lifetime Maximization in Wireless Sensor Networks Employing Joint Routing and Asynchronous Duty Cycle Scheduling Techniques. Kariman-Khorasani, Mohsen; Pourmina, Mohammad; Salahi, Ahmad // Wireless Personal Communications;Jul2015, Vol. 83 Issue 2, p1057 

    This paper introduces a novel energy balance based lifetime maximization issue in wireless sensor networks employing joint routing and asynchronous duty cycle scheduling techniques titled as EB-JRADCS problem. To formulate the EB-JRADCS problem a new asynchronous MAC protocol utilizing flooding...

  • Quality of Service (QoS) Provisions in Wireless Sensor Networks and Related Challenges. Bhaskar Bhuyan; Sarma, Hiren Kumar Deva; Sarma, Nityananda; Kar, Avijit; Mall, Rajib // Wireless Sensor Network;Nov2010, Vol. 2 Issue 11, p861 

    Wireless sensor networks (WSNs) are required to provide different levels of Quality of Services (QoS) based on the type of applications. Providing QoS support in wireless sensor networks is an emerging area of research. Due to resource constraints like processing power, memory, bandwidth and...

  • PUAR: Performance and Usage Aware Routing Algorithm for Long and Linear Wireless Sensor Networks. Bin He; Gang Li // International Journal of Distributed Sensor Networks;2014, p1 

    Aiming at requirements of performance and usage in the monitoring of tunnels with the long and linear structure, this work demonstrates a low-energy and quality of service- (QoS-) supported uneven clustering routing algorithm based on the labor cost called PUAR. PUAR realizes uneven clusters by...

  • A Lifetime-Guaranteed Routing Scheme in Wireless Sensor Networks. Jae Keun Park; Sung Je Hong; Kyong Hoon Kim; Tae Heum Kang; Wan Yeon Lee // World Academy of Science, Engineering & Technology;May2010, Issue 41, p1028 

    No abstract available.

  • A NOVEL RANGE-FREE LOCALIZATION SCHEME FOR WIRELESS SENSOR NETWORKS. Chi-Chang Chen; Yan-Nong Li; Chi-Yu Chang // International Journal on Applications of Graph Theory in Wireles;Sep2012, Vol. 4 Issue 2/3, p1 

    This paper present a low-cost yet effective localization scheme for the wireless sensor networks. There are many studies in the literature of locating the sensors in the wireless sensor networks. Most of them require either installing extra hardware or having a certain amount of sensor nodes...

  • A Survey on Connected Dominating Set Construction Algorithm for Wireless Sensor Networks. Zhuo Liu; Bingwen Wang; Lejiang Guo // Information Technology Journal;2010, Vol. 9 Issue 6, p1081 

    No abstract available.

  • An Implementation in AODV based on Active Route Timeout between sensor nodes in Wireless Sensor Networks. Kachhoria, Renu; Sharma, Sanjeev // International Journal on Computer Science & Engineering;2011, Vol. 3 Issue 3, p1245 

    Wireless Sensor Network is a technological development of small, low cost, low power devices that combine data processing with multiple sensing and the ability to communicate wirelessly. Routing in sensor network is a point of concern for researchers. Many researchers has been proposed various...

  • A Credit based Security Scheme (CBSS) for Multihop Routing in Wireless Sensor Networks. Cherian, Mary; A. S., Anvitha // International Journal of Computer Applications;Jun2013, Vol. 72 Issue 1-23, p34 

    In most of the scenarios, communication in Wireless Sensor Network (WSN) takes place via multihop routing. Multihop routing does not provide much protection against identity deception, developed through the replay of routing information. This defect can be exploited by an opponent to launch...

Share

Read the Article

Courtesy of THE LIBRARY OF VIRGINIA

Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics