NEIGHBOUR DISCOVERY-BASED ROUTING METHOD FOR WIRELESS NETWORKS

    公开(公告)号:MY157257A

    公开(公告)日:2016-05-31

    申请号:MYPI2011002427

    申请日:2011-05-27

    Applicant: MIMOS BERHAD

    Abstract: A METHOD OF ROUTING COMMUNICATION ON-THE-GO IN A WIRELESS MOBILE NETWORK COMPRISING OF A PLURALITY OF MOBILE SENSOR NODES IS DISCLOSED. THE METHOD COMPRISES ENABLING EACH NODE TO GATHER INFORMATION ON ITS NEIGHBOURING NODES AND STORE THE INFORMATION IN THE NODES? RESPECTIVE NEIGHBOUR LIST TABLE COMPRISING NEIGHBOURING NODES? ADDRESSES, HOP DISTANCE AND NEXT INTERMEDIATE NEIGHBOURS? ADDRESS. THESE INFORMATION GATHERED MAY THEN BE SHARED AMONGST NEIGHBOURING NODES. USING THE GATHERED AND/OR SHARED INFORMATION, A ROUTE FOR COMMUNICATING MESSAGE TO A DESTINATION NODE IS THUS DETERMINED. THE ROUTE DETERMINING STEP IS CONSIDERED WITHIN A PREDETERMINED MAXIMUM NUMBER OF HOPS THROUGH THE NEIGHBOURING NODES. IF COMMUNICATION LINK TO THE DESTINATION IS BROKEN, THE GATHERED AND/OR SHARED INFORMATION MAY BE OPTIONALLY UPDATED. NEXT, A MESSAGE RECEIVED AT SAID EACH NODE IS DETERMINED WHETHER IT IS DESTINED FOR ITSELF OR TO BE ONWARDLY ROUTED TO A NEXT NEIGHBOURING NODE. AFTER THIS DETERMINATION, THE MESSAGE IS SENT TO THE DESTINATION OR INTERMEDIATE NODE. THE NODE AWARENESS MAY BE EXTENDED TO AT LEAST AT LEAST 2 HOPS AWAY AND THE MAXIMUM NUMBER OF HOPS MAY BE PREDETERMINED.

Patent Agency Ranking