Volume-4 (Next Generation Computing Technologies)
- Citation
- Abstract
- Reference
- Full PDF
Paper Type | : | Research Paper |
Title | : | Energy Hole And Coverage Holes Avoidance In Uwsn Using Dynamic Scheduling Algorithm |
Country | : | India |
Authors | : | Revathi.T || Buvaneswari.M |
Abstract: This paper aims to identify optimal deployment locations of the given sensor nodes with a pre-specified sensing range, and to schedule them such that the network lifetime is maximum with the required coverage level. Since the upper bound of the network lifetime for a given network can be computed mathematically, this knowledge is used to compute locations of deployment such that the network lifetime is maximum paper. In this paper ultimate goal is to realize an automated monitoring network so that detection applications of various emergency events can be practically implemented. Further, the nodes are scheduled to achieve this upper bound. This proposed system uses artificial bee colony algorithm and particle swarm optimization for sensor deployment problem.............
Keywords -UWSN, Sensor Deployment, Energy Hole, Sensor Scheduling, ABC algorithm, ANT Colony Algorithm, PSO algorithm
[1]. Irfan Azam,Nadeem Javaid"Balanced Load Distribution with Energy Hole Avoidance in Underwater" Communications Magazine, IEEE, vol. 5, Published on 27 January 2017.
[2]. Fatih Sene,Kemal Akkaya,Turgay Yilma, "Autonomous Deployment of Sensors for Maximized Coverage and Guaranteed Connectivity in Underwater Acoustic Sensor Networks", 38th Annual IEEE Conference on Local Computer Networks,2013.
[3]. Tiansi Hu,Yunsi Fei, "DSH-MAC: Medium Access Control Based on Decoupled and Suppressed Handshaking for Long-delay Underwater Acoustic Sensor Networks," 10 March 2014.
[4]. Fahad Ahmad Khan,Saad Ahmad Khan,"Scheduling Multiple Mobile Sinks in Underwater Sensor Networks" 07 January 2016.
[5]. Bilal Gonen,Kemal Akkayaand Fatih Senel, "Efficient Camera Selection for Maximized Target Coverage in Underwater Acoustic Sensor Networks" in Networking 07 January 2016.
- Citation
- Abstract
- Reference
- Full PDF
Paper Type | : | Research Paper |
Title | : | Enhanced Saliency Based Ulcer Detection Model Using Multigraph Clustering Algorithm |
Country | : | India |
Authors | : | Dharani.S || Buvaneswari.M |
Abstract: Image segmentation is the process of obtaining particular regions from the images. Edge detection identifies the edge points around the needed objects. Contour extraction refers to outlining the segmented portion from the image. In order to make the method practically useful in hospital clinical trials, further tests using a much larger number of datasets are critical to validate the effectiveness and the robustness of the WCE images. Furthermore, this study is proposed to implement efficient ulcer recognition task for the WCE images such as bleeding, ulcer using different dataset. In this paper, analysis a novel saliency estimation method that takes advantage of the superpixel segmentation method and the image contrast information (texture and color contrasts). In this proposed method is based on the multi-level superpixel representation to avoid deficiency of pixel representation in the saliency region detection. The proposed multi-level superpixel segmentation method is considered as a superior alternative..........
Keywords: Image segmentation, Digital Image Processing, Superpixel Segmentation, Clustering, K-Fuzzy Logic.
[1]. Charisis, L. Hadjileontiadis, and G. Sergiadis, "Enhanced ulcer recognition from capsule endoscopic images using texture analysis," New Advances in the Basic and Clinical Gastroenterology, pp. 185– 210, 2012. V. S. Charisis, L. J. Hadjileontiadis, J. Barroso, and G. D. Sergiadis, "Intrinsic higher-order correlation and lacunarity analysis for wce-based ulcer classification," in Computer-Based Medical Systems (CBMS), 2012 25th International Symposium on. IEEE, 2012, pp. 1–6.
[2]. M. Appleyard, Z. Fireman, A. Glukhovsky, H. Jacob, R. Shreiver, S. Kadirkamanathan, A. Lavy, S. Lewkowicz, E. Scapa, R. Shofti, P. Swain, and A. Zaretsky, "A randomized trial comparing wireless capsule endoscopy with push enteroscopy for the detection of smallbowel lesions," Gastroenterology, vol. 119, no. 6, pp. 1431 – 1438, 2000.
[3]. B. Upchurch and J. Vargo, "Small bowel enteroscopy," Reviews in gastroenterological disorders, vol. 8, no. 3, p. 169177, 2008.
[4]. M. Manno, R. Manta, and R. Conigliaro, "Single-balloon enteroscopy," in Ileoscopy, A. Trecca, Ed. Springer Milan, 2012, pp. 79–85.
[5]. G. Iddan, G. Mern, A. Glukhovsky, and P. Swain, "Wireless capsule endoscopy," Nature, vol. 405, p. 417, 2000..
- Citation
- Abstract
- Reference
- Full PDF
Paper Type | : | Research Paper |
Title | : | Distributed Mobile Cloud Computing With Module for Secure Big Data |
Country | : | India |
Authors | : | M.Sripriya M.Sc. |
Abstract: mobilecloud computing applications. To ensure a correctness of users' data in the mobile cloud, our study an effective and secure distributed model including a Self-Proxy Server (SPS) with self-created algorithm. The model resolves a communication Mobile cloud computing provides a novel ecommerce mode for organizations without any upfront investment. Since cloud computing uses distributed resources in open environment, it is important to provide secure keys to share the data for developing bottleneck due to re-encryption of a shared data in the cloud whenever users are revoked. It offers to reduce security risks and protect their resources because a distributed SPS dynamically interacts with Key Manager (KM) when the mobile users take on cloud services. This paper describe a survey of comprehensive mobile cloud design which provides an effective and secure mobile cloud computing services on mobile devices.
Keywords- Mobile Cloud Database, SPS, Key Management,, Multi key Distribution, Self Proxy.
[1]. R. Buyya, C. S. Yeo, S. Venugopal, J. Broberg, and I. Brandic, ―Cloud computing and emerging it platforms: Vision, hype, and reality for delivering computing as the 5th utility,Future Generation Comput. Syst., vol. 25, no. 6, pp. 599–616, 2009.
[2]. T. Mather, S. Kumaraswamy, and S. Latif, Cloud Security and Privacy: An Enterprise Perspective on Risks and Compliance. Sebastopol, CA, USA: O"ReillyMedia, Inc., 2009.
[3]. H.-L. Truong and S. Dustdar, ―Composable cost estimation and monitoring for computational applications in cloud computing environments, Procedia Comput. Sci., vol. 1, no. 1, pp. 2175–2184, 2010.
[4]. E. Deelman, G. Singh, M. Livny, B. Berriman, and J. Good, ―The cost of doing science on the cloud: The montage example, in Proc. ACM/IEEE Conf. Supercomputing, 2008, pp. 1–12.
[5]. H. Hacig€ um€ u¸ s, B. Iyer, and S. Mehrotra, ―Providing database as a service,‖ in Proc. 18th IEEE Int. Conf. Data Eng.,Feb.2002, pp. 29–38.
- Citation
- Abstract
- Reference
- Full PDF
Paper Type | : | Research Paper |
Title | : | A Comparative Study of Genetic Algorithm and Particle Swarm Optimization |
Country | : | India |
Authors | : | Mrs.D.Shona || Dr.M.Senthilkumar || S.Valarmathi || G.Malathy |
Abstract: Among different search and optimization techniques, the development of Evolutionary Algorithms (EA) has gained large attention in the field of research and EA acts as an effective method for solving various optimization problems. Genetic Algorithm (GA) is an adaptive metaheuristic optimization algorithm which is mainly based on the theory of Natural Selection and Genetics. GA can be mainly used in various areas such as Neural Networks, Image Processing, Vehicle routing problems and so on. The drawback of the GA is, it is of high cost. Particle Swarm Optimization (PSO) which is also a kind of metaheuristic optimization algorithm based on the social behavior of organisms which possess swarming characteristics. PSO and the GA are very closely associated population based search methods where both advances from a set of points to another set of points in an iteration providing..........
Keywords: Evolutionary Algorithm (EA), Genetic Algorithm (GA), Metaheuristics, Particle Swarm Optimization (PSO).
[1]. J.H.Holland, -Genetic algorithms and the optimal allocation of trials, SIAM Journal of Computing, Vol.2, no.2, pp. 88-105, 1973.
[2]. Kennedy, J. and Eberhart, R., "Particle Swarm Optimization", Neural Networks, 1995.Proceedings of the IEEE International Conference on Neural Networks, Perth, WA, Australia , Vol. 4, pp. 1942-1948, 1995.
[3]. A.Engelbrecht, -Fundamentals of computational swarm intelligence, 2006, Hoboken: John Wiley & Sons, Ltd.
[4]. N.Nedjah, L. dos Santos Coelho, and L.de MacedoMourelle, - Multiobjective swarm intelligent systems: theory & experiences. Springer Science & Business Media, 2009, vol.261.
[5]. A.Kumar, A.Khosla, J.S.Saini and S.Singh,- Meta-heuristic range based node localization algorithm for wireless sensor networks, in localization and GNSS (ICLGNSS), 2012 International Conference on IEEE, 2012 , pp.1-7.
- Citation
- Abstract
- Reference
- Full PDF
Paper Type | : | Research Paper |
Title | : | Significance of Software Engineering Techniques For Development Of Business Model |
Country | : | India |
Authors | : | Shriram S. Zade |
Abstract: Software engineers systematically organised the essence of all past programming experience and created various types of techniques, methodology and discipline. In other words they took efforts to produce software product by systematic manner, cost effectively with engineering approach. Software products are prepared very carefully by considering all possibilities and relevant parameters. This software used for most of the trusted and sensitive areas & people rely on the output of the software. The Business model is the conceptual structure. It is supporting the feasibility of a business. The contents of business model are its purpose, its goals and its ongoing plans for achieving them.............
Keywords: Coding, Engineering, Feasibility, Plan, Specifications.
[1] Waman Jawdekar ,"Software Engineering Principle & Practices" , Tata McGraw Hill
[2] Rajib Mall , "Fundamentals of Software Engineering", Prentice Hall of India
[3] S. K. Chauchan ,"Fundamentals of Computer Programming & Information Technology", S. K. Kataria & Sons Publications
[4] Y. P. Singh, "Accounting & Financial Management for I.T. professionals" , Age International
[5] K C Shekhar, & Lakshmy Shekhar, "Banking Theory & Practice", Vikas Publishing.
- Citation
- Abstract
- Reference
- Full PDF
Paper Type | : | Research Paper |
Title | : | Design New Secure Hybrid Hierarchical Link State Routing Protocol (Shhls) For Manet |
Country | : | India |
Authors | : | K.Thamizhmaran |
Abstract: Current research developing year's lot of young research's interested in Mobile Ad-hoc Networks (MANET's) a collection of independent mobile nodes dynamically form a network connection temporarily without any base station of static infrastructure. The self-configuring ability of nodes in MANETs made it popular among critical applications like military use or natural emergency recovery. Most of the proposed protocols assume that all nodes in the network are cooperative, and do not address any security issue. To adjust to such trend, it is vital to address its potential security issues. The main objective of this paper is design new secure routing protocol namely, Secure Hybrid Hierarchical............
Keywords: MANET, Security issues, Routing Protocol, ZHLS, SHHLS, NS2..
[1]. C.E. Perkins, et al. ―Quality of Service in Ad Hoc on-Demand Distance Vector Routing‖, IETF Internet draft, 2001.
[2]. Y. Hu, et al. ―SEAD: Secure efficient distance vector routing for mobile wireless ad hoc networks‖, in Proc. 4th IEEE Workshop Mobile Computer System Application, 2002, pp.3–13.
[3]. Yian Huang, et al ―A Cooperative intrusion detection System for Ad Hoc Networks‖ Proceeding of the 1st ACM workshop on security of ad-hoc and sensor networks, pp. 135-147, 2003.
[4]. Yang, et al ―Security in mobile ad-hoc Network: challenges and solutions‖ IEEE wireless Communications, pp. 38-47, 2004.
[5]. Anand Patwardhan and Iorga, Secure routing and Intrusion Detection in Ad-hoc networks, in Proc. 3rd Int. Conf. Pervasive Computer Communication, pp.191–199, 2005..
- Citation
- Abstract
- Reference
- Full PDF
Paper Type | : | Research Paper |
Title | : | Secure And Energy Efficient Data Aggregation Routing Protocol To Reduce Congestion in Wireless Sensor Network |
Country | : | India |
Authors | : | C.Priyadarsini || Dr.R.Prema |
Abstract: Due to the development of information technology, data transmission plays a significant role in communication .Wireless Sensor networks are one such communication paradigm. WSN consists of a large number of battery-powered wireless sensor nodes and one key issue in WSNs is to reduce the energy consumption while maintaining the normal function of WSNs .Data aggregation scheme that reduces a large amount of transmission is the most practical technique. Data aggregation as a typical operation in data gathering application can cause a lot of energy wastage since sensor nodes, when not receiving data may keep in the listen state during the data collection process. This research work proposes to minimize the end to end delay. The conventional algorithm queuing aid employed for multiple path, shortest path and energy efficient with low latency performance metrics...........
Keywords— Dataaggregation, End to end delay, Energyrouting, Queuing algorithms,Wireless sensor Networks
[1]. M. Rabbat, J. Haupt, A. Singh, R. Nowak, Decentralized compression and predistribution via gossiping, in: Proceedings of IEEE International Conference on Information Processing in Sensor Networks, 2006, pp. 51–59.
[2]. C. Luo, F. Wu, J. Sun, C.W. Chen, Compressive data gathering for large-scale wireless sensor networks, in: Proceedings of the 15th Annual International Conference on Mobile Computing and Networking, 2009, pp. 145–156.
[3]. J. Wang, S. Tang, B. Yin, X.-Y. Li, Data gathering in wireless sensor networks through intelligent compressive sensing, in: Proceedings of IEEE International Conference on Computer Communications (INFO-COM‟12), 2012, pp. 603–611.
[4]. M. Rabbat, J. Haupt, A. Singh, R. Nowak, Decentralized compression andpredistribution via randomized gossiping, in: Proceedings of IEEE International Conference on Information Processing in Sensor Networks,2006, pp. 51–59.
[5]. C. Luo, F. Wu, J. Sun, C.W. Chen, Compressive data gathering for large-scale wireless sensor networks, in: Proceedings of the 15th Annual International Conference on Mobile Computing and Networking, 2009,pp. 145–156
- Citation
- Abstract
- Reference
- Full PDF
Paper Type | : | Research Paper |
Title | : | Evolution of A Dual-Level Gene Selection Technique That Integrate A Novel Composite Approach Using The Cuckoo Optimization Algorithm And Harmony Search For Cancer Classification |
Country | : | India |
Authors | : | R.Kalai vani || S.Subhasini |
Abstract: For each cancer type, only slight genes are descriptive. The gene selection job remains a challenging one. To conquered this problem, we propose a dual-level gene selection Technique called MRMR-COA-HS. In the first level, the minimum redundancy and max-imam relevance (MRMR) feature selection is used to choose a subset of relevant genes. The preferred genes are then fed into a covering setup that incorporate a new algorithm, COA-HS, using the support vector machine as a classifier. The technique was enforced to four microarray datasets, and the performance was analyzed by the leave one out cross-acceptance method. Provisional performance analysis of the pro-posed method with other evolutionary algorithms recommended that the proposed algorithm powerful outperforms other technique in choosing a less number of genes while preserving the largest classification accuracy. The techniques of the used genes were further investigated, and it was validated that the selected genes are biologically relevant to each cancer type
Keywords
1. Gene selection
2. Minimum redundancy and maximum relevance (MRMR)
3. Evolutionary algorithms
4. Cuckoo optimization algorithm
5. Harmony search algorithm
[1]. T.R. Golub, D.K. Slonim, P. Tamayo, C. Huard, M. Gaasenbeek, J.P. Mesirov, et al., Molecular classification of cancer: class discovery and class prediction by gene expression monitoring, Science 286 (1999) 531–537, http://dx.doi.org/ 10.1126/science.286.5439.531.
[2]. E. Blaveri, J.P. Simko, J.E. Korkola, J.L. Brewer, F. Baehner, K. Mehta, et al., Bladder cancer outcome and subtype classification by gene expression, Clin. Cancer Res. 11 (2005) 4044–4055, http://dx.doi.org/10.1158/1078-0432.CCR-04-2409.
[3]. Z. Cai, R. Goebel, M.R. Salavatipour, G. Lin, Selecting dissimilar genes for multi-class classification, an application in cancer subtyping, BMC Bioinformatics 8 (2007) 206, http://dx.doi.org/10.1186/1471-2105-8-206.
[4]. R. Wesolowski, B. Ramaswamy, Gene expression profiling: changing face of breast cancer classification and management, Gene Expr. 15 (2011) 105–115, http://dx.doi.org/10.3727/105221611X13176664479241.
[5]. H. Hijazi, C. Chan, A classification framework applied to cancer gene expression profiles, J. Healthc. Eng. 4 (2013) 255–283, http://dx.doi.org/10.1260/2040-2295.4.2.255.
- Citation
- Abstract
- Reference
- Full PDF
Paper Type | : | Research Paper |
Title | : | A Survey Paper on Text Mining - Techniques, Applications And Issues |
Country | : | India |
Authors | : | Mrs.B.Meena Preethi || Dr.P.Radha |
Abstract: Rapid progress in digital data acquisition techniques have led to huge volume of data. More than 80 percent of today's data is composed of unstructured or semi-structured data. The recovery of similar patterns and trends to see the text data from huge volume of data is a big issue. Text mining is a process of extracting interesting and nontrivial patterns from huge amount of text documents. There lies many techniques and tools to mine the text documents and discover the information for future and process in decision making. The choice of selecting the right and appropriate text mining technique helps to recover the speed and slows the time and effort required to get valuable information.This paper briefly discusses and analyze the text mining techniques and their applications. With the advancement..........
Keywords: Classification; Text Mining Algorithm; Knowledge Discovery; Applications; Information Extraction; Information Retrieval; Patterns
[1]. Mrs. SayantaniGhosh, Mr. Sudipta Roy, and Prof. Samir K. Bandyopadhyay. ―A tutorial review on Text Mining Algorithms‖, in International Journal of Advanced Research in Computer and Communication Engineering, volume-1 issue-42012.
[2]. Vishal Gupta, Gurpreet S. Lehal, 2009. ―A Survey of Text Mining Techniques and Applications‖ in Journal of Emerging Technologies in Web Intelligence, Vol. 1 No. 1.
[3]. Shiqun Yin Yuhui Qiu1,ChengwenZhong, 2007. Web Information Extraction and Classification Method .IEEE
[4]. I. H. Witten, K. J. Don, M. Dewsnip, and V. Tablan, ―Text mining in a digital library,‖ International Journal on Digital Libraries, vol. 4, no. 1,pp. 56–59, 2004.
[5]. B. L. Narayana and S. P. Kumar, ―A new clustering technique on text in sentence for text mining,‖ IJSEAT, vol. 3, no. 3, pp. 69–71, 2015. httpS://sourceforge.net/projects/scipy/
- Citation
- Abstract
- Reference
- Full PDF
Paper Type | : | Research Paper |
Title | : | Precious Solution Regulation in Active Wireless Sensor Networks |
Country | : | India |
Authors | : | Ms.P.Subha || Mrs.S.Jayabharathi |
Abstract: Now days, Wireless sensor networks (WSNs) are widely used in wide variety of application so to improve security for WSNs and to protect the WSNs from various attack uses key management which is an effective way. A suitable encryption key protocol are used to secure data and communication .In this paper, a certificate less – effective key management (CL-EKM) protocol is proposed to have secure communication in dynamic WSNs characterized by node mobility. The CL-EKM protocol supports an economical communication for key updates and manages once a node joins or leaves a cluster and ensures forward and backward key secrecy. A protocol also supports key revocation for compromised nodes and to minimize the impact of a node compromise on the protection of alternative communication links. The security analysis states that CL-EKM protocol is effective in defensive against varied attacks.
Keywords – Wireless sensor networks, Certificate less public key cryptography, Key management schema
[1]. Tao Shu and Marwan Krunz, Fellow,IEEE "Privacy-Preserving and Truthful Detection of Packet Dropping Attacks in Wireless Ad Hoc Networks", IEEE TRANSACTIONS ON MOBILE COMPUTING. VOL. 14, Issue NO. 4, pp 813-828- APRIL 2015.
[2]. Xu Li, Rongxing Lu, Xiaohui Liang, and Xuemin (Sherman) Shen, "Side Channel Monitoring: Packet Drop Attack Detection in Wireless Ad Hoc Networks", IEEE ICC international conference on communication,11year 2011.
[3]. Yu Zhang, Loukas Lazos, Member, IEEE, and William Jr. Kozma. "AMD: Audit-Based Misbehavior Detection in Wireless Ad Hoc Networks", IEEE TRANSACTIONS ON MOBILE COMPUTING, VOL. 15, NO. 8, pp1893-1907-AUGUST 2016.
[4]. Vijayakumar.Aa*, Selvamani Kb*, Pradeep kumar Aryac," Reputed Packet Delivery using Efficient Audit Misbehaviour Detection and Monitoring Method in Mobile Ad Hoc Networks,". ELSEVIER procedia computer science. VOL. 48, pp485-495- 2015
[5]. Mohammad Taqi Soleimani, Mahboubeh Kahvand, "Defending Packet Dropping Attacks Based on Dynamic Trust Model in Wireless Ad Hoc Networks" ,Mediterranean electrotechnical conference. Vol. 13, pp362-366- 16 April 2014.
- Citation
- Abstract
- Reference
- Full PDF
Paper Type | : | Research Paper |
Title | : | Personalized Travel Sequence Recommendation on Multi Source Big Social Media |
Country | : | India |
Authors | : | N.Krishnan || S.Sathyapriya || Dr.D.Anitha |
Abstract: Big Data Increasingly Benefit Both Research And Industrial Area Such As Health Care, Finance service and commercial recommendation.This paper presents a personalized travel sequence recommendation from both travelogues and community-contributed photos and the heterogeneous metadata (e.g., tags, geo-location, and date taken) associated with these photos. Unlike most existing travel recommendation approaches, user approach is not only personalized to user's travel interest but also able to recommend a travel sequence rather than individual Points of Interest (POIs). Topical package space including representative tags, the distributions of cost, visiting time and visiting season of each topic, is mined to bridge the vocabulary..........
[1] H. Liu, T. Mei, J. Luo, H. Li, and S. Li, "Finding perfect rendezvous on the go: accurate mobile visual localization and its applications to routing," in Proceedings of the 20th ACM international conference on Multimedia. ACM, 2012, pp. 9–18.
[2] J. Li, X. Qian, Y. Y. Tang, L. Yang, and T. Mei, "Gps estimation for places of interest from social users‟ uploaded photos," IEEE Transactions on Multimedia, vol. 15, no. 8, pp. 2058–2071, 2013.
[3] S. Jiang, X. Qian, J. Shen, Y. Fu, and T. Mei, "Author topic model based collaborative filtering for personalized poi recommendation," IEEE Transactions on Multimedia, vol. 17, no. 6, pp. 907–918,2015.
[4] J. Sang, T. Mei, and C. Sun, J.T.and Xu, "Probabilistic sequential pois recommendation via check-in data," in Proceedings of ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems. ACM, 2012.
[5] . Y. Zheng, L. Zhang, Z. Ma, X. Xie, and W. Ma, "Recommending friends and locations based on individual location history," ACM Transactions on the Web, vol. 5, no. 1, p. 5, 2011..
- Citation
- Abstract
- Reference
- Full PDF
Paper Type | : | Research Paper |
Title | : | Angle Based Outlier Detection in Big Data Analytics |
Country | : | India |
Authors | : | Ms.R.Divya || Mr.S.S.Saravana Kumar |
Abstract: In this paper will tackle the challenges of big data analytics in the algorithmic aspects. To handle design and evaluate scalable and efficient algorithms that are able to handle complex data analysis tasks, involving big datasets without extreme use of computational resources. In wide range of application domains, data are represent as high-dimensional vectors in the Euclidean space in organize to benefit from computationally advanced techniques from numerical linear algebra. Our solutions have leveraged simple but fast randomized numerical linear algebra techniques to approximate essential properties of data, such as data norm, pairwise Euclidean distances and dot products. These relevant and useful approximation properties will be used to explain fundamental data analysis tasks in data mining, machine learning and information recovery.
Keywords: Big data, Analytics Tools, ABOD, Algorithm, Dataset, Experiments
[1]. M. Charikar. Similarity estimation techniques from rounding algorithms. In Proceedings of STOC'02, pages 380 388, 2002.
[2]. A.Das, M. Datar, A. Garg, and S. Rajaram. Google news personalization: scalable online collaborative filtering. In Proceedings of WWW'07, pages 271 280, 2007.A
[3]. Hinneburg, C. C. Aggarwal, and D. A. Keim. What is the nearest neighbor in high dimensional spaces? In Proceedings of VLDB'00, pages 506 515, 2000.
[4]. P. Indyk and A. McGregor. Declaring independence via the sketching of sketches. In Proceedings of SODA'08, pages 737 745, 2008.
[5]. P. Li and A. C. Konig. b-bit minwise hashing. In Proceedings of WWW'10, pages 671 680, 2010.
- Citation
- Abstract
- Reference
- Full PDF
Paper Type | : | Research Paper |
Title | : | A Multipath Energy DSR Routing Protocols for MANET |
Country | : | India |
Authors | : | SulaimanGhaleb || `Salem Ba Hmaid || Gameil Ali || Dr. V. Vasanthi |
Abstract: Dynamic Source Routing protocol (DSR) has been considered itself as one of the discrete and predominant routing protocols for Mobile Ad Hoc Networks (MANETs). DSR used to find the path from source node to destination node only when the source startsthe process ofroute discovery and it makes the network as self-organizing and self-configuring. Basically the DSR contains two mechanisms, Route Discovery and Route Maintenance. Route discovery in which DSR decides a new path from one node to another; and route maintenance, in which DSR used to realize and rectifies broken routes, and then the process of sending and receiving will start between the nodes to find out the optimal path.DSR uses route caching to reduce the routing overhead and latency during process of route discovery. DSR suffers from damage of the energy depletion because it doesn't take the term of energy consumption as parameter into consideration at all.In this paper we are giving a general review about...........
[1]. Mahantesh.H.M , Shivakeshi.C, el at. " Optimization of Link Cache in DSR over MANETs" International Journal of Computer Science Trends and Technology (I JCS T) – Volume 4 Issue 3, May - Jun 2016.
[2]. Rachna Sharma, NehaGoyal "Ant Colony Optimization in Dynamic Source Routing Protocol" International Journal of Science, Engineering and Technology Research (IJSETR), ISSN: 2278 – 7798,Volume 5, Issue 5,May 2016
[3]. Roy Leung, Jilei Liu, Edmond Poon,et al." MP-DSR: A QoS-aware Multi-path Dynamic Source Routing Protocol for Wireless Ad-Hoc Networks ,"Department of Electrical and Computer Engineering University of Toronto, pages 2-10, 2001.
[4]. De Rango F, Lonetti P and Marano S. " MEA-DSR: A Multipath Energy-aware Routing Protocol for Wireless Ad Hoc Networks" in IFIP International Federation for Information Processing, Advances in Ad hoe Networking, eds. Cucnca, P., Guerrcro C., Puigjaner, R., Serra, B., (Boston: Springer), vol. 265, pp. 215- 225, 2008.
[5]. EhsanKhosrowshahiAsl, MortezaDamanafshany, MaghsoudAbbaspour,MajidNoorhosseiniz and Kamran Shekoufandeh. EMP-DSR: An Enhanced Multi-Path Dynamic Source Routing Algorithm for MANETs Based on Ant Colony Optimization, Computer Engineering and IT Department, Amirkabir University of Technology,pp.3-6.2009