Na Asadpour | Azad university of arak (original) (raw)

Papers by Na Asadpour

Mobile Ad Hoc and …, Jan 1, 2008

Since there is no fixed infrastructure or centralized management in wireless sensor network (WSN)... more Since there is no fixed infrastructure or centralized management in wireless sensor network (WSN), a connected dominating set (CDS) has been proposed as a virtual backbone. The CDS plays a major role in routing, broadcasting, coverage and activity scheduling. To reduce the traffic during communication and prolong network lifetime, it is desirable to construct a minimum CDS (MCDS). For the

Journal of networks, Jan 1, 2009

Connected Dominating Set (CDS) problem in unit disk graph has a significant impact on an efficien... more Connected Dominating Set (CDS) problem in unit disk graph has a significant impact on an efficient design of routing protocols in wireless sensor networks. In this paper, an algorithm is proposed for finding Minimum Connected Dominating Set (MCDS) using Dominating Set. Dominating Sets are connected by using Steiner tree. The algorithm goes through three phases. In first phase Dominating Sets are found, in second phase connectors are identified, connected through Steiner tree. In third phase the CDS obtained in second phase is pruned to obtain a MCDS. MCDS so constructed needs to adapt to the continual topology changes due to deactivation of a node due to exhaustion of battery power. These topological changes due to power constraints are taken care by a local repair algorithm that reconstructs the MCDS i.e. Power Aware MCDS, using only neighbourhood information. Simulation results indicate both the heuristics are very efficient and result in near optimal MCDS. Index Terms-Connected Dominating Set, topology, virtual backbone, wireless sensor networks.

… , 2008. ICCCN'08. Proceedings of 17th …, Jan 1, 2008

The core functionality of a wireless sensor network (WSN) is to detect deviations in expected nor... more The core functionality of a wireless sensor network (WSN) is to detect deviations in expected normal behavior and report it to the sink. In this paper, we propose TRACK -a novel sink mobility model exploiting the Connected Dominating Set (CDS) property of a network graph. TRACK, to the best of our knowledge, is the first contemporary sink mobility model to exploit the CDS property for WSN lifetime longevity and secure data aggregation. In TRACK, the CDS of the given network is computed and then the Minimum Spanning Tree (MST) of the CDS is constructed. Using the CDS-MST as the underlying framework, a Hamiltonian Circuit (HC) is constructed, along which the sink is mobilized to traverse the network. Since TRACK, by the very definition of CDS, passes through the transmission range of every node in the network, data can be relayed directly from the source node to the sink, eliminating the need for multi-hop routing. By virtue of this property, nodes in the WSN are discharged from their routing obligations and data aggregation becomes more secure. Additionally, we propose an extended version of TRACK called M-TRACK in this paper. The extended model trades higher fractions of sensor energy with the objective of minimizing the length of sink trajectory. This consequently minimizes the delay between consecutive sink visits, mitigating buffer-overflow of sensors. M-TRACK does necessitate multi-hop routing, but keeps it within a bounded number of hops. We confirm the efficiency and robustness of our models via simulation and analysis, and show that our model can extend the WSN lifetime up to seven times that which can be achieved using a static sink.

Inform. Technol. J, Jan 1, 2010

… Conference, 2007. MILCOM …, Jan 1, 2007

A k-Connected m-Dominating Set (kmCDS) working as a virtual backbone in a wireless sensor network... more A k-Connected m-Dominating Set (kmCDS) working as a virtual backbone in a wireless sensor network is necessary for fault tolerance and routing flexibility. In order to construct a kmCDS with the minimum size, some approximation algorithms have been proposed in the literature. However, all of those algorithms only consider some special cases where k = 1, 2 or k = m. In this paper, we propose one centralized heuristic algorithm CGA and one distributed algorithms, DDA which is deterministic, to construct a kmCDS for general k and m. Simulation results are also presented to evaluate our algorithms and the results show that our algorithms have better performances than the exiting other algorithms.

Information Technology Journal, Jan 1, 2010

Proceedings of the 9th ACM international symposium …, Jan 1, 2008

A Connected Dominating Set (CDS) working as a virtual backbone is an effective way to decrease th... more A Connected Dominating Set (CDS) working as a virtual backbone is an effective way to decrease the overhead of routing in a wireless sensor network. Furthermore, a k-Connected m-Dominating Set (kmCDS) is necessary for fault tolerance and routing flexibility. Some approximation algorithms have been proposed to construct a kmCDS. However, most of them only consider some special cases where k = 1, 2 or k ≤ m, or are not easy to implement, or have high message complexity. In this paper, we propose a novel distributed algorithm LDA with low message complexity to construct a kmCDS for general k and m whose size is guaranteed to be within a small constant factor of the optimal solution when the maximum node degree is a constant. We also propose one centralized algorithm ICGA with a constant performance ratio to construct a kmCDS. Theoretical analysis as well as simulation results are shown to evaluate the proposed algorithms.

Mobile Ad Hoc and …, Jan 1, 2008

Since there is no fixed infrastructure or centralized management in wireless sensor network (WSN)... more Since there is no fixed infrastructure or centralized management in wireless sensor network (WSN), a connected dominating set (CDS) has been proposed as a virtual backbone. The CDS plays a major role in routing, broadcasting, coverage and activity scheduling. To reduce the traffic during communication and prolong network lifetime, it is desirable to construct a minimum CDS (MCDS). For the

Journal of networks, Jan 1, 2009

Connected Dominating Set (CDS) problem in unit disk graph has a significant impact on an efficien... more Connected Dominating Set (CDS) problem in unit disk graph has a significant impact on an efficient design of routing protocols in wireless sensor networks. In this paper, an algorithm is proposed for finding Minimum Connected Dominating Set (MCDS) using Dominating Set. Dominating Sets are connected by using Steiner tree. The algorithm goes through three phases. In first phase Dominating Sets are found, in second phase connectors are identified, connected through Steiner tree. In third phase the CDS obtained in second phase is pruned to obtain a MCDS. MCDS so constructed needs to adapt to the continual topology changes due to deactivation of a node due to exhaustion of battery power. These topological changes due to power constraints are taken care by a local repair algorithm that reconstructs the MCDS i.e. Power Aware MCDS, using only neighbourhood information. Simulation results indicate both the heuristics are very efficient and result in near optimal MCDS. Index Terms-Connected Dominating Set, topology, virtual backbone, wireless sensor networks.

… , 2008. ICCCN'08. Proceedings of 17th …, Jan 1, 2008

The core functionality of a wireless sensor network (WSN) is to detect deviations in expected nor... more The core functionality of a wireless sensor network (WSN) is to detect deviations in expected normal behavior and report it to the sink. In this paper, we propose TRACK -a novel sink mobility model exploiting the Connected Dominating Set (CDS) property of a network graph. TRACK, to the best of our knowledge, is the first contemporary sink mobility model to exploit the CDS property for WSN lifetime longevity and secure data aggregation. In TRACK, the CDS of the given network is computed and then the Minimum Spanning Tree (MST) of the CDS is constructed. Using the CDS-MST as the underlying framework, a Hamiltonian Circuit (HC) is constructed, along which the sink is mobilized to traverse the network. Since TRACK, by the very definition of CDS, passes through the transmission range of every node in the network, data can be relayed directly from the source node to the sink, eliminating the need for multi-hop routing. By virtue of this property, nodes in the WSN are discharged from their routing obligations and data aggregation becomes more secure. Additionally, we propose an extended version of TRACK called M-TRACK in this paper. The extended model trades higher fractions of sensor energy with the objective of minimizing the length of sink trajectory. This consequently minimizes the delay between consecutive sink visits, mitigating buffer-overflow of sensors. M-TRACK does necessitate multi-hop routing, but keeps it within a bounded number of hops. We confirm the efficiency and robustness of our models via simulation and analysis, and show that our model can extend the WSN lifetime up to seven times that which can be achieved using a static sink.

Inform. Technol. J, Jan 1, 2010

… Conference, 2007. MILCOM …, Jan 1, 2007

A k-Connected m-Dominating Set (kmCDS) working as a virtual backbone in a wireless sensor network... more A k-Connected m-Dominating Set (kmCDS) working as a virtual backbone in a wireless sensor network is necessary for fault tolerance and routing flexibility. In order to construct a kmCDS with the minimum size, some approximation algorithms have been proposed in the literature. However, all of those algorithms only consider some special cases where k = 1, 2 or k = m. In this paper, we propose one centralized heuristic algorithm CGA and one distributed algorithms, DDA which is deterministic, to construct a kmCDS for general k and m. Simulation results are also presented to evaluate our algorithms and the results show that our algorithms have better performances than the exiting other algorithms.

Information Technology Journal, Jan 1, 2010

Proceedings of the 9th ACM international symposium …, Jan 1, 2008

A Connected Dominating Set (CDS) working as a virtual backbone is an effective way to decrease th... more A Connected Dominating Set (CDS) working as a virtual backbone is an effective way to decrease the overhead of routing in a wireless sensor network. Furthermore, a k-Connected m-Dominating Set (kmCDS) is necessary for fault tolerance and routing flexibility. Some approximation algorithms have been proposed to construct a kmCDS. However, most of them only consider some special cases where k = 1, 2 or k ≤ m, or are not easy to implement, or have high message complexity. In this paper, we propose a novel distributed algorithm LDA with low message complexity to construct a kmCDS for general k and m whose size is guaranteed to be within a small constant factor of the optimal solution when the maximum node degree is a constant. We also propose one centralized algorithm ICGA with a constant performance ratio to construct a kmCDS. Theoretical analysis as well as simulation results are shown to evaluate the proposed algorithms.