A SOLUTION FRAMEWORK FOR MANAGING INTERNET OF THINGS (IOT)

Sukant K. Mohapatra1, Jay N. Bhuyan2, Pankaj Asundi1, and Anand Singh3 

1Ericsson, Monroe, LA, USA 

2Dept. of Comp. Science, Tuskegee, AL, USA 

3CenturyLink, Monroe, LA, USA

ABSTRACT

Internet of Things (IoT) refers to heterogeneous systems and devices (often referred to as smart objects)that connect to the internet, and is an emerging and active area of research with tremendous technological, social, and economical value for a hyper-connected world. In this paper, we will discuss how billions of  these internet connected devices and machines will change the future in which we shall live, communicate and do the business. The devices, which would be connected to the internet, could vary from simple systems on chip (SOC) without any Operating System (OS) to highly powerful processor with intelligent OS with widely varying processing capability and diverse protocol support. Many of these devices can also communicate with each other directly in a dynamic manner. A key challenge is: how to manage such a diverse set of devices of such massive scale in a secured and effective manner without breaching privacy. In this paper, we will discuss various management issues and challenges related to different communication protocol support and models, device management, security, privacy, scalability, availability and analytic support, etc., in managing IoT. The key contribution of this paper is proposal of a reference management system architecture based on cloud technology in addressing various issues related to management of IoT having billions of smart objects.

KEYWORDS

IoT, SOC, M2M, OMA, SOC, CSP, SLA, CoAP, REST

More Details.....

AN ENHANCED SECURITY FOR GOVERNMENT BASE ON MULTIFACTOR BIOMETRIC AUTHENTICATION

Tran Cong Hung1 , Nguyen Thanh Tri1,2 and Ho Nhut Minh3

 1 Post & Telecommunications Institute of Technology, Vietnam 2 Binh Duong Department of Information and Communications, Vietnam 3 Saigon University, Vietnam 

ABSTRACT 

This paper is demonstrating to create a system of multifactor authentication based on biometric verification. Our system use iris for the first factor and fingerprint for the second factor. Once an attacker attempts to attack the system, there must have two factors. If one of them is compromised or broken, the attacker still has at least one more barrier to breach before successfully breaking into the target. Furthermore, this system will be implemented to enhance security for accessing control login government system. 

KEYWORDS

Multifactor authentication (MFA), biometric, iris recognition, fingerprint recognition


More details.....

PERFORMANCE EVALUATION OF DIFFERENT KERNELS FOR SUPPORT VECTOR MACHINE USED IN INTRUSION DETECTION SYSTEM

Md. Al Mehedi Hasan1 , Shuxiang Xu2 , Mir Md. Jahangir Kabir2 and Shamim Ahmad1 

1Department of Computer Science and Engineering, University of Rajshahi, Bangladesh. 

2 School of Engineering and ICT, University of Tasmania, Australia. 

ABSTRACT 

The success of any Intrusion Detection System (IDS) is a complicated problem due to its nonlinearity and the quantitative or qualitative network traffic data stream with numerous features. As a result, in order to get rid of this problem, several types of intrusion detection methods with different levels of accuracy have been proposed which leads the choice of an effective and robust method for IDS as a very important topic in information security. In this regard, the support vector machine (SVM) has been playing an important role to provide potential solutions for the IDS problem. However, the practicability of introducing SVM is affected by the difficulties in selecting appropriate kernel and its parameters. From this viewpoint, this paper presents the work to apply different kernels for SVM in ID Son the KDD’99 Dataset and NSL-KDD dataset as well as to find out which kernel is the best for SVM. The important deficiency in the KDD’99 data set is the huge number of redundant records as observed earlier. Therefore, we have derived a data set RRE-KDD by eliminating redundant record from KDD’99train and test dataset prior to apply different kernel for SVM. This RRE-KDD consists of both KDD99Train+ and KDD99 Test+ dataset for training and testing purposes, respectively. The way to derive RRE-KDD data set is different from that of NSL-KDD data set. The experimental results indicate that Laplace kernel can achieve higher detection rate and lower false positive rate with higher precision than other kernel son both RRE-KDD and NSL-KDD datasets. It is also found that the performances of other kernels are dependent on datasets. 

KEYWORDS 

Intrusion Detection, KDD’99, NSL-KDD, Support Vector Machine, Kernel, Kernel Selection

More details...

WIRELESS SENSORS INTEGRATION INTO INTERNET OF THINGS AND THE SECURITY PRIMITIVES

 Muhammad A. Iqbal and Dr. Magdy Bayoumi 

The Center for Advanced Computer Studies, University of Louisiana at Lafayette, Lafayette, LA 70504 USA

 ABSTRACT

The common vision of smart systems today, is by and large associated with one single concept, the internet of things (IoT), where the whole physical infrastructure is linked with intelligent monitoring and communication technologies through the use of wireless sensors. In such an intelligent vibrant system, sensors are connected to send useful information and control instructions via distributed sensor networks. Wireless sensors have an easy deployment and better flexibility of devices contrary to wired setup. With the rapid technological development of sensors, wireless sensor networks (WSNs) will become the key technology for IoT and an invaluable resource for realizing the vision of Internet of things (IoT) paradigm. It is also important to consider whether the sensors of a WSN should be completely integrated into IoT or not. New security challenges arise when heterogeneous sensors are integrated into the IoT. Security needs to be considered at a global perspective, not just at a local scale. This paper gives an overview of sensor integration into IoT, some major security challenges and also a number of security primitives that can be taken to protect their data over the internet. 

KEYWORDS 

Internet of Things (IoT), Wireless Sensor Network (WSN), Security, Privacy, Integration, Confidentiality 

More Details...

AN EXPLICIT LOSS AND HANDOFF NOTIFICATION SCHEME IN TCP FOR CELLULAR MOBILE SYSTEM

 Nayeema Islam and Mohammed Nasir Uddin

 Department of Computer Science and Engineering, Jagannath University, Dhaka, Bangladesh 

ABSTRACT

 With the proliferation of mobile and wireless computing devices, the demand for continuous network connectivity exits for various wired-and-wireless integrated networks. Since Transmission Control Protocol (TCP) is the standard network protocol for communication on the Interne, any wireless network with Internet service need to be compatible with TCP. TCP is tuned to perform well in traditional wired networks, where packet losses occur mostly because of congestion. However cellular wireless network suffers from significant losses due to high bit errors and mobile handoff. TCP responds to all losses by invoking congestion control and avoidance algorithms, resulting in degraded end-to-end performance. This paper presents an improved Explicit Loss Notification algorithm to distinguish between packet loss due to congestion and packet loss due to wireless errors and handoffs. Simulation results show that the proposed protocol significantly improves the performance of TCP over cellular wireless network in terms of throughput and congestion window dynamics. 

KEYWORDS

 TCP, Cellular Wireless Network, Handoff, High Bit Error, Explicit Loss and Handoff Notification 

More details....

PERFORMANCE EVALUATION OF OSPF AND RIP ON IPV4 & IPV6 TECHNOLOGY USING G.711 CODEC

Mabubur Syed and Isaac Yerima Ambore

 Department of Computer Information Science, Minnesota State University, Mankato. Minnesota, USA

 ABSTRACT

 Migration from IPv4 to IPv6 is still visibly slow, mainly because of the inherent cost involved in the implementation, hardware and software acquisition. However, there are many values IPv6 can bring to the IP enabled environment as compared to IPv4, particularly for Voice Over Internet Protocol (VoIP) solutions. Many companies are drifting away from circuit based switching such as PSTN to packet based switching (VoIP) for collaboration. There are several factors determining the effective utilization and quality of VoIP solutions. These include the choice of codec, echo control, packet loss, delay, delay variation (jitter), and the network topology. The network is basically the environment in which VoIP is deployed. State of art network design for VoIP technologies requires impeccable Interior Gateway routing protocols that will reduce the convergence time of the network, in the event of a link failure. Choice of CODEC is also a main factor. Since most research work in this area did not consider a particular CODEC as a factor in determining performance, this paper will compare the behaviour of RIP and OSPF in IPv4 and IPv6 using G.711 CODEC with riverbed modeller17.5. 

KEYWORDS

 IPv4, IPv6, Network topology, VoIP, CODEC 

More Details.....

International Journal of Computer Networks & Communications (IJCNC)

ISSN 0974 - 9322 (Online); 0975 - 2293 (Print)

https://ijcnc.com/

Call for Papers

The International Journal of Computer Networks & Communications (IJCNC) is a bi monthly open access peer-reviewed journal that publishes articles which contribute new results in all areas of Computer Networks & Communications .The journal focuses on all technical and practical aspects of Computer Networks & data Communications. The goal of this journal is to bring together researchers and practitioners from academia and industry to focus on advanced networking concepts and establishing new collaborations in these areas.

Authors are solicited to contribute to this journal by submitting articles that illustrate research results, projects, surveying works and industrial experiences that describe significant advances in the Computer Networks & Communications.

Topics of interest include, but are not limited to, the following:

• Network Protocols & Wireless Networks
• Network Architectures
• High speed networks
• Routing, switching and addressing techniques
• Next Generation Internet
• Next Generation Web Architectures
• Network Operations & management
• Ad hoc and sensor networks
• Internet and Web applications
• Ubiquitous networks
• Mobile networks & Wireless LAN
• Wireless Multimedia systems
• Wireless communications
• Heterogeneous wireless networks
• Measurement & Performance Analysis
• Peer to peer and overlay networks
• QoS and Resource Management
• Network Based applications
• Network Security
• Self-Organizing Networks and Networked Systems
• Optical Networking
• Mobile & Broadband Wireless Internet
• Recent trends & Developments in Computer Networks

Paper submission

Authors are invited to submit papers for this journal through e-mail ijcnc@airccse.org . 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             : January 07,2017

·         Notification                            : February 07,2017

·         Final Manuscript Due             : February 15,2017

·         Publication Date                      : Determined by the Editor-in-Chief

                                  For other details please visit  https://ijcnc.com/

PERFORMANCE IMPROVEMENT OF AN AS-FRIENDLY PEER SELECTION ALGORITHM FOR P2P LIVE STREAMING

Yukinobu Fukushima, Kazuki Kobayashi and Tokumi Yokohira

Graduate School of Natural Science and Technology,

Okayama University, Tsushima-naka 3-1-1, Kita-ku, Okayama-city, Okayama, Japan

ABSTRACT

Minimum Physical Hop (MPH) has been proposed as a peer selection algorithm for decreasing inter-AS (Autonomous System) traffic volume in P2P live streaming. In MPH, a newly joining peer selects a peer whose physical hop count (i.e., the number of ASes traversed on the content delivery path) from it is the minimum as its providing  peer. However, MPH shows high inter-AS traffic volume when the number of joining peers is large. In this paper, we propose IMPH that tries to further decrease the inter-AS traffic volume by distributing peers with one logical hop count (i.e., the number of peers or origin streaming servers (OSSes) traversed on the content delivery path from an OSS to the peer) to many ASes and encouraging the following peers to find their providing peers within the same AS. Numerical examples show that IMPH achieves at the maximum of 64% lower inter-AS traffic volume than MPH.

KEYWORDS

P2P Live Streaming, Peer Selection Algorithm, AS-friendliness

More Details....

QOS EVALUATION OF HETEROGENEOUS NETWORKS: APPLICATION-BASED APPROACH

Farnaz Farid, Seyed Shahrestani and Chun Ruan 

School of Computing, Engineering and Mathematics, Western Sydney University, 

Sydney, Australia 

ABSTRACT

In this paper, an application-based QoS evaluation approach for heterogeneous networks is proposed.It is  possible to expand the network capacity and coverage in a dynamic fashion by applying heterogeneous  wireless network architecture. However, the Quality of Service (QoS) evaluation of this type of network architecture is very challenging due to the presence of different communication technologies. Different technologies have  different  characteristics and the applications that utilize them have unique QoS requirements. Although, the communication technologies have different performance measurement parameters, the applications using these radio access networks have the same QoS requirements. As a result, it would be easier to evaluate the QoS of the access networks and the overall network configuration based on the performance of applications running on them. Using such applicationbased QoS evaluation approach, the heterogeneous nature of the underlying networks and the diversity of their traffic can be adequately taken into account. Through simulation studies, we show that the application performance based assessment approach facilitates better QoS management and monitoring of 

heterogeneous network configurations. 

KEYWORDS

QoS; QoS metric; Dynamic weight; Unified QoS Metric; application weight; weight

More details....

LOCALIZATION FOR WIRELESS SENSOR NETWORKS: A NEURAL NETWORK APPROACH

 Shiu Kumar1,*, Ronesh Sharma2 and Edwin R. Vans3 

1,2,3 Department of Electronics Engineering, Fiji national University, Suva, Fiji 1,2 School of Engineering & Physics, University of the South Pacific, Suva, Fiji 

ABSTRACT 

As Wireless Sensor Networks are penetrating into the industrial domain, many research opportunities are emerging. One such essential and challenging application is that of node localization. A feed-forward neural network based methodology is adopted in this paper. The Received Signal Strength Indicator (RSSI) values of the anchor node beacons are used. The number of anchor nodes and their configurations has an impact on the accuracy of the localization system, which is also addressed in this paper. Five different training algorithms are evaluated to find the training algorithm that gives the best result. The multi-layer Perceptron (MLP) neural network model was trained using Matlab. In order to evaluate the performance of the proposed method in real time, the model obtained was then implemented on the Arduino microcontroller. With four anchor nodes, an average 2D localization error of 0.2953 m has been achieved with a 12-12-2 neural network structure. The proposed method can also be implemented on any other embedded microcontroller system. 

KEYWORDS 

Levenberg-Marquardt (LM) Algorithm, Localization, Neural Network, Received Signal Strength Indicator (RSSI), Wireless Sensor Network (WSN).

More details...

A SMART CLUSTERING BASED APPROACH TO DYNAMIC BANDWIDTH ALLOCATION IN WIRELESS NETWORKS

 Mohammed Awad1 and Abdelmunem Abuhasan2

 1Department of Computer Systems Engineering, Faculty Engineering and Information Technology, Arab American University Jenin, 240, Palestine 2Department of Planning and Systems Analysis Manager, Arab American University Jenin, 240, Palestine 

ABSTRACT 

A wireless network consists of a set of wireless nodes forming the network. The bandwidth allocation scheme used in wireless networks should automatically adapt to the network’s environments, where issues such as mobility are highly variable. This paper proposes a method to distribute the bandwidth for wireless network nodes depending on dynamic methodology;this methodology uses intelligent clustering techniques that depend on the student’s distribution at the university campus, rather than the classical allocation methods. We propose a clustering-based approach to solve the dynamic bandwidth allocation problem in wireless networks, enabling wireless nodes to adapt their bandwidth allocation according to the changing number of expected users over time. The proposed solution allows the optimal online bandwidth allocation based on the data extracted from the lectures timetable, and fed to the wireless network control nodes, allowing them to adapt to their environment. The environment data is processed and clustered using the KMeans clustering algorithm to identify potential peak times for every wireless node. The proposed solution feasibility is tested by applying the approach to a case study, at the Arab American University campus wireless network. 

KEYWORDS

 Clustering Algorithm, Wireless Network, Dynamic Bandwidth Distribution.

More details....

A PROPOSAL TO ENHANCE CELLULAR AND WIFI INTERWORKING TOWARD A RELIABLE HETNET

Nam Nguyen and Takuro Sato 

 Graduate School of Global Information and Telecommunication Studies Waseda University, Tokyo, Japan

 ABSTRACT

 WiFi offloading is becoming one of the key enablers to help the network operators dealing with the exponentially growing demand of mobile data. The idea of using WiFi to offload data traffic from cellular network has proposed for many years. However, the interoperability issue between the two networks needs to be enhanced so that WiFi can efficiently supplement for the cellular network in case of congestion or outage. In this paper, we propose a novel network roaming and selection scheme based on 3GPP TS 24.312 and IEEE 802.11k, u standards to enhance cellular and WiFi interworking. The proposed scheme is aimed at enhancing the network roaming and selection so that WiFi network can serve as a supplement and backup access network for the cellular not only for congestion control but also in case of unexpected network failure event. We also model and evaluate the proposed scheme in a typical HetNet with interworking WiFi access points and cellular base stations. The simulation result shows that our proposed scheme quickly detects unexpected network failure event and assists active UEs to perform handoff to preferable alternative point of access. As a result, service disruption is substantially reduced and quality of experience (downlink/uplink’s throughput) is improved. Therefore, our proposed scheme can be used for a more reliable HetNet in terms of congestion control and disruption tolerance. 

KEYWORDS

 WiFi cellular interworking; reliable HetNet; congestion control; network failure tolerance.

More details....

INFRASTRUCTURE OF SERVICES FOR A SMART CITY USING CLOUD ENVIRONMENT

Jorge F Hernandez1 , Victor M Larios 1 , Manuel Avalos1 and Ignacio Silva-Lepe2 

1Department of Information Systems, CUCEA, UDG Guadalajara, Mexico 2Thomas J. Watson Research Center, Yorktown Heights, NY USA Research, New York, USA 

ABSTRACT 

Sustainability, appropriate use of natural resources and providing a better quality of life for citizens has become a prerequisite to change the traditional concept of a smart city. A smart city needs to use latest generation Information Technologies, IT, and hardware to improve services and data, to offer to create a balanced environment between the ecosystem and inhabitants. This paper analyses the advantages of using a private cloud architecture to share hardware and software resources when it is required. Our case study is Guadalajara, which has nine municipalities and each one monitor’s air quality. Each municipality has a set of servers to process information independently and consists of information systems for the transmission and storage of data with other municipalities. We analysed the behaviour of the carbon footprint during the years1999-2013 and we observed a pattern in each season. Thus our proposal requires municipalities to use a cloud-based solution that allows managing and consolidating infrastructure to minimize maintenance costs and electricity consumption to reduce carbon footprint generated by the city. 

KEYWORDS

 Smart Cities; Cloud Architectures; Cost Estimation; City Services

More Details....

PERFORMANCE ASSESSMENT OF CHAOTIC SEQUENCE DERIVED FROM BIFURCATION DEPENDENT LOGISTIC MAP IN CDMA SYSTEM

 Oluyemi E. Adetoyi1 and Solomon A. Adeniran2

 1 Electrical and Electronic Engineering Department, University of Ibadan, Nigeria 2 Electronic and Electrical Engineering Department, Obafemi Awolowo University, IleIfe, Nigeria 

ABSTRACT 

In CDMA system, m-sequence and Gold codes are often utilized for spreading-despreading and scrambling-descrambling operations. In a previous work, a design framework was created for generating large family of codes from logistic map, which have comparable autocorrelation and cross correlation to m-sequence and Gold codes. The purpose of this work is to evaluate the performance of these chaotic codes in a CDMA environment. In the bit error rate (BER) simulation, matched filter, decorrelator and MMSE receiver have been utilized. The received signal was modelled for synchronous CDMA uplink for simulation simplicity purpose. Additive White Gaussian Noise channel model was assumed for the simulation. 

KEYWORDS 

CDMA, Chaotic codes, Linear Receivers, Logistic Map, Lyapunov exponent

More Details....

MODELING, IMPLEMENTATION AND PERFORMANCE ANALYSIS OF MOBILITY LOAD BALANCING FOR LTE DOWNLINK DATA TRANSMISSION

 Mohamed Escheikh1 Hana Jouini1 and Kamel Barkaoui2 

 1University of Tunis El Manar, Enit, Sys’Com Box 37, LE BELVEDERE 1002 Tunis, Tunisia 2Conservatoire national des arts et métiers Box 2, conté 75003 Paris, France 

ABSTRACT 

We propose in this paper a simulation implementation of Self-Organizing Networks (SON) optimization related to mobility load balancing (MLB) for LTE systems using ns-3 [1]. The implementation is achieved toward two MLB algorithms dynamically adjusting handover (HO) parameters based on the Reference Signal Received Power (RSRP) measurements. Such adjustments are done with respect to loads of both an overloaded cell and its cells’ neighbours having enough available resources enabling to achieve load balancing. Numerical investigations through selected key performance indicators (KPIs) of the proposed MLB algorithms when compared with another HO algorithm (already implemented in ns-3) based on A3 event [2] highlight the significant MLB gains provided in terms global network throughput, packet loss rate and the number of successful HO without incurring significant overhead. 

KEYWORDS

LTE networks, Mobility load balancing, Handover, Simulation details

More details...

ENERGY CONSUMPTION IMPROVEMENT OF TRADITIONAL CLUSTERING METHOD IN WIRELESS SENSOR NETWORK

 Tran Cong Hung1 and Ly Quoc Hung2 

1 Posts and Telecommunications Institute of Technology 2Ho Chi Minh Technical and Economic College 

ABSTRACT

 In the traditional clustering routing protocol of wireless sensor network, LEACH protocol (Low Energy Adaptive Clustering Hierarchy) is considered to have many outstanding advantages in the implementation of the hierarchy according to low energy adaptive cluster to collect and distribute the data to the base station. The main objective of LEACH is: To prolong life time of the network, reduce the energy consumption by each node, using the data concentration to reduce bulletins in the network. However, in the case of large network, the distance from the nodes to the base station is very different. Therefore, the energy consumption when becoming the host node is very different but LEACH is not based on the remaining energy to choose the host node, which is based on the number of times to become the host node in the previous rounds. This makes the nodes far away from the base station lose power sooner. In this paper, we give a new routing protocol based on the LEACH protocol in order to improve operating time of sensor network by considering energy issues and distance in selecting the cluster-head (CH), at that time the nodes with high energy and near the base station (BS) will have a greater probability of becoming the cluster-head than the those in far and with lower energy. 

KEYWORDS 

LEACH, Life-time, Energy efficient, WSN, Matlab.

More details....

GAME THEORY BASED INTERFERENCE CONTROL AND POWER CONTROL FOR D2D COMMUNICATION IN CELLULAR NETWORKS

Fa-Bin Li 1, Peng-Xiang Li 2 Ya-Fei Yang 2 and Hui Li 2*

 1 63812 Troop of PLA, Wenchang, P. R. China 2College of Information Science and Technology, Hainan University, Haikou P. R. China 

ABSTRACT

 With the current development of mobile communication services, people need personal communication of high speed, excellent service, high quality and low latency，however, limited spectrum resources become the most important factor to hamper improvement of cellular systems. As big amount of data traffic will cause greater local consumption of spectrum resources, future networks are required to have appropriate techniques to better support such forms of communication. D2D (Device-to-device) communication technology in a cellular network makes full use of spectrum resources underlaying, reduces the load of the base station, minimizes transmit power of the terminals and the base stations, thereby enhances the overall throughput of the networks. Due to the use of multiplexing D2D UE (User equipment) resources and spectrum, and the interference caused by the sharing of resources between adjacent cells, it has become a major factor affecting coexisting of cellular subscribers and D2D users. When D2D communication multiplexes the uplink resources, the base-stations are easily to be disturbed; when the downlink resources are multiplexed, the users of downlink are susceptible to interference. In order to build a high-efficient mobile network, we can meet the QoS requirements by controlling the power to suppress the interference between the base station and a terminal user.

 KEYWORDS 

 Cellular Network, Device-to-device, Mode Selection, Power Control, Interference Control

More details...

FLEXIBLE VIRTUAL ROUTING FUNCTION DEPLOYMENT IN NFV-BASED NETWORK WITH MINIMUM TOTAL NETWORK COST

 Shin-ichiKuribayashi

 Department of Computer and Information Science, Seikei University, Japan 

ABSTRACT

 In a conventional network, most network devices, such as routers, are dedicated devices that do not have much variation in capacity. In recent years, a new concept of Network Functions Virtualisation (NFV) has come into use. The intention is to implement a variety of network functions with software on general-purpose servers and this allows the network operator to select any capabilities and locations of network functions without any physical constraints. This paper focuses on the deployment of NFV-based routing functions which are one of critical virtual network functions, and present the algorithm of virtual routing function allocation that minimize the total network cost. In addition, this paper presents the useful allocation policy of virtual routing functions, based on an evaluation with a ladder-shaped network model. This policy takes the ratio of the cost of a routing function to that of a circuit and traffic distribution in the network into consideration. Furthermore, this paper shows that there are cases where the use of NFV-based routing functions makes it possible to reduce the total network cost dramatically, in comparison to a conventional network, in which it is not economically viable to distribute smallcapacity routing functions. 

KEYWORDS 

Virtual routing function, NFV, resource allocation, minimum total network cost. 

More Details.....

PERFORMANCE EVALUATION OF MOBILE WIMAX IEEE 802.16E FOR HARD HANDOVER

Amira Youssef Fahoud and D.K. Lobiyal

 School of Computer & Systems Sciences, Jawaharlal Nehru University, New Delhi, India 

ABSTRACT 

Seamless handover in wireless networks is to guarantee both service continuity and service quality. In WiMAX, scalability and quality of service for multimedia services during handover is a main challenge because of high latency and packet loss. In this paper, we created four scenarios using Qualnet 5.2 Network Simulator to analyze the hard handover functionality of WiMAX under different conditions. The scenarios such as Flag with 5 and 10 sec UCD and DCD interval values, Random mobility scenario and DEM scenario using 6 WiMAX Cells have been considered. This study is performed over the real urban area of JNU where we have used JNU map for scenarios 1, 2 and 3 but for scenario 4, the JNU terrain data has been used. Further, each BS of 6 WiMAX cell is connected to four nodes. All nodes of each scenario are fixed except Node 1. Node 1 is moving and performing the handover between the different BSs while sending and receiving real time traffics. Flag mobility model is used in Scenario 1, 2providing  and 4 to model the movement of the Node 1 while we use random mobility model in sceanrio3. 5 seconds time interval is used for Scenarios 1, 3, and 4 while 10 seconds time interval is used for scenario 2 to study the effect of management messages load on handover. Further, the statistical measures of handover performance of WiMAX in terms of number of handover performed, throughput, end-to-end delay, jitter, and packets dropped are observed and evaluated.

 KEYWORDS

 Wireless Broadband; WiMAX; Performance Evaluation; Qualnet; Handover

More Details......

JOINT-DESIGN OF LINK-ADAPTIVE MODULATION AND CODING WITH ADAPTIVE ARQ FOR COOPERATIVE AMPLIFY AND FORWARD RELAYING SYSTEM

Bhuvan Modi, O. Olabiyi and A. Annamalai

 Center of Excellence for Communication Systems Technology Research, Department of Electrical and Computer Engineering, Prairie View A & M University, TX 77446 United States of America 

ABSTRACT 

This paper analyzes the efficiency of a joint-design of an adaptive modulation and coding (AMC) at the physical (PHY) layer with an adaptive Rmax-truncated selective-repeat automatic repeat request (ARQ) protocol at the medium access control (MAC) layer to maximize the throughput of cooperative nonregenerative relay networks under prescribed delay and/or error performance constraints. Particularly, we generalize the existing design model/results for cross-layer combining of AMC along with truncated ARQ in non-cooperative diversity networks in three-folds: (i) extension of the cross-layer PHY/MAC design or optimization to cooperative diversity systems; (ii) generalization/unification of analytical expressions for various network performance metrics to generalized block fading channels with independent but nonidentically distributed (i.n.d) fading statistics among the spatially distributed nodes; (iii) analysis of the effectiveness of joint-adaptation of the maximum retransmission limit Rmax of ARQ protocol and cooperative diversity order N for delay-insensitive applications. Our insightful numerical results reveal that the average throughput can be increased significantly by judiciously combining two additional degrees of freedom (N and Rmax) that are available in cooperative amplify-and-forward (CAF) relay networks besides employing AMC at the PHY layer, especially in the most challenging low signal-to-noise ratio (SNR) regime. 

KEYWORDS 

cross-layer design, adaptive retransmission, cooperative relay diversity, adaptive modulation and coding


More Details......

ESTABLISHMENT OF VIRTUAL POLICY BASED NETWORK MANAGEMENT SCHEME BY LOAD EXPERIMENTS IN VIRTUAL ENVIRONMENT

 Kazuya Odagiri1 , Shogo Shimizu2 and Naohiro Ishii 3

 1 Sugiyama Jogakuen University, Aichi, 2Gakushuin Women’s College, Tokyo and 3Aichi Institute of Technology, Aichi, Japan

ABSTRACT

In the current Internet-based systems, there are many problems using anonymity of the network communication such as personal information leak and crimes using the Internet systems. This is because the TCP/IP protocol used in Internet systems does not have the user identification information on the communication data, and it is difficult to supervise the user performing the above acts immediately. As a solution for solving the above problem, there is the approach of Policy-based Network Management (PBNM). This is the scheme for managing a whole Local Area Network (LAN) through communication control of every user. In this PBNM, two types of schemes exist. The first is the scheme for managing the whole LAN by locating the communication control mechanisms on the course between network servers and clients. The second is the scheme of managing the whole LAN by locating the communication control mechanisms on clients. As the second scheme, we have been studied theoretically about the Destination Addressing Control System (DACS) Scheme. By applying this DACS Scheme to Internet system management, we intend to realize the policy-based Internet system management finally. In the DACS Scheme, the inspection is not done about compatibility to cloud environment with virtualization technology that spreads explosively. As the result, the coverage of the DACS Scheme is limited only in physical environment now. In this study, we inspect compatibility of the DACS Scheme for the cloud environment with virtualization technology, and enlarge coverage of this scheme. With it, the Virtual DACS Scheme (vDACS Scheme) is established.

KEYWORDS 

policy-based network management, DACS Scheme  

More Details.....

DIA-TORUS:A NOVEL TOPOLOGY FOR NETWORK ON CHIP DESIGN

Deewakar Thakyal and Pushpita Chatterjee 

SRM Research Institute, Bangalore 

ABSTRACT 

The shortcomings of conventional bus architectures are in terms of scalability and the ever increasing demand of more bandwidth. And also the feature size of sub-micron domain is decreasing making it difficult for bus architectures to fulfill the requirements of modern System on Chip (SoC) systems. Network on chip (NoC) architectures presents a solution to the earlier mentioned shortcomings by employing a packet based network for inter IP communications. A pivotal feature of NoC systems is the topology in which the system is arranged. Several parameters which are topology dependent like hop count, path diversity, degree and other various parameters affect the system performance. We propose a novel topology forNoC architecture which has been thoroughly compared with the existing topologies on the basis of different network parameters. 

KEYWORDS

 Network on chip, Torus, Topology, NoC


More Details...

CONGESTION AWARE LINK COST ROUTING FOR MANETS

 Tripti Sharma1 and Dr. Vivek Kumar2

 1 IPEC, Ghaziabad, UP, India and 2GKV, Haridwar, UK, India. 

ABSTRACT

 Due to the dynamic topology, self-configuration and decentralized nature of Mobile Ad hoc Network (MANET), it provides many benefits in wireless networks and is easy to deploy. But the transmission of data over ad hoc networks has elevated many technical issues for successful routing. Congestion is one of the important issues which cause performance degradation of a network, due to long delay and high packet loss. This paper proposes a Congestion aware Link Cost Routing for MANET where the protocol finds a path with optimized linked cost based on SNR, Link delay, and the and remaining battery power. Along with this optimization, in this protocol, every node finds its congestion status and participates in the route discovery on the basis of its status. Data forwarding is also done based on the congestion status at the time of forwarding. The protocol results in better performance in terms of packet delivery fraction, end to end delay, throughput, and packet drop when compared to existing protocols. 

KEYWORDS 

Self-configuration, Packet loss, Congestion, Link cost  

More Details...

A NOVEL METHOD TO TEST DEPENDABLE COMPOSED SERVICE COMPONENTS

Khaled Farj1 and Adel Smeda2

 1 Faculty of Science, University of Al-Jabel Al-Gharbi, P.O. Box 64200, Gharian, Libya 2 Faculty of Accounting, University of Al-Jabel Al-Gharbi, Gharian, Libya 

ABSTRACT

 Assessing Web service systems performance and their dependability are crucial for the development of today’s applications. Testing the performance and Fault Tolerance Mechanisms (FTMs) of composed service components is hard to be measured at design time due to service instability is often caused by the nature of the network conditions. Using a real internet environment for testing systems is difficult to set up and control. We have introduced a fault injection toolkit that emulates a WAN within a LAN environment between composed service components and offers full control over the emulated environment in addition to the capability to inject network-related faults and application specific faults. The toolkit also generates background workloads on the system under test so as to produce more realistic results. We describe an experiment that has been performed to examine the impact of fault tolerance protocols deployed at a service client by using our toolkit system. 

KEYWORDS 

 Web Services, Fault Tolerance Methodologies, and Software Fault Injection & Composed Web service.  

More Details..

PERFORMANCE AND COMPLEXITY ANALYSIS OF A REDUCED ITERATIONS LLL ALGORITHM

Nizar OUNI1 and Ridha BOUALLEGUE2 

1National Engineering School of Tunis, SUP’COM, InnovCom laboratory, Tunisia 2 SUP’COM, InnovCom laboratory, Tunisia 

ABSTRACT

 Multiple-input multiple-output (MIMO) systems are playing an increasing and interesting role in the recent wireless communication. The complexity and the performance of the systems are driving the different studies and researches. Lattices Reduction techniques bring more resources to investigate the complexity and performances of such systems. 

In this paper, we look to modify a fixed complexity verity of the LLL algorithm to reduce the computation operations by reducing the number of iterations without important performance degradation. Our proposal shows that we can achieve a good performance results while avoiding extra iteration that doesn’t bring much performance. 

KEYWORDS

 MIMO systems, LR-aided, Lattice, LLL, BER, Complexity

More Details...

DYNAMICALLY ADAPTABLE IMPROVED OLSR (DA-IOLSR) PROTOCOL

P. S. Vinayagam 

Assistant Professor, Department of Computer Science, Pondicherry University Community College, Puducherry, India 

ABSTRACT 

Optimized Link State Routing (OLSR) protocol is a proactive type of routing protocol that uses Multipoint Relay (MPR) set as the virtual backbone structure. The existing literature has identified various issues with respect to its backbone structure and has accordingly proposed improvements. In this paper, the focus is on improving the OLSR protocol by employing a Connected Dominating Set (CDS) based virtual backbone structure that is dynamically adaptable to rapid topology changes. A new Dynamically Adaptable Improved Optimized Link State Routing (DA-IOLSR) protocol is proposed that uses the local topology information to adapt the virtual backbone to topology changes. This assumes significance especially in networks that experience very high mobility. Changes in the network topology caused by node additions, node deletions and node mobility are taken care of. Simulations are carried out to assess the performance of DA-IOLSR protocol and OLSR protocol. Packet delivery achieved by both the protocols is examined under varying mobility by using various combinations of node speed and pause time values. It is found that DA-IOLSR protocol provides better packet delivery as compared to OLSR protocol, under varying mobility conditions. 

KEYWORDS

OLSR, Ad hoc network, Topology change, Virtual Backbone, Connected Dominating Set, MPR

More Details...

PERFORMANCE AND COMPLEXITY ANALYSIS OF A REDUCED ITERATIONS LLL ALGORITHM

Nizar OUNI1 and Ridha BOUALLEGUE2 

1National Engineering School of Tunis, SUP’COM, InnovCom laboratory, Tunisia 2 SUP’COM, InnovCom laboratory, Tunisia 

ABSTRACT 

Multiple-input multiple-output (MIMO) systems are playing an increasing and interesting role in the recent wireless communication. The complexity and the performance of the systems are driving the different studies and researches. Lattices Reduction techniques bring more resources to investigate the complexity and performances of such systems. In this paper, we look to modify a fixed complexity verity of the LLL algorithm to reduce the computation operations by reducing the number of iterations without important performance degradation. Our proposal shows that we can achieve a good performance results while avoiding extra iteration that doesn’t bring much performance. 

KEYWORDS 

MIMO systems, LR-aided, Lattice, LLL, BER, Complexity. 

More Details...

DYNAMICALLY ADAPTABLE IMPROVED OLSR (DA-IOLSR) PROTOCOL

P. S. Vinayagam Assistant Professor, Department of Computer Science, Pondicherry University Community College, Puducherry, India

 ABSTRACT 

Optimized Link State Routing (OLSR) protocol is a proactive type of routing protocol that uses Multipoint Relay (MPR) set as the virtual backbone structure. The existing literature has identified various issues with respect to its backbone structure and has accordingly proposed improvements. In this paper, the focus is on improving the OLSR protocol by employing a Connected Dominating Set (CDS) based virtual backbone structure that is dynamically adaptable to rapid topology changes. A new Dynamically Adaptable Improved Optimized Link State Routing (DA-IOLSR) protocol is proposed that uses the local topology information to adapt the virtual backbone to topology changes. This assumes significance especially in networks that experience very high mobility. Changes in the network topology caused by node additions, node deletions and node mobility are taken care of. Simulations are carried out to assess the performance of DA-IOLSR protocol and OLSR protocol. Packet delivery achieved by both the protocols is examined under varying mobility by using various combinations of node speed and pause time values. It is found that DA-IOLSR protocol provides better packet delivery as compared to OLSR protocol, under varying mobility conditions. 

KEYWORDS 

OLSR, Ad hoc network, Topology change, Virtual Backbone, Connected Dominating Set, MPR  

More Details....

PERFORMANCES OF ORTHOGONAL WAVELET DIVISION MULTIPLEX (OWDM) SYSTEM UNDER AWGN, RAYLEIGH, AND RICEAN CHANNEL CONDITIONS

Mohammed Tarique 

Department of Electrical Engineering, Ajman University of Science and Technology, P.O. Box 2202, Fujairah, United Arab Emirates 

ABSTRACT 

Orthogonal Wavelet Division Multiplexing (OWDM) has been considered as an alternative of Orthogonal Frequency Division Multiplexing (OFDM) in the recent years. OWDM has lower computational complexity and higher flexibility compared to its OFDM counterpart. The core component of OWDM is wavelet. Wavelet has been a much investigated and applied topic in digital image processing for a long time. Recently, it has drawn considerable attention of the researchers working in communication field. In this work we investigate the performances of OWDM under different channel conditions. We consider three channel conditions namely Additive White Gaussian Noise (AWGN), Rayleigh, Ricean, and frequency selective. We consider a number of wavelets namely Haar, Daubechies, Biorthogonal, Reverse Biorthogonal, Coiflets, and Symlets in OWDM design. For system model we choose Digital Video Broadcasting-Terrestrial (DVB-T). Originally DVB-T system was designed based on OFDM. In this work we use OWDM instead. The simulation results show OWDM outperforms OFDM in terms of bit error rate (BER), noise resiliency, and peak-to-average ration. The results also show that the Haar wavelet based OWDM outperforms other wavelets based OWDM system under all three considered three channel conditions. 

KEYWORDS

 Digital Video Broadcasting, OWDM, wavelets, AWGN, multipath, Rayleigh, Ricean, frequency selective  

More Details....

GEOGRAPHIC MAPS CLASSIFICATION BASED ON L*A*B COLOR SYSTEM

 Salam m. Ghandour1 and Nidal M. Turab2 

1CIS Dept. University Of Jordan, Amman Jordan 2Computer Networks And Information Security Dept. , Al Ahliyya Amman University, Amman- Jordan 

ABSTRACT 

Today any geographic information system (GIS) layers became vital part of any GIS system , and consequently , the need for developing automatic approaches to extract GIS layers from different image maps like digital maps or satellite images is very important. Map classification can be defined as an image processing technique which creates thematic maps from scanned paper maps or remotely sensed images. Each resultant theme will represent a GIS layer of the images. A new proposed approach to extract GIS layers (classes) automatically based on L*A*B colorsystem selected from ( A and B ) is proposed in this paper, our experiments shows that the hsi color space gives better than L*A*B.

KEYWORDS 

L*a*b color space, HSI color space, GIS, GIS layers, classification

More Details...

HIDING A MESSAGE IN MP3 USING LSB WITH 1, 2, 3 AND 4 BITS

Alaa AbedulsalamAlarood1,2,Azizah Abed Manaf1 , Mohammed J. Alhaddad2 and Mohammed Salem Atoum3 

1Department of Computing, University Technology Malaysia, Johor Bahru. 2Department of information Technology, King Abdulaziz University, Jeddah 3Department of Computer Science, Irbid National University, Irbid 

ABSTRACT

 Steganography is the art of hiding information in ways that prevent the detection of hidden messages. This paper presentsa new method which randomly selects position in MP3 file to hide a text secret messageby using Least Significant Bit (LSB) technique. The text secret message isused in start and ends locations a unique signature or key.The methodology focuses to embed one bit, two bits, three bitsor four bits from secret message into MP3 file by using LSB techniques. The evaluation and performancemethods are based on robustness (BER and correlation), Imperceptibility (PSNR) and hiding capacity (Ratio between Sizes of text message and MP3 Cover) indicators.The experimental results show the new method is more security. Moreover the contribution of this paper is the provision of a robustness-based classification of LSB steganography models depending on their occurrence in the embedding position. 

KEYWORDS 

Steganography, LSB, mp3 data set, hiding a message 

More Details...

SIMPLIFIED CBA CONCEPT AND EXPRESS CHOICE METHOD FOR INTEGRATED NETWORK MANAGEMENT SYSTEM

Mohammad Al Rawajbeh1 , Vladimir Sayenko2 and Mohammad I. Muhairat3 

1Department of Computer Networks, Al-Zaytoonah University of Jordan, Amman, Jordan 2Kharkov National University of Radio Electronics (KhNURE) Kharkiv, Ukraine 3Department of Software Engineering, Al-Zaytoonah University of Jordan, Amman, Jordan 

ABSTRACT 

The process of choosing and integrating a network management system (NMS) to an existing computer network became a big question due to the complexity of used technologies and the variety of NMS options. Most of computer networks are being developed according to their internal rules in cloud environments. The use of NMS requires not only infrastructural changes, consequently increasing the cost of integration and maintenance, but also increases the risk of potential failures. In this paper, conception and method of express choice to implement and integrate a network management system are presented. Review of basic methods of cost analysis for IT systems is presented. The simplified conception of cost benefits analysis (CBA) is utilized as a basis of the offered method. A final estimation is based on three groups of parameters: parameters of expected integration risk evaluation, expected effect and level of completed management tasks. The explanation of the method is provided via example. 

KEYWORDS 

Network Management; NMS; CBA; Integrated System; Cost Analysis; Efficiency Criterion 

More Details...

STUDY THE EFFECT OF PARAMETERS TO LOAD BALANCING IN CLOUD COMPUTING

Tran Cong Hung and Nguyen Xuan Phi 

 Posts and Telecommunications Institute of Technology, Vietnam 

ABSTRACT 

The rapid growth of users on the cloud service and number of services to the user increases the load on the servers at cloud datacenter. This issue is becoming a challenge for the researchers. And requires used effectively a load balancing technique not only to balance the resources for servers but also reduce the negative impact to the end-user service. The current, load balancing techniques have solved the various problems such as: (i) load balancing after a server was overloaded; (ii) load balancing and load forecast for the allocation of resources; iii) improving the parameters affecting to load balancing in cloud. The study of improving these parameters have great significance to improving system performance through load balancing. From there, we can propose more effective methods of load balancing, in order to increase system performance. Therefore, in this paper we researched some parameters affecting the performance load balancing on the cloud computing. 

KEYWORDS 

Load balancing; Virtual Mmachines;Lload Balancing Parameters;Cloud Computing.  

More Details....

LIGHT FIDELITY (LI-FI) BASED INDOOR COMMUNICATION SYSTEM

Farooq Aftab, Muhammad Nafees Ulfat khan,Shahzad Ali 

School of Computer and Communication Engineering,University of Science and Technology Beijing china (USTB) 

ABSTRACT 

Indoor wireless communication is an essential part of next generation wireless communication system.For an indoor communication number of users and their device are increasing very rapidly so as a result capacity of frequency spectrum to accommodate further users in future is limited and also it would be difficult for service providers to provide more user reliable and high speed communication so this short come can be solve in future by using Li-Fi based indoor communication system. Li-Fi which is an emerging branch of optical wireless communication can be useful in future as a replacement and backup of Wireless Fidelity (Wi-Fi)for indoor communication because it can provide high data rate of transmission along with high capacity to utilize more users as its spectrum bandwidth is much broader than the radio spectrum. In this paper we will look at the different aspects of the Li-Fi based indoor communication system,summarizes some of the research conducted so far andwe will also proposed a Li-Fi based communication model keeping in mind coverage area for multiple user and evaluate its performance under different scenarios . 

KEYWORDS 

LightFidelity,Indoor communication, Visible light communications, Wi-Fi. 

More Details.....

PERFORMANCE ANALYSIS OF THE LINK-ADAPTIVE COOPERATIVE AMPLIFY-AND-FORWARD RELAY NETWORKS WITH OPPORTUNISTIC RELAYING STRATEGY

Bhuvan Modi, O. Olabiyi and A.Annamalai 

Center of Excellence for Communication Systems Technology Research 

Department of Electrical and Computer Engineering, Prairie View A & M University, TX 77446 United States of America 

ABSTRACT 

This paper analyzes the performance of cooperative amplify-and-forward (CAF) relay networks that employ adaptive M-ary quadrature amplitude modulation (M-QAM)/M-ary phase shift keying (M-PSK) digital modulation techniques in Nakagami-m fading channel. In particular, we present and compared the analysis of CAF relay networks with different cooperative diversity and opportunistic routing strategies such as regular Maximal Ratio Combining (MRC), Selection Diversity Combining (SDC), Opportunistic Relay Selection with Maximal Ratio Combining (ORS-MRC) and Opportunistic Relay Selection with Selection Diversity Combining (ORS-SDC). We advocate a simple yet unified numerical approach based on the marginal moment generating function (MGF) of the total received SNR to compute the average symbol error rate (ASER), mean achievable spectral efficiency, and outage probability performance metrics. 

KEYWORDS 

Cooperative communications, adaptive M-QAM/MPSK modulation, Opportunistic relay selection 

More Details....

A NOVEL ROUTING PROTOCOL FOR TARGET TRACKING IN WIRELESS SENSOR NETWORKS

Sanjay Pahuja and Tarun Shrimali 

School of Computer and Information Science, Indira Gandhi National Open University, New Delhi, India

 ABSTRACT

Wireless sensor networks (WSNs) are large scale integration consists of hundreds or thousands or more number of sensor nodes. They are tiny, low cost, low weight, and limited battery, primary storage, processing power. They have wireless capabilities to monitor physical or environmental conditions. This paper compared the performance analysis of some existing routing protocols for target tracking application with proposed hierarchical binary tree structure to store the routing information. The sensed information is stored in controlled way at multiple sensor nodes (e.g. node, parent node and grandparent node) which deployed using complete binary tree data structure. This reduces traffic implosion and geographical overlapping. Simulation result showed improved network lifetime by 20%, target detection probability by 25%, and reduces error rate by 20%, energy efficiency, fault tolerance, and routing efficiency. We have evaluated our proposed algorithm using NS2. 

KEYWORDS 

WSN, HLTS, SPIN, LEACH, DD, Network Simulator 2.  

More Details...

TCP INCAST AVOIDANCE BASED ON CONNECTION SERIALIZATION IN DATA CENTER NETWORKS

Shigeyuki Osada1,2, Ryo Miyayama1 , Yukinobu Fukushima1 and Tokumi Yokohira1 

1The Graduate School of Natural Science and Technology, Okayama University, 3-1-1, Tsushima-Naka, Kita-Ku, Okayama, 700-8530, Japan 2 The Japan Research Institute, 2-18-1, Higashi-Gotanda, Shinagawa-Ku, Tokyo, 141-0022, Japan 

ABSTRACT 

In distributed file systems, a well-known congestion collapse called TCP incast (Incast briefly) occurs because many servers almost simultaneously send data to the same client and then many packets overflow the port buffer of the link connecting to the client. Incast leads to throughput degradation in the network. In this paper, we propose three methods to avoid Incast based on the fact that the bandwidth-delay product is small in current data center networks. The first method is a method which completely serializes connection establishments. By the serialization, the number of packets in the port buffer becomes very small, which leads to Incast avoidance. The second and third methods are methods which overlap the slow start period of the next connection with the current established connection to improve throughput in the first method. Numerical results from extensive simulation runs show the effectiveness of our three proposed methods. 

KEYWORDS 

TCP, Data Center, Distributed File System, TCP Incast


More Details....

SIMULATING CORTICAL MAPS FOR ATTENTION SHIFT IN AUTISM

L.-H. Tan, S.-Y. Cho and Y.-Y. Nguwi 

School of Business (IT), James Cook University, Singapore

 ABSTRACT 

Autism is a pervasive neuro-developmental disorder, primarily encompassing difficulties in the social, language, and communicative domains. Because autism is a spectrum disorder, it affects each individual differently and has varying degrees. There are three core aspects of impairment based upon the Diagnostic and Statistical Manual of Mental Disorders (DSM-IV), namely impairment in socialization, impairment in communication, and restricted repetitive activities or interests. This work describes the experiment aims at expressing autistic traits through the use of self-organizing map. Works related to simulating autism through self-organizing map is limited. This work compare and contrast the difference in attention index for normal learning and marred attention shift learning ability. It was found that the attention index of normal learning is 9 times better marred attention shift for both random and pre-fixed input data. In the marred attention shift context, neurons adapt more towards the mean of both sources combined under marred context while some neurons adapt towards mean of one source under normal context. The normal learning ability produces maps with neurons orienting towards mean values of combined stimuli source. Impairment in learning ability produces similar cortical maps compared to normal learning ability. The major difference is in the attention index. 

KEYWORDS 

self-organizing map, attention shift, autism, neural network

More Details...

ADAPTIVE MULTI-TENANCY POLICY FOR ENHANCING SERVICE LEVEL AGREEMENT THROUGH RESOURCE ALLOCATION IN CLOUD COMPUTING

MasnidaHussin, AbdullahMuhammed and NorAsilahWatiAbd Hamid

 Department of Communication Technology and Network, Faculty of Computer Science and Information Technology, University of Putra Malaysia, 43400 UPM Serdang, Selangor, Malaysia 

ABSTRACT 

The appearance of infinite computing resources that available on demand and fast enough to adapt with load surges makes Cloud computing favourable service infrastructure in IT market. Core feature in Cloud service infrastructures is Service Level Agreement (SLA) that led seamless service at high quality of service to client. One of the challenges in Cloud is providing heterogeneous computing services for the clients. With the increasing number of clients/tenants in the Cloud, unsatisfied agreement is becoming a critical factor. In this paper, we present an adaptive resource allocation policy which attempts to improve accountable in Cloud SLA while aiming for enhancing system performance. Specifically, our allocation incorporates dynamic matching SLA rules to deal with diverse processing requirements from tenants.Explicitly, it reduces processing overheadswhile achieving better service agreement. Simulation experiments proved the efficacy of our allocation policy in order to satisfy the tenants; and helps improve reliable computing. 

KEYWORDS 

Resource allocation, Cloud computing, Service Level Agreement (SLA), Adaptive Service Agreement

More Details...

ENERGY SAVINGS IN APPLICATIONS FOR WIRELESS SENSOR NETWORKS TIME CRITICAL REQUIREMENTS

Tran Cong Hung1 and Ho Huu Trung1,2 

1 Post & Telecommunications Institute of Technology, Vietnam
2 Ho Chi Minh City University of Technology, Vietnam

 ABSTRACT

 Along with handling and poor storage capacity, each sensor in wireless sensor network (WSN) is equipped with a limited power source and very difficult to be replaced in most application environments. Improving the energy savings in applications for wireless sensor networks is necessary. In this paper, we mainly focus on energy consumption savings in applications for wireless sensor networks time critical requirements. Our Paper accompanying analysis of advanced technologies for energy saving techniques for the optimization of energy efficiency together with the data transmission is optimal. Moreover, we propose improvements to increase energy savings in applications for wireless sensor networks require time critical (LEACH improvements). Simulation results show that our proposed protocol significantly better than LEACH about the formation of clusters in each round, the average power, the number of nodes alive and average total received data in base stations. 

KEYWORDS 

Sensor network, energy efficiency, routing 

More Details...

PROPOSED A HETEROGENEOUS CLUSTERING ALGORITHM TO IMPROVE QOS IN WSN

Mehran Mokhtari1 and Masoomeh Tavakoli2 

1 Sama Technical and Vocational Training College, Islamic Azad University, Qaemsharh, IRAN 2Education Qaemshar, Qaemsharh, IRAN 

ABSTRACT

In this article it has presented leach extended hierarchical 3-level clustered heterogeneous and dynamics algorithm. On suggested protocol (LEH3LA) with planning of selected auction cluster head, and alternative cluster head node, problem of delay on processing, processing of selecting members, decrease of expenses, and energy consumption, decrease of sending message, and receiving messages inside the clusters, selecting of cluster heads in large sensor networks were solved. This algorithm uses hierarchical heterogeneous network (3-levels), collective intelligence, and intra-cluster interaction for communications. Also it will solve the problems of sending data in Multi-BS mobile networks, expanding inter-cluster networks, overlap cluster, genesis orphan nodes, boundary change dynamically clusters, using backbone networks, cloud sensor. Using sleep/wake scheduling algorithm or TDMA-schedule alternative cluster head node provides redundancy, and fault tolerance. Local processing in cluster head nodes, and alternative cluster head, intra-cluster and inter-cluster communications such as Multi-HOP cause increase on processing speed, and sending data intra-cluster and inter-cluster. Decrease of overhead network, and increase the load balancing among cluster heads. Using encapsulation of data method, by cluster head nodes, energy consumption decrease during sending data. Also by improving quality of service (QoS) in CBRP, LEACH, 802.15.4, decrease of energy consumption in sensors, cluster heads and alternative cluster head nodes, cause increase on lift time of sensor networks. 

KEYWORDS 

Encapsulation, Multi-BS, Multi-HOP, Cloud sensor, Auction cluster head, Alternative cluster head nodes  

More Details..