![]() | ![]() |
Bijendra Nath Jain
List of publications from the DBLP Bibliography Server - FAQ
| 2010 | ||
|---|---|---|
| 31 | Vaishali P. Sadaphal, Bijendra N. Jain: Impact of colinearity of sensors selected for location estimation. HiPC 2010: 1-10 | |
| 30 | Ash Mohammad Abbas, Bijendra Nath Jain: Path diminution in node-disjoint multipath routing for mobile ad hoc networks is unavoidable with single route discovery. IJAHUC 5(1): 7-21 (2010) | |
| 2009 | ||
| 29 | Vaishali P. Sadaphal, Bijendra N. Jain: The role of colinearity of sensors in target localization using distance measurements. MSWiM 2009: 413-417 | |
| 2008 | ||
| 28 | Mohit Saxena, Puneet Gupta, Bijendra N. Jain: Experimental analysis of RSSI-based location estimation in wireless sensor networks. COMSWARE 2008: 503-510 | |
| 27 | Vaishali P. Sadaphal, Bijendra N. Jain: Tracking target using sensor networks: target detection and route activation under energy constraints. COMSWARE 2008: 511-518 | |
| 26 | Vaishali P. Sadaphal, Bijendra N. Jain: Random and Periodic Sleep Schedules for Target Detection in Sensor Networks. J. Comput. Sci. Technol. 23(3): 343-354 (2008) | |
| 2007 | ||
| 25 | C. N. Kanthi, Bijendra N. Jain: Spanner Based Distributed Channel Assignment in Wireless Mesh Networks. COMSWARE 2007 | |
| 24 | Ash Mohammad Abbas, Mansoor Alam, Bijendra Nath Jain: Alleviating path correlation using directional antenna in node-disjoint multipath routing for mobile ad hoc networks. IWCMC 2007: 405-410 | |
| 23 | Vaishali P. Sadaphal, Bijendra N. Jain: Random and Periodic sleep schedules for target detection in sensor networks. MASS 2007: 1-11 | |
| 2006 | ||
| 22 | Ash Mohammad Abbas, Bijendra Nath Jain: Mitigating overheads and path correlation in node-disjoint multipath routing for mobile ad hoc networks. COMSWARE 2006 | |
| 21 | Ash Mohammad Abbas, Bijendra Nath Jain: Path diminution is unavoidable in node-disjoint multipath routing with single route discovery. COMSWARE 2006 | |
| 20 | Ajay Agarwal, Bijendra N. Jain: QoS-constrained fault-tolerant routing in MANETs based on segment-backup paths. COMSWARE 2006 | |
| 19 | Vaishali P. Sadaphal, Bijendra N. Jain: Spread-based heuristic for sensor selection in sensor networks. COMSWARE 2006 | |
| 18 | Ash Mohammad Abbas, Bijendra Nath Jain: Mitigating path diminution in disjoint multipath routing for mobile ad hoc networks. IJAHUC 1(3): 137-146 (2006) | |
| 2005 | ||
| 17 | Vaishali P. Sadaphal, Bijendra N. Jain: Sensor Selection Heuristic in Sensor Networks. HiPC 2005: 190-200 | |
| 2004 | ||
| 16 | Ash Mohammad Abbas, Bijendra Nath Jain: Path diminution in disjoint multipath routing for mobile ad hoc networks. PIMRC 2004: 130-134 | |
| 15 | Seng Wai Loke, Arkady B. Zaslavsky, Bijendra N. Jain: Wireless Marketing of Ephemeral Personal Goods: the Case of Auctioning Screen Estate for Wireless Advertisements. Wireless Information Systems 2004: 127-133 | |
| 2003 | ||
| 14 | Ash Mohammad Abbas, Bijendra Nath Jain: An Analytical Framework for Path Reliabilities in Mobile Ad Hoc Networks. ISCC 2003: 63-68 | |
| 2002 | ||
| 13 | Shirshanka Das, Pavan Verma, Bijendra N. Jain, Mario Gerla: ZRESTORE: A Link Restoration Scheme with High Aggregation and No Reservation. ONDM 2002: 295-310 | |
| 1999 | ||
| 12 | M. V. Padmini, B. B. Madan, Bijendra N. Jain: A Linear Array for Large Sparse Matrix Operations - I Cholesky Factorization. Parallel Algorithms Appl. 13(3): 187-215 (1999) | |
| 11 | M. V. Padmini, B. B. Madan, Bijendra N. Jain: A Linear Array for Large Sparse Matrix Operations - Ii Triangular System Solvers and Matrix Multiplication. Parallel Algorithms Appl. 13(3): 217-237 (1999) | |
| 1998 | ||
| 10 | M. Dominic, Bijendra N. Jain: Conditions for On-Line Scheduling of Hard Real-Time Tasks on Multiprocessors. J. Parallel Distrib. Comput. 55(1): 121-137 (1998) | |
| 1993 | ||
| 9 | Dheeraj Sanghi, Ashok K. Agrawala, Olafur Gudmundsson, Bijendra N. Jain: Experimental Assessment of End-to-End Behavior on Internet. INFOCOM 1993: 867-874 | |
| 8 | Ashok K. Agrawala, Bijendra N. Jain: Deterministic Model and Transient Analysis of Virtual Circuits. IEEE Trans. Software Eng. 19(2): 187-197 (1993) | |
| 1992 | ||
| 7 | Bijendra N. Jain, Ashok K. Agrawala: Deterministic Modeling and Transient Analysis of a Network Processor with Cross Traffic. NETWORKS 1992: 141-156 | |
| 1991 | ||
| 6 | Ravi Mittal, Bijendra N. Jain, Rakesh K. Patney: Subtree Availability in Binary Tree Architectures. ICCI 1991: 312-322 | |
| 5 | Ravi Mittal, Bijendra N. Jain, Rakesh K. Patney: Link Augmented Binary (LAB)-Tree: Its Structure, Routing and Fault Tolerance Properties. IPPS 1991: 452-457 | |
| 1988 | ||
| 4 | Bijendra N. Jain, Satish K. Tripathi: An Analysis of Cube-Connected Cycles and Circular Shuffle Networks for Parallel Computation. J. Parallel Distrib. Comput. 5(6): 741-754 (1988) | |
| 1986 | ||
| 3 | Bijendra N. Jain, Satish K. Tripathi: Equivalence Between Cube-Connected Cycles Networks and Circular Shuffle Networks. ICPP 1986: 8-11 | |
| 1982 | ||
| 2 | Bijendra N. Jain: Duplication of packets and their detection in X.25 communication protocols. ISCA 1982: 267-273 | |
| 1 | Mohamed G. Gouda, Bijendra N. Jain: Necessary and Sufficient Conditions to Detect Message Duplication in Protocol Hierarchies. PSTV 1982: 317 | |
| 1 | Ash Mohammad Abbas | [14] [16] [18] [21] [22] [24] [30] |
| 2 | Ajay Agarwal | [20] |
| 3 | Ashok K. Agrawala | [7] [8] [9] |
| 4 | Mansoor Alam | [24] |
| 5 | Shirshanka Das | [13] |
| 6 | M. Dominic | [10] |
| 7 | Mario Gerla | [13] |
| 8 | Mohamed G. Gouda | [1] |
| 9 | Olafur Gudmundsson | [9] |
| 10 | Puneet Gupta | [28] |
| 11 | C. N. Kanthi | [25] |
| 12 | Seng Wai Loke | [15] |
| 13 | B. B. Madan | [11] [12] |
| 14 | Ravi Mittal | [5] [6] |
| 15 | M. V. Padmini | [11] [12] |
| 16 | Rakesh K. Patney | [5] [6] |
| 17 | Vaishali P. Sadaphal | [17] [19] [23] [26] [27] [29] [31] |
| 18 | Dheeraj Sanghi | [9] |
| 19 | Mohit Saxena | [28] |
| 20 | Satish K. Tripathi | [3] [4] |
| 21 | Pavan Verma | [13] |
| 22 | Arkady B. Zaslavsky | [15] |
Colors in the list of coauthors
Last update Fri Jun 1 15:44:53 2012 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page