Skip to main content

Tenda 4G301 Review

Description:

      Tenda 4G301 is mid range consumer grade pocket router. Also it can act as a power bank.
It has four different modes as mentioned in specification. For complete specification you can visit Official Tenda.

Review:

      I am reviewing this product after using it hardly for 2 Months.

General:

    Tenda being a chinese manufacturer I am very surprised  that it has good build quality. But the is not fully comfortable. It also has some unsatisfied things into it. It come with only pure white color and glossy finish. Due to this even for fair usage your product gets scratched and dirty. There is no grip for placing it on the surface. The battery LED has abnormal behavior some times. Battery backup lasts more than 6 hrs but manufacturer claims for 15 hrs which is ridiculous. It has pleasant and neat interface for configuration purpose. While using  in 3G/4G router mode the dongle has to be removed to completely stop the router. And the very important thing to notice is it has non removable battery.

Let me give crisp points:


Pros:


  • Good batter backup(Approx 6 hrs).
  • Works with most of the dongles(Even not mentioned in compatibility list).
  • It also acts as a power bank.
  • Has LAN/WAN port.
  • Has batter level indicator.
  • Reasonable price.
  • compact design.  


Cons:

  • Glossy finish(Prone to scratch).
  • No grip to place on surface(Tip: Just paste rubber material down).
  • Power adapter not included.
  • Power flow to the USB port cannot be stopped.(Unless unplugged)
  • Less WI-FI range.(Not Very Bad)
  • Non removable battery.
  • Inconvenience in design.


Verdict:

    When comparing with the other products in market this look to be great for a price of around Rs.2000/-. Even though it has several issues still manufacturers promise for 3 years warranty. When comparing with price and performance ratio it stand ahead. So I recommend this product. I enjoy using this product. For any queries please comment below.


Labels

Labels:

Comments

Post a Comment

Popular posts from this blog

One of the best Torrent caching service.

Hi readers, It's been a long time since I made my last post on this blog. That's due to the migration of the blog to private servers.  Today I found a decent torrent caching service, which I have been looking for years. Initially, when I started, I couldn't find the services are really benefiting me. So I went with my own Virtual Private Server in Digital Ocean. I ran a five dollar per month instance for my torrent caching as well as a multipurpose server.  Of course, It has its pros and cons.  Pros: I was able to do anything I wanted. It served as a good multipurpose server. Relatively inexpensive. Cons: You need to be a computer geek for up and running. Even most of the things are automated, still few manual works have to be performed. It takes usual time for downloading unlike caching services(They can do it instantly). Finally, we have a hassle free torrent caching service  Seedr .  It is a free torrent caching servic...
Post a Comment
Read more

2-Dimensional Array with Dynamic Rows and Columns.

In Programming many times we have to store and work  with the data. But choosing the right way of storing is important. Array is one of the most simple and effective way of storing list of data.Now we have to multiple array of data. Ohh! that sounds easy we can use 2 Dimensional Array. I agree 2 Dimensional array is suitable but I have arrays of variable lengths. So simply creating 2-D Array will not be efficient because I have to specify the column size as the highest of my arrays. So there will be lot of unused space. The good solution can be Dynamic 2D Array with variable columns. Also Array of vectors can also be used. But we are not discussing about STL. Algorithm: Create a ptr to ptr to ptr with the name of your 2D Array to hold the Array of Pointers. Now create an Array of pointers depending on the no of rows and store the base address on the ptr to ptr. For every Row allocate the required memory and store the address in the array of pointers. You own the 2D...
Post a Comment
Read more

Merge Sort Implementation in C++

For a Programmer sorting is an easy task after writing the code for couple of pages. But there are many other sorting algorithms.  The question which is not being properly answered is which sorting algorithm you should choose.  This is the most frustrating situation where we feel bad about us. The best sorting algorithm depends only on the scenario in which you are intended to use.  Let us speak about the Merge sort. Merge sort uses the divide and conquer approach. Entirely the merge sort is an easy algorithm (Depends on the way you think). You cannot master merge sort until you think what is happening. It has a good worst case performance (0(N logN)). It uses an additional space to accomplish the goal. The implementation is mainly based on the recursion.  You can get real performance benefit when comparing to bubble,selection sort. That's enough for the quick intro. If you would like you know more do a research on yourself. The algorithm goes like th...
Post a Comment
Read more