AU2016101053A4 - Ad-hoc wireless network and a method for reducing energy need of the ad-hoc wireless network - Google Patents
Ad-hoc wireless network and a method for reducing energy need of the ad-hoc wireless network Download PDFInfo
- Publication number
- AU2016101053A4 AU2016101053A4 AU2016101053A AU2016101053A AU2016101053A4 AU 2016101053 A4 AU2016101053 A4 AU 2016101053A4 AU 2016101053 A AU2016101053 A AU 2016101053A AU 2016101053 A AU2016101053 A AU 2016101053A AU 2016101053 A4 AU2016101053 A4 AU 2016101053A4
- Authority
- AU
- Australia
- Prior art keywords
- node
- route request
- source node
- route
- request packet
- 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
Links
Classifications
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Landscapes
- Mobile Radio Communication Systems (AREA)
Abstract
The present invention relates to a method and a network for providing the route discovering procedure/protocol that is energy efficient. The method for route discovering procedure comprises generation of at least one route request packet from a source node to a destination node, wherein the route request packet comprises at least one parameter relating to digital data containing an internet protocol, a route request identity, a hop count and forwarding the route request packet to the intermediate node or the destination node subject to the constraint that the hop count of the source node is greater than that of the intermediate node.
Description
TITLE
AD-HOC WIRELESS NETWORK AND A METHOD FOR REDUCING ENERGY NEED OF THE AD-HOC WIRELESS NETWORK
FIELD OF THE INVENTION
The present invention relates to an ad-hoc wireless network and a method for reducing the energy need of the ad-hoc wireless network.
DEFINITIONS
Mobile Ad-hoc Network (MANET) - herein means a collection of wireless mobile hosts forming a temporary network without the aid of any centralized administration or standard support services.
Source node - herein means a wireless mobile node that broadcasts signal packets for creating a desired route from a source node to a desired destination node.
Destination node - herein means a wireless mobile node that receives the signal broadcasted by a source node for creating a desired route from the source node to a desired destination node.
Route - herein means a path or a way of communicating between two or more nodes, wherein the communication can be, but is not limited to, transfer of data between two or more nodes.
Hop count or Number of Hops - When a packet has to reach a destination from the source, it cannot do so directly if the destination node is not in the range of the source node, hence the neighbouring nodes are used as “hopping stations”. The number of hops refers to the number of times a packet will hop within the intermediate nodes before finally reaching the destination.
Energy level - herein refers to the energy level or power of the node. In an exemplary embodiment, this can be the power level of the battery of the node under consideration.
Load - herein refers to the routing traffic or number of packets being routed through a node of the network under consideration.
BACKGROUND OF THE INVENTION
Wireless network topologies that facilitate mobile nodes such as mobile stations, wireless terminals, etc., to communicate with each other and with fixed networks have become fairly widespread over the past few years. The mobile wireless networks can be of two types, namely, mobile wireless network with infrastructure or centralized administration and mobile wireless networks without any infrastructure or centralized administration. Typically, the networks with infrastructure have been used which are created on the cellular concept. These networks require a high level of infrastructure support. In these types of networks, the mobile nodes communicate via access ports connected to the fixed network. Typical infrastructure-based networks include GSM, CDMA, WLL, WLAN, and the like.
Whereas, in a network without any infrastructure, the mobile nodes communicate directly through the access ports with the other nodes. In this type of network, each mobile node is capable of operating as a base station or router for the other mobile nodes, thus eliminating the need for a fixed infrastructure of base stations.
One type of network without any infrastructure is the mobile ad-hoc network (MANET). A MANET is a cluster of mobile nodes, which dynamically form a network, and communicate with each other without using any fixed network infrastructure, as and when needed, that is, on demand. Typically, the mobile nodes of a MANET are small mobile devices which can be comparatively restricted in term of processor capability, memory size, and power consumption. The U.S. Pat. No. 5,943,322 describes an ad-hoc network the entire content of which is incorporated herein by reference.
In the case of the ad-hoc networks, the routes are created only when desired by the source node. When a node (the source node) requires a route to a destination (node), the source node initiates a route finding/discovery procedure within the network. Once a route is found, the procedure is completed. Alternatively, the procedure is completed when all the possible route permutations have been scanned. After the route is created/established, the route is maintained by some type of route maintenance procedure until either the destination becomes inaccessible along every path from the source node or until the route is no longer desired.
In a typical route discovery process, the source node broadcasts and forwards a Route Request (RREQ) packets to all the neighboring nodes until the route is found. These Route Request packets can typically contain the IP address of the source node generating the Route Request and a number called the Route Request ID (or RREQ ID). Each node maintains only one RREQ ID, which is incremented by one from the last RREQ ID used by the node before initiating the new RREQ packet. The RREQ ID uniquely identifies the particular RREQ when taken in conjunction with the source node's IP address.
This type of network can be used for creating strategic networks (for example, in a battlefield, in critical situations such as the earthquake/tsunami hit areas where the existing network has toppled and/or destroyed), Wireless Sensor network (along a country border or similar application), Data Networks (in which the devices such as computing devices are to communicate with each other), and the like.
One important aspect of the ad-hoc network is the energy of the network. As indicated hereinabove, the resources, including energy of this type of network, is limited. It is necessary to make optimal use of the energy at disposal. It is observed that the energy spent in discovering a route from a source node to a destination is quite high, as in the route discovery process, the source node broadcasts and forwards a Route Request (RREQ) packets to all neighboring nodes until the route to the desired destination node is found.
Accordingly, a need exists to provide a method and a network that is capable of discovering optimal network routes such that the energy needed by the network is reduced.
OBJECTS OF THE INVENTION
Some of the objects of the presently disclosed invention, of which at the minimum one embodiment herein fulfills, are as follows:
An object of the present invention is to solve one or more deficiencies encountered in the prior art or to at the minimum deliver a beneficial substitute;
Another object of the present invention is to provide an ad-hoc network; and
Yet another object of the present invention is to provide a method that provides an energy efficient routing protocol for an ad-hoc network.
Other objects and benefits of the present invention will be more apparent from the following description, which is not intended to bind the scope of the present invention.
SUMMARY
The present invention relates to an ad-hoc mobile network and a method for providing a route discovering procedure/protocol that is energy efficient, thereby reducing the energy need of the ad-hoc network.
In accordance with an embodiment of the present invention, a method for route discovering procedure/protocol is disclosed that reduces the energy need of the network by providing directionality and controlled routing. More specifically, the ad-hoc network comprises a plurality of wireless mobile nodes of which at least one node operates as a source node, at least one node operates as a destination node, and optionally at least one node operates as an intermediate node. The method of the present invention comprises generation of at least one route request packet from the source node for creating a route to the desired destination node directly or via one or more intermediate nodes, wherein the route request packet, inter alia, comprises at least one parameter relating to digital data containing an internet protocol address of the source node, digital data containing a route request identity of the source node, a hop count digital value containing the location reference in number of hops of the source node. The method of the present invention further comprises forwarding the route request packet to the intermediate node or the destination node subject to the constraint that the hop count of the source node is greater than that of the intermediate node.
In accordance with the present invention, the route request packet further includes a digital data relating to the energy level of one or more intermediate nodes, wherein the digital data relating to the energy level of the intermediate node(s) aids in ascertaining whether the intermediate node(s) under consideration is having enough energy (or simply battery power) to maintain the route, if established, via the intermediate node(s) under consideration. This aspect of verifying/ascertaining the energy level of the intermediate node(s) aids in obtaining a route that can be established and maintained for desired time period.
Further, in accordance with the present invention, the route request packet also includes the digital data relating to the load on the intermediate node(s) via which the route from the source node to the final node is desired to be established. If the load on the intermediate node(s) is greater than a predetermined threshold value, another intermediate node(s) is searched with a load value of less than the predetermined threshold.
In accordance with the present invention, the route request packet can further include at least one other parameter including media access control address, wait time, and time delay.
In accordance with another embodiment of the present invention, the ad-hoc wireless network, with directionality and controlled routing using an on demand distance vector routing protocol, is provided.
BRIEF DESCRIPTION OF ACCOMPANYING DRAWING
The present invention will now be described with the help of the non-limiting accompanying drawing, in which:
Figure 1 illustrates a block diagram depicting an example of a mobile node employed in the network.
DETAILED DESCRIPTION
Different characteristics and beneficial particulars are unfolded fully with reference to the embodiments/aspects which are exemplified in the accompanying drawing and detailed in the description that follows hereinafter. Descriptions of techniques, methods, components, and equipment that a person skilled in the art is well aware of or those form common general knowledge in the field pertaining to the present invention is not described and/or introduced for the purpose of focusing on the present invention and not to obscure the present invention and advantageous features thereof. At the same time the present invention and its features that are explained herein in the detailed description and the specific examples, are given by way of illustration only, and not by way of limitation. It is to be understood that a person skilled in the art may and can think of various alternative substitutions, modifications, additions, and/or rearrangements which are considered to be within the spirit and/or scope of the underlying inventive concept.
The present invention relates to an ad-hoc network and a method for reducing the energy need of the ad-hoc wireless network.
Figure 1 illustrates a block diagram wherein an example of a mobile node 100 that can be employed in an ad-hoc wireless network in accordance with the embodiment of the present invention. Referring to figure 1, each mobile node 100 essentially comprises a transceiver 102 (for example a modem). The transceiver 102 is suitably coupled to an antenna 104 and is configured for receiving and transmitting signals, such as signals in the form of packets, to and from the node 100, wherein the signals in the form of the packets are controlled by a controller 106. The signals in the form of packets can include, voice, data or multimedia information, and control signals, including node update information. It should, however, be noted that the present invention is not limited only to aforementioned types of signals/packets.
Each node 100 further includes a memory 108 that is capable of storing and retrieving, inter alia, routing information/digital data relating to itself and other nodes in the network. In certain embodiments, specific nodes can include a host 110 which can comprise a number of devices, for example, a notebook computer terminal, mobile phone unit, mobile data unit, or any other suitable device. Each of the mobile nodelOO includes the suitable hardware and/or software to perform the Internet Protocol. Each node 100 further includes a suitable source of energy (not shown in the figure), which can be in the form of a battery or any other suitable form to power the hardware of each of the node 100.
In accordance with an embodiment of the present invention, the method for route discovering procedure/protocol is disclosed, which is capable of reducing the energy need of the network by providing directionality and controlled routing.
More specifically, in accordance with the present invention, the ad-hoc network comprises a plurality of wireless mobile nodes of which: - at least one node operates as a source node and is capable of generating and transmitting (collectively may be referred to as broadcasting) packets (including route request packets), wherein the source node comprises suitable hardware and software to generate and transmit the packets; - at least one node operates as a destination node, wherein the destination node is configured or is capable of receiving the packets from the source node and/or any other node in the network; and - optionally at least one node operates as an intermediate node, wherein the intermediate node is configured to receive and transmit the packets received from the source node to the destination node, wherein the number intermediate nodes between the source node and the destination node, if included, can be one or more than one.
In accordance with the present invention, the method of creating a route from the source node to the desired destination node includes the steps of: - generating at least one route request packet from the source node, wherein the route request packet comprise at least one parameter relating to: o digital data containing an internet protocol address of the source node; o digital data containing a route request identity of the source node; and o a hop count digital value containing the location reference in number of hops of the source node; and - forwarding the route request packet to the intermediate node or the destination node (as the case may be) subject to the constraint that the hop count of the source node is greater than that of the intermediate node.
In accordance with the present invention, the hop count ensures that the nodes towards the destination only participate in the route formation, giving directionality for the formation of the route from the source node to the desired destination node.
In accordance with the present invention, the route request packet can further include a parameter relating to the digital data pertaining to the energy level of one or more intermediate nodes, wherein the digital data relating to the energy level of the intermediate node(s) aids in ascertaining whether the intermediate node(s) under consideration is having enough energy (or battery power) to maintain the route, if established, via the intermediate node(s) under consideration. This aspect of verifying and/or ascertaining the energy level of the intermediate node(s) aids in obtaining a route that can be established and maintained for a desired time period. This also ensures that if the energy level of the node is less than a predetermined value, breaking of the route does not occur.
Further, in accordance with the present invention, the route request packet can further include a parameter relating to the digital data pertaining to the load on the intermediate node(s) via which the route from the source node to the final node is about to be established. If the load on the intermediate node(s) is greater than a predetermined threshold value, another intermediate node(s) is searched with a load value of less than the predetermined threshold.
In accordance with the present invention, the route request packet can further include a parameter relating to the digital data containing a media access control (MAC) address of the source node, which is useful in data transmission over a longer distance with less interference.
In accordance with the present invention, the route request packet can further include a parameter relating to the digital data containing wait time, which helps in reducing the number of route request initializations.
In accordance with the present invention, the route request packet can further include a parameter relating to digital data containing delay time along the route, which helps in finding a route faster from the source node to the desired destination node.
It is observed that by including one or more parameter described herein above in the protocol/algorithm, the energy needed for the ad-hoc mobile network is reduced.
In accordance with another embodiment of the present invention, the ad-hoc wireless network, with directionality and controlled routing using an on demand distance vector routing protocol, comprises a plurality of nodes of which at least one node operates as a source node, at least one node operates as a destination node, and optionally at least one node operates as an intermediate node, wherein for creating a route from the source node to the desired destination node, at least one route request packet is generated from the source node. The route request packet comprises at least one parameter relating to the digital data containing an internet protocol address of the source node, digital data containing a route request identity of the source node, and a hop count digital value containing the location reference in number of hops of the source node, and wherein the route request packet is forwarded to one or more intermediate node(s) or the destination node subject to the constraint that the hop count of the source node is greater than that of the intermediate node.
It is observed that there is considerable improvement in the performance parameters of the network when the method of the present invention is implemented. More specifically, the method of the present invention aids in minimizing the energy consumption along with, delay, jitter, link breaks, and overheads. Since the energy of the node is verified before route formation, and the directionality given to the route request packets reduces the number of route request packets generated. This leads to decrease in the energy needed for the network. The provision of the media access control address reduces the hidden and exposed terminal problem.
The inventors of the present invention have performed simulation studies. The simulation results show that the network offers improved performance on the: - average energy consumption in the range of 17% to20 %, - average end to end delay is lowered by 61% to 95%, - overheads improved in the range of 10% to 13%, - jitter is reduced by 6% to21%, - link break is reduced by 43% to 52%, and - packet delivery ratio is 6-21% lower as compared to MANETS deploying Ad hoc On-Demand Distance Vector (AODV).
ADVANCES AND ECONOMICAL SIGNIFICANCE ACHIEVED BY THE PRESENTLY DISCLOSED INVENTION
The presently disclosed invention, as described herein above, provides several advances including, but that are not limited to, the realization of: - a method for reducing the energy of an ad-hoc network; - an ad-hoc network with reduced energy need; - an ad-hoc network with reduced end to end delay; - an ad-hoc network with improved overheads; - an ad-hoc network with reduced jitter; - an ad-hoc network with reduced link break; and - an ad-hoc network with a low packet delivery ratio as compared to MANETS deploying Ad hoc On-Demand Distance Vector (AODV).
In the present specification the word "comprise", or variations thereof, such as "comprises" or "comprising", imply the inclusion of a stated element, integer or step, or group of elements, integers or steps, but not the exclusion of any other element, integer or step, or group of elements, integers or steps.
Further, the use of the expression "at least" or "at least one" suggests the use of one or more elements or ingredients or quantities, as the use can be in the embodiment of the invention to achieve one or more of the desired objects or results.
Claims (5)
- We claim:1. A method for providing directionality and controlling routing using an on demand distance vector routing protocol in an ad-hoc wireless network comprising: a plurality of wireless mobile nodes of which: at least one node operates as a source node; at least one node operates as a desired destination node; and optionally at least one node operates as an intermediate node; said method comprising the following steps: generating at least one route request packet from said source node, for creating a route to said desired destination node, directly or via one or more of said intermediate nodes, wherein said route request packet comprises at least one parameter relating to: digital data containing an internet protocol address of said source node; digital data containing a route request identity of said source node; and a hop count digital value containing the location reference in number of hops of said source node; and forwarding said route request packet to said intermediate node or said destination node subject to the constraint that the hop count of said source node is greater than that of said intermediate node.
- 2. The method as claimed in claim 1, wherein said route request packet further comprises a parameter relating to the digital data containing a media access control address of said source node.
- 3. The method as claimed in claim 1, wherein said route request packet further comprises a parameter relating to the digital data containing energy level of said at least one node of said plurality of wireless mobile nodes, wherein said route request packet is forwarded subject to the constraint that the energy level of said at least one node of said plurality of wireless mobile nodes is greater than a threshold energy level.
- 4. The method as claimed in claim 1, wherein said route request packet further comprises a parameter relating to the digital data containing at least one of wait time, load of the intermediate node, and delay time along said desired route.
- 5. An ad-hoc wireless network, with directionality and controlled routing using an on demand distance vector routing protocol, comprising: a plurality of nodes of which: at least one node operates a source node; at least one node operates as a destination node; and optionally at least one node operates as an intermediate node; wherein for creating a desired route from said source node to said destination node, at least one route request packet is generated from said source node, said route request packet comprising at least one parameter relating to: digital data containing an internet protocol address of said source node; digital data containing a route request identity of said source node; and a hop count digital value containing the location reference in number of hops of said source node; and wherein said route request packet is forwarded to said intermediate node or said destination node subject to the constraint that the hop count of said source node is greater than that of said intermediate node.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
AU2016101053A AU2016101053A4 (en) | 2016-06-07 | 2016-07-11 | Ad-hoc wireless network and a method for reducing energy need of the ad-hoc wireless network |
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
IN201621019475 | 2016-06-07 | ||
AU2016101053A AU2016101053A4 (en) | 2016-06-07 | 2016-07-11 | Ad-hoc wireless network and a method for reducing energy need of the ad-hoc wireless network |
Publications (1)
Publication Number | Publication Date |
---|---|
AU2016101053A4 true AU2016101053A4 (en) | 2016-08-18 |
Family
ID=56616533
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
AU2016101053A Ceased AU2016101053A4 (en) | 2016-06-07 | 2016-07-11 | Ad-hoc wireless network and a method for reducing energy need of the ad-hoc wireless network |
Country Status (1)
Country | Link |
---|---|
AU (1) | AU2016101053A4 (en) |
Cited By (7)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
WO2018220443A1 (en) * | 2017-06-02 | 2018-12-06 | Estimote Polska Sp. Z O.O. | System and method for low power data routing |
CN110312209A (en) * | 2019-08-12 | 2019-10-08 | 航天科工网络信息发展有限公司 | A kind of movable self-organization network route method of location information auxiliary |
US10523685B1 (en) | 2018-08-22 | 2019-12-31 | Estimote Polska Sp z o.o. | System and method for verifying device security |
US10524083B2 (en) | 2015-09-02 | 2019-12-31 | Estimote Polska Sp z o.o. | System and method for low power data routing |
US10852441B2 (en) | 2018-08-24 | 2020-12-01 | Estimote Polska Sp z o.o. | Method and system for asset management |
US10856107B2 (en) | 2013-08-19 | 2020-12-01 | Estimote Polska Sp z o.o. | System and method for providing content using beacon systems |
US11297460B2 (en) | 2013-08-19 | 2022-04-05 | Estimote Polska Sp z o.o. | Wireless beacon and methods |
-
2016
- 2016-07-11 AU AU2016101053A patent/AU2016101053A4/en not_active Ceased
Cited By (13)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US11202171B2 (en) | 2013-08-19 | 2021-12-14 | Estimote Polska Sp z o.o. | System and method for providing content using beacon systems |
US11297460B2 (en) | 2013-08-19 | 2022-04-05 | Estimote Polska Sp z o.o. | Wireless beacon and methods |
US10856107B2 (en) | 2013-08-19 | 2020-12-01 | Estimote Polska Sp z o.o. | System and method for providing content using beacon systems |
US10524083B2 (en) | 2015-09-02 | 2019-12-31 | Estimote Polska Sp z o.o. | System and method for low power data routing |
US10616709B2 (en) | 2015-09-02 | 2020-04-07 | Estimote Polska Sp z o.o. | System and method for lower power data routing |
US10771917B2 (en) | 2015-09-02 | 2020-09-08 | Estimote Polska Sp z o.o. | System and method for low power data routing |
US11006237B2 (en) | 2015-09-02 | 2021-05-11 | Estimote Polska Sp z o.o. | System and method for low power data routing |
WO2018220443A1 (en) * | 2017-06-02 | 2018-12-06 | Estimote Polska Sp. Z O.O. | System and method for low power data routing |
US10523685B1 (en) | 2018-08-22 | 2019-12-31 | Estimote Polska Sp z o.o. | System and method for verifying device security |
US11218492B2 (en) | 2018-08-22 | 2022-01-04 | Estimote Polska Sp. Z .O.O. | System and method for verifying device security |
US10852441B2 (en) | 2018-08-24 | 2020-12-01 | Estimote Polska Sp z o.o. | Method and system for asset management |
CN110312209B (en) * | 2019-08-12 | 2021-05-25 | 航天科工网络信息发展有限公司 | Positioning information assisted mobile ad hoc network routing method |
CN110312209A (en) * | 2019-08-12 | 2019-10-08 | 航天科工网络信息发展有限公司 | A kind of movable self-organization network route method of location information auxiliary |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
AU2016101053A4 (en) | Ad-hoc wireless network and a method for reducing energy need of the ad-hoc wireless network | |
US11811642B2 (en) | Vine™: zero-control routing using data packet inspection for wireless mesh networks | |
JP4505454B2 (en) | System and method for improving overall performance of a wireless communication network | |
Hamidian et al. | Performance of internet access solutions in mobile ad hoc networks | |
US7415019B2 (en) | Apparatus and method for collecting active route topology information in a mobile ad hoc network | |
Jung et al. | Designing content-centric multi-hop networking over Wi-Fi Direct on smartphones | |
US7848757B2 (en) | Apparatus and method for extending mobility in a mobile ad hoc network | |
Yen et al. | Routing with adaptive path and limited flooding for mobile ad hoc networks | |
Ko et al. | A new directional flooding protocol for wireless sensor networks | |
Yan et al. | D-ODMRP: a destination-driven on-demand multicast routing protocol for mobile ad hoc networks | |
KR101371651B1 (en) | A method for constructing a tree in mobile ad hoc network | |
CN104093181A (en) | Content-centric multi-hop cellular network routing method and device | |
Le et al. | An efficient hybrid routing approach for hybrid wireless mesh networks | |
Tarique et al. | Optimum neighbors for resource-constrained mobile ad hoc networks | |
Hamatta et al. | Comparative review for routing protocols in mobile ad-hoc networks | |
Nand et al. | Comparative analysis of broadcasting techniques for routing protocols | |
Vidhya | Enabling efficient rebroadcast for reducing routing overhead in manets | |
Xing et al. | Dynamic-adjusting AODV routing protocol based on max hop count | |
Phoummavong et al. | Void handling by using Location-aided base on Trajectory over MANET | |
Awad et al. | Reactive virtual position-based routing in wireless sensor networks | |
Singh et al. | Optimization in route discovery delay for integrated manet with internet using extended aodv | |
Arora et al. | Performance Evaluation and Improving Bandwidth Utilization of AODV Protocol by Finding Hidden Terminals in Wireless Networks | |
Yu et al. | Design and implementation of ad-hoc dynamic gateway based on OLSR and mobile IP | |
Narongkhachavana et al. | Overhead reduction for route repair in mobile ad hoc networks | |
Xu et al. | A simplified scheme of internet Gateway Discovery and Selection for MANET |
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 |