N
Nirwan Ansari
Researcher at New Jersey Institute of Technology
Publications - 743
Citations - 25453
Nirwan Ansari is an academic researcher from New Jersey Institute of Technology. The author has contributed to research in topics: Quality of service & Network packet. The author has an hindex of 71, co-authored 708 publications receiving 21488 citations. Previous affiliations of Nirwan Ansari include Hebei University of Engineering & Purdue University.
Papers
More filters
Posted Content
Beam with Adaptive Divergence Angle in Free-Space Optical Communications for High-Speed Trains.
Yagiz Kaymak,Sina Fathi Kazerooni,Roberto Rojas-Cessa,Feng Jianghua,Nirwan Ansari,MengChu Zhou,Zhang Tairan +6 more
TL;DR: An adaptive beam that adapts its divergence angle according to the receiver aperture diameter and the communication distance to improve the received power and ease the alignment between the communicating optical transceivers in a free-space optical communications (FSOC) system for high-speed trains (HSTs).
Proceedings ArticleDOI
Distributed Diffusion-Based Mesh Algorithm for Distributed Mesh Construction in Wireless Ad Hoc and Sensor Networks
TL;DR: This paper proposes the distributed diffusion-based mesh (DDM) algorithm for distributed mesh construction that instructs distributed nodes on how to make the desired connections with their neighbors and introduces the concept of connection rule, which defines allowed connections at each mesh node combined with a token signal that initiates and controls the structure and boundaries of the resulting mesh.
Proceedings ArticleDOI
The tale of a simple accurate MPEG video traffic model
TL;DR: Simulations based on a real MPEG compressed movie sequence of Star Wars have demonstrated that the simple model can capture the ACF and the marginal CDF very closely.
Proceedings ArticleDOI
SDRE: Selective data redundancy elimination for resource constrained hosts
TL;DR: A content-type based selective DRE is proposed, which deploys DRE selectively on the contents which have the most opportunities for redundant content identification and can achieve almost the same bandwidth savings as that of standard DRE with less computation and smaller memory.
Proceedings ArticleDOI
Descending-Order Clique-Based Task Scheduling for Active Measurements
TL;DR: A novel scheduling algorithm is proposed based on graph-coloring theory and uses a descending order of a clique (a set of contending nodes) in a graph to resolve contention of measurement tasks.