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.
A secure qos distributed routing protocol for hybrid wireless networksAAKASH S
The succeeding wireless network is Hybrid Wireless Networks. It can provide Quality of Service
(QoS) requirements in real time transmission for wireless application. But it stream including critical mission
application like military use or emergency recovery. Hybrid wireless networks is unified mobile ad-hoc network
(MANET) and wireless infrastructure networks. It inherits invalid reservation and race condition problem in
Mobile ad-hoc network (MANET). Whereas open medium and wide distribution of node make vulnerable to
malicious attackers in Hybrid wireless networks. How to secure the Quality of Service (QoS) routing in Hybrid
wireless networks. In this paper, we propose a Secure QoS-Oriented Distributed routing protocol (SQOD) to
upgrade the secure Quality of Service (QoS) routing in Hybrid wireless networks. SQOD contain two
contrivances: 1.QoS-Oriented Distributed Routing Protocol (QOD)-to reduce transmission delay, transmission
time. And also increase wireless network transmission throughput. 2. Enhanced Adaptive ACKnowledgment
(EAACK)-implement a new intrusion-detection system for Hybrid wireless networks. It protect Hybrid wireless
networks from attacks that have higher malicious behavior detection rate. Analytical and simulation result
based on the real human mobility mode. SQOD can provide high secure performance in terms of Intrusion detection,overhead, transmission delay.
ENERGY EFFICIENT MULTICAST ROUTING IN MANET ijac journal
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.
Design and implementation of new routingIJCNCJournal
Energy consumption is a key element in the Wireless Sensor Networks (WSNs) design. Indeed, sensor nodes are really constrained by energy supply. Hence, how to improve the network lifetime is a crucial and challenging task. Several techniques are available at different levels of the OSI model to maximize the WSN lifetime and especially at the network layer which uses routing strategies to maintain the routes in the network and guarantee reliable communication. In this paper we intend to propose a new protocol called
Combined Energy and Distance Metrics Dynamic Routing Protocol (CEDM-DR). Our new approach considers not only the distance between wireless sensors but also the energy of node acting as a router in order to find the optimal path and achieve a dynamic and adaptive routing.
The performance metrics exploited for the evaluation of our protocol are average energy consumed, network lifetime and packets lost. By comparing our proposed routing strategy to protocol widely used in WSN namely Ad hoc On demand Distance Vector(AODV), simulation results show that CEDM-DR strategy might effectively balance the sensor power consumption and permits accordingly to enhance the network
lifetime. As well, this new protocol yields a noticeable energy saving compared to its counterpart.
A QUALITY OF SERVICE ARCHITECTURE FOR RESOURCE PROVISIONING AND RATE CONTROL ...ijasuc
Prioritized flow control is a type of QoS provisioning in which each class is provided a different QoS by
assigning priority to one class over another in terms of allocating resources. It is an effective means to
provide service differentiation to different class of service in mobile ad hoc networks. So the objective is to
achieve a desired level of service to high-priority flows so that the wireless medium is completely utilized
using adaptive rate control. In this paper, we propose to design QoS architecture for Bandwidth
Management and Rate Control in MANET. Our proposed QoS architecture contains an adaptive
bandwidth management technique which measures the available bandwidth at each node in real-time and
it is then propagated on demand by the QoS routing protocol. The source nodes perform call admission
control for different priority of flows based on the bandwidth information provided by the QoS routing.
The network bandwidth utilization is monitored continuously and network congestion is detected in
advance. Then a rate control mechanism is used to regulate best-effort traffic.
Connectivity aware and adaptive multipath routing algorithm for mobile adhoc ...ijwmn
We propose in this paper a connectivity-aware routing algorithm and a set of related theorems. This algorithm allows nodes in Mobile Adhoc and Sensor Networks (MASNets) to provide the highest connectivity life time to a specific destination since the issuance of data becomes a necessity for MASNets. In the proposed Solution, nodes in MASNets are able to specify the disjointness degree of the available paths allowing the discovery of the optimal set of backup routes and consequently enhance the survivability of the connectivity. These nodes perform an on-demand discovery and a generation of a set of routes, by specifying a disjointness threshold, representing the maximal number of nodes shared between any two paths in the set of k established paths. The proposed multipath routing algorithm, is adaptive, secure, and uses labels to carry the disjointness-threshold between nodes during the route discovery. A set of security mechanisms, based on the Watchdog and the digital signature concepts, is used to protect the route discovery process.
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.
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.
A secure qos distributed routing protocol for hybrid wireless networksAAKASH S
The succeeding wireless network is Hybrid Wireless Networks. It can provide Quality of Service
(QoS) requirements in real time transmission for wireless application. But it stream including critical mission
application like military use or emergency recovery. Hybrid wireless networks is unified mobile ad-hoc network
(MANET) and wireless infrastructure networks. It inherits invalid reservation and race condition problem in
Mobile ad-hoc network (MANET). Whereas open medium and wide distribution of node make vulnerable to
malicious attackers in Hybrid wireless networks. How to secure the Quality of Service (QoS) routing in Hybrid
wireless networks. In this paper, we propose a Secure QoS-Oriented Distributed routing protocol (SQOD) to
upgrade the secure Quality of Service (QoS) routing in Hybrid wireless networks. SQOD contain two
contrivances: 1.QoS-Oriented Distributed Routing Protocol (QOD)-to reduce transmission delay, transmission
time. And also increase wireless network transmission throughput. 2. Enhanced Adaptive ACKnowledgment
(EAACK)-implement a new intrusion-detection system for Hybrid wireless networks. It protect Hybrid wireless
networks from attacks that have higher malicious behavior detection rate. Analytical and simulation result
based on the real human mobility mode. SQOD can provide high secure performance in terms of Intrusion detection,overhead, transmission delay.
ENERGY EFFICIENT MULTICAST ROUTING IN MANET ijac journal
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.
Design and implementation of new routingIJCNCJournal
Energy consumption is a key element in the Wireless Sensor Networks (WSNs) design. Indeed, sensor nodes are really constrained by energy supply. Hence, how to improve the network lifetime is a crucial and challenging task. Several techniques are available at different levels of the OSI model to maximize the WSN lifetime and especially at the network layer which uses routing strategies to maintain the routes in the network and guarantee reliable communication. In this paper we intend to propose a new protocol called
Combined Energy and Distance Metrics Dynamic Routing Protocol (CEDM-DR). Our new approach considers not only the distance between wireless sensors but also the energy of node acting as a router in order to find the optimal path and achieve a dynamic and adaptive routing.
The performance metrics exploited for the evaluation of our protocol are average energy consumed, network lifetime and packets lost. By comparing our proposed routing strategy to protocol widely used in WSN namely Ad hoc On demand Distance Vector(AODV), simulation results show that CEDM-DR strategy might effectively balance the sensor power consumption and permits accordingly to enhance the network
lifetime. As well, this new protocol yields a noticeable energy saving compared to its counterpart.
A QUALITY OF SERVICE ARCHITECTURE FOR RESOURCE PROVISIONING AND RATE CONTROL ...ijasuc
Prioritized flow control is a type of QoS provisioning in which each class is provided a different QoS by
assigning priority to one class over another in terms of allocating resources. It is an effective means to
provide service differentiation to different class of service in mobile ad hoc networks. So the objective is to
achieve a desired level of service to high-priority flows so that the wireless medium is completely utilized
using adaptive rate control. In this paper, we propose to design QoS architecture for Bandwidth
Management and Rate Control in MANET. Our proposed QoS architecture contains an adaptive
bandwidth management technique which measures the available bandwidth at each node in real-time and
it is then propagated on demand by the QoS routing protocol. The source nodes perform call admission
control for different priority of flows based on the bandwidth information provided by the QoS routing.
The network bandwidth utilization is monitored continuously and network congestion is detected in
advance. Then a rate control mechanism is used to regulate best-effort traffic.
Connectivity aware and adaptive multipath routing algorithm for mobile adhoc ...ijwmn
We propose in this paper a connectivity-aware routing algorithm and a set of related theorems. This algorithm allows nodes in Mobile Adhoc and Sensor Networks (MASNets) to provide the highest connectivity life time to a specific destination since the issuance of data becomes a necessity for MASNets. In the proposed Solution, nodes in MASNets are able to specify the disjointness degree of the available paths allowing the discovery of the optimal set of backup routes and consequently enhance the survivability of the connectivity. These nodes perform an on-demand discovery and a generation of a set of routes, by specifying a disjointness threshold, representing the maximal number of nodes shared between any two paths in the set of k established paths. The proposed multipath routing algorithm, is adaptive, secure, and uses labels to carry the disjointness-threshold between nodes during the route discovery. A set of security mechanisms, based on the Watchdog and the digital signature concepts, is used to protect the route discovery process.
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.
MULTI-CLUSTER MULTI-CHANNEL SCHEDULING (MMS) ALGORITHM FOR MAXIMUM DATA COLLE...IJCNCJournal
Interference during data transmission can cause performance degradation like packet collisions in Wireless Sensor Networks (WSNs). While multi-channels available in IEEE 802.15.4 protocol standard WSN technology can be exploited to reduce interference, allocating channel and channel switching
algorithms can have a major impact on the performance of multi-channel communication. This paper presents an improved Fuzzy Logic based Cluster Formation and Cluster Head (CH) Selection algorithm with enhanced network lifetime for multi-cluster topology. The Multi-Cluster Multi-Channel Scheduling
(MMS) algorithm proposed in this paper improves the data collection by minimizing the maximum interference and collision. The presented work has developed Cluster formation and cluster head (CH) selection algorithm and Interference-free data communication by proper channel scheduled. The extensive
simulation and experimental outcomes prove that the proposed algorithm not only provides an interference-free transmission but also provides delay minimization and longevity of the network lifetime, which makes the presented algorithm suitable for energy-constrained wireless sensor networks.
A NOVEL HYBRID OPPORTUNISTIC SCALABLE ENERGY EFFICIENT ROUTING DESIGN FOR LOW...IJCNCJournal
Opportunistic Routing (OR) scheme increases the transmission reliability despite the lossy wireless radio links by exploiting the broadcast nature of the wireless medium. However, OR schemes in low power Wireless Sensor Network (WSN) leads to energy drain in constrained sensor nodes due to constant
overhearing, periodic beaconing for Neighbourhood Management (NM) and increase in packet header length to append priority wise sorted Forwarding Candidates Set (FCS) prior to data transmission. The timer-based coordination mechanism incurs the least overhead to coordinate among the FCS that has successfully received the data packet for relaying the data in a multi-hop manner. This timer-based mechanism suffers from duplicate transmissions if the FCS is either not carefully selected or coordinated. The focus of this work is to propose a hybrid opportunistic energy efficient routing design for large scale, low power and lossy WSN. This design avoids periodic 'hello' beacons for NM, limits constant overhearing and increase in packet header length. There are two modes of operation i) opportunistic ii) unicast mode. The sender node adopts opportunistic forwarding for its initial data packet transmission and instead of pre-computing the FCS, it is dynamically computed in a completely distributed manner. The
eligible nodes to be part of FCS will be neighbour nodes at lower corona level than the sender with respect to the sink and remaining energy above the minimum threshold. The nodes part of FCS based on crosslayered multi-metrics and fuzzy decision logic determines its priority level to compute Dynamic Holding
Delay (DHD) for effective timer coordination. The differentiated back off implementation along with DHD enables the higher priority candidate that had received data packet to forward the packet first and facilitates others to cancel its timer upon overhearing. The sender node switches to unicast mode of
forwarding for successive transmissions by choosing the forwarding node with maximum trust value as it
denotes the stability of the temporally varying link with respect to the forwarder. The sender node will revert to opportunistic mode to increase transmission reliability in case of link-level transmission error or no trustworthy forwarders. Simulation results in NS2 show significant increase in Packet Delivery Ratio (PDR),decrease in both average energy consumption per node and Normalized Energy Consumption (NEC) per packet in comparison with existing protocols.
Mtadf multi hop traffic aware data for warding for congestion control in wir...ijwmn
In the past few years there is a remarkable change in the field of wireless sensor networks. Congestion occurs when there is a heavy traffic in the network. The heavy traffic in the network leads to wastage of energy and packet loss. Traffic Aware Dynamic Routing algorithm mitigates congestion by using one hop neighbor routing, hence throughput of the network is low. This paper proposed a Multi hop based Data Forwarding Technique to mitigate congestion. Queue length field and depth potential field play a major role to divert the traffic in the network to the alternate paths. The high traffic load leads to data queue overflow in the sensor nodes, these results in loss of important information about important events. Multi hop Traffic-Aware Dynamic Routing algorithm addresses congestion using depth potential field and queue length potential field. The algorithm forwards data packets around the congestion areas and scatters the excessive along multiple paths. The nodes with less load are efficiently utilized in response to congestion. The main aspect of the algorithm is to construct two independent potential fields using depth and queue length. Queue length field solves the traffic-aware problem. Depth field creates a backbone to forward packets to the sink. Both fields are combined to yield a hybrid potential field to make dynamic decision for data forwarding. Simulations are conducted to evaluate the performance of our proposed algorithm and our proposed scheme performs better compared to previous work.
ENERGY LOCATION AWARE ROUTING PROTOCOL (ELARP) FOR WIRELESS MULTIMEDIA SENSOR...ijcsit
Wireless Sensor Networks (WSNs)have sensor nodes that sense and extract information from surrounding
environment, processing information locally then transmit it to sink wirelessly. Multimedia data is larger in
volume than scalar data, thus transmitting multimedia data via Wireless Multimedia Sensor Networks
(WMSNs) requires stick constraints on quality of services in terms of energy, throughput and end to end
delay.Multipath routing is to discover multipath during route discovery from source to sink. Discover
multipath and sending data via these different paths improve the bandwidth and decrease the end to end
delay. This paper introduces an Energy Location Aware Routing Protocol (ELARP) which is reactive
multipath routing protocol establishing three paths with awareness of node’s residual energy and distance.
ELARP has experimented with NS2 simulator. The simulation results show that ELARP enhances QoS for
multimedia data in terms of end to end delay and packet delivery ratio.
Hybrid networks is integrate MANETs and infrastructure wireless networks
It have proven to be a better network structure for the next generation networks
It can act Base station and Ad hoc according to the environment conditions
The widespread use of mobile devices the increasing demand for mobile multimedia streaming services
The future of real time need of high Quality of Service (QoS) support in wireless and mobile networking environments
The QoS support reduces end to end transmission delay and enhances throughput to guarantee the seamless communication between mobile devices and wireless infrastructures
Specifically, infrastructure networks improve the scalability of MANETs, while MANETs automatically establish self-organizing networks, extending the coverage of the infrastructure networks
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.
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.
Routing Optimization with Load Balancing: an Energy Efficient ApproachEswar Publications
The area of Wireless Sensor Network (WSN) is covered with considerable range of problems, where majority of research attempts were carried out to enhance the network lifetime of WSN. But very few of the studies have proved successful. This manuscript discusses about a structure for optimizing routing and load balancing that uses standard radio and energy model to perform energy optimization by introducing a novel routing agent. The routing agent is built within aggregator node and base station to perform self motivated reconfiguration in case of energy depletion. Compared with standard LEACH algorithm, the proposed technique has better energy efficiency within optimal data aggregation duration.
An Eavesdropping Model for Securing Communications over Wireless Broadcast Ne...IJMER
International Journal of Modern Engineering Research (IJMER) is Peer reviewed, online Journal. It serves as an international archival forum of scholarly research related to engineering and science education.
IMPROVING PACKET DELIVERY RATIO WITH ENHANCED CONFIDENTIALITY IN MANETijcsa
In Mobile Ad Hoc Network (MANET), the collection of mobile nodes gets communicated without the need of any customary infrastructure. In MANET, repeated topology changes and intermittent link breakage
causes the failure of existing path. This leads to rediscovery of new route by broadcasting RREQ packet.The number of RREQ packet in the network gets added due to the increased amount of link failures. This result in increased routing overhead which degrades the packet delivery ratio in MANET. While designing
routing protocols for MANET, it is indispensable to reduce the overhead in route discovery. In our previous
work[17], routing protocol based on neighbour details and probabilistic knowledge is utilized, additionally
the symmetric cipher AES is used for securing the data packet. Through this protocol, packet delivery ratio
gets increased and confidentiality is ensured. But there is a problem in secure key exchange among the
source and destination while using AES. To resolve that problem, hybrid cryptographic system i.e.,
combination of AES and RSA is proposed in this paper. By using this hybrid cryptographic scheme and the
routing protocol based on probability and neighbour knowledge, enhanced secure packet delivery is
ensured in MANET
MULTI-HOP BANDWIDTH MANAGEMENT PROTOCOL FOR MOBILE AD HOC NETWORKSIJMIT JOURNAL
An admission control scheme should play the role of a coordinator for flows in a data communication network, to provide the guarantees as the medium is shared. The nodes of a wired network can monitor the medium to know the available bandwidth at any point of time. But, in wireless ad hoc networks, a node must consume the bandwidth of neighboring nodes, during a communication. Hence, the consumption of bandwidth by a flow and the availability of resources to any wireless node strictly depend upon the neighboring nodes within its transmission range. We present a scalable and efficient admission control scheme, Multi-hop Bandwidth Management Protocol (MBMP), to support the QoS requirements
in multi-hop ad hoc networks. We simulate several options to design MBMP and compare the performances of these options through mathematical analysis and simulation results, and compare its effectiveness with the existing admission control schemes through extensive simulations.
Survey: Multipath routing for Wireless Sensor NetworkEditor IJMTER
Reliability is playing very vital role in some application of Wireless Sensor Networks
and multipath routing is one of the ways to increase the probability of reliability. More over energy
consumption is constraint. In this paper, we provide a survey of the state-of-the-art of proposed
multipath routing algorithm for Wireless Sensor Networks. We study the design, analyze the tradeoff
of each design, and overview several presenting algorithms.
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.
Analysis of Neighbor Knowledge Based Bcast Protocol Performance For Multihop ...pijans
Reliable group communication is a challenging issue for most Mobile Ad-hoc Networks (MANETs) due to
dynamic nature of wireless mobile nodes, group key establishment and management, ensuring secure
information exchange and Quality of Service (QoS) in data transfer. Recently multicast and broadcast
routing protocols are emerging for supporting QoS aware group communication. In MANETs QoS
requirements can be quantified by a set of measurable pre-specified service attributes such as packet
delivery ratio, end-to-end delay, packet loss probability, network control overhead, throughput,
bandwidth, power consumption, service coverage area etc. In this paper, the performance of a neighbor
knowledge based broadcast protocol is analyzed using different QoS metrics (packet delivery ratio, end-toend delay, packet loss probability and network control overhead). BCAST is used as broadcast protocol.
The performance differentials are analyzed using NS-2 network simulator for varying number of data
senders (multicast group size) and data sending rate (offered traffic to the network) over QoS aware group
communication. Simulation results show that BCAST performs well in most cases and provides robust
performance even with high traffic environments.
Analysis of Neighbor Knowledge Based Bcast Protocol Performance For Multihop ...pijans
Reliable group communication is a challenging issue for most Mobile Ad-hoc Networks (MANETs) due to
dynamic nature of wireless mobile nodes, group key establishment and management, ensuring secure
information exchange and Quality of Service (QoS) in data transfer. Recently multicast and broadcast
routing protocols are emerging for supporting QoS aware group communication. In MANETs QoS
requirements can be quantified by a set of measurable pre-specified service attributes such as packet
delivery ratio, end-to-end delay, packet loss probability, network control overhead, throughput,
bandwidth, power consumption, service coverage area etc. In this paper, the performance of a neighbor
knowledge based broadcast protocol is analyzed using different QoS metrics (packet delivery ratio, end-toend delay, packet loss probability and network control overhead). BCAST is used as broadcast protocol.
The performance differentials are analyzed using NS-2 network simulator for varying number of data
senders (multicast group size) and data sending rate (offered traffic to the network) over QoS aware group
communication. Simulation results show that BCAST performs well in most cases and provides robust
performance even with high traffic environments.
A QUALITY OF SERVICE ARCHITECTURE FOR RESOURCE PROVISIONING AND RATE CONTROL ...ijasuc
Prioritized flow control is a type of QoS provisioning in which each class is provided a different QoS by
assigning priority to one class over another in terms of allocating resources. It is an effective means to
provide service differentiation to different class of service in mobile ad hoc networks. So the objective is to
achieve a desired level of service to high-priority flows so that the wireless medium is completely utilized
using adaptive rate control. In this paper, we propose to design QoS architecture for Bandwidth
Management and Rate Control in MANET. Our proposed QoS architecture contains an adaptive
bandwidth management technique which measures the available bandwidth at each node in real-time and
it is then propagated on demand by the QoS routing protocol. The source nodes perform call admission
control for different priority of flows based on the bandwidth information provided by the QoS routing.
The network bandwidth utilization is monitored continuously and network congestion is detected in
advance. Then a rate control mechanism is used to regulate best-effort traffic.
PERFORMANCE ANALYSIS OF WIRELESS MESH NETWORK USING ADAPTIVE INFORMANT FACTOR...IJCSES Journal
Wireless mesh network (WMN) has become an important leading technology which provides several types of useful applications such as community network, broadband home network and internet access, etc. The rise in the size of users in WMN has created a degradation of efficiency in a network especially in dense areas due to the clumsy channel allocation and hence creating many challenges for enhancing the users experience, network quality and throughput. Therefore in this paper, we proposed OCA based AIF model that can access the channel information and then it process to improve the RF channel association. The proposed OCA-AIF will function for each period when some interference is detected via AIF and we further extend this analysis by taking in to consideration the influence of interference to provide a high quality indicator in network. The analysis of result shows the optimization by our proposed approach which increases as per the increment of relay nodes (RNs).
MULTI-CLUSTER MULTI-CHANNEL SCHEDULING (MMS) ALGORITHM FOR MAXIMUM DATA COLLE...IJCNCJournal
Interference during data transmission can cause performance degradation like packet collisions in Wireless Sensor Networks (WSNs). While multi-channels available in IEEE 802.15.4 protocol standard WSN technology can be exploited to reduce interference, allocating channel and channel switching
algorithms can have a major impact on the performance of multi-channel communication. This paper presents an improved Fuzzy Logic based Cluster Formation and Cluster Head (CH) Selection algorithm with enhanced network lifetime for multi-cluster topology. The Multi-Cluster Multi-Channel Scheduling
(MMS) algorithm proposed in this paper improves the data collection by minimizing the maximum interference and collision. The presented work has developed Cluster formation and cluster head (CH) selection algorithm and Interference-free data communication by proper channel scheduled. The extensive
simulation and experimental outcomes prove that the proposed algorithm not only provides an interference-free transmission but also provides delay minimization and longevity of the network lifetime, which makes the presented algorithm suitable for energy-constrained wireless sensor networks.
A NOVEL HYBRID OPPORTUNISTIC SCALABLE ENERGY EFFICIENT ROUTING DESIGN FOR LOW...IJCNCJournal
Opportunistic Routing (OR) scheme increases the transmission reliability despite the lossy wireless radio links by exploiting the broadcast nature of the wireless medium. However, OR schemes in low power Wireless Sensor Network (WSN) leads to energy drain in constrained sensor nodes due to constant
overhearing, periodic beaconing for Neighbourhood Management (NM) and increase in packet header length to append priority wise sorted Forwarding Candidates Set (FCS) prior to data transmission. The timer-based coordination mechanism incurs the least overhead to coordinate among the FCS that has successfully received the data packet for relaying the data in a multi-hop manner. This timer-based mechanism suffers from duplicate transmissions if the FCS is either not carefully selected or coordinated. The focus of this work is to propose a hybrid opportunistic energy efficient routing design for large scale, low power and lossy WSN. This design avoids periodic 'hello' beacons for NM, limits constant overhearing and increase in packet header length. There are two modes of operation i) opportunistic ii) unicast mode. The sender node adopts opportunistic forwarding for its initial data packet transmission and instead of pre-computing the FCS, it is dynamically computed in a completely distributed manner. The
eligible nodes to be part of FCS will be neighbour nodes at lower corona level than the sender with respect to the sink and remaining energy above the minimum threshold. The nodes part of FCS based on crosslayered multi-metrics and fuzzy decision logic determines its priority level to compute Dynamic Holding
Delay (DHD) for effective timer coordination. The differentiated back off implementation along with DHD enables the higher priority candidate that had received data packet to forward the packet first and facilitates others to cancel its timer upon overhearing. The sender node switches to unicast mode of
forwarding for successive transmissions by choosing the forwarding node with maximum trust value as it
denotes the stability of the temporally varying link with respect to the forwarder. The sender node will revert to opportunistic mode to increase transmission reliability in case of link-level transmission error or no trustworthy forwarders. Simulation results in NS2 show significant increase in Packet Delivery Ratio (PDR),decrease in both average energy consumption per node and Normalized Energy Consumption (NEC) per packet in comparison with existing protocols.
Mtadf multi hop traffic aware data for warding for congestion control in wir...ijwmn
In the past few years there is a remarkable change in the field of wireless sensor networks. Congestion occurs when there is a heavy traffic in the network. The heavy traffic in the network leads to wastage of energy and packet loss. Traffic Aware Dynamic Routing algorithm mitigates congestion by using one hop neighbor routing, hence throughput of the network is low. This paper proposed a Multi hop based Data Forwarding Technique to mitigate congestion. Queue length field and depth potential field play a major role to divert the traffic in the network to the alternate paths. The high traffic load leads to data queue overflow in the sensor nodes, these results in loss of important information about important events. Multi hop Traffic-Aware Dynamic Routing algorithm addresses congestion using depth potential field and queue length potential field. The algorithm forwards data packets around the congestion areas and scatters the excessive along multiple paths. The nodes with less load are efficiently utilized in response to congestion. The main aspect of the algorithm is to construct two independent potential fields using depth and queue length. Queue length field solves the traffic-aware problem. Depth field creates a backbone to forward packets to the sink. Both fields are combined to yield a hybrid potential field to make dynamic decision for data forwarding. Simulations are conducted to evaluate the performance of our proposed algorithm and our proposed scheme performs better compared to previous work.
ENERGY LOCATION AWARE ROUTING PROTOCOL (ELARP) FOR WIRELESS MULTIMEDIA SENSOR...ijcsit
Wireless Sensor Networks (WSNs)have sensor nodes that sense and extract information from surrounding
environment, processing information locally then transmit it to sink wirelessly. Multimedia data is larger in
volume than scalar data, thus transmitting multimedia data via Wireless Multimedia Sensor Networks
(WMSNs) requires stick constraints on quality of services in terms of energy, throughput and end to end
delay.Multipath routing is to discover multipath during route discovery from source to sink. Discover
multipath and sending data via these different paths improve the bandwidth and decrease the end to end
delay. This paper introduces an Energy Location Aware Routing Protocol (ELARP) which is reactive
multipath routing protocol establishing three paths with awareness of node’s residual energy and distance.
ELARP has experimented with NS2 simulator. The simulation results show that ELARP enhances QoS for
multimedia data in terms of end to end delay and packet delivery ratio.
Hybrid networks is integrate MANETs and infrastructure wireless networks
It have proven to be a better network structure for the next generation networks
It can act Base station and Ad hoc according to the environment conditions
The widespread use of mobile devices the increasing demand for mobile multimedia streaming services
The future of real time need of high Quality of Service (QoS) support in wireless and mobile networking environments
The QoS support reduces end to end transmission delay and enhances throughput to guarantee the seamless communication between mobile devices and wireless infrastructures
Specifically, infrastructure networks improve the scalability of MANETs, while MANETs automatically establish self-organizing networks, extending the coverage of the infrastructure networks
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.
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.
Routing Optimization with Load Balancing: an Energy Efficient ApproachEswar Publications
The area of Wireless Sensor Network (WSN) is covered with considerable range of problems, where majority of research attempts were carried out to enhance the network lifetime of WSN. But very few of the studies have proved successful. This manuscript discusses about a structure for optimizing routing and load balancing that uses standard radio and energy model to perform energy optimization by introducing a novel routing agent. The routing agent is built within aggregator node and base station to perform self motivated reconfiguration in case of energy depletion. Compared with standard LEACH algorithm, the proposed technique has better energy efficiency within optimal data aggregation duration.
An Eavesdropping Model for Securing Communications over Wireless Broadcast Ne...IJMER
International Journal of Modern Engineering Research (IJMER) is Peer reviewed, online Journal. It serves as an international archival forum of scholarly research related to engineering and science education.
IMPROVING PACKET DELIVERY RATIO WITH ENHANCED CONFIDENTIALITY IN MANETijcsa
In Mobile Ad Hoc Network (MANET), the collection of mobile nodes gets communicated without the need of any customary infrastructure. In MANET, repeated topology changes and intermittent link breakage
causes the failure of existing path. This leads to rediscovery of new route by broadcasting RREQ packet.The number of RREQ packet in the network gets added due to the increased amount of link failures. This result in increased routing overhead which degrades the packet delivery ratio in MANET. While designing
routing protocols for MANET, it is indispensable to reduce the overhead in route discovery. In our previous
work[17], routing protocol based on neighbour details and probabilistic knowledge is utilized, additionally
the symmetric cipher AES is used for securing the data packet. Through this protocol, packet delivery ratio
gets increased and confidentiality is ensured. But there is a problem in secure key exchange among the
source and destination while using AES. To resolve that problem, hybrid cryptographic system i.e.,
combination of AES and RSA is proposed in this paper. By using this hybrid cryptographic scheme and the
routing protocol based on probability and neighbour knowledge, enhanced secure packet delivery is
ensured in MANET
MULTI-HOP BANDWIDTH MANAGEMENT PROTOCOL FOR MOBILE AD HOC NETWORKSIJMIT JOURNAL
An admission control scheme should play the role of a coordinator for flows in a data communication network, to provide the guarantees as the medium is shared. The nodes of a wired network can monitor the medium to know the available bandwidth at any point of time. But, in wireless ad hoc networks, a node must consume the bandwidth of neighboring nodes, during a communication. Hence, the consumption of bandwidth by a flow and the availability of resources to any wireless node strictly depend upon the neighboring nodes within its transmission range. We present a scalable and efficient admission control scheme, Multi-hop Bandwidth Management Protocol (MBMP), to support the QoS requirements
in multi-hop ad hoc networks. We simulate several options to design MBMP and compare the performances of these options through mathematical analysis and simulation results, and compare its effectiveness with the existing admission control schemes through extensive simulations.
Survey: Multipath routing for Wireless Sensor NetworkEditor IJMTER
Reliability is playing very vital role in some application of Wireless Sensor Networks
and multipath routing is one of the ways to increase the probability of reliability. More over energy
consumption is constraint. In this paper, we provide a survey of the state-of-the-art of proposed
multipath routing algorithm for Wireless Sensor Networks. We study the design, analyze the tradeoff
of each design, and overview several presenting algorithms.
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.
Analysis of Neighbor Knowledge Based Bcast Protocol Performance For Multihop ...pijans
Reliable group communication is a challenging issue for most Mobile Ad-hoc Networks (MANETs) due to
dynamic nature of wireless mobile nodes, group key establishment and management, ensuring secure
information exchange and Quality of Service (QoS) in data transfer. Recently multicast and broadcast
routing protocols are emerging for supporting QoS aware group communication. In MANETs QoS
requirements can be quantified by a set of measurable pre-specified service attributes such as packet
delivery ratio, end-to-end delay, packet loss probability, network control overhead, throughput,
bandwidth, power consumption, service coverage area etc. In this paper, the performance of a neighbor
knowledge based broadcast protocol is analyzed using different QoS metrics (packet delivery ratio, end-toend delay, packet loss probability and network control overhead). BCAST is used as broadcast protocol.
The performance differentials are analyzed using NS-2 network simulator for varying number of data
senders (multicast group size) and data sending rate (offered traffic to the network) over QoS aware group
communication. Simulation results show that BCAST performs well in most cases and provides robust
performance even with high traffic environments.
Analysis of Neighbor Knowledge Based Bcast Protocol Performance For Multihop ...pijans
Reliable group communication is a challenging issue for most Mobile Ad-hoc Networks (MANETs) due to
dynamic nature of wireless mobile nodes, group key establishment and management, ensuring secure
information exchange and Quality of Service (QoS) in data transfer. Recently multicast and broadcast
routing protocols are emerging for supporting QoS aware group communication. In MANETs QoS
requirements can be quantified by a set of measurable pre-specified service attributes such as packet
delivery ratio, end-to-end delay, packet loss probability, network control overhead, throughput,
bandwidth, power consumption, service coverage area etc. In this paper, the performance of a neighbor
knowledge based broadcast protocol is analyzed using different QoS metrics (packet delivery ratio, end-toend delay, packet loss probability and network control overhead). BCAST is used as broadcast protocol.
The performance differentials are analyzed using NS-2 network simulator for varying number of data
senders (multicast group size) and data sending rate (offered traffic to the network) over QoS aware group
communication. Simulation results show that BCAST performs well in most cases and provides robust
performance even with high traffic environments.
A QUALITY OF SERVICE ARCHITECTURE FOR RESOURCE PROVISIONING AND RATE CONTROL ...ijasuc
Prioritized flow control is a type of QoS provisioning in which each class is provided a different QoS by
assigning priority to one class over another in terms of allocating resources. It is an effective means to
provide service differentiation to different class of service in mobile ad hoc networks. So the objective is to
achieve a desired level of service to high-priority flows so that the wireless medium is completely utilized
using adaptive rate control. In this paper, we propose to design QoS architecture for Bandwidth
Management and Rate Control in MANET. Our proposed QoS architecture contains an adaptive
bandwidth management technique which measures the available bandwidth at each node in real-time and
it is then propagated on demand by the QoS routing protocol. The source nodes perform call admission
control for different priority of flows based on the bandwidth information provided by the QoS routing.
The network bandwidth utilization is monitored continuously and network congestion is detected in
advance. Then a rate control mechanism is used to regulate best-effort traffic.
PERFORMANCE ANALYSIS OF WIRELESS MESH NETWORK USING ADAPTIVE INFORMANT FACTOR...IJCSES Journal
Wireless mesh network (WMN) has become an important leading technology which provides several types of useful applications such as community network, broadband home network and internet access, etc. The rise in the size of users in WMN has created a degradation of efficiency in a network especially in dense areas due to the clumsy channel allocation and hence creating many challenges for enhancing the users experience, network quality and throughput. Therefore in this paper, we proposed OCA based AIF model that can access the channel information and then it process to improve the RF channel association. The proposed OCA-AIF will function for each period when some interference is detected via AIF and we further extend this analysis by taking in to consideration the influence of interference to provide a high quality indicator in network. The analysis of result shows the optimization by our proposed approach which increases as per the increment of relay nodes (RNs).
Dynamic Topology Re-Configuration in Multihop Cellular Networks Using Sequent...IJERA Editor
Cellular communications has experienced explosive growth in the past two decades. Today millions of people around the world use cellular phones. Cellular phones allow a person to make or receive a call from almost anywhere. Likewise, a person is allowed to continue the phone conversation while on the move. Cellular communications is supported by an infrastructure called a cellular network, which integrates cellular phones into the public switched telephone network. The cellular network has gone through three generations.The first generation of cellular networks is analog in nature. To accommodate more cellular phone subscribers, digital TDMA (time division multiple access) and CDMA (code division multiple access) technologies are used in the second generation (2G) to increase the network capacity. With digital technologies, digitized voice can be coded and encrypted. Therefore, the 2G cellular network is also more secure. The third generation (3G) integrates cellular phones into the Internet world by providing highspeed packet-switching data transmission in addition to circuit-switching voice transmission. The 3G cellular networks have been deployed in some parts of Asia, Europe, and the United States since 2002 and will be widely deployed in the coming years. The high increase in traffic and data rate for future generations of mobile communication systems, with simultaneous requirement for reduced power consumption, makes Multihop Cellular Networks (MCNs) an attractive technology. To exploit the potentials of MCNs a new network paradigm is proposed in this paper. In addition, a novel sequential genetic algorithm (SGA) is proposed as a heuristic approximation to reconfigure the optimum relaying topology as the network traffic changes. Network coding is used to combine the uplink and downlink transmissions, and incorporate it into the optimum bidirectional relaying with ICI awareness. Numerical results have shown that the algorithms suggested in this thesis provide significant improvement with respect to the existing results, and are expected to have significant impact in the analysis and design of future cellular networks.
Efficient and stable route selection by using cross layer concept for highly...Roopali Singh
Efficient and stable route selection by using cross layer concept for highly mobile network with predictive features by Rupali Singh, Gajendra Singh Dhakad
published in International Journal of Research & Technology, Volume 3, Issue 4_November_2015
An energy aware scheme for layered chain in underwater wireless sensor networ...IJECEIAES
Extending the network lifetime is a very challenging problem that needs to be taken into account during routing data in wireless sensor networks in general and particularly in underwater wireless sensor networks (UWSN). For this purpose, the present paper proposes a multilayer chain based on genetic algorithm routing (MCGA) for routing data from nodes to the sink. This algorithm consists to create a limited number of local chains constructed by using genetic algorithm in order to obtain the shortest path between nodes; furthermore, a leader node (LN) is elected in each chain followed by constructing a global chain containing LNs. The selection of the LN in the closest chain to the sink is as follows: Initially, the closest node to sink is elected LN in this latter because all nodes have initially the same energy value; then the future selection of the LN is based on the residual energy of the nodes. LNs in the other chains are selected based on the proximity to the previous LNs. Data transmission is performed in two steps: intra-chain transmission and inter-chain transmission. Furthermore, MCGA is simulated for different scenarios of mobility and density of nodes in the networks. The performance evaluation of the proposed technique shows a considerable reduction in terms of energy consumption and network lifespan.
Wireless Sensor Networks (WSNs)have sensor nodes that sense and extract information from surrounding environment, processing information locally then transmit it to sink wirelessly. Multimedia data is larger in volume than scalar data, thus transmitting multimedia data via Wireless Multimedia Sensor Networks (WMSNs) requires stick constraints on quality of services in terms of energy, throughput and end to end delay.Multipath routing is to discover multipath during route discovery from source to sink. Discover multipath and sending data via these different paths improve the bandwidth and decrease the end to end delay. This paper introduces an Energy Location Aware Routing Protocol (ELARP) which is reactive multipath routing protocol establishing three paths with awareness of node’s residual energy and distance. ELARP has experimented with NS2 simulator. The simulation results show that ELARP enhances QoS for multimedia data in terms of end to end delay and packet delivery ratio.
The present paper describes a novel Raspberry Pi and Arduino UNO architecture used as a meteorological station. One of the advantages of the proposed architecture is the huge quantity of sensors developed for its usage; practically one can find them for any application, and weather sensing is not an exception. The principle followed is to configure Raspberry as a collector for measures obtained from Arduino, transmitting occurs via USB; meanwhile, Raspberry broadcasts them via a web page. For such activity is possible thanks to Raspbian, a Linux-based operating system. It has a lot of libraries and resources available, among them Apache Web Server, that gives the possibility to host a web-page. On it, the user can observe temperature, humidity, solar radiance, and wind speed and direction. Information on the web-page is refreshed each five minute; however, measurements arrive at Raspberry every ten seconds. This low refreshment rate was determined because weather variables normally do not abruptly change. As an additional feature, system stores all information on the log file, this gives the possibility for future analysis and processing.
Wireless Sensor Networks (WSNs)have sensor nodes that sense and extract information from surrounding environment, processing information locally then transmit it to sink wirelessly. Multimedia data is larger in volume than scalar data, thus transmitting multimedia data via Wireless Multimedia Sensor Networks (WMSNs) requires stick constraints on quality of services in terms of energy, throughput and end to end delay. Multipath routing is to discover multipath during route discovery from source to sink. Discover multipath and sending data via these different paths improve the bandwidth and decrease the end to end delay. This paper introduces an Energy Location Aware Routing Protocol (ELARP) which is reactive multipath routing protocol establishing three paths with awareness of node’s residual energy and distance. ELARP has experimented with NS2 simulator. The simulation results show that ELARP enhances QoS for multimedia data in terms of end to end delay and packet delivery ratio.
Multi Objective Salp Swarm based Energy Efficient Routing Protocol for Hetero...IJCNCJournal
Routing is a persistent concern in wireless sensor networks (WSNs), as getting data from sources to destinations can be a tricky task. Challenges include safeguarding the data being transferred, ensuring network longevity, and preserving energy in harsh environmental conditions. Consequently, this study delves into the suitability of using multi-objective swarm optimization to route heterogeneous WSNs in the hope of mitigating these issues while boosting the speed and accuracy of data transmission. In order to achieve better performance in terms of load balancing and reducing energy expenditure, the MOSSA-BA algorithm was developed. This algorithm combines the Multi-Objective Salp Swarm Algorithm (MOSSA) with the exploiting strategy of the artificial bee colony (BA) in the neighbourhood of Salps. Inspired by the SEP and EDEEC protocols, the integrated solutions of MOSSA-BA were used to route two and three levels of heterogeneous networks. The embedded solutions provided outstanding performance in regards to FND, HND, LND, percentage of remaining energy, and the number of packages delivered to the base station. Compared to SEP, EDEEC, and other competitors based on MOSSA and a modified multi-objective particle swarm optimization (MOPSO), the MOSSA-BA-based protocols demonstrated energy-saving percentages of more than 34% in medium-sized areas of interest and over 22% in large-sized areas of detection.
Multi Objective Salp Swarm based Energy Efficient Routing Protocol for Hetero...IJCNCJournal
Routing is a persistent concern in wireless sensor networks (WSNs), as getting data from sources to destinations can be a tricky task. Challenges include safeguarding the data being transferred, ensuring network longevity, and preserving energy in harsh environmental conditions. Consequently, this study delves into the suitability of using multi-objective swarm optimization to route heterogeneous WSNs in the hope of mitigating these issues while boosting the speed and accuracy of data transmission. In order to achieve better performance in terms of load balancing and reducing energy expenditure, the MOSSA-BA algorithm was developed. This algorithm combines the Multi-Objective Salp Swarm Algorithm (MOSSA) with the exploiting strategy of the artificial bee colony (BA) in the neighbourhood of Salps. Inspired by the SEP and EDEEC protocols, the integrated solutions of MOSSA-BA were used to route two and three levels of heterogeneous networks. The embedded solutions provided outstanding performance in regards to FND, HND, LND, percentage of remaining energy, and the number of packages delivered to the base station. Compared to SEP, EDEEC, and other competitors based on MOSSA and a modified multi-objective particle swarm optimization (MOPSO), the MOSSA-BA-based protocols demonstrated energy-saving percentages of more than 34% in medium-sized areas of interest and over 22% in large-sized areas of detection.
Wireless Sensor Networks (WSNs)have sensor nodes that sense and extract information from surrounding environment, processing information locally then transmit it to sink wirelessly. Multimedia data is larger in volume than scalar data, thus transmitting multimedia data via Wireless Multimedia Sensor Networks (WMSNs) requires stick constraints on quality of services in terms of energy, throughput and end to end delay.Multipath routing is to discover multipath during route discovery from source to sink. Discover multipath and sending data via these different paths improve the bandwidth and decrease the end to end delay. This paper introduces an Energy Location Aware Routing Protocol (ELARP) which is reactive multipath routing protocol establishing three paths with awareness of node’s residual energy and distance. ELARP has experimented with NS2 simulator. The simulation results show that ELARP enhances QoS for multimedia data in terms of end to end delay and packet delivery ratio.
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.
NO1 Uk best vashikaran specialist in delhi vashikaran baba near me online vas...Amil Baba Dawood bangali
Contact with Dawood Bhai Just call on +92322-6382012 and we'll help you. We'll solve all your problems within 12 to 24 hours and with 101% guarantee and with astrology systematic. If you want to take any personal or professional advice then also you can call us on +92322-6382012 , ONLINE LOVE PROBLEM & Other all types of Daily Life Problem's.Then CALL or WHATSAPP us on +92322-6382012 and Get all these problems solutions here by Amil Baba DAWOOD BANGALI
#vashikaranspecialist #astrologer #palmistry #amliyaat #taweez #manpasandshadi #horoscope #spiritual #lovelife #lovespell #marriagespell#aamilbabainpakistan #amilbabainkarachi #powerfullblackmagicspell #kalajadumantarspecialist #realamilbaba #AmilbabainPakistan #astrologerincanada #astrologerindubai #lovespellsmaster #kalajaduspecialist #lovespellsthatwork #aamilbabainlahore#blackmagicformarriage #aamilbaba #kalajadu #kalailam #taweez #wazifaexpert #jadumantar #vashikaranspecialist #astrologer #palmistry #amliyaat #taweez #manpasandshadi #horoscope #spiritual #lovelife #lovespell #marriagespell#aamilbabainpakistan #amilbabainkarachi #powerfullblackmagicspell #kalajadumantarspecialist #realamilbaba #AmilbabainPakistan #astrologerincanada #astrologerindubai #lovespellsmaster #kalajaduspecialist #lovespellsthatwork #aamilbabainlahore #blackmagicforlove #blackmagicformarriage #aamilbaba #kalajadu #kalailam #taweez #wazifaexpert #jadumantar #vashikaranspecialist #astrologer #palmistry #amliyaat #taweez #manpasandshadi #horoscope #spiritual #lovelife #lovespell #marriagespell#aamilbabainpakistan #amilbabainkarachi #powerfullblackmagicspell #kalajadumantarspecialist #realamilbaba #AmilbabainPakistan #astrologerincanada #astrologerindubai #lovespellsmaster #kalajaduspecialist #lovespellsthatwork #aamilbabainlahore #Amilbabainuk #amilbabainspain #amilbabaindubai #Amilbabainnorway #amilbabainkrachi #amilbabainlahore #amilbabaingujranwalan #amilbabainislamabad
HEAP SORT ILLUSTRATED WITH HEAPIFY, BUILD HEAP FOR DYNAMIC ARRAYS.
Heap sort is a comparison-based sorting technique based on Binary Heap data structure. It is similar to the selection sort where we first find the minimum element and place the minimum element at the beginning. Repeat the same process for the remaining elements.
NUMERICAL SIMULATIONS OF HEAT AND MASS TRANSFER IN CONDENSING HEAT EXCHANGERS...ssuser7dcef0
Power plants release a large amount of water vapor into the
atmosphere through the stack. The flue gas can be a potential
source for obtaining much needed cooling water for a power
plant. If a power plant could recover and reuse a portion of this
moisture, it could reduce its total cooling water intake
requirement. One of the most practical way to recover water
from flue gas is to use a condensing heat exchanger. The power
plant could also recover latent heat due to condensation as well
as sensible heat due to lowering the flue gas exit temperature.
Additionally, harmful acids released from the stack can be
reduced in a condensing heat exchanger by acid condensation. reduced in a condensing heat exchanger by acid condensation.
Condensation of vapors in flue gas is a complicated
phenomenon since heat and mass transfer of water vapor and
various acids simultaneously occur in the presence of noncondensable
gases such as nitrogen and oxygen. Design of a
condenser depends on the knowledge and understanding of the
heat and mass transfer processes. A computer program for
numerical simulations of water (H2O) and sulfuric acid (H2SO4)
condensation in a flue gas condensing heat exchanger was
developed using MATLAB. Governing equations based on
mass and energy balances for the system were derived to
predict variables such as flue gas exit temperature, cooling
water outlet temperature, mole fraction and condensation rates
of water and sulfuric acid vapors. The equations were solved
using an iterative solution technique with calculations of heat
and mass transfer coefficients and physical properties.
Immunizing Image Classifiers Against Localized Adversary Attacksgerogepatton
This paper addresses the vulnerability of deep learning models, particularly convolutional neural networks
(CNN)s, to adversarial attacks and presents a proactive training technique designed to counter them. We
introduce a novel volumization algorithm, which transforms 2D images into 3D volumetric representations.
When combined with 3D convolution and deep curriculum learning optimization (CLO), itsignificantly improves
the immunity of models against localized universal attacks by up to 40%. We evaluate our proposed approach
using contemporary CNN architectures and the modified Canadian Institute for Advanced Research (CIFAR-10
and CIFAR-100) and ImageNet Large Scale Visual Recognition Challenge (ILSVRC12) datasets, showcasing
accuracy improvements over previous techniques. The results indicate that the combination of the volumetric
input and curriculum learning holds significant promise for mitigating adversarial attacks without necessitating
adversary training.
Hybrid optimization of pumped hydro system and solar- Engr. Abdul-Azeez.pdffxintegritypublishin
Advancements in technology unveil a myriad of electrical and electronic breakthroughs geared towards efficiently harnessing limited resources to meet human energy demands. The optimization of hybrid solar PV panels and pumped hydro energy supply systems plays a pivotal role in utilizing natural resources effectively. This initiative not only benefits humanity but also fosters environmental sustainability. The study investigated the design optimization of these hybrid systems, focusing on understanding solar radiation patterns, identifying geographical influences on solar radiation, formulating a mathematical model for system optimization, and determining the optimal configuration of PV panels and pumped hydro storage. Through a comparative analysis approach and eight weeks of data collection, the study addressed key research questions related to solar radiation patterns and optimal system design. The findings highlighted regions with heightened solar radiation levels, showcasing substantial potential for power generation and emphasizing the system's efficiency. Optimizing system design significantly boosted power generation, promoted renewable energy utilization, and enhanced energy storage capacity. The study underscored the benefits of optimizing hybrid solar PV panels and pumped hydro energy supply systems for sustainable energy usage. Optimizing the design of solar PV panels and pumped hydro energy supply systems as examined across diverse climatic conditions in a developing country, not only enhances power generation but also improves the integration of renewable energy sources and boosts energy storage capacities, particularly beneficial for less economically prosperous regions. Additionally, the study provides valuable insights for advancing energy research in economically viable areas. Recommendations included conducting site-specific assessments, utilizing advanced modeling tools, implementing regular maintenance protocols, and enhancing communication among system components.
Saudi Arabia stands as a titan in the global energy landscape, renowned for its abundant oil and gas resources. It's the largest exporter of petroleum and holds some of the world's most significant reserves. Let's delve into the top 10 oil and gas projects shaping Saudi Arabia's energy future in 2024.
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
Multihop Multi-Channel Distributed QOS Scheduling MAC Scheme for Wireless Sensor Networks
1. IOSR Journal of Computer Engineering (IOSR-JCE)
e-ISSN: 2278-0661,p-ISSN: 2278-8727, Volume 17, Issue 2, Ver. 1 (Mar – Apr. 2015), PP 01-10
www.iosrjournals.org
DOI: 10.9790/0661-17210110 www.iosrjournals.org 1 | Page
Multihop Multi-Channel Distributed QOS Scheduling MAC
Scheme for Wireless Sensor Networks
Kumaraswamy M1
, Shaila K2
, Tejaswi V2
, Venugopal K R2
, S S Iyengar3
and L
M Patnaik4
1
(Department of Computer Science and Engineering, University Visvesvaraya College of Engineering,
Bangalore University, Bangalore 560 001, India)
1
(Research Scholar, Department of Computer Science and Engineering, JNTU Hyderabad, India)
2
(Department of Computer Science and Engineering, University Visvesvaraya College of Engineering,
Bangalore University, Bangalore 560 001, India)
3
(Director and Ryder Professor Florida International University, USA)
4
(Honorary Professor Indian Institute of Science Bangalore, India)
Abstract: In this paper, we propose a Multihop Multi-Channel Distributed QoS Scheduling MAC scheme
(MMDQS-MAC) to improve the network performance of WSNs, which selects the best channel for an individual
wireless sensor node. MMDQS-MAC supports dynamic channel assignment mechanism where each sensor node
is equipped with a directional antennas. The proposed protocol helps to decrease the probability of collision,
interferences and improves the overall network performance of Wireless Sensor Networks (WSNs). The protocol
is most suitable for short packet transmission under low traffic networks and has ability to utilize parallel
transmission among neighboring nodes and achieves increased energy efficiency when multi-channels are
available. Simulation result shows that the proposed protocol improves the performance of aggregate
throughput, probability of successful transmission, packet delivery ratio, energy consumption and average end-
to-end delay.
Keywords: Medium Access Control (MAC); Quality of Service (QoS); Wireless Sensor Networks (WSNs);
Multi-Channel (MC)
I. Introduction
Wireless Sensor Networks (WSNs) has low-cost, low-power transceivers, processors and
multifunctional sensor nodes, that are small in size and communicate over short distances with capability of
sensing various types of physical and environmental conditions. These tiny sensors have sensing, data
processing and communication devices, which are capable to communicate over wireless on multihops with
their neighbouring sensor nodes [1]. WSNs are being designed and developed for specific purpose which
depends on a variety of different applications including military, environment monitoring, health, surveillance,
industry, smart buildings, medical care and home applications [2].
Due to the half-duplex property of the sensor radio and the broadcast nature of wireless medium,
limited bandwidth remains a issue for Wireless Sensor Networks. MAC protocols have direct impact on the
utilization of channels, Quality of Service (QoS) of the entire network and node battery life. The bandwidth
problem is more serious for multihop WSNs due to interference between successive hops on the same path as
well as the neighboring paths. As a result, conventional single channel Medium Access Protocol (MAC)
protocol cannot adequately support the bandwidth requirements.
In this paper, we design the use of multi-channel MAC protocols to improve the achievable throughput
of WSNs. The typical WSNs radio operate on a limited bandwidth, the operating frequency of the radio can be
adjusted over different channels. Once different channels are assigned to contending links, more parallel
transmissions can take place and more data can be delivered to the sink node in shorter intervals [3] such as
home applications, military, industrial and health care. The primary goal of this work is to reduce the channel
access time of a sensor node when the medium is busy, utilize the available multi-channels as much as possible
and improve the overall network performance.
Motivation
In this paper, we have a concept of Multi-channel MAC schemes for a potential of increasing the
capacity of wireless access control mechanisms. In multi-channel access mechanism wireless links occupied by
different transmissions can maintain active at the same time without collision. This mechanism assigns each
channel a pre-determined and fixed length of the wireless bandwidth resource. Such multi-channel scheduling
MAC assignment can eliminate the interference among different channels and therefore, no collision in the
2. Multihop Multi-Channel Distributed QOS Scheduling MAC Scheme for Wireless Sensor Networks
DOI: 10.9790/0661-17210110 www.iosrjournals.org 2 | Page
MAC layer. With this each node can only transmit at the pre-assigned set of slots. The collision avoidance is the
improvement of effective channel utilization, packet delivery ratio, saving energy and average end-to-end delay.
Contribution
We present a MMDQS-MAC multi-channel protocol with a fully distributed scheduling mechanism
that does not require a centralized scheduler. The protocol is a multi-channel MAC protocol specially designed
for WSNs, in which each sensor node is equipped with a directional antennas and the MAC layer packet size is
very small. The main contribution of the proposed protocol is that it successfully exploits multi-channels to
improve WSNs performance in terms of aggregate throughput, packet delivery ratio, probability of successful
transmission, energy consumption and average end-to-end delay.
Organization
The organization of this paper is as follows. Related Work is discussed in Section II, while Background
is reviewed in Section III. Problem is defined in Section IV and System Model is described in Section V.
Mathematical Model is derived in Section VI and Performance Evaluation is analyzed in Section VII.
Conclusions are presented in Section VIII.
II. Related Work
Ye et al., [4] designed a static-scheduling based energy saving S-MAC protocol that allows
neighboring nodes to sleep for long periods and wake up in sensor networks. It uses periodic listen and sleep,
the collision avoidance facilities of 802.11 and over-hearing avoidance to reduce energy consumption. Cuomo et
al., [5] provide contention minimized random access that combine CSMA with any multiple access scheme such
as frequency division multiple access (FDMA), code division multiple access (CDMA), TDMA. Jain et al., [6]
proposed a multi-channel MAC protocols; the multiple orthogonal channels are provided by frequency division
and develop a suite of protocols to exploit channel diversity to achieve higher throughput.Wu et al., [7]
described the effective use of multiple channels by having a separate channel for reservation. This extends the
idea of using short slots in contention mode to reserve longer non-contending slots for the data.
Garces et al., [8] presented a model where a mobile host can only access one channel at a time. This is
not necessarily equivalent to the single-channel model, because the transceiver is still capable of switching from
one channel to another. The transceiver can be simplex or duplex. Wu et al., [9] proposed a multi-channel MAC
protocol called Dynamic Channel Assignment (DCA), which is degree independent and does not require any
form of clock synchronization among mobile hosts. Chen et al., [10] presented a Multi-channel Access Protocol
(MAP) as an example of channel hopping, in which time is slotted and nodes hop through all the channels
following a common schedule or their respective pseudo random schedules. If a node wants to communicate
they successfully exchange control information and stay on that channel to complete the data transfer.
Yang et al., [11] proposed Contention-Aware Admission Control (CACP) Protocol that considers the
contention among flows within a node’s interference range and uses on-demand resource discovery-based
scheme to provide QoS assurances. Chakeres et al., [12] addressed the Perceptive Admission Control (PAC)
admission control problem by monitoring the wireless channel using channel busy time and dynamically
adapting admission control decisions to enable high network utilization while preventing congestion. However,
this protocol does not consider intra-flow interference when making admission decisions. Dapeng Wu et al.,
[13] guarantees a QoS of data rate, error rate and delay bound for delay sensitive applications. The effective
capacity (EC) is a promising technique for analyzing the statistical QoS performance of wireless networks
where the service process is regarded as a time-varying wireless channel. A pure queuing model was considered,
assuming ideal rate adaptive channel codes achieving the instantaneous Shannon capacity, where the effect of
channel variations on link performance was captured by a single function called Effective Capacity. In reality,
one needs to consider not only the ideal queuing model, but also an explicit physical layer model for channel
coding.
Cho et al., [14] proposed a variable bandwidth allocation scheme using time-frequency slot allocation
to reduce the energy consumption of a collaborative sensor network. Chen et al., [15] designed a Coordinator-
based Multi-Channel MAC (MCMAC) that assumes nodes belonging the same cluster are synchronized. In
addition, a cluster comprises not more than 64 sensor nodes. Cluster Heads (CHs) can communicate with each
other at stronger power, where one of the available channels is used as control channel; the control channel can
be operated to exchange the control packets and data packets. Salajegheh et al., [16] focused on Hybrid MAC
protocol, to provide high throughput and small bounded end-to-end delay for the packets exchanged between
each node and the sink. HyMAC is a combination of TDMA and FDMA protocols in which data gathered by
sensor nodes has to be delivered to at least one sink node in a timely manner. Le et al., [17] proposed the
general-purpose Multi-channel that assigns a home frequency to each node such that network throughput is
maximized.
3. Multihop Multi-Channel Distributed QOS Scheduling MAC Scheme for Wireless Sensor Networks
DOI: 10.9790/0661-17210110 www.iosrjournals.org 3 | Page
Wu et al., [18] is a Tree-based Multi-Channel Protocol TMCP for data collection applications in
WSNs. The main idea of TMCP protocol is to partition the whole network into multiple vertex-disjoint sub-trees
rooted at the base station. Different channels are allocated to each subtree and each flow is forwarded only along
its corresponding sub-tree. TMCP tries to keep away from complex coordination methods by reducing channel
switching and communication among the nodes. Chen et al., [19] proposed a Multipath Fairness Solution (MFS)
that redistributes network bandwidth from high rate data sources to low-rate sources as long as they share
common routing paths. MFS is easy to implement, which is advantageous in a resource scarce sensor network.
More importantly, it achieves much higher network throughput and better fairness among the flows.
Yang et al., [20] designed a Tree-based MAC protocol for Reliable Data Collection in WSNs in
scenarios with Radio Frequency (RF) interference. It uses local TDMA and Frequency Hopping Spread
Spectrum (FHSS) together. The FHSS scheme is used to decrease collisions, enhance throughput and avoid RF
interference. In this scheme every hopping sequence is obtained by cyclic shifting a standard hopping sequence
that is generated by interleaving a normal sequence with a S-random interleaver. Lohier et al., [21] proposed a
Multichannel Access for Sensor Networks (MASN) protocol that improves the global throughput to satisfy high
bandwidth requirements for applications like monitoring or traffic control. It uses multiple channels on current
low-cost, low-energy radio transceivers to increase the number of parallel transmissions between different pairs
of transceivers. It improves the global throughput depending on the scenario compared to the distributed channel
allocation. Hung et al., [22] proposed a multihop MAC protocol called Bandwidth Utilization and Fairness
Enhancements Medium Access Control (BUFE MAC), which increases the bandwidth utilization, maintaining
fairness and avoiding collision. The performance of the proposed MAC protocol not only avoids the collision
but improves the end-to-end throughput.
III. Background
Zhou et al., [23] designed a Multi-Frequency Media Access Control (MMSN) for WSNs. It is a slotted
CSMA protocol in which at the beginning of each time slot, nodes need to contend for the medium before they
can transmit. MMSN assigns channels to the receivers; when a node intends to transmit a packet it has to listen
for the incoming packets both on its own frequency and the destinations frequency. MMSN uses a special
broadcast channel for the broadcast traffic and the beginning of each time slot is reserved for broadcasts, which
requires a dedicated broadcast channel.
Satish et al., [24] proposed an Opportunistic Multi-Channel MAC (OMC-MAC) protocol for
distributed Cognitive Radio (CR) networks that provide a QoS assurance to the prioritized Secondary Users
(SUs) such as SU with delay sensitive applications in a highly dynamic CR environment. Incel et al., [25]
proposed Multi-Channel Lightweight MAC protocol (MC-LMAC), that uses a semi-dynamic channel
assignment approach for channel allocation. The proposed protocol overhead is significantly high. MC-LMAC
achieves interference free and collision-free parallel transmissions over multi-channels. Time is slotted; each
node is assigned the control over a time slot to transmit on a particular channel. The performance of MC-LMAC
provide a high throughput and high delivery ratio by coordinating multi-channel transmissions.
IV. Problem Definition
The proposed protocol MMDQS-MAC is a schedule-based multi-channel MAC protocol with
minimum communication overhead. The sensor nodes and sink node are all equipped with directional antennas.
Each timeslot is designed to accommodate data to transmit in multihop and receive by sink node in WSNs.
Hence, the allocation of timeslots directly influences the network performance. The maximum throughput can
reach only if the sink node is busy with receiving packets and if the schedules of all nodes are aligned for
interference-free communication when several transmissions run simultaneously for the given network
topology. Multi-channel allows parallel transmissions within a sensor network, which results in increased
throughput, decreased collision probability and improves energy efficiency. The main objectives of the proposed
work is to
1. Maximize the aggregate throughput.
2. Align the nodes for interference-free communication.
3. Guarantee QoS.
A. Assumptions
i. All sensor nodes are equipped with a directional antennas.
ii. All sensor nodes are stationary.
iii. Sensor nodes can choose an arbitrary transmit power for each data transmission.
4. Multihop Multi-Channel Distributed QOS Scheduling MAC Scheme for Wireless Sensor Networks
DOI: 10.9790/0661-17210110 www.iosrjournals.org 4 | Page
V. System Model
In Figure 1, we consider a multi-channel static Wireless Sensor Network, where each sensor node is
equipped with a directional antennas and a data collection sink node. There are S non-overlapping channels
having the same bandwidth in WSNs and transmit data packet on one of these channels at a time. Each sensor
node in WSNs use the same fixed transmission range and a fixed interference range. In this section, we analyse
the MMDQS-MAC protocol, that carefully schedules packet transmissions to avoid collisions at the MAC layer
and utilize the multi-channels to maximize parallel transmission among neighboring sensor nodes in multihop.
Each sensor node initially operates on the default channel to allow initial synchronization and discovery of
neighbours. Time synchronization is performed periodically by generating beacon frames. The beacon frames
are broadcast during the Contention Period (CP). The frame format of MMDQS-MAC protocol is divided into
two time periods as shown in Figure 2.
Fig. 1. Sensor Nodes and a Sink Node are Scheduling using Multi-Channel for Data Collections
Fig. 2. The Frame Structure of MMDQS-MAC Protocol
The proposed protocol is based on a combination of Contention Period (CP) and Non Contention
Period (NCP) based techniques. In the MMDQS-MAC protocol, the CP is of fixed length frames composed of a
specified number of time slots and the period of NCP is dependent on the contention resolution of CP. All
deployed sensor nodes are enforced to listen to the results of contentions in CP to provide collision-free
operation. Excellent energy efficiency is achieved due to the minimization of idle listening and overhearing. The
schedule of each sensor node is traffic adaptive and contend for channel access when they have packets in their
queue. The sending source node stays on the contention channel during a CP time. When a source node wants to
access the medium, it must receive the beacon frame before contending medium access channel. The purpose of
the contending channel is to resolve the contention of data channels and assign data channels to sensor nodes.
VI. Mathematical Model
In this paper, we analyse the MMDQS-MAC protocol for multichannel WSNs performance. The
notations are defined in Table I. Let Tsuc denote the time period of successful transmission, consisting of time
period of RTS/CTS/SIFS packet, a data packet (tD) followed by the propagation delay (δ) across the channel.
Therefore,
Tsuc = tRTS + tSIFS + tCTS + tD + 2 δ (1)
Let Tfail an unsuccessful transmission time period consists of RTS packet delay, propagation delay due
to collision. Therefore, the duration of the average failed transmission time period is,
Tfail = tRTS + δ (2)
We assume that the packet arrival time at a queue in each node is a Poisson process. Under this
assumption, Poisson statistics state that the probability Psuc(t) of exactly y packets arriving in a time period t per
each node is given by
Psuc(t) =( λt)y
e(-λt)
/ y! (3)
5. Multihop Multi-Channel Distributed QOS Scheduling MAC Scheme for Wireless Sensor Networks
DOI: 10.9790/0661-17210110 www.iosrjournals.org 5 | Page
where λ represents the mean packet arrival rate of a sensor node. Let PchI(t) denote the probability of a
node successfully sensing a channel idle in time interval t. In other words, the PchI(t) is the probability that a
node detects that no other node is transmitting data in the network during the observing time interval t and can
be derived as
PchI(t) = e(-βt)
(4)
where β = Nλ is the total packet arrival rate in the network. By considering the propagation delay, the
channel capacity wasted (CHwa) due to collision of two RTS control packets that are partially overlapping with
each other can be derived by the following equation:
CHwa = δ - (1 - e-βδ
)/β (5)
Therefore, the average channel busy time CHavgB in a CP is given by
CHavgB = CHwa + Tfail (1 - PchI(t)) + Tsuc PchI(t) (6)
The expected duration of idle time between two consecutive busy time is 1/ β. Once a sensor node has
a packet to transmit, it first senses the idle channel for a Distributed Coordination Function Inter Frame Space
(DIFS) period and then chooses a random backoff time for counting down. The random backoff probability PAB
equation can be expressed as
PAB = CHavgB * [1/β + CHavgB + DIFS + BW/2]-1
(7)
where BW/2 is the mean value of the first backoff countdown. where BW/2 is the mean value of the
first backoff countdown. In this work, we assume the minimum backoff window size BW = 32α and the
maximum window size of 1024α, where α is the time allocation of a slot (20μs).
The Pwp is the probability that there are no arrivals during the waiting time. The length of an average waiting
time is η seconds, expressed as
Pwp = e-βη
(8)
When a sensor node completes its backoff countdown, it transmits without any delay sending the RTS
packet. Psuc is the successful probability of a node which has transmitted data in time Tsuc. The probability
(1−Psuc ) is the transmitting node failure time Tfail in the backoff period. The probability Psuc of a sensor node
that sends RTS packet successfuly without colliding with any other neighbors within δ seconds can be
expressed as
Psuc = e-βδ
(9)
(i) Average delay: We can compute the expected average contention delay of a RTS/CTS handshake protocol.
We can obtain an expression for the average contention access MAC delay TDelay as given below
TDelay = PAB (CHavgB / 2) + (1 − PAB) (DIFS + BW/2) (10)
(ii) Aggregate Throughput: The aggregate throughput of proposed protocol MMDQS-MAC can be computed as
follows. From the results of the derived contention delay, the number of successful reservations (Rsuc) in a given
CP is as follows
Rsuc = CP/ TDelay (11)
Based on value Rsuc, we can estimate the network throughput NT, which is defined as the total quantity of
successfully transmitted data over the capacity of all channels within the Tperiod. Let L be the mean length of the
data frame. Then, the total quantity of transmitted data in the NCP is given by Rsuc * L and the throughput is
obtained as given below
NT = (Rsuc * L / Tperiod * S) * d (12)
In MMDQS-MAC, the Tperiod consists of the CP and NCP periods and d is the data rate, since they are non-
overlapping and hence Tperiod = CP + NCP. Assuming all successful reservations are arranged of all channels
ideally, the length of NCP in MMDQS-MAC is
NCP = (Rsuc /S) * TaP (13)
Where TaP is the average transmission period of a request and is equal to ( l + 2δ + SIFS + ACK).
Table :1 Notations
Symbols Meaning
CP Contention Period
NCP Non Contention Period
Tsuc Time period of successful transmission
tD Time period of data packet
S Number of non-overlapping channels
y Packets arriving in a time period t
d Data rate
6. Multihop Multi-Channel Distributed QOS Scheduling MAC Scheme for Wireless Sensor Networks
DOI: 10.9790/0661-17210110 www.iosrjournals.org 6 | Page
Symbols Meaning
δ Propagation delay
Tfail Time period of unsuccessful transmission
Psuc Successful probability of a node
TDelay Average contention access MAC delay
tRTS Time period of Request-To-Send
tCTS Time period of Clear-To-Send
tSIFS Time period of Short Inter-Frame Space
CHavgB Average channel busy time
VII. Performance Evaluation
A. Simulation Setup
The performance of MMDQS-MAC protocol was evaluated by conducting simulations on the NS2
simulator comparing with MC-LMAC and MMSN. We consider five important performance metrics: (i)
aggregate throughput, (ii) probability of successful transmission, (iii) packet delivery ratio, (iv) energy
consumption and (v) average end-to-end delay. We compare our MMDQS-MAC protocols results with the MC-
LMAC and MMSN protocols. In our simulation model, we assume a multi-hop network environment, where
100 sensor nodes are randomly distributed over a 200m x 200m terrain size and simulation run for 900 sec. We
assume that network topology is static and the radio range of all sensor nodes are same. A free space
propagation channel model is assumed with the capacity set to 250 Kbps.
It is observed in Figure 3, that the aggregate throughput increases from 1100 bytes to a maximum of
1655 bytes with the increase in contention length period from 4 to 24. Our protocol gives an throughput of 10%
greater than MCLMAC and MMSN. This is an account of efficient allocation of channels and minimization of
contention period. Beyond the contention length of 24, the aggregate output of all the channels decrease. This is
due to the non optimal allocation of channels as well as the increase in the overhead of the contention length
period.
Fig. 3. Aggregate Throughput (kbps) with Number of Contention Length for different S Channels
Simulation results of successful transmission rate is shown in Figure 4 for varying number of channels
S. The packet transmission rate increases with increase in the number of channels. The packet transmission rate
decreases with the increase in the packet arrival rate, though there is a slight increase with larger number of
available channels. We plot the probability of successful transmission of an arriving packet for S = 3, 6 and 10
channels versus packet arrival rate, under ideal carrier sensing conditions, the probability of successful
transmission access is available for any one of S channels. However, the rate of improvement reduces when S is
large. The accurate calculation of the probability of successful transmission depend on the available channel
selection used in the sensor network.
7. Multihop Multi-Channel Distributed QOS Scheduling MAC Scheme for Wireless Sensor Networks
DOI: 10.9790/0661-17210110 www.iosrjournals.org 7 | Page
Fig. 4. Simulation results of Probability of Successful Transmission with Packet Arrival Rate (packets/sec) for
different S Available Channels
Figure 5 shows the aggregate throughput with respect to the number of available channels. Output in
MMDQS-MAC is much higher than MC-LMAC and MMSN. Initially, at lower number of channels, the
MMDQS-MAC utilizes the channel much more efficiently reducing multihop collision and guaranteeing
network connectivity. As the number of channels increase, channels may not be utilized completely, though
there is increase in output. In MMDQS-MAC, the output is better due to contention based channel allocation in
conjunction with channel load distribution. The output is 1655 bytes at the sink while it 1500 bytes in MC-
LMAC and 1180 bytes in MMSN.
Fig. 5. Aggregate Throughput (kbps) with different Number of Available Channels
Figure 6 shows the results of packet delivery ratio with available channels, which is the ratio between
the number of packets received at the sink and total number of packets generated by the sensor nodes. With
sufficient data channels, MMDQS-MAC delivers on the average 99% of the packets. As we mentioned, the
small percentage of losses is due to the collision. However, with a smaller number of data channels, the packet
delivery ratio is rather limited since most of the nodes do not get a free timeslot. On the other hand, contention
based MMSN protocol saturates around 70% packet delivery ratio with the increasing number of data channels.
Figure 7 shows the average end-to-end packet delay which is the time between the transmission of a
packet at the source node and reception at the sink node. Our proposed MMDQS-MAC protocol achieves much
lower delay than the MC-LMAC and MMSN protocol. Unlike the MC-LMAC, our protocol has decreasing end-
to-end delay with the increase in number of data channels. This is because the average delay from source to the
sink is influenced by the size of a frame in MMDQS-MAC protocol. Furthermore, decreasing the frame size
does not reduce the delay since the number of packets that can be delivered per timeslot also decreases as the
packets are buffered and transmitted later. As observed in Figure 7, there is a huge improvement in delay
between our protocol and MC-LMAC.
8. Multihop Multi-Channel Distributed QOS Scheduling MAC Scheme for Wireless Sensor Networks
DOI: 10.9790/0661-17210110 www.iosrjournals.org 8 | Page
Fig. 6. Packet Delivery Ratio with different Number of Available Channels
Fig. 7. End-to-End Packet Delay with different Number of Available Channels
Fig. 8. Energy Consumption per Successfully Delivered Packet with different Numbers of Available Channels
Figure 8 shows the results of energy-efficiency per successfully delivered packet. We consider both the
energy spent to receive and transmit as well as the energy spent for relaying the packet towards the sink node.
Energy spent per delivered packet is quite high with MC-LMAC when there is only a single channel. This is due
to the very low delivery rate. As the number of data channels increase, the proposed MMDQS-MAC protocol
spends much less energy than other protocols i.e., MC-LMAC and MMSN. Although MMSN consumes much
lower energy when compared to MC-LMAC protocol in the case of first and second channels, our protocol is
more energy efficient than other two protocols. This is because our protocol has much lower collisions
compared to the existing ones and excellent energy efficiency is achieved due to the minimization of idle
listening and overhearing. As the number of channels increase and with low load, packet contention reduces
rapidly and therefore energy consumption almost remains the same in all the scheme.
9. Multihop Multi-Channel Distributed QOS Scheduling MAC Scheme for Wireless Sensor Networks
DOI: 10.9790/0661-17210110 www.iosrjournals.org 9 | Page
Fig. 9. Aggregate Throughput (kbps) with different Number of Sources Nodes
As shown in Figure 9, the use of 10 multi-channels achieves higher throughput. The number of sensor
nodes are varied from 10 to 100. The MMDQS-MAC protocol allocates small slots to all the sensor nodes;
hence there is maximum aggregate throughput due to large number of sensor nodes participation in scheduling
mechanism in comparison with MC-LMAC and MMSN.
Figure 10 compares channel utilizations of MMDQS-MAC, MC-LMAC and MMSN, with varying the
number of available channels. The channel utilization is higher for MMDQS-MAC than for the other protocols.
The Proposed protocol MMDQS-MAC utilizes all ten channels, for the given traffic load. While, MMSN has
peak utilization at four channels and MC-LMAC reaches maximum utilization at six channels.
Fig. 10. Channel Utilization with Number of Available Channels
In Figures 11, we have analyzed the performance of the channel access delay with number of available
channels. In the MMDQS-MAC protocol, nodes only transmit to neighboring nodes within range. This
comparison is aimed at determining the efficiency in relation to channel access delay based on distance between
nodes and varying data rates. We observe that channel access delay of MMDQS-MAC is much better than MC-
LMAC and MMSN. When the number of available channels increase from 1 to 10, the average channel access
delay in MMDQS-MAC decreases from 0.05s to 0.012s. The channel access delay decreases from 0.08s to
0.015s in MMSN protocol and it is still higher than our protocol. The MMDQS-MAC uses a small packet size
of 32 to 50 bytes, which contributes to improved performance and hence outperforms the other two protocols.
VIII. Conclusions
In this paper, we have designed MMDQS-MAC for efficient QoS Multi-Channel Scheduling protocol
for WSNs that carefully schedules message transmission to avoid collisions at the MAC layer. The MMDQS-
MAC takes advantage of control slot in Contention Period (CP) and groups data transmission in Non-Contention
Period (NCP) to maximize the simultaneous transmission among neighboring sensor nodes without collision.
The sender node sends a beacon message to the schedule system requesting for transmitting data packet in
parallel on different channels without disturbing other data transmission. Simulation results show that MMDQS-
MAC successfully exploits multi-channels to improve overall network performance in terms of aggregate
throughput, channels access, packet delivery ratio, average delay and energy consumption over MC-LMAC and
MMSN in WSNs. The work can be extended with different node densities in WSNs.
10. Multihop Multi-Channel Distributed QOS Scheduling MAC Scheme for Wireless Sensor Networks
DOI: 10.9790/0661-17210110 www.iosrjournals.org 10 | Page
Fig. 11. Average Channel Access Delay
References
[1]. Stallings and William, “Wireless Communications and Networks,” Second Edition New Jersey, Pearson Education International,
2005.
[2]. I. F. Akyildiz, W. Su, Y. Sankarasubramaniam and E. Cayirci, “A Survey on Sensor Networks,” In IEEE Communication
Magazine, vol. 40, no. 8, pp. 102–114, August 2002.
[3]. D. Cruller, D. Estrin and M. Srivastava, “Overview of Sensor Networks,” In IEEE Computer, vol. 37, no. 8, pp. 41–49, August
2004.
[4]. W. Ye, J. Heidemann and D. Estrin, “An Energy-Efficient MAC Protocol for Wireless Sensor Networks,” In proceedings of 21st
IEEE INFOCOM, New York, pp. 1567–1576, June 2002.
[5]. F. Cuomo, A. Baiocchi and R. Cautelier, “A MAC Protocol for a Wireless LAN based on OFDM-CDMA,” In IEEE
Communications Magazine, vol. 38, no. 9, pp. 152–159, September 2000.
[6]. N. Jain, S. Das and A. Nasipuri, “A Multi-Channel CSMA MAC Protocol with Multiple Receiver-Based Channel Selection for
Multi-Hop Wireless Networks,” In Proceedings of IEEE 10th International Computer Communications and Networks (ICCCN), pp.
432–439, October 2001.
[7]. S. Wu, C. Lin, Y. Tseng and J. Sheu, “A Dynamic Multi-Channel MAC for Ad-Hoc LAN,” In Proceedings of International
Symposium on Parallel Architectures, pp. 232–233, December 2000.
[8]. R. Garces and J. J. Garcia Luna Aceves, “Collision Avoidance and Resolution Multiple Access for Multichannel Wireless
Networks,” In Proceedings of IEEE INFOCOM, vol. 2, pp. 595–602, March 2000.
[9]. S. L. Wu, C. Lin, Y. Tseng and J. Sheu, “A New Multi-channel MAC Protocol with On-Demand Channel Assignment for Mobile
AdHoc Networks,” In Proceedings of International Symposium on Parallel Architectures, pp. 232–237, December 2000.
[10]. J. Chen, S. Sheu, and C. Yang, “A New Multichannel Access Protocol for IEEE 802.11 Ad Hoc Wireless Lans,” In Proceedings of
IEEE 14th Personal, Indoor and Mobile Radio Communications (PIMRC), vol. 3, pp. 2291–2296, September 2003.
[11]. Y. Yang and R. Kravets, “Contention-Aware Admission Control for Ad Hoc Networks,” In IEEE Transactions on Mobile
Computing, vol. 4, no. 4, pp. 363–377, August 2005.
[12]. I. D. Chakeres and E. M. Belding Royer, “PAC: Perceptive Admission Control for Mobile Wireless Networks,” In Proceedings of
IEEE Quality of Service in Heterogeneous Wired/Wireless Networks (QSHINE), pp. 18–26, October 2004.
[13]. Dapeng Wu, R. Negi, “Effective Capacity: A Wireless Link Model for Support of QoS,” In IEEE Transactions on Wireless
Communications, vol. 2, no. 4, pp. 630–643, July 2003.
[14]. SeongHwan Cho and Kee-Eung Kim, “Variable Bandwidth Allocation Scheme for Energy Efficient Wireless Sensor Network,” In
Proceedings of IEEE ICC, vol. 5, pp. 3314–3318, May 2005.
[15]. X. Chen, P. Han, Q.S. He, S. L. Tu and Z. L. Chen, “A Multichannel MAC Protocol for Wireless Sensor Networks,” In Proceedings
of Sixth IEEE International Conference on Computer and Information Technology (CIT), pp. 224–230, September 2006.
[16]. M. Salajegheh, H. Soroush and A. Kalis, “HYMAC: Hybrid TDMA/FDMA Medium Access Control Protocol for Wireless Sensor
Networks,” In Proceedings of 18th IEEE International Symposium on Personal, Indoor and Mobile Radio Communications
(PIMRC), pp. 1–5, September 2007.
[17]. H. K. Le, D. Henriksson and T. Abdelzaher, “A Practical Multi-channel Media Access Control Protocol for Wireless Sensor
Networks,” In Proceedings of IEEE International Conference on Information Processing in Sensor Networks (IPSN), pp. 70–81,
April 2008.
[18]. Y. Wu, J. A. Stankovic, T. He and S. Lin, “Realistic and Efficient Multi-Channel Communications in Wireless Sensor Networks,”
In Proceedings of 27th IEEE INFOCOM, pp. 1867–1875, April 2008.
[19]. Y. Jian, S. Chen and Y. Ling, “Fair End-to-End Bandwidth Distribution in Wireless Sensor Networks,” In Proceedings of IEEE
Communications Society, pp. 1–5, May 2010.
[20]. Y. Yang and W. Yi, “Rainbow: Reliable Data Collecting MAC Protocol for Wireless Sensor Networks,” In Proceedings of IEEE
Wireless Communications and Networking Conference (WCNC), pp. 1–6, April 2010.
[21]. S. Lohier, A. Rachedi, I. Salhi and E. Livolant, “Multichannel Access for Bandwidth Improvement in IEEE 802.15.4 Wireless
Sensor Networks,” In Proceedings of IEEE Conference on Wireless Days (WD), pp. 1–6, October 2011.
[22]. L. Hung, C. Chang, C. Chen and Yu-Chieh Chen, “BUFE-MAC: A Protocol with Bandwidth Utilization and Fairness
Enhancements for Mesh-Backbone-Based VANETs,” In IEEE Transactions on Vehicular Technology, vol. 61, no. 5, pp. 2208–
2221, June 2012.
[23]. G. Zhou, C. Huang, T. Yan, T. He, J. Stankovic and T. Abdelzaher “MMSN: Multi-Frequency Media Access Control for Wireless
Sensor Networks,” In Proceedings of 25th IEEE INFOCOM, pp. 1–13, April 2006.
[24]. C. Satish Jha, U. Phuyal, M. M. Rashid and V. K. Bhargava, “Design of OMC-MAC: An Opportunistic Multi-Channel MAC with
QoS Provisioning for Distributed Cognitive Radio Networks,” In IEEE Transactions on Wireless Communications, vol. 10, no. 10,
pp. 3414–3425, October 2011.
[25]. O. D. Incel, L. V. Hoesel, P. Jansen and P. Havinga, “MC-LMAC: A Multi-Channel MAC Protocol for Wireless Sensor Networks,”
In Journal Ad Hoc Networks, ACM Digital Library, vol. 9, no. 1, pp. 73–94, January 2011.