Awadhesh Kumar Singh
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Awadhesh Kumar Singh has a total of 33 co-authors. Here are the top co-authors by number of shared publications:
Poonam Saini
PEC University of Technology, India
10 shared publicationsAbhishek Swaroop
8 shared publications- Ritu Garg
National Institute of Technology Kurukshetra
8 shared publications Parmeet Kaur Jaggi
6 shared publicationsBharti Sharma
5 shared publicationsShantanu Sharma
Department of Computer Science, Ben-Gurion University of the Negev, Israel
5 shared publications
Latest Publications
- Open Access
- 1 July 2017
- Published by Springer Nature in Journal of King Saud University Computer and Information Sciences
- Vol. 29 (3) , 378-398
A logical structure based fault tolerant approach to handle leader election in mobile ad hoc networks
- 1 July 2017
- Published by Springer Nature in Journal of King Saud University Computer and Information Sciences
- Vol. 29 (3) , 378-398
Open AccessA logical structure based fault tolerant approach to handle leader election in mobile ad hoc networks
- Open Access
- 1 July 2016
- Published by Springer Nature in Journal of King Saud University Computer and Information Sciences
- Vol. 28 (3) , 276-288
A hierarchical virtual backbone construction protocol for mobile ad hoc networks
- 1 July 2016
- Published by Springer Nature in Journal of King Saud University Computer and Information Sciences
- Vol. 28 (3) , 276-288
Open AccessA hierarchical virtual backbone construction protocol for mobile ad hoc networks
- 7 June 2016
- Published by Taylor & Francis in International Journal of Parallel, Emergent and Distributed Systems
- Vol. 33 (2) , 172-196
An election algorithm to ensure the high availability of leader in large mobile ad hoc networks
A fundamental problem of distributed systems, leader election, is presented in the context of mobile ad hoc networks (MANETs). In many distributed systems, the presence of a leader is necessary in order to monitor underlying computations, guarantee quality functioning, take checkpoints, generate the lost token, detect quiescence conditions, etc. Hence, several leader election algorithms have been proposed in the literature. Although, most of the algorithms focus on reducing the control message (messages that have the highest priority to deliver) count, there have been almost no attention on ensuring high availability of a leader despite various types of failures, especially, in the scenarios like rescue and warfare, where the absence of the leader, even for a short duration, may lead to havoc. We focus on this issue, particularly, for large MANETs, where a large number of applications fails to perform in the absence of a leader. We present a leader election algorithm for large MANETs. The algorithm is inspired by the concept of prevailing parliamentary democracy and elects three best-nodes – in terms of performance parameters like battery life, computing power, memory, hop distance, and mobility – as the president, leader, and vice leader. The president node works as the leader of the network, in case, the leader and the vice leader both become unavailable simultaneously. On the other hand, the leader node serves all the requests. Further, we create a house of elite nodes, which ensures the presence of an executive, i.e. a leader during re-election to restrict the message overhead as well as the election latency while executing coordination related activities. Graphical Abstract Failure of the special nodes.
- 7 June 2016
- Published by Taylor & Francis in International Journal of Parallel, Emergent and Distributed Systems
- Vol. 33 (2) , 172-196
An election algorithm to ensure the high availability of leader in large mobile ad hoc networks
A fundamental problem of distributed systems, leader election, is presented in the context of mobile ad hoc networks (MANETs). In many distributed systems, the presence of a leader is necessary in order to monitor underlying computations, guarantee quality functioning, take checkpoints, generate the lost token, detect quiescence conditions, etc. Hence, several leader election algorithms have been proposed in the literature. Although, most of the algorithms focus on reducing the control message (messages that have the highest priority to deliver) count, there have been almost no attention on ensuring high availability of a leader despite various types of failures, especially, in the scenarios like rescue and warfare, where the absence of the leader, even for a short duration, may lead to havoc. We focus on this issue, particularly, for large MANETs, where a large number of applications fails to perform in the absence of a leader. We present a leader election algorithm for large MANETs. The algorithm is inspired by the concept of prevailing parliamentary democracy and elects three best-nodes – in terms of performance parameters like battery life, computing power, memory, hop distance, and mobility – as the president, leader, and vice leader. The president node works as the leader of the network, in case, the leader and the vice leader both become unavailable simultaneously. On the other hand, the leader node serves all the requests. Further, we create a house of elite nodes, which ensures the presence of an executive, i.e. a leader during re-election to restrict the message overhead as well as the election latency while executing coordination related activities. Graphical Abstract Failure of the special nodes.
- 3 June 2016
- Published by Springer Nature in Arabian Journal for Science and Engineering
- Vol. 41 (12) , 5181-5194
A Token-Based Solution to Group Local Mutual Exclusion Problem In Mobile Ad Hoc Networks
- 3 June 2016
- Published by Springer Nature in Arabian Journal for Science and Engineering
- Vol. 41 (12) , 5181-5194
A Token-Based Solution to Group Local Mutual Exclusion Problem In Mobile Ad Hoc Networks
- 21 March 2016
- Published by Springer Nature in Proceedings of the National Academy of Sciences, India Section A: Physical Sciences
- Vol. 86 (2) , 169-186
Mutual Exclusion in MANETs Using Quorum Agreements
- 21 March 2016
- Published by Springer Nature in Proceedings of the National Academy of Sciences, India Section A: Physical Sciences
- Vol. 86 (2) , 169-186
Mutual Exclusion in MANETs Using Quorum Agreements
- Top Cited Papers
- 1 March 2016
- Published by Elsevier in Physical Communication
- Vol. 18, 64-84
A survey on 5G: The next generation of mobile communication
- 1 March 2016
- Published by Elsevier in Physical Communication
- Vol. 18, 64-84
Top Cited PapersA survey on 5G: The next generation of mobile communication
- 1 January 2016
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 216-219
Bitcoins and secure financial transaction processing, recent advances
Bitcoins have opened a new chapter in the arena of electronic financial transactions. Due to their decentralized nature and independence from the need of a third party for authorizing transactions, they are seen as an alternative choice for payments by many firms and financial institutions. But like all other prevalent financial transaction technologies, they are also having their securities issues of their own kind. The current article discusses the security issues associated with the bitcoins based financial transaction processing system and various proposed research endeavors to combat them in recent years.
- 1 January 2016
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 216-219
Bitcoins and secure financial transaction processing, recent advances
Bitcoins have opened a new chapter in the arena of electronic financial transactions. Due to their decentralized nature and independence from the need of a third party for authorizing transactions, they are seen as an alternative choice for payments by many firms and financial institutions. But like all other prevalent financial transaction technologies, they are also having their securities issues of their own kind. The current article discusses the security issues associated with the bitcoins based financial transaction processing system and various proposed research endeavors to combat them in recent years.
- 1 January 2016
- Published by IGI Global Scientific Publishing
- p. 96-125
Security in Ad Hoc Network and Computing Paradigms
Security in Ad Hoc Network and Computing Paradigms: 10.4018/978-1-5225-0105-3.ch005: Resource sharing is the most attractive feature of distributed computing. Information is also a kind of resource. The portable computing devices and wireless
- 1 January 2016
- Published by IGI Global Scientific Publishing
- p. 96-125
Security in Ad Hoc Network and Computing Paradigms
Security in Ad Hoc Network and Computing Paradigms: 10.4018/978-1-5225-0105-3.ch005: Resource sharing is the most attractive feature of distributed computing. Information is also a kind of resource. The portable computing devices and wireless
- Open Access
- 1 October 2015
- Published by Springer Nature in Journal of King Saud University Computer and Information Sciences
- Vol. 27 (4) , 402-415
Rollback recovery with low overhead for fault tolerance in mobile ad hoc networks
- 1 October 2015
- Published by Springer Nature in Journal of King Saud University Computer and Information Sciences
- Vol. 27 (4) , 402-415
Open AccessRollback recovery with low overhead for fault tolerance in mobile ad hoc networks
- 26 July 2015
- Published by MECS Publisher in International Journal of Wireless and Microwave Technologies
- Vol. 5 (4) , 1-14
Dynamic Request Set based Mutual Exclusion Algorithm in MANETs
- 26 July 2015
- Published by MECS Publisher in International Journal of Wireless and Microwave Technologies
- Vol. 5 (4) , 1-14
Dynamic Request Set based Mutual Exclusion Algorithm in MANETs