Wednesday, September 14, 2016

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.  


Thursday, September 8, 2016

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....

Wednesday, September 7, 2016

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

Tuesday, September 6, 2016

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

Sunday, September 4, 2016

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 

Thursday, September 1, 2016

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  


OMT: A DYNAMIC AUTHENTICATED DATA STRUCTURE FOR SECURITY KERNELS


Somya D. Mohanty1 , Mahalingam Ramkumar2 and Naresh Adhikari3

1Department of Computer Science, University of North Carolina - Greensboro, Greensboro, USA 2Department of Computer Science and Engineering, Mississippi State University, Starkville, USA 3Department of Computer Science and Engineering, Mississippi State University, Starkville, USA

ABSTRACT

We introduce a family of authenticated data structures — Ordered Merkle Trees (OMT) — and illustrate their utility in security kernels for a wide variety of sub-systems. Specifically, the utility of two types of OMTs: a) the index ordered merkle tree (IOMT) and b) the range ordered merkle tree (ROMT), are investigated for their suitability in security kernels for various sub-systems of Border Gateway Protocol (BGP), the Internet’s inter-autonomous system routing infrastructure. We outline simple generic security kernel functions to maintain OMTs, and sub-system specific security kernel functionality for BGP subsystems (like registries, autonomous system owners, and BGP speakers/routers), that take advantage of OMTs.

KEYWORDS 

Security Kernels, Broader Gateway Protocol (BGP), Authenticated Data Structure (ADS)


More Details ...