Rate Dynamics and Transmission Algorithms in Clustered Sensor Networks

Authors

  • A.T. Burrell Dept. of Computer Science, Oklahoma State University,USA
  • P. Papantoni-Kazakos Dept. of Computer Science, Oklahoma State University,USA

DOI:

https://doi.org/10.14738/tnc.25.482

Keywords:

Clustered Sensor Networks, dynamic data rates, limited sensor life span, limited sensing random access transmission algorithms, priority data, dynamic cluster reconfiguration.

Abstract

     We consider wireless clustered sensor networks consisting of large numbers of life-limited sensors, where the size of each cluster is determined by the data rate generated by the sensors it contains. The limited sensors’ life-span and their possible mobility induce variations in the sensor population and data rate dynamics.  The variations of the sensors’ population necessitate the deployment of random access data transmission algorithms, where stable such algorithms lie within the limited sensing class.  We propose the deployment of the Limited Sensing Stack Random Access Algorithms (LSSRAAs), with a modification which allows the accommodation of high priority data.  We evaluate the performance of the LSSRAAs in the presence of sensor expirations and recommend design specifications for systems with low versus relatively high energy reserves. 

References

D. Blough and S. Paolo, “Investigating Upper Bounds on Network Life-Time Extension for Cell-Based Energy Conservation Techniques in Stationary Ad Hoc Networks”, in Proc. ACM MobiCom, Atlanta, GA, Sep. 23-28, 2002, pp. 183-192.

M. Bhardwaj and A.P. Chandrakasan, “Bounding the Lifetime of Sensor Networks via Optimal Role Assignments”, in Proc. IEEE INFOCOM, New York, Jun. 23-27, 2002, pp. 1587-1596.

J.H. Chang and L. Tassiulas, “Energy Conserving Routing in Wireless Ad Hoc Networks”, in Proceedings of IEEE INFOCOM, Tel Aviv, Israel, Mar. 26-30, 2000, pp. 22-31.

Y. T. Hou, Y. Shi and H.D. Sherali, “On Node Lifetime Problem for Energy-Constrained Wireless Sensor Networks”, ACM/Springer Mobile Netw.Applicat., vol. 10, no. 6, pp. 865-878, Dec. 2005.

Y.T. Hou, Y. Shi, J.H. Reed and K. Sohraby, “Flow Routing for Variable Bit Rate Source Nodes in Energy-Constrained Wireless Sensor Networks”, in Proc. IEEE International Conference on Communications, Seoul Korea, May 16-20, 2005, pp. 3057-3062.

V. Rodoplu and T.H. Meng, “Minimum Energy Mobile Wireless Networks”, IEEE J. Sel. Areas Commun., vol. 17, no. 8, Aug. 1999, pp. 1333-1344.

K. Sohrabi, J. Gao, V. Ailawadhi and G. Pottie, “Protocols for Self-Organizing of a Wireless Sensor Netrwork”, IEEE Pers. Communications Magazine, vol. 7, Oct. 2000, pp. 16-27.

V. Srinivasan, P. Nuggehalli, C.F. Chiasserini and R. Rao, “Cooperation in Wireless Ad Hoc Networks”, in Proc. IEEE INFOCOM, San Francisco, CA, Mar. 30-Apr. 3 2003, pp. 808-817.

R. Wattenhofer, L. Li, P. Bahl and Y.M. Wang, “Distributed Topology Control for Power Efficient Operation in Multihop Wireless Ad Hoc Networks”, in Proc. IEEE INFOCOM, Snchorage, AK, Apr. 22-26, 2001, pp. 1388-1397.

A. T. Burrell and P. Papantoni Kazakos, “Performance Monitoring in Sensor Networks”. ITNG 2009, April 27-29, 2009, Las Vegas, Nevada.

Y. T. Hou, Y. Shi and H.D. Sherali, “Rate Allocation and Network Lifetime Problems for Wireless Sensor Networks”, IEEE Trans. Networking, vol. 16, no. 2, April 2008, pp. 321-334.

D. Bertsekas and R. Gallager, Data Networks, Englewood Cliffs, NJ, Prentice Hall, 1992.

H. Luss and D.R. Smith, “Resource Allocation among Competing Activities: A Lexicigraphic Minimax Approach”. Operations Research Letters, vol. 5, no. 5, Nov. 1986, pp. 227-231.

P. Papantoni Kazakos and A.T. Burrell “The Implementation of Dynamic Rate Allocation in Sensor Networks” Journal of Intelligent and Robotic Systems, 2010, Vol. 58, pp. 211-238.

A. T. Burrell and P. Papantoni-Kazakos, “Extended Sequential Algorithms for Detecting Changes in Acting Stochastic Processes”, IEEE Trans. System, Man and Cybernetics, Vol. 28, no. 5, Sept. 1998, pp. 703-710.

A. T. Burrell, D. Makrakis, and P. Papantoni-Kazakos, "Traffic Monitoring for Capacity Allocation of Multimedia Traffic in ATM Broadband Networks", Telecommunication Systems, Vol. 9, July 1998, pp. 173-206.

A.T. Burrell and P. Papantoni-Kazakos, "On-Line Learning and Dynamic Capacity Allocation in the Traffic Management of Integrated Services Networks”, European Transactions on Telecommunications, Special Issue on Architectures, Protocols, and Quality of Service for the Internet of the Future, Vol. 10, No. 5, March/April 1999, pp. 202-214.

Fatma Salem, A.T. Burrell and P. Papantoni-Kazakos, “Dynamic Architectural Reconfigurations of Sensor Networks”, IEEE IECON’2010, Glendale AZ, Nov. 7-10, 2010.

.Fatma Salem, A.T. Burrell and P. Papantoni-Kazakos, “Dynamic Architecture- Reconfiguration Algorithms and Transmission Protocols for Clustered Sensor Network Topologies with Prioritized Data," International Scholarly Research Network (ISRN) Sensor Networks, 2012, Article ID 452981, 17 pages, doi: 10.5402/2012/452981.

S. Bandyopadhyay and E.J. Coyle, “An Energy Efficient Hierarchical Clustering Algorithm for Wireless Sensor Networks”, IEEE INFOCOM 2003.

D. Kazakos and P. Papantoni-Kazakos, Detection and Estimation, Computer Science Press, New York, NY, 1990.

A. Papoulis and S.U. Pillai, Random Variables and Stochastic Processes, 4th Edition, McGraw-Hill, New York, NY, 2002.

A.T.Burrell and T. Papantoni, “A Class of Limited Sensing Random Access Algorithms with Resistance to Feedback Errors and Effective Delay Control”, Journal of Communications and Networks, 2006, Vol. 8, No. 1.

P. Papantoni-Kazakos, “Multiple Access Algorithms for a System with Mixed Traffic: High and Low Priority,” IEEE Trans. Comm., March 1992, Vol. 40, pp. 541 555.

P. Papantoni-Kazakos, H. Delic, M. Paterakis, and M. Liu, “Transmission Algorithms for a Multi-Channel Packet Radio System with Priority Users,” International Journal of Digital and Analog Communication Systems (IJDACS) John Wiley & Sons, October December 1993, Vol. 6, No. 4, pp. 193 212.

M. Paterakis and P. Papantoni-Kazakos, “A Simple Window Random Access Algorithm with Advantageous Properties,” IEEE Trans. Inform. Th., September 1989, Vol. 35, pp. 1124 1130.

I. F. Akyildiz, W.Su, Y. Sankkarasubramaniam and E Cayirci, “Wireless Sensor Networks: A Survey”, Computer Networks (Elsevier), vol. 38, no. 4, pp. 393-422, 2002.

A. T. Burrell and P. Papantoni-Kazakos, “Wireless Networks in Hybrid Topologies: Signaling, Transmission, and Dynamic Capacity Allocation Viewed in an Integrated Fashion,” ITC Mini-Seminar Performance Modeling and Design of Wireless/PCS Networks, Cambridge, MA, October 3, 1996.

A.T. Burrell and P. Papantoni-Kazakos, “Random Access Algorithms in Packet Networks-A Review of Three Research Decades”, International Journal of Communications Network and System Sciences (IJCNS), October 2012, Vol. 5, No. 10..

S. P. Meyn and R.L. Tweedie, Markov Chains and Stochastic Stability, Springer-Verlag, 1993.

M. Kaplan, “A Sufficient Condition for Nonergodicity of a Markov Chain”, IEEE Transactions on Information Theory, vol. 25, 1979, pp. 470-471.

Downloads

Published

2014-11-03

How to Cite

Burrell, A., & Papantoni-Kazakos, P. (2014). Rate Dynamics and Transmission Algorithms in Clustered Sensor Networks. Transactions on Networks and Communications, 2(5), 45–59. https://doi.org/10.14738/tnc.25.482