You are on page 1of 16

Improving The Energy Efficiency In Multicast

Routing For Mobile Adhoc Networks

ISSN 2319-9725

S.Victoria Mary
Student
K.S.Rangasamy College of Technology

J.Prathish Kumar
Assistant professor
K.S.Rangasamy College of Technology

Abstract: In this paper, presents a Modified Multicasting through Time Reservation using
Adaptive Control for Energy efficiency (MMC-TRACE), an energy-efficient multicasting
architecture for mobile ad hoc networks. MMC-TRACE is a cross-layer design, where the
medium access control layer functionality and the network layer functionality are performed by a
single integrated layer. The architecture is to establish and maintain an active multicast tree
surrounded by a passive mesh within a mobile ad hoc network. Energy efficiency is achieved by
enabling the nodes to switch to sleep mode frequently and by eliminating most of the redundant
data receptions. In this paper the performance of MMC-TRACE is analyzed through ns_2
simulations and compared it with MC-TRACE architecture.
Keywords: Energy Efficiency, Multicast Routing, Mobile Adhoc Networks.
May, 2013 www.ijirs.com Vol 2 Issue 5

1. Introduction:

In multicasting, one or more source nodes convey information to the members of a multicast
group, possibly through the use of non-multicast group member nodes within the network.

The objective of a multicast protocol is to convey packets from a source to the members of a
multicast group with an acceptable quality of service (QoS). QoS necessitates (i) maintaining
a high enough packet delivery ratio (PDR) (ii) keeping the packet delay low enough network
(iii) reducing the number of packet drops (iv) Minimizing the energy dissipation is crucial to
keep the mobile users, equipped with lightweight battery-operated radios, connected to the
network.

2. Existing Protocols:

Previously designed Single-Hop Time Reservation using Adaptive Control for Energy
efficiency (SH-TRACE)[3], a MAC protocol for energy-efficient real-time data broadcasting
in fully connected single-hop networks. MH-TRACE [4] (Multi-Hop TRACE), extended the
MAC functionality of SH-TRACE to multihop networks. Then the Network-wide
Broadcasting through TRACE (NB-TRACE), a network-wide broadcasting architecture built
upon MH-TRACE. However, NB-TRACE is not capable of providing selective group
communication (multicasting) operation. MC-TRACE [1] is the logical next step in the
design of the TRACE [10] family of protocol architectures. But in that, RPB (repair branch)
and CRB (create branch) mechanisms are highest energy consumption. So MMC-TRACE is
the next design in the TRACE family.

Figure 1: Information Summarization (IS) packet format and fields.

International Journal of Innovative Research and Studies Page 33


May, 2013 www.ijirs.com Vol 2 Issue 5

From the Fig. 1 the PrAb (preamble) has 8 bits, PtTp (Packet Type) has 3 bits, PtSz (Packet
Size) has 8 bits, TrID (Transmitter Node ID) has 10 bits, MGID (Multicast Group ID) has 8
bits, SrID (Source Node ID) has 10 bits, PkID (Packet ID) has 5 bits, UpID (Upstream Node
ID) has 10 bits, DnID (downstream node ID)10 bits, TmSt (Time Stamp) has 8 bits,
HDTS(Hop Distance To Source) has 4 bits, IFLI (Initial Flooding Indicator) has 1 bit, RPBI
(Repair Branch Indicator) has 1 bit, MRSI (Multicast Relay Status Indicator) has 1 bit, EOSI
(End-Of-Stream Indicator) has 1 bit, and CRC (Cyclic Redundancy Check) has 8 bits. Packet
fields shown with light background are mandatory fields of an IS packet and the dark
background fields are the payload of the IS packet.

3. MMC-TRACE Architecture:

MH-TRACE[4] does not have any mechanism for routing. MMC-TRACE is an architecture
built on MH-TRACE and is capable of multicast routing. To keep the MH-TRACE structure
intact, a bottom-up approach is followed to design the network layer part, where the network
layer functionality is tailored according to the MAC layer functionality. The integration
principles outline both the design limitations imposed and the benefits provided by the
underlying MH-TRACE MAC scheme in MMC-TRACE.

The MMC-TRACE architecture using MRTable(multicast routing) [12] concept. That is the
only difference between the MC-TRACE and MMC-TRACE architecture.

A. Building Blocks in MC-TRACE:

There are five basic building blocks in MC-TRACE as follows:

International Journal of Innovative Research and Studies Page 34


May, 2013 www.ijirs.com Vol 2 Issue 5

Figure 2: Network Topology

S – source node ; M1-M7 - Multicast group members.

IFL is used to create a redundant multicast mesh through network-wide flooding. The
redundancy introduced by IFL is pruned by the PRN mechanism. The initial multicast tree
formed by IFL and PRN is broken in time due to node mobility. Tree branches broken
primarily due to leaf node mobility are repaired by the MNB mechanism. Relay node
mobility-induced tree branch breakages are repaired by the RPB mechanism. Both MNB and
RPB are local scope maintenance mechanisms. The CRB mechanism is designed to recreate
totally collapsed tree branches.

The basic building blocks by using the network topology presented in Fig. 2. The selected
branches of this network topology is shown in Fig. 4 to Fig. 7. To illustrate the functionality
of each mechanism over a running example.

1. Initial Flooding: In this section, initial flooding is described as a stand-alone mechanism.


Actually, initial flooding and pruning are two mechanisms working simultaneously.
However, here describe these as sequential mechanisms.

A source node initiates a session by broadcasting packets to its one-hop neighbors. The data
packets are received by all the nodes in the network, possibly multiple times.

Such a scenario can be better understood by considering the network branch formed by nodes
S, 1, 2, M1, and 3 in Fig. 2. The contents of the IS packets for this network branch are
illustrated in Fig. 3. The source node announces its own ID as its upstream node ID. Initially,
all retransmitting nodes announce the null ID as their downstream node ID.

International Journal of Innovative Research and Studies Page 35


May, 2013 www.ijirs.com Vol 2 Issue 5

[My ID], [Up ID], [Down ID], [Mcast Grp ID], [Mcast Rly Stat], [Seq Num]

Figure 3: Initial Flooding

However, when an upstream node is acknowledged by a downstream node, the node updates
its downstream node ID by the ID of this node. The leaf node continues to announce the null
ID as their downstream node ID.

Since a retransmitting node indicates its hop distance to the source (HDTS) in its IS packet, it
is possible to choose the node with the least HDTS as the upstream node; however, the
primary objective is minimizing delay rather than minimizing the tree size. A node updates
its own HDTS by incrementing the least HDTS it hears within THDTS1 time. The initial
HDTS value is set to HDTSMAX, and the HDTS value is again set to HDTSMAX if a node
does not receive any IS or data packets for more than THDTS2 time (THDTS2 > THDTS1).

Multicast group member nodes indicate their status by announcing their multicast group ID in
the IS packet (see Fig. 3). Nodes that are not members of the multicast group set their
multicast group ID to the null multicast group ID. If an upstream node receives an
acknowledgement (ACK) from a downstream multicast group member, it marks itself as a
multicast relay and announces its multicast relay status by setting the corresponding status in
the IS packet. This mechanism continues in the same way up to the source node.

Initial flooding results in a highly redundant multicast mesh. Thus, a pruning mechanism is
needed to eliminate the redundancies of the mesh created by the initial flooding.

2. Pruning: During the initial flooding, the multicast relays are determined in a distributed
fashion. Pruning uses the multicast relays to create an efficient multicast tree. As described
before, a multicast relay node that does not receive any upstream or downstream ACK for
TRLY time ceases to be a multicast relay.

Fig. 4 illustrates the operation of the pruning mechanism. After the initial flooding, all the
nodes receive the data packets and they determine their upstream and downstream nodes.
Multicast relays are also determined. Nodes 1, 2, and M1 along with S are multicast relays.
However, nodes 12, 13, 14, and 15 are not multicast relays because there is no multicast
group member connected to that branch of the network. Node 15 will cease retransmitting the
packets that it receives from its upstream node 14TRLY time after its first retransmission of
data because no node is acknowledging its data transmissions. Node 14 ceases retransmitting

International Journal of Innovative Research and Studies Page 36


May, 2013 www.ijirs.com Vol 2 Issue 5

packets 2TRLY time after its first data transmission. Note that node 14 acknowledges its
upstream node (node 13) for 2TRLY time. Nodes 13 and 12 cease retransmitting 3TRLY time
and 4TRLY time after their first data transmissions, respectively. Thus, the redundant upper
branch, where no multicast group members are present, is pruned.

Figure 4: Pruning and Multicast Tree Creation

Unlike the upper branch, the lower branch is not pruned due to the fact that the lower branch
has a multicast node as the leaf node. Node M1 acknowledges the upstream node upon
receiving the first data packet. Since node 2 receives an ACK from its downstream node and
also node M1 indicates its multicast group membership in its IS packet, node 2 marks itself as
a multicast relay and announces its status in its following IS transmission. Upon receiving
that IS packet from its downstream node, node 1 marks itself as a multicast relay also. Thus,
the branch of the active multicast tree consisting of nodes 1, 2, and M1 is created in a
distributed fashion.

IFL and PRN mechanisms are not always capable of maintaining the multicast tree in a
mobile network. Thus, there is a need for additional mechanisms to repair broken branches.
Maintain Branch, Repair Branch, and Create Branch mechanisms are utilized to maintain the
multicast tree.

3. Maintain Branch: Some of the multicast group members are not multicast relays. The left
panel of Fig. 5 illustrates such a situation. Multicast node is a multicast relay, as indicated by
the two-way arrows, whereas nodes M4, M6 and M7 are not multicast relays. They just
receive packets from the upstream node. Hence, nodes M4, M6 and M7 do not acknowledge
node 17. Note that any node can acknowledge only one upstream and one downstream node
with a single IS packet.

When node M3 moves away from node 17’s transmit range and enters node 16’s transmit
range, it either begins to acknowledge node 16 as its upstream node if the transition happens

International Journal of Innovative Research and Studies Page 37


May, 2013 www.ijirs.com Vol 2 Issue 5

in less than TRLY time or node M3 just receives the data packets from node 16 without
acknowledging node 16 if node M3’s transition takes more than TRLY time. In any case,
node 17 does not receive any ACK from node M3 for TACK time and starts to set its
downstream node ID as the null ID. However, node 17 does not cease retransmitting data
packets that it receives from its upstream node (node 16) instantly because a multicast relay
does not reset its status for TRLY (TRLY > TACK) time, and thus continues to retransmit data
packets.

Figure 5: Maintain Branch (MNB) Mechanism

Although none of the other multicast nodes acknowledge any node, they monitor their
upstream node through IS and data packets. When the upstream node of one or multiple
multicast group member node(s) announces the null ID as its downstream node ID, the
multicast nodes start to acknowledge the upstream node by announcing the ID of the
upstream node in their IS packets. Thus, node 17 continues to be a multicast relay and one of
the downstream multicast nodes becomes a multicast relay after receiving a downstream
ACK from its upstream node. Observe that nodes M4, M6, and M7 form a redundant passive
outer mesh for the tree branch. The MNB mechanism does not necessarily create a new
branch.

4. Repair Branch: After a node marks itself as a multicast relay, it continuously monitors its
upstream node to detect a possible link break between itself and its upstream multicast relay
node, which manifests itself as an interruption of the data flow without any prior notification.
If such a link break is detected, the downstream node uses the RPB mechanism to fix the
broken link. Fig. 6 illustrates an example of a network topology, where a branch of the
multicast tree is broken due to the mobility of a multicast relay and then fixed by the RPB
mechanism.

International Journal of Innovative Research and Studies Page 38


May, 2013 www.ijirs.com Vol 2 Issue 5

The left panel of Fig. 6 shows a multicast tree formed by the source node, node S, multicast
relay nodes, nodes 18 and 19, and the multicast group node, node M5, which is a multicast
relay as well. Nodes 20, 21 and 22 are neither multicast relay nodes nor multicast group
members; however, they receive the IS packets from nodes 18, 19 and M5. After some time,
as illustrated in the right panel of Fig. 6 node 19 moves away from its original position and
nodes 18 and 19 cannot hear each other. Thus, the multicast tree is broken. However, nodes
19, 20, 21, 22 and M5 can hear each other, temporarily. At this point, node 19 realizes that
the link is broken and the RPB mechanism is used to fix the broken tree. Node 19 sets its
RPB bit to one in the IS packets that it sends. Upon receiving an RPB indicator, all the nodes
in the receive range start to retransmit data packets as they do in the initial flooding stage.

Figure 6: Repair Branch (RPB) Mechanism

Thus, temporarily, three paths between node 18 and node M5 are created. One of these
nodes, node 20 in this scenario, replaces node 19 as a multicast relay node and the multicast
tree branch is repaired.

Assume that nodes 20, 21 and 22 remain in the transmit ranges of nodes 18, 19, and M5 even
after node 19 moved away from node 18’s transmit range. However, even if nodes 20, 21,
and 22 were not in the transmit range of node 19, the tree can again be fixed. Since node M5
does not receive any data packets from its upstream node (node 19), it sets its RPB bit to one
and announces this in its IS packet. The distance is calculated between 20, 21 and 22. From
that 20 is selected. All the other nodes in the sleep mode only. Upon receiving the RPB of
node M5, nodes 20 start to relay data packets, and upon receiving an upstream ACK from
node M5, node 20 marks itself as a multicast relay because it relays data packet from node 18
to node M5 with the lowest delay. Note that the members of the passive outer crust create a
condensed mesh around the tree breakage temporarily, and after it is repaired, this mesh is
pruned down to a thin active tree branch.

International Journal of Innovative Research and Studies Page 39


May, 2013 www.ijirs.com Vol 2 Issue 5

Both MNB and RPB are limited scope maintenance algorithms However, in a dynamic
network, limited scope algorithms are not always capable. So the CRB mechanism is needed.

5. Create Branch: It is possible that due to the dynamics of the network, a complete branch of
a multicast tree can become inactive, and the leaf multicast group member node cannot
receive data packets from the source node. Fig. 7 illustrates a network with one active branch,
composed of nodes S, 1, 2, and M1, and one inactive branch, composed of nodes 4, 5, 6, and
M2. The double arrows indicate an active link with upstream and downstream ACKs. Dashed
lines indicate an inactive link. The numbers below the nodes show their HDTS, which are
acquired during previous data transmissions.

Thus, node 6 ceases to relay packets, which eventually results in silencing all the upstream
nodes up to the source. If a multicast group member, node M2 in this scenario, detects an
interruption in the data flow for TCRB time, it switches to Create Branch status and
announces this information via a CRB packet. Note that such a node first tries repairing the
branch through the RPB mechanism, and it will use the CRB mechanism only if the RPB
mechanism fails to fix the interruption of data flow for TCRB time.

A CRB packet is transmitted by using one of the empty IS slots, which is chosen randomly.
Upon receiving a CRB packet, all nodes in the receive range of the transmitting node switch
to CRB status.

Figure 7: Create Branch (CRB) Mechanism

International Journal of Innovative Research and Studies Page 40


May, 2013 www.ijirs.com Vol 2 Issue 5

When a node switches to CRB mode, it starts to relay the data packets if it has data packets
for the desired multicast group. If it does not have the desired data packets, it propagates the
CRB request by broadcasting a CRB packet to its one-hop neighbors. This procedure
continues until a node with the desired data packets is found, as illustrated by the block
arrows in Fig. 7.

Observe that the passive nodes temporarily create three paths between node M2 and the
source (path1: node S - node 4 - node 5 - node 6 - node M2; path2: node S - node 23 - node
24 - node 6 - node M2; path3: node S - node 4 - node5 - node 25 - node M2). However, only
one of these paths survives after the calculating of the distance (path1, which is the lowest
delay path, survives).

The CRB mechanism is the last resort to fix a broken tree branch because 1) it takes more
time to recognize such a significant collapse in the multicast tree and activate the CRB
mechanism and 2) it requires more resources in terms of bandwidth and energy [11] to fix
such tree breakages. Nevertheless, the other mechanisms are capable of creating, maintaining,
and repairing the multicast tree without the use of the CRB mechanism in the majority of the
situations.

4. Simulation Environment:

To test the performance of MC-TRACE and to compare with tree based architecture, we ran
simulations using the ns-2 simulator [6]. Here the two energy propagation models are
discussed. Simulation parameters are presented in Table I. then the random way-point
mobility model is used for nodes moving within a 1500m by 1000m area.

Node speeds are chosen from a uniform random distribution between 0.0 m/s and 5.0 m/s
with zero pause time. There are 33 mobile nodes in this scenario and the source node is
located in the center of the network. The multicast group has seven members excluding the
source node.

The transmit range is 250m. Radio model is used as transmission model. The UDP (User
Datagram Protocol) and loss monitor is used as agent. The queue maximum size is 500
packets. Here the transmission power, receive power, idle power and sleep power is
considered.
DESCRIPTION VALUE
Number of nodes 33
International Journal of Innovative Research and Studies Page 41
May, 2013 www.ijirs.com Vol 2 Issue 5

Network area 1500m x 1000m


Transmit range 250 m
Transmit power 2.0 w
Receive power 1.5 w
Idle power 0.5 w
Sleep power 0.2 w
Initial energy 100 J
Table 1: Simulation Parameters

5. Results And Discussion:

The whole simulation time is 25s. The initial energy is given as 100J. The entire graph
shown below is comparison of existing system and proposed system.

From the trace file the xgraph is obtained.

A. Average Energy Consumption:

Figure 8: Average energy consumption

- MC-TRACE
- MMC-TRACE

The Fig. 8 shows the remaining energy of the network for MC-TRACE and MMC-TRACE
architecture. Initially 100 Joules are assumed for the network. From initial flooding the

International Journal of Innovative Research and Studies Page 42


May, 2013 www.ijirs.com Vol 2 Issue 5

energy is consumed until the receiver received the message. The energy consumption is
reduced in MMC-TRACE compare with MC-TRACE. Because the active nodes is reduced
using MRTable.

B. Analysis of Mc-Trace Building Blocks:

Fig. 9 shows the result for packet delivery ratio (PDR) for MC-TRACE and MMC-TRACE.
In MC-TRACE the transmission is blocked while fixing the broken tree. But in MMC-
TRACE that problem is rectified.

Figure 9: Result for Packet Delivery Ratio

International Journal of Innovative Research and Studies Page 43


May, 2013 www.ijirs.com Vol 2 Issue 5

Figure 10: Result for Delay

Fig. 10 shows the result for delay for MC-TRACE and MMC-TRACE. The delay is high in
MC-TRACE due to high congestion in the network. But in MMC-TRACE architecture
achieves low delay in high congestion and it improves the QoS performance.

International Journal of Innovative Research and Studies Page 44


May, 2013 www.ijirs.com Vol 2 Issue 5

Figure 11: Result for Number of Drops

Fig. 11 shows the number of packet drops in the network. The number of packet drops is
reduced in MMC-TRACE by using MRTable. It reduces the delay.

C. Energy Consumption for Various Multicast Group Size:

Figure 12: Result for average energy consumption for various multicast group size

The Fig.12 shows the average energy consumption for various multicast group size. Average
energy consumption increases linearly with increasing multicast group size. The X-axis
denotes the various multicast group size. In MMC-TRACE the energy consumption is
reduced, by enabling the nodes to switch to sleep mode frequently.

6. Conclusion:

Thus MMC-TRACE is a cross-layer, energy-efficient real-time data multicasting architecture


for mobile ad hoc networks. The performance of MMC-TRACE is compared with the tree
based architecture in terms of packet delivery ratio, delay and energy dissipation through ns-2
simulations.

MMC-TRACE is a tree-based approach, yet it can preserve the tree branches in high mobility
because it can detect broken tree branches rapidly, and with the support from the passively
participating neighboring nodes around the active branches, repair the broken links, mostly,
locally. Thus, the well-known branch breakage vulnerability of tree-based multicast
International Journal of Innovative Research and Studies Page 45
May, 2013 www.ijirs.com Vol 2 Issue 5

approaches in highly dynamic scenarios is alleviated by incorporating the passive condensed


mesh concept into the tree-based multicasting.

International Journal of Innovative Research and Studies Page 46


May, 2013 www.ijirs.com Vol 2 Issue 5

References

1. B. Tavli and W. Heinzelman, “Energy-Efficient Real-Time Multicast routing In


Mobile Ad Hoc Networks “, Proc. IEEE Transactions On Computers, VOL. 60, NO.
5, pp. 707-722, 2011.
2. B. Tavli and W. Heinzelman, “MC-TRACE: Multicasting through Time Reservation
Using Adaptive Control for Energy Efficiency,” Proc. IEEE Military Comm. Conf.,
pp. 2076-2081, 2005.
3. B. Tavli and W. Heinzelman, “TRACE: Time Reservation Using Adaptive Control
for Energy Efficiency,” IEEE J. Selected Areas Comm., vol. 21, no. 10, pp. 1506-
1515, Dec. 2003.
4. B. Tavli and W. Heinzelman, “MH-TRACE: Multi Hop Time Reservation Using
Adaptive Control for Energy Efficiency,” IEEE J. Selected Areas Comm., vol. 22, no.
5, pp. 942-953, June 2004.
5. H. Moustafa and H. Labiod, “A Performance Comparison of Multicast Routing
Protocols in Ad Hoc Networks,” Proc. IEEE Personal, Indoor and Mobile Radio
Conf., pp. 497-501, 2003.
6. Network Simulator (NS), http://www.isi.edu/nsnam/ns, 2010.
7. M. Van Der Schaar and S. Shankar, “Cross-Layer Wireless Multimedia Transmission:
Challenges, Principles and New Paradigms,” IEEE Wireless Comm., vol. 12, no. 4,
pp. 50-58, Aug. 2005.
8. L. Junhai, Y. Danxia, X. Liu, and F. Mingyu, “A Survey of Multicast Routing
Protocols for Mobile Ad-Hoc Networks,” IEEE Comm. Surveys and Tutorials, vol.
11, no. 1, pp. 78-91, First Quarter 2009.
9. B. Tavli and W. Heinzelman, “QoS and Energy Efficiency in Network-Wide
Broadcasting: A MAC Layer Perspective,” Computer Comm., vol. 30, pp. 3705-3720,
2007.
10. M. Conti, G. Maselli, G. Turi, and S. Giordano, “Cross-Layering in Mobile Ad Hoc
Network Design,” Computer, vol. 37, no. 2, pp. 48- 51, Feb. 2004.
11. W. Liang, “Approximate Minimum-Energy Multicasting in Wireless Ad Hoc
Networks,” IEEE Trans. Mobile Computing, vol. 5, no. 4, pp. 377-387, Apr. 2006.
12. B. Kaliaperumal, A. Ebenezer, and Jeyakumar, “Adaptive core-based scalable
multicasting networks,” in Proc. IEEE INDICON, Dec. 2005, pp.198–202

International Journal of Innovative Research and Studies Page 47

You might also like