In this paper, we have presented the Modified Multicasting through Time Reservation using Adaptive
Control for Excellent Energy efficiency (MMC-TRACE). It is a real time multicasting architecture for
Mobile Ad-Hoc networks to make their work an energy efficient one .MMC-TRACE is a cross layer design
where the network layer and medium access control layer functionality are done in a single integrated
layer design. The basic design of 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 maximized by enabling
the particular node from sleep to awake mode while the remaining nodes of the same path are maintained
at sleep mode. Energy efficiency too achieved by eliminating most of the redundant data receptions across
nodes. The performance of MMC-TRACE are evaluated with the help of ns-2 simulations and comparisons
are made with its predecessor such as MC-TRACE. The results show that the MMC-TRACE provides
superior energy efficiency, competitive QoS performance and bandwidth efficiency.
MULTICASTING BASED ENHANCED PROACTIVE SOURCE ROUTING IN MANETSIJCNCJournal
Mobile Ad-hoc Network (MANET) is an accumulation of movable nodes organizing a irregular topology without centralized administration. In a MANET, multicasting is a significant technique for utilizing data communication system. Multicasting based enhanced proactive source routing is proposed in this paper for Mobile Ad hoc Networks. It explains an innovative multicasting algorithm that considers the transmission energy and residual energy while forwarding the data packets. It improves the network throughput and raises the network lifetimes. Simulation analysis is carried in this proposed system and this method shows improved performance over the existing system.
A novel routing technique for mobile ad hoc networks (manet)ijngnjournal
Actual network size depends on the application and the protocols developed for the routing for this kind of
networks should be scalable and efficient. Each routing protocol should support small as well as large
scale networks very efficiently. As the number of node increase, it increases the management functionality
of the network. Graph theoretic approach traditionally was applied to networks where nodes are static or
fixed. In this paper, we have applied the graph theoretic routing to MANET where nodes are mobile. Here,
we designed all identical nodes in the cluster except the cluster head and this criterion reduces the
management burden on the network. Each cluster supports a few nodes with a cluster head. The intracluster
connectivity amongst the nodes within the cluster is supported by multi-hop connectivity to ensure
handling mobility in such a way that no service disruption can occur. The inter-cluster connectivity is also
achieved by multi-hop connectivity. However, for inter-cluster communications, only cluster heads are
connected. This paper demonstrates graph theoretic approach produces an optimum multi-hop connectivity
path based on cumulative minimum degree that minimizes the contention and scheduling delay end-toend.
It is applied to both intra-cluster communications as well as inter-cluster communications. The
performance shows that having a multi-hop connectivity for intra-cluster communications is more power
efficient compared to broadcast of information with maximum power coverage. We also showed the total
number of required intermediate nodes in the transmission from source to destination. However, dynamic
behavior of the nodes requires greater understanding of the node degree and mobility at each instance of
time in order to maintain end-to-end QoS for multi-service provisioning. Our simulation results show that
the proposed graph theoretic routing approach will reduce the overall delay and improves the physical
layer data frame transmission.
Wireless mesh networks offer high bandwidth Internet access for mobile users anywhere and at any time.
It is an emerging technology that uses wireless multi-hop networking to provide a cost-efficient way for
community or enterprise users to have broadband Internet access and share network resource. In this paper,
we have tried to give a comparative analysis of various Gateway Placement approaches which can be
helpful in understanding which approach will be useful in which situation.
Packet Transfer Rate & Robust Throughput for Mobile Adhoc NetworkEswar Publications
An ad-hoc wireless network is highly different considering dynamic stochastic process of its underlying links, leads to link breaks during data transaction. Hence, to provide free flow data transaction, many routing algorithms have the property of link recovery and maintenance procedures to minimize the loss of data during transmission. However these routing method do not guarantee reliable data transmission in some special application conditions with wide requirements on Packet delivery ratio and link quality of the network. Routing is a critical issue in MANET and hence the focus of this paper is the performance analysis of different routing protocols used in the
wireless network. We evaluate the ability of a mobile ad hoc wireless network to distribute flows across robust routes by introducing the robust throughput measure as a performance metric. The utility gained by the delivery of flow messages is based on the level of interruption experienced by the underlying transaction. We describe the mathematical calculation of a network’s robust throughput measure, as well as its robust throughput capacity. We introduce the robust flow admission and routing algorithm (RFAR) to provide for the timely and robust transport of flow transactions across mobile ad hoc wireless systems.
A New Efficient Cache Replacement Strategy for Named Data NetworkingIJCNCJournal
The Information-Centric Network (ICN) is a future internet architecture with efficient content retrieval and distribution. Named Data Networking (NDN) is one of the proposed architectures for ICN. NDN’s innetwork caching improves data availability, reduce retrieval delays, network load, alleviate producer load, and limit data traffic. Despite the existence of several caching decision algorithms, the fetching and distribution of contents with minimum resource utilization remains a great challenge. In this paper, we introduce a new cache replacement strategy called Enhanced Time and Frequency Cache Replacement strategy (ETFCR) where both cache hit frequency and cache retrieval time are used to select evicted data chunks. ETFCR adds time cycles between the last two requests to adjust data chunk’s popularity and cache hits. We conducted extensive simulations using the ccnSim simulator to evaluate the performance of ETFCR and compare it to that of some well-known cache replacement strategies. Simulations results show that ETFCR outperforms the other cache replacement strategies in terms of cache hit ratio, and lower content retrieval delay.
INVESTIGATING MULTILAYER OMEGA-TYPE NETWORKS OPERATING WITH THE CUT-THROUGH T...IJCNCJournal
The continuous increase in the complexity of data networks has motivated the development of more effective Multistage Interconnection Networks (MINs) as important factors in providing higher data transfer rates in various switching divisions. In this paper, semi-layer omega-class networks operating with a cut-through forwarding technique are chosen as test-bed subjects for detailed evaluation, and this network architecture is modelled, inspected, and simulated. The results are examined for relevant singlelayer omega networks operating with cut-through or ‘store and forward’ forwarding techniques. Two series of experiments are carried out: one concerns the case of uniform traffic, while the other is related to hotspot traffic. The results quantify the way in which this network outperforms the corresponding singlelayer network architectures for the same network size and buffer size. Furthermore, the effects of the dimensions of the switch elements and their corresponding reliability on the overall interconnection system are investigated, and the complexity and the relevant cost are examined. The data yielded by this investigation can be valuable to MIN engineers and can allow them to achieve more productive networks with lower overall implementation costs.
MULTICASTING BASED ENHANCED PROACTIVE SOURCE ROUTING IN MANETSIJCNCJournal
Mobile Ad-hoc Network (MANET) is an accumulation of movable nodes organizing a irregular topology without centralized administration. In a MANET, multicasting is a significant technique for utilizing data communication system. Multicasting based enhanced proactive source routing is proposed in this paper for Mobile Ad hoc Networks. It explains an innovative multicasting algorithm that considers the transmission energy and residual energy while forwarding the data packets. It improves the network throughput and raises the network lifetimes. Simulation analysis is carried in this proposed system and this method shows improved performance over the existing system.
A novel routing technique for mobile ad hoc networks (manet)ijngnjournal
Actual network size depends on the application and the protocols developed for the routing for this kind of
networks should be scalable and efficient. Each routing protocol should support small as well as large
scale networks very efficiently. As the number of node increase, it increases the management functionality
of the network. Graph theoretic approach traditionally was applied to networks where nodes are static or
fixed. In this paper, we have applied the graph theoretic routing to MANET where nodes are mobile. Here,
we designed all identical nodes in the cluster except the cluster head and this criterion reduces the
management burden on the network. Each cluster supports a few nodes with a cluster head. The intracluster
connectivity amongst the nodes within the cluster is supported by multi-hop connectivity to ensure
handling mobility in such a way that no service disruption can occur. The inter-cluster connectivity is also
achieved by multi-hop connectivity. However, for inter-cluster communications, only cluster heads are
connected. This paper demonstrates graph theoretic approach produces an optimum multi-hop connectivity
path based on cumulative minimum degree that minimizes the contention and scheduling delay end-toend.
It is applied to both intra-cluster communications as well as inter-cluster communications. The
performance shows that having a multi-hop connectivity for intra-cluster communications is more power
efficient compared to broadcast of information with maximum power coverage. We also showed the total
number of required intermediate nodes in the transmission from source to destination. However, dynamic
behavior of the nodes requires greater understanding of the node degree and mobility at each instance of
time in order to maintain end-to-end QoS for multi-service provisioning. Our simulation results show that
the proposed graph theoretic routing approach will reduce the overall delay and improves the physical
layer data frame transmission.
Wireless mesh networks offer high bandwidth Internet access for mobile users anywhere and at any time.
It is an emerging technology that uses wireless multi-hop networking to provide a cost-efficient way for
community or enterprise users to have broadband Internet access and share network resource. In this paper,
we have tried to give a comparative analysis of various Gateway Placement approaches which can be
helpful in understanding which approach will be useful in which situation.
Packet Transfer Rate & Robust Throughput for Mobile Adhoc NetworkEswar Publications
An ad-hoc wireless network is highly different considering dynamic stochastic process of its underlying links, leads to link breaks during data transaction. Hence, to provide free flow data transaction, many routing algorithms have the property of link recovery and maintenance procedures to minimize the loss of data during transmission. However these routing method do not guarantee reliable data transmission in some special application conditions with wide requirements on Packet delivery ratio and link quality of the network. Routing is a critical issue in MANET and hence the focus of this paper is the performance analysis of different routing protocols used in the
wireless network. We evaluate the ability of a mobile ad hoc wireless network to distribute flows across robust routes by introducing the robust throughput measure as a performance metric. The utility gained by the delivery of flow messages is based on the level of interruption experienced by the underlying transaction. We describe the mathematical calculation of a network’s robust throughput measure, as well as its robust throughput capacity. We introduce the robust flow admission and routing algorithm (RFAR) to provide for the timely and robust transport of flow transactions across mobile ad hoc wireless systems.
A New Efficient Cache Replacement Strategy for Named Data NetworkingIJCNCJournal
The Information-Centric Network (ICN) is a future internet architecture with efficient content retrieval and distribution. Named Data Networking (NDN) is one of the proposed architectures for ICN. NDN’s innetwork caching improves data availability, reduce retrieval delays, network load, alleviate producer load, and limit data traffic. Despite the existence of several caching decision algorithms, the fetching and distribution of contents with minimum resource utilization remains a great challenge. In this paper, we introduce a new cache replacement strategy called Enhanced Time and Frequency Cache Replacement strategy (ETFCR) where both cache hit frequency and cache retrieval time are used to select evicted data chunks. ETFCR adds time cycles between the last two requests to adjust data chunk’s popularity and cache hits. We conducted extensive simulations using the ccnSim simulator to evaluate the performance of ETFCR and compare it to that of some well-known cache replacement strategies. Simulations results show that ETFCR outperforms the other cache replacement strategies in terms of cache hit ratio, and lower content retrieval delay.
INVESTIGATING MULTILAYER OMEGA-TYPE NETWORKS OPERATING WITH THE CUT-THROUGH T...IJCNCJournal
The continuous increase in the complexity of data networks has motivated the development of more effective Multistage Interconnection Networks (MINs) as important factors in providing higher data transfer rates in various switching divisions. In this paper, semi-layer omega-class networks operating with a cut-through forwarding technique are chosen as test-bed subjects for detailed evaluation, and this network architecture is modelled, inspected, and simulated. The results are examined for relevant singlelayer omega networks operating with cut-through or ‘store and forward’ forwarding techniques. Two series of experiments are carried out: one concerns the case of uniform traffic, while the other is related to hotspot traffic. The results quantify the way in which this network outperforms the corresponding singlelayer network architectures for the same network size and buffer size. Furthermore, the effects of the dimensions of the switch elements and their corresponding reliability on the overall interconnection system are investigated, and the complexity and the relevant cost are examined. The data yielded by this investigation can be valuable to MIN engineers and can allow them to achieve more productive networks with lower overall implementation costs.
International Journal of Engineering Research and Applications (IJERA) aims to cover the latest outstanding developments in the field of all Engineering Technologies & science.
International Journal of Engineering Research and Applications (IJERA) is a team of researchers not publication services or private publications running the journals for monetary benefits, we are association of scientists and academia who focus only on supporting authors who want to publish their work. The articles published in our journal can be accessed online, all the articles will be archived for real time access.
Our journal system primarily aims to bring out the research talent and the works done by sciaentists, academia, engineers, practitioners, scholars, post graduate students of engineering and science. This journal aims to cover the scientific research in a broader sense and not publishing a niche area of research facilitating researchers from various verticals to publish their papers. It is also aimed to provide a platform for the researchers to publish in a shorter of time, enabling them to continue further All articles published are freely available to scientific researchers in the Government agencies,educators and the general public. We are taking serious efforts to promote our journal across the globe in various ways, we are sure that our journal will act as a scientific platform for all researchers to publish their works online.
A cross layer optimized reliable multicast routing protocol in wireless mesh ...ijdpsjournal
The Optimal way to create a protocol in Wireless Mesh Networks
is to take into account a cross layer due
to the interference among wireless transmissions.
In this paper
,
w
e focus on designing and implementing
a
reliable
multicast protocol
called Me
sh Reliable Multicast Protocol (MRMP).
A
recovery tree
built
dynamically
which is joining with
the multicast routing tree.
U
sing the recovery tree
the packet losses are
repaired locally
.
This Cross layer
Technique
between network layer (
multicast routing)
and transport layer
(
reliability) using simulation
results
prove
the effectiveness
and optimization
of
cross layer
in WMNs
compare with the conventional layer
DETERMINING THE NETWORK THROUGHPUT AND FLOW RATE USING GSR AND AAL2Rijujournal
In multi-radio wireless mesh networks, one node is eligible to transmit packets over multiple channels to different destination nodes simultaneously. This feature of multi-radio wireless mesh network makes high throughput for the network and increase the chance for multi path routing. This is because the multiple channel availability for transmission decreases the probability of the most elegant problem called as interference problem which is either of interflow and intraflow type. For avoiding the problem like interference and maintaining the constant network performance or increasing the performance the WMN need to consider the packet aggregation and packet forwarding. Packet aggregation is process of collecting several packets ready for transmission and sending them to the intended recipient through the channel, while the packet forwarding holds the hop-by-hop routing. But choosing the correct path among different available multiple paths is most the important factor in the both case for a routing algorithm. Hence the most challenging factor is to determine a forwarding strategy which will provide the schedule for each node for transmission within the channel. In this research work we have tried to implement two forwarding strategies for the multi path multi radio WMN as the approximate solution for the above said problem. We have implemented Global State Routing (GSR) which will consider the packet forwarding concept and Aggregation Aware Layer 2 Routing (AAL2R) which considers the both concept i.e. both packet forwarding and packet aggregation. After the successful implementation the network performance has been measured by means of simulation study.
Adaptive QoS Multicast Routing with Mobility Prediction in MANETs ijasuc
A Mobile Ad hoc NETwork (MANET) is a collection of wireless mobile hosts that form a temporary network
without a centralized administration or wired infrastructure. Due to the high mobility of nodes, the network
topology of MANETs changes very fast, making it more difficult to find the routes that message packets use.
Network control with Quality of Service (QoS) support is a key issue for multimedia applications in MANET.
Most of the real time applications have stringent requirements on bandwidth, delay, delay-jitter, packet loss
ratio, cost and other QoS metrics. This paper proposes a Multi-constrained QoS routing with mobility
prediction protocol. If the node has enough resources to transmit data packets, it uses the Global
Positioning System (GPS) to get the location information of the mobile nodes and selects the routing path
with the maximum Route Expiration Time (RET). A set of static and mobile agents are used to find the
multicast routes and transmit the packets. Extensive simulations have been conducted to evaluate the
performance of MC_MAODV using Network Simulator (NS-2). The simulation results show that the
proposed protocol achieves good performance in terms of improving packet delivery ratio and minimizing
end-to-end delay.
The congestion control within the TCP (Transmission Control Protocol) plays a critical role in
amending data rate to evade congestion from happening possibilities. Based on TCP communication sender
not only guarantees the successful packet delivery, but also maintains the correct sequence of packets by
receiving the frequent acknowledgement from the receiver. In this research we proposed a congestion
control scheme with modified TCP and queue length variation with OLSR routing protocol in MANET. The
TCP protocol performance is modified by forwarding busy channel signals to predecessor nodes through
intermediate nodes in network. The congestion is controlled by that novel method of detecting the node is
busy or ready for communication. If the communication is start in network and the possibility if congestion
is arise, then in that case the queue length is handle the possibility of congestion. The congestion is
minimized due to awaring about the channel busy status and nodes buffer status or queue status. The TCP
protocol is able to handle the congestion situation but i.e. completely based on acknowledgement of receiver
and also not very effective to control it. The proposed TCP congestion control OLSR routing is improves
the network performance by reducing packet loss. The performance of network is measure through
performance metrics like throughput, PDF and Routing overhead in different node density scenarios. The
performance of proposed scheme is provides the better results.
Mobile ad hoc network become nowadays more and more used in different
domains, due to its flexibility and low cost of deployment. However, this
kind of network still suffering from several problems as the lack of resources.
Many solutions are proposed to face these problems, among these solutions
there is the clustering approach. This approach tries to partition the network
into a virtual group. It is considered as a primordial solution that aims to
enhance the performance of the total network, and makes it possible to
guarantee basic levels of system performance. In this paper, we study some
schemes of clustering such as Dominating-Set-based clustering, Energyefficient
clustering, Low-maintenance clustering, Load-balancing clustering,
and Combined-metrics based clustering.
Improvement at Network Planning using Heuristic Algorithm to Minimize Cost of...Yayah Zakaria
Wireless Mesh Networks (WMN) consists of wireless stations that are connected with each other in a semi-static configuration. Depending on the configuration of a WMN, different paths between nodes offer different levels of efficiency. One areas of research with regard to WMN is cost minimization. A Modified Binary Particle Swarm Optimization (MBPSO) approach was used to optimize cost. However, minimized cost does not
guarantee network performance. This paper thus, modified the minimization function to take into consideration the distance between the different nodes so as to enable better performance while maintaining cost balance. The results were positive with the PDR showing an approximate increase of 17.83% whereas the E2E delay saw an approximate decrease of 8.33%.
A comparative study in wireless sensor networksijwmn
Sensor networks consist of a large number of small, low-powered wireless nodes with limited computation,
communication, and sensing abilities, in a battery-powered sensor network, energy and communication
bandwidth are a precious resources. Thus, there is a need to adapt the networking process to match the
application in order to minimize the resources consumed and extend the life of the network. In this paper,
we introduce a comparative study in different routing algorithms that propose vital solutions to the most
important issues that should be taken into account when designing wireless network which are reliability,
lifetime, communication bandwidth, transmission rand, and finally the limited energy issue, so we will
introduce their algorithms and discuss how did they propose to solve such of these challenges and finally
we will do some evaluation to each approach.
Mobile ad hoc network is a reconfigurable network of mobile nodes connected by multi-hop wireless links and capable of operating without any fixed infrastructure support. In order to facilitate communication within such self-creating, self-organizing and self administrating network, a dynamic routing protocol is needed. The primary goal of such an ad hoc network routing protocol is to discover and establish a correct and efficient route between a pair of nodes so that messages may be delivered in a timely manner. Route construction should be done with a minimum of overhead and bandwidth consumption. This paper examines two routing protocols, both on-demand source routing, for mobile ad hoc networks– the Dynamic Source Routing (DSR), an flat architecture based and the Cluster Based Routing Protocol (CBRP), a cluster architecture based and evaluates both routing protocols in terms of packet delivery fraction, normalized routing load, average end to end delay, throughput by varying number of nodes per sq. km, traffic sources and mobility. Simulation results show that in high
mobility (pause time 0s) scenarios, CBRP outperforms DSR. CBRP scales well with increasing number of nodes.
Modified q aware scheduling algorithm for improved fairness in 802.16 j networksIJCNCJournal
Deployment of Multi-hop Relays in WiMax based Cellu
lar Networks is considered as a cost effective
solution to increase the Coverage area of Base Stat
ion and also to improve the Network Capacity with h
igh
quality short links. Scheduling became a challengin
g task in these Multi-hop Relay Wireless Cellular
Networks of IEEE 802.16j standard. H. Chen, X. Xie
and H. Wu proposed a Q-aware Scheduling
Algorithm in which back-pressure flow control mecha
nism is used to reflect current Q size of the Relay
s
and considered high back-pressure links to include
in Concurrent Transmission Scenarios, to maximize t
he
throughput. This focus on high back-pressure links,
leads to starvation of Mobile Stations having low
back-
pressure links, resulting unfairness in some cases.
To remedy this situation, a Fair Link Inclusion (F
LI)
mechanism is applied in Greedy Algorithm of Q-aware
Scheduling Algorithm. Simulation results show that
Modified Q-aware Scheduling Algorithm with FLI mech
anism has reasonable improvement in fairness and
maintaining steady throughput when compared with ex
isting algorithms.
Optimized Link State Routing (OLSR) protocol is a proactive type of routing protocol that uses Multipoint
Relay (MPR) set as the virtual backbone structure. The existing literature has identified various issues with
respect to its backbone structure and has accordingly proposed improvements. In this paper, the focus is on
improving the OLSR protocol by employing a Connected Dominating Set (CDS) based virtual backbone
structure that is dynamically adaptable to rapid topology changes. A new Dynamically Adaptable Improved
Optimized Link State Routing (DA-IOLSR) protocol is proposed that uses the local topology information to
adapt the virtual backbone to topology changes. This assumes significance especially in networks that
experience very high mobility. Changes in the network topology caused by node additions, node deletions
and node mobility are taken care of. Simulations are carried out to assess the performance of DA-IOLSR
protocol and OLSR protocol. Packet delivery achieved by both the protocols is examined under varying
mobility by using various combinations of node speed and pause time values. It is found that DA-IOLSR
protocol provides better packet delivery as compared to OLSR protocol, under varying mobility conditions.
International Journal of Computational Engineering Research(IJCER) is an intentional online Journal in English monthly publishing journal. This Journal publish original research work that contributes significantly to further the scientific knowledge in engineering and Technology.
A comparative analysis on qos multicast routing protocols in MANETsIOSR Journals
Abstract: Simultaneous transmission of data from one sender to multiple receivers is called multicasting.
Several widely used applications require multicasting at least at the logical level. Examples include audio video
teleconferencing, real time video streaming and the maintenance of distributed databases. In many cases it is
advantageous to implement multicasting at the level of the routing algorithm (other approaches would be oneto-all
unicast or the implementation of multicasting at the application layer). In this paper we are presenting a
comparative analysis on various multicast routing protocols in adhoc networks.
Keywords: multicasting, multicast protocols,dynamic core, performance evaluation,Qos Parameters
A scalable and power efficient solution for routing in mobile ad hoc network ...ijmnct
Mobile Ad Hoc Network (MANET) is a very dynamic and infrastructure-less ad hoc network. The actual
network size depends on the application and the protocols developed for the routing for this kind of
networks should be scalable. MANET is a resource limited network and therefore the developed routing
algorithm for packet transmission should be power and bandwidth efficient. These kinds of dynamic
networks should operate with minimal management overhead. The management functionality of the
network increases with number of nodes and reduces the performance of the network. Here, in this paper,
we have designed all identical nodes in the cluster except the cluster head and this criterion reduces the
management burden on the network. Graph theoretic routing algorithm is used to develop route for packet
transmission by using the minimum resources. In this paper, we developed routing algorithm for cluster
based MANET and finds a path from source to destination using minimum cumulative degree path. Our
simulation results show that this routing algorithm provide efficient routing path with the increasing
number of nodes and uses multi-hop connectivity for intra-cluster to utilize minimum power for packet
transmission irrespective of number of nodes in the network.
To increase the network capacity, there is
need to minimize the interference among nodes and
optimum control of topology in the foundation of
network. Recently, technological development helps to
build of mobile ad-hoc networks (MANETs) in order to
improve the quality of service (QoS) in terms of delay. In
contradictory to the objective of minimizing interference,
it is important to concern topology control in delay
constrained environment. The present research work
attempts to control the delay-constrained topology with
jointly considering delay and interference concept.
Additionally, the study proposed an interference oriented
topology control algorithm for delay-constrained
MANETs by taking account of both the interference
constraint and the delay constraint under the specific
condition of transmission delay, contention delay and the
queuing delay. Further, the study investigated the impact
of node mobility on the interference oriented topology
control algorithm. Finally, the results of the present
study shows that the proposed algorithm controls the
topology to convince the interference constraint, and
increases the transmit range to congregate the delay
requirement. Also, the study conclude that the algorithm
could effectively reduce the delay protocol and improve
the performance effectively in delay-constrained mobile
ad hoc networks.
GRAPH THEORETIC ROUTING ALGORITHM (GTRA) FOR MOBILE AD-HOC NETWORKS (MANET)graphhoc
Battlefield theater applications require supporting large number of nodes. It can facilitate many multi-hop
paths between each source and destination pairs. For scalability, it is critical that for supporting network
centric applications with large set of nodes require hierarchical approach to designing networks. In this
research we consider using Mobile Ad Hoc Network (MANET) with multiple clusters. Each cluster
supports a few nodes with a cluster head. The intra-cluster connectivity amongst the nodes within the
cluster is supported by multi-hop connectivity to ensure handling mobility in such a way that no service
disruption can occur. The inter-cluster connectivity is also achieved by multi-hop connectivity. However,
for inter-cluster communications, only cluster heads are connected. The selection of intra-cluster
communications and inter-cluster communications allow scalability of the network to support multiservices
applications end-to-end with a desired Quality of Service (QoS). This paper proposes graph
theoretic approach to establish efficient connection between a source and a destination within each cluster
in intra-cluster network and between clusters in inter-cluster network. Graph theoretic approach
traditionally was applied networks where nodes are static or fixed. In this paper, we have applied the
graph theoretic routing to MANET where nodes are mobile. One of the important challenges in MANET is
to support an efficient routing algorithm for multi-hop communications across many nodes which are
dynamic in nature. However, dynamic behavior of the nodes requires greater understanding of the node
degree and mobility at each instance of time in order to maintain end-to-end QoS for multi-service
provisioning. This paper demonstrates graph theoretic approach produces an optimum multi-hop
connectivity path based on cumulative minimum degree that minimizes the contention and scheduling
delay end-to-end. It is applied to both intra-cluster communications as well as inter-cluster
communications. The performance shows that having a multi-hop connectivity for intra-cluster
communications is more power efficient compared to broadcast of information with maximum power
coverage. Each cluster performs similarly and the algorithm is also used for inter-cluster communications.
Our simulation results show that the proposed graph theoretic routing approach will reduce the overall
delay and improves the physical layer data frame transmission.
A Professional QoS Provisioning in the Intra Cluster Packet Level Resource Al...GiselleginaGloria
Wireless mesh networking has transpired as a gifted technology for potential broadband wireless access. In a communication network, wireless mesh network plays a vital role in transmission and are structured in a mesh topology. The coordination of mesh routers and mesh clients forms the wireless mesh networks which are routed through the gateways. Wireless mesh networks uses IEEE 802.11 standards and has its wide applications broadband home networking and enterprise networking deployment such as Microsoft wireless mesh and MIT etc. A professional Qos provisioning in intra cluster packet level resource allocation for WMN approach takes power allocation, sub carrier allocation and packet scheduling. This approach combines the merits of a Karush-Kuhn-Tucker (KKT) algorithm and a genetic algorithm (GA) based approach. The KKT algorithm uses uniform power allocation over all the subcarriers, based on the optimal allocation criterion. The genetic algorithm is used to generate useful solutions to optimization and search problems and it is also used for search problems. By combining the intrinsic worth of both the approaches, it facilitates effective QOS provisioning at the packet level. It is concluded that, this approach achieves a preferred stability between system implementation and computational convolution.
DYNAMIC CONGESTION CONTROL IN WDM OPTICAL NETWORKcscpconf
This paper is based on Wavelength Division Multiplexing (WDM) optical networking. In this optical networking, prior to data transfer, lightpath establishment between source and
destination nodes is usually carried out through a wavelength reservation protocol. This wavelength is reserved corresponding to a route between the source and destination and the
route is chosen following any standard routing protocol based on shortest path. The backward reservation protocol is implemented initially. A fixed connected and weighted network is
considered. The inputs of this implementation are the fixed network itself and its corresponding shortest path matrix. After this initial level of implementation, the average node usage over a time period is calculated and various thresholds for node usage are considered. Above threshold value, request arriving at that path selects its next shortest path. This concept is
implemented on various wavelengths. The output represents the performance issues of dynamic congestion control.
International Journal of Engineering Research and Applications (IJERA) aims to cover the latest outstanding developments in the field of all Engineering Technologies & science.
International Journal of Engineering Research and Applications (IJERA) is a team of researchers not publication services or private publications running the journals for monetary benefits, we are association of scientists and academia who focus only on supporting authors who want to publish their work. The articles published in our journal can be accessed online, all the articles will be archived for real time access.
Our journal system primarily aims to bring out the research talent and the works done by sciaentists, academia, engineers, practitioners, scholars, post graduate students of engineering and science. This journal aims to cover the scientific research in a broader sense and not publishing a niche area of research facilitating researchers from various verticals to publish their papers. It is also aimed to provide a platform for the researchers to publish in a shorter of time, enabling them to continue further All articles published are freely available to scientific researchers in the Government agencies,educators and the general public. We are taking serious efforts to promote our journal across the globe in various ways, we are sure that our journal will act as a scientific platform for all researchers to publish their works online.
A cross layer optimized reliable multicast routing protocol in wireless mesh ...ijdpsjournal
The Optimal way to create a protocol in Wireless Mesh Networks
is to take into account a cross layer due
to the interference among wireless transmissions.
In this paper
,
w
e focus on designing and implementing
a
reliable
multicast protocol
called Me
sh Reliable Multicast Protocol (MRMP).
A
recovery tree
built
dynamically
which is joining with
the multicast routing tree.
U
sing the recovery tree
the packet losses are
repaired locally
.
This Cross layer
Technique
between network layer (
multicast routing)
and transport layer
(
reliability) using simulation
results
prove
the effectiveness
and optimization
of
cross layer
in WMNs
compare with the conventional layer
DETERMINING THE NETWORK THROUGHPUT AND FLOW RATE USING GSR AND AAL2Rijujournal
In multi-radio wireless mesh networks, one node is eligible to transmit packets over multiple channels to different destination nodes simultaneously. This feature of multi-radio wireless mesh network makes high throughput for the network and increase the chance for multi path routing. This is because the multiple channel availability for transmission decreases the probability of the most elegant problem called as interference problem which is either of interflow and intraflow type. For avoiding the problem like interference and maintaining the constant network performance or increasing the performance the WMN need to consider the packet aggregation and packet forwarding. Packet aggregation is process of collecting several packets ready for transmission and sending them to the intended recipient through the channel, while the packet forwarding holds the hop-by-hop routing. But choosing the correct path among different available multiple paths is most the important factor in the both case for a routing algorithm. Hence the most challenging factor is to determine a forwarding strategy which will provide the schedule for each node for transmission within the channel. In this research work we have tried to implement two forwarding strategies for the multi path multi radio WMN as the approximate solution for the above said problem. We have implemented Global State Routing (GSR) which will consider the packet forwarding concept and Aggregation Aware Layer 2 Routing (AAL2R) which considers the both concept i.e. both packet forwarding and packet aggregation. After the successful implementation the network performance has been measured by means of simulation study.
Adaptive QoS Multicast Routing with Mobility Prediction in MANETs ijasuc
A Mobile Ad hoc NETwork (MANET) is a collection of wireless mobile hosts that form a temporary network
without a centralized administration or wired infrastructure. Due to the high mobility of nodes, the network
topology of MANETs changes very fast, making it more difficult to find the routes that message packets use.
Network control with Quality of Service (QoS) support is a key issue for multimedia applications in MANET.
Most of the real time applications have stringent requirements on bandwidth, delay, delay-jitter, packet loss
ratio, cost and other QoS metrics. This paper proposes a Multi-constrained QoS routing with mobility
prediction protocol. If the node has enough resources to transmit data packets, it uses the Global
Positioning System (GPS) to get the location information of the mobile nodes and selects the routing path
with the maximum Route Expiration Time (RET). A set of static and mobile agents are used to find the
multicast routes and transmit the packets. Extensive simulations have been conducted to evaluate the
performance of MC_MAODV using Network Simulator (NS-2). The simulation results show that the
proposed protocol achieves good performance in terms of improving packet delivery ratio and minimizing
end-to-end delay.
The congestion control within the TCP (Transmission Control Protocol) plays a critical role in
amending data rate to evade congestion from happening possibilities. Based on TCP communication sender
not only guarantees the successful packet delivery, but also maintains the correct sequence of packets by
receiving the frequent acknowledgement from the receiver. In this research we proposed a congestion
control scheme with modified TCP and queue length variation with OLSR routing protocol in MANET. The
TCP protocol performance is modified by forwarding busy channel signals to predecessor nodes through
intermediate nodes in network. The congestion is controlled by that novel method of detecting the node is
busy or ready for communication. If the communication is start in network and the possibility if congestion
is arise, then in that case the queue length is handle the possibility of congestion. The congestion is
minimized due to awaring about the channel busy status and nodes buffer status or queue status. The TCP
protocol is able to handle the congestion situation but i.e. completely based on acknowledgement of receiver
and also not very effective to control it. The proposed TCP congestion control OLSR routing is improves
the network performance by reducing packet loss. The performance of network is measure through
performance metrics like throughput, PDF and Routing overhead in different node density scenarios. The
performance of proposed scheme is provides the better results.
Mobile ad hoc network become nowadays more and more used in different
domains, due to its flexibility and low cost of deployment. However, this
kind of network still suffering from several problems as the lack of resources.
Many solutions are proposed to face these problems, among these solutions
there is the clustering approach. This approach tries to partition the network
into a virtual group. It is considered as a primordial solution that aims to
enhance the performance of the total network, and makes it possible to
guarantee basic levels of system performance. In this paper, we study some
schemes of clustering such as Dominating-Set-based clustering, Energyefficient
clustering, Low-maintenance clustering, Load-balancing clustering,
and Combined-metrics based clustering.
Improvement at Network Planning using Heuristic Algorithm to Minimize Cost of...Yayah Zakaria
Wireless Mesh Networks (WMN) consists of wireless stations that are connected with each other in a semi-static configuration. Depending on the configuration of a WMN, different paths between nodes offer different levels of efficiency. One areas of research with regard to WMN is cost minimization. A Modified Binary Particle Swarm Optimization (MBPSO) approach was used to optimize cost. However, minimized cost does not
guarantee network performance. This paper thus, modified the minimization function to take into consideration the distance between the different nodes so as to enable better performance while maintaining cost balance. The results were positive with the PDR showing an approximate increase of 17.83% whereas the E2E delay saw an approximate decrease of 8.33%.
A comparative study in wireless sensor networksijwmn
Sensor networks consist of a large number of small, low-powered wireless nodes with limited computation,
communication, and sensing abilities, in a battery-powered sensor network, energy and communication
bandwidth are a precious resources. Thus, there is a need to adapt the networking process to match the
application in order to minimize the resources consumed and extend the life of the network. In this paper,
we introduce a comparative study in different routing algorithms that propose vital solutions to the most
important issues that should be taken into account when designing wireless network which are reliability,
lifetime, communication bandwidth, transmission rand, and finally the limited energy issue, so we will
introduce their algorithms and discuss how did they propose to solve such of these challenges and finally
we will do some evaluation to each approach.
Mobile ad hoc network is a reconfigurable network of mobile nodes connected by multi-hop wireless links and capable of operating without any fixed infrastructure support. In order to facilitate communication within such self-creating, self-organizing and self administrating network, a dynamic routing protocol is needed. The primary goal of such an ad hoc network routing protocol is to discover and establish a correct and efficient route between a pair of nodes so that messages may be delivered in a timely manner. Route construction should be done with a minimum of overhead and bandwidth consumption. This paper examines two routing protocols, both on-demand source routing, for mobile ad hoc networks– the Dynamic Source Routing (DSR), an flat architecture based and the Cluster Based Routing Protocol (CBRP), a cluster architecture based and evaluates both routing protocols in terms of packet delivery fraction, normalized routing load, average end to end delay, throughput by varying number of nodes per sq. km, traffic sources and mobility. Simulation results show that in high
mobility (pause time 0s) scenarios, CBRP outperforms DSR. CBRP scales well with increasing number of nodes.
Modified q aware scheduling algorithm for improved fairness in 802.16 j networksIJCNCJournal
Deployment of Multi-hop Relays in WiMax based Cellu
lar Networks is considered as a cost effective
solution to increase the Coverage area of Base Stat
ion and also to improve the Network Capacity with h
igh
quality short links. Scheduling became a challengin
g task in these Multi-hop Relay Wireless Cellular
Networks of IEEE 802.16j standard. H. Chen, X. Xie
and H. Wu proposed a Q-aware Scheduling
Algorithm in which back-pressure flow control mecha
nism is used to reflect current Q size of the Relay
s
and considered high back-pressure links to include
in Concurrent Transmission Scenarios, to maximize t
he
throughput. This focus on high back-pressure links,
leads to starvation of Mobile Stations having low
back-
pressure links, resulting unfairness in some cases.
To remedy this situation, a Fair Link Inclusion (F
LI)
mechanism is applied in Greedy Algorithm of Q-aware
Scheduling Algorithm. Simulation results show that
Modified Q-aware Scheduling Algorithm with FLI mech
anism has reasonable improvement in fairness and
maintaining steady throughput when compared with ex
isting algorithms.
Optimized Link State Routing (OLSR) protocol is a proactive type of routing protocol that uses Multipoint
Relay (MPR) set as the virtual backbone structure. The existing literature has identified various issues with
respect to its backbone structure and has accordingly proposed improvements. In this paper, the focus is on
improving the OLSR protocol by employing a Connected Dominating Set (CDS) based virtual backbone
structure that is dynamically adaptable to rapid topology changes. A new Dynamically Adaptable Improved
Optimized Link State Routing (DA-IOLSR) protocol is proposed that uses the local topology information to
adapt the virtual backbone to topology changes. This assumes significance especially in networks that
experience very high mobility. Changes in the network topology caused by node additions, node deletions
and node mobility are taken care of. Simulations are carried out to assess the performance of DA-IOLSR
protocol and OLSR protocol. Packet delivery achieved by both the protocols is examined under varying
mobility by using various combinations of node speed and pause time values. It is found that DA-IOLSR
protocol provides better packet delivery as compared to OLSR protocol, under varying mobility conditions.
International Journal of Computational Engineering Research(IJCER) is an intentional online Journal in English monthly publishing journal. This Journal publish original research work that contributes significantly to further the scientific knowledge in engineering and Technology.
A comparative analysis on qos multicast routing protocols in MANETsIOSR Journals
Abstract: Simultaneous transmission of data from one sender to multiple receivers is called multicasting.
Several widely used applications require multicasting at least at the logical level. Examples include audio video
teleconferencing, real time video streaming and the maintenance of distributed databases. In many cases it is
advantageous to implement multicasting at the level of the routing algorithm (other approaches would be oneto-all
unicast or the implementation of multicasting at the application layer). In this paper we are presenting a
comparative analysis on various multicast routing protocols in adhoc networks.
Keywords: multicasting, multicast protocols,dynamic core, performance evaluation,Qos Parameters
A scalable and power efficient solution for routing in mobile ad hoc network ...ijmnct
Mobile Ad Hoc Network (MANET) is a very dynamic and infrastructure-less ad hoc network. The actual
network size depends on the application and the protocols developed for the routing for this kind of
networks should be scalable. MANET is a resource limited network and therefore the developed routing
algorithm for packet transmission should be power and bandwidth efficient. These kinds of dynamic
networks should operate with minimal management overhead. The management functionality of the
network increases with number of nodes and reduces the performance of the network. Here, in this paper,
we have designed all identical nodes in the cluster except the cluster head and this criterion reduces the
management burden on the network. Graph theoretic routing algorithm is used to develop route for packet
transmission by using the minimum resources. In this paper, we developed routing algorithm for cluster
based MANET and finds a path from source to destination using minimum cumulative degree path. Our
simulation results show that this routing algorithm provide efficient routing path with the increasing
number of nodes and uses multi-hop connectivity for intra-cluster to utilize minimum power for packet
transmission irrespective of number of nodes in the network.
To increase the network capacity, there is
need to minimize the interference among nodes and
optimum control of topology in the foundation of
network. Recently, technological development helps to
build of mobile ad-hoc networks (MANETs) in order to
improve the quality of service (QoS) in terms of delay. In
contradictory to the objective of minimizing interference,
it is important to concern topology control in delay
constrained environment. The present research work
attempts to control the delay-constrained topology with
jointly considering delay and interference concept.
Additionally, the study proposed an interference oriented
topology control algorithm for delay-constrained
MANETs by taking account of both the interference
constraint and the delay constraint under the specific
condition of transmission delay, contention delay and the
queuing delay. Further, the study investigated the impact
of node mobility on the interference oriented topology
control algorithm. Finally, the results of the present
study shows that the proposed algorithm controls the
topology to convince the interference constraint, and
increases the transmit range to congregate the delay
requirement. Also, the study conclude that the algorithm
could effectively reduce the delay protocol and improve
the performance effectively in delay-constrained mobile
ad hoc networks.
GRAPH THEORETIC ROUTING ALGORITHM (GTRA) FOR MOBILE AD-HOC NETWORKS (MANET)graphhoc
Battlefield theater applications require supporting large number of nodes. It can facilitate many multi-hop
paths between each source and destination pairs. For scalability, it is critical that for supporting network
centric applications with large set of nodes require hierarchical approach to designing networks. In this
research we consider using Mobile Ad Hoc Network (MANET) with multiple clusters. Each cluster
supports a few nodes with a cluster head. The intra-cluster connectivity amongst the nodes within the
cluster is supported by multi-hop connectivity to ensure handling mobility in such a way that no service
disruption can occur. The inter-cluster connectivity is also achieved by multi-hop connectivity. However,
for inter-cluster communications, only cluster heads are connected. The selection of intra-cluster
communications and inter-cluster communications allow scalability of the network to support multiservices
applications end-to-end with a desired Quality of Service (QoS). This paper proposes graph
theoretic approach to establish efficient connection between a source and a destination within each cluster
in intra-cluster network and between clusters in inter-cluster network. Graph theoretic approach
traditionally was applied networks where nodes are static or fixed. In this paper, we have applied the
graph theoretic routing to MANET where nodes are mobile. One of the important challenges in MANET is
to support an efficient routing algorithm for multi-hop communications across many nodes which are
dynamic in nature. However, dynamic behavior of the nodes requires greater understanding of the node
degree and mobility at each instance of time in order to maintain end-to-end QoS for multi-service
provisioning. This paper demonstrates graph theoretic approach produces an optimum multi-hop
connectivity path based on cumulative minimum degree that minimizes the contention and scheduling
delay end-to-end. It is applied to both intra-cluster communications as well as inter-cluster
communications. The performance shows that having a multi-hop connectivity for intra-cluster
communications is more power efficient compared to broadcast of information with maximum power
coverage. Each cluster performs similarly and the algorithm is also used for inter-cluster communications.
Our simulation results show that the proposed graph theoretic routing approach will reduce the overall
delay and improves the physical layer data frame transmission.
A Professional QoS Provisioning in the Intra Cluster Packet Level Resource Al...GiselleginaGloria
Wireless mesh networking has transpired as a gifted technology for potential broadband wireless access. In a communication network, wireless mesh network plays a vital role in transmission and are structured in a mesh topology. The coordination of mesh routers and mesh clients forms the wireless mesh networks which are routed through the gateways. Wireless mesh networks uses IEEE 802.11 standards and has its wide applications broadband home networking and enterprise networking deployment such as Microsoft wireless mesh and MIT etc. A professional Qos provisioning in intra cluster packet level resource allocation for WMN approach takes power allocation, sub carrier allocation and packet scheduling. This approach combines the merits of a Karush-Kuhn-Tucker (KKT) algorithm and a genetic algorithm (GA) based approach. The KKT algorithm uses uniform power allocation over all the subcarriers, based on the optimal allocation criterion. The genetic algorithm is used to generate useful solutions to optimization and search problems and it is also used for search problems. By combining the intrinsic worth of both the approaches, it facilitates effective QOS provisioning at the packet level. It is concluded that, this approach achieves a preferred stability between system implementation and computational convolution.
DYNAMIC CONGESTION CONTROL IN WDM OPTICAL NETWORKcscpconf
This paper is based on Wavelength Division Multiplexing (WDM) optical networking. In this optical networking, prior to data transfer, lightpath establishment between source and
destination nodes is usually carried out through a wavelength reservation protocol. This wavelength is reserved corresponding to a route between the source and destination and the
route is chosen following any standard routing protocol based on shortest path. The backward reservation protocol is implemented initially. A fixed connected and weighted network is
considered. The inputs of this implementation are the fixed network itself and its corresponding shortest path matrix. After this initial level of implementation, the average node usage over a time period is calculated and various thresholds for node usage are considered. Above threshold value, request arriving at that path selects its next shortest path. This concept is
implemented on various wavelengths. The output represents the performance issues of dynamic congestion control.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
Performance analysis of multilayer multicast MANET CRN based on steiner minim...TELKOMNIKA JOURNAL
In this study, the multicast mobile ad hoc (MANET) CRN has been developed, which involves multi-hop and multilayer consideration and Steiner minimal tree (SMT) algorithm is employed as the router protocol. To enhance the network performance with regards to throughput and packet delivery rate (PDR), as channel assignment scheme, the probability of success (POS) is employed that accounts for the channel availability and the time needed for transmission when selecting the best channel from the numerous available channels for data transmission from the source to all destinations nodes effectively. Within Rayleigh fading channels under various network parameters, a comparison is done for the performance of SMT multicast (MANET) CRN with POS scheme versus maximum data rate (MDR), maximum average spectrum availability (MASA) and random channel assignment schemes. Based on the simulation results, the SMT multicast (MANET) CRN with POS scheme was seen to demonstrate the best performance versus other schemes. Also, the results proved that the throughput and PDR performance are improved as the number the primary channels and the channel’s bandwidth increased while dropped as the value of packet size D increased. The network’s performance grew with rise in the value of idle probability (푃퐼) since the primary user’s (PU) traffic load is low when the value of 푃퐼 is high.
A Cross Layer Based Scalable Channel Slot Re-Utilization Technique for Wirele...csandit
Due to tremendous growth of the wireless based application services are increasing the demand
for wireless communication techniques that use bandwidth more effectively. Channel slot reutilization
in multi-radio wireless mesh networks is a very challenging problem. WMNs have
been adopted as back haul to connect various networks such as Wi-Fi (802.11), WI-MAX
(802.16e) etc. to the internet. The slot re-utilization technique proposed so far suffer due to high
collision due to improper channel slot usage approximation error. To overcome this here the
author propose the cross layer optimization technique by designing a device classification
based channel slot re-utilization routing strategy which considers the channel slot and node
information from various layers and use some of these parameters to approximate the risk
involve in channel slot re-utilization in order to improve the QoS of the network. The simulation
and analytical results show the effectiveness of our proposed approach in term of channel slot
re-utilization efficiency and thus helps in reducing latency for data transmission and reduce
channel slot collision.
A CROSS-LAYER BASED SCALABLE CHANNEL SLOT RE-UTILIZATION TECHNIQUE FOR WIRELE...cscpconf
Due to tremendous growth of the wireless based application services are increasing the demand for wireless communication techniques that use bandwidth more effectively. Channel slot reutilization in multi-radio wireless mesh networks is a very challenging problem. WMNs have been adopted as back haul to connect various networks such as Wi-Fi (802.11), WI-MAX (802.16e) etc. to the internet. The slot re-utilization technique proposed so far suffer due to high collision due to improper channel slot usage approximation error. To overcome this here the author propose the cross layer optimization technique by designing a device classification based channel slot re-utilization routing strategy which considers the channel slot and node information from various layers and use some of these parameters to approximate the risk involve in channel slot re-utilization in order to improve the QoS of the network. The simulation and analytical results show the effectiveness of our proposed approach in term of channel slot re-utilization efficiency and thus helps in reducing latency for data transmission and reduce
channel slot collision.
An Improved Energy Efficient Wireless Sensor Networks Through Clustering In C...Editor IJCATR
One of the major reason for performance degradation in Wireless sensor network is the overhead due to control packet and
packet delivery degradation. Clustering in cross layer network operation is an efficient way manage control packet overhead and which
ultimately improve the lifetime of a network. All these overheads are crucial in a scalable networks. But the clustering always suffer
from the cluster head failure which need to be solved effectively in a large network. As the focus is to improve the average lifetime of
sensor network the cluster head is selected based on the battery life of nodes. The cross-layer operation model optimize the overheads
in multiple layer and ultimately the use of clustering will reduce the major overheads identified and their by the energy consumption
and throughput of wireless sensor network is improved. The proposed model operates on two layers of network ie., Network Layer
and Transport Layer and Clustering is applied in the network layer . The simulation result shows that the integration of two layers
reduces the energy consumption and increases the throughput of the wireless sensor networks.
An Improved Energy Efficient Wireless Sensor Networks Through Clustering In C...Editor IJCATR
One of the major reason for performance degradation in Wireless sensor network is the overhead due to control packet and
packet delivery degradation. Clustering in cross layer network operation is an efficient way manage control packet overhead and which
ultimately improve the lifetime of a network. All these overheads are crucial in a scalable networks. But the clustering always suffer
from the cluster head failure which need to be solved effectively in a large network. As the focus is to improve the average lifetime of
sensor network the cluster head is selected based on the battery life of nodes. The cross-layer operation model optimize the overheads
in multiple layer and ultimately the use of clustering will reduce the major overheads identified and their by the energy consumption
and throughput of wireless sensor network is improved. The proposed model operates on two layers of network ie., Network Layer
and Transport Layer and Clustering is applied in the network layer . The simulation result shows that the integration of two layers
reduces the energy consumption and increases the throughput of the wireless sensor networks.
An Improved Energy Efficient Wireless Sensor Networks Through Clustering In C...Editor IJCATR
One of the major reason for performance degradation in Wireless sensor network is the overhead due to control packet and packet delivery degradation. Clustering in cross layer network operation is an efficient way manage control packet overhead and which ultimately improve the lifetime of a network. All these overheads are crucial in a scalable networks. But the clustering always suffer from the cluster head failure which need to be solved effectively in a large network. As the focus is to improve the average lifetime of sensor network the cluster head is selected based on the battery life of nodes. The cross-layer operation model optimize the overheads in multiple layer and ultimately the use of clustering will reduce the major overheads identified and their by the energy consumption and throughput of wireless sensor network is improved. The proposed model operates on two layers of network ie., Network Layer and Transport Layer and Clustering is applied in the network layer . The simulation result shows that the integration of two layers reduces the energy consumption and increases the throughput of the wireless sensor networks.
An Improved Energy Efficient Wireless Sensor Networks Through Clustering In C...Editor IJCATR
One of the major reason for performance degradation in Wireless sensor network is the overhead due to control packet and packet delivery degradation. Clustering in cross layer network operation is an efficient way manage control packet overhead and which ultimately improve the lifetime of a network. All these overheads are crucial in a scalable networks. But the clustering always suffer from the cluster head failure which need to be solved effectively in a large network. As the focus is to improve the average lifetime of sensor network the cluster head is selected based on the battery life of nodes. The cross-layer operation model optimize the overheads in multiple layer and ultimately the use of clustering will reduce the major overheads identified and their by the energy consumption and throughput of wireless sensor network is improved. The proposed model operates on two layers of network ie., Network Layer and Transport Layer and Clustering is applied in the network layer . The simulation result shows that the integration of two layers reduces the energy consumption and increases the throughput of the wireless sensor networks.
PERFORMANCE ANALYSIS OF CHANNEL ACCESS MODEL FOR MAC IN RANDOMLY DISTRIBUTED ...IJCNCJournal
Medium Access control (MAC) is one of the fundamental problems in wireless sensor networks. The performance of wireless sensor network depends on it. The main objective of a medium access control method is to provide high throughput, minimize the delay, and conservers the energy consumption by avoiding the collisions. In this paper, a general model for MAC protocol to reduce the delay, maximize throughput and conserve the energy consumption in channel accessing in high density randomly distributed wireless sensor network is presented. The proposed model is simulated using MATLAB. The simulation results show that the average delay for sensors with sufficient memory is lower than sensors without
memory. Further, the throughput of the channel access method with memory is better than without memory.
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
Designing an Energy Efficient Clustering in Heterogeneous Wireless Sensor Net...IJCNCJournal
Designing an energy-efficient scheme in a Heterogeneous Wireless Sensor Network (HWSN) is a critical issue that degrades the network performance. Recharging and providing security to the sensor devices is very difficult in an unattended environment once the energy is drained off. A Clustering scheme is an important and suitable approach to increase energy efficiency and transmitting secured data which in turn enhances the performance in the network. The proposed algorithm Energy Efficient Clustering (EEC) works for optimum energy utilization in sensor nodes. The algorithm is proposed by combining the rotation-based clustering and energy-saving mechanism for avoiding the node failure and prolonging the network lifetime. This shows MAC layer scheduling is based on optimum energy utilization depending on the residual energy. In the proposed work, a densely populated network is partitioned into clusters and all the cluster heads are formed at a time and selected on rotation based on considering the highest energy of the sensor nodes. Other cluster members are accommodated in a cluster based on Basic Cost Maximum flow (BCMF) to allow the cluster head for transmitting the secured data. Carrier Sense Multiple Access (CSMA), a contention window based protocol is used at the MAC layer for collision detection and to provide channel access prioritization to HWSN of different traffic classes with reduction in End to End delay, energy consumption, and improved throughput and Packet delivery ratio(PDR) and allowing the cluster head for transmission without depleting the energy. Simulation parameters of the proposed system such as Throughput, Energy, and Packet Delivery Ratio are obtained and compared with the existing system.
DESIGNING AN ENERGY EFFICIENT CLUSTERING IN HETEROGENEOUS WIRELESS SENSOR NET...IJCNCJournal
Designing an energy-efficient scheme in a Heterogeneous Wireless Sensor Network (HWSN) is a critical
issue that degrades the network performance. Recharging and providing security to the sensor devices is
very difficult in an unattended environment once the energy is drained off. A Clustering scheme is an
important and suitable approach to increase energy efficiency and transmitting secured data which in turn
enhances the performance in the network. The proposed algorithm Energy Efficient Clustering (EEC)
works for optimum energy utilization in sensor nodes. The algorithm is proposed by combining the
rotation-based clustering and energy-saving mechanism for avoiding the node failure and prolonging the
network lifetime. This shows MAC layer scheduling is based on optimum energy utilization depending on
the residual energy. In the proposed work, a densely populated network is partitioned into clusters and all
the cluster heads are formed at a time and selected on rotation based on considering the highest energy of
the sensor nodes. Other cluster members are accommodated in a cluster based on Basic Cost Maximum
flow (BCMF) to allow the cluster head for transmitting the secured data. Carrier Sense Multiple Access
(CSMA), a contention window based protocol is used at the MAC layer for collision detection and to
provide channel access prioritization to HWSN of different traffic classes with reduction in End to End
delay, energy consumption, and improved throughput and Packet delivery ratio(PDR) and allowing the
cluster head for transmission without depleting the energy. Simulation parameters of the proposed system
such as Throughput, Energy, and Packet Delivery Ratio are obtained and compared with the existing
system.
With the increase of usage of wireless networks for purposes where the nodes are either stationary or minimally mobile, focus is also on increasing the network capacity of wireless networks. One such way is to use non-overlapping multiple channels provided by 802.11 by using multiple interfaces per node. Multiple non overlapped channels exist in the 2.4 GHz and 5 GHz spectrum. Under this scenario, several challenges need to be addressed before all the available channels can be fully utilized.
Similar to ENERGY EFFICIENT MULTICAST ROUTING IN MANET (20)
Welcome to TechSoup New Member Orientation and Q&A (May 2024).pdfTechSoup
In this webinar you will learn how your organization can access TechSoup's wide variety of product discount and donation programs. From hardware to software, we'll give you a tour of the tools available to help your nonprofit with productivity, collaboration, financial management, donor tracking, security, and more.
How to Make a Field invisible in Odoo 17Celine George
It is possible to hide or invisible some fields in odoo. Commonly using “invisible” attribute in the field definition to invisible the fields. This slide will show how to make a field invisible in odoo 17.
Students, digital devices and success - Andreas Schleicher - 27 May 2024..pptxEduSkills OECD
Andreas Schleicher presents at the OECD webinar ‘Digital devices in schools: detrimental distraction or secret to success?’ on 27 May 2024. The presentation was based on findings from PISA 2022 results and the webinar helped launch the PISA in Focus ‘Managing screen time: How to protect and equip students against distraction’ https://www.oecd-ilibrary.org/education/managing-screen-time_7c225af4-en and the OECD Education Policy Perspective ‘Students, digital devices and success’ can be found here - https://oe.cd/il/5yV
Palestine last event orientationfvgnh .pptxRaedMohamed3
An EFL lesson about the current events in Palestine. It is intended to be for intermediate students who wish to increase their listening skills through a short lesson in power point.
Ethnobotany and Ethnopharmacology:
Ethnobotany in herbal drug evaluation,
Impact of Ethnobotany in traditional medicine,
New development in herbals,
Bio-prospecting tools for drug discovery,
Role of Ethnopharmacology in drug evaluation,
Reverse Pharmacology.
Unit 8 - Information and Communication Technology (Paper I).pdfThiyagu K
This slides describes the basic concepts of ICT, basics of Email, Emerging Technology and Digital Initiatives in Education. This presentations aligns with the UGC Paper I syllabus.
The French Revolution, which began in 1789, was a period of radical social and political upheaval in France. It marked the decline of absolute monarchies, the rise of secular and democratic republics, and the eventual rise of Napoleon Bonaparte. This revolutionary period is crucial in understanding the transition from feudalism to modernity in Europe.
For more information, visit-www.vavaclasses.com
How to Create Map Views in the Odoo 17 ERPCeline George
The map views are useful for providing a geographical representation of data. They allow users to visualize and analyze the data in a more intuitive manner.
Operation “Blue Star” is the only event in the history of Independent India where the state went into war with its own people. Even after about 40 years it is not clear if it was culmination of states anger over people of the region, a political game of power or start of dictatorial chapter in the democratic setup.
The people of Punjab felt alienated from main stream due to denial of their just demands during a long democratic struggle since independence. As it happen all over the word, it led to militant struggle with great loss of lives of military, police and civilian personnel. Killing of Indira Gandhi and massacre of innocent Sikhs in Delhi and other India cities was also associated with this movement.
Basic phrases for greeting and assisting costumers
ENERGY EFFICIENT MULTICAST ROUTING IN MANET
1. International Journal of Computer Science, Engineering and Information Technology (IJCSEIT), Vol.2, No.3, June 2012
DOI : 10.5121/ijcseit.2012.2304 59
ENERGY EFFICIENT MULTICAST ROUTING
IN MANET
Sankar M S1
and Suganthi B2
1 & 2
Department of Electronics and Communication, Dhanalakshmi Srinivasan
Engineering College, Perambalur, Tamil Nadu, India.
sankaraswin@gmail.com1
suguadi@sify.com2
ABSTRACT
In this paper, we have presented the Modified Multicasting through Time Reservation using Adaptive
Control for Excellent Energy efficiency (MMC-TRACE). It is a real time multicasting architecture for
Mobile Ad-Hoc networks to make their work an energy efficient one .MMC-TRACE is a cross layer design
where the network layer and medium access control layer functionality are done in a single integrated
layer design. The basic design of 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 maximized by enabling
the particular node from sleep to awake mode while the remaining nodes of the same path are maintained
at sleep mode. Energy efficiency too achieved by eliminating most of the redundant data receptions across
nodes. The performance of MMC-TRACE are evaluated with the help of ns-2 simulations and comparisons
are made with its predecessor such as MC-TRACE. The results show that the MMC-TRACE provides
superior energy efficiency, competitive QoS performance and bandwidth efficiency.
KEYWORDS
Quality of Service, Cross Layer Design, Multicast Routing, Redundant Data Detection.
1. INTRODUCTION
QoS is the performance level of a service offered by the network, in general. Specifically, QoS in
voice communications necessitates 1) maintaining a high enough packet delivery ratio (PDR), 2)
keeping the packet delay low enough, and 3) minimizing the jitter in packet arrival times. Thus,
the goal in QoS provisioning is to achieve a more deterministic network behaviour (i.e., bounded
delay, jitter, and PDR) .Actually, flooding, which is the simplest group communication algorithm,
is good enough to achieve high PDR provided that the data traffic and/or node density is not very
high so that the network is not congested. However, flooding generally is not preferred as a
multicast routing protocol due to its excessive use of the available bandwidth. Thus, the second
objective of a multicast routing protocol is to utilize the bandwidth efficiently, which is directly
related with the number of retransmissions (throughout this paper, the term retransmission is used
for relaying) required to deliver generated data packets to all members of a multicast group with a
high enough PDR. The third objective of a multicast protocol is to minimize the energy
dissipation of the network. Although optimizing the performance of a wireless communication
system by incorporating cross-layer design is a tempting choice, several researchers have argued
that such a cross-layer design is not the best choice in the long run because it sacrifices
modularity and can lead to unintended cross-layer interactions. However, by strictly adhering to a
2. International Journal of Computer Science, Engineering and Information Technology (IJCSEIT), Vol.2, No.3, June 2012
60
standard layering approach, we may miss out on performance improvements that can be offered
through the exploitation of the less restricted cross-layer design space. Therefore, in this paper,
we propose a multicasting architecture based on cross-layer design while exercising the utmost
caution to avoid unintended cross layer interactions. MC-TRACE inherits its cross-layer
architecture from the MH-TRACE architecture. Although there are many protocols for
multicasting in mobile ad hoc networks], to the best of our knowledge, there is no single protocol
that jointly addresses QoS, spatial reuse efficiency, and total energy dissipation.
2. RELATED WORK
There are many multicast routing protocols designed for mobile ad hoc networks they can be
categorized into two broad categories: tree-based approaches and mesh-based approaches. Tree-
based approaches create trees originating at the source and terminating at multicast group
members with an objective of minimizing a cost function. A multicast protocol for ad hoc
wireless networks (AMRIS) constructs a shared delivery tree rooted at one of the nodes, with IDs
increasing as they radiate from the source. Local route recovery is made possible due to this
property of the IDs, hence, reducing the route discovery time and also confining route recovery
overhead to the proximity of the link failure. Mesh-based multicasting is better suited to highly
dynamic topologies, simply due to the redundancy associated with this approach.. In mesh-based
approaches, there is more than one path between the source and the multicast group members
(i.e., a redundant multicast tree). One such mesh-based multicast protocol, On-Demand Multicast
Routing Protocol (ODMRP) , is based on periodic flooding of the network by the source node
through control packets to create a multicast mesh. This basic operation is used both to create the
initial multicast forwarding state and to maintain the mesh in case of node mobility and other
network dynamics. In ODMRP, an active source periodically floods the network with JOIN
QUERY control packets. When a node receives a JOIN QUERY packet, it marks the first node it
receives the packet from as the upstream node and rebroadcasts the JOIN QUERY packet. When
a multicast group member receives a JOIN QUERY packet, it replies back with a JOIN REPLY
packet, which is forwarded back to the source node via traversing the reverse path. Each upstream
node sets a group forwarding flag for the multicast group indicated in the packet header and
becomes a member of the multicast mesh. The forwarding state expires after a predetermined
time. The MC-TRACE active multicast backbone is a highly pruned tree. In, an energy efficient
multicasting algorithm for wireless networks with fixed transmit power nodes is proposed. In , a
passive clustering algorithm, which considers both stability and residual energy of neighbouring
nodes when selecting cluster heads and gateways, is proposed. This algorithm significantly
reduces routing-related control overhead. The focus of the model is on multicast services in
wireless LANs.
.
2.1. MC-TRACE MEDIUM ACCESS CONTROL ARCHITECTURE
Multicasting through Time Reservation using Adaptive Control for Energy efficiency (MC-
TRACE) is a MAC protocol for energy-efficient real-time data communications In MC-TRACE,
the network is partitioned into overlapping clusters through a distributed algorithm. Time is
organized into cyclic constant duration super frames ð TSF Þ consisting of several frames. Each
cluster head (CH) chooses the least noisy frame to operate within and dynamically changes its
frame according to the interference level of the dynamic network. Nodes gain channel access
through a dynamically updated and monitored transmission schedule created by the CHs,
eliminating packet collisions within the cluster. Collisions with the members of other clusters are
also reduced by the CH’s selection of the minimal interference frame. Nodes that are scheduled to
transmit data send a short IS packet prior to data transmission. The IS packet includes information
about the data packet, for example, in an IS slot, the ID of the corresponding upcoming data
packet1 is announced so that the nodes that have already received the data packet do not waste
3. International Journal of Computer Science, Engineering and Information Technology (IJCSEIT), Vol.2, No.3, June 2012
61
energy receiving a previously received data packet. Channel access is automatically renewed by
the continuous use of a reserved data slot.
2.2. MMC-TRACE ARCHITECTURE
The basic functionalities provided by MC-TRACE are topology control, cluster creation and
maintenance, distributed data transmission scheduling, and medium access control. MC-TRACE
have the mechanism for routing but lacks error handling and maintenance. MMC-TRACE is an
architecture built on MC-TRACE and is capable of multicast routing and error handling. Both the
advantages provided by and the restrictions imposed by MC-TRACE on MMC-TRACE are
explained
2.3. Integration with MH-TRACE
Layer part, where the network layer functionality is tailored according to the MAC layer
functionality. The integration principles of MMC-TRACE with MC-TRACE can be itemized as
follows:
1. MC-TRACE is designed to provide periodic channel access to a stream of data packets (to
provide QoS for streaming media, like real-time voice or video sources). Thus, once channel
access is granted to a node, the channel should be utilized for a group of periodic data packets
rather than a single data packet; otherwise, the efficiency of the channel access is deteriorated.
Furthermore, data slots are designed to host relatively large chunks of data in MMC-TRACE to
provide better scheduling, and consequently, better energy efficiency for mobile nodes. If a data
slot is used to transmit a control packet, then most of the slot time will be empty and bandwidth
will be wasted. The projection of these facts on the design of MMC-TRACE is that the main
multicast tree creation and maintenance mechanisms should be carried out through IS packets
rather than through independent control packets transmitted in data slots. Hence, it is more
efficient to reserve the data slots for data packets and use other mechanisms to transmit control
packets.
2. Header packets include the data transmission schedule of the coming frame, which is a
common feature of many TDMA-based MAC protocols, including the IEEE 802.16. This
information can be used by the nodes that receive the header packet to schedule the reception
times of the data packets they are interested in. However, in a multihop network, not all nodes
will hear the header packet sent by their neighbours' CH, and thus, they will not know when their
neighbours are scheduled to transmit. Relaying the schedule packet to two-hop neighbours could
be a solution, but this will incur extra overhead. One solution is to have every node that is
scheduled to transmit data in the current frame transmit its own schedule prior to data
transmission. MH-TRACE provides a framework that can be utilized for this purpose, through the
use of the IS slots. The IS packet format is presented.
3. In some cases, network operation necessitates explicit control functionality beyond what can be
performed implicitly through data packets. For such cases, control packets are needed. The IS sub
frame is the most appropriate portion of the frame in which to transmit such packets, as all the
nodes are guaranteed to be awake only during the IS sub frame. The aforementioned integration
principles outline both the design limitations imposed and the benefits provided by the underlying
MC-TRACE MAC scheme in MMC-TRACE.
2.4. Overview
There are five basic building blocks in MMC-TRACE as follows:
4. International Journal of Computer Science, Engineering and Information Technology (IJCSEIT), Vol.2, No.3, June 2012
62
1. Route discovery (RTD)
2. Route allocation (RTA)
3. Route maintenance (RTM)
4. Route error handling, (REH ) and
5. Route creation (RTC)
Figure 1: Multicast Group Node Allocation Representation
2.4.1 ROUTE DICOVERY:
A source node initiates a session by broadcasting packets to its one-hop neighbours. Nodes that
receive a data packet contend for channel access, and the ones that obtain channel access
retransmit the data they received. Eventually, the data packets are received by all the nodes in the
network, possibly multiple times. Each retransmitting node acknowledges its upstream node by
announcing the ID of its upstream node in its IS packet, which precedes its data packet
transmission. Such a scenario can be better understood by considering the network branch formed
by nodes S, 1, 2, M1, and 3 in Fig . The contents of the IS packets for this network branch are
illustrated in Fig. 2a. 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. 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 nodes (i.e., nodes that do not have any downstream nodes that are
acknowledging them as upstream nodes) continue to announce the null ID as their downstream
node ID. At this point, some of the nodes have multiple upstream nodes (i.e., multiple nodes that
have lower hop distance to the source than the current node) and downstream nodes (i.e., multiple
downstream nodes acknowledging the same upstream node as their upstream node). 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.
2.4.2 ROUTE ALLOCATION
A node that is not a multicast relay also ceases to retransmit data if it does not receive an ACK3
from any downstream node. After the initial flooding, all the nodes receive the data packets and
5. International Journal of Computer Science, Engineering and Information Technology (IJCSEIT), Vol.2, No.3, June 2012
63
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 (as described in the previous section, node 3 is also not a multicast relay). Node 15 will
cease retransmitting the packets that it receives from its upstream node 14 TRLY time after its
first retransmission of data because no node is acknowledging its data transmissions. However,
until that time, node 15 acknowledges its upstream node, which is node 14. Some of the multicast
group members are not multicast relays. The left panel of Fig. 2c illustrates such a situation.
Multicast node (node M3) 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 (node 17). Hence, nodes M4, M6, and M7 do not acknowledge node 17 (node 17 is
acknowledged by node M3). 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 in less than TRLY time (i.e., node M3’s multicast relay
status does not expire before 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.
Although none of the other multicast nodes acknowledge any node, they monitor their upstream
node through IS and data packets.
.
2.4.3 ROUTE MAINTAINENCE:
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 (nodes M4, M6, and M7) start to acknowledge
the upstream node by announcing the ID of the upstream node (node 17) in their IS packets. Thus,
node 17 continues to be a multicast relay and one of the downstream multicast nodes (node M4 in
this scenario) becomes a multicast relay after receiving a downstream ACK from its upstream
node (node 17) acknowledges node M4 by a downstream ACK because it is the first node that
acknowledges node 17 by an upstream ACK—the other multicast nodes’ ACKs are received by
node 17 later than the ACK of node M4). Observe that nodes M4, M6, and M7 form a redundant
passive outer mesh for the tree branch. The RTM mechanism does not necessarily create a new
branch, yet it prevents an existing branch from collapsing. However, there are situations where
new branches should be incorporated into the tree.
2.4.4 ROUTE ERROR HANDLING:
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.. 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 REH mechanism. The left panel of Fig. 4d 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 (i.e., nodes 20, 21, and 22 are in the receive ranges of all the three nodes).
After some time, as illustrated in the right panel of Fig. 4d, node 19 moves away from its original
6. International Journal of Computer Science, Engineering and Information Technology (IJCSEIT), Vol.2, No.3, June 2012
64
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.
2.4.5 ROUTE CREATION:
It is possible that due to the dynamics of the network (e.g., mobility, unequal interference), 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. 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 (assume that nodes 23, 24, and 25 are passive nodes and they are pruned down after IFL).
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. One situation that can create such inactivity is that the
upstream ACKs of node 77 and node M2 are colliding and node 6 cannot receive any downstream
ACK. Thus, node 6 ceases to relay packets, which eventually results in silencing all the upstream
nodes up to the source (i.e., if node 6 does not get any downstream ACKs, it ceases
acknowledging its upstream node, node 5, after TRLY time, which results in the silencing of node
5 in 2TRLY time and node 4 in 3TRLY time). 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 RTM packet. Note that such a node first tries
repairing the branch through the RTM mechanism, and it will use the RTM mechanism only if the
RTM mechanism fails to fix the interruption of data flow for TCRB time. A RTM packet is
transmitted by using one of the empty IS slots, which is chosen randomly. Upon receiving a RTM
packet, all nodes in the receive range of the transmitting node switch to RTC status if their own
HDTS is less than or equal to the HDTS of the sender (e.g., node 6, which has an HDTS of three,
switches to RTC status; however, node 9, which has an HDTS of 5, does not). When a node
switches to RTC 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 RTC request by
broadcasting a RTC packet to its one-hop neighbours. This procedure continues until a node with
the desired data packets is found The RTC 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 RTC mechanism and 2) it requires more resources in terms of bandwidth and energy
to fix (or in some cases, recreate) 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. Hence, RTC is an infrequently utilized mechanism
when compared to the other mechanisms, yet without it, MMC-TRACE is not a complete
multicast protocol and cannot cope with network dynamics efficiently.
2.5. SIMULATIONS AND RESULTS:
We explored the QoS and energy dissipation characteristics of MMC-TRACE and MC-TRACE
through extensive ns _ 2 simulations. The ns _ 2 MC-TRACE code provided by the ns _ 2
Monarch wireless extensions. We have chosen MC-TRACE as the multicast protocol to
compare with MC-TRACE because 1) MC-TRACE is a well-known multicast protocol for ad
hoc networks, 2) There are many studies that compare OMC-TRACE against other group
communication (multicast/broadcast) protocols, and therefore, it is possible to compare the
performance of MMC-TRACE with many other protocols by benchmarking against MC-TRACE,
and 3) we want to show that it is possible to reach the QoS level provided by a general purpose
architecture (MC-TRACE) for voice communications with an energy conserving multicast
architecture (MMC-TRACE).
7. International Journal of Computer Science, Engineering and Information Technology (IJCSEIT), Vol.2, No.3, June 2012
65
The voice packet generation rate is set to 32.0 ms, and the voice packet drop threshold (the
maximum allowed lifetime of a voice packet) is set to 160.0 ms . Furthermore, we used another
packet drop threshold for the packets at the source (T drop - source ¼ 32:0 ms) for avoiding delay
accumulation at the source.
The following graphs are resulted as the simulation results viz., as follows
1.Energy Dissipation
2.Delay
3.Packet Delivery Ratio
Table 1: Simulation Parameters
8. International Journal of Computer Science, Engineering and Information Technology (IJCSEIT), Vol.2, No.3, June 2012
66
Figure 2: The Energy Saving Factor
As a first result we describe about the Energy Dissipation factor occurs in MANETs. While
forming a Mobile Ad-Hoc Network there are various node which are spread over a wide area. So
there will be exactly a source node and remaining as destinations. So here a packet from one node
is send to another they form a path and travel that particular path. So in case of failure of one path
the packets are travelled through another alternative path. While doing so the previous path
remains active but their activation takes energy to be wasted. So here we implement the concept
of switching the node to sleep mode by means of which the waste of energy is conserved .So in
the following graph we represent a enough difference between the MMC-TRACE and MC-
TRACE by means of graphical representation. The x-axis and y-axis are taken as time and
average energy respectively. For a small scale integration we take the time factor to be
represented in milliseconds (ms) and the energy factor as Joules(J).Joules is a universal standard
for representing energy and here the amount of energy conserved is considerably low. For a
peculiar difference here MC-TRACE is represented as red plots and MMC-TRACE as green
plots. Thus by means of graphical proofs MMC-TRACE is more energy efficient compared to
MC-TRACE
9. International Journal of Computer Science, Engineering and Information Technology (IJCSEIT), Vol.2, No.3, June 2012
67
Figure 3:The Delay factor as per data transfer
In this section we describe about the delay factor taken place during the transmission of packets.
As a general concept the data's from one node to another node are travelled by means of small
packets as per the capacity of the route. While doing so the 1st packet reaching the destination
node must immediately send the acknowledgement to alarm the source to send the next packet.
The time taken for the acknowledgement to reach the source is the factor called as delay. So delay
could be reduce by reducing the interferences across the route node and making one node for one
particular purpose. By means of which work maintained faster and this too involved in the energy
conservation. Now the graphical representation denotes the comparison graphs between MMC-
TRACE and MC-TRACE. The x-axis and y-axis terms are taken as time and delay respectively.
The differences are made by plotting with different colours .i.e. MMC-TRACE with green colour
and MC-TRACE with red colour. Here the timing factor is represented in
milliseconds(ms).Finally the difference graph states that MMC-TRACE have less delay compared
to MC-TRACE.A common term that delay is taken a value with multiple of 10^-3 because delay
always remains low for a particular packet and they have its maximum state only during system
hang up.
10. International Journal of Computer Science, Engineering and Information Technology (IJCSEIT), Vol.2, No.3, June 2012
68
Figure 4: Packet Delivery Ratio Vs Speed
Third result of the simulation is considered to be Packet Delivery Ratio (pdr).And the following
section briefly explains about pdr .As per the following representation graphs the difference
graphs are drawn between MMC-TRACE and MC-TRACE and the colour representations as
green and red respectively. As a general concept pdr means the overall ratio of the packets
delivered to the particular destination. So by means of which a ratio is calculated. These values
are plotted in a same graph for different values of MMC-TRACE and MC-TRACE with various
representation. So the x and y terms are taken as time and pdr .Here the representations are made
as milliseconds(ms) for time and no. of packets respect to pdr. The final statement states that the
pdr level of MMC-TRACE is higher than MC-TRACE. So the time taken remains less and the
energy factor is reduced. Do to this the Bandwidth efficiency is achieved. By means of all
parameters a competitive Quality of Service is achieved.
3. CONCLUSIONS
We have compared the performance of MMC-TRACE with MC-TRACE in terms of packet
delivery ratio, delay, and energy dissipation through ns-2 simulations. The packet delay of MMC-
TRACE is lesser than MC-TRACE for low data rate with low node density. But for high data rate
with high node density for larger multicast group sizes, MMC-TRACE delay exceeds MC-
TRACE due to high congestion in the network. On the other hand, packet delivery ratio is higher
than MC-TRACE at all data points. As the delay and packet delivery ratio are important metrics
in real-time data QoS, from the above results it can be concluded that the competitive QoS
performance has been provided with MMC-TRACE. It 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 neighbouring nodes around the active branches,
repair the broken links, mostly, locally. Thus, the well-known branch breakage vulnerability of
tree-based multicast approaches in highly dynamic scenarios is alleviated by incorporating the
passive condensed mesh concept into the tree-based multicasting.
11. International Journal of Computer Science, Engineering and Information Technology (IJCSEIT), Vol.2, No.3, June 2012
69
REFERENCES
[1] Energy-Efficient Real-Time Multicast Routing in Mobile Ad Hoc Networks Bulent Tavli and Wendi
B. Heinzelman, Senior Member, IEEE
[2] C.S.R. Murthy and B.S. Manoj, Ad Hoc Wireless Networks: Architectures and Protocols. Prentice
Hall, 2004.
[3] . Janssen, D.D. Vleeschauwer, G.H. Petit, R. Windey, and J.M.Leroy, “Delay Bounds for Voice over
IP Calls Transported over Satellite Access Links,” Mobile Networks and Applications, vol. 7, pp. 79-
89, 2002.
[4] B.Tavli and W. Heinzelman, Mobile Ad Hoc Networks: Energy-Efficient Real-Time Group
Communications. Springer, 2006.
[5] C.W. Wu and Y.C. Tay, “AMRIS: A Multicast Protocol for Ad Hoc Wireless Networks,” Proc. IEEE
Military Comm. Conf., vol. 1, pp. 25-29, 1999.
[6] S.J. Lee, W. Su, and M. Gerla, “On-Demand Multicast Routing Protocol in Multihop Wireless Mobile
Networks,” Mobile Networks and Applications, vol. 7, pp. 441-453, 2002.
[7] V. Kawadia and P.R. Kumar, “A Cautionary Perspective on Cross- Layer Design,” IEEE Wireless
Comm., vol. 12, no. 1, pp. 3-11, Feb.2005.
[8] J.G. Jetcheva and D.B. Johnson, “Adaptive Demand-Driven Multicast Routing in Multi-Hop Wireless
Ad Hoc Networks,”Proc. ACM Int’l Symp. Mobile Ad Hoc Networking and Computing,pp. 33-44,
2001.
[9] S. Athanassopoulos, I. Caragiannis, C. Kaklamanis,and P.Kanellopoulos, “Experimental Comparison
of Algorithms for Energy-Efficient Multicasting in Ad Hoc Networks,” Proc. Int’l Conf. Ad-Hoc,
Mobile, and Wireless Networks, pp. 183-196, 2004.
[10] W. Liang, “Approximate Minimum-Energy Multicasting in Wireless Ad Hoc Networks,” IEEE Trans.
Mobile Computing, vol. 5, no. 4, pp. 377-387, Apr. 2006.
[11] 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.
[12] 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.
[13] B. Tavli and W. Heinzelman, “Energy and Spatial Reuse Efficient Network Wide Real-Time Data
Broadcasting in Mobile Ad Hoc Networking,” IEEE Trans. Mobile Computing, vol. 5, no. 10,pp.
1297-1312, Oct. 2006.
[14] 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.
[15] Network Simulator (NS), http://www.isi.edu/nsnam/ns, 2010.
[16] S.J. Lee, W. Su, J. Hsu, M. Gerla, and R. Bagrodia, “A Performance Comparison of Ad Hoc Wireless
Multicast Protocols,” Proc. IEEE Conf. Computer Comm., pp. 565-574, 2000.
[17] W. Ye and J. Heidemann, “Medium Access Control in Wireless Sensor Networks,” Technical Report
ISI-TR-580, Information Sciences Inst., Univ. of Southern California, 2003.
[18] J.-P. Ebert, S. Aier, G. Kofahl, A. Becker, B. Burns, and A. Wolisz,“Measurement and Simulation of
the Energy Consumption of an WLAN Interface,” Telecomm. Network Group Technical Report
TKN-02-010, Technical Univ. of Berlin, 2002.
[19] 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.
[20] 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.
[21] 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.
12. International Journal of Computer Science, Engineering and Information Technology (IJCSEIT), Vol.2, No.3, June 2012
70
Authors
Sankar M S received the BE degree in electronics and communication engineering from
the Anna University, Chennai, Tamil Nadu, India, in 2010, and awaiting for the ME
degree in communication systems from Anna University, Chennai ,Tamil Nadu, India, in
2012 respectively.. His research interests include telecommunications, networking,
signal processing, and image processing.
Suganthi.B received the B.E electronics and communication engineering from the
Bharathidasan University, Tiruchirappalli, in 1999 and ME degree in communication
systems from the Anna University, Chennai, Tamil Nadu, India, in 2007. Her research
interest includes mobile computing.