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

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; 

More Details.... 

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. 

More Details.....

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.

More Details....

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.

More Details....