![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Prem Nath
Person information
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j26]Rajiv Kumar Mishra, Rajesh Kumar Yadav, Prem Nath:
Secure IoT data management and sharing architecture for information security using cryptographic technique. J. Intell. Fuzzy Syst. 45(6): 10951-10966 (2023) - [j25]Rajiv K. Mishra
, Rajesh Kumar Yadav, Prem Nath:
Blockchain DrivenAccess control architecture for the internet of things. Multim. Tools Appl. 82(20): 31397-31421 (2023) - [j24]Aastha Maheshwari, Rajesh Kumar Yadav, Prem Nath:
Congestion Aware Data Transmission in Mobile and Constrained IoT Network. Wirel. Pers. Commun. 130(3): 2121-2136 (2023) - 2022
- [j23]Aastha Maheshwari, Rajesh Kumar Yadav, Prem Nath:
Data Congestion Control Using Offloading in IoT Network. Wirel. Pers. Commun. 125(3): 2147-2166 (2022) - [j22]Sanjeev Kumar Singh, Chiranjeev Kumar, Prem Nath:
Resource-Cardinality Based Scheme to Reduce Resource Lookup Cost in Structured P2P Networks. Wirel. Pers. Commun. 125(4): 3351-3377 (2022) - 2021
- [j21]Sanjeev Kumar Singh
, Chiranjeev Kumar, Prem Nath:
Analysis and modelling the effects of mobility, Churn rate, node's life span, intermittent bandwidth and stabilization cost of finger table in structured mobile P2P networks. Wirel. Networks 27(2): 1049-1062 (2021) - 2020
- [j20]Mahendra Singh, Chiranjeev Kumar, Prem Nath:
Local P2P group (LPG) communication in structured mobile P2P networks. J. Ambient Intell. Humaniz. Comput. 11(7): 3005-3019 (2020) - [j19]Mahendra Singh
, Chiranjeev Kumar, Prem Nath:
Finger Forwarding Scheme to Reduce Lookup Cost in Structured P2P Networks. Wirel. Pers. Commun. 114(3): 2263-2281 (2020)
2010 – 2019
- 2019
- [j18]Sanjeev Kumar Singh, Chiranjeev Kumar, Prem Nath:
Local Contribution (LC) and Trustworthiness Factors to Induce Fairness in P2P Networks. Wirel. Pers. Commun. 107(1): 303-323 (2019) - [j17]Mahendra Singh
, Chiranjeev Kumar, Prem Nath:
Mobility Pattern Based Chord (MP-Chord) for Enhanced Lookup Performance in Mobile P2P Networks. Wirel. Pers. Commun. 109(3): 1971-1985 (2019) - 2015
- [j16]Prem Nath, Chiranjeev Kumar:
Location Management in IPv4 Networks for Fixed Mobility Pattern Users. Wirel. Pers. Commun. 85(3): 987-1008 (2015) - [i1]Prem Nath, Dhiraj Kumar Singh:
A sum form functional equation on a closed domain and its role in information theory. CoRR abs/1508.05910 (2015) - 2014
- [j15]Prem Nath, Chiranjeev Kumar:
Adaptive mobility anchor point to reduce regional registration and packets delivery costs. Comput. Electr. Eng. 40(4): 1329-1343 (2014) - [j14]Prem Nath, Chiranjeev Kumar:
Mobility Management Scheme for Fixed Mobility Pattern Mobile Users in IPv4 Networks. Comput. J. 57(12): 1893-1911 (2014) - [j13]Prem Nath, Chiranjeev Kumar:
Mobility agent based on activity rate of user and adaptive paging for location management in wireless networks. Trans. Emerg. Telecommun. Technol. 25(7): 723-735 (2014) - 2013
- [j12]Prem Nath, Chiranjeev Kumar:
Hybrid Scheme with Adaptive Replication and Mobility Anchoring Point (MAP) in Wireless Networks. Wirel. Pers. Commun. 72(1): 597-621 (2013) - 2012
- [c1]Prem Nath, Chiranjeev Kumar:
Adaptive hierarchical mobility management scheme (A-HMIP) for IP networks. ISCIT 2012: 331-336
1980 – 1989
- 1988
- [j11]Prem Nath, Ranjit Singh:
Some characterizations of the directed divergence using cyclic symmetry. IEEE Trans. Inf. Theory 34(1): 130-134 (1988) - 1984
- [j10]Prem Nath, Ranjit Singh:
Extreme symmetry and the directed divergence in information theory. Kybernetika 20(4): 329-337 (1984) - 1982
- [j9]Prem Nath, Man Mohan Kaur:
On Some Characterizations of the Shannon Entropy Using Extreme Symmetry and Block Symmetry. Inf. Control. 53(1/2): 9-20 (1982) - 1981
- [j8]Prem Nath, Man Mohan Kaur:
Symmetry and the Shannon entropy. Inf. Sci. 24(2): 111-120 (1981) - [j7]Prem Nath, Man Mohan Kaur:
Cyclic symmetry and the Shannon entropy. Inf. Sci. 25(3): 217-234 (1981) - 1980
- [j6]Prem Nath, Man Mohan Kaur:
On Characterizing the Shannon Entropy without Assuming Symmetry. Inf. Control. 47(3): 213-219 (1980) - [j5]Minaketan Behara, Prem Nath:
On additive and non-additive measures of directed divergence. Kybernetika 16(1): 1-12 (1980)
1970 – 1979
- 1976
- [j4]Prem Nath:
Some Theorems on Noiseless Coding. Inf. Control. 32(4): 355-367 (1976) - 1975
- [j3]Prem Nath:
On a Coding Theorem Connected with Rényi's Entropy. Inf. Control. 29(3): 234-242 (1975) - 1974
- [j2]Minaketan Behara, Prem Nath:
Information and entropy of countable measurable partitions. I. Kybernetika 10(6): 491-503 (1974) - 1973
- [j1]Prem Nath, D. P. Mittal:
A Generalization of Shannon's Inequality and Its Application in Coding Theory. Inf. Control. 23(5): 439-445 (1973)
Coauthor Index
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:14 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint