Skip to main content
SpringerLink
Log in

Data relaying with constraints in hierarchical sensor networks

  • Published:
Journal of Combinatorial Optimization Aims and scope Submit manuscript

Abstract

In this paper we present and discuss several optimisation problems that arise in the management of data flow in wireless sensor networks (WSNets). We consider a hierarchical architecture for WSNets composed of sensors, relays, and relay gateways. Sensors send data they generate at a known average bit rate to relays in one hop. The relay nodes use a multi-hop mechanism to reach a set of assigned gateways which then forward the data directly to the base station. We are concerned with finding an assignment of relay gateways to relays so that certain constraints are satisfied. We define a unified model in which constraints such as lifetime, data delay, and data flow splitting are formulated in terms of four optimisation problem in graphs.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Akyildiz IF, Su W, Sankarasubramaniam Y, Cayirci E (2002) A survey on sensor networks. IEEE Communications Magazine, 40(8):102–114

    Article  Google Scholar 

  • Banerjee S, Khuller S (2001) A clustering scheme for hierarchical control in multi-hop wireless networks. In Proc. IEEE INFOCOM

  • Basagni S (1999) Distributed clustering algorithm for ad-hoc networks. In: Proc. international symposium on parallel architectures algorithms and Networks (I-SPAN)

  • Benkoczi R, Hassanain H, Akl S, Tai S (2005) Exact algorithms for data relaying in heterogeneous wireless sensor networks, work in progress

  • Benkoczi R (2004) Cardinality constrained facility location problems in trees. PhD thesis, School of Computing Science, Simon Fraser University, Burnaby, BC, Canada

  • Dyck RV, Miller L (2001) Distributed sensor processing over an ad-hoc wireless network: Simulation framework and performance criteria. In: Proc. IEEE Milcom, (McLean, VA)

  • Estrin D, Girod L, Pottie G, Srivastava M (2001) Instrumenting the world with wireless sensor networks. In: Proc. of the International Conference on Acoustics, Speech, and Signal Processing (ICASSP)

  • Gouveia L, Patricio P, de Sousa AF, Valadas R (2003) Mpls over wdm network design with packet level qos constraints based on ilp models. In: Proc. IEEE Infocom

  • Heinzelman W, Chandrakasan A, Balakrishnan H (2000) Energy-efficient communication protocols for wireless microsensor networks. In: Proc. 33rd Hawaii International Conference on System Sciences Vol. 8: 8020–8029.

  • Krishnamachari B, Estrin D, Wicker S (2002) Modelling data-centric routing in wireless sensor networks. In: Proc. IEEE Infocom

  • Lewis F (2004) Wireless sensor networks, in Smart Environments: Technologies, Protocols, and Applications In: D. Cook and S. Das, (eds), ch. 4, John Wiley

  • Mhatre V, Rosenberg C, Kofman D, Mazumdar R, Shroff N (2005) A minimum cost heterogeneous sensor network with a lifetime constraint. IEEE Tran. Mobile Comput. 4(1): 4–15

    Google Scholar 

  • Pottie G (1998) Wireless sensor networks. In: Proc. IEEE Information Theory Workshop, (Killarney, Ireland), 139–140

  • Sahni S, Gonzalez T (1976) P-complete approximation problems. J. ACM, vol. 23: 555–565

    MathSciNet  Google Scholar 

  • Schrijver A (2003) Combinatorial Optimization: Polyhedra and Efficiency, vol. A. Springer-Verlag ISBN 3-540-44389-4

  • Tamir A (2001) The k-centrum multi-faculty location problem. Discrete Appl. Math. 109(3):293–307

    Article  MATH  MathSciNet  Google Scholar 

  • Tamir A, Pérez-Brito D, Moreno-Pérez JA (1998) A polynomial algorithm for the p-centdian problem on a tree. Networks 32(4): 255–262

    Article  MathSciNet  Google Scholar 

  • Tang J, Hao B, Sen A (2005) Relay node placement in large scale wireless sensor networks in Computer Communications (to appear)

  • Wang Q, Xu K, Hassanein H, Takahara G (2005a) Minimum cost guaranteed lifetime design for heterogeneous wireless sensor networks. In: Proc. IEEE International Workshop on Strategies for Energy Efficiency in Ad-hoc and Sensor Networks, IPCCC

  • Wang Q, Xu K, Takahara G, Hassanein H (2005b) Locally optimal relay node placement in heterogeneous wireless sensor networks. IEEE Globecom (to appear)

  • Younis O, Fahmy S (June 2003) Distributed clustering for scalable. Long-lived sensor networks, Tech. Rep. TR-03-026, Purdue University

Download references

Author information

Authors and Affiliations

  1. School of Computing, Queen's University, Kingston, ON, K7L 3N6, Canada

    Robert Benkoczi, Hossam Hassanein, Selim Akl & Sylvia Tai

Authors
  1. Robert Benkoczi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hossam Hassanein
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Selim Akl
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Sylvia Tai
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Robert Benkoczi.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Benkoczi, R., Hassanein, H., Akl, S. et al. Data relaying with constraints in hierarchical sensor networks. J Comb Optim 11, 113–123 (2006). https://doi.org/10.1007/s10878-006-5981-z

Download citation

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10878-006-5981-z

Keywords

Search

Navigation