The three-way need for higher data rates, good quality of service and ubiquity in a converged all IP
communication cloud drives research in wireless communication. Wireless access networks are envisaged
candidates of the next generation wireless networks. The various access networks will be integrated with
other technologies including the wired backbone. The major issues in an all IP and converged networks
are: quality of service, seamless handover and network capacity. Emerging research seeks to address these
open research issues; for example the implementation of multi-channel and multi radio MAC protocols in
WMN. In this paper we analyze and evaluate the effectiveness of multi-channel and multi radio techniques
in WMN. The shortcomings of these schemes are highlighted and possible solutions are suggested. The
signalling delay metric is used for evaluation purposes. The focus is on the performance of the control
channel identified as the critical performance metric of multi-channel MAC protocols.
In Wireless Sensor Network (WSN), QoS (Quality of Service) in sensor application plays a very important
role. QoS based routing is required to ensure the best use of nodes in WSN. In this paper, a comparative
study of QoS based routing in Media Access Control (MAC) protocols are presented based on the traits to
solve problems like prioritization, timeliness, reliability etc. The study mainly focuses on some priority
based QoS protocols used in WSN and a comparison among them. The study reveals that among the five
mentioned protocols; QMAC, PRIMA, DB-MAC, RAP, GTS; PRIMA shows the best performance in the
category of Packet Prioritization, Scheduling Scheme, Queue Type, Energy Awareness and QoS.
Efficient and Fair Bandwidth Allocation AQM Scheme for Wireless NetworksCSCJournals
Heterogeneous Wireless Networks are considered nowadays as one of the potential areas in research and development. The traffic management’s schemes that have been used at the fusion points between the different wireless networks are classical and conventional. This paper is focused on developing a novel scheme to overcome the problem of traffic congestion in the fusion point router interconnected the heterogeneous wireless networks. The paper proposed an EF-AQM algorithm which provides an efficient and fair allocation of bandwidth among different established flows. Finally, the proposed scheme developed, tested and validated through a set of experiments to demonstrate the relative merits and capabilities of a proposed scheme
ON DEMAND CHANNEL ASSIGNMENT METHOD FOR CHANNEL DIVERSITY (ODCAM)ijwmn
The IEEE 802.11s Wireless Mesh Networks (WMN) is a new multi-hop technology increasing the coverage
of IEEE 802.11 Wireless Network and providing Internet access. In order to increase the mesh network
capacity, the WMN has evolved from single-radio single-channel architecture to Multi-Channel Multi-
Radios (MC-MR) architecture. In MC-MR the main challenge of the WMN is the channel assignment. In
this article, we propose a new channel assignment method based on channel diversity. This new method
named ODCAM (On Demand channel Assignment Method for channel diversity ) defines a channel
diversity mechanism used to select a new channel along the path between the source and the destination.
The best path between the source and the destination is provided by the HWMP (Hybrid Wireless Mesh
Protocol) protocol using MWCETT (Modified Weighted Cumulative Expected Transmission Time) an
extension of the WCETT metric. The simulation results show the ODCAM performance compared with an
hybrid approach.
A DDRESSING T HE M ULTICHANNEL S ELECTION , S CHEDULING A ND C OORDINATION...pijans
We discuss a new multichannel coordination and sche
duling challenge called the Multichannel Scheduling
Cost (MSC). It is caused by the inability of the co
ntrol channel to schedule simultaneous transmission
s
resulting in data channels lying idle and their ban
dwidth underutilized. As a result, wasted bandwidth
increases as the number of data channels increases.
To address this challenge, a cyclic scheduling
Algorithm (CSA) is proposed. It employs one dedicat
ed signaling channel and 4 data channels. It is
premised on a proactive channel reservation scheme
which reduces the idleness of channels. The scheme
ensures that data channels are reserved while they
are still busy. The data channels are reserved whil
e
their remaining transmission duration is equal to t
he virtual carrier sensing duration. This gives the
next
pair sufficient time to reserve the current data ch
annel before it becomes available, limiting the MSC
to the
first cycle. The simulation results show a performa
nce benefit of the CSA scheme in addressing the eff
ects
of the MSC
Mobile environment pretense a number of novel
theoretical and optimization issues such as position, operation
and following in that a lot of requests rely on them for
desirable information. The precedent works are sprinkled
across the entire network layer: from the medium of physical
to link layer to routing and then application layer. In this
invention, we present outline solutions in Medium Access
Control (MAC), data distribution, coverage resolve issues
under mobile ad-hoc network environment based on
congestion control technique using Transmission Control
Protocol (TCP). In mobile ad-hoc network issues can arise
such as link disconnections, channel contention and recurrent
path loss. To resolve this issue, we propose a Cross Layer
based Hybrid fuzzy ad-hoc rate based Congestion Control
(CLHCC) approach to maximize network performance. Based
on the destination report it regulates the speed of data flow to
control data loss by monitoring the present network status
and transmits this report to the source as advice. The source
adjusts the sending flow rate as per the advice. This is
monitored by channel usage, ultimate delay, short term
throughput.
The three-way need for higher data rates, good quality of service and ubiquity in a converged all IP
communication cloud drives research in wireless communication. Wireless access networks are envisaged
candidates of the next generation wireless networks. The various access networks will be integrated with
other technologies including the wired backbone. The major issues in an all IP and converged networks
are: quality of service, seamless handover and network capacity. Emerging research seeks to address these
open research issues; for example the implementation of multi-channel and multi radio MAC protocols in
WMN. In this paper we analyze and evaluate the effectiveness of multi-channel and multi radio techniques
in WMN. The shortcomings of these schemes are highlighted and possible solutions are suggested. The
signalling delay metric is used for evaluation purposes. The focus is on the performance of the control
channel identified as the critical performance metric of multi-channel MAC protocols.
In Wireless Sensor Network (WSN), QoS (Quality of Service) in sensor application plays a very important
role. QoS based routing is required to ensure the best use of nodes in WSN. In this paper, a comparative
study of QoS based routing in Media Access Control (MAC) protocols are presented based on the traits to
solve problems like prioritization, timeliness, reliability etc. The study mainly focuses on some priority
based QoS protocols used in WSN and a comparison among them. The study reveals that among the five
mentioned protocols; QMAC, PRIMA, DB-MAC, RAP, GTS; PRIMA shows the best performance in the
category of Packet Prioritization, Scheduling Scheme, Queue Type, Energy Awareness and QoS.
Efficient and Fair Bandwidth Allocation AQM Scheme for Wireless NetworksCSCJournals
Heterogeneous Wireless Networks are considered nowadays as one of the potential areas in research and development. The traffic management’s schemes that have been used at the fusion points between the different wireless networks are classical and conventional. This paper is focused on developing a novel scheme to overcome the problem of traffic congestion in the fusion point router interconnected the heterogeneous wireless networks. The paper proposed an EF-AQM algorithm which provides an efficient and fair allocation of bandwidth among different established flows. Finally, the proposed scheme developed, tested and validated through a set of experiments to demonstrate the relative merits and capabilities of a proposed scheme
ON DEMAND CHANNEL ASSIGNMENT METHOD FOR CHANNEL DIVERSITY (ODCAM)ijwmn
The IEEE 802.11s Wireless Mesh Networks (WMN) is a new multi-hop technology increasing the coverage
of IEEE 802.11 Wireless Network and providing Internet access. In order to increase the mesh network
capacity, the WMN has evolved from single-radio single-channel architecture to Multi-Channel Multi-
Radios (MC-MR) architecture. In MC-MR the main challenge of the WMN is the channel assignment. In
this article, we propose a new channel assignment method based on channel diversity. This new method
named ODCAM (On Demand channel Assignment Method for channel diversity ) defines a channel
diversity mechanism used to select a new channel along the path between the source and the destination.
The best path between the source and the destination is provided by the HWMP (Hybrid Wireless Mesh
Protocol) protocol using MWCETT (Modified Weighted Cumulative Expected Transmission Time) an
extension of the WCETT metric. The simulation results show the ODCAM performance compared with an
hybrid approach.
A DDRESSING T HE M ULTICHANNEL S ELECTION , S CHEDULING A ND C OORDINATION...pijans
We discuss a new multichannel coordination and sche
duling challenge called the Multichannel Scheduling
Cost (MSC). It is caused by the inability of the co
ntrol channel to schedule simultaneous transmission
s
resulting in data channels lying idle and their ban
dwidth underutilized. As a result, wasted bandwidth
increases as the number of data channels increases.
To address this challenge, a cyclic scheduling
Algorithm (CSA) is proposed. It employs one dedicat
ed signaling channel and 4 data channels. It is
premised on a proactive channel reservation scheme
which reduces the idleness of channels. The scheme
ensures that data channels are reserved while they
are still busy. The data channels are reserved whil
e
their remaining transmission duration is equal to t
he virtual carrier sensing duration. This gives the
next
pair sufficient time to reserve the current data ch
annel before it becomes available, limiting the MSC
to the
first cycle. The simulation results show a performa
nce benefit of the CSA scheme in addressing the eff
ects
of the MSC
Mobile environment pretense a number of novel
theoretical and optimization issues such as position, operation
and following in that a lot of requests rely on them for
desirable information. The precedent works are sprinkled
across the entire network layer: from the medium of physical
to link layer to routing and then application layer. In this
invention, we present outline solutions in Medium Access
Control (MAC), data distribution, coverage resolve issues
under mobile ad-hoc network environment based on
congestion control technique using Transmission Control
Protocol (TCP). In mobile ad-hoc network issues can arise
such as link disconnections, channel contention and recurrent
path loss. To resolve this issue, we propose a Cross Layer
based Hybrid fuzzy ad-hoc rate based Congestion Control
(CLHCC) approach to maximize network performance. Based
on the destination report it regulates the speed of data flow to
control data loss by monitoring the present network status
and transmits this report to the source as advice. The source
adjusts the sending flow rate as per the advice. This is
monitored by channel usage, ultimate delay, short term
throughput.
Enhanced aodv route discovery and route establishment for qos provision for r...IJCNCJournal
MANET is a temporary connection of mobile nodes via wireless links having no centralized base station.
We developed a protocol with an enhanced route discovery mechanism that avoids the pre-transmission
delay. When a source node wants to communicate with another node, it broadcast RREQ. EAODV give
priority to the source node of real time transmission. When RREQ packet send to neighbor node, for real
time transmission it accept route request on priority basis and the drop ratio of packets decreased, then
throughput increases by receiving more packets at destination and delivery ratio also increased through
these QOS improved.
This compare and evaluate two routing protocols DSR and CBRP in ad hoc networks. DSR is based on flat topology and CBRP is of cluster based. Both are compared in different number of scenarios and their performances are compared in terms of pdf, channel utilization, nrl, average end to end delay and control overheads.
Daly Analysis for WiMax under balanced and unbalanced traffic conditions in f...inventionjournals
International Journal of Engineering and Science Invention (IJESI) is an international journal intended for professionals and researchers in all fields of computer science and electronics. IJESI publishes research articles and reviews within the whole field Engineering Science and Technology, new teaching methods, assessment, validation and the impact of new technologies and it will continue to provide information on the latest trends and developments in this ever-expanding subject. The publications of papers are selected through double peer reviewed to ensure originality, relevance, and readability. The articles published in our journal can be accessed online.
Performance Comparison of AODV and DSDV Routing Protocols for Ad-hoc Wireless...Narendra Singh Yadav
An ad hoc network is a collection of mobile nodes communicating through wireless channels without any existing network infrastructure or centralized administration. Because of the limited transmission range of wireless network interfaces, multiple “hops” may be needed to exchange data across the network. Consequently, many routing algorithms have come into existence to satisfy the needs of communications in such networks. This paper presents performance comparison of the three routing protocols AODV and DSDV. Protocols were simulated using the ns-2 and were compared in terms of packet delivery fraction, normalized routing load and average delay, while varying number of nodes, and pause time. Simulation revealed that although DSDV perfectly scales to small networks with low node speeds, AODV is preferred due to its more efficient use of bandwidth.
Minimize energy per packet (or per bit)
Maximize network lifetime
Routing considering available battery energy
Maximum Total Available Battery Capacity
Minimum Battery Cost Routing (MBCR)
Min– Max Battery Cost Routing (MMBCR)
Conditional Max – Min Battery Capacity Routing (CMMBCR)
Minimize variance in power levels
Minimum Total Transmission Power Routing (MTPR)
BETTER SCALABLE ROUTING PROTOCOL FOR HYBRID WIRELESS MESH NETWORKcscpconf
There are many routing approaches have been borrowed from mobile ad hoc network to achieve routing solutions in wireless mesh network. WMN was developed for reliable data communication and load balancing. AODV provides loop-free routes even while repairing broken links. This paper have been proposed an improved hierarchical AODV routing protocol
(IH-AODV), which exhibits better scalability and performance in the network. This IH-AODV protocol has been proposed for improvement in the scaling potential of AODV. MAODV allows
each node in the network to send out multicast data packets, used for multicast traffic. The wireless mesh network architecture provides reduction in installation cost, large scale
deployment, reliability and self management. It is mainly focused on implementing military or specialized civilian applications. Two protocols MAODV and IH-AODV were simulated using NS2 package. Simulation results will demonstrate that, IH-AODV scales well for large network
and other metrics are also better than or comparable to MAODV in hybrid WMNs.
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.
LTE QOS DYNAMIC RESOURCE BLOCK ALLOCATION WITH POWER SOURCE LIMITATION AND QU...IJCNCJournal
3GPP has defined the long term evolution (LTE) for 3G radio access in order to maintain the future
competitiveness for 3G technology, the system provides the capability of supporting a mixture of services
with different quality of service (QoS) requirements. This paper proposes a new cross-layer scheduling
algorithm to satisfy better QoS parameters for real time applications. The proposed algorithm takes care of
allocating resource blocks (RBs) with different modulation and coding schemes (MCS) according to target
bit error rate (BER), user equipment supportable MCS, queue stability constraints and available transmit
power constraints. The proposed algorithm has been valued, compared with an earlier allocation algorithm
in terms of service rate and packet delay and showed better performance regards the real time
applications.
Enhanced aodv route discovery and route establishment for qos provision for r...IJCNCJournal
MANET is a temporary connection of mobile nodes via wireless links having no centralized base station.
We developed a protocol with an enhanced route discovery mechanism that avoids the pre-transmission
delay. When a source node wants to communicate with another node, it broadcast RREQ. EAODV give
priority to the source node of real time transmission. When RREQ packet send to neighbor node, for real
time transmission it accept route request on priority basis and the drop ratio of packets decreased, then
throughput increases by receiving more packets at destination and delivery ratio also increased through
these QOS improved.
This compare and evaluate two routing protocols DSR and CBRP in ad hoc networks. DSR is based on flat topology and CBRP is of cluster based. Both are compared in different number of scenarios and their performances are compared in terms of pdf, channel utilization, nrl, average end to end delay and control overheads.
Daly Analysis for WiMax under balanced and unbalanced traffic conditions in f...inventionjournals
International Journal of Engineering and Science Invention (IJESI) is an international journal intended for professionals and researchers in all fields of computer science and electronics. IJESI publishes research articles and reviews within the whole field Engineering Science and Technology, new teaching methods, assessment, validation and the impact of new technologies and it will continue to provide information on the latest trends and developments in this ever-expanding subject. The publications of papers are selected through double peer reviewed to ensure originality, relevance, and readability. The articles published in our journal can be accessed online.
Performance Comparison of AODV and DSDV Routing Protocols for Ad-hoc Wireless...Narendra Singh Yadav
An ad hoc network is a collection of mobile nodes communicating through wireless channels without any existing network infrastructure or centralized administration. Because of the limited transmission range of wireless network interfaces, multiple “hops” may be needed to exchange data across the network. Consequently, many routing algorithms have come into existence to satisfy the needs of communications in such networks. This paper presents performance comparison of the three routing protocols AODV and DSDV. Protocols were simulated using the ns-2 and were compared in terms of packet delivery fraction, normalized routing load and average delay, while varying number of nodes, and pause time. Simulation revealed that although DSDV perfectly scales to small networks with low node speeds, AODV is preferred due to its more efficient use of bandwidth.
Minimize energy per packet (or per bit)
Maximize network lifetime
Routing considering available battery energy
Maximum Total Available Battery Capacity
Minimum Battery Cost Routing (MBCR)
Min– Max Battery Cost Routing (MMBCR)
Conditional Max – Min Battery Capacity Routing (CMMBCR)
Minimize variance in power levels
Minimum Total Transmission Power Routing (MTPR)
BETTER SCALABLE ROUTING PROTOCOL FOR HYBRID WIRELESS MESH NETWORKcscpconf
There are many routing approaches have been borrowed from mobile ad hoc network to achieve routing solutions in wireless mesh network. WMN was developed for reliable data communication and load balancing. AODV provides loop-free routes even while repairing broken links. This paper have been proposed an improved hierarchical AODV routing protocol
(IH-AODV), which exhibits better scalability and performance in the network. This IH-AODV protocol has been proposed for improvement in the scaling potential of AODV. MAODV allows
each node in the network to send out multicast data packets, used for multicast traffic. The wireless mesh network architecture provides reduction in installation cost, large scale
deployment, reliability and self management. It is mainly focused on implementing military or specialized civilian applications. Two protocols MAODV and IH-AODV were simulated using NS2 package. Simulation results will demonstrate that, IH-AODV scales well for large network
and other metrics are also better than or comparable to MAODV in hybrid WMNs.
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.
LTE QOS DYNAMIC RESOURCE BLOCK ALLOCATION WITH POWER SOURCE LIMITATION AND QU...IJCNCJournal
3GPP has defined the long term evolution (LTE) for 3G radio access in order to maintain the future
competitiveness for 3G technology, the system provides the capability of supporting a mixture of services
with different quality of service (QoS) requirements. This paper proposes a new cross-layer scheduling
algorithm to satisfy better QoS parameters for real time applications. The proposed algorithm takes care of
allocating resource blocks (RBs) with different modulation and coding schemes (MCS) according to target
bit error rate (BER), user equipment supportable MCS, queue stability constraints and available transmit
power constraints. The proposed algorithm has been valued, compared with an earlier allocation algorithm
in terms of service rate and packet delay and showed better performance regards the real time
applications.
In this paper, the terms chained ternary semigroup, cancellable clement , cancellative ternary
semigroup, A-regular element, π- regular element, π- invertible element, noetherian ternary semigroup are
introduced. It is proved that in a commutative chained ternary semigroup T, i) if P is a prime ideal of T and
x ∉ P then n
n 1
x PT
= P for all odd natural numbers n . ii) T is a semiprimary ternary semigroup. iii) If a ε T is
a semisimple element of T, then < a > w ≠ . iv) If < a >w = 𝜙 for all a ε T, then T has no semisimple
elements. v) T has no regular elements, then for any a ε T, < a >w = 𝜙 or < a >w is a prime ideal. vi) If T is a
commutative chained cancellative ternary semigroup then for every non π-invertible element a, < a >w is either
empty or a prime ideal of T. Further it is proved that if T is a chained ternary semigroup with T\T3= { x } for
some x ε T, then i) T\ { x } is an ideal of T. ii) T = xT1T1 = T1xT1 = T1T1x and T 3 = xTT = TxT = TTx is the
unique maximal ideal of T. iii) If a T and a < x >w then a = xn for some odd natural number n > 1.
iv) T\ < x >w = { x, x 3, x5, . . . . .} or T\< x >w ={x, x 3, . . . , xr} for some odd natural number r. v) If a T
and a < x >w then a = xr for some odd natural number r or a = xn sn tn and sn < x >w or tn < x >w
for every odd natural number n. vi) If T contains cancellable elements then x is cancellable element and < x >w
is either empty or a prime ideal of T. It is also prove that, in a commutative chained ternary semigroup T,
T is archemedian ternary semigroup without idempotent elements if and only if < a >w = for every a T.
Further it is proved that if T is a commutative chained ternary semigroup containing cancellable elements and
< a >w = for every a T , then T is a cancellative ternary semigroup. It is proved that if T is a noetherian
ternary semigroup containing proper ideals then T has a maximal ideal. Finally it is proved that if T is a
commutative ternary semigroup such that T = < x > for some x T, then the following are equivalent.
1) T = {x, x2, x3, ............} is infinite. 2) T is a noetherian cancellative ternary semigroup with x xTT.
3) T is a noetherian cancellative ternary semigroup without idempotents. 4) < a >w = for all a T.
5) < x >w = . and if T is a commutative chained ternary semigroup with T ≠ T 3 , then the following are
equivalent. (1) T={x, x 3, x5, . . . . . . .}, where x T\ T 3 (2) T is Noetherian cancellative ternary semigroup
without idempotents. (3) < a >w = for all a T. Finally, it is proved that If T is a commutative chained
noetherian cancellative ternary semigroup without regular elements, then < a >w = for all a T.
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.
Elastic hybrid MAC protocol for wireless sensor networks IJECEIAES
The future is moving towards offering multiples services based on the same technology. Then, billions of sensors will be needed to satisfy the diversity of these services. Such considerable amount of connected devices must insure efficient data transmission for diverse applications. Wireless sensor network (WSN) represents the most preferred technology for the majority of applications. Researches in medium access control (MAC) mechanism have been of significant impact to the application growth because the MAC layer plays a major role in resource allocation in WSNs. We propose to enhance a MAC protocol of WSN to overcome traffic changes constraints. To achieve focused goal, we use elastic hybrid MAC scheme. The main interest of the developed MAC protocol is to design a medium access scheme that respect different quality of services (QoS) parameters needed by various established traffic. Simulation results show good improvement in measured parameters compared to typical protocol.
Evaluation of Energy Consumption using Receiver–Centric MAC Protocol in Wirel...IJECEIAES
At present day’s wireless sensor networks, obtain a lot consideration to researchers. Maximum number of sensor nodes are scattered that can communicate with all others. Reliable data communication and energy consumption are the mainly significant parameters that are required in wireless sensor networks. Many of MAC protocols have been planned to improve the efficiency more by enhancing the throughput and energy consumption. The majority of the presented medium access control protocols to only make available, reliable data delivery or energy efficiency does not offer together at the same time. In this research work the author proposes a novel approach based on Receiver Centric-MAC is implemented using NS2 simulator. Here, the author focuses on the following parametric measures like - energy consumption, reliability and bandwidth. RC-MAC provides high bandwidth without decreasing energy efficiency. The results show that 0.12% of less energy consumption, reliability improved by 20.86% and bandwidth increased by 27.32% of RC-MAC compared with MAC IEEE 802.11.
Comparison of Csma Based MAC Protocols of Wireless Sensor Networkspijans
Energy conservation has been an important area of interest in Wireless Sensor networks (WSNs). Medium
Access Control (MAC) protocols play an important role in energy conservation. In this paper, we describe
CSMA based MAC protocols for WSN and analyze the simulation results of these protocols. We
implemented S-MAC, T-MAC, B-MAC, B-MAC+, X-MAC, DMAC and Wise-MAC in TOSSIM, a simulator
which unlike other simulators simulates the same code running on real hardware. Previous surveys mainly
focused on the classification of MAC protocols according to the techniques being used or problem dealt
with and presented a theoretical evaluation of protocols. This paper presents the comparative study of
CSMA based protocols for WSNs, showing which MAC protocol is suitable in a particular environment and
supports the arguments with the simulation results. The comparative study can be used to find the best
suited MAC protocol for wireless sensor networks in different environments.
Ijaems apr-2016-22TDMA- MAC Protocol based Energy- Potency for Periodic Sensi...INFOGAIN PUBLICATION
Energy potency could be a major demand in wireless sensing element networks. Media Access management is one in every of the key areas wherever energy potency is achieved by planning such MAC protocol that's tuned to the necessities of the sensing element networks. Applications have different necessities and one MAC protocol can't be best TDMA-based MAC (TDMAC) protocol that is specially designed for such applications that need periodic sensing of the sensing element field. TDMAC organizes nodes into clusters. Nodes send their knowledge to their cluster head (CH) and CHs forward it to the bottom station. CHs removed from the bottom station use multi-hop communication by forwarding their knowledge to CHs nearer than themselves to the bottom station each put down-cluster and intra-cluster communication is only TDMA-based that effectively eliminates each inter cluster further as intra-cluster interference.
An Implementation and Analysis of RTS/CTS Mechanism for Data Transfer in Wire...iosrjce
In this paper, the implementation and analysis of RTS/CTS mechanism for data transfer in wireless
network is being studied. The Request-To-Send (RTS) and Clear-To-Send (CTS) mechanism is widely used in
wireless networks to avoid collisions due to hidden nodes by reserving the channel for transmitting data from
source to destination. The collisions caused by the hidden nodes reduce the network throughput and efficiency.
In RTS/CTS mechanism, RTS/CTS packets set the timer for the neighboring nodes so that these nodes defer their
transmission for the entire data packet transmission period. But there may be the case when the intended
transmission completes before the expiration of this timer, so a kind of delay has been developed. To reduce this
delay, the proposed methodology in this paper provides RTR (Ready-To-Receive) packets along with RTS/CTS
packets. The receiving node sends RTR packets to notify all the neighboring nodes that the intended
communication has finished. The results show that this method improves the data transfer rate resulting in
higher throughput and network efficiency and the system will be more efficient. This will reflect in the overall
information transfer time.
Priority based bandwidth allocation in wireless sensor networksIJCNCJournal
Most of the sensor network applications need real time communication and the need for deadline aware real time communication is becoming eminent in these applications. These applications have different dead line requirements also. The real time applications of wireless sensor networks are bandwidth sensitive and need higher share of bandwidth for higher priority data to meet the dead line requirements. In this paper we focus on the MAC layer modifications to meet the real time requirements of different priority data.Bandwidth partitioning among different priority transmissions is implemented through MAC layer modifications. The MAC layer implements a queuing model that supports lower transfer rate for lower
priority packets and higher transfer rate for real
time packets with higher priority, minimizing the end to
end delay. The performance of the algorithm is evaluated with varying node distribution
.
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.
Addressing the Multichannel Selection, Scheduling and Coordination Costpijans
We discuss a new multichannel coordination and scheduling challenge called the Multichannel Scheduling Cost (MSC). It is caused by the inability of the control channel to schedule simultaneous transmissions resulting in data channels lying idle and their bandwidth underutilized. As a result, wasted bandwidth increases as the number of data channels increases. To address this challenge, a cyclic scheduling Algorithm (CSA) is proposed. It employs one dedicated signaling channel and 4 data channels. It is premised on a proactive channel reservation scheme which reduces the idleness of channels. The scheme ensures that data channels are reserved while they are still busy. The data channels are reserved while their remaining transmission duration is equal to the virtual carrier sensing duration. This gives the next pair sufficient time to reserve the current data channel before it becomes available, limiting the MSC to the first cycle. The simulation results show a performance benefit of the CSA scheme in addressing the effects of the MSC
Channel Aware Mac Protocol for Maximizing Throughput and FairnessIJORCS
The proper channel utilization and the queue length aware routing protocol is a challenging task in MANET. To overcome this drawback we are extending the previous work by improving the MAC protocol to maximize the Throughput and Fairness. In this work we are estimating the channel condition and Contention for a channel aware packet scheduling and the queue length is also calculated for the routing protocol which is aware of the queue length. The channel is scheduled based on the channel condition and the routing is carried out by considering the queue length. This queue length will provide a measurement of traffic load at the mobile node itself. Depending upon this load the node with the lesser load will be selected for the routing; this will effectively balance the load and improve the throughput of the ad hoc network.
Survey on energy efficiency in wireless sensor network using mac protocol wit...Editor Jacotech
Dynamic feature evaluation and concept evaluation is major challenging task in the field of data classification. The continuity of data induced a new feature during classification process, but the classification process is predefined task for assigning data into class. Data comes into multiple feature sub-set format into infinite length. The infinite length not decided the how many class are assigned. Support vector machine is well recognized method for data classification. For the process of support vector machine evaluation of new feature during classification is major problem. The problem of feature evaluation decreases the performance of Support Vector Machine (SVM). For the improvement of support vector machine, particle of swarm optimization technique is used. Particle of swarm optimization controls the dynamic feature evaluation process and decreases the possibility of confusion in selection of class and increase the classification ratio of support vector machine. Particle of swarm optimization work in two phases one used as dynamic population selection and another are used for optimization process of evolved new feature.
Channel feedback scheduling for wireless communicationseSAT Journals
Abstract Opportunistic scheduling can significantly improve wireless network performance by exploiting the underlying channel condition. There has been a lot of work on opportunistic scheduling, but the problem of finding the right feedback mechanism to convey channel information has largely been untouched. In emerging multichannel systems, the per-channel feedback induces a substantial amount of feedback overhead and requires high computational complexity. To reduce the feedback overhead, we consider an opportunistic feedback strategy that activates the channel feedback opportunistically according to the channel condition. Then, we combine the opportunistic feedback with the best-n channel feedback scheme where a mobile user chooses the best n channels and transfers this information to the base station. We analyze the throughput and the amount of channel feedback information for proportionally fair opportunistic scheduling under Rayleigh fading i.i.d. channels. The numerical results confirm that our partial feedback schemes achieve a remarkable reduction in the amount of feedback information without significant throughput degradation, thereby saving the scarce wireless bandwidth and limited battery power.
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology.
Similar to Simulation based Evaluation of a Simple Channel Distribution Scheme for MANETs (20)
Industrial Training at Shahjalal Fertilizer Company Limited (SFCL)MdTanvirMahtab2
This presentation is about the working procedure of Shahjalal Fertilizer Company Limited (SFCL). A Govt. owned Company of Bangladesh Chemical Industries Corporation under Ministry of Industries.
Welcome to WIPAC Monthly the magazine brought to you by the LinkedIn Group Water Industry Process Automation & Control.
In this month's edition, along with this month's industry news to celebrate the 13 years since the group was created we have articles including
A case study of the used of Advanced Process Control at the Wastewater Treatment works at Lleida in Spain
A look back on an article on smart wastewater networks in order to see how the industry has measured up in the interim around the adoption of Digital Transformation in the Water Industry.
CFD Simulation of By-pass Flow in a HRSG module by R&R Consult.pptxR&R Consult
CFD analysis is incredibly effective at solving mysteries and improving the performance of complex systems!
Here's a great example: At a large natural gas-fired power plant, where they use waste heat to generate steam and energy, they were puzzled that their boiler wasn't producing as much steam as expected.
R&R and Tetra Engineering Group Inc. were asked to solve the issue with reduced steam production.
An inspection had shown that a significant amount of hot flue gas was bypassing the boiler tubes, where the heat was supposed to be transferred.
R&R Consult conducted a CFD analysis, which revealed that 6.3% of the flue gas was bypassing the boiler tubes without transferring heat. The analysis also showed that the flue gas was instead being directed along the sides of the boiler and between the modules that were supposed to capture the heat. This was the cause of the reduced performance.
Based on our results, Tetra Engineering installed covering plates to reduce the bypass flow. This improved the boiler's performance and increased electricity production.
It is always satisfying when we can help solve complex challenges like this. Do your systems also need a check-up or optimization? Give us a call!
Work done in cooperation with James Malloy and David Moelling from Tetra Engineering.
More examples of our work https://www.r-r-consult.dk/en/cases-en/
Explore the innovative world of trenchless pipe repair with our comprehensive guide, "The Benefits and Techniques of Trenchless Pipe Repair." This document delves into the modern methods of repairing underground pipes without the need for extensive excavation, highlighting the numerous advantages and the latest techniques used in the industry.
Learn about the cost savings, reduced environmental impact, and minimal disruption associated with trenchless technology. Discover detailed explanations of popular techniques such as pipe bursting, cured-in-place pipe (CIPP) lining, and directional drilling. Understand how these methods can be applied to various types of infrastructure, from residential plumbing to large-scale municipal systems.
Ideal for homeowners, contractors, engineers, and anyone interested in modern plumbing solutions, this guide provides valuable insights into why trenchless pipe repair is becoming the preferred choice for pipe rehabilitation. Stay informed about the latest advancements and best practices in the field.
About
Indigenized remote control interface card suitable for MAFI system CCR equipment. Compatible for IDM8000 CCR. Backplane mounted serial and TCP/Ethernet communication module for CCR remote access. IDM 8000 CCR remote control on serial and TCP protocol.
• Remote control: Parallel or serial interface.
• Compatible with MAFI CCR system.
• Compatible with IDM8000 CCR.
• Compatible with Backplane mount serial communication.
• Compatible with commercial and Defence aviation CCR system.
• Remote control system for accessing CCR and allied system over serial or TCP.
• Indigenized local Support/presence in India.
• Easy in configuration using DIP switches.
Technical Specifications
Indigenized remote control interface card suitable for MAFI system CCR equipment. Compatible for IDM8000 CCR. Backplane mounted serial and TCP/Ethernet communication module for CCR remote access. IDM 8000 CCR remote control on serial and TCP protocol.
Key Features
Indigenized remote control interface card suitable for MAFI system CCR equipment. Compatible for IDM8000 CCR. Backplane mounted serial and TCP/Ethernet communication module for CCR remote access. IDM 8000 CCR remote control on serial and TCP protocol.
• Remote control: Parallel or serial interface
• Compatible with MAFI CCR system
• Copatiable with IDM8000 CCR
• Compatible with Backplane mount serial communication.
• Compatible with commercial and Defence aviation CCR system.
• Remote control system for accessing CCR and allied system over serial or TCP.
• Indigenized local Support/presence in India.
Application
• Remote control: Parallel or serial interface.
• Compatible with MAFI CCR system.
• Compatible with IDM8000 CCR.
• Compatible with Backplane mount serial communication.
• Compatible with commercial and Defence aviation CCR system.
• Remote control system for accessing CCR and allied system over serial or TCP.
• Indigenized local Support/presence in India.
• Easy in configuration using DIP switches.
Sachpazis:Terzaghi Bearing Capacity Estimation in simple terms with Calculati...Dr.Costas Sachpazis
Terzaghi's soil bearing capacity theory, developed by Karl Terzaghi, is a fundamental principle in geotechnical engineering used to determine the bearing capacity of shallow foundations. This theory provides a method to calculate the ultimate bearing capacity of soil, which is the maximum load per unit area that the soil can support without undergoing shear failure. The Calculation HTML Code included.
Cosmetic shop management system project report.pdfKamal Acharya
Buying new cosmetic products is difficult. It can even be scary for those who have sensitive skin and are prone to skin trouble. The information needed to alleviate this problem is on the back of each product, but it's thought to interpret those ingredient lists unless you have a background in chemistry.
Instead of buying and hoping for the best, we can use data science to help us predict which products may be good fits for us. It includes various function programs to do the above mentioned tasks.
Data file handling has been effectively used in the program.
The automated cosmetic shop management system should deal with the automation of general workflow and administration process of the shop. The main processes of the system focus on customer's request where the system is able to search the most appropriate products and deliver it to the customers. It should help the employees to quickly identify the list of cosmetic product that have reached the minimum quantity and also keep a track of expired date for each cosmetic product. It should help the employees to find the rack number in which the product is placed.It is also Faster and more efficient way.
Automobile Management System Project Report.pdfKamal Acharya
The proposed project is developed to manage the automobile in the automobile dealer company. The main module in this project is login, automobile management, customer management, sales, complaints and reports. The first module is the login. The automobile showroom owner should login to the project for usage. The username and password are verified and if it is correct, next form opens. If the username and password are not correct, it shows the error message.
When a customer search for a automobile, if the automobile is available, they will be taken to a page that shows the details of the automobile including automobile name, automobile ID, quantity, price etc. “Automobile Management System” is useful for maintaining automobiles, customers effectively and hence helps for establishing good relation between customer and automobile organization. It contains various customized modules for effectively maintaining automobiles and stock information accurately and safely.
When the automobile is sold to the customer, stock will be reduced automatically. When a new purchase is made, stock will be increased automatically. While selecting automobiles for sale, the proposed software will automatically check for total number of available stock of that particular item, if the total stock of that particular item is less than 5, software will notify the user to purchase the particular item.
Also when the user tries to sale items which are not in stock, the system will prompt the user that the stock is not enough. Customers of this system can search for a automobile; can purchase a automobile easily by selecting fast. On the other hand the stock of automobiles can be maintained perfectly by the automobile shop manager overcoming the drawbacks of existing system.
Forklift Classes Overview by Intella PartsIntella Parts
Discover the different forklift classes and their specific applications. Learn how to choose the right forklift for your needs to ensure safety, efficiency, and compliance in your operations.
For more technical information, visit our website https://intellaparts.com
Overview of the fundamental roles in Hydropower generation and the components involved in wider Electrical Engineering.
This paper presents the design and construction of hydroelectric dams from the hydrologist’s survey of the valley before construction, all aspects and involved disciplines, fluid dynamics, structural engineering, generation and mains frequency regulation to the very transmission of power through the network in the United Kingdom.
Author: Robbie Edward Sayers
Collaborators and co editors: Charlie Sims and Connor Healey.
(C) 2024 Robbie E. Sayers
Final project report on grocery store management system..pdfKamal Acharya
In today’s fast-changing business environment, it’s extremely important to be able to respond to client needs in the most effective and timely manner. If your customers wish to see your business online and have instant access to your products or services.
Online Grocery Store is an e-commerce website, which retails various grocery products. This project allows viewing various products available enables registered users to purchase desired products instantly using Paytm, UPI payment processor (Instant Pay) and also can place order by using Cash on Delivery (Pay Later) option. This project provides an easy access to Administrators and Managers to view orders placed using Pay Later and Instant Pay options.
In order to develop an e-commerce website, a number of Technologies must be studied and understood. These include multi-tiered architecture, server and client-side scripting techniques, implementation technologies, programming language (such as PHP, HTML, CSS, JavaScript) and MySQL relational databases. This is a project with the objective to develop a basic website where a consumer is provided with a shopping cart website and also to know about the technologies used to develop such a website.
This document will discuss each of the underlying technologies to create and implement an e- commerce website.
Student information management system project report ii.pdfKamal Acharya
Our project explains about the student management. This project mainly explains the various actions related to student details. This project shows some ease in adding, editing and deleting the student details. It also provides a less time consuming process for viewing, adding, editing and deleting the marks of the students.
Student information management system project report ii.pdf
Simulation based Evaluation of a Simple Channel Distribution Scheme for MANETs
1. IOSR Journal of Computer Engineering (IOSR-JCE)
e-ISSN: 2278-0661, p- ISSN: 2278-8727Volume 12, Issue 2 (May. - Jun. 2013), PP 55-62
www.iosrjournals.org
www.iosrjournals.org 55 | Page
Simulation based Evaluation of a Simple Channel Distribution
Scheme for MANETs
Muhammad Asif1
, Ghani-ur-rehman2 ,
Israrullah3
1
(Computer Science, International Islamic University, Islamabad, Pakistan)
2
(Computer Science, Khushal Khan Khattak University Karak, Pakistan)
3
(Computer Science, National University of Computer& Emerging Sciences, Pakistan)
Abstract: Mobile Ad-hoc Networks (MANETs) are special kind of wireless networks with no centralized
control. They are ideal candidate for several real world applications where network need to be established on
the fly e.g. disaster hit areas, hospitals, military surveillance etc. Researchers have been actively working in this
area for a decade or so to make this concept a reality. MANETs differ from conventional fixed networks and
therefore pose several challenges to the researchers working in the area. Among many others, access to shared
medium is the major problem in MANETs. In such networks MAC layer protocol plays an important role in
efficient utilization of shared media in distributed fashion. At the MAC layer we have three contradicting
requirements, Maximize channel utilization, Minimize Control overhead and Fairness. Multi-Channel MAC
protocols are considered is the most suitable solution to achieve the desired objectives but channel assignment
and reservation in a distributed fashion is still a big challenge. In this paper, we have proposed a Multi-
Channel scheme to address the problem of channel assignment the proposed scheme is Nodeid based. The
proposed Scheme has been compared with conventional single channel scheme using ns-2 simulation and
results shows that the proposed technique gives better performance.
Keywords- BEB algorithm, Clear to send, Control channels, Dedicated Channels, MAC, Overhead, and request
to send.
I. Introduction
The ad hoc networks are consists of mobile nodes that exchange packets by sharing a common
broadcast radio channel [1], [2]. The bandwidth available for communication to be shared among the nodes is
limited, therefore, it is desirable that access to this shared medium should be controlled in a way that can utilize
the bandwidth efficiently, and guarantee fairness to all nodes. Thus design of a media access control (MAC)
protocol is challenging problem for ad hoc network [2], [3]. In the MANETs nodes have limited resources in
term of power, energy and processing power. In such networks MAC layer protocol plays an important role in
efficient utilization of shared media in distributed fashion. At the MAC layer we have three contradicting
requirements.
o Maximize channel utilization.
o Minimize Control overhead
o Ensure Fairness
Access to this shared medium should be controlled in such a way that all nodes should receive a fair
share of the available bandwidth with minimum control overhead and optimal (overall) bandwidth utilization.
After studying various MAC Multi channel protocols [4], [5], [6], [7], we come to the conclusion that the time
synchronization among nodes for channel reservation creates control overhead. Some of these protocols suggest
the usage of a dedicated channel known as control channel. The idea of control channel helps in segregating
control and data packets but at the same time, it is also considered as wastage of bandwidth in a lightly
congested scenario. Similarly, fairness and energy expenditure results are also dependent upon efficiently usage
of control channel. In this paper, we present an idea of simple multi-channel MAC protocol where nodes are
assigned a fixed channel for transmission based on their IDs which helps in avoiding the control overhead. As a
result of this scheme, we have the possibility of having neighboring nodes assigned same channel for
transmission but as the nodes are randomly distributed therefore the probability of having such active
neighboring nodes is very low and have negligible impact on performance and the same is confirmed from
results.
The rest of the paper is organized as follows: the related work is presented in Section II. Proposed
scheme is presented in Section III. Empirical evolution is discussed in section IV. Performance evaluation
results are discussed in Section V. We conclude the paper in Section VI.
2. Simulation based Evaluation of a Simple Channel Distribution Scheme for MANETs
www.iosrjournals.org 56 | Page
II. Related Works
We have studied the various types of Single and Multi channel MAC protocols. A brief review of some
protocols that are closely related to our work is presented here. In the CSMA [2], when a sender want to send
some data, it first sense the channel for the carrier data, if the carrier is present then it will try after some random
period of time. If no carrier is present then it transmits data. CSMA sense the state of channel only at the
transmitter. So CSMA does not overcome the hidden terminal problem. But in the ad hoc wireless networks, the
sender and receiver may not be near each other all times. In such situations the packets transmitted by node are
prone to collision at the receiver due to simultaneous transmissions by hidden terminals. Because both the
senders are not in direct range so they both transmit at the same time and the collision will occur at the receiver
side. The bandwidth utilization in CSMA protocol is less because of the exposed terminal problem. The Media
Access Control Avoidance MACA [2] protocol was proposed to overcome the shortcoming of CSMA. The
MACA used two control signal RTS and CTS for synchronization. If the packets transmitted by node are lost,
the node used the binary exponential back off (BEB) algorithm to back off random interval of time before
retrying. Using BEB the time starvation problem will occur; Reliability of Data is less in MACA. Overhead of
control packets is more. The MACAW [3] uses more control packets for the synchronization such as RTS, CTS,
ACK, DS and RRTS. The MACAW solve the MACA problem but in MACAW control overhead is more which
is major challenge for mobile ad hoc networks. The FAMA [2], [11] which consist of both carrier sensing and
collision avoidance dialog between the sender and intended receiver of packet. The control of channel is given
one node at time and this node is guaranteed to transmit one or more packet to different destination without
suffering from packet collisions. Carrier sensing by the sender will be done through the exchange of control
packet RTS and CTS. The nodes which want transmit packet first require the channel before starting
transmission. The Synchronization between sender and receiver require more control overheads. According to
the BTMA [8], the channel is divided into the two parts one is called Data channel and the other is called
Control channel. The Data channel is used for the data packet transmission while the control channel is used to
transmit the busy tone signal. When a node want to transmit some Data packet it first sense the channel to check
whether the busy tone is active if active then it reschedules the packet for transmission after some random
rescheduling delay. If it is found not active then turn on the busy tone signal and start data transmission.
According to BTMA no other node in the two hope neighborhood of the transmitting node is permitted to
simultaneously transmit. So collision ratio is low in BTMA its bandwidth utilization is poor, transmission is
blocked when one node occupies the cannel and other will wait when the channel will release, Control packets
overhead is also more. DBTMA [8] is an extension of the BTMA scheme. In the DBTMA the transmission
channel is also divided into two one is called control channel and the other is called the Data channel. Just like
the BTMA the Data channel is used for data packets and the control channel is used for the control packets
transmission (RTS-CTS) and also for transmitting busy tones. DBTMA will use the two busy tones on the
control channel i.e. BTt and BTr. The BTt tone indicates that now the node is transmitting on the Data channel
and the BTr indicates that it is now receiving Data on the Data channel. Bandwidth utilization is poor, control
packets overhead is also more. The D-PRMA (Disturbed packet multiple access protocol) [10] is used for voice
traffic support in ad hoc network it is the distributed scheme that can be used in ad hoc network. Basically
DPRMA is a TDMA based protocol. The time division of channel is done into frame. The frame is further
divided into slots and the slot is further divided into minislots and the minislots is further into two control fields,
RTS/BI and CTS/BI as shown in figure 1 [10]. The BI show the busy indication when a ready node want a
reserve a slot for transmission then these control fields are used for reservation and for overcoming hidden
terminal problem. Starvation problem is also possible; when a slot is reserved for transmission other waits for
release the slot. The SRMA/PA [11] was developed with the main objective of supporting both real time and
non real time application in ad hoc wireless networks.
Figure 1: D-PRMA Frame division [10].
3. Simulation based Evaluation of a Simple Channel Distribution Scheme for MANETs
www.iosrjournals.org 57 | Page
It is best suited for real time application because it uses priority assignment for traffic. Starvation
problem also occur because the priority will be given to high priority traffic. Channel grap problem is possible.
The FPRP [9] is a single channel time division multiple access (TDMA) based broadcast scheduling protocol.
When a node requires a time slot, it uses the same contention mechanism as in SRMA/PA. FPRP is fully
distributed and multiple reservations can be done at the same time. Time is divided into frames. Frames are two
types reservation frame (RF) and information frame (IF). The RF frame is followed by a sequence of
information frame (IF). When a node wants a reserve the channel then It will use the five phase dialogue for
reservation. The main issues in FPRP are control overhead. The control overhead causes the poor bandwidth
utilization. A Multichannel Reservation Multiple Access protocol for Mobile Ad Hoc Network (MRMA) was
proposed by Kia Liu and Xiaoqin Xing [13]. The proposed protocol share the channel in efficient way it
employs the RTS and CTS control packets on a common channel and select the free conflict channel for the
Data transmission. After successful transmission it will used another control packet Ack replied to the sender on
another common channel. The reservations overhead are more. Reservation Clash Handling to Optimize
Bandwidth Utilization in MANETs is challenging task in Ad hoc networks.
The Extended R-CSMA protocol proposed by Ghalem Boudour and Zoubir Mammeri [14].Reservation process
are complex it will used a lot of control overhead for channel reservation. Bandwidth Reservation for
Heterogeneous Traffics in Mobile Ad hoc Networks (BRPHT) proposed by Ghalem Boudour and Zoubir
Mammeri [15].
The proposed protocol multiplexes the several transmitting node on the same slot but each node
allocated the required bandwidth so it provide more bandwidth to node.
BRPHT is based on the super frame structure. Collision chances are more due to transmitting several nodes on
the same slot. Multi-Channel Medium Access Control with Hopping Reservation for Multi-hope Wireless
Networks (MMAC-HR) proposed by Khaled Hatem Almotairi and Xuemin [16].
MMAC-HR optimizes the network performance. For the exposed terminal problem it will used the CSMA/CA
over all channels. Using CSMA/CA on all channel will causes the energy expenditure and also the reservation
overhead are more.
III. Proposed Scheme
In the proposed scheme for multichannel MAC protocol, the channel assignment is simple as compared
to the previous multichannel MAC protocol channel assignment through reservation. In our proposed solution,
we have divided the given channels channel into N-sub channels and each sub channel is assigned an ID as
shown in figure 2 (channel ID starts from 0).
Figure 2: Division of Channel into N-sub channels
Each node in the network selects a particular channel for its transmission and can receive data at all
channels. Channel selection is done using the following formula.
NodeTX = (Nodeid) mod N
Where NodeTX is the channel used for transmission by Nodeid and N is the total number of sub
channels. According to the proposed scheme the channel will be assigned to the node according to the above
formula. To select a transmission channel for a node, we divide by the No. of channels and remainder gives us
the channel id for this particular node. For example, if the node ID on total sub channel such as Node id is 6 and
the sub-channels are 5 then according to the formula the remainder is 1 so the channel id 1 will be used by node-
6 for transmission. The proposed scheme offers a simple and light weight mechanism for solving the problem of
channel reservation in multi-channel MAC protocols. This scheme does not reserve a channel rather its selects a
particular transmission channel for every node and that is used for ever by the respective node. The scheme not
only eliminates the overhead involved in channel reservation but also reduces the no. of collisions between in
the network by providing an efficient way of channel selection in a distributed fashion. Although the proposed
scheme does not ensure (guarantee) that a distinct channel will be selected by neighboring nodes. In other
words, it is possible that same channel will be selected by two neighboring nodes e.g. if node 6 and node 11 are
neighbor nodes and we have 5 sub channels then the proposed scheme will result is selection of channel- ID (1)
for both node 6 and node 11. As a result of using same transmission channel both cannot communicate at the
same time otherwise it will result in collision. But in Ad hoc networks nodes are distributed randomly and the
probability of having two nodes communicating at the same time, being neighbors and are assigned with same
4. Simulation based Evaluation of a Simple Channel Distribution Scheme for MANETs
www.iosrjournals.org 58 | Page
channel, is very low. According to Amdahl’s law, we shall focus to optimize the part of a design that affects the
performance at most. In other words, targeting to improve the fraction that rarely happens may results in less
gain as compared to the overhead. Therefore we choose to use a simple (kind of random) scheme for channel
selection. Remarkable improvement in the simulations results is observed by using proposed scheme. The major
design question in our proposed scheme is that how many sub channels will be sufficient to achieve optimal
results. Too many sub channels will result in under utilization as most of the channels will remain unused. On
other hand, too few channels will results in selection of same channel by neighboring nodes and hence
collisions. We have performed simulation with varying no. of sub channels ranging from 2 to 10. We have
found no more significant improvement in the results after 5 sub channels and we have reported results with 5
sub channels compared against single channel MAC protocol in section V. We have collected results various
parameters such as Packet Delivery ratio, Throughput, Delay, Normalized Routing Load and Energy
consumption. The Results show that the performance of the proposed protocol is best for the channel
assignments according to new technique.
IV. Empirical Evaluations
A. Simulation Parameters
We have compared the performance of the proposed scheme with traditional MAC protocol (single
channel). For analysis, a testing environment had to be created in which the starting position and conditions are
the same for all protocols. We have used NS-2 for simulation. Table I shows details of varying parameters used
in simulation. Moreover, numbers of nodes in all simulations were 100, moving with uniform velocity of 5msec
using Random waypoint mobility model, in square area of 1000 x1000 m2
. CBR traffic sources (having packet
interval of 0.2sec) were used with UDP at transport layer and AODV at routing layer. For rest of the parameters
ns-2 default settings were used.
TABLE I
VARYING SIMULATION PARAMETERS
Simulation No. No. of Flows PKT Size
1 15 64
2 15 128
3 15 256
4 15 512
5 15 1024
6 10 512
7 20 512
8 25 512
9 30 512
B. Performance Metrics
Now we define the performance Metrics which we used in the comparison of the protocols.
1.Throughput: The throughput can be defined as that how much information can be delivered from one location
to another in given amount of time if we achieve the higher throughput the better because it implies that the
protocols is delivering more information in given time. The throughput of a node can be defined as if the node
sends the x number of bits in t amount of time then the throughput of this node may be defined as:
Thr=x/t.
If it take the smaller amount of time and delivered more bits then the network achieve the maximum throughput.
The maximum throughput is the ultimate objective of every network.
2. Success rate: The success rate means that how many packets successfully received by the destination node.
3. No. of Packets Delivered: It means that how many packets are delivered to the target node throughout the
simulation. This parameter is useful in CBR traffic because CBR generates the packets with a fixed rate. The
CBR ensure that the generation of packets remains same for all the protocol. Packets Delivery metrics gives a
suggestion about the capability of the underlying protocol to transport the packets.
4. Delay: The Delay can be defined as how long take a time when the packet is sent from one location to
another. If this value is minimum it means protocol is efficient and more desirable.
Delay (m sec): Average (Received Time - Sent Time)
5. Energy consumption: The energy consumption means that how many energy used by the node in the network.
The protocol is a desirable if the energy consumption values is less.
5. Simulation based Evaluation of a Simple Channel Distribution Scheme for MANETs
www.iosrjournals.org 59 | Page
6. Packet delivery ratio (PDR): It is the ratio of the number of packets successfully received by the application
layer of a destination node to the number of packets originated at the application layer of each node for that
destination. The higher the PDR, the better, as it means that the protocol has less number of collisions. Packet
delivery ratio means the number of packets received at the destination throughout the simulation. CBR generates
the packets with a fixed rate so this metric is useful in CBR traffic. Thus the number of generated packets for the
same simulation time remains the same for all protocols. This metric gives a direct idea about the ability of the
underlying protocol to deliver the packets.
7. Normalized Routing Load (NRL): when the sender sends some data the NRL show ratio of the number of
overhead (control packets) to the total number of data packets delivered. The NRL value is minimum the
protocol is better. For more and more traffic coming into the network, it becomes harder for the network to
manage all this traffic so it is called network load. This high network load or additional traffic on the network
affects the MANET routing packets, which in result slows down the delivery of packets for reaching to the
destination.
V. Experiment And Results
We compared the performance of proposed multi channel scheme with single channel MAC protocol.
These set of experiments were performed to investigate the effect of packet size on various performance
matrices such as PDR, Throughput, Energy used, Delay, and NRL. These Simulations are performed with
packet size of 64, 128, 256, 512 and 1024 Bytes respectively. Figure 3 shows the comparative results of various
metrics w.r.t to varying packet size. It is obvious that larger size packets will have longer airtime hence more
collisions and longer delays, but at the same time protocols are delivering more bits on the same control
overhead and same simulation time, due to this it will cause an increase in throughput and finally decrease in
energy expenditure. The same behavior is depicted from single channel results. Multi channel results are best in
all cases and mainly due to having very few collisions as nodes are communicating on different channels. While
for single channel PDR is reduced when we increase the packet size because the larger packet will have loner air
time. NRL and average delays are nearly unaffected with increase in packet size for our proposed multi channel
scheme. Energy expenditure per node is increasing for multi-channel scheme with increase in packet size due to
large amount of data transfer. Collectively, the result reveals that proposed multi channel scheme performs
better with large packet size.
Next, we have analyzed the performance of the two schemes with varying no. of flows. The purpose of
these experiments was to test the ability of the both protocols to adopt itself to varying conditions and under
varying stresses. This experiment helps us in understanding the maximum possible upper limit of these MAC
protocols. Performance of the protocols is evaluated with flows 5, 10, 15, 20, 25 and 30. Figure 4 show the
comparative results of the single and proposed multi channel MAC Protocols scheme w.r.t to various number of
flows to test their performance in congested environment. The relatively low PDR of single channel MAC
protocol is because of its aggressive reaction on link failure which results in failure of other established routes
6. Simulation based Evaluation of a Simple Channel Distribution Scheme for MANETs
www.iosrjournals.org 60 | Page
due to collision. Increasing the number of flows then congestion will occurs in single channel MAC protocol
that will ultimately lead toward collisions due to which links failure will occur and the protocol will try to
discover the new link for transmission. So the Routing packet ratio increased to discover the new link. The
Average Delay of Single Channel MAC protocol is increased with the increased in flows as from figure 4, this is
because of the congestion in the network. Collectively, the result reveals that proposed multi channel scheme
performs better with various flows in the congested networks.
Figure 3: Various PKT Size
0
2
4
6
8
10
12
14
64 128 256 512 1024
NormalizedRoutingLoad
Packet Size
Single Channel 3_Sub _Channel 5_Sub_Channel
0
10
20
30
40
50
60
70
80
90
100
5 10 15 20 25 30
PacketDeliveryRatio
Flows
Single Channel 3_Sub _Channel
5_Sub_Channel
0
50
100
150
200
250
300
350
5 10 15 20 25 30
Throughput(Kbps)
Flows
Single Channel 3_Sub _Channel
5_Sub_Channel
7. Simulation based Evaluation of a Simple Channel Distribution Scheme for MANETs
www.iosrjournals.org 61 | Page
Figure 4: Various Number of flows
VI. Conclusions And Future Directions
In this paper, a Multi Channel Scheme has been proposed for mobile Ad hoc networks. The proposed
scheme offers a simple and light weight mechanism for solving the problem of channel reservation in multi-
channel MAC protocols. The key feature of our technique is the Zero control overhead, reduced collision and
effective channel utilization. The performance of the Single channel has been compared with that of the
proposed Multi channel scheme under various parameters in the simulation environment NS-2. It is observed
that the performance of proposed multi channel scheme outperform then Single Channel MAC protocol. From
all these experiments, it is concluded that proposed Multi Channel scheme provides the valuable solution for
mobile ad hoc networks. We are looking forward to extend the current work in two directions. First, although
our proposed scheme has improved the performance of traditional MAC protocol but, its real gain will be
0
0.2
0.4
0.6
0.8
1
1.2
1.4
1.6
5 10 15 20 25 30
Delay(Sec)
Flows
IEEE 802.11 3_Sub _Channel
5_Sub_Channel
0
2
4
6
8
10
12
14
5 10 15 20 25 30NormalizedRoutingLoad
Flows
Single Channel 3_Sub _Channel
5_Sub_Channel
0
20
40
60
80
100
120
140
160
5 10 15 20 25 30
AverageUsedEnergy(mj)
Flows
Single Channel 3_Sub _Channel
5_Sub_Channel
0
0.1
0.2
0.3
0.4
0.5
0.6
5 10 15 20 25 30
Single
Channel
3_Sub
_Channel
5_Sub_Chann
el
8. Simulation based Evaluation of a Simple Channel Distribution Scheme for MANETs
www.iosrjournals.org 62 | Page
revealed when compared against some existing multi channel protocols. As ns-2 code of any multi channel
protocol is not available, so we will implement some selected multi channel protocols for comprehensive
analysis. Secondly, proposed scheme channel assignment is based on a simple formula that does not guarantee
selection of a distinct channel for neighboring nodes. We need some how to modify the scheme to overcome its
inherited problem.
References
[1] Blerta Bishaj, MAC protocols, contention-based with reservation and scheduling, Helsinki University of Technology 2008.
[2] C.Siva Ram Murthy and B.S Manjo, Ad hoc Wireless Network Architecture and protocols, 2nd Edition, Published by Dorling
Kindersley (India).
[3] V. Bharghavan, A. Demers, S. Shenker, and L. Zhang,”MACAW: A media access protocol for wireless LAN’s”, In SIGCOMM ’94,
pages 212-225. ACM, 1994.
[4] N.Abramson,”TheALOHA system-another alternative for computer communication,” Proc.of AFIPS FJCC, pp-281-285, 1970.
[5] Mariam Kaynia, Geir E.ien, Nihar Jindal, David Gesbert,” Comparative Performance Evaluation of MAC Protocols in Ad Hoc
Networks with Bandwidth Partitioning”, Dept. of Electrical and Computer Engineering, University of Minnesota, USA, 2009.
[6] WenHwa Liao and WenChin Chung,” An Efficient Multi-Channel MAC Protocol for Mobile Ad Hoc Networks”, Department of
Information Management Tatung University, Taiwan, 2009 International Conference on Communications and Mobile Computing.
[7] ChihMin Chao1, HsienChen Tsai, and Kuan-Ju Huang,” A New Channel Hopping MAC Protocol for Mobile Ad Hoc Networks”,
Department of Computer Science and Engineering National Taiwan Ocean University, Taiwan, IEEE 2009.
[8] Zygmunt J. Haas and Jing Deng,”Dual Busy Tone Multiple Access (DBTMA)-a Multiple Access Control Scheme for Ad Hoc
Networks” IEEE TRANSACTIONS ON COMMUNICATIONS, VOL. 50, NO. 6, JUNE 2002.
[9] C. L. Fullmer and J. Garcia-Luna-Aceves,”FAMA-PJ: A channel access protocol for wireless LANs. In Mobile computing and
Networking”, Berkley, CA (USA), pages 76-85. ACM, November 1995.
[10] Shengming Jiang, Jianqiang Rao, Dajiang He and Xinhua Ling,”A Simple Distributed PRMA for MANETs, IEEE
TRANSACTIONS ON VEHICULAR TECHNOLOGY, VOL. 51, NO. 2 MARCH 2002.
[11] Ritun Patney,”Survey on Performance Evaluation Techniques for Medium Access Control Protocols”, Washington University in St.
Louis 2007.
[12] Zhenyu Tang and J. J. Garcia-Luna-Aceves,”Hop-Reservation Multiple Access (HRMA) for Ad-Hoc Networks”, Computer
Engineering Department School of Engineering University of California, IEEE 1999.
[13] Kai Liu and Xiaoqin Xing: A Multichannel Reservation Multiple Access Protocol for Mobile Ad hoc Networks: ICC 2008.
[14] Ghalem Boudour and Zoubir Mammeri: Reservation Clash Handling to optimize Bandwidth Utilization in MANETs: International
Conference on Communication Theory, Reliability, and Quality of Services 2008.
[15] Ghalem Boudour and Zoubir Mammeri: Bandwidth Reservation for Heterogeneous Traffics in Mobile Wireless Networks: Fifth
Advanced International Conference on Telecommunications 2009.
[16] Khaled Hatem Almotairi and Xuemin: Multi-channel Medium Access Control with Hopping Reservation for Multi-hop Wireless
Networks in IEEE Globecom 2010.