Mahmuda Naznin

Learn More
In an orthogonal drawing of a plane graph each vertex is drawn as a point and each edge is drawn as a sequence of vertical and horizontal line segments. A bend is a point at which the drawing of an edge changes its direction. Every plane graph of the maximum degree at most four has an orthogonal drawing, but may need bends. A simple necessary and sufficient(More)
Network lifetime is one of the important metrics that indicate the performance of a sensor network. Different techniques are used to elongate network lifetime. Among them, clustering is one of the popular techniques. LEACH (Low-Energy Adaptive Clustering Hierarchy) is one of the most widely cited clustering solutions due to its simplicity and effectiveness.(More)
Stability is one of the major concerns in advancement of Wireless Sensor Networks (WSN). A number of applications of WSN require guaranteed sensing, coverage and connectivity throughout its operational period. Death of the first node might cause instability in the network. Therefore, all of the sensor nodes in the network must be alive to achieve the goal(More)
Target tracking is one of the cardinal applications of a wireless sensor network. Tracking multiple targets is more challenging than tracking a single target in a wireless sensor network due to targets’ movement in different directions, targets’ speed variations and frequent connectivity failures of low powered sensor nodes. If all the(More)
Wireless sensor network field has drawn attraction of researchers for its diversified applications. Due to the ad-hoc in nature of sensor network, conventional wireless network algorithms can not be applied directly. There are lot of problems which affect badly network performance and quality of service. Among these problems, lack of good coverage of(More)
Nowadays mobile phones are expected to handle huge volume of multimedia data which is very challenging due to the small memory size of the mobile phone sets. We have developed an application that incorporates a novel technique which uses and enhances the Record Management Store (RMS), a subsystem of Mobile Information Device Profile (MIDP), which not only(More)
In this work, we present a path-planning method for the Mobile Data Collector (MDC) in a wireless sensor network (WSN). In our method, a tour for the M DC is generated such that the latency of delivering data to the sink is reduced. We show that the TSP tour covers all the nodes of the WSN. However, the latency for the TSP tour may be prohibitively high for(More)
—Event detection and notification is a common task in a Wireless Sensor Networks (WSN). Efficient data aggregation and the minimization of energy consumption are the great research challenges in WSN. In WSN, normally the events are detected by more than one node and it is more reliable if the consistent event information is received from more than one node.(More)
In a WSN, it is desirable to keep many sensors active to collect data as much as possible which causes network failure, on the other hand, if most of the sensors are asleep, enough data can not be collected. Therefore, the trade-off between data collection and energy saving has made data gathering an interesting research field. To handle these challenges,(More)
Abstarct We introduce a clustering heuristic based on an effective nearest neighbor search procedure by reducing the TSP (Traveling Saleman Problem) tour length. This technique contributes to the improvement of the TSP solutions and also provides a technique of finding cluster center in a large domain where finding the center point of data clusters is a(More)