Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

Baofeng Ji

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 Chunhai Feng

> Home > Persons > Baofeng Ji

Publications

2020
[j33]
- view
  authority control:
- export record
  dblp key:
  - journals/winet/CaoZJLF20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/winet/CaoZJLF20
Dun Cao, Bin Zheng, Baofeng Ji, Zhengbao Lei, Chunhai Feng:
A robust distance-based relay selection for message dissemination in vehicular network. Wirel. Networks 26(3): 1755-1771 (2020)
2019
[j32]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/access/CaoLMWJFS19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/access/CaoLMWJFS19
Dun Cao, Yonghe Liu, Xiaomin Ma, Jin Wang, Baofeng Ji, Chunhai Feng, Jinxiu Si:
A Relay-Node Selection on Curve Road in Vehicular Networks. IEEE Access 7: 12714-12728 (2019)
2018
[j16]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/sensors/CaoZWJF18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/sensors/CaoZWJF18
Dun Cao, Bin Zheng, Jin Wang, Baofeng Ji, Chunhai Feng:
Design and Analysis of a General Relay-Node Selection Mechanism on Intersection in Vehicular Networks. Sensors 18(12): 4251 (2018)

a service of

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.