Open Access

ARTICLE

Morteza Okhovvat, Mohammad Reza Kangavari^*
Computer Systems Science and Engineering, Vol.34, No.1, pp. 5-12, 2019, DOI:10.32604/csse.2019.34.005
Abstract In this paper, we propose a mathematical task dispatching model to reduce the total tasks completion time, i.e. make-span, in Wireless Sensor Actor Networks (WSANs). The proposed approach minimizes the completion time of tasks that have been allocated to actors but have not yet been dispatched to actors for execution in the networks. We calculate the best rate of dispatching of tasks by the network sink to allocated actors through a steady state analysis of our proposed model to solve equations and inequalities. It is shown that this dispatching rate improves the network lifetime too. Experimental results with a prototyped… More >

View

892

Download

742

Cited by

8

Open Access

ARTICLE

Morteza Okhovvat, Mohammad Reza Kangavari^*
Computer Systems Science and Engineering, Vol.34, No.1, pp. 13-21, 2019, DOI:10.32604/csse.2019.34.013
Abstract Existing works on scheduling in Wireless Sensor Actor Networks (WSANs) are mostly concerned with energy savings and ignore time constraints and thus increase the make-span of the network. Moreover, these algorithms usually do not consider balance of workloads on the actor nodes and hence, sometimes some of the actors are busy when some others are idle. These problem causes the actors are not utilized properly and the actors’ lifetime is reduced. In this paper we take both time awareness and balance of workloads on the actor in WSANs into account and propose a convex optimization model (TAMMs) to minimize make-span.… More >

View

952

Download

744

Cited by

4

Open Access

ARTICLE

Resul Das^1,∗, Muhammet Baykara¹, Gurkan Tuna²
Computer Systems Science and Engineering, Vol.34, No.1, pp. 23-32, 2019, DOI:10.32604/csse.2019.34.023
Abstract One of the most well-known and used algorithms for Steganography is Least Significant Bit (LSB) substitution. Although LSB has several advantages such as simplicity, efficiency, and easy-to-do implementation, it has some distinct disadvantages such as it openness to miscellaneous attacks. In this study, we aim to improve the traditional LSB algorithm by eliminating its main disadvantage, being easy to detect, and this way propose an enhanced LSB algorithm called E-LSB. We mainly aim to minimize differences which are due to encryption and image hiding steps in LSB algorithm and make it more difficult to notice that some text has been… More >

View

959

Download

685

Cited by

5

Open Access

ARTICLE

Meera Sharma¹, H. Pham², V.B. Singh³
Computer Systems Science and Engineering, Vol.34, No.1, pp. 33-46, 2019, DOI:10.32604/csse.2019.34.033
Abstract In Open Source Software (OSS), users report different issues on issues tracking systems. Due to time constraint, it is not possible for developers to resolve all the issues in the current release. The leftover issues which are not addressed in the current release are added in the next release issue content. Fixing of issues result in code changes that can be quantified with a measure known as complexity of code changes or entropy. We have developed a 2-dimensional entropy based mathematical model to determine the leftover issues of different releases of five Apache open source products. A model for release… More >

View

891

Download

733

Cited by

10

Open Access

ARTICLE

Vengadeswaran^∗, Balasundaram
Computer Systems Science and Engineering, Vol.34, No.1, pp. 47-60, 2019, DOI:10.32604/csse.2019.34.047
Abstract The tremendous growth of data being generated today is making storage and computing a mammoth task. With its distributed processing capability Hadoop gives an efficient solution for such large data. Hadoop’s default data placement strategy places the data blocks randomly across the nodes without considering the execution parameters resulting in several lacunas such as increased execution time, query latency etc., Also, most of the data required for a task execution may not be locally available which creates data-locality problem. Hence we propose an innovative data placement strategy based on dependency of data blocks across the nodes. Our strategy dynamically analyses… More >

View

820

Download

892

Cited by

7