Stevan M. Berber

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Ljiljana Simic

> Home > Persons > Stevan M. Berber

Publications

2008
[c10]
- view
  authority control:
- export record
  dblp key:
  - conf/globecom/SimicBS08
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/globecom/SimicBS08
Ljiljana Simic, Stevan M. Berber, Kevin W. Sowerby:
Distributed Partner Choice for Energy Efficient Cooperation in a Wireless Sensor Network. GLOBECOM 2008: 4799-4804
[c9]
- view
  authority control:
- export record
  dblp key:
  - conf/icc/SimicBS08
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icc/SimicBS08
Ljiljana Simic, Stevan M. Berber, Kevin W. Sowerby:
Partner Choice and Power Allocation for Energy Efficient Cooperation in Wireless Sensor Networks. ICC 2008: 4255-4260
2007
[c5]
- view
  authority control:
- export record
  dblp key:
  - conf/pimrc/SimicBS07
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/pimrc/SimicBS07
Ljiljana Simic, Stevan M. Berber, Kevin W. Sowerby:
Energy-Efficiency of Cooperative Diversity Techniques in Wireless Sensor Networks. PIMRC 2007: 1-5
2006
[j6]
- view
  - electronic edition @ uts.edu.au
  - no references & citations available
- export record
  dblp key:
  - journals/ajict/SimicB06
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ajict/SimicB06
Ljiljana Simic, Stevan M. Berber:
DSP Prototype of a Chaos-Based Multi-User Communication System: Design and Performance Analysis. Afr. J. Inf. Commun. Technol. 2(2) (2006)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.