-
公开(公告)号：MY169842A
公开(公告)日：2019-05-16
申请号：MYPI2011700173
申请日：2011-11-24
Applicant: MIMOS BERHAD
Inventor： SHARIQ HASEEB , MOHD ARIFF ABDULLAH , MOHD FAHEEM MOHD EZANI
Abstract: The present invention relates to a method of selecting an access gateway from a plurality of detected gateways in a mobile node. Preferably, each available gateway identified by the mobile node is assigned with a priority score as an identifier to allow the mobile node for selecting the best gateway to carry out the data delivery. The method comprises the steps of recording all detected gateway in a list with a priority score computed for each gateway that the priority score (105) is acquired from a first value (102) generated for each gateway according to decay history, a second value (103) generated for each gateway according to round trip time (RTT) of the gateway and a third value (104) generated for each gateway from pre-set priority (PP) data in the mobile node by a user; and binding (107) to the gateway with highest priority score among the plurality of gateways.
-
公开(公告)号：MY169614A
公开(公告)日：2019-04-23
申请号：MYPI2012004652
申请日：2012-10-19
Applicant: MIMOS BERHAD
Inventor： MOHD ARIFF ABDULLAH , MUHAMMAD FAHEEM MOHD EZANI , SHARIQ HASEEB
IPC: H04W4/90
Abstract: The present invention discloses a method for prioritizing channel access in a wireless communication network. The method comprising registering with an access point (102) by one or more station as priority stations (101) during a Contention Period established by the access point (102) operating in the Distributed Coordination Function. The registered priority stations (101) will trigger the access point (102) to switch from the Distributed Coordination Function to the Point Coordination Function and thereby establishing a Contention Free Period when there is urgency by these priority stations (101) to access a channel. During the Contention Free Period. the access point (102) will first poll the registered priority stations (101) with higher priority level and grant them the priority to access the channel than those priority stations ( l O1) with lower priority level. The access point (102) will resume the Coordination Period when the maximum Contention-Free-Period duration is reached and/or all the registered priority stations (101) have transmitted. Most ruustrated: Figure 2
-
Patent Agency Ranking
公开(公告)号：MY178188A
公开(公告)日：2020-10-06
申请号：MYPI2013702354
申请日：2013-12-04
Applicant: MIMOS BERHAD
Inventor： MOHD ARIFF ABDULLAH , MUHAMMAD FAHEEM MOHD EZANI , SRIDHAR SIVANAND , PUTRI SHAHNIM KHALID , SHARIQ HASEEB
Abstract: The present invention is related to a system and a method for authorising an access point in a network without involving client device. The present invention identifies (10) and lists only access point that has the same SSID as the network (11) and then checks the access point for MAC address validity (20). Only access point with valid SSID and MAC address has an authentication string (30). The authentication string and a scanner public key are encrypted using a server public key in a scanner (800) (40). The scanner (800) then sends the encrypted authentication string and the encrypted scanner public key to a server (900) via the access point (50) to be decrypted (60). Then, the server (900) encrypts the authentication string using the decrypted scanner public key (45) and sends the encrypted authentication string to the scanner (800) (55). The scanner (800) that receives the encrypted authentication string decrypts the authentication string using a scanner private key (65) and compares it (70) with the authentication string from before the encryption and decryption process. If a match is found, the access point is authorised and possibly overcame 3 spoofing attacks in the network.
-
公开(公告)号：MY164507A
公开(公告)日：2017-12-29
申请号：MYPI20097011
申请日：2009-08-04
Applicant: MIMOS BERHAD
Inventor： MOHD ARIFF ABDULLAH , SHARIQ HASEEB , MUHAMMAD FAHEEM MOHD EZANI , DR MAZLAN ABBAS
Abstract: A METHOD TO IMPLEMENT ROUTE OPTIMIZATION IN NEMO BY ASSIGNING SECONDARY ADDRESS TO THE MOBILE NETWORK NODE (MNN) (109) AS AN ADDITION TO THE EXISTING HOME ADDRESS (HOA). THIS SECONDARY ADDRESS WILL NOT BE THE SAME AS CARE-OF-ADDRESS (COA) ASSIGNED TO THE MOBILE ROUTER. WE WILL CALL THE NODE'S SECONDARY ADDRESS AS MOBILE ADDRESS (MOA). SIMILAR TO HOA, A MNN (109) WILL MAINTAIN THE SAME MOA DISREGARD OF THE NETWORK IT RESIDES IN. MOA WILL BE ASSIGNED BASED ON MOBILE SUBNET (MOS) ASSIGNED TO THE MR. WHENEVER THE MOBILE NETWORK CHANGES ITS ATTACHMENT POINT, MNN (109) WILL SENT PACKETS TO CN (103) BY USING MOA AS THE SOURCE ADDRESS, THUS UPDATING THE ROUTING TABLE ALONG THE WAY TO CN (103). CN (103) WILL THEN BE ABLE TO PERFORM RO TO THE MOBILE ADDRESS OF MNN (109). HOWEVER, TO MAINTAIN THE TRANSPARENCY OF MOBILITY IN NEMO, MNN (109) DOES NOT PHYSICALLY USE MOA. INSTEAD, MNN (109) WILL ONLY USE HOA AS IT IS SUPPOSED TO BE. THIS HOA WILL BE CHANGED INTO MOA AT THE MR. THE MOST ILLUSTRATIVE DRAWING: FIG. 12
-
公开(公告)号：MY159199A
公开(公告)日：2016-12-30
申请号：MYPI2011003452
申请日：2011-07-25
Applicant: MIMOS BERHAD
Inventor： ABDELGADIR TAGELDIN , SHARIQ HASEEB , MOHAMMAD MOSHEE UDDIN , MUHAMMAD FAHEEM MOHD EZANI , MOHD ARIFF ABDULLAH
IPC: H04L29/08
Abstract: GLOBAL SERVICES REDUNDANCY IS PROVIDED USING IP ADDRESS MOBILITY WHEREIN THE MAIN SERVER OBTAINS AN ADDRESS WHICH IS THE SAME ADDRESS REGISTERED IN THE DNS SERVER WHICH ALLOWS CLIENTS ACCESS SERVICES OFFERED BY THE SERVER THROUGH THE ASSIGNED IP IN THE DNS. REDUNDANT SERVER IS REQUIRED TO BE IN THE SAME LAN AS THE MAIN SERVER AND IF THE LINK TO BOTH THE SERVERS FAILS, THEN THE SERVICE IS DISRUPTED. THE PRESENT INVENTION INTRODUCES A SESSION CAPTURING SERVER, SCS (108) THE SESSION CAPTURING SERVER, SCS (108) TO MAINTAIN MAPPING TABLE OF REDUNDANT SERVERS (106) IP ADDRESS WITH MAIN SERVERS (104) IP ADDRESS. SESSION CAPTURING SERVER, SCS (106) CAPTURES ONGOING SESSIONS OF THE MAIN SERVER (104) THAT HAS FAILED AND FORWARD THE CAPTURED SESSIONS TO A BACKUP SERVER FOR CONTINUING SERVICES. THE MOST ILLUSTRATIVE DRAWING IS
-
公开(公告)号：MY158852A
公开(公告)日：2016-11-15
申请号：MYPI20097010
申请日：2009-08-04
Applicant: MIMOS BERHAD
Abstract: THE PRESENT INVENTION PROPOSES A METHOD TO IMPLEMENT ROUTE OPTIMIZATION IN NEMO BY DEVISING A MECHANISM OF SUBNET TRANSLATION AND APPLYING IT IN NEMO'S ENVIRONMENT. THROUGH THE PROPOSED METHOD, THE CORRESPONDING NODE CAN SEND THE PACKETS STRAIGHT TO THE MOBILE NETWORK NODE (MNN) BY USING MNN'S CARE-OF-ADDRESS. INSTEAD OF USING CARE-OF-ADDRESS FOR NON-TRANSPARENT MOBILITY AS IN MOBILE IPv6 (MIPv6), SOME TRANSPARENCY OF THE NEMO IS MAINTAINED BY PERFORMING TRANSLATION BETWEEN HOME ADDRESS (HoA) AND CARE-OF-ADDRESS AT THE MOBILE ROUTER. THE MOST ILLUSTRATIVE DRAWING: FIG. 10
-
公开(公告)号：WO2009064168A3
公开(公告)日：2009-07-30
申请号：PCT/MY2008000142
申请日：2008-11-14
Applicant: MIMOS BERHAD , MOHD ARIFF ABDULLAH , NOR AZRISHAHRIL ARIS , GOPAKUMAR KURUP
Inventor： MOHD ARIFF ABDULLAH , NOR AZRISHAHRIL ARIS , GOPAKUMAR KURUP
CPC classification number: H04L12/1886 , H04L65/4076 , H04L65/607 , H04L67/02
Abstract: The present invention a method for encapsulating multicast packets (1) in unicast packets (2), the method comprising of; a) working in parallel at least two servers (5), a web server (51) and a streaming server (52); b) sending out a web page (30) by the web server (51) and streaming a multimedia file (40) by the streaming server (52) directly to at least one viewer (20); c) streaming multicast packets (1) by the streaming server (52) and sending unicast packets (2) by the web server (51) but displayed as a single web page in at least one viewer (20) web browser (400); d) eliminating the needs of sending multimedia file (40) by the web server (51) to make it possible for a multicast multimedia file (40) to be streamed to the at least one viewer (20).
Abstract translation: 本发明是一种在单播分组（2）中封装多播分组（1）的方法，该方法包括： a）并行工作至少两个服务器（5），web服务器（51）和流服务器（52）; b）由web服务器（51）发送一个网页（30），并将该流媒体服务器（52）的多媒体文件（40）直接传送到至少一个观看者（20）; c）由流服务器（52）流式传输多播数据包（1），并由web服务器（51）发送单播数据包（2），但在至少一个浏览器（20）网络浏览器（400）中显示为单个网页; d）消除由web服务器（51）发送多媒体文件（40）的需要，使多播多媒体文件（40）能够被传输到至少一个观看者（20）。
-
-
-
-
-
-
Search Results
7
records
(took 0.02 seconds)
