Breast Cancer is a common dangerous disease for women. Around the world, many women have died due to Breast cancer. However, in the initial stage, the diagnosis of breast cancer can save women's life. To diagnose cancer in the breast tissues, there are several techniques and methods. The image processing, machine learning, and deep learning methods and techniques are presented in this paper to diagnose the breast cancer. This work will be helpful to adopt better choices and reliable methods to diagnose breast cancer in an initial stage to save a women's life. To detect the breast masses, microcalcifications, and malignant cells,different techniques are used in the Computer-Aided Diagnosis (CAD) systems phases like preprocessing, segmentation, feature extraction, and classification. We have reported a detailed analysis of different techniques or methods with their usage and performance measurement. From the reported results, it is concluded that for breast cancer survival, it is essential to improve the methods or techniques to diagnose it at an initial stage by improving the results of the Computer-Aided Diagnosis systems. Furthermore, segmentation and classification phases are also challenging for researchers for the diagnosis of breast cancer accurately. Therefore, more advanced tools and techniques are still essential for the accurate diagnosis and classification of breast cancer.
Curtailing the information loss due to network partitioning is imperative for the reliable communication in a distributed hash table (DHT)-based routing protocol for mobile ad hoc networks (MANETs). Both the limited transmission range and mobility of nodes cause recurrent network partitioning in MANETs that leads to an inaccessibility of the nodes' mapping information, loss of the LID space, and partitioning of the DHT structure. To address the above-mentioned issues, this paper proposes a protocol that employs pre-partitioning measures, such as the critical link/node detection, the replication of the nodes' mapping information, and so on, to augment the inter-node communication, but also reflects substantial improvement in the lookup delay. The proposed protocol effectively exploits the local neighbor information in a 3-D logical structure to identify/detect the critical nodes by employing a localized distributed algorithm. Simulation results show the significance of the proposed protocol in terms of end-to-end lookup delay, routing overhead, and success ratio.