AU2021104117A4 - Method of Coastal Communication and Response System during Tropical Cyclone using Mobile Ad-hoc Network - Google Patents

Method of Coastal Communication and Response System during Tropical Cyclone using Mobile Ad-hoc Network Download PDF

Info

Publication number
AU2021104117A4
AU2021104117A4 AU2021104117A AU2021104117A AU2021104117A4 AU 2021104117 A4 AU2021104117 A4 AU 2021104117A4 AU 2021104117 A AU2021104117 A AU 2021104117A AU 2021104117 A AU2021104117 A AU 2021104117A AU 2021104117 A4 AU2021104117 A4 AU 2021104117A4
Authority
AU
Australia
Prior art keywords
node
multicast
nodes
message
source
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Ceased
Application number
AU2021104117A
Inventor
Mrutyunjaya Panda
Sanjaya Kumar Sarangi
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Agasty Snehalata
Chowdhury Manas Ranjan
Lenka Rasmita
Pati Dakshya Prasad
Original Assignee
Agasty Snehalata
Chowdhury Manas Ranjan
Lenka Rasmita
Pati Dakshya Prasad
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Agasty Snehalata, Chowdhury Manas Ranjan, Lenka Rasmita, Pati Dakshya Prasad filed Critical Agasty Snehalata
Priority to AU2021104117A priority Critical patent/AU2021104117A4/en
Application granted granted Critical
Publication of AU2021104117A4 publication Critical patent/AU2021104117A4/en
Ceased legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00Routing or path finding of packets in data switching networks
    • H04L45/16Multipoint routing
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00Data switching networks
    • H04L12/02Details
    • H04L12/16Arrangements for providing special services to substations
    • H04L12/18Arrangements for providing special services to substations for broadcast or conference, e.g. multicast
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W84/00Network topologies
    • H04W84/18Self-organising networks, e.g. ad-hoc networks or sensor networks
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W88/00Devices specially adapted for wireless communication networks, e.g. terminals, base stations or access point devices
    • H04W88/02Terminal devices
    • H04W88/04Terminal devices adapted for relaying to or from another terminal or user

Abstract

A method (100) for scaling mobile ad-hoc network, comprises ofcreating a multicast tree (104) in the mobile ad-hoc network (MANET) (102), consists of a set of scalability pair factor (FSP) and a plurality of nodes (106);forwarding a wireless communication link (108) implemented with a plurality of multicast packets (110) using a mesh based forwarding group technique, broadcasting a join query message, keeping a source address andsequence number of the source node (106a)of a received packet;updating a databse with a source identity and cost function of the source node (106a), when the received packet is not identical and time to live is greater than zero, the join query message is again broadcasted till the message reaches to a first destination node (106c) having same multicast group, a join reply message is broadcasted by the destination node; and similarly the message reaches to a second destination node (106d). 14 102 10 104 110 1068 106 102- MANET rI 104- MULTICAST TREE 106- PLURAUTY NODE 106. SOURCE NODE 106b- TRANSITIONALNODE 106c- IRST DESTINATION NODE 10&d- SECOND DESTINATION 108-WIRELESSCOMMUNICATION UNK 110-MULTICASTPACKETS 112-DATABASE SSatellte *12 BaseStatio Fh.g Boa.s FIGURE- 3

Description

10
104 110
1068
106 102- MANET rI 104- MULTICAST TREE 106- PLURAUTY NODE 106. SOURCE NODE 106b- TRANSITIONALNODE 106c- IRST DESTINATION NODE 10&d- SECOND DESTINATION 108-WIRELESSCOMMUNICATION UNK 110-MULTICASTPACKETS 112-DATABASE
SSatellte
*12 BaseStatio Fh.g Boa.s
FIGURE- 3
Method of Coastal Communication and Response System during Tropical Cyclone using Mobile Ad-hoc Network
FIELDOFINVENTION
The present invention generally relates to afield of communication systems. More particularly, the present invention relates to a method for transmitting information from a particular region to another using mobile ad-hoc network. The Invention is focused to Coastal Communication and response system during tropical cyclone and emergency preparedness.
BACKGROUND OF THE INVENTION
Several solutions have been provided in the art to provide early warnings on occurrence of disasters such as cyclones. Cyclones, severe storms create disaster and incur greater amount of damage in coastal areas. This causes huge damage to the nearby areas and also to the fishermen. Conventionally, MANETs have been widely used for communication of information and are defined as self-configuring, dynamic and infrastructure less network, routing becomes a challenging task. In presence of 4G technology,the cellular based application for disaster scenario that are standalone in nature included mobile Map used in emergency situations to overcome most of the firefighter's communication problems and a novel approach based on mobile electronic triage tags to make the victims information available at the base of operations for early medical resource allocation.
The above mentioned conventional methods possess certain limitations such as, mobile phones are relatively ineffective as a mode of communication at sea. It becomes difficult to broadcast the warning to the fisherman present deep inside the sea and thus they end up losing their lives.
In order to overcome the above-mentioned limitations, there exists a need to develop a scalable node selection system and Optimized Geographical multicast routing protocol to ensure the ability of cost function of routing protocol to perform competently as one or more essential parameters of the network to be large in value reliable communication in between the no of regions through effective message passing system on clustered network.
SUMMARY OF THE INVENTION
The present invention generally relates to a method forcommunication using hybridization of mobile ad-hoc network.
An object of the present invention is to provide a scalable node selection technique.
Another object of the present invention is toautomatically look up contacts to order equipment or service.
Another object of the present invention is toprovide a multicast routing method to communicate to a larger group of nodes in less time.
According to an aspect of the present disclosure,the method involved in scaling a MANET comprises of:
The first Step discloses about creating a multicast tree in the mobile ad-hoc network (MANET), wherein the multicast tree consists of a set of scalability pair factor (FSP) and a plurality of nodes.
The second step discloses about forwarding a wireless communication link implemented with a plurality of multicast packets using a mesh based forwarding group technique, wherein the multicast packets store information for communication.
The third step discloses about broadcasting a join query message periodically to the plurality of nodes connected in a network by a source node for refreshing information transmission multicast route, wherein when a transitional node receives the broadcasted join query message, a source address and a sequence number of the source node is kept in a message buffer to prevent duplicate processing of a received packet.
The fourth Step discloses about updating a databse with a recent source identity and cost function of the source node, wherein when the received packet is not identical and time to live is greater than zero, the join query message is again broadcasted till the message reaches to a first destination node having same multicast group with that of the source node, a join reply message is broadcasted by the first destination node.
The fifth Step discloses about matching a hop address of the upcoming join query message with identity of the each of the plurality of node to behave as a second destination node for forwarding a group flag for the same multicast group, wherein rebroadcasting join reply message to the matched multicast group of the second destination node using a shortest path.
To further clarify advantages and features of the present invention, a more particular description of the invention will be rendered by reference to specific embodiments thereof, which is illustrated in the appended drawings. It is appreciated that these drawings depict only typical embodiments of the invention and are therefore not to be considered limiting of its scope. The invention will be described and explained with additional specificity and detail with the accompanying drawings.
BRIEF DESCRIPTION OF FIGURES
These and other features, aspects, and advantages of the present invention will become better understood when the following detailed description is read with reference to the accompanying drawings in which like characters represent like parts throughout the drawings, wherein:
Figure 1 illustrates a block diagram of the components involved in the method for scaling a MANET,
Figure 2illustrates a flow diagram of the method involved in scaling a MANET, and
Figure 3illustrates a schematic diagram of the linkage of the different components for scaling a MANET (102).
Further, skilled artisans will appreciate that elements in the drawings are illustrated for simplicity and may not have been necessarily been drawn to scale. For example, the flow charts illustrate the method in terms of the most prominent steps involved to help to improve understanding of aspects of the present invention. Furthermore, in terms of the construction of the device, one or more components of the device may have been represented in the drawings by conventional symbols, and the drawings may show only those specific details that are pertinent to understanding the embodiments of the present invention so as not to obscure the drawings with details that will be readily apparent to those of ordinary skill in the art having benefit of the description herein.
DETAILED DESCRIPTION
For the purpose of promoting an understanding of the principles of the invention, reference will now be made to the embodiment illustrated in the drawings and specific language will be used to describe the same. It will nevertheless be understood that no limitation of the scope of the invention is thereby intended, such alterations and further modifications in the illustrated system, and such further applications of the principles of the invention as illustrated therein being contemplated as would normally occur to one skilled in the art to which the invention relates.
It will be understood by those skilled in the art that the foregoing general description and the following detailed description are exemplary and explanatory of the invention and are not intended to be restrictive thereof.
Reference throughout this specification to "an aspect", "another aspect" or similar language means that a particular feature, structure, or characteristic described in connection with the embodiment is included in at least one embodiment of the present invention. Thus, appearances of the phrase "in an embodiment", "in another embodiment" and similar language throughout this specification may, but do not necessarily, all refer to the same embodiment.
The terms "comprises", "comprising", or any other variations thereof, are intended to cover a non-exclusive inclusion, such that a process or method that comprises a list of steps does not include only those steps but may include other steps not expressly listed or inherent to such process or method. Similarly, one or more devices or sub-systems or elements or structures or components proceeded by "comprises...a" does not, without more constraints, preclude the existence of other devices or other sub-systems or other elements or other structures or other components or additional devices or additional sub-systems or additional elements or additional structures or additional components.
Unless otherwise defined, all technical and scientific terms used herein have the same meaning as commonly understood by one of ordinary skill in the art to which this invention belongs. The system, methods, and examples provided herein are illustrative only and not intended to be limiting.
Embodiments of the present invention will be described below in detail with reference to the accompanying drawings.
Figure 1 illustrates a block diagram of the components involved in the method for scaling a MANET.
The components include a MANET (102), a multicast tree (104), a plurality of nodes (106), a source node (106a), a transitional node (106b), a first destination node (106c), a second destination node (106d), a wireless communication link (108), multicast packets (110), and a databse (112).
MANET (102) stands for Mobile adhoc Network also called a wireless adhoc network or adhoc wireless network that usually has a routable networking environment on top of a Link Layer (108) ad hoc network. The MANETS (102) are autonomously self-organized networks without fixed topology. In such a network, each node acts as both router and hosts at the same time. All network nodes are equivalent to each other and can move out or join in the network freely.
Each device in a MANET (102) is free to move independently in any direction, and therefore change its links (108) to other devices frequently. MANETs (102) consist of a peer-to-peer, self-forming, self healing network. MANETs (102) circa 2000-2015 typically communicate at radio frequencies (30 MHz - 5 GHz). Each source node (106a) and destination node of the MANET (102) are connected using the communication link (108) implemented with digital radio packets for sharing information.
Multicast tree (104) is about building forwarding trees from the source node (106a) to the multicast group of the destination node using a Shortest Path Tree (SPT). In the SPT each path from the source node (106a) to the plurality of nodes (106) is the shortest possible. Multicast IP Routing protocols used in multicast tree (104)are used to distribute information to the destination nodes. Using multicast, a source node (106a)can send a single copy of data packet to a single multicast address, which is then distributed to an entire group of recipients.
In communication networks, information is sent point to point by a single source node (106a) to one node (unicast) or to multiple target nodes (multicast) or from a single point to many nodes (broadcast). The Source node (106a) is responsible for sending information to the destination node via routing protocols and following shortest path.
When the source node (106a) wants to transfer information to the plurality of node (106), the destination node should relay within the radio range of the source node (106a) that wants to start the communication. The transitional nodes (106b) within the network help in sending the multicast packets (110) from the source node (106a) to the destination node.
The information such as source identity, destination identity, cost calculation, etc. are stored in a server or a database (112).
Figure 2illustrates a flow diagram of the method involved in scaling a MANET (102). The method (200) comprises of:
Step (202) discloses about creating a multicast tree (104) in the mobile ad-hoc network (MANET) (102), wherein the multicast tree (104) consists of a set of scalability pair factor (FSP) and a plurality of nodes (106). The FSP is calculated based on a plurality of parameters such as energy level of the plurality of nodes (106) and distance between at least two subsequent nodes from the plurality of nodes (106).
Step (204) discloses about forwarding a wireless communication link (108) implemented with a plurality of multicast packets (110) using a mesh based forwarding group technique, wherein the multicast packets (110) store information for communication. The multicast packets (110) are usually digital packet radios.
Step (206) discloses about broadcasting a join query message periodically to the plurality of nodes (106) connected in a network by a source node (106a) for refreshing information transmission multicast route, wherein when a transitional node (106b) receives the broadcasted join query message, a source address and a sequence number of the source node (106a) is kept in a message buffer to prevent duplicate processing of a received packet.
Step (208) discloses about updating a databse (112) with a recent source identity and cost function of the source node (106a), wherein when the received packet is not identical and time to live is greater than zero, the join query message is again broadcasted till the message reaches to a first destination node (106c) having same multicast group with that of the source node (106a), a join reply message is broadcasted by the first destination node (106c). The cost functionis calculated during canning multicast packets (110) to the first and second destination nodes (106d), whereinwhen the plurality of node (106) receives a data packet, it checks and forwards if it is a forwarding node and the packet is not identical.
Step (210) discloses about matching a hop address of the upcoming join query message with identity of the each of the plurality of node (106) to behave as a second destination node (106d) for forwarding a group flag for the same multicast group, wherein rebroadcasting join reply message to the matched multicast group of the second destination node (106d) using a shortest path.
Figure 3illustrates aschematic diagram of the linkage of the different components for scaling a MANET (102). The different components comprise of a multicast tree (104), a plurality of node (106), a source node (106a), a transitional node (106b), a first destination node (106c), a second destination node (106d), a wireless communication link (108), multicast packets (110), and a databse (112).
The database (112) is linked to a plurality of interconnected base station through wireless communication links (108) that includes a plurality of node (106). The plurality of nodes (106) transmits the information stored in multicast packets (110) from the source node (106a) to a first destination node (106c) and a second destination node (106d) through the transitional node (106b).
The multicast tree (104) is created in the MANET (102) that consists of a set of scalability pair factor (FSP) and the plurality of nodes (106).
The multicast packets (110) are forwarded to the wireless communication link (108) using a mesh based forwarding group technique. The multicast packets (110) are usually digital packet radios.
The source node (106a) broadcasts a join query message periodically to the plurality of nodes (106) connected in a network for refreshing information transmission multicast route, wherein when a transitional node (106b) receives the broadcasted join query message, a source address and a sequence number of the source node (106a) is kept in a message buffer to prevent duplicate processing of a received packet.
The databse (112) is updated with a recent source identity and cost function of the source node (106a), wherein when the received packet is not identical and time to live is greater than zero, the join query message is again broadcasted till the message reaches to a first destination node (106c) having same multicast group with that of the source node (106a), a join reply message is broadcasted by the first destination node (106c). The destination nodes (106c, 106d) may be present near the source node (106a) or far away from the source node (106b). The cost function is calculated during canning multicast packets (110) to the first and second destination nodes (106d), wherein when the plurality of node (106) receives a data packet, it checks and forwards if it is a forwarding node and the packet is not identical.
The upcoming join query message includes a hop address and matches with identity of the each of the plurality of node (106) to behave as a second destination node (106d) for forwarding a group flag for the same multicast group, wherein rebroadcasting join reply message to the matched multicast group of the second destination node (106d) using a shortest path.
The drawings and the forgoing description give examples of embodiments. Those skilled in the art will appreciate that one or more of the described elements may well be combined into a single functional element. Alternatively, certain elements may be split into multiple functional elements. Elements from one embodiment may be added to another embodiment. For example, orders of processes described herein may be changed and are not limited to the manner described herein. Moreover, the actions of any flow diagram need not be implemented in the order shown; nor do all of the acts necessarily need to be performed. Also, those acts that are not dependent on other acts may be performed in parallel with the other acts. The scope of embodiments is by no means limited by these specific examples. Numerous variations, whether explicitly given in the specification or not, such as differences in structure, dimension, and use of material, are possible. The scope of embodiments is at least as broad as given by the following claims.
Benefits, other advantages, and solutions to problems have been described above with regard to specific embodiments. However, the benefits, advantages, solutions to problems, and any component(s) that may cause any benefit, advantage, or solution to occur or become more pronounced are not to be construed as a critical, required, or essential feature or component of any or all the claims.

Claims (5)

WE CLAIM
1. A method (100) for scaling mobile ad-hoc network (102), wherein the method(100) comprises of:
creating a multicast tree (104) in the mobile ad-hoc network (MANET) (102), wherein the multicast tree (104) consists of a set of scalability pair factor (FSP) and a plurality of nodes (106);
forwarding a wireless communication link (108) implemented with a plurality of multicast packets (110) using a mesh based forwarding group technique, wherein the multicast packets (110) store information for communication; characterized in that
broadcasting a join query message periodically to the plurality of nodes (106) connected in a network by a source node (106a) for refreshing information transmission multicast route, wherein when a transitional node (106b) receives the broadcasted join query message, a source address and a sequence number of the source node (106a) is kept in a message buffer to prevent duplicate processing of a received packet;
updating a databse (112) with a recent source identity and cost function of the source node (106a), wherein when the received packet is not identical and time to live is greater than zero, the join query message is again broadcasted till the message reaches to a first destination node (106c) having same multicast group with that of the source node (106a), a join reply message is broadcasted by the first destination node (106c); and
matching a hop address of the upcoming join query messagewith identity of the each of the plurality of node (106) to behave as a second destination node(106d) for forwarding a group flag for the same multicast group, wherein rebroadcasting join reply message to the matched multicast group of the second destination node (106d) using a shortest path.
2. The method as claimed in claim 1, wherein wireless communication links (108) is established to transmit and receive information between plurality of nodes (106) and is interconnected with a plurality of base station.
3. The method as claimed in claim 1, whereinthe FSP is calculated based on a plurality of parameters such as energy level of the plurality of nodes (106) and distance between at least two subsequent nodes from the plurality of nodes (106).
4. The method as claimed in claim 1, whereincalculating the cost function duringcanning multicast packets (110) to the first and second destination nodes (106d), whereinwhen the plurality of node (106) receives a data packet, it checks and forwards if it is a forwarding node and the packet is not identical.
5. The method as claimed in claim 1, wherein the multicast packets (110) are usually digital packet radios.
FiGURE-1
FIGURE- 2
FIGURE- 3
AU2021104117A 2021-07-14 2021-07-14 Method of Coastal Communication and Response System during Tropical Cyclone using Mobile Ad-hoc Network Ceased AU2021104117A4 (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
AU2021104117A AU2021104117A4 (en) 2021-07-14 2021-07-14 Method of Coastal Communication and Response System during Tropical Cyclone using Mobile Ad-hoc Network

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
AU2021104117A AU2021104117A4 (en) 2021-07-14 2021-07-14 Method of Coastal Communication and Response System during Tropical Cyclone using Mobile Ad-hoc Network

Publications (1)

Publication Number Publication Date
AU2021104117A4 true AU2021104117A4 (en) 2021-09-09

Family

ID=77563785

Family Applications (1)

Application Number Title Priority Date Filing Date
AU2021104117A Ceased AU2021104117A4 (en) 2021-07-14 2021-07-14 Method of Coastal Communication and Response System during Tropical Cyclone using Mobile Ad-hoc Network

Country Status (1)

Country Link
AU (1) AU2021104117A4 (en)

Similar Documents

Publication Publication Date Title
EP1733516B1 (en) Method, communication device and system for detecting neighboring nodes in a wireless multihop network using ndp
JP5805813B2 (en) Method and system for peer-to-peer network discovery using multi-user diversity
Jayakumar et al. Ad hoc mobile wireless networks routing protocols–a review
US8483192B2 (en) Six-address scheme for multiple hop forwarding in wireless mesh networks
US20070274232A1 (en) Method, Communication Device and System for Detecting Neighboring Nodes in a Wireless Multihop Network Using Ndp
ZA200602630B (en) Method for the transmission of information in a communication system using a path
Aparecido Data dissemination in vehicular networks: Challenges, solutions, and future perspectives
Najafzadeh et al. Broadcasting in connected and fragmented vehicular ad hoc networks
Yokoyama et al. A beaconing-based opportunistic service discovery protocol for vehicular networks
Sharma et al. Multipath reliable range node selection distance vector routing for VANET: Design approach
Bousbaa et al. Robust geocast routing protocols for safety and comfort applications in VANETs
AU2021104117A4 (en) Method of Coastal Communication and Response System during Tropical Cyclone using Mobile Ad-hoc Network
Kaur et al. A survey on data dissemination protocols used in vanets
Totani et al. An efficient broadcast-based information transfer method based on location data over MANET
Cheng et al. Group-centric networking: addressing information sharing requirements at the tactical edge
Le Sommer et al. Location-Aware Routing for Service-Oriented Opportunistic Computing
Hauge et al. Limiting the flooding of simplified multicast forwarding to a defined scope
Lipman et al. Optimized flooding algorithms for ad hoc networks
Duc-Tuyen et al. Efficient and reliable GPS-based wireless ad hoc for marine search rescue system
Hauge et al. Group communication in tactical networks: A discussion
Landmark et al. A Flexible and Dynamic Method for Efficient Group Communication in Mobile Military Networks
KR100690299B1 (en) Apparatus and method of route recovery in mobile ad hoc network
Kamakshi et al. Distributed algorithm for constructing efficient tree topology for message dissemination in vehicular networks
KR20050079459A (en) Secure router and method for routing thereof
Natesapillai et al. A Review of Broadcasting Methods for Mobile Ad Hoc Network

Legal Events

Date Code Title Description
FGI Letters patent sealed or granted (innovation patent)
MK22 Patent ceased section 143a(d), or expired - non payment of renewal fee or expiry