Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Bikramjit Singh

dblp:72/11477 · DBLP profile ↗
← Back
5ranked-venue papers
3as first author
0since 2021 · last 2020
—ORCID · conflict

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1Computer networks · 1 · 1 first-authorSecurity and privacy · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer networks
1 paper
Internet architecture and protocols · 100%
Network and information security
1 paper
Network security · 100%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Internet architecture and protocols › network security
IP security
0.012000
A Multi-Layer IPSEC Protocol · USENIX Security Symposium 2000
Internet architecture and protocols
network security
0.012000
A Multi-Layer IPSEC Protocol · USENIX Security Symposium 2000
Network security › protocol security
network protocol security
0.012000
A Multi-Layer IPSEC Protocol · USENIX Security Symposium 2000
YearPublicationVenuePosition
2020 Incorporation of Additional Modules Within Particle Swarm Optimization for Feasibility Conditions of Multi-index Transportation Problem
Amarinder Singh, Bikramjit Singh
HIS3
2016 Ultra-reliable communication in a factory environment for 5G wireless networks: Link level and deployment study
abstract
The focus of this paper on mission-critical communications in a 5G cellular communication system. Technologies to provide ultra-reliable communication, with 99.999 % availability in a factory environment are studied. We have analysed the feasibility requirements for ultra-reliable communication and obtained the loss margins against path loss, shadow and fast fading. We also study the effect of increased interference due to higher deployment density on offered reliable rates and packet delays. Resource allocation schemes based on full and orthogonal resource sharing, as well as power control are compared. Last, the importance of multi-hop communication and multi-point coordination schemes are highlighted to improve the reliable communication in presence of interference and clutter.
Bikramjit Singh, Zexian Li, Olav Tirkkonen, Mikko A. Uusitalo, Preben Mogensen 0001
PIMRC1
2016 Selective multi-hop relaying for ultra-reliable communication in a factory environment
abstract
Evolving 5G cellular communication is envisioned to enable connectivity for a wide range of new use cases. The focus on mission-critical communications, such as factory automation, public safety and vehicular safety applications presses the demand for ultra-reliable communication. In this paper, we investigate by various means of multi-hop relaying schemes to improve the reliable communication in a factory environment. Impacts due to half- and full-duplex operation at relay nodes are studied together with resource allocation. No retransmissions are considered and the relaying schemes are limited to two hops to meet the low latency constraint. Performance evaluations in a factory scenario are shown. We illustrate that in a network of uncoordinated cells one can exploit the varying fading profiles and can improve the offered reliable rate using multi-hop communication.
Bikramjit Singh, Olav Tirkkonen, Zexian Li, Mikko A. Uusitalo, Risto Wichman
PIMRC1
2015 Co-primary inter-operator spectrum sharing over a limited spectrum pool using repeated games
abstract
We consider two small cell operators deployed in the same geographical area, sharing spectrum resources from a common pool. A method is investigated to coordinate the utilization of the spectrum pool without monetary transactions and without revealing operator-specific information to other parties. For this, we construct a protocol based on asking and receiving spectrum usage favors by the operators, and keeping a book of the favors. A spectrum usage favor is exchanged between the operators if one is asking for a permission to use some of the resources from the pool on an exclusive basis, and the other is willing to accept that. As a result, the proposed method does not force an operator to take action. An operator with a high load may take spectrum usage favors from an operator that has few users to serve, and it is likely to return these favors in the future to show a cooperative spirit and maintain reciprocity. We formulate the interactions between the operators as a repeated game and determine rules to decide whether to ask or grant a favor at each stage game. We illustrate that under frequent network load variations, which are expected to be prominent in small cell deployments, both operators can attain higher user rates as compared to the case of no coordination of the resource utilization.
Bikramjit Singh, Konstantinos Koufos, Olav Tirkkonen, Randall Berry
ICC1
2000 A Multi-Layer IPSEC Protocol
Yongguang Zhang, Bikramjit Singh
USENIX Security Symposium2