Present invention in general relates to method in wireless sensor network using source initiated bulged multi-path routing scheme (SIBMP) to improve fairness and in particular to method that prevents congestion and enhance network lifetime.

Prior Art:

Method and apparatus for early warning of congestion in Ad-Hoc wireless networks is disclosed in US 8089884 B2. The invention bypass congested links in a multi-hop Ad-Hoc wireless network. Initially, congestion is measured at each network node based on channel utilization for both transmission and reception of TDMA and CSMA messages. The measured utilization is quantized to conserve transmission bandwidth. Non-uniform quantization is applied to enable the measured utilization to be quantized to the highest value within the quantization range prior to occurrence of congestion, thereby effectively providing early notification of the congestion. The quantized utilization is distributed with the original use costs of a communication link to the remaining network nodes by a Link State Advertisement (LSA) flood and supplemental ACK and/or HELLO packets. After a network node receives the quantized utilization, the link cost is updated and used to select a routing path that minimizes the total costs from the source node to the destination node for a multi-hop network.

US 8285297 B2 discloses a fair channel use in a wireless area network. A base station associated with a cell within a wireless community monitors the congestion of the working channel of neighboring communities. Upon determining that the congestion of the working channel of a neighboring community is less than that of its existing working channel, the base station initiates a switch to the neighboring community's working channel. Upon joining the new community, the frame structure and other networking parameters and attributes are adjusted.

WO 2013067488 A1 describes method and apparatus for efficient transmission of information to multiple nodes. In one embodiment, a system and method for reducing the amount of ACK and NAK traffic in a network is described. The systems and techniques described herein relate to the concept of efficiently transmitting data in a network. The systems and techniques described herein may specifically be used to reduce the amount of traffic in a network while still enabling timely feedback and message delivery in the network. The systems and techniques described herein find application in a number of different types of multicast systems.

US 20130195106 A1 discloses multi-path data transfer using network coding. Techniques, devices, systems, and protocols are disclosed herein that relate to data transfer between communication nodes via multiple heterogeneous paths. In various embodiments, network coding may he used to improve data flow and reliability in a multiple path scenario. Transmission control protocol (TCP) may also be used within different paths to further enhance data transfer reliability. In some embodiments, multiple levels of network coding may be provided within a transmitter in a multiple path scenario, with one level being applied across ail paths and another being applied within individual paths.

US 20080056125 A1 describes congestion control in a wireless network. Various embodiments are disclosed relating to congestion control in wireless networks. In an example embodiment, one or more trigger conditions may be determined relating to traffic congestion for one or more performance levels in a wireless network. One or more congestion control actions may be associated with each of the one or more performance levels. When a trigger condition at a wireless node is met, the associated congestion control actions may be performed.

Method and Apparatus for Fair Scheduling of Broadcast Services is described in US 20110310783 A1. In accordance with an example embodiment of the invention, a method comprises a) receiving at a base station from a core network entity a plurality of data packets scheduled for transmission during a scheduling period and synchronization information for a plurality of service bearers; b) determining whether there is an overflow condition based on the received synchronization information and transmission resources reserved for the plurality of service bearers for the scheduling period in a single-frequency network; c) upon determining that the overflow condition is present, selecting among the plurality of service bearers at least one service bearer based on a bearer selection function, wherein the bearer selection function results in selecting the service bearer with a highest value or a lowest value of a ratio of two quantities each with a specific value for each of the plurality of service bearers, and wherein the bearer selection function does not directly compute any ratio; and d) dropping a data packet from the selected at least one service bearer.

System and method for network congestion control is mentioned in US 20110261695 A1. The method includes monitoring a congestion level of at least one network node of the network. When the congestion level is greater than a first threshold, the method includes initiating a first congestion control mechanism. When the congestion level is greater than a second threshold, the method includes initiating a second congestion control mechanism, the second threshold being greater than the first threshold. In some implementations, the first congestion control mechanism includes codec rate adaptation (CRA), and the second congestion control mechanism includes at least one of rejecting new service requests and dropping existing services. The method may include, after initiating the first congestion control mechanism, starting a timer and, when the timer reaches a pre-determined value and the congestion level is greater than the first threshold, initiating the second control mechanism.

Many multipath routing schemes have been proposed which comes into existence after triggering certain events such as congestion, node failure, energy constraints and so on. In case of Bulged Multi-Path (BMP) Routing Scheme, multiple paths are taken into consideration only when congestion occurs in the network.

Objective of the invention

The primary object of the present invention is to provide method in Wireless Sensor Network using Source Initiated Bulged Multi-Path Routing Scheme (SIBMP) to improve fairness.

Summary of the invention:

Methodology in Wireless Sensor Network using Source Initiated Bulged Multi-Path Routing Scheme (SIBMP) to improve fairness.Instead of generating multiple paths after occurrence of congestion, SIBMP routing scheme focuses on preventing the congestion rather than controlling it. Hence this will prevent packet loss in the network. The Source Initiated Bulged Multi-Path Routing algorithm provides multiple disjoint paths from source to destination. Hop count of all nodes is considered from sink. In this scheme from source, only one path from each node is considered which is one hop away and is having hop count less than that of the source node. The current reporting rate is divided by number of upstream neighboring nodes of source and this new reporting rate is assigned over each path. The node will receive the packet and forward it only if it is from that dedicated path, else it will discard that packet.

Detailed description of invention:

The following description includes the preferred best mode of one embodiment of the present invention. It will be clear from this description of the invention that the invention is not limited to these illustrated embodiments but that the invention also includes a variety of modifications and embodiments thereto. Therefore, the present description should be seen as illustrative and not limiting. While the invention is susceptible to various modifications and alternative constructions, it should be understood, that there is no intention to limit the invention to the specific form disclosed, but, on the contrary, the invention is to cover all modifications, alternative constructions, and equivalents falling within the spirit and scope of the invention as defined in the claims.

In any embodiment described herein, the open-ended terms "comprising," "comprises,” and the like (which are synonymous with "including," "having” and "characterized by") may be replaced by the respective partially closed phrases "consisting essentially of," consists essentially of," and the like or the respective closed phrases "consisting of," "consists of, the like.

Initially all available multiple paths from source to destination are calculated. Source will calculate its upstream neighboring nodes (say n) and those many paths will be formed if those many intermediate nodes are available between source and destination. The paths formed from source to destination will be dedicated disjoint paths. Hop count of all nodes is considered from sink where sink’s hop count will be 0. After multiple paths are formed a new Source Initiated Bulged Reporting Rate (SIBRR) is calculated where the current Reporting Rate is divided by number of upstream neighboring nodes (n) of source.

This SIBRR is then assigned to each path from source. Now data is sent over these multiple paths. The intermediate node in the network will now receive the packet only if it is from that dedicated path and has hop count less than that node. If so it will accept and forward the packet, else it will discard that packet. This process will be continued until packet reaches the destination.

The novelty behind this algorithm lies behind the idea of sending data packets in distributed manner from source itself. This leads to fair distribution of traffic and energy over the network thus enhancing network lifetime.

While the invention has been described and illustrated with reference to certain particular embodiments thereof, those skilled in the art will appreciate that various adaptations, changes, modifications, substitutions, deletions, or additions of procedures and protocols may be made without departing from the spirit and scope of the invention.