Your browser does not support JavaScript!
http://iet.metastore.ingenta.com
1887

Reliable and energy-efficient cooperative routing algorithm for wireless monitoring systems

Reliable and energy-efficient cooperative routing algorithm for wireless monitoring systems

For access to this article, please select a purchase option:

Buy article PDF
£12.50
(plus tax if applicable)
Add to cart
Buy Knowledge Pack
10 articles for £75.00
(plus taxes if applicable)
Add to cart

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Name:*
Email:*
Your details
Name:*
Email:*
Department:*
Why are you recommending this title?
Select reason:
 
 
 
 
 
IET Wireless Sensor Systems — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

© The Institution of Engineering and Technology
Published

The recent increased interest in distributed and flexible wireless pervasive applications has drawn great attention to Wireless Networked Control Systems (WNCS) architectures based on Wireless Sensor and Actuator Networks (WSANs) and the resulting Quality of Service (QoS) obtained in specific applications. In wireless monitoring systems based on WSANs, providing certain QoS specifications in terms of reliability and energy efficiency is crucial for the sensors/actuators as they perform actions based on the data samples/received with a limited amount of energy to spend. To this aim the paper introduces the cooperative-based routing algorithm to guarantee a good performance trade-off between reliability and energy efficiency of the overall wireless monitoring system. Simulations have been carried out in order to quantify the impact of the proposed algorithm on the overall monitoring system reliability and energy efficiency and a comparison is presented with the existing Ad-hoc On-Distance Vector (AODV), the cooperation along the shortest non-cooperative path (CASNCP) and minimum-power cooperative routing (MPCR) algorithms. Finally it is shown the application of the proposed algorithm to healthcare monitoring system pointing out as the cooperation-based routing algorithms are suitable and rewarding for the management of the future generation of monitoring systems.

Inspec keywords: quality of service; cooperative communication; telecommunication network reliability; wireless sensor networks; telecommunication network routing

Other keywords: wireless networked control systems architectures; quality of service; minimum-power cooperative routing algorithms; wireless sensor networks; healthcare monitoring system; cooperation-based routing algorithms; wireless actuator networks; ad-hoc on-distance vector; QoS; wireless monitoring systems; monitoring system reliability; cooperative-based routing algorithm; monitoring systems management

Subjects: Reliability; Wireless sensor networks; Communication network design, planning and routing

References

    1. 1)
    2. 2)
    3. 3)
      • G. Kramer , I. Maric , R.D. Yates . Cooperative communications, foundations and trends in networking.
    4. 4)
      • K. Yazdandoost , K. Sayrafian-Pour . Channel model for mody area network (BAN).
    5. 5)
    6. 6)
      • Gerasimov, I., Simon, R.: `A bandwidth-reservation mechanism for on-demand ad hoc path finding', mt 35th Annual Simulation Symp. (SS’02), p. 20–27.
    7. 7)
      • Report: ‘Industrial Wireless Technology for the 21st Century’. Report, Technology Foresight 2004, TF-2004-1.
    8. 8)
      • Zhu, C., Corson, M.S.: `QoS routing for mobile ad hoc networks', 21stAnnual Joint Conf. IEEE Computer and Communications Societies (INFOCOM’02), June 2002, New York.
    9. 9)
      • Beccetti, L., Korteweg, P., Marchetti-Spaccamela, A., Skutella, M., Stougie, L., Vitaletti, A.: `Latency constrained aggregation in sensor networks', Proc. 14th Annual European Symp. on Algorithms 2006, (LNCS, 4168), p. 88–99.
    10. 10)
    11. 11)
      • O'Donovan, T., O'Donoghue, J., Sreenan, C., O'Reilly, P., Sammon, D., O'Connor, K.: `A context aware wireless body area network (BAN)', Proc. Pervasive Health Conf., 2009.
    12. 12)
    13. 13)
      • K.J.R. Liu , A. Sadek , W. Su , A. Kwasinski . (2008) Cooperative communications and networking.
    14. 14)
    15. 15)
    16. 16)
      • Y.J. Lee , G.F. Riley . (2005) A workload-based adaptive load-balancing technique for mobile ad hoc networks.
    17. 17)
      • Jung, J.W., Choi, D.I., Kwon, K., Chong, I., Lim, K., Kahng, H.K.: `A correlated load aware routing protocol in mobile ad hoc networks', ECUMN 2004, 2004, (LNCS, 3262), p. 227–236.
    18. 18)
    19. 19)
      • TF: ‘Industrial Wireless Technology for the 21st Century.’ Report, Technology Foresight 2004, 2004.
    20. 20)
      • S. Albers , H. Fujiwara . (2007) Energy-efficient algorithms for flow time minimization.
    21. 21)
      • S. Irani , S.K. Shukla , R. Gupta . (2007) Algorithms for power savings.
    22. 22)
      • M. Patel , J. Wang . (2010) Applications, challenges, and prospective in emerging body area networking technologies.
    23. 23)
      • C. Perkins , E. Belding-Royer , S. Das . (2003) Ad hoc on demand distance vector (AODV) routing.
    24. 24)
      • Laneman, J.N., Wornell, G.W., Tse, D.N.C.: `An efficient protocol for realizing cooperative diversity in wireless networks', Proc. IEEE ISIT, 2004, Washington, DC.
    25. 25)
      • Zhang, Y., Gulliver, T.A.: `Quality of service for ad hoc on-demand distance vector routing', IEEE Int. Conf. on Wireless And Mobile Computing (WiMob), 2005, p. 192–196, vol. 3.
    26. 26)
      • Zigbee Alliance. (2009, June 15). Available: www.zigbee.org.
    27. 27)
      • Ambühl, C.: `An optimal bound for the MST algorithm to compute energy efficient broadcast trees in wireless networks', Proc. 32nd Int. Colloquium on Automata, Languages and Programming, 2007, (LNCS, 3580), p. 1139–1150.
    28. 28)
      • Hunter, T.E., Nosratinia, A.: `Cooperative diversity through coding', Proc. IEEE ISIT, 2002, Laussane, Switzerland.
    29. 29)
    30. 30)
      • M. Ohlin , D. Henriksson , A. Anton Cervin . (2007) TrueTime 1.5 reference manual.
    31. 31)
    32. 32)
    33. 33)
    34. 34)
      • Yoo, Y., Ahn, S.: `A simple load balancing approach in secure ad hoc networks', ICOIN 2004, 2004, (LNCS, 3090), p. 44–53.
    35. 35)
      • Gao, T., Greenspan, D., Welsh, M.: `Vital signs monitoring and patient tracking over a wireless network', Proc. 27th Annual Int. Conf. on Engineering in medicine and biology Soc., IEEE Press, 2005, p. 102–105.
    36. 36)
    37. 37)
    38. 38)
    39. 39)
      • Baptiste, P., Chrobak, M., Dürr, C.: `Polynomial time algorithms for minimum energy scheduling', Proc 15th Annual European Symp. on Algorithms, 2007, (LNCS, 4698), p. 136–150.
    40. 40)
    41. 41)
    42. 42)
http://iet.metastore.ingenta.com/content/journals/10.1049/iet-wss.2011.0103
Loading

Related content

content/journals/10.1049/iet-wss.2011.0103
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading
Print this page
This is a required field
Please enter a valid email address