Clustering and routing of mobile ad hoc networks

Health care industry produces enormous quantity of data that clutches complex information relating to patients and their medical conditions. Data mining is gaining popularity in different research arenas due to its infinite applications and methodologies to mine the information in correct manner. Data mining techniques have the capabilities to discover hidden patterns or relationships among the objects in the medical data. In last decade, there has been increase in usage of data mining techniques on medical data for determining useful trends or patterns that are used in analysis and decision making. Data mining has an infinite potential to utilize healthcare data more efficiently and effectually to predict different kind of disease. This paper features various Data Mining techniques such as classification, clustering, association and also highlights related work to analyse and predict human disease.

Mobile Ad hoc Networks are highly dynamic networks. Quality of Service (QoS) routing in such networks is usually limited by the network breakage due to either node mobility or energy depletion of the mobile nodes. Also, to fulfill certain quality parameters, presence of multiple node-disjoint paths becomes essential. Such paths aid in the optimal traffic distribution and reliability in case of path breakages. Thus, to cater such problem, we present a node-disjoint multipath protocol. The metric used to select the paths takes into account the stability of the nodes and the corresponding links. The proposed technique is also illustrated with an example.

Big Data is the extremely large sets of data that their sizes are beyond the ability of capturing, managing, processing and storage by most software tools and people which is ever increasing day-by-day. In most enterprise scenarios the data is too big or it moves too fast that extremely exceeds current processing capacity. The term big data is also used by vendors, may refer to the technology which includes tools and processes that an organization requires to handle the large amounts of data and storage facilities. This advancement in technology leads to make relationship marketing a reality for today’s competitive world. But at the same time this huge amount of data cannot be analyzed in a traditional manner, by using manual data analysis.  For this, technologies such as data warehousing and data mining have made customer relationship management as a new area where business firms can gain a competitive advantage for identifying their customer behaviors and needs. This paper mainly focuses on data mining technique that performs the extraction of hidden predictive information from large databases and organizations can identify valuable customers and predicts future user behaviors. This enables different organizations to make proactive, knowledge-driven decisions. Data mining tools answer business questions that in the past were too time-consuming, this makes customer relationship management possible. For this in this paper, we are trying explain the use of data mining technique to accomplish the goals of today’s customer relationship management and Decision making for different companies that deals with big data.

International Journal of Mobile Network Communications & Telematics  (IJMNCT)
ISSN: 1839-5678
http://airccse.org/journal/ijmnct/ijmnct.html


Call for papers

      International journal of Mobile Network Communications & Telematics ( IJMNCT) is an  open access peer-reviewed journal that addresses the impacts and challenges of mobile communications and telematics. The journal also aims to focus on various areas such as ecommerce, e-governance, telematics, telelearning 
nomadic computing, data management, related software and hardware technologies, and mobile user services. The journal documents practical
and theoretical results which make a fundamental contribution for the development of mobile communication technologies.

Topics of interest include but are not limited to:

Mobile Computing Software Architectures
Mobile Network Traffic Engineering, Performance & Optimization
Mobile Network Management and Service Infrastructure
Mobile Computing
Integrated mobile marketing communications
Efficacy of mobile communications
Mobile communication applications
Critical success factors for mobile communication diffusion
Metric mobile business enterprise
Mobile communication security issues and requirements
Mobile and handheld devices in the Education
Telematics
Tele-learning
Privacy and Security in Mobile Computing and Wireless Systems
Cross-cultural mobile communication issues
Integration and Interworking of Wired and Wireless Networks
Location management for mobile communications
Distributed Systems Aspects of Mobile Computing
Operating System and Middleware Support for Mobile Computing
Interaction and integration in mobile communications
Business models for mobile communications
E-commerce  & E-governance
Nomadic and Portable communication
Wireless information assurance
Mobile Multimedia Architecture and Network Management
Mobile Multimedia Network Traffic Engineering & Optimization
Mobile Multimedia Infrastructure Developments
Mobile Multimedia Markets & Business Models
Personalization, Privacy and Security in Mobile Multimedia

Paper Submission


Authors are invited to submit papers for this journal through E-mail: [email protected] Or [email protected]. Submissions must be original and should not have been published previously or be under consideration for publication while being evaluated for this Journal.

Important Dates

Submission Deadline    : August 25, 2015
Acceptance Notification : September 25, 2015
Final Manuscript Due    : October 04, 2015

For other details please visit http://airccse.org/journal/ijmnct/ijmnct.html

From the radar and military research world's, the Ultra-WideBand Impulse Radio (UWB-IR) was adopted in the telecommunications world in the 1990'. Currently, the UWB-IR technology is an interesting candidate for close range Wireless Sensors Networks (WSNs). It is particularly attractive for industrial sensor networks due to its resilience to multipath interference, simple transceiver circuitry, accurate ranging ability, and low transmission power. In order to secure data and communications in the Ad-Hoc UWB-IR networks, UWB-IR requires suitable encryption protocols. In this paper, we review and summarize the IEEE 802.15.4 security sub-layer protocol of UWB-IR based Symmetric Key Cryptography scheme. Then, we highlight the different vulnerabilities and weaknesses present in this type of scheme. Finally, we prove, after a deep examination of multiple Public Key Cryptography (PKC) schemes, that the certificateless one is the most suitable for Ad-Hoc UWB-IR networks characterized by nodes mobility. Indeed, we have also evaluated and analyzed the different public key cryptosystems (PKCS) and concluded that NTRU is the most optimum public key cryptosystem to be used with the certificateless scheme in order to secure data and communications in Ad-Hoc UWB-IR Networks. This is due to the fact that it is the fastest PKCS to provide different security levels at a high speed with very constrained resources.

Messages routing over a network is one of the most fundamental concept in communication which requires simultaneous transmission of messages from a source to a destination. In terms of Real-Time Routing, it refers to the addition of a timing constraint in which messages should be received within a specified time delay. This study involves Scheduling, Algorithm Design and Graph Theory which are essential parts of the Computer Science (CS) discipline. Our goal is to investigate an innovative and efficient way to present these concepts in the context of CS Education. In this paper, we will explore the fundamental modelling of routing real-time messages on networks. We study whether it is possible to have an optimal on-line algorithm for the Arbitrary Directed Graph network topology. In addition, we will examine the message routing's algorithmic complexity by breaking down the complex mathematical proofs into concrete, visual examples. Next, we explore the Unidirectional Ring topology in finding the transmission's " makespan " .Lastly, we propose the same network modelling through the technique of Kinesthetic Learning Activity (KLA). We will analyse the data collected and present the results in a case study to evaluate the effectiveness of the KLA approach compared to the traditional teaching method.

International Journal of Ad hoc, sensor & Ubiquitous Computing (IJASUC) is a bi monthly open access peer-reviewed journal provides excellent international forum for sharing knowledge and results in theory, methodology and applications of Ad Hoc & Ubiquitous computing. Current information age is witnessing a dramatic use of digital and electronic devices in the workplace and beyond. Ubiquitous Computing presents a rather arduous requirement of robustness, reliability and availability to the end user. Ad hoc, Sensor  & Ubiquitous computing has received a significant and sustained research interest in terms of designing and deploying large scale and high performance computational applications in real life

A Mobile Ad hoc Network (MANET) is a collection of mobile stations with wireless interfaces which form a temporary network without using any central administration. MANETs are more vulnerable to attacks because they have some specific characteristics as complexity of wireless communication and lack of infrastructure. Hence security is an important requirement in mobile ad hoc networks. One of the attacks against network integrity in MANETs is the Black Hole Attack. In this type of attack all data packets are absorbed by malicious node, hence data loss occurs. In this paper we investigated the impacts of Black Hole attacks on the network performance. We have simulated black hole attacks using Network Simulator 2 (NS-2) and have measured the packet loss in the network without and with a black hole attacks. Also, we measured the packet loss when the number of black hole attacks increases.

Mobile users are expected to demand access to the Internet anywhere and anytime. In a MANET context, a device which is about to connect to external hosts needs the route to the element which communicates the MANET with the Internet. This element is the Internet Gateway. To inform about its presence as well as about some configuration parameters, the Gateway sends MRA messages. In a similar way to ad hoc routing protocols, the Gateway can generate the messages on demand (reactively), periodically (proactively) or combining both previous strategies in a hybrid gateway discovery. Specifically, in the hybrid gateway discovery, the Gateway periodically sends the MRA messages in a restricted area. The nodes that are outside this area demand the Gateway information reactively. This gateway discovery requires the setting of the number of hops that define the proactive area, also called the TTL value. Network performance can be improved when the Gateway uses information such as the position of the sources to adjust the TTL value. In this paper, we transfer the decision about the dimensions of the proactive zone to the mobile nodes so more network conditions are taken into account. Simulation results show that the proposed gateway discovery outperforms other hybrid gateway discovery schemes.

International Journal of Ad hoc, sensor & Ubiquitous Computing (IJASUC) is a bi monthly open access peer-reviewed journal provides excellent international forum for sharing knowledge and results in theory, methodology and applications of Ad Hoc & Ubiquitous computing. Current information age is witnessing a dramatic use of digital and electronic devices in the workplace and beyond. Ubiquitous Computing presents a rather arduous requirement of robustness, reliability and availability to the end user. Ad hoc, Sensor  & Ubiquitous computing has received a significant and sustained research interest in terms of designing and deploying large scale and high performance computational applications in real life.

The use of social networks is still confined to infrastructure-based networks such as the Internet. However, many situations (conferences, fairs, etc.) may require the implementation and rapid deployment of an ad-hoc application for disseminating information: we call this type of application, Ad-hoc Social Network. These applications are necessarily distributed, deployable on mobile units, etc. They therefore inevitably share the same characteristics as those inherent in ad-hoc mobile networks and make them good candidates for their deployment. In this paper, by using techniques from the field of generative programming, we propose an approach to produce environments for generating such applications from their specifications in a domain-specific language. By applying this approach, we have developed SMGenerator, an environment for generating mobile ad-hoc social network applications for Android devices. Moreover by using SMGenerator, we easily generated the ConfInfo application: an ad-hoc social network application for disseminating information to participants in a scientific manifestation.

In this paper, a dynamic K-means algorithm to improve the routing process in Mobile Ad-Hoc networks (MANETs) is presented. Mobile ad-hoc networks are a collocation of mobile wireless nodes that can operate without using focal access points, pre-existing infrastructures, or a centralized management point. In MANETs, the quick motion of nodes modifies the topology of network. This feature of MANETS is lead to various problems in the routing process such as increase of the overhead massages and inefficient routing between nodes of network. A large variety of clustering methods have been developed for establishing an efficient routing process in MANETs. Routing is one of the crucial topics which are having significant impact on MANETs performance. The K-means algorithm is one of the effective clustering methods aimed to reduce routing difficulties related to bandwidth, throughput and power consumption. This paper proposed a new K-means clustering algorithm to find out optimal path from source node to destinations node in MANETs. The main goal of proposed approach which is called the dynamic K-means clustering methods is to solve the limitation of basic K-means method like permanent cluster head and fixed cluster members. The experimental results demonstrate that using dynamic K-means scheme enhance the performance of routing process in Mobile ad-hoc networks.

A mobile ad-hoc network (MANET) is a self structured infrastructure less network of mobile devices connected by wireless. Each device in a MANET is free to move independently in any direction, and will therefore change its links to other devices frequently. Load balancing is a technique to share out workload across network links, to achieve maximize throughput, minimize response time, and avoid overload. Load imbalance is a one of the critical issue in the ad-hoc network. Particle Swarm Optimization (PSO) method is used to implement our proposed technique. In this Paper two algorithms are used for balancing the nodes in the network. Identify the unfair nodes location next allocate and balance the load between the nodes in the network. The simulation results show that this approach is more effective in terms of packet delivery ratio, average end-to-end delay, load distribution, packet delay variation, packet reordering, and throughput. KEYWORDS dynamic MANET on-demand(DYMO);Lifetime prediction; Link lifetime (LLT); mobile ad hoc networks (MANETs);route discovery; particle swarm optimization(PSO).

Mobile Ad hoc Networks (MANETs) are wireless networks consisted of mobile free nodes that can move anywhere at any time without the need to any fixed infrastructure or any centralized administration. In this category of networks existing nodes must rely on each other to play the role of routers or switches instead of using central ones. The self-organized nature of such environments made MANETs vulnerable against many security threats. As a result, providing security requirements in MANETs is one of the most interesting challenges in such a network. In this group of networks, the use of cryptographic solutions is one of the most interesting security issues. The importance of this scientific area in MANETs is more drastic by considering that mentioned schemes must be lightweight enough to be appropriate for resource constrained platforms in such environment. This paper has tried to represent the position of cryptographic issues in MANETs. Moreover, security issues in mobile Ad hoc networks beside of different classes of public key cryptosystems have been introduced.

This paper presents a novel fuzzy-based intelligent architecture that aims to find relevant associations between services provided by devices and embedded agents residing in Ambient Intelligent Environments (AIEs). The embedded agents perform two processes where the first process monitors the inhabitants of the AIE and learns their behaviors in an online, non-intrusive and life-long fashion. The second process then evaluates the relevance and significance of the associations to various services and eliminates the redundant associations in order to minimize the agent computational latency within the AIE. We will present real world experiments that were conducted in the Essex intelligent Dormitory (iDorm) to evaluate and validate the significance of the proposed architecture.

This Search engine became omnipresent means for ingoing to the web. Spamming Search engine is the technique to deceiving the ranking in search engine and it inflates the ranking. Web spammers have taken advantage of the vulnerability of link based ranking algorithms by creating many artificial references or links in order to acquire higher-than-deserved ranking n search engines' results. Link based algorithms such as PageRank, HITS utilizes the structural details of the hyperlinks for ranking the content in the web. In this paper an algorithm DBSpamClust is proposed for link spam detection. As showing through experiments such a method can filter out web spam effectively.

• Distributed algorithms of mobile computing • OS and middleware support for mobile computing and networking • Routing, and communication primitives in ad-hoc and sensor networks • Synchronization and scheduling issues in mobile and ad hoc networks • Resource management in mobile, wireless and ad-hoc networks • Data management on mobile and wireless computing • Integration of wired and wireless networks • Broadband access networks • Energy saving protocols for ad hoc and sensor networks • Complexity analysis of algorithms for mobile environments • Information access in wireless networks • Algorithms and modeling for tracking and locating mobile users • Satellite communications • Cryptography, security and privacy of mobile & wireless networks

• Distributed algorithms of mobile computing • OS and middleware support for mobile computing and networking • Routing, and communication primitives in ad-hoc and sensor networks • Synchronization and scheduling issues in mobile and ad hoc networks • Resource management in mobile, wireless and ad-hoc networks • Data management on mobile and wireless computing • Integration of wired and wireless networks • Broadband access networks • Energy saving protocols for ad hoc and sensor networks • Complexity analysis of algorithms for mobile environments • Information access in wireless networks • Algorithms and modeling for tracking and locating mobile users • Satellite communications • Cryptography, security and privacy of mobile & wireless networks

This paper tries to find an easy method for solving the problem of routing in computer network where the network is using multigraph. This is done mainly using comparison of weight or cost of various multi arcs between any two nodes. This theory can be implemented in real life to solve Network Routing Problem in Multigraph.

Decision making both on individual and organizational level is always accompanied by the search of other’s opinion on the same. With tremendous establishment of opinion rich resources like, reviews, forum discussions, blogs, micro-blogs, Twitter etc provide a rich anthology of sentiments. This user generated content can serve as a benefaction to market if the semantic orientations are deliberated. Opinion mining and sentiment analysis are the formalization for studying and construing opinions and sentiments. The digital ecosystem has itself paved way for use of huge volume of opinionated data recorded. This paper is an attempt to review and evaluate the various techniques used for opinion and sentiment analysis.