Sunday, December 17, 2017

Topology Map Analysis for Effective Choice of Network Attack Scenario

Hidema Tanaka 

National Defense Academy of Japan 

Hashirimizu 1-10-20 Yokosuka, Kanagawa Japan 239-8686

ABSTRACT 

In general, network attack should be prohibited and information security technology should contribute to improve the trust of network communication. Almost network communication is based on IP packet that is standardized by the international organization. So, network attack does not work without following the standardized protocols and data format. Therefore, network attack also leaks information concerning adversaries by their IP packets. In this paper, we propose an effective choice for network attack scenario which counter-attacks adversary. We collect and analyze IP packets from the adversary, and derive network topology map of the adversary. The characteristics of topology map can be evaluated by the Eigen value of topology matrix. We observe the changes of characteristics of topology map by the influence of attack scenario. Then we can choose the most effective or suitable network counter-attack strategy. In this paper, we assume two kinds of attack scenarios and three types of tactics. And we show an example choice of attack using actual data of adversary which were observed by our dark-net monitoring.

KEYWORDS 

Network attack, Dark-net Monitoring, Topology map, Adjacency matrix, Laplacian matrix, Total accessibility matrix 

Friday, December 15, 2017

Multicasting Based Enhanced Proactive Source Routing in MANETs

1Deepa Dasarathan and 2 P. Nirmal Kumar 1

Research Scholar, Department of Electronics & Communication Engineering, 1 Sathyabama University, Chennai, India 

2Associate Professor, Department of Electronics & Communication Engineering, 2College of Engineering, Guindy, Anna University, Chennai, India

 ABSTRACT:

Mobile Ad-hoc Network (MANET) is an accumulation of movable nodes organizing a irregular topology without centralized administration. In a MANET, multicasting is a significant technique for utilizing data communication system. Multicasting based enhanced proactive source routing is proposed in this paper for Mobile Ad hoc Networks. It explains an innovative multicasting algorithm that considers the transmission energy and residual energy while forwarding the data packets. It improves the network throughput and raises the network lifetimes. Simulation analysis is carried in this proposed system and this method shows improved performance over the existing system.

KEYWORDS:

Mobile Ad hoc Network, residual energy, transmission energy, simulation analysis.

Tuesday, December 12, 2017

A Rapid Deployment Big Data Computing Platform for Cloud Robotics

Leigh Duggan1 , James Dowzard2 , Jayantha Katupitiya3 , and Ka C. Chan4 

1,2,3,4Department of Mechatronic Engineering, University of New South Wales, Australia 

4Department of Computer Science and Information Technology, La Trobe University, Australia 

ABSTRACT 

The primary contribution of this research is the production of a general cloud robotics architecture that leverages the established and evolving big data technologies. Prior research in this area has not released all details of their deployed architectures, which prevents experimental results from being replicated and verified. By providing a general-purpose architecture, it is hoped that this framework will allow future research to build upon and begin to create a standardised platform, where research can be easily repeated, validated and compared.The secondary contribution is the critical evaluation of the design of cloud robotic architectures. Whilst prior research has demonstrated that cloud-based robotic processing is achievable via big data technologies, such research has not discussed the choice in design. With the ecosystem of big data technologies expanding in recent years, a review of the most relevant technologies for cloud robotics is appropriate to demonstrate and validate the proposed architectural design. 

KEYWORDS 

Cloud robotics, big data, OpenStack, Apache, ROS. 

EWER:"Electromagnetic Wave Exposure Reduction" Service for Sensitive Users with Privacy Concerns

Mohamed Aymen Chalouf1 , Francine Krief2 and Dramane Ouattara2 

1 IRISA, University of Rennes 1, 6 rue Kerampont 22300 Lannion, France 

2LaBRI, University of Bordeaux, 351 cours de la Libération , 33400 Talence, France 

ABSTRACT 

The impact of electromagnetic waves, and consequently of wireless and mobile transmissions, on human health represented an open debate for many years. That is why, for example, demonstrations take place regularly against the installation of new transmission antennas in urban areas. In this paper, we propose a service aiming at limiting the exposure level of individuals to electromagnetic radiation in some areas. This could be achieved thanks to a dynamic adaptation of transmission parameters (frequency, power, etc.), for example. The proposed service defines some components implementing the intelligence required to compute the exposure level of a person and to carry out the adapted actions. It also relies on a signalling protocol that integrates an "Electromagnetic Wave Exposure" component which groups the parameters required to manage the exposure level of sensitive persons. To our knowledge, there is no solution providing a similar service to reduce the exposure level of sensitive persons to electromagnetic radiation. Moreover, by controlling the electromagnetic radiation exposure level of individuals, our proposal may lead to the limitation of electromagnetic waves. This will also help to meet the energy-saving constraints that future networks, particularly 5G, should be able to meet. 

KEYWORDS 

Sensitive persons, Electromagnetic radiation (EMR), EMR exposure level, Wireless communications, Signalling protocol, Network auto-configuration.  

Thursday, December 7, 2017

A Proposal to Improve SEP Routing Protocol Using Insensitive Fuzzy C-Means in Wireless Sensor Network

Phan Thi The, Ngo Quang Quyen, Vu Ngoc Phan and Tran Cong Hung 

Post & Telecommunications Institute of Technology,Vietnam 

ABSTRACT 

Nowadays, with the rapid development of science and technology and the ever-increasing demand in every field, wireless sensor networks are emerging as a necessary scientific achievement to meet the demand of human in modern society. The wireless sensor network (WSN) is designed to help us not lose too much energy, workforce, avoid danger and they bring high efficiency to work. Various routing protocols are being used to increase the energy efficiency of the network, with two distinct types of protocols, homogenous and heterogeneous. In these two protocols, the SEP (Stable Election Protocol) is one of the most effective heterogeneous protocols which increase the stability of the network. In this paper, we propose an approaching the εFCM algorithm in clustering the SEP protocol which makes the WSN network more energy efficient. The simulation results showed that the SEP-εFCM proposed protocol performed better than the conventional SEP protocol 

KEYWORDS 

Wireless sensor network (WSN), Insensitive Fuzzy C-Means, Stable Election Protocol(SEP), SEPInsensitive Fuzzy C-Means.  


Wednesday, December 6, 2017

Analysis of LTE Radio Load and User Throughput

Jari Salo1 and Eduardo Zacarías B.2 

Nokia Networks 1Taguig City, Phillipines and 2Ulm, Germany 

Abstract 

A recurring topic in LTE radio planning pertains to the maximum acceptable LTE radio interface load, up to which a targeted user data rate can be maintained. We explore this topic by using Queuing Theory elements to express the downlink user throughput as a function of the LTE Physical Resource Block (PRB) utilization. The resulting formulas are expressed in terms of standardized 3GPP KPIs and can be readily evaluated from network performance counters. Examples from live networks are given to illustrate the results, and the suitability of a linear decrease model is quantified upon data from a commercial LTE network. 

Keywords 

LTE, Traffic Model, Processor Sharing, Network Measurements

Tuesday, December 5, 2017

Enhancement and Migration of Knowledge Science

Shawon S. M. Rahman, Ph.D1 and Syed V. Ahamed, Ph.D2 

1 Associate Professor, Dept. of Computer Science and Engineering University of Hawaii-Hilo, Hilo, Hawaii, USA 

2 Professor Emeritus, City University of New York Staten Island, New York 10134, USA 

ABSTRACT 

In this paper, we present a basis for treating, evaluating and measuring knowledge as an energy acquired by knowledge centric objects in society. The energy level acquired is indicated as their knowledge potential or KnP. Some objects get more charged in the knowledge domain and exhibit a longer and/or more intense energy trail. The Rate of knowledge acquisition, intellectual caliber and need intensity driving to acquire knowledge all play a role in the knowledge energy (Kenergy) thus acquired. Bounded by established principles of measurement, units, quantification and equations for dealing with knowledge, it becomes amenable to its own (knowledge) science with laws derived from the many disciplines and their own distinctive principles. We fall back on equations from thermodynamics, electrical engineering, fluid mechanics and transmission theory to quantify the flow-properties of knowledge. Though not completely precise and accurate at this stage of development in the science of knowledge, these disciplines offer a framework for utilizing the wealth of knowledge to stand on the shoulders of many a giant in their respective expertise. In the computational domain, symbols denote both the tangible and intangible objects and linkages handle the connectivity and updating reflecting an active and dynamic profile of knowledge. Hence, objects in the physical world and their actions become symbols and their interactions become processes in the programming domain. 

KEYWORDS 

Knowledge Science, Flow of Knowledge, Velocity of Knowledge, Social Sciences.

Sunday, December 3, 2017

Grid Based Priority Routing Protocol for UWSNs

Faiza Al-Salti, N. Alzeidi, Khaled Day, Bassel Arafeh and Abderezak Touzene

Department of Computer Science, Sultan Qaboos University, Oman

ABSTRACT

In this paper, we devise and evaluate a new Grid-Based Priority Routing (GBPR) protocol for Underwater Wireless Sensor Networks (UWSNs). GBPR utilizes a 3D logical grid view of the monitored area to deliver data packets to sink nodes. Particularly, data packets are forwarded on a cell-by-cell-basis using elected sensor nodes called cell-heads. The unique feature in GBPR is the classification of the neighboring cells in different priority levels according to their distances to the sink node. Cells closer to the sink are given higher priority to be selected as the next hop. This mechanism helps in reducing the number of hops; thus, reducing the energy consumption and end-to-end delay, and increasing the reliability. The protocol is evaluated and compared against EMGGR and EEF protocols available in the literature. Simulation results show that GBPR outperforms the other two protocols in terms of energy efficiency, average delay and packet delivery ratio.

KEYWORDS

Underwater wireless sensor networks, UWSNs, routing protocol, location-based, grid, cell-head election& void-handling algorithm.


Friday, October 13, 2017

Towards Efficient Privacy Preserving Data Aggregation for Advanced Metering Infrastructure

Navid Alamatsaz1, Arash Boustani2, Nima Alamatsaz3, Ashkan Boustani4
                                                                                                
1,2Department of Electrcial Engineering and Computer Science, Wichita State University, Wichita, KS, USA.
3Department of Biomedical Engineering, New Jersey Institute of Technology, Newark, NJ, USA.
4Department of Statistics and Mathematics, University of Red Crescent Society of Iran, Mashad, Iran.

ABSTRACT 

Recent changes to the existing power grid are expected to influence the way energy is provided and consumed by customers. Advanced Metering Infrastructure (AMI) is a tool to incorporate these changes for modernizing the electricity grid. Growing energy needs are forcing government agencies and utility companies to move towards AMI systems as part of larger smart grid initiatives. The smart grid promises to enable a more reliable, sustainable, and efficient power grid by taking advantage of information and communication technologies. However, this information-based power grid can reveal sensitive private information from the user’s perspective due to its ability to gather highly granular power consumption data. This has resulted in limited consumer acceptance and proliferation of the smart grid. Hence, it is crucial to design a mechanism to prevent the leakage of such sensitive consumer usage information in smart grid. Among different solutions for preserving consumer privacy in Smart Grid Networks (SGN), private data aggregation techniques have received a tremendous focus from security researchers. Existing privacy-preserving aggregation mechanisms in SGNs utilize cryptographic techniques, specifically homomorphic properties of public-key cryptosystems. Such homomorphic approaches are bandwidth-intensive (due to large output blocks they generate), and in most cases, are computationally complex. In this paper, we present a novel and efficient CDMA-based approach to achieve privacy-preserving aggregation in SGNs by utilizing random perturbation of power consumption data and with limited use of traditional cryptography. We evaluate and validate the efficiency and performance of our proposed privacy preserving data aggregation scheme through extensive statistical analyses and simulations.

KEYWORDS. 

Smart Grid; Data-oriented Privacy; Secure data Aggregation; Spread Spectrum.



Accurate Available Bandwidth Allocation in HTTP Adaptive Streaming

Tan Phan-Xuan and Eiji Kamioka 
Graduate School of Engineering and Science, Shibaura Institute of Technology, Tokyo, Japan 

ABSTRACT 

HTTP Adaptive Streaming (HAS) has been becoming a de facto standard for Over-the-top (OTT) video services. Typically, by adapting to network conditions, it provides smoother video quality perceived by the end users. However, when the network condition always fluctuates due to some reasons (e.g. bandwidth competition among HAS player or between HAS player and other applications), the perceived video quality might be deteriorated. This demands an effective approach to maintain specific Quality of Experience (QoE) level for the users. To do so, available bandwidth allocation is chosen as a common QoE control method. However, accurately allocating available bandwidth is still a challenge. In this paper, bandwidth allocation based on the relation between subjective Mean Opinions Score (MOS) and requested bitrate is proposed. The relation is captured by a regression model, which is applied to estimate the needed available bandwidth for the users. As the result of controlling the bandwidth, the users start to request the encoding bitrate equal to target bitrate after several requests, resulting in higher perceived video quality. 

KEYWORDS 

 Quality of Experience (QoE), Quality of Service (QoS), HTTP adaptive streaming, Mean Opinion Score (MOS)  

Thursday, October 12, 2017

GARP : A Highly Reliable Grid Based Adaptive Routing Protocol for Underwater Wireless Sensor Networks

Khaled Day, Abderezak Touzene, Bassel Arafeh, and Nasser Alzeidi 

Department of Computer Science, Sultan Qaboos University, Muscat, Oman 

ABSTRACT 

We make use of the existence of cell-disjoint paths in the 3D grid topology to design a new highly reliable adaptive geographic routing protocol called Grid-based Adaptive Routing Protocol (GARP) for Underwater Wireless Sensor Networks. In GARP, the underwater environment is viewed as a virtual 3D grid of cells. A packet is forwarded following a pre-constructed routing path from a node in a grid cell to a node in a neighbouring grid cell repeatedly until the destination sink node is reached. When a selected routing path becomes unavailable, GARP adapts to the condition by switching to an alternative path making use of the existing cell-disjoint paths. Since the protocol uses pre-constructed routing paths, it avoids path establishment and path maintenance overheads. Analytical performance evaluation results for GARP are obtained showing its high reliability. In tested cases, the delivery ratio has approached 100% when the network density has reached a minimum number of sensor nodes per grid cell. 

KEYWORDS 

Underwater Wireless Sensor Networks, Routing Protocol, Adaptive Routing, Disjoint Paths, 3D Grid

Wednesday, October 11, 2017

Performance Analysis of Channel Capacity and Throughput of LTE Downlink System

P.Poornima1 , G. Laxminarayana2 and D. Srinivas Rao3

 1Associate Professor, Dept. of ECE, Sphoorthy Engineering College, Hyderabad, India 
2 Professor, Dept. of ECE, Anurag College of Engineering, Hyderabad, India 
3 Professor, Dept. of ECE, JNTUH CEH, Kukatpally, Hyderabad, India 

ABSTRACT 

In this paper, we analyzed a numerical evaluation of the performance of MIMO radio systems in the LTE network environment. Downlink physical layer of the OFDM-MIMO based radio interface is considered for system model and a theoretical analysis of the bit error rate of the two space-time codes (SFBC 2×1 and FSTD 4×2 codes are adopted by the LTE norm as a function of the signal to noise ratio. Analytical expressions are given for transmission over a Rayleigh channel without spatial correlation which is then compared with Monte-Carlo simulations. Further evaluated channel capacity and simulation results show throughput almost reaches to the capacity limit. 

KEYWORDS 

Channel Capacity, MIMO, OFDM, LTE Downlink, Spate time Block Coding and Throughput. 

Tuesday, October 10, 2017

Performance Analysis of R/KADEMLIA, Pastry and Bamboo Using Recursive Routing in Mobile Networks

Farida Chowdhury1 and Md. Sadek Ferdous2 1

Department of Computer Science and Engineering, Shahjalal University of Science and Technology, Sylhet, Bangladesh 2

Electronics and Computer Science, University of Southampton, Southampton, UK 

ABSTRACT 

We are experiencing a revolution in the wireless technology and mobile phone networks as they are becoming increasingly ubiquitous. On the other hand, there is another trend, gaining extreme popularity over the traditional wired Internet: Peer-to-Peer (P2P) networking. Specifically, Distributed Hash Table (DHT) based Structured P2P overlay networks are capable to facilitate information storage and retrieval among a potentially very large number of users without the use of central server components. Providing such P2P services in mobile networks will allow a user to harness the potential of P2P services while on the move. However, due to technical issues in mobile phone networks and limited resources available on the handsets, designing such a system is a challenging issue. While the research of P2P overlays in wired networks is plenty, there is a limited study on the suitability of different existing P2P overlays for mobile networks. This article investigates the performance and efficiency of a number of structured P2P overlays that use recursive approach for routing strategy: R/Kademlia, Pastry and Bamboo and finds their suitability for use on mobile networks. The simulation result shows that among the three overlays, Bamboo exhibits a marginally better performance in comparison to the others with a 98% to 99% routing efficiency and a lower bandwidth consumption in high churn environment. Hence, Bamboo protocol is a good choice to be used over Kademlia and Pastry in mobile networks.

KEYWORDS 

Peer-to-Peer, Distributed Hash Table, Churn, Mobile Networks

Sunday, October 8, 2017

A Low Complexity User Grouping Strategy for Downlink Multi-User MIMO Scheduling

Nguyen Ngoc Van 

School of Electronics and Telecommunications, Hanoi University of Science and 
Technology, No 1 , Dai Co Viet Street, Hai Ba Trung, HaNoi, Vietnam 

ABSTRACT 

In this paperwe present a low complexity user grouping algorithm for multi-user MIMO system employing opportunistic fair scheduling (OFS) and zero forcing beamforming (ZFB), and develop a framework for cross-layer resource scheduling. Given a particular subset of users and their channel conditions, the optimal beamforming scheme can be calculated. The multi-user esource scheduling problem then refers to the selection of the optimal subset of users for transmission at each time instant to maximize the total throughput of the system. The simulation result shows that the performance of resource scheduling algorithm based on user grouping method proposed in this paper is close to the optimal performance which used exhaustion method. In addition, user grouping does not affect the fairness among all users.

KEYWORDS : 

Opportunistic fair scheduling (OFS); zero-forcing beamforming (ZFB); 

Thursday, October 5, 2017

A Novel Approach for Optimizing Energy and Bandwidth Issues in MANET Using DSR Protocol

Ajay Lala, Anand Bhaskar, Prasun Chakrabarti and JitendraKaushal Srivastava 
Department of Computer Science & Engineering, Sir PadampatSinghania University, Udaipur, Rajasthan, India  

ABSTRACT

An ad-hoc network is a cluster of wireless mobiles nodes which are self-making, self-arranging and selfregulating. Numerous energy conserving routing conventions have been proposed for Mobile Ad Hoc Network (MANET). Those conventions demonstrate that energy utilization in MANET can be reduced by modifying the transmit energy to a base level. To decide the base transmit power is a testing issue. This paper proposes a novel approach for optimizing Energy Issues in MANET using DSR Protocol convention which guarantees high reliability of the system. The Dynamic Source Routing (DSR) convention has been adjusted with a specific end goal to execute IE-DSR convention. Existing control messages of DSR convention have been adjusted and utilized as a part of IE-DSR convention. The proposed method introduces a systematic model to demonstrate that an impressive part of energy can be spared by utilizing IE-DSR convention. This calculation lessens the flooding of RREQ (route request) packets in the network which brings about the reduced energy utilization. The proposed calculation precludes the superfluous flooding of RREQ packets.

Based on the experimental work, the proposed method outperforms in reducing energy consumption by a rationale factor. Further, the simulation results depict that if the initial energy of node is kept relatively small then our proposed approach consumes approx. 70 % less energy than DSR, which is quite significant while comparing with the existing energy optimizing methods and it has been analyzed that an 15.36% of more data packet has been delivered to the appropriate destination. The application of the proposed method ensures larger network life, high reliability and lower cost estimation.

KEYWORDS

Ad-hoc Networks, IE-DSR, Flooding, RREQ, Routing Protocols;

Wednesday, October 4, 2017

AN ANALYSIS OF THE FAT-TAILEDNESS OF THE CENTRALITY DISTRIBUTIONS OF REAL-WORLD NETWORKS

Natarajan Meghanathan Jackson State University, MS, USA 

ABSTRACT 

"Kurtosis" has long been considered an appropriate measure to quantify the extent of fat-tailedness of the degree distribution of a complex real-world network. However, the Kurtosis values for more than one realworld network have not been studied in conjunction with other statistical measures that also capture the extent of variation in node degree. Also, the Kurtosis values of the distributions of other commonly centrality metrics for real-world networks have not been analyzed. In this paper, we determine the Kurtosis values for a suite of 48 real-world networks along with measures such as SPR(K), Max(K)-Min(K), Max(K)-Avg(K), SD(K)/Avg(K), wherein SPR(K), Max(K), Min(K), Avg(K) and SD(K) represent the spectral radius ratio for node degree, maximum node degree, minimum node degree, average and standard deviation of node degree respectively. Contrary to the conceived notion in the literature, we observe that real-world networks whose degree distribution is Poisson in nature (characterized by lower values of SPR(K), Max(K)-Min(K), Max(K)-Avg(K), SD(K)/Avg(K)) could have Kurtosis values that are larger than that of real-world networks whose degree distribution is scale-free in nature (characterized by larger values of SPR(K), Max(K)-Min(K), Max(K)-Avg(K), SD(K)/Avg(K)). We also observe the Kurtosis values of the betweenness centrality distributions of the real-world networks to be more likely the largest among the Kurtosis values with respect to the commonly studied centrality metrics. 

KEYWORDS

 Fat-tailedness, Degree Distribution, Kurtosis, Real-World Networks, Centrality Metrics, Concordance  

Monday, September 11, 2017

TOP 10 Computer Networks & Communications Research Articles- 2017 Fall (September)

TOP 10 Computer Networks & Communications Research Articles- 2017 Fall (September)

TOP 1  

DELAY-POWER PERFORMANCE COMPARISON OF MULTIPLIERS IN VLSI CIRCUIT DESIGN 

                                                                                                                                      ...
                                                                                                                                              

Thursday, August 24, 2017

A Novel Framework for Intrusion Detection Using Distributed Collaboration Detection Scheme in Packet Header Data

T.S. Urmila1 and R. Balasubramanian2 

1 Research Scholar, Mother Teresa Women’s University, Kodaikannal 

2 Dean, KarpagaVinayagar College of Engineering and Technology, Mathuranthagam 

ABSTRACT 

In recent years, the number of attacks on the computer network is voluminous. Secure data communication over the network is always under threat of intrusions. To protect from these attacks various intrusion detection techniques have been developed. Anomaly detection system detects the novel attacks based on deviation of the behavior of packets from the normal flow and Signature detection system detects known attacks based on stored signatures. We have proposed a Distributed collaboration detection scheme that combines the advantages of Anomaly and Signature based method by capturing the packets in real time. The uninteresting traffics are filtered by packet filtering and further normalization. The relevant features are selected based on our Correlation based BAT Feature Selection (CBBFS) Algorithm. Our Proposed Efficient Behavioral Prediction (EBP) scheme analyzes the episodes and classifies the attack based on EGSSI. Then Proficient Ordinance Generation (POG) for Inspection of IP Phase labels the IP as trusted or untrusted. Our proposed framework outperforms the results of existing classification algorithms (C4.5, Naive Bayes, PSO, GSA and EDADT) by reducing the rate of false positives.

KEYWORDS 

Intrusion Detection, Anomaly Detection, Signature Detection, Distributed Collaboration, Packet Header Data

Improving Distributed Energy Efficient Clustering Algorithm to Save Lifetime for Heterogeneous WSN

Phan Thi The, Bui Hoang Mai, Nguyen Thanh Tuan and Tran Cong Hung 

Post & Telecommunications Institute of Technology, Vietnam 

ABSTRACT 

Energy saving and prolonging network lifecycle are the most important targets for routing protocols in the WSN. Clustering is an effective way for widespreadnetwork life by reducing energy consumption. Nowadays, most studies aim at a homogeneous environment in which all sensor nodes have the same amount of initial energy. However, in a heterogeneous network environment, a number of sensor nodes are equipped with additional power sources, thus resulting in a power hierarchy. This heterogeneity in the sensor nodes leads to network life, stability. In this paper, we have proposed to improve BEENISH and DEEC protocols. Simulation results demonstrate that the proposed protocol has better performance in terms of network life, stability and packet delivery compared to Enhanced Distributed Energy Efficient Clustering (EDEEC), Enhanced Developed Distributed Energy Efficient Clustering (EDDEEC), Balanced Energy Efficient Network Integrated Super Heterogeneous (BEENISH)

KEYWORDS 

WSN, clustering, heterogeneous wireless sensor networks, hierarchical routing, DEEC, BEENISH.

Wednesday, August 23, 2017

Combined IEEE 802.15.4 Physical Layer and Virtual Multiple Input Multiple Output (VMIMO) Transmissions for Energy Efficient Wireless Sensor Networks

Fawaz Alassery 

Department of Computer Engineering, Taif University, Taif City, Saudi Arabia 

ABSTRACT 

A Wireless Sensor Network (WSN) consists of a hundred of sensor nodes deployed in sensing fields in order to serve various applications. The limited resources of sensor nodes such as energy source, computational ability and communication bandwidth are the most important challenges in designing a reliable smart WSN which guarantees the connectivity and maximizes the lifetime of sensor’s batteries. One of the available solutions for improving the energy efficiency of smart WSNs is by using the Virtual Multiple Input Multiple Output (V-MIMO) technology adapted to sensor nodes. In this paper, we proposed a high energy efficiency smart WSN in which we exploited the advantages Provided by the virtual MIMO technique (i.e. by reducing the multipath fading channel). Our network transmission has two scenarios. The first scenario is based on deploying one rechargeable relay node at the center of the sensing field which is responsible for receiving data packets from the source node, decoding and forwarding them to a destination node, while the second scenario is based on dividing the sensing field into clusters where each cluster has a rechargeable relay node which transfers data packets to a destination node in the same cluster or in any other cluster. In this work, we studied the effects of Rayleigh flat fading channels which increase the re- transmission error of data packets. Our simulation results show that the use of the advantages of virtual MIMO and one central/rechargeable relay node achieves only low energy efficiency for the Signal to Noise Ratio (SNR) range between –20 to 20dB over the Rayleigh flat fading channel. However, the second scenario achieves high energy efficiency due to the clustering technique and the central relay nodes with direct transmission in each cluster.

KEYWORDS 

Smart wireless sensor networks, high energy efficiency WSNs, virtual MIMO

Monday, August 21, 2017

Victim Based Statistical Filtering : A New Deterrent Against Spoofed DoS Traffic

Suhail Qadir Mir1 and S.M.K. Quadri2 

1 Post Graduate Department of computer sciences, University of Kashmir, India 

2Department of Computer Science, Jamia Millia Islamia, India 

ABSTRACT 

The extensive use of Internet and network based information resources on a global scale has led to the rise in a wide range of security incidents. One such attack is a TCP-SYN DoS attack, which makes use of IPSpoofing for its effectiveness. This paper presents a robust scheme for filtering spoofed DoS IP Packets in the Internet. We have proposed a robust filtering algorithm namely, Victim Based Statistical Filtering in this paper. The algorithm is inspired from the Hop-Count Filtering (HCF) method, which uses a corelation between IP addresses and their respective hop-counts to the destination server, to filter out the spoofed IP packets from the legitimate ones. The variation that we have proposed is adding the monitoring information of the usage levels of port numbers of the destination machine (victim), in the HCF Algorithm. The proposed VBSF algorithm was empirically evaluated and it was found to exhibit better performance than its predecessor.

KEYWORDS 

Hop Count, Flooding, TCP-SYN, DoS Attack, IP Spoofing, IP Filtering.

Sunday, August 20, 2017

Investigation of Computational Intelligence Techniques for Intrusion Detection in Wireless Sensor Networks

Christopher D. McDermott and Andrei Petrovski 
School of Computing Science and Digital Media, Robert Gordon University, Aberdeen, Scotland 

ABSTRACT 

Wireless Sensor Networks (WSNs) have become a key technology for the IoT and despite obvious benefits, challenges still exist regarding security. As more devices are connected to the internet, new cyber attacks are emerging which join well-known attacks posing significant threats to the confidentiality, integrity and availability of data in WSNs. In this work, we investigated two computational intelligence techniques for WSN intrusion detection. A back propagation neural network was compared with a support vector machine classifier. Using the NSL-KDD dataset, detection rates achieved by the two techniques for six cyber attacks were recorded. The results showed that both techniques offer a high true positive rate and a low false positive rate, making both of them good options for intrusion detection. In addition, we further show the support vector machine classifiers suitability for anomaly detection, by demonstrating its ability to handle low sample sizes, while maintaining an acceptable FPR rate under the required threshold.

KEYWORDS 

Wireless Sensor Networks (WSNs), Intrusion Detection System (IDS), Denial of Service (DoS), Artificial Neural Network (ANN), Feed-forward Backpropagation, Support Vector Machine (SVM).

Friday, August 18, 2017

New Proposed Architecture for Q3 Interface to Manage IP-Based Networks

Gholamreza Farahani 

Department of Electrical Engineering and Information Technology, Iranian Research 
Organization for Science and Technology (IROST), Tehran, Iran 

ABSTRACT 

This paper presents a new architecture of Q3 interface to combine OSI and Internet management protocols CMIP and SNMP with union management protocol in Telecommunication Management Network (TMN). To manage both OSI and IP-based networks, new proposed sub-layer is added between upper layers (SNMP and CMIP) and lower layers stack protocols such that with use of this sub-layer the TMN is able to communicate data between CMIP and SNMP with OSI and TCP/UDP/IP. Results of our simulation are shown that our new architecture named SUL (Sub-layer between Upper and Lower layers) has better performance than CMIP with 12.5% improvement in M-Get and M-Set services and 25% in M-Event Report service. Also SUL architecture performance will overcome to SNMP with 125% in M-Get and M-Set services and 66% in M-Event Report service. Usage of Q3 interface in telecommunication management network will improve the performance of instruction interchange approximately 26.6% in comparison to ordinary telecommunication. 

KEYWORDS 

Transmission Control Protocol, Internet Protocol, User Datagram Protocol, Simple Network Management Protocol, Common Management Information Protocol. 

Discovering New Cyber Protection Approaches from a Security Professional Prospective

Alain Loukaka1 and Shawon S. M. Rahman, Ph.D. 2 

1 Ph.D. Candidate,Information Security Assurance, Capella University, Minneapolis, MN, USA 2Associate Professor, Department of Computer Science Majmaah University, Majmaah, Kingdom of Saudi Arabia 

ABSTRACT

Cybersecurity has become a very hot topic due to high profile breaches that occurred in the past years. Despite the implementation of current known pre-emptive methods such as intrusion detection systems, anti-viruses, and the use of firewalls, hackers still find sophisticated means to steal data or impair an organization by targeting their assets. It is important that security professionals need to “think outside the box” and use new tools and techniques to mitigate threats beyond current known detections and prevention technologies. It is imperative that our infrastructure and assets are impermeable from domestic and foreign attackers. Our best line of defense is the detection of any threats or vulnerability to prevent or minimize damages of our assets from domestic and foreign attackers. 

KEYWORDS

Cybersecurity; Information Security; Intrusion Detection; Information Systems;Vulnerability; Security Professional; Exploits.  




Thursday, August 17, 2017

Decision Making System Supported by Adaptive Coloured Petri Nets

Haroldo Issao Guibu1,2and João José Neto2 
1 Instituto Federal de Educação, Ciência e Tecnologia de São Paulo, Brazil
 2Escola Politécnica da Universidade de São Paulo, Brazil  


ABSTRACT

This work presents a decision-making system supported by Adaptive Coloured Petri Net (ACPN). Experts in a given field can establish a set of rules for the proper functioning of a manufacturing process or even acompany, facilitating the decision-making process. However, whenever the scenario changes and new rules need to be incorporated into the rule set, or old rules need to be deleted or modified, the manager may find it difficult to reformulate this set of rules. An adaptive mechanism that facilitates the modification of the set of rules is fundamental to assist the manager in making decisions. The Adaptive Color Petri Net is a tool that enables the modification of the set of rules, transforming the IF-THEN rule format used by anauxiliary Extended Adaptive Decision Table in an equivalent ACPN subnet. 

KEYWORDS 

Adaptive Petri Nets, Coloured Petri Nets, Adaptive Decision Tables  


Friday, June 9, 2017

ECA MODEL BASED QOS AODV ROUTING FOR MANETS

Raghavendra M.1 and Pallapa Venkataram 2 
1 Department of Computer Science and Engineering, Siddaganga Institute of Technology, Tumkur 572103, India.
 2 Department of Electrical Communication Engineering, Indian Institute of Science, Bangalore 560012, India. 

ABSTRACT

 Applications like banking, interactive multimedia, movie on demand, VOIP, etc., are delay sensitive by nature. The QoS given to users will be affected by network delay, which can be mitigated by employing QoS routing and efficient data transfer. To build routing table, normal AODV routing uses flooding technique, which will not consider QoS requirements. Hence QoS based routing which is stable for the entire application is essential, which understands the dynamic nature of the MANET and establishes the required route, in minimum possible time. We have proposed an intelligent routing protocol based ECA model and AODV for establishing QoS route. The simulation results shows that the ECA model gives better results, while considering the local connectivity time, source to destination connectivity time, number of data packets successfully delivered to the destination, local and global error correction time, compared to AODV. 

KEYWORDS

 adhoc routing, adhoc wireless networks, Quality of Service (QoS), Event Condition Action (ECA)



Thursday, June 8, 2017

LOW COST DESIGN AND IMPLEMENTATION FOR HAS USING MULTIFUNCTIONAL WI-FI

Mohammad Al Rawajbeh ,Faculty of Science and Information Technology,Al Zaytoonah University of Jordan, Jordan. 

ABSTRACT

Smart home technology nowadays became more popular and wide spread world around. The communication network's appropriate coverage, flexibility and low cost made the Wi-Fi technology one of the strongest choices in this field. The main purpose of this paper is to propose a simple, flexible and low cost design of controlling home appliances and connecting other hardware using Wi-Fi network. The ability of exploiting this design and implementation in different environment and possibility of integration with other modern technology are considered the main benefit of the proposed design. The proposed system provides connecting and controlling all available devices inside home using many sensors and actuators. The monitoring process achieved by appropriate installed software on regular user computer or handheld device. 

KEYWORDS:

Wi-Fi, Smart Home, Wireless Sensor Networks, WLAN, Home Monitoring, HAS.  


Wednesday, June 7, 2017

A REAL TIME PRIORITY BASED SCHEDULER FOR LOW RATE WIRELESS SENSOR NETWORKS

Sambhaji Sarode, Jagdish Bakal 
Department of Computer Science & Engineering, GHRCOE, RTM University, Nagpur, Maharashtra, India 

ABSTRACT

This paper presents a priority approach for censorious real-time traffic which flows particularly for low data rate wireless sensor and actor network (LR-WSAN). In the recent years, the demand for low rate wireless data transmission has been increased drastically in small scale industrial and non-industrial applications. The different traffic flows are increased by incorporating a variety of distinct sensing devices. In particular, injection of different traffic into network makes the communication system unstable and unreliable because of unnecessarily resource utilization, wasting energy for surplus delivery management and violation of time constraints. This paper aims to presents the new priority-based algorithm at actuator node for appropriate classification and categorization of data packets for delay sensitive and delaytolerant applications. A novel real-time priority-based scheduler (RTPS) is proposed to handle heterogeneous data flows simultaneously according to their transmission type. The priority-based data delivery is an essential research topic for low rate multi-event IEEE 802.15.4 sensor networks. A priority metric is designed to dynamically control various types of traffic based flows with considerations of packet type, delay, and buffer processing rate. TestBed results describe significant improvements in data reporting mechanism for delay sensitive and delay-tolerant applications over various topologies. The high priority transient traffic suffers less delay and presents effective packet delivery ratio compared with traditional approaches. 

KEYWORDS

Transport protocol, Packet Scheduling, Reliability, Wireless sensor networks, WSN TestBed, Priority-based data reporting, IEEE 802.15.4 sensor networks, queue management, congestion control.  


Tuesday, June 6, 2017

MEMORY EFFICIENT FORWARDING INFORMATION BASE FOR CONTENT-CENTRIC NETWORKING

Torsten Teubler1 , Dennis Pfisterer2 and Horst Hellbrück1
 1 Lübeck University of Applied Sciences, CoSA Center of Excellence, Lübeck, Germany 2University of Lübeck, Lübeck, Germany 

ABSTRACT

Content-Centric Networking (CCN) is a new paradigm for the future Internet where content is addressed by hierarchically organized names with the goal to replace TCP/IP networks. Unlike IP addresses, names have arbitrary length and are larger than the four bytes of IPv4 addresses. One important data structure in CCN is the Forwarding Information Base (FIB) where prefixes of names are stored together with the forwarding face. Long prefixes create problems for memory constrained Internet of Things (IoT) devices. In this work, we derive requirements for a FIB in the IoT and survey possible solutions. We investigate, design and compare memory-efficient solutions for the FIB based on hashes and Bloom-Filters. For large number of prefixes and an equal distribution of prefixes to faces we recommend a FIB implementation based on Bloom-Filters. In all other cases, we recommend an implementation of the FIB with hashes.

 KEYWORDS

Protocols, Content-centric networking, Internet of things

Sunday, June 4, 2017

PERFORMANCE ASSESSMENT OF MAXIMUM LIKELIHOOD IN THE DETECTION OF CARRIER INTERFERENCE CORRUPTED GPS DATA IN MOBILE HANDSETS

Taher AlSharabati 
Electronics and Communications Engineering Department, Al-Ahliyya Amman University, Jordan 

ABSTRACT

 Mobile handset carriers are presented as a source of interference to GPS operation in smartphones. The carriers are presented in terms of their analytical form; block level generation as well as their statistical distribution model. In addition, we present the analytical form of the received GPS signal corrupted by carrier interference The Analysis is applied on the chip level in the acquisition engine before stripping the code or carrier. This expansion will restore the operation of GPS receiver in the presence of carrier interference. We present an estimate of the amount of improvement that Maximum Likelihood estimation gives in mitigating carrier interference in smartphones. The amount of improvement is compared to that of calculations based on measured data processing. The power spectral density of the interference is treated thoroughly to derive expressions for half of the noise power spectral density. 

KEYWORDS

 Detection, Average Carrier Power, Carrier Interference, Error Rate, Position Accuracy.


Saturday, June 3, 2017

EVALUATION OF CONGESTION CONTROL METHODS FOR JOINT MULTIPLE RESOURCE ALLOCATION IN CLOUD COMPUTING ENVIRONMENTS

Shin-ichiKuribayashi 
Department of Computer and Information Science, Seikei University, Japan 

ABSTRACT

As cloud computing provides not only services that have been traditionally provided on the Internet but also many other services, it has a dramatically higher risk than conventional networks that an occurrence of congestion in one service leads to congestion in other services.Unlike conventional networks, cloud computing environments should provide not only bandwidth but also processing ability simultaneously. First, this paper compares two congestion control methods (Methods A and B)in cloud computing environments, assuming that multiple types of resource are allocated simultaneously, and clarifies the effective areas of two congestion control methods with computer simulations. Method A postpones the service completion time by delaying resource allocation. Method B reduces the size of required resource and allocates to the request, extending in turn the duration of resource allocation so that the total amount of resource required by the request will be satisfied. The effective areas of two congestion control methods are clarified with computer simulations. Then, this paper compares three control methods (Methods 1, 2 and 3) tocope with the excessive generation of requests from a specific access point, which results in the degradation in service quality of requests from other access points, and clarifies the effective areas of three control methods with computer simulations. Method 1 allocates minimum resources dedicated to each access point in each center. Method 2reduces the size of required resources of requests from a specific access point, and Method 3 thins out some of requests from a specific access point. 

KEYWORDS

Congestion control, Joint multiple resourceallocation, Resource management, cloud computing environments  


Friday, June 2, 2017

A STRUCTURED DEEP NEURAL NETWORK FOR DATA-DRIVEN LOCALIZATION IN HIGH FREQUENCY WIRELESS NETWORKS

Marcus Z. Comiter1 , Michael B. Crouse1 and H. T. Kung1 
1 John A. Paulson School of Engineering and Applied Science Harvard University Cambridge, 
MA 02138 

ABSTRACT

Next-generation wireless networks such as 5G and 802.11ad networks will use millimeter waves operating at 28GHz, 38GHz, or higher frequencies to deliver unprecedentedly high data rates, e.g., 10 gigabits per second. However, millimeter waves must be used directionally with narrow beams in order to overcome the large attenuation due to their higher frequency. To achieve high data rates in a mobile setting, communicating nodes need to align their beams dynamically, quickly, and in high resolution. We propose a data-driven, deep neural network (DNN) approach to provide robust localization for beam alignment, using a lower frequency spectrum (e.g., 2.4 GHz). The proposed DNN-based localization methods use the angle of arrival derived from phase differences in the signal received at multiple antenna arrays to infer the location of a mobile node. Our methods differ from others that use DNNs as a black box in that the structure of our neural network model is tailored to address difficulties associated with the domain, such as collinearity of the mobile node with antenna arrays, fading and multipath. We show that training our models requires a small number of sample locations, such as 30 or fewer, making the proposed methods practical. Our specific contributions are: (1) a structured DNN approach where the neural network topology reflects the placement of antenna arrays, (2) a simulation platform for generating training and evaluation data sets under multiple noise models, and (3) demonstration that our structured DNN approach improves localization under noise by up to 25% over traditional off-the-shelf DNNs, and can achieve submeter accuracy in a real-world experiment. 

KEYWORDS

Millimeter wave, 5G, 802.11ad, Localization, Mobile networks, Machine learning, Deep Neural Networks  


Thursday, June 1, 2017

DEVELOPMENT AND EVALUATION OF A CONTACT CENTER APPLICATION SYSTEM TO INTEGRATE MULTIPLE COMMUNICATION CHANNELS USING WEBRTC

International Journal of Computer Networks & Communications (IJCNC)



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

Current Issue: May 2017, Volume 9, Number 3

Yusuke Shiga1 and KazumasaTakami2

 1Department of Information Systems Science, Faculty of Engineering, Soka University, Tokyo, Japan
2Department of Information Systems Science, Faculty of Science and Engineering, Soka University, Tokyo, Japan 

 ABSTRACT

WebRTC allows P2P communication between Web browsers. It has been attracting an interest in recent years and is beginning to be used in a wide range of fields. Progress in Internet technology is expected to diversify the means of communication between enterprises and customers from simple telephone calls and email to include easier and more convenient means, such as video calls and Web chats. We have developed an experimental application system that uses WebRTC to integrate a variety of task-specific communication tools, such as telephones, at a contact center with the aim of improving work efficiency there. Main functions implemented in this system include audio/video communication that involves an agreement procedure, setting up of FIFO-based inquiry channels, and visualization of access line congestion state. We have created test scenarios that simulated contact center tasks. Using these scenarios, we compared the experimental system and an existing system in terms of the response time, the degree of functional integration of tools, and usability, which is based on a system usability scale (SUS). 

KEYWORDS

WebRCT,Contact Center,P2P Communication, Web Application, Usability, Communication Channel 



Tuesday, April 11, 2017

DATA AGGREGATION ROUTING PROTOCOLS IN WIRELESS SENSOR NETWORKS: A TAXONOMY

 Saeid Pourroostaei 
Ardakani Allameh Tabataba’i University, Tehran, Iran

 ABSTRACT 

Routing in Wireless Sensor Network (WSN) aims to interconnect sensor nodes via single or multi-hop paths. The routes are established to forward data packets from sensor nodes to the sink. Establishing a single path to report each data packet results in increasing energy consumption in WSN, hence, data aggregation routing is used to combine data packets and consequently reduce the number of transmissions. This reduces the routing overhead by eliminating redundant and meaningless data. There are two models for data aggregation routing in WSN: mobile agent and client/server. This paper describes data aggregation routing and classifies then the routing protocols according to the network architecture and routing models. The key issues of the data aggregation routing models (client/server and mobile agent) are highlighted and discussed.

 KEYWORDS 

Wireless Sensor Networks, Routing Protocols, Data Aggregation, Client/server, Mobile Agent .


More Details....... 

Monday, April 10, 2017

SECURITY ANALYSIS OF AES AND ENHANCING ITS SECURITY BY MODIFYING S-BOX WITH AN ADDITIONAL BYTE

 Abdullah Al- Mamun1 , Shawon S. M. Rahman, Ph.D.2 , Tanvir Ahmed Shaon1 and Md Alam Hossain1

 1Department of Computer Science and Engineering Jessore University of Science and Technology,Jessore-7408,Bangladesh 2Associate Professor, Department of Computer Science Majmaah University, Majmaah, Kingdom of Saudi Arabia

ABSTRACT

Secured and opportune transmission of data alwaysis a significant feature for any organization. Robust encryption techniques and algorithms always facilitate in augmenting secrecy, authentication and reliability of data. At present, Advanced Encryption Standard (AES) patronized by NIST is the most secure algorithm for escalating the confidentiality of data. This paper mainly focuses on an inclusive analysis related to the security of existing AES algorithm and aim to enhance the level security of this algorithm. Through some modification of existing AES algorithm by XORing an additional byte with s-box value, we have successfully increased the Time Security and Strict Avalanche Criterion. We have used random additional key for increasing security. Since this key is random, result of security measurement sometimes fluctuates. 

KEYWORDS 

Cryptography;Advanced Encryption Standard;secure algorithm;s-box; Ciphertext; Avalanche Effect; SAC; 


Thursday, April 6, 2017

ALGORITHM FINDING MAXIMUM CONCURRENT MULTICOMMODITY LINEAR FLOW WITH LIMITED COST IN EXTENDED TRAFFIC NETWORK WITH SINGLE REGULATING COEFFICIENT ON TWO-SIDE LINES

 Tran Quoc Chien and Nguyen Dinh Lau 
The University of Education, University of Danang, Danang, Vietnam 

ABSTRACT 

Graphs and extended networks are is powerful mathematical tools applied in many fields as transportation, communication, informatics, economy, … Algorithms to find Maximum Concurrent Multicommodity Flow with Limited Cost on extended traffic networks are introduced in the works we did. However, with those algorithms, capacities of two-sided lines are shared fully for two directions. This work studies the more general and practical case, where flows are limited to use two-sided lines with a single parameter called regulating coefficient. The algorithm is presented in the programming language Java. The algorithm is coded in programming language Java with extended network database in database management system MySQL and offers exact results.


KEYWORDS 

Graph, Network, Multicommodity Flow, Optimization, Approximation. 

Wednesday, April 5, 2017

A COMPARATIVE PERFORMANCE ANALYSIS OF ROUTE REDISTRIBUTION AMONG THREE DIFFERENT ROUTING PROTOCOLS BASED ON OPNET SIMULATION

Zeyad Mohammad1 , Ahmad Abusukhon2 and Marzooq A. Al-Maitah3 
1Department of Computer Network, Al-Zaytoonah University of Jordan, Amman, Jordan 2Department of Computer Science, Al-Zaytoonah University of Jordan, Amman, Jordan 3Department of Computer Network, Al-Zaytoonah University of Jordan, Amman, Jordan

ABSTRACT 

In an enterprise network, it is normal to use multiple dynamic routing protocols for forwarding packets. Therefore, the route redistribution is an important issue in an enterprise network that has been configured by multiple different routing protocols in its routers. In this study, we analyse the performance of the combination of three routing protocols in each scenario and make a comparison among our scenarios. We have used the OPNET 17.5 simulator to create the three scenarios in this paper by selecting three different routing protocols from the distance vector and link state routing protocols in each scenario. In the first scenario, the network routers are configured from EIGRP, IGRP, and IS-IS that is named EIGRP_IGRP_ISIS in our simulation. The OSPF_IGRP_ISIS scenario is a mixed from EIGRP, IGRP, and IS-IS protocols that is the second scenario. The third scenario is OSPF_IGRP_EIGRP that is the route redistribution among OSPF, IGRP, and IS-IS protocols. The simulation results showed that the performance of the EIGRP_IGRP_ISIS scenario is better than the other scenarios in terms of network convergence time, throughput, video packet delay variation, and FTP download response time. In contrast, the OSPF_IGRP_ISIS has less voice packet delay variation, video conferencing and voice packet end to end delays, and queuing delay as compared with the two other scenarios. On the other hand, the performance of the OSPF_IGRP_EIGRP scenario has better FTP upload response time, and voice jitter. 

KEYWORDS 

Route Redistribution, EIGRP, IGRP, IS-IS, OSPF.


Sunday, April 2, 2017

EVALUATION OF ENERGY CONSUMPTION OF REACTIVE AND PROACTIVE ROUTING PROTOCOLS IN MANET

 Mohamad T. Sultan and Salim M. Zaki 
1Department of Computer Science, Cihan University, Erbil, Iraq 

ABSTRACT

 Mobile Ad hoc Network (MANET) is a distributed, infrastructure-less and decentralized network. A routing protocol in MANET is used to find routes between mobile nodes to facilitate communication within the network. Numerous routing protocols have been proposed for MANET. Those routing protocols are designed to adaptively accommodate for dynamic unpredictable changes in network's topology. The mobile nodes in MANET are often powered by limited batteries and network lifetime relies heavily on the energy consumption of nodes. In consequence, the lack of a mobile node can lead to network partitioning. In this paper we analyse, evaluate and measure the energy efficiency of three prominent MANET routing protocols namely DSR, AODV and OLSR in addition to modified protocols. These routing protocols follow the reactive and the proactive routing schemes. A discussion and comparison highlighting their particular merits and drawbacks are also presented. Evaluation study and simulations are performed using NS-2 and its accompanying tools for analysis and investigation of results. 

KEYWORDS 

MANETs, Energy-aware, Routing protocols, Ad-hoc networks, power consumption.

Friday, March 31, 2017

MITIGATING INTERFERENCE TO GPS OPERATION USING VARIABLE FORGETTING FACTOR BASED RECURSIVE LEAST SQUARES ESTIMATION

Aseel AlRikabi and Taher AlSharabati 

Al-Ahliyya Amman University/Electronics and Communications Engineering Department, Jordan

ABSTRACT 

In this paper, an interference method based on signal processing is proposed. The approach is based on utilizing the maximum likelihood properties of the received signal. The approach is built on maximizing the probability of the desired data. The GPS data, which is constructed using Binary Phase Shift Keying (BPSK) modulation, is transmitted as “1’s” and as “0’s.” carried on 1575.42MHz carrier called the L1 frequency. The statistics of the GPS data and interference are utilized in terms of their distribution and variance. The statistics are used to update (adaptively) the forgetting factor (Lambda) of the Recursive Least Squares (RLS) filter. The proposed method is called Maximum Likelihood Variable Forgetting Factor (ML VFF). The adaptive update takes on assigning lambda to the maximum of the probabilities of the symbols based on the statistics mentioned. 

KEYWORDS 

Global Positioning System GPS, Recursive Least Squares (RLS) algorithm, Forgetting Factor (λ), interference, OTA carrier  


THE EFFECT OF SEEKING OPERATION ON QOE OF HTTP ADAPTIVE STREAMING SERVICES

Toshiro Nunome and Hiroaki Tani1 
1Graduate School of Engineering, Nagoya Institute of Technology, Nagoya, Japan 

ABSTRACT 

In this paper, we assess multidimensional QoE (Quality of Experience) of HTTP-based streaming services in seeking operation to evaluate the effect of two transmission schemes: adaptive bitrate streaming and progressive download. We perform a subjective experiment with two contents and various network load conditions. In the experiment, subjects find pre-specified scenes by means of seeking the video as they want to see the scenes right now. We also perform the principal component analysis for the assessment result of multidimensional QoE. We then find that the adaptive bitrate streaming is not necessarily effective for QoE enhancement; the effectiveness of the scheme depends on the usage of the system and network conditions. 

KEYWORDS

 Audio and Video Transmission, QoE, Adaptive Bitrate Streaming, Progressive Download 


Tuesday, March 28, 2017

DELAY-POWER PERFORMANCE COMPARISON OF MULTIPLIERS IN VLSI CIRCUIT DESIGN

 Sumit Vaidya1 and Deepak Dandekar2
1Department of Electronic & Telecommunication Engineering, OM College of Engineering, Wardha, Maharashtra, India
2Department of Electronic Engineering, B. D. College of Engineering, Wardha, Maharashtra, India

 Abstract

A typical processor central processing unit devotes a considerable amount of processing time in performing arithmetic operations, particularly multiplication operations. Multiplication is one of the basic arithmetic operations and it requires substantially more hardware resources and processing time than addition and subtraction. In fact, 8.72% of all the instruction in typical processing units is multiplication. In this paper, comparative study of different multipliers is done for low power requirement and high speed. The paper gives information of “Urdhva Tiryakbhyam” algorithm of Ancient Indian Vedic Mathematics which is utilized for multiplication to improve the speed, area parameters of multipliers. Vedic Mathematics suggests one more formula for multiplication of large number i.e. “Nikhilam Sutra” which can increase the speed of multiplier by reducing the number of iterations. 

Keywords 

Multiplier, Vedic Mathematics, VLSI design 



Friday, March 24, 2017

THE QUANTIZED DIFFERENTIAL COMPARATOR IN FLASH ANALOG TO DIGITAL CONVERTER DESIGN

Meghana Kulkarni1 , V. Sridhar2 , G.H.Kulkarni3
 1Asst.Prof., E & C Dept, Gogte Institute of Technology, Bgm, Karnataka, India. 
2 Principal, P.E.S. College of Engineering, Mandya, Karnataka, India. 
 3 Prof and Head, E & E Dept, Gogte Institute of Technology, Bgm, Karnataka, India 

ABSTRACT 

This paper proposes a Flash Analog to Digital Convsrter design based on the use of a Quantized Differential Comparator. The formulation explores the use of a systematically incorporated input offset voltage in a differential amplifier for quantizing the reference voltages necessary for Flash ADC architectures, thus eliminating the need for a passive resistor array for the purpose. This work is an attempt to extend the TIQ method, which uses systematic sizing of devices in a conventional CMOS inverter to accomplish the same. The formulation allows very small voltage comparison and complete elimination of resistor ladder circuit. The design has been carried out for the TSMC 0.18u technology at MOSIS. 

 KEYWORDS

 TIQ, Analog to Digital Converter.




More Details......

Tuesday, March 21, 2017

A 60 GHZ ANALOG PHASE SHIFTER IN 65 NM BULK CMOS PROCESS

 ETB.Samuel Jigme Harrison and Zhang Yue Ping 
Department of Electrical and Electronic Engineering, Nanyang Technological University, Singapore - 639798 

 ABSTRACT 

A 60 GHz Analog Phase Shifter in 65nm bulk CMOS process has been explored for microwave frequency applications. It is an analog phase shifter with three transistors in the form of an active circulator and a LC network to attain the desired phase shift. This phase shifter is designed to work at a high frequency of 60 GHz to attain phase shift range of 140o . The proposed phase shifter works at supply voltage lower than 2.5 V. The phase shifter exhibits low insertion loss of 3.73 dB and low power consumption which is a challenging result for circuits working in microwave frequencies. 

KEYWORDS 

60 GHz phase shifter, 65 nm CMOS, Active circulator


More Details...

COMPARATIVE INVESTIGATION FOR ENERGY CONSUMPTION OF DIFFERENT CHIPSETS BASED ON SCHEDULING FOR WIRELESS SENSOR NETWORKS

 Monica1 and Ajay K Sharma2 
Department of Computer Science and Engineering, Dr B R Ambedkar National Institute of Technology, Jalandhar, Punjab 

ABSTRACT 

Rapid progress in microelectromechanical system (MEMS) and radio frequency (RF) design has enabled the development of low-power, inexpensive, and network-enabled microsensors. These sensor nodes are capable of capturing various physical information, such as temperature, pressure, motion of an object, etc as well as mapping such physical characteristics of the environment to quantitative measurements. A typical wireless sensor network (WSN) consists of hundreds to thousands of such sensor nodes linked by a wireless medium. In this paper, we present a comparative investigation of energy consumption for few commercially available chipsets such as TR1001, CC1000 and CC1010 based on different scheduling methods for two types of deployment strategies. We conducted our experiment within the OMNeT++ simulator. 

Keywords 

 Wireless Sensor Networks, Scheduling Methods, Deployment, OMNeT++.

More Details...............

Monday, March 20, 2017

A Cluster Based Replication Architecture for Load Balancing in Peer-to-Peer Content Distribution

S.Ayyasamy1 and S.N. Sivanandam2
 1Asst. Professor, Department of Information Technology, Tamilnadu College of Engineering Coimbatore-641 659, Tamil Nadu, INDIA. 
 2 Professor and Head, Department of Computer Science and Engineering, PSG College of Technology, Peelamedu, Coimbatore-641 004, Tamil Nadu, INDIA. 

Abstract

 In P2P systems, large volumes of data are declustered naturally across a large number of peers. But it is very difficult to control the initial data distribution because every user has the freedom to share any data with other users. The system scalability can be improved by distributing the load across multiple servers which is proposed by replication. The large scale content distribution systems were improved broadly using the replication techniques. The demanded contents can be brought closer to the clients by multiplying the source of information geographically, which in turn reduce both the access latency and the network traffic. In addition to this, due to the intrinsic dynamism of the P2P environment, static data distribution cannot be expected to guarantee good load balancing. If the hot peers become bottleneck, it leads to increased user response time and significant performance degradation of the system. Hence an effective load balancing mechanism is necessary in such cases and it can be attained efficiently by intelligent data replication. In this paper, we propose a cluster based replication architecture for load-balancing in peer-to-peer content distribution systems. In addition to an intelligent replica placement technique, it also consists of an effective load balancing technique. In the intelligent replica placement technique, peers are grouped into strong and weak clusters based on their weight vector which comprises available capacity, CPU speed, access latency and memory size. In order to achieve complete load balancing across the system, an intracluster and inter-cluster load balancing algorithms are proposed. We are able to show that our proposed architecture attains less latency and better throughput with reduced bandwidth usage, through the simulation results. 

Keywords 

Replica, Overlay, Clusters, QoS, Content, Routing


More Details....