Jasaswi Mohanty - Academia.edu (original) (raw)

Uploads

Papers by Jasaswi Mohanty

Ad Hoc Networks, 2016

In a wireless network, messages need to be sent on in an optimized way to preserve the energy of ... more In a wireless network, messages need to be sent on in an optimized way to preserve the energy of the network. A minimum connected dominating set (MCDS) offers an optimized way of sending messages. However, MCDS construction is a NP-Hard problem. In this paper, we propose a new degree-based greedy approximation algorithm named as Connected Pseudo Dominating Set Using 2 Hop Information (CPDS2HI), which reduces the CDS size as much as possible. Our method first constructs the CDS and then reduces its size further by excluding some of the CDS nodes cleverly without any loss in coverage or connectivity. The simulation results show that our method outperforms existing CDS construction algorithms in terms of both the CDS size and construction cost. CPDS2HI retains the current best performance ratio of (4. 8 + ln 5) | opt| + 1. 2 , | opt | being the size of an optimal CDS of the network, and has the best time complexity of O (D), where D is the network diameter. To the best of our knowledge this is the most time efficient and size-optimal CDS construction algorithm. It has a linear message complexity of O (n), where n is the network size and is the maximum degree of all the nodes.

2014 Applications and Innovations in Mobile Computing (AIMoC), 2014

In the ad-hoc wireless network, there is no predefined infrastructure. So, nodes communicate with... more In the ad-hoc wireless network, there is no predefined infrastructure. So, nodes communicate with each other via peer communications. For effective communication, connected dominating set (CDS) can be used as a virtual backbone for the network. However, constructing a minimum connected dominating set is a NP-Complete problem. In the literature many approximation algorithms have been reported. In this paper, we propose a distributed three phase greedy approximation algorithm. In our algorithm, the nodes only store one hop neighborhood information to find the next dominators. We also propose a way to reduce the CDS size by downgrading some of the existing dominators after the construction of CDS. The simulation result shows that our CDS construction scheme outperforms all the existing CDS construction algorithms in terms of CDS size for randomly distributed nodes. Our algorithm retains the performance ratio of (4.8 + ln5)opt + 1.2 and time complexity of O(D), where opt being the size of the optimal CDS and D is the diameter of the network.

Computer Networks, 2017

In a wireless sensor network (WSN), neither there is any fixed infrastructure nor any centralized... more In a wireless sensor network (WSN), neither there is any fixed infrastructure nor any centralized control. Therefore, for efficient routing, some of the nodes are selected to form a virtual backbone. Minimum Connected Dominating Set (MCDS) can be used as a virtual backbone. However, MCDS construction is an NP-Hard problem. In this paper, we propose a novel distributed greedy approximation algorithm for CDS construction which reduces the CDS size effectively. The proposed method constructs the CDSs of smaller sizes with lower construction cost in comparison to existing CDS construction algorithms for both uniform and random distribution of nodes. The performance ratio of the proposed algorithm, which is the best at the current moment, is (4.8 + ln 5)|opt| + 1.2, where |opt| is the size of an optimal CDS of the network. Its time complexity is O(D), where D is the diameter of the network. Its message complexity is O(nR) which is linear, where n is the network size and R is the maximum between number of rounds needed to construct the PDS and number of rounds needed to interconnect the PDS nodes. Our simulation shows that ours is the most size optimal distributed CDS construction algorithm.

Due to the increasing number of digital document repositories there is a heavy demand for informa... more Due to the increasing number of digital document repositories there is a heavy demand for information retrieval systems and therefore, information retrieval is still appearing as an emerging area of research. The information retrieval technology these days focuses on achieving better performance under different context by extracting documents most appropriate to the user’s query. Majority of the classical keyword based retrieval techniques does not focus on semantic meanings and therefore, are found to be less effective in reconstructing the actual information conveyed in the context. Also, retrieval of the relevant documents depends on appropriate analysis of the query terms. As words are polysemic, their actual meanings are influenced by their relationships with other words and their syntactic roles in the sentence. This work presents a fuzzy-cluster based semantic information retrieval model that considers these relationships to determine the exact meaning of the user query and e...

Handbook of Research on Advanced Wireless Sensor Network Applications, Protocols, and Architectures, 2000

In a Wireless Sensor Network (WSN), all the nodes are deployed randomly and are energy constraine... more In a Wireless Sensor Network (WSN), all the nodes are deployed randomly and are energy constrained. There is no physical backbone infrastructure. So, for effective communication between the nodes, a virtual backbone can be used. A virtual backbone can be formed by constructing the Connected Dominating Set (CDS). In past few years, efficient and fast construction of CDS in a wireless network is the main research problem in topology control. In this chapter, the authors have given a comprehensive survey of the CDS construction algorithms with their merit and demerits. They concluded the chapter with some open problems and interesting issues in this field are proposed.

Ad Hoc Networks, 2016

In a wireless network, messages need to be sent on in an optimized way to preserve the energy of ... more In a wireless network, messages need to be sent on in an optimized way to preserve the energy of the network. A minimum connected dominating set (MCDS) offers an optimized way of sending messages. However, MCDS construction is a NP-Hard problem. In this paper, we propose a new degree-based greedy approximation algorithm named as Connected Pseudo Dominating Set Using 2 Hop Information (CPDS2HI), which reduces the CDS size as much as possible. Our method first constructs the CDS and then reduces its size further by excluding some of the CDS nodes cleverly without any loss in coverage or connectivity. The simulation results show that our method outperforms existing CDS construction algorithms in terms of both the CDS size and construction cost. CPDS2HI retains the current best performance ratio of (4. 8 + ln 5) | opt| + 1. 2 , | opt | being the size of an optimal CDS of the network, and has the best time complexity of O (D), where D is the network diameter. To the best of our knowledge this is the most time efficient and size-optimal CDS construction algorithm. It has a linear message complexity of O (n), where n is the network size and is the maximum degree of all the nodes.

2014 Applications and Innovations in Mobile Computing (AIMoC), 2014

In the ad-hoc wireless network, there is no predefined infrastructure. So, nodes communicate with... more In the ad-hoc wireless network, there is no predefined infrastructure. So, nodes communicate with each other via peer communications. For effective communication, connected dominating set (CDS) can be used as a virtual backbone for the network. However, constructing a minimum connected dominating set is a NP-Complete problem. In the literature many approximation algorithms have been reported. In this paper, we propose a distributed three phase greedy approximation algorithm. In our algorithm, the nodes only store one hop neighborhood information to find the next dominators. We also propose a way to reduce the CDS size by downgrading some of the existing dominators after the construction of CDS. The simulation result shows that our CDS construction scheme outperforms all the existing CDS construction algorithms in terms of CDS size for randomly distributed nodes. Our algorithm retains the performance ratio of (4.8 + ln5)opt + 1.2 and time complexity of O(D), where opt being the size of the optimal CDS and D is the diameter of the network.

Computer Networks, 2017

In a wireless sensor network (WSN), neither there is any fixed infrastructure nor any centralized... more In a wireless sensor network (WSN), neither there is any fixed infrastructure nor any centralized control. Therefore, for efficient routing, some of the nodes are selected to form a virtual backbone. Minimum Connected Dominating Set (MCDS) can be used as a virtual backbone. However, MCDS construction is an NP-Hard problem. In this paper, we propose a novel distributed greedy approximation algorithm for CDS construction which reduces the CDS size effectively. The proposed method constructs the CDSs of smaller sizes with lower construction cost in comparison to existing CDS construction algorithms for both uniform and random distribution of nodes. The performance ratio of the proposed algorithm, which is the best at the current moment, is (4.8 + ln 5)|opt| + 1.2, where |opt| is the size of an optimal CDS of the network. Its time complexity is O(D), where D is the diameter of the network. Its message complexity is O(nR) which is linear, where n is the network size and R is the maximum between number of rounds needed to construct the PDS and number of rounds needed to interconnect the PDS nodes. Our simulation shows that ours is the most size optimal distributed CDS construction algorithm.

Due to the increasing number of digital document repositories there is a heavy demand for informa... more Due to the increasing number of digital document repositories there is a heavy demand for information retrieval systems and therefore, information retrieval is still appearing as an emerging area of research. The information retrieval technology these days focuses on achieving better performance under different context by extracting documents most appropriate to the user’s query. Majority of the classical keyword based retrieval techniques does not focus on semantic meanings and therefore, are found to be less effective in reconstructing the actual information conveyed in the context. Also, retrieval of the relevant documents depends on appropriate analysis of the query terms. As words are polysemic, their actual meanings are influenced by their relationships with other words and their syntactic roles in the sentence. This work presents a fuzzy-cluster based semantic information retrieval model that considers these relationships to determine the exact meaning of the user query and e...

Handbook of Research on Advanced Wireless Sensor Network Applications, Protocols, and Architectures, 2000

In a Wireless Sensor Network (WSN), all the nodes are deployed randomly and are energy constraine... more In a Wireless Sensor Network (WSN), all the nodes are deployed randomly and are energy constrained. There is no physical backbone infrastructure. So, for effective communication between the nodes, a virtual backbone can be used. A virtual backbone can be formed by constructing the Connected Dominating Set (CDS). In past few years, efficient and fast construction of CDS in a wireless network is the main research problem in topology control. In this chapter, the authors have given a comprehensive survey of the CDS construction algorithms with their merit and demerits. They concluded the chapter with some open problems and interesting issues in this field are proposed.