CERTAIN INVESTIGATIONS ON

DEVELOPING EFFICIENT BROADCASTING

ALGORITHMS FOR MOBILE AD HOC NETWORK

A SYNOPSIS

Submitted by

S.V.M.G.BAVITHIRAJA

in fulfillment for the award of the degree

of

DOCTOR OF PHILOSOPHY

FACULTY OF INFORMATION AND

COMMUNICATION ENGINEERING

ANNA UNIVERSITY

CHENNAI 600 025

MARCH 2013

1

ABSTRACT

There is a need for a rapid deployment of the independent mobile users

in the wireless communication systems. Such network scenarios are termed as

Mobile Ad Hoc Network (MANET). In MANET, broadcasting is the common

operation for route establishment and sending emergency and control messages.

It is a challenging task to develop an efficient broadcasting algorithm for

MANET as it suffers redundant rebroadcast, collision and frequent path breaks.

The research proposes a new Reliable Broadcasting Algorithm using Carrier

Sense Multiple Access with Deterministic Collision Resolution (CSMA/DCR)

protocol to minimize the number of rebroadcasts made by the intermediate nodes

and reducing the delay latency.

A new Context-aware Adaptive Routing (CAR) protocol is designed

where few nodes are chosen as carrier nodes using Kalman filter based prediction

techniques and multi criteria utility theory and are used to broadcast the

messages asynchronously when there is a network partition. A new Power

Efficient Context Aware Broadcasting Protocol (PECABP) is proposed to

broadcast emergency messages with high priority based on the Delivery

Probability (DP) which is calculated based on connectivity, power level and trust

index of a node. A new Efficient Broadcasting using Network Coding and

Directional Antennas (EBCD) algorithm is proposed to initiate multiple

messages broadcasting from multiple source nodes. Thus, this research concludes

with the contributions of experimental study to develop various broadcasting

algorithms and all the results have been published in the International Journals.

2

1. INTRODUCTION

There is a need for rapid deployment of independent mobile users in

the wireless communication system. Significant examples include establishing

survivable, efficient, dynamic communication for emergency/rescue operations,

disaster relief efforts, and military network. Such network scenarios cannot have

centralized and organized connectivity, and can be conceived as applications of

Mobile Ad Hoc Network (MANET). Broadcasting is the process in which one

node sends a packet to all other nodes in the network which is necessary in

MANET routing protocols. For example, routing protocols such as Dynamic

Source Routing (DSR), Ad hoc On Demand Distance Vector (AODV) use

broadcasting to establish routes. It is mainly used in MANET applications such

as graph-related problems and distributed computing problems and to resolve

network layer problems such as paging a particular host, sending an alarm signal,

and finding a new route to a particular host.

Broadcasting is also used in Local Area Network (LAN) emulation

and serves as the last resort to provide multicast services in those networks that

face rapid changes in topologies. Since the application areas of the broadcasting

is plenty, developing efficient broadcasting algorithms for mobile ad hoc network

is a primary requirement. The aim of this research is to develop a Reliable

Broadcasting Algorithm using CSMA/DCR Protocol to minimize the number of

rebroadcast made by the intermediate nodes, to develop an asynchronous routing

protocol known as Context-aware Adaptive Routing Protocol to broadcast

messages during network partitions, to design a new Power Efficient Context

Aware Broadcasting Protocol (PECABP) to broadcast messages based on

3

priority and to ensure multiple sources/ multiple messages broadcasting using the

network coding approach and directional antennas.

2. LITERATURE REVIEW ON BROADCASTING

A survey of the existing literature reveals that various methodologies

have been employed to solve the broadcasting problems. Saha et al. (2010) have

developed a reliable broadcasting protocol for the large scale mobile ad hoc

network. Gandhi et al. (2008) have proposed an algorithm to minimize the

broadcast latency and redundancy in the ad hoc network. The proposed reliable

broadcasting algorithm effectively utilizes CSMA/DCR protocol discussed by

Lann et al. (1993) to minimize collision and to reduce redundant rebroadcast

given by Peng et al.(2000).

The mobile ad hoc network is highly dynamic and decentralized since

the nodes in the network are highly mobile. Most of the existing routing

protocols in MANET have the assumption that a path exists between the sender

and the receiver but the decentralized mobile ad hoc network is characterized by

frequent network partitions. Numerous approaches have been proposed to enable

asynchronous communication in intermittently connected mobile ad hoc network

and the seminal paper analyzing the problem and containing the first solution to

it was given by Li and Rus (2000) proposing an approach that guarantees the

message transmission with a minimum time, however, the algorithm relied on the

fact that mobile hosts actively modify their trajectories to transmit the messages.

Mobility assisted message forwarding in partitioned network was

discussed by Sarafijanovic et al. (2006). Jain et al. (2004) have presented a set of

protocols for routing in ad hoc network based on a partial or complete knowledge

of the structure of the network making use of the time-varying network graph

4

representation. The design of this protocol was based on the modified version of

Djikstra’s algorithm minimizing the delivery delays and queuing times.

Tzung-Shi Chen et al. (2007) have given a framework of mobile

context management for supporting the context aware environments in the

mobile ad hoc network. Hogiel et al. (2008) have developed a context aware

broadcasting protocol for the delay tolerant network that adapts its greediness

according to the “urgency” (priority) of the broadcast message. The protocol

worked better than the existing context aware broadcasting protocols and was

deterministic in nature supporting extensive network scalability.

Carvalho et al. (2007) have presented the solution in the project, End-

to-End QoS through Integrated Management of Content, Networks and

Terminals (ENTHRONE) describing the mechanisms designed for publishing

multimedia content and all relevant metadata associated with the consumption of

the content in an open and unified form to access the content on the request of

the end-users and decide kind of adaptation operations needed to provide a

context-aware services to the end user. The solution was based on the Moving

Picture Expert Group (MPEG-21) standard and the adaptation of a modular and

distributed architecture to implement the required functionality.

Roland et al. (2008) have presented an enhancement of standard

Universal Plug and Play Audio Visual (UPnPAV) services for home multimedia

environments regarding context awareness. They came up with the context

profile definition showing that the context information can be queried from the

Media Renderers and illustrated that a Control Point can use this information to

tailor a media stream from the Media Server to one or more Media Renderers.

Moreover, a standard Control Point implementation queries only one Media

5

Server at a time, as there is no global view on the content of all Media Servers in

the UPnPAV network. This paper also presented an approach of multimedia

content integration on the Media Server side that provides faster search of the

content in the network.

In MANET, the forwarding node set for broadcasting was usually

selected in a localized manner where each node determines its own status of

forwarding or non-forwarding based on the local information given by Wu and

Dai (2006) or the status of a node was designated by its neighbors given by Lou

and Wu (2002). A smaller-sized forwarding node set is considered to be more

efficient owing to the reduced number of retransmissions in the network that

helps alleviate the interference and conserves energy.

Li et al. (2007) exploited the use of the network coding in the

broadcasting application in the deterministic forwarding node selection

approaches to gain a reduction in the number of transmission each forwarding

node performs. Directional antennas can be used with the network coding-based

broadcasting to reduce the energy consumption. A node equipped with

directional antennas divides the omni directional transmission range into several

sectors and utilizes some of them for transmission. Using directional antennas,

the forwarding nodes can be selected to transmit the coded messages to the

restricted sectors. Yang et al. (2007) have developed an efficient method to

construct a forward node set as a backbone for message transmission using the

directional antennas.

3. MOTIVATION OF THIS RESEARCH

6

It is a challenging task to initiate a reliable broadcasting which requires

the minimum number rebroadcasts made by the intermediate nodes. A reliable

broadcasting in MANET requires the delivery of messages from different sources

to all the nodes in the network within a bounded time. Since the nodes are highly

mobile and the network is highly dynamic and decentralized, an efficient routing

protocol is required to broadcast the messages during network partition. In

MANET, the emergency messages have to be broadcast with a high priority

whereas a few control messages may be broadcast with a low priority. Hence, an

efficient broadcasting algorithm is required to prioritize the messages before

broadcasting. Usually, a network backbone called as Connected Dominating Set

(CDS) is constructed for efficient broadcasting, where only selected nodes called

forwarding nodes forward data. In MANET, the forwarding node set is usually

selected in a localized manner for broadcasting where each node determines its

own status of forwarding or non-forwarding based on the local information. A

smaller sized forwarding node set is considered to be more efficient owing to the

reduced number of transmissions in the network that helps to alleviate the

interference and conserve energy. An efficient broadcasting algorithm is required

to construct Connected Dominating Set in a dynamic manner to initiate

broadcasting from multiple source nodes.

4. CONTRIBUTIONS

This section describes the existing methods and proposes new research

finding and contributions towards this research.

4.1 Reliable Broadcasting Algorithm

7

A new Reliable Broadcasting Algorithm is proposed to broadcast the

messages reliably from the source node to all the nodes in the network. The

algorithm does not require the nodes to know the network size, its diameter and

the number of nodes in the network. The only information a node has is its

identity and position. The algorithm considers the node mobility and multiple

nodes collocated at the same point, calculating the relative position of the nodes

with respect to the source node that initiates broadcasting.

If a node scheduled to transmit a message in a round realizes that its

transmission cannot propagate the message to any new node, it cancels its

scheduled transmission, and thus the algorithm tries to minimize the number of

rebroadcasts made by the intermediate nodes and reduces the delay latency.

Nodes that are within in the communication range of a transmitting node are

assigned a counter value based on their relative positions with the initial position

of the transmitting node. Those nodes that are farthest from the transmitting node

are assigned smaller counter values and those that are close to the transmitting

node are assigned larger counter values.

If a node moves towards the transmitting node, its counter value is

increased and when the node moves away from the transmitting node, its counter

value is decreased. This ensures that those nodes that are farthest from the source

node always rebroadcasts the message and it minimizes the number of

rebroadcasts made by the intermediate nodes. The algorithm effectively utilizes

Carrier Sense Multiple Access with Deterministic Collision Resolution

(CSMA/DCR) protocol to allow the nodes collocated at a same place to

successfully transmit and to resolve the collision that happens during message

transmission.

8

4.2 Context-Aware Adaptive Routing Protocol

A reliable broadcasting in the MANET requires the delivery of

messages from different sources to all the nodes in the network within a bounded

time. The nodes are highly mobile and the network is highly dynamic and

decentralized. Most of the existing routing protocols in MANET have the

assumption that a path exists between the sender and the receiver but the

decentralized MANET is characterized by frequent network partitions and so, to

achieve a reliable broadcasting is a challenging task.

A new Context-aware Adaptive Routing Protocol (CAR) is designed

for broadcasting in MANET based on the idea of exploiting multiple nodes as

carriers of messages among network partitions to achieve a guaranteed delivery.

A host willing to broadcast the message to all the nodes in the network uses a

Kalman Filter prediction technique and multi-criteria decision theory to choose

the best next hop or carrier for the message based on the mobility of the host (a

highly mobile host is a good carrier as it meets many hosts) and its past

collocation with the recipient (It is assumed that the past collocation indicates

that the host will meet the recipient again in the future).

The design goal of the proposed protocol is to support the

communication in an intermittently connected MANET. The key problem solved

by the protocol is the selection of the carrier nodes based on the application of

the Kalman filter prediction techniques and multi criteria utility theory for the

evaluation of different aspects of the system relevant for taking routing decisions.

The delivery process depends on whether the recipient is present in the same

connected region of the network (cloud) as the sender or not. If all the nodes are

9

currently in the same connected portion of the network, the message is broadcast

with an underlying synchronous routing protocol to determine a forwarding path.

If a message cannot be broadcast synchronously, the best carriers for a message

are selected which are nodes with the highest delivery probabilities. The message

is sent to the host with the highest delivery probability using the underlying

synchronous protocol and the message is broadcast by the carrier nodes to those

nodes that are in a separate cloud.

The delivery probabilities are determined locally from the context

information defined as the set of attributes that describe the aspects of the system

to be used to drive the process of message delivery. Two parameters are

considered as context information’s, the change in the degree of connectivity,

i.e., the number of connections and disconnections that a host experienced over

the last T seconds. This parameter measures relative mobility of the node. The

second is past and future collocation of the host with those nodes that are in the

second cloud.Each host calculates its delivery probability with the help of

Kalman filter prediction technique and multi criteria utility theory and this

information is circulated in the network using the routing table. The delivery

probability information is piggybacked along with the synchronous routing table

information.

4.3 Power Efficient Context Aware Broadcasting Protocol

In MANET, the emergency messages have to be broadcast with a high

priority whereas a few control messages may be broadcast with a low priority. A

new Power Efficient Context Aware Broadcasting Protocol (PECABP) is

proposed based on the Delivery Probability (DP) to broadcast the messages

based on priority. Initially the delivery probability of each node is determined

10

based on its connectivity, power level and trust index. The message header

consists of a Context Flag (CF) with three flag values namely the urgency U, the

reliability R and the normal N. By checking these flag values, the message is

broadcast to the nodes depending on their delivery probability.

The power level detected at the receiving node Pr is the indication of

the distance between the transmitting and receiving node pairs. The relative

mobility between the two nodes can be calculated from the ratio of Pr between

two successive packet transmissions from a neighboring node by periodically

sending “hello” messages. . In this manner, any node which acts as a receiver

measures the power levels in the successive transmissions from all of its

neighbors and a variance of these values (with respect to zero) is a representative

value for the aggregate relative mobility metric for that node. Using this

aggregate relative mobility metric, the connectivity of a node is estimated.

A data structure called Neighbor’s Trust Index Table (NTIT) is

maintained in each node of the network. Initially, when a source node S wants to

establish a route to the destination D, it sends the Route Request (RREQ) packet.

Each node keeps track of the number of packets it has forwarded in the given

route using a Forward Counter (FC). When a node N2 receives a packet from a

node N1 in the same route, the node N2 increments the forward counter of node

N1 by one. The Neighbor’s Trust Index Table (NTIT) of node N2 is modified

using the new value of Forward Counter.

The NTIT table is attached along with the RREQ packet. Similarly,

each node updates its NTIT table using the FC values and finally, the packet

reaches the destination node D. When the destination node D receives the

accumulated Route Request (RREQ) packets, it measures the number of packets

11

received and estimates the success ratio of each node. The success ratio for each

node is then added with the RREP packet. After receiving the Route Reply

(RREP) packet, the source node reads the success ratio values of all nodes and

calculates the trust value. The Power Level can be obtained directly from

the battery and the delivery probability of each node is determined based on its

connectivity, power level and trust index.

4.4 Multiple Sources/ Multiple Messages Broadcasting

Initiating broadcasting from multiple sources in the MANET can be

done using Network Coding and Directional Antennas. In MANET, the

forwarding node set is usually selected in a localized manner for broadcasting

where each node determines its own status of forwarding or non-forwarding

based on the local information or determines its own status from its neighbors. A

smaller sized forwarding node set is considered to be more efficient owing to the

reduced number of transmissions in the network that helps to alleviate the

interference and conserve energy. The Connected Dominating Set (CDS) is

designed as a virtual backbone where each node is either a forwarding node or a

neighbor to a forwarding node in the set with all nodes being connected.

The network coding method is applied in the deterministic forwarding

node selection approach to gain a reduction in the number of transmissions each

forwarding node performs. Further, directional antennas are used with the

network coding based broadcasting to reduce the energy consumption. A node

equipped with the directional antennas divides the omni directional transmission

range into several sectors utilizing some of them for transmission. Using

directional antennas, the forwarding nodes are selected and formed as Dynamic

Directional Connected Dominating Set (DDCDS) that transmits the coded

12

messages to the restricted sectors. Combining these two approaches, a new

Efficient Broadcasting using Network Coding and Directional Antennas (EBCD)

algorithm is designed for broadcasting.

To initiate the broadcasting from a set of source nodes, they use

directional antennas to send the message to a neighboring forwarding node. The

forwarding node applies network coding to combine the received messages and

forwards the message only towards its corresponding forwarding edges to help

the entire network to get all the messages. The dynamic node and edge coverage

conditions are used to construct DDCDS for the given network at each node in a

dynamic manner. Each node exchanges the “Hello” message packet in which the

topological information of the network and state information of each node are

exchanged. Based on this information, a node decides its forwarding status and

the corresponding forwarding edges for each received broadcast message and

makes a decision for further broadcasting.

4.5 Conclusions

This research summarizes the contributions of the experimental study

and their related results on Reliable Broadcasting Algorithm using CSMA/DCR

protocol, design of Context-aware Adaptive Routing Protocol, development of

Power Efficient Context Aware Broadcasting Protocol and initiating multiple

sources/ multiple messages broadcasting and all these results have already been

published in the international journals.

REFERENCES

13

1. Carvalho. P, Andrade. M, Alberti. C, Castro. H, Calistru. C and de Cuetos. P (2007), “A Unified Data Model and System Support for the Context Aware Access to Multimedia Content”, Proceedings of the Workshop on Datenbanksysteme in Business Technologie und Web (BTW’07), Aachen Germany, March 5-6, pp. 5-6.

2. Dai. F and Wu. J (2006), “Efficient Broadcasting in Ad Hoc Wireless Networks using Directional Antennas”, IEEE Transactions on Parallel and Distributed Systems, Vol. 17, No.413, pp. 335 - 347.

3. Gandhi. R, Mishra. A and Parthasarathy. S (2008), “Minimizing Broadcast Latency and Redundancy in Ad Hoc Networks”, IEEE/ACM Transactions on Networking, Vol. 16, No. 4, pp. 840 – 851.

4. Hogie. L, Danoy. G, Bouvry. P and Guinand. F (2008), “A Context-Aware Broadcast Protocol for Mobile Wireless Networks”, Proceedings of Second International Conference on Modeling, Computation and Optimization in Information Systems and Management Sciences (MCO), Metz, France, Springer, September 8-10, Vol. 14, pp. 507-519.

5. Jain. S, Fall. K and Patra. R (2004), “Routing in a Delay Tolerant Network”, Proceedings of the ACM Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications (SIGCOMM), New York, NY, USA, Vol. 34, No. 4, pp. 145-158.

6. Lann. G. L and Rivierre. N (1993), “Real-Time Communications over Broadcast Networks: the CSMA-DCR and the DOD-CSMA-CD Protocols”, Technical Report on Information Theory, Coding Theory, Signal Processing , France, INRIA RR-1863.

7. Li. L, Ramjee. R, Buddhikot. M and Miller. S (2007), “Network Coding-based Broadcast in Mobile Ad Hoc Networks”, Proceedings of the IEEE International Conference on Computer Communications (INFOCOM), Anchorage, AK, May 6-12, pp. 1739 – 1747.

8. Li. Q and Rus. D (2000), “Sending Messages to Mobile Users in Disconnected Ad-Hoc Wireless Networks”, Proceedings of the Sixth Annual International Conference on Mobile Computing and Networking (MobiCom’00), New York, NY, USA, pp. 44–55.

14

9. Lou. W and Wu. J (2002), “On Reducing Broadcast Redundancy in Ad Hoc Wireless Networks”, IEEE Transactions on Mobile Computing, Vol. 1, No. 2, pp. 111–122.

10. Peng. W and Lu. X (2000), “On the Reduction of Broadcast Redundancy in Mobile Ad Hoc Networks”, Proceedings of the First ACM International Symposium on Mobile Ad Hoc Networking and Computing, Boston, MA, USA , August 11, pp. 129 – 130.

11. Roland. T, Michael. J, Julius. K and Armin. K (2008), “Context-Aware UPnP-AV Services for Adaptive Home Multimedia Systems”, International Journal of Digital Multimedia Broadcasting, Vol. 2008.

12. Saha. S, Hussain. S.R and Ashikur Rahman. A.K.M (2010), “RBP: Reliable Broadcasting Protocol in Large Scale Mobile Ad Hoc Networks”, Proceedings of the IEEE International Conference on Advanced Information Networking and Applications (AINA), Perth, WA, April 20-23, pp. 526 – 532.

13. Sarafijanovic-Djukic. M. P. N and Grossglauser. M (2006), “Island Hopping: Efficient Mobility Assisted Forwarding in Partitioned Networks”, Proceedings of the Third Annual IEEE Communications Society on Sensor and Ad Hoc Communications and Networks (SECON), Vol. 1, No. 1, pp. 226 -235.

14. Tzung-Shi. C, Gwo-Jong. Y and Hsin-Ju. C (2007), “A Framework of Mobile Context Management for Supporting Context-Aware Environments in Mobile Ad Hoc Networks”, Proceedings of the International Conference on Wireless communications and mobile computing (IWCMC), Turtle Bay Resort, Honolulu, Hawaii, August 12- 16, 2007 , pp. 647 – 652.

15. Yang. S, Wu. J and Dai, F (2007), “Efficient Backbone Construction Methods in MANETs using Directional Antennas”, Proceedings of the IEEE International Conference on Distributed Computing Systems (ICDCS), Toronto, ON, June 25-27, pp. 45-45.

LIST OF PUBLICATIONS

15

Papers Published in International Journals

1. Bavithiraja. S.V.M.G and Radhakrishnan. R (2009), “A New Reliable Broadcasting in Mobile Ad Hoc Networks”, International Journal of Computer Science and Network Security, Vol.9, No.4, pp. 340-348.

2. Bavithiraja. S.V.M.G and Radhakrishnan. R (2011), “Adaptive Routing Protocol for Broadcasting in Mobile Ad Hoc Networks”, International Journal of Information Processing, IK International Publishing House, Vol. 5, No.2, pp. 46-58.

3. Bavithiraja. S.V.M.G and Radhakrishnan. R (2011), “Multi Source/ Multi Message Broadcasting in MANET Using Network Coding Approach with Directional Antennas”, CiiT International Journal of Wireless Communications, Vol. 3, No. 15, pp. 1036-1045.

4. Bavithiraja. S.V.M.G and Radhakrishnan. R (2012), “Efficient Broadcasting in Mobile Ad Hoc Networks using Context Aware Adaptive Routing Protocol during Network Partitions”, Journal of Computer Science, Science Publications. Vol. 8, No. 5, pp. 721-730.

5. Bavithiraja. S.V.M.G and Radhakrishnan. R (2012), “Ensuring Multi Messages Broadcasting in MANET Using Network Coding Approach”, Journal of Computer Science, Science Publications, Voial. 8, No. 6, pp. 920-929.

6. Bavithiraja. S.V.M.G and Radhakrishnan. R (2012), “Reliable Broadcasting in Mobile Ad Hoc Network using CSMA/DCR Protocol”, European Journal of Scientific Research, Vol. 72, No.1, pp. 45-57.

7. Bavithiraja. S.V.M.G and Radhakrishnan. R (2012), “Power Efficient Context-Aware Broadcasting Protocol for Mobile Ad hoc Network”, International Journal of Computer Engineering and Technology, International Association for Engineering and Management Education, Vol. 3, No. 1, pp. 81-96.

8. Bavithiraja. S.V.M.G and Radhakrishnan. R (2013), “Power Efficient Broadcasting Protocol for Mobile Ad Hoc Network using Context Awareness”, Accepted for publication in the Wulfenia Journal.

16

17