A model for congestion control control of transmission control protocol in mobile wireless ad hoc networks

Transmission Control Protocol (TCP) is a fundamental protocol in the TCP/IP Protocol Suite.TCP was well designed and optimized to work over wired networks where most packet loss occurs due to network congestion.In theory, TCP should not care whether it is running over wired networks, WLANs, or Mobile Ad hoc Networks (MANETs).In practice, it does matter because most TCP deployments have been carefully designed based on the assumption that congestion is the main factor of network instability.However, MANETs have other dominating factors that cause network instability. Forgetting the impact of these factors violates some design principles of TCP congestion control and open questions for future research to address.This study aims to introduce a model that shows the impact of MANET factors on TCP congestion control.To achieve this aim, Design Research Methodology (DRM) proposed by BLESSING was used as a guide to present this model. The proposed model describes the existing situation of TCP congestion control.Furthermore, it points to the factors that are most suitable to be addressed by researchers in order to improve TCP performance.This research proposes a novel model to present the impact of MANET factors on TCP congestion control.The model is expected to serve as a benchmark for any intended improvement and enhancement of TCP congestion control over MANET

Review of name resolution and data routing for information centric networking

Information Centric Networking (ICN) a future Internet, presents a new paradigm by shifting the current network to the modern network protocols. Its goal, to improve the traditional network operations by enabling ICN packet routing and forwarding based on names.This shift will bring advantages, but at the same time, it is leading to a big challenge on routing approaches to implement ICN nodes. Routing approaches must use special techniques to publish messages to all the network nodes.Flooding approach is an easy and stateless, however, results in control overhead, depending on the network size.Moreover, designing, implementing, and evaluating routing approaches with higher capacity is really a key challenge in the overall ICN research area, because the state of ICN brings a significant cost; both in packet processing and router storage.Many approaches were proposed in the literatures over these years for the efficient control of forwarding on the network.This paper provides a classification and review of the routing mechanisms that are proposed on six ICN architectures.A summary in tabular form and a comparative study of these six architectures is also given in the paper as well as few open research challenges are highlighted

Security Loop Agents for the Enterprise Applications based on Resource Description Framework

Security loop-holes can cost a fortune to a large enterprise organization providing e-commerce services. Meanwhile, the enterprise applications have been applied widely to simplify and generate better performance in managing the business tasks. Most of these applications (Enterprise Applications) unable to provide a high level of security due to the new daily threats specially when malicious agents entered into agent platforms and destroyed other active agents during the agent performance for client query. Meanwhile, the security issues in these applications left in the system unintentionally but are intruded intentionally. Hence, this study aims to come out with suitable solution for the existing question on how to secure and platform independent environment for the enterprise applications? By designing architecture to provides a secure and platform independent environment for agents' communication

End-to-end networks vs named data network: A critical evaluation

Named data networking or information centric networking is the newest networking paradigm that gives foremost place to the contents in identification and dissemination.On the other hand, the end to end networking paradigm on which the Internet is currently built on places heavy emphasis on devices that make the architecture. The current Internet suffers from many shortcomings due to the misplaced emphasis. In order to overcome some of these deficiencies, researchers and developers have come up with patches and work around that have made the Internet more complex than it ought to be. Named data networking is a clean slate approach in building a network architecture overcoming all the current deficiencies and make it future safe. Several researchers have carried out comparative studies between named data networking and end to end networking. But these studies concentrate only on the features and capabilities of the networking paradigms. This is the first attempt at quantifying the performance the networking architectures experimentally. The authors in this paper present the results of the comparative study carried out experimentally in a simulated environment based on the final throughput. The results have been presented in a graphical form for easy visualization of results

Performance evaluation of the replacement policies for pending interest table

Information (content) plays an important role in a Named Data Networking (NDN). Hence, an information model is essential in representing information appropriately to supports meaningful information spreading. As a distinction from the current network practice, the NDN shall concentrate on the content itself, rather than the location of the information itself. One important and common feature of NDN is leveraging through its built-in network caches (temporal store) to improve the communication and efficiency of content dissemination. Thus, caching is well thought-out as one of the most crucial features (especially in PIT) of the NDN. Its efficiency is due to it required feature of producing a flexible strategy in deciding what content to store and replace when the PIT overflows. Thus, PIT management in NDN continues being one of the primary concerns of high-speed forwarding. To address this issue, replacement policies, as one of the key factors for determining the effectiveness of a PIT in line with many researcher's haven to propose numerous replacement policies, i.e. LRU, Random and Persistent, which have been projected to attain the improved Interest drop rate, reduce the delay and Interest retransmission as when the PIT is full. However, to the best of our knowledge, there have not been studies that dealt with the performance and evaluation between the mentioned policies under different network topologies. Therefore, in this paper we study the performance of Interest drop rate, delay and Interest retransmission under different network topologies, i.e. Tree, Abilene and Germany when the PIT is full. The significance yearned for this study would be to provide a solid starting point in research directions of new PIT replacement policies for contemporary workload or selectively turning off of fewer used cache ways

Assessing Malaysian crowdsourcing platforms using web of system performance (WOSP) model

Crowdsourcing allows organizations and individuals to tap into a large pool of people to accomplish tasks. Recent growth in crowdsourcing has triggered Malaysia to venture into crowdsourcing initiatives. This study intends to assess the performance of crowdsourcing platforms in Malaysia using the Web of System Performance (WOSP) model.The results give insights on the current state of crowdsourcing platforms in Malaysia and highlight the gaps that exist in these platforms. This eventually help to enhance the design of current platforms and promote higher uptake of crowdsourcing among Malaysians

A scalable name resolution system for information centric networking

Information Centric Networking (ICN) is a new paradigm, aimed at shifting to the future Internet from host centric to a content centric approach. ICN focuses on retrieval and dissemination of information between pairwise communications of hosts.Information are organized in the form of Information Objects (IO), known as Named Data Objects (NDO). These NDO are location independent. Objects in ICN are stored in the system overlay; popularly known as Name Resolution System (NRS). NDOs are requested by the Subscribers in the network to get the needed information from the Publishers, through NRS.Thus, the NRS is responsible in forwarding the interest packets based on the names of NDOs.This application of ICN depends on the scalability of the NRS.To design NRS, the most significant issue is scalability due to the ever-increasing number of NDOs.This paper aims to present the issues, by proposing balanced binary tree data structure to organize and store the NDOs. The methodology proposed in this work is thus; for every new insertion in the tree, a Balance Factor (BF) is computed to balance the height of left and right sub-tree.According to our investigation, balanced binary tree provides less searching time when compared to the Distributed Hash Table (DHT) approach.Simulation results show that End-to-End delay decreases by increasing the throughput in the network

5G: The Next Wave of Digital Society Challenges and Current Trends

The Internet that can easily connect global landscape is a fundamental component for business and communication.In the next decade, wireless network 5G will provide native support for a new kind of network infrastructure deployments, including the ultra-dense networks, multiple Radio Access Technology co-existence, direct Device to Device communication and many others.This article explores the new trends and challenges in the new digital wave.Further, it highlights the research areas in each feature and discusses the new approaches to handle huge populated devices demand

Mode selection mechanism to enable effective device-to-device communication system over different environments

Device-to-Device (D2D) communication is an important component of the 5G mobile networks. D2D communication enables users to communicate either directly without network assistance or with minimum signalling information through a base station (BS). Hence, D2D communication can enhance system capacity, increase spectral efficiency, improve throughput and reduce latency. One of the main challenges in D2D communications that when a potential D2D pair can switch between direct and conventional cellular communications, there lies a challenge in identifying D2D mode selection between communicating devices (i.e. a D2D pair). This paper aims to evaluate the mode selection mechanism in different environments (indoor, outdoor). The mode selection mechanism is proposed using multi-criteria for decision-making technique, the mode selection mechanism based on Simple Additive Weighting (SAW) algorithm is used to wisely connect and switch between the available modes. The evaluation of the proposed mechanism for indoor environment and outdoor environment shows better performance based on user preferences

Context-aware Radio Access Technology Selection Approach in 5G Ultra Dense Networks

Ultra dense network (UDN) is the extreme densification of heterogeneous radio access technologies (RATs) that are deployed closely in a coordinated or uncoordinated manner.The densification of RATs forms an overlapping zone of signal coverage, leading user equipment (UE) to frequent signal handovers among the available RATs. Consequently, this degrades the overall system performance.The traditional approach of RAT selection is network-centric and the decision is primarily focused on the signal aspect.However, the next generation of digital wave is a paradigm shift to being user-centric.In this paper, a context-aware multi-attribute RAT (CMRAT) selection approach is proposed to eliminate unnecessary handover of UE among RATs and determine the best RAT as the next point of attachment among the available ones in the UDN. CMRAT integrates the context-aware concept with multi-attribute decision making (MADM) theory in RAT selection.CMRAT is formed with two mechanisms, including, first, a context-aware analytical hierarchy process mechanism to prioritize the criteria for obtaining the weight.Then, a context-aware technique for order preference by similarity to an ideal solution mechanism is employed to choose the best RAT amongst the available RATs.The proposed CMRAT mechanism was implemented and validated using MATLAB.The obtained simulation findings demonstrate that the proposed CMRAT approach outperforms classic MADM methods, namely TOPSIS, SAW, and GRA with respect to the number of handovers and ranking abnormality metrics.Hence, this paper paves the way to choose RAT based on context information comprising network and user preference criteria information