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.
Priority based bandwidth allocation in wireless sensor networksIJCNCJournal
Most of the sensor network applications need real time communication and the need for deadline aware real time communication is becoming eminent in these applications. These applications have different dead line requirements also. The real time applications of wireless sensor networks are bandwidth sensitive and need higher share of bandwidth for higher priority data to meet the dead line requirements. In this paper we focus on the MAC layer modifications to meet the real time requirements of different priority data.Bandwidth partitioning among different priority transmissions is implemented through MAC layer modifications. The MAC layer implements a queuing model that supports lower transfer rate for lower
priority packets and higher transfer rate for real
time packets with higher priority, minimizing the end to
end delay. The performance of the algorithm is evaluated with varying node distribution
.
Evaluation of Energy Consumption using Receiver–Centric MAC Protocol in Wirel...IJECEIAES
At present day’s wireless sensor networks, obtain a lot consideration to researchers. Maximum number of sensor nodes are scattered that can communicate with all others. Reliable data communication and energy consumption are the mainly significant parameters that are required in wireless sensor networks. Many of MAC protocols have been planned to improve the efficiency more by enhancing the throughput and energy consumption. The majority of the presented medium access control protocols to only make available, reliable data delivery or energy efficiency does not offer together at the same time. In this research work the author proposes a novel approach based on Receiver Centric-MAC is implemented using NS2 simulator. Here, the author focuses on the following parametric measures like - energy consumption, reliability and bandwidth. RC-MAC provides high bandwidth without decreasing energy efficiency. The results show that 0.12% of less energy consumption, reliability improved by 20.86% and bandwidth increased by 27.32% of RC-MAC compared with MAC IEEE 802.11.
Energy efficient mac protocols for wireless sensor networkijcsa
Wireless sensor network are the collection of individual nodes which are able to interact with physical
environment statically or dynamically by sensing or controlling physical parameter. Wireless sensor network
become a leading solution in many important applications such as intrusion detection, target tracking,
industrial automation etc. A major problem with WSN is to determining a most efficient protocol for
conserving energy of power source. The design of an energy- efficient Medium Access efficient Control
(MAC) protocol is one of the major issues in wireless sensor networks (WSN). In this paper we study some
characteristics of WSN that are important for the design of MAC layer protocols and give a brief introduction
of some newly come MAC protocols with reference to energy efficiency for WSN. In accordance with channel
access policies, MAC protocols are classified into four types, which are cross layer protocols, TDMA-based,
contention-based and hybrid, these are discussed in this paper.
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.
Simulation Based Routing Protocols Evaluation for IEEE 802.15.4 enabled Wirel...IDES Editor
Wireless sensor network (WSN) is emerging as a
major research field in computer networks over the last decade
due to its wide variety of embedded real time applications.
Sensor networks have infrastructure-less architecture because
of frequently varying topology and link status. Routing is an
extremely challenging task for battery-powered resourceconstrained
WSN, since it is main cause for energy depletion
and energy must be utilized prudently to enhance lifetime
for sensor networks. This drives a myriad of research efforts
aiming at efficient data dissemination. In this paper we
analyze how efficiently MANET specific routing protocols
OLSR (Optimized Link-State Routing protocol), DYMO
(Dynamic MANET On-demand) and ZRP (Zone Routing
Protocol) perform in IEEE 802.15.4 enabled wireless sensor
networks and evaluate their simulation results using Qualnet
simulator. Several simulations were carried out under varying
network size and offered load for performance evaluation and
relative comparison of protocols is reported in terms of average
end to end delay, throughput and jitter.
INCREASE THE LIFETIME OF WIRELESS SENSOR NETWORKS USING HIERARCHICAL CLUSTERI...ijwmn
Wireless sensor networks consist of hundreds or thousands of nodes with limited energy. Since the life time
of each sensor is equivalent to the battery life, the energy issue is considered as a major challenge.
Clustering has been proposed as a strategy to extend the lifetime of wireless sensor networks. Cluster size,
number of Cluster head per cluster and the selection of cluster head are considered as important factors in
clustering. In this research by studying LEACH algorithm and optimized algorithms of this protocol and by
evaluating the strengths and weaknesses, a new algorithm based on hierarchical clustering to increase the
lifetime of the sensor network is proposed. In this study, with a special mechanism the environment of
network is layered and the optimal number of cluster head in each layer is selected and then recruit for the
formation of clusters in the same layer by controlling the topology of the clusters is done independently.
Then the data is sent through the by cluster heads through the multi- stage to the main station. Simulation
results show that the above mentioned method increases the life time about 70% compared to the LEACH.
A CELLULAR BONDING AND ADAPTIVE LOAD BALANCING BASED MULTI-SIM GATEWAY FOR MO...pijans
As it is well known, the QoS(quality of service) provided by mobile Internet access point devices is far from
the QoS level offered by the common ADSL modem-router due to several reasons: in fact, mobile Internet
access networks are not designed to support real-time data traffic because of several drawbacks
concerning the wireless medium such as resource sharing, traffic congestion, radio link coverage etc.,
which impact directly such parameters as delay, jitter, and packet loss rate that are strictly connected to
the quality of user experience. The main scope of the present paper is to introduce a dual USIM HSPA
gateway for ad hoc and sensors networks thanks to which it will be possible to guarantee a QoS suitable
for a series of network-centric application such as real-time communications and monitoring, video
surveillance, real-time sensor networks, telemedicine, vehicular and mobile sensor networks and so on. The
main idea is to exploit multiple radio access networks in order to enhance the available end-to-end
bandwidth and the perceived quality of experience. The scope has been reached by combining multiple
radio access with dynamic load balancing and the VPN (virtual private network) bond technique.
Priority based bandwidth allocation in wireless sensor networksIJCNCJournal
Most of the sensor network applications need real time communication and the need for deadline aware real time communication is becoming eminent in these applications. These applications have different dead line requirements also. The real time applications of wireless sensor networks are bandwidth sensitive and need higher share of bandwidth for higher priority data to meet the dead line requirements. In this paper we focus on the MAC layer modifications to meet the real time requirements of different priority data.Bandwidth partitioning among different priority transmissions is implemented through MAC layer modifications. The MAC layer implements a queuing model that supports lower transfer rate for lower
priority packets and higher transfer rate for real
time packets with higher priority, minimizing the end to
end delay. The performance of the algorithm is evaluated with varying node distribution
.
Evaluation of Energy Consumption using Receiver–Centric MAC Protocol in Wirel...IJECEIAES
At present day’s wireless sensor networks, obtain a lot consideration to researchers. Maximum number of sensor nodes are scattered that can communicate with all others. Reliable data communication and energy consumption are the mainly significant parameters that are required in wireless sensor networks. Many of MAC protocols have been planned to improve the efficiency more by enhancing the throughput and energy consumption. The majority of the presented medium access control protocols to only make available, reliable data delivery or energy efficiency does not offer together at the same time. In this research work the author proposes a novel approach based on Receiver Centric-MAC is implemented using NS2 simulator. Here, the author focuses on the following parametric measures like - energy consumption, reliability and bandwidth. RC-MAC provides high bandwidth without decreasing energy efficiency. The results show that 0.12% of less energy consumption, reliability improved by 20.86% and bandwidth increased by 27.32% of RC-MAC compared with MAC IEEE 802.11.
Energy efficient mac protocols for wireless sensor networkijcsa
Wireless sensor network are the collection of individual nodes which are able to interact with physical
environment statically or dynamically by sensing or controlling physical parameter. Wireless sensor network
become a leading solution in many important applications such as intrusion detection, target tracking,
industrial automation etc. A major problem with WSN is to determining a most efficient protocol for
conserving energy of power source. The design of an energy- efficient Medium Access efficient Control
(MAC) protocol is one of the major issues in wireless sensor networks (WSN). In this paper we study some
characteristics of WSN that are important for the design of MAC layer protocols and give a brief introduction
of some newly come MAC protocols with reference to energy efficiency for WSN. In accordance with channel
access policies, MAC protocols are classified into four types, which are cross layer protocols, TDMA-based,
contention-based and hybrid, these are discussed in this paper.
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.
Simulation Based Routing Protocols Evaluation for IEEE 802.15.4 enabled Wirel...IDES Editor
Wireless sensor network (WSN) is emerging as a
major research field in computer networks over the last decade
due to its wide variety of embedded real time applications.
Sensor networks have infrastructure-less architecture because
of frequently varying topology and link status. Routing is an
extremely challenging task for battery-powered resourceconstrained
WSN, since it is main cause for energy depletion
and energy must be utilized prudently to enhance lifetime
for sensor networks. This drives a myriad of research efforts
aiming at efficient data dissemination. In this paper we
analyze how efficiently MANET specific routing protocols
OLSR (Optimized Link-State Routing protocol), DYMO
(Dynamic MANET On-demand) and ZRP (Zone Routing
Protocol) perform in IEEE 802.15.4 enabled wireless sensor
networks and evaluate their simulation results using Qualnet
simulator. Several simulations were carried out under varying
network size and offered load for performance evaluation and
relative comparison of protocols is reported in terms of average
end to end delay, throughput and jitter.
INCREASE THE LIFETIME OF WIRELESS SENSOR NETWORKS USING HIERARCHICAL CLUSTERI...ijwmn
Wireless sensor networks consist of hundreds or thousands of nodes with limited energy. Since the life time
of each sensor is equivalent to the battery life, the energy issue is considered as a major challenge.
Clustering has been proposed as a strategy to extend the lifetime of wireless sensor networks. Cluster size,
number of Cluster head per cluster and the selection of cluster head are considered as important factors in
clustering. In this research by studying LEACH algorithm and optimized algorithms of this protocol and by
evaluating the strengths and weaknesses, a new algorithm based on hierarchical clustering to increase the
lifetime of the sensor network is proposed. In this study, with a special mechanism the environment of
network is layered and the optimal number of cluster head in each layer is selected and then recruit for the
formation of clusters in the same layer by controlling the topology of the clusters is done independently.
Then the data is sent through the by cluster heads through the multi- stage to the main station. Simulation
results show that the above mentioned method increases the life time about 70% compared to the LEACH.
A CELLULAR BONDING AND ADAPTIVE LOAD BALANCING BASED MULTI-SIM GATEWAY FOR MO...pijans
As it is well known, the QoS(quality of service) provided by mobile Internet access point devices is far from
the QoS level offered by the common ADSL modem-router due to several reasons: in fact, mobile Internet
access networks are not designed to support real-time data traffic because of several drawbacks
concerning the wireless medium such as resource sharing, traffic congestion, radio link coverage etc.,
which impact directly such parameters as delay, jitter, and packet loss rate that are strictly connected to
the quality of user experience. The main scope of the present paper is to introduce a dual USIM HSPA
gateway for ad hoc and sensors networks thanks to which it will be possible to guarantee a QoS suitable
for a series of network-centric application such as real-time communications and monitoring, video
surveillance, real-time sensor networks, telemedicine, vehicular and mobile sensor networks and so on. The
main idea is to exploit multiple radio access networks in order to enhance the available end-to-end
bandwidth and the perceived quality of experience. The scope has been reached by combining multiple
radio access with dynamic load balancing and the VPN (virtual private network) bond technique.
Congestion Control in Wireless Sensor Networks: A surveyIJERA Editor
Congestion is a major problem in almost all kinds of wireless networks such as mobile ad-hoc networks; wireless
sensor networks (WSNs). There are variety of applications of WSN such as defense, temperature monitoring,
health monitoring. Congestion occurs in the sensor network because of limited resources such as low processing
power of the sensor node. As all the sensor nodes are battery powered. Hence, congestion in the sensor network
results in waste of energy of sensor nodes. All the layers of protocol suite of the network can be involved in the
congestion control process. This paper gives a brief idea about various congestion control methods. In some of
the schemes, cross-layer design is applied for better results.
A Survey of Various Routing and Channel Assignment Strategies for MR-MC WMNsijsrd.com
One fundamental problem of WMNs with a limited number of radio interfaces and orthogonal channels is that the performance degrades significantly as the network size grows. This results from increased interference between nodes and diminished spatial reuse over the network. A WMN node needs to share a common channel with each of its neighbours in the communication range, requiring it to set up a virtual link. Moreover, to reduce network interference, a node should minimize the number of neighbours that it shares a common channel with. The objective of a channel assignment strategy is to ensure efficient utilization of the available channels (e.g., by minimizing interference) while maximizing connectivity in the network. However, since these two requirements are conflicting with each other, the goal is to achieve a balance between these two. The major constraints which need to be satisfied by a channel assignment scheme include fixed number of channels in the network, limited number of radios in mesh nodes, common channel between two communicating nodes, and limited channel capacity. Also, a channel assignment scheme should take the amount of traffic load supported by each mesh node into consideration.
PROPOSED A HETEROGENEOUS CLUSTERING ALGORITHM TO IMPROVE QOS IN WSNIJCNCJournal
In this article it has presented leach extended hierarchical 3-level clustered heterogeneous and dynamics
algorithm. On suggested protocol (LEH3LA) with planning of selected auction cluster head, and
alternative cluster head node, problem of delay on processing, processing of selecting members, decrease
of expenses, and energy consumption, decrease of sending message, and receiving messages inside the
clusters, selecting of cluster heads in large sensor networks were solved. This algorithm uses hierarchical
heterogeneous network (3-levels), collective intelligence, and intra-cluster interaction for communications.
Also it will solve the problems of sending data in Multi-BS mobile networks, expanding inter-cluster
networks, overlap cluster, genesis orphan nodes, boundary change dynamically clusters, using backbone
networks, cloud sensor. Using sleep/wake scheduling algorithm or TDMA-schedule alternative cluster head
node provides redundancy, and fault tolerance. Local processing in cluster head nodes, and alternative
cluster head, intra-cluster and inter-cluster communications such as Multi-HOP cause increase on
processing speed, and sending data intra-cluster and inter-cluster. Decrease of overhead network, and
increase the load balancing among cluster heads. Using encapsulation of data method, by cluster head
nodes, energy consumption decrease during sending data. Also by improving quality of service (QoS) in
CBRP, LEACH, 802.15.4, decrease of energy consumption in sensors, cluster heads and alternative cluster
head nodes, cause increase on lift time of sensor networks.
Comparative Simulation Study Of LEACH-Like And HEED-Like Protocols Deployed I...IOSRJECE
WSNs represents one of the most interesting research areas with deep impact on technological development because of their potential usage in a wide variety of applications such as fire monitoring, border surveillance medical care, and highway traffic coordination. Therefore, WSNs researchers have defined many routing protocols for this type of network. In this paper, we have implemented and analyzed different clustering protocols, namely LEACH, LEACH-C, LEACH-1R, and HEED using MATLAB environment. These routing protocols are compared in different terms such as residual energy, data delivery to the base station, number of rounds and live nodes
EFFECTS OF MAC PARAMETERS ON THE PERFORMANCE OF IEEE 802.11 DCF IN NS-3ijwmn
This paper presents the design procedure of the NS-3 script for WLAN that is organized according to the hierarchical manner of TCP/IP model. We configure all layers by using NS-3 model objects and set and modify the values used by objects to investigate the effects of MAC parameters (access mechanism, CWmin, CWmax and retry limit) on the performance metrics viz. packet delivery ratio, packet lost ratio, aggregated throughput, and average delay. The simulation results show that RTS/CTS access mechanism outperforms basic access mechanism in saturated state, whereas the MAC parameters have no significant impact on network performance in non-saturated state. A higher value of CWmin improves the aggregated throughput in expense of average delay. The tradeoff relationships among the performance metrics are also observed in results for the optimal values of MAC parameters. Our design procedure represents a good guideline for new NS-3 users to design and modify script and results greatly benefit the network design and management.
Ijaems apr-2016-22TDMA- MAC Protocol based Energy- Potency for Periodic Sensi...INFOGAIN PUBLICATION
Energy potency could be a major demand in wireless sensing element networks. Media Access management is one in every of the key areas wherever energy potency is achieved by planning such MAC protocol that's tuned to the necessities of the sensing element networks. Applications have different necessities and one MAC protocol can't be best TDMA-based MAC (TDMAC) protocol that is specially designed for such applications that need periodic sensing of the sensing element field. TDMAC organizes nodes into clusters. Nodes send their knowledge to their cluster head (CH) and CHs forward it to the bottom station. CHs removed from the bottom station use multi-hop communication by forwarding their knowledge to CHs nearer than themselves to the bottom station each put down-cluster and intra-cluster communication is only TDMA-based that effectively eliminates each inter cluster further as intra-cluster interference.
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.
Engineering Research Publication
Best International Journals, High Impact Journals,
International Journal of Engineering & Technical Research
ISSN : 2321-0869 (O) 2454-4698 (P)
www.erpublication.org
DOTNET 2013 IEEE MOBILECOMPUTING PROJECT Optimal multicast capacity and delay...IEEEGLOBALSOFTTECHNOLOGIES
To Get any Project for CSE, IT ECE, EEE Contact Me @ 09849539085, 09966235788 or mail us - ieeefinalsemprojects@gmail.com-Visit Our Website: www.finalyearprojects.org
A cross layer optimized reliable multicast routing protocol in wireless mesh ...ijdpsjournal
The Optimal way to create a protocol in Wireless Mesh Networks
is to take into account a cross layer due
to the interference among wireless transmissions.
In this paper
,
w
e focus on designing and implementing
a
reliable
multicast protocol
called Me
sh Reliable Multicast Protocol (MRMP).
A
recovery tree
built
dynamically
which is joining with
the multicast routing tree.
U
sing the recovery tree
the packet losses are
repaired locally
.
This Cross layer
Technique
between network layer (
multicast routing)
and transport layer
(
reliability) using simulation
results
prove
the effectiveness
and optimization
of
cross layer
in WMNs
compare with the conventional layer
PERFORMANCE ANALYSIS OF OLSR PROTOCOL IN MANET CONSIDERING DIFFERENT MOBILITY...ijwmn
A Mobile Ad Hoc Network (MANET) is created when an independent mobile node network is connected
dynamically via wireless links. MANET is a self-organizing network that does not rely on pre-existing
infrastructure such as wired or wireless network routers. Mobile nodes in this network move randomly,
thus, the topology is always changing. Routing protocols in MANET are critical in ensuring dependable
and consistent connectivity between the mobile nodes. They conclude logically based on the interaction
between mobile nodes in MANET routing and encourage them to choose the optimum path between source
and destination. Routing protocols are classified as proactive, reactive, or hybrid. The focus of this project
will be on Optimized Link State Routing (OLSR) protocol, a proactive routing technique. OLSR is known as
the optimized variant of link state routing in which packets are sent throughout the network using the
multipoint relay (MPR) mechanism. This article evaluates the performance of the OLSR routing protocol
under condition of changing mobility speed and network density. The study's performance indicators are
average packet throughput, packet delivery ratio (PDR), and average packet latency. Network Simulator 2
(NS-2) and an external patch UM-OLSR are used to simulate and evaluate the performance of such
protocol. As a result of research, the approach of implementing the MPR mechanism are able to minimise
redundant data transmission during the normal message broadcast. The MPRs enhance the link state
protocols’ traditional diffusion mechanism by selecting the right MPRs. Hence, the number of undesired
broadcasts can be reduced and limited. Further research will focus on different scenario and environment
using different mobility model
Hexagonal based Clustering for Reducing Rebroadcasts in Mobile Ad Hoc NetworksIJTET Journal
Abstract— In mobile ad hoc networks multihop routing is performed in order to communicate the packets from the source to destination. The nodes within these networks are dynamic due which frequent path change occurs which can cause frequent link breakages and induces route discoveries. These route discoveries can introduce overhead in terms of contention, collision and rebroadcasts which are non-negligible. Here, the paper discusses a hexagonal based clustering for reducing rebroadcasts thus maximizing the lifetime of the networks and providing coverage area thus reducing the end – end delays.
MANET Routing Protocols , a case studyRehan Hattab
L. Yi, Y. Zhai, Y. Wang, J. Yuan and I. You , Impacts of Internal Network Contexts on Performance of MANET Routing Protocols: a Case Study, Sixth International Conference on Innovative Mobile and Internet Services in Ubiquitous Computing,2012.
Optimization of Transmission Schemes in Energy-Constrained Wireless Sensor Ne...IJEEE
This paper reviews medium access control
(MAC) in wireless sensor network (WSN),and different
management methods to save energy.MAC protocol
controls how sensors access a shared radio channel to
communicate with neighbours.
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
Congestion Control in Wireless Sensor Networks: A surveyIJERA Editor
Congestion is a major problem in almost all kinds of wireless networks such as mobile ad-hoc networks; wireless
sensor networks (WSNs). There are variety of applications of WSN such as defense, temperature monitoring,
health monitoring. Congestion occurs in the sensor network because of limited resources such as low processing
power of the sensor node. As all the sensor nodes are battery powered. Hence, congestion in the sensor network
results in waste of energy of sensor nodes. All the layers of protocol suite of the network can be involved in the
congestion control process. This paper gives a brief idea about various congestion control methods. In some of
the schemes, cross-layer design is applied for better results.
A Survey of Various Routing and Channel Assignment Strategies for MR-MC WMNsijsrd.com
One fundamental problem of WMNs with a limited number of radio interfaces and orthogonal channels is that the performance degrades significantly as the network size grows. This results from increased interference between nodes and diminished spatial reuse over the network. A WMN node needs to share a common channel with each of its neighbours in the communication range, requiring it to set up a virtual link. Moreover, to reduce network interference, a node should minimize the number of neighbours that it shares a common channel with. The objective of a channel assignment strategy is to ensure efficient utilization of the available channels (e.g., by minimizing interference) while maximizing connectivity in the network. However, since these two requirements are conflicting with each other, the goal is to achieve a balance between these two. The major constraints which need to be satisfied by a channel assignment scheme include fixed number of channels in the network, limited number of radios in mesh nodes, common channel between two communicating nodes, and limited channel capacity. Also, a channel assignment scheme should take the amount of traffic load supported by each mesh node into consideration.
PROPOSED A HETEROGENEOUS CLUSTERING ALGORITHM TO IMPROVE QOS IN WSNIJCNCJournal
In this article it has presented leach extended hierarchical 3-level clustered heterogeneous and dynamics
algorithm. On suggested protocol (LEH3LA) with planning of selected auction cluster head, and
alternative cluster head node, problem of delay on processing, processing of selecting members, decrease
of expenses, and energy consumption, decrease of sending message, and receiving messages inside the
clusters, selecting of cluster heads in large sensor networks were solved. This algorithm uses hierarchical
heterogeneous network (3-levels), collective intelligence, and intra-cluster interaction for communications.
Also it will solve the problems of sending data in Multi-BS mobile networks, expanding inter-cluster
networks, overlap cluster, genesis orphan nodes, boundary change dynamically clusters, using backbone
networks, cloud sensor. Using sleep/wake scheduling algorithm or TDMA-schedule alternative cluster head
node provides redundancy, and fault tolerance. Local processing in cluster head nodes, and alternative
cluster head, intra-cluster and inter-cluster communications such as Multi-HOP cause increase on
processing speed, and sending data intra-cluster and inter-cluster. Decrease of overhead network, and
increase the load balancing among cluster heads. Using encapsulation of data method, by cluster head
nodes, energy consumption decrease during sending data. Also by improving quality of service (QoS) in
CBRP, LEACH, 802.15.4, decrease of energy consumption in sensors, cluster heads and alternative cluster
head nodes, cause increase on lift time of sensor networks.
Comparative Simulation Study Of LEACH-Like And HEED-Like Protocols Deployed I...IOSRJECE
WSNs represents one of the most interesting research areas with deep impact on technological development because of their potential usage in a wide variety of applications such as fire monitoring, border surveillance medical care, and highway traffic coordination. Therefore, WSNs researchers have defined many routing protocols for this type of network. In this paper, we have implemented and analyzed different clustering protocols, namely LEACH, LEACH-C, LEACH-1R, and HEED using MATLAB environment. These routing protocols are compared in different terms such as residual energy, data delivery to the base station, number of rounds and live nodes
EFFECTS OF MAC PARAMETERS ON THE PERFORMANCE OF IEEE 802.11 DCF IN NS-3ijwmn
This paper presents the design procedure of the NS-3 script for WLAN that is organized according to the hierarchical manner of TCP/IP model. We configure all layers by using NS-3 model objects and set and modify the values used by objects to investigate the effects of MAC parameters (access mechanism, CWmin, CWmax and retry limit) on the performance metrics viz. packet delivery ratio, packet lost ratio, aggregated throughput, and average delay. The simulation results show that RTS/CTS access mechanism outperforms basic access mechanism in saturated state, whereas the MAC parameters have no significant impact on network performance in non-saturated state. A higher value of CWmin improves the aggregated throughput in expense of average delay. The tradeoff relationships among the performance metrics are also observed in results for the optimal values of MAC parameters. Our design procedure represents a good guideline for new NS-3 users to design and modify script and results greatly benefit the network design and management.
Ijaems apr-2016-22TDMA- MAC Protocol based Energy- Potency for Periodic Sensi...INFOGAIN PUBLICATION
Energy potency could be a major demand in wireless sensing element networks. Media Access management is one in every of the key areas wherever energy potency is achieved by planning such MAC protocol that's tuned to the necessities of the sensing element networks. Applications have different necessities and one MAC protocol can't be best TDMA-based MAC (TDMAC) protocol that is specially designed for such applications that need periodic sensing of the sensing element field. TDMAC organizes nodes into clusters. Nodes send their knowledge to their cluster head (CH) and CHs forward it to the bottom station. CHs removed from the bottom station use multi-hop communication by forwarding their knowledge to CHs nearer than themselves to the bottom station each put down-cluster and intra-cluster communication is only TDMA-based that effectively eliminates each inter cluster further as intra-cluster interference.
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.
Engineering Research Publication
Best International Journals, High Impact Journals,
International Journal of Engineering & Technical Research
ISSN : 2321-0869 (O) 2454-4698 (P)
www.erpublication.org
DOTNET 2013 IEEE MOBILECOMPUTING PROJECT Optimal multicast capacity and delay...IEEEGLOBALSOFTTECHNOLOGIES
To Get any Project for CSE, IT ECE, EEE Contact Me @ 09849539085, 09966235788 or mail us - ieeefinalsemprojects@gmail.com-Visit Our Website: www.finalyearprojects.org
A cross layer optimized reliable multicast routing protocol in wireless mesh ...ijdpsjournal
The Optimal way to create a protocol in Wireless Mesh Networks
is to take into account a cross layer due
to the interference among wireless transmissions.
In this paper
,
w
e focus on designing and implementing
a
reliable
multicast protocol
called Me
sh Reliable Multicast Protocol (MRMP).
A
recovery tree
built
dynamically
which is joining with
the multicast routing tree.
U
sing the recovery tree
the packet losses are
repaired locally
.
This Cross layer
Technique
between network layer (
multicast routing)
and transport layer
(
reliability) using simulation
results
prove
the effectiveness
and optimization
of
cross layer
in WMNs
compare with the conventional layer
PERFORMANCE ANALYSIS OF OLSR PROTOCOL IN MANET CONSIDERING DIFFERENT MOBILITY...ijwmn
A Mobile Ad Hoc Network (MANET) is created when an independent mobile node network is connected
dynamically via wireless links. MANET is a self-organizing network that does not rely on pre-existing
infrastructure such as wired or wireless network routers. Mobile nodes in this network move randomly,
thus, the topology is always changing. Routing protocols in MANET are critical in ensuring dependable
and consistent connectivity between the mobile nodes. They conclude logically based on the interaction
between mobile nodes in MANET routing and encourage them to choose the optimum path between source
and destination. Routing protocols are classified as proactive, reactive, or hybrid. The focus of this project
will be on Optimized Link State Routing (OLSR) protocol, a proactive routing technique. OLSR is known as
the optimized variant of link state routing in which packets are sent throughout the network using the
multipoint relay (MPR) mechanism. This article evaluates the performance of the OLSR routing protocol
under condition of changing mobility speed and network density. The study's performance indicators are
average packet throughput, packet delivery ratio (PDR), and average packet latency. Network Simulator 2
(NS-2) and an external patch UM-OLSR are used to simulate and evaluate the performance of such
protocol. As a result of research, the approach of implementing the MPR mechanism are able to minimise
redundant data transmission during the normal message broadcast. The MPRs enhance the link state
protocols’ traditional diffusion mechanism by selecting the right MPRs. Hence, the number of undesired
broadcasts can be reduced and limited. Further research will focus on different scenario and environment
using different mobility model
Hexagonal based Clustering for Reducing Rebroadcasts in Mobile Ad Hoc NetworksIJTET Journal
Abstract— In mobile ad hoc networks multihop routing is performed in order to communicate the packets from the source to destination. The nodes within these networks are dynamic due which frequent path change occurs which can cause frequent link breakages and induces route discoveries. These route discoveries can introduce overhead in terms of contention, collision and rebroadcasts which are non-negligible. Here, the paper discusses a hexagonal based clustering for reducing rebroadcasts thus maximizing the lifetime of the networks and providing coverage area thus reducing the end – end delays.
MANET Routing Protocols , a case studyRehan Hattab
L. Yi, Y. Zhai, Y. Wang, J. Yuan and I. You , Impacts of Internal Network Contexts on Performance of MANET Routing Protocols: a Case Study, Sixth International Conference on Innovative Mobile and Internet Services in Ubiquitous Computing,2012.
Optimization of Transmission Schemes in Energy-Constrained Wireless Sensor Ne...IJEEE
This paper reviews medium access control
(MAC) in wireless sensor network (WSN),and different
management methods to save energy.MAC protocol
controls how sensors access a shared radio channel to
communicate with neighbours.
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
SLOTTED CSMA/CA BASED ENERGY EFFICIENT MAC PROTOCOL DESIGN IN NANONETWORKSijwmn
Devices in a beacon-enabled network use slotted CSMA/CA to contend for channel usage. Each node in the network competes for the channels when ready to transmit data. The slotted CSMA/CA mechanism based on the super-frame structure fairly provides communication chance for each node and makes a reasonable usage of the available energy in beacon-enabled Zigbee networks. When wireless nano-sensor nodes are implanted into the target human body area for detecting disease symptoms or virus existence, each node also requires a similar characteristic in channel sharing and in the transmission of event-driven data with a short length. In this paper, we suggest a wireless network model with nano-sensor nodes for the in-body application. We propose a novel MAC protocol derived from an existing Zigbee MAC protocol scheme and analyze the performance of energy usage with variable super-frame durations and packet sizes.
SLOTTED CSMA/CA BASED ENERGY EFFICIENT MAC PROTOCOL DESIGN IN NANONETWORKSijwmn
Devices in a beacon-enabled network use slotted CSMA/CA to contend for channel usage. Each node in the
network competes for the channels when ready to transmit data. The slotted CSMA/CA mechanism based
on the super-frame structure fairly provides communication chance for each node and makes a reasonable
usage of the available energy in beacon-enabled Zigbee networks. When wireless nano-sensor nodes are
implanted into the target human body area for detecting disease symptoms or virus existence, each node
also requires a similar characteristic in channel sharing and in the transmission of event-driven data with
a short length. In this paper, we suggest a wireless network model with nano-sensor nodes for the in-body
application. We propose a novel MAC protocol derived from an existing Zigbee MAC protocol scheme and
analyze the performance of energy usage with variable super-frame durations and packet sizes.
Survey on energy efficiency in wireless sensor network using mac protocol wit...Editor Jacotech
Dynamic feature evaluation and concept evaluation is major challenging task in the field of data classification. The continuity of data induced a new feature during classification process, but the classification process is predefined task for assigning data into class. Data comes into multiple feature sub-set format into infinite length. The infinite length not decided the how many class are assigned. Support vector machine is well recognized method for data classification. For the process of support vector machine evaluation of new feature during classification is major problem. The problem of feature evaluation decreases the performance of Support Vector Machine (SVM). For the improvement of support vector machine, particle of swarm optimization technique is used. Particle of swarm optimization controls the dynamic feature evaluation process and decreases the possibility of confusion in selection of class and increase the classification ratio of support vector machine. Particle of swarm optimization work in two phases one used as dynamic population selection and another are used for optimization process of evolved new feature.
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
Energy-efficient MAC protocols for wireless sensor networks: a surveyTELKOMNIKA JOURNAL
MAC Protocols enables sensor nodes of the same WSN to access a common shared
communication channel. Many researchers have proposed different solutions explaining how to design and
implement these protocols. The main goal of most MACs protocols is how to prolong lifetime of the WSN
as long as possible by reducing energy consumption since it is often impossible to change or to recharge
sensors’ batteries. The majority of these protocols designed for WSN are based on “duty-cycle” technique.
Every node of the WSN operates on two periods: active period and sleep period to save energy. Until now
(to our knowledge) there is no ideal protocol for this purpose. The main reason relies on the lack of
standardization at lower layers (physical layer) and (physical) sensor hardware. Therefore, the MAC
protocol choice remains application-dependent. A useful MAC protocol should be able to adapt to network
changes (topology, nodes density and network size). This paper surveys MAC protocols for WSNs and
discusses the main characteristics, advantages and disadvantages of currently popular protocols.
Scheduling different types of packets, such as
real-time and non-real-time data packets, at sensor nodes with
resource constraints in Wireless Sensor Networks (WSN) is of
vital importance to reduce sensors’ energy consumptions and endto-end
data transmission delays. Most of the existing packetscheduling
mechanisms of WSN use First Come First Served
(FCFS), non pre-emptive priority and pre-emptive priority
scheduling algorithms. These algorithms incur a high processing
overhead and long end-to-end data transmission delay due to the
FCFS concept, starvation of high priority real-time data packets
due to the transmission of a large data packet in non pre-emptive
priority scheduling, starvation of non-real-time data packets due
to the probable continuous arrival of real-time data in preemptive
priority scheduling, and improper allocation of data
packets to queues in multilevel queue scheduling algorithms.
Moreover, these algorithms are not dynamic to the changing
requirements of WSN applications since their scheduling policies
are predetermined.
In the Advanced Multilevel Priority packet scheduling
scheme, each node except those at the last level has three levels of
priority queues. According to the priority of the packet and
availability of the queue, node will schedule the packet for
transmission. Due to separated queue availability, packet
transmission delay is reduced. Due to reduction in packet
transmission delay, node can goes into sleep mode as soon as
possible. And Expired packets are deleted at the particular node
at itself before reaching the base station, so that processing
burden on the node is reduced. Thus, energy of the node is saved.
Comparison of Csma Based MAC Protocols of Wireless Sensor Networkspijans
Energy conservation has been an important area of interest in Wireless Sensor networks (WSNs). Medium
Access Control (MAC) protocols play an important role in energy conservation. In this paper, we describe
CSMA based MAC protocols for WSN and analyze the simulation results of these protocols. We
implemented S-MAC, T-MAC, B-MAC, B-MAC+, X-MAC, DMAC and Wise-MAC in TOSSIM, a simulator
which unlike other simulators simulates the same code running on real hardware. Previous surveys mainly
focused on the classification of MAC protocols according to the techniques being used or problem dealt
with and presented a theoretical evaluation of protocols. This paper presents the comparative study of
CSMA based protocols for WSNs, showing which MAC protocol is suitable in a particular environment and
supports the arguments with the simulation results. The comparative study can be used to find the best
suited MAC protocol for wireless sensor networks in different environments.
Similar to PERFORMANCE ANALYSIS OF CHANNEL ACCESS MODEL FOR MAC IN RANDOMLY DISTRIBUTED WIRELESS SENSOR NETWORKS (20)
Blockchain Enforced Attribute based Access Control with ZKP for Healthcare Se...IJCNCJournal
The relationship between doctors and patients is reinforced through the expanded communication channels provided by remote healthcare services, resulting in heightened patient satisfaction and loyalty. Nonetheless, the growth of these services is hampered by security and privacy challenges they confront. Additionally, patient electronic health records (EHR) information is dispersed across multiple hospitals in different formats, undermining data sovereignty. It allows any service to assert authority over their EHR, effectively controlling its usage. This paper proposes a blockchain enforced attribute-based access control in healthcare service. To enhance the privacy and data-sovereignty, the proposed system employs attribute-based access control, zero-knowledge proof (ZKP) and blockchain. The role of data within our system is pivotal in defining attributes. These attributes, in turn, form the fundamental basis for access control criteria. Blockchain is used to keep hospital information in public chain but EHR related data in private chain. Furthermore, EHR provides access control by using the attributed based cryptosystem before they are stored in the blockchain. Analysis shows that the proposed system provides data sovereignty with privacy provision based on the attributed based access control.
EECRPSID: Energy-Efficient Cluster-Based Routing Protocol with a Secure Intru...IJCNCJournal
A revolutionary idea that has gained significance in technology for Internet of Things (IoT) networks backed by WSNs is the " Energy-Efficient Cluster-Based Routing Protocol with a Secure Intrusion Detection" (EECRPSID). A WSN-powered IoT infrastructure's hardware foundation is hardware with autonomous sensing capabilities. The significant features of the proposed technology are intelligent environment sensing, independent data collection, and information transfer to connected devices. However, hardware flaws and issues with energy consumption may be to blame for device failures in WSN-assisted IoT networks. This can potentially obstruct the transfer of data. A reliable route significantly reduces data retransmissions, which reduces traffic and conserves energy. The sensor hardware is often widely dispersed by IoT networks that enable WSNs. Data duplication could occur if numerous sensor devices are used to monitor a location. Finding a solution to this issue by using clustering. Clustering lessens network traffic while retaining path dependability compared to the multipath technique. To relieve duplicate data in EECRPSID, we applied the clustering technique. The multipath strategy might make the provided protocol more dependable. Using the EECRPSID algorithm, will reduce the overall energy consumption, minimize the End-to-end delay to 0.14s, achieve a 99.8% Packet Delivery Ratio, and the network's lifespan will be increased. The NS2 simulator is used to run the whole set of simulations. The EECRPSID method has been implemented in NS2, and simulated results indicate that comparing the other three technologies improves the performance measures.
Analysis and Evolution of SHA-1 Algorithm - Analytical TechniqueIJCNCJournal
A 160-bit (20-byte) hash value, sometimes called a message digest, is generated using the SHA-1 (Secure Hash Algorithm 1) hash function in cryptography. This value is commonly represented as 40 hexadecimal digits. It is a Federal Information Processing Standard in the United States and was developed by the National Security Agency. Although it has been cryptographically cracked, the technique is still in widespread usage. In this work, we conduct a detailed and practical analysis of the SHA-1 algorithm's theoretical elements and show how they have been implemented through the use of several different hash configurations.
Optimizing CNN-BiGRU Performance: Mish Activation and Comparative AnalysisIJCNCJournal
Deep learning is currently extensively employed across a range of research domains. The continuous advancements in deep learning techniques contribute to solving intricate challenges. Activation functions (AF) are fundamental components within neural networks, enabling them to capture complex patterns and relationships in the data. By introducing non-linearities, AF empowers neural networks to model and adapt to the diverse and nuanced nature of real-world data, enhancing their ability to make accurate predictions across various tasks. In the context of intrusion detection, the Mish, a recent AF, was implemented in the CNN-BiGRU model, using three datasets: ASNM-TUN, ASNM-CDX, and HOGZILLA. The comparison with Rectified Linear Unit (ReLU), a widely used AF, revealed that Mish outperforms ReLU, showcasing superior performance across the evaluated datasets. This study illuminates the effectiveness of AF in elevating the performance of intrusion detection systems.
An Hybrid Framework OTFS-OFDM Based on Mobile Speed EstimationIJCNCJournal
The Future wireless communication systems face the challenging task of simultaneously providing high-quality service (QoS) and broadband data transmission, while also minimizing power consumption, latency, and system complexity. Although Orthogonal Frequency Division Multiplexing (OFDM) has been widely adopted in 4G and 5G systems, it struggles to cope with a significant delay and Doppler spread in high mobility scenarios. To address these challenges, a novel waveform named Orthogonal Time Frequency Space (OTFS). Designers aim to outperform OFDM by closely aligning signals with the channel behaviour. In this paper, we propose a switching strategy that empowers operators to select the most appropriate waveform based on an estimated speed of the mobile user. This strategy enables the base station to dynamically choose the waveform that best suits the mobile user’s speed. Additionally, we suggest retaining an Integrated Sensing and Communication (ISAC) radar approach for accurate Doppler estimation. This provides precise information to facilitate the waveform selection procedure. By leveraging the switching strategy and harnessing the Doppler estimation capabilities of an ISAC radar.Our proposed approach aims to enhance the performance of wireless communication systems in high mobility cases. Considering the complexity of waveform processing, we introduce an optimized hybrid system that combines OTFS and OFDM, resulting in reduced complexity while still retaining performance benefits.This hybrid system presents a promising solution for improving the performance of wireless communication systems in higher mobility.The simulation results validate the effectiveness of our approach, demonstrating its potential advantages for future wireless communication systems. The effectiveness of the proposed approach is validated by simulation results as it will be illustrated.
Enhanced Traffic Congestion Management with Fog Computing - A Simulation-Base...IJCNCJournal
Accurate latency computation is essential for the Internet of Things (IoT) since the connected devices generate a vast amount of data that is processed on cloud infrastructure. However, the cloud is not an optimal solution. To overcome this issue, fog computing is used to enable processing at the edge while still allowing communication with the cloud. Many applications rely on fog computing, including traffic management. In this paper, an Intelligent Traffic Congestion Mitigation System (ITCMS) is proposed to address traffic congestion in heavily populated smart cities. The proposed system is implemented using fog computing and tested in a crowdedCairo city. The results obtained indicate that the execution time of the simulation is 4,538 seconds, and the delay in the application loop is 49.67 seconds. The paper addresses various issues, including CPU usage, heap memory usage, throughput, and the total average delay, which are essential for evaluating the performance of the ITCMS. Our system model is also compared with other models to assess its performance. A comparison is made using two parameters, namely throughput and the total average delay, between the ITCMS, IOV (Internet of Vehicle), and STL (Seasonal-Trend Decomposition Procedure based on LOESS). Consequently, the results confirm that the proposed system outperforms the others in terms of higher accuracy, lower latency, and improved traffic efficiency.
Rendezvous Sequence Generation Algorithm for Cognitive Radio Networks in Post...IJCNCJournal
Recent natural disasters have inflicted tremendous damage on humanity, with their scale progressively increasing and leading to numerous casualties. Events such as earthquakes can trigger secondary disasters, such as tsunamis, further complicating the situation by destroying communication infrastructures. This destruction impedes the dissemination of information about secondary disasters and complicates post-disaster rescue efforts. Consequently, there is an urgent demand for technologies capable of substituting for these destroyed communication infrastructures. This paper proposes a technique for generating rendezvous sequences to swiftly reconnect communication infrastructures in post-disaster scenarios. We compare the time required for rendezvous using the proposed technique against existing methods and analyze the average time taken to establish links with the rendezvous technique, discussing its significance. This research presents a novel approach enabling rapid recovery of destroyed communication infrastructures in disaster environments through Cognitive Radio Network (CRN) technology, showcasing the potential to significantly improve disaster response and recovery efforts. The proposed method reduces the time for the rendezvous compared to existing methods, suggesting that it can enhance the efficiency of rescue operations in post-disaster scenarios and contribute to life-saving efforts.
Vehicle Ad Hoc Networks (VANETs) have become a viable technology to improve traffic flow and safety on the roads. Due to its effectiveness and scalability, the Wingsuit Search-based Optimised Link State Routing Protocol (WS-OLSR) is frequently used for data distribution in VANETs. However, the selection of MultiPoint Relays (MPRs) plays a pivotal role in WS-OLSR's performance. This paper presents an improved MPR selection algorithm tailored to WS-OLSR, designed to enhance the overall routing efficiency and reduce overhead. The analysis found that the current OLSR protocol has problems such as redundancy of HELLO and TC message packets or failure to update routing information in time, so a WS-OLSR routing protocol based on improved-MPR selection algorithm was proposed. Firstly, factors such as node mobility and link changes are comprehensively considered to reflect network topology changes, and the broadcast cycle of node HELLO messages is controlled through topology changes. Secondly, a new MPR selection algorithm is proposed, considering link stability issues and nodes. Finally, evaluate its effectiveness in terms of packet delivery ratio, end-to-end delay, and control message overhead. Simulation results demonstrate the superior performance of our improved MR selection algorithm when compared to traditional approaches.
May 2024, Volume 16, Number 3 - The International Journal of Computer Network...IJCNCJournal
The International Journal of Computer Networks & Communications (IJCNC) is a bi monthly open access peer-reviewed journal that publishes articles which contribute new results in all areas of Computer Networks & Communications. The journal focuses on all technical and practical aspects of Computer Networks & data Communications. The goal of this journal is to bring together researchers and practitioners from academia and industry to focus on advanced networking concepts and establishing new collaborations in these areas.
Vehicle Ad Hoc Networks (VANETs) have become a viable technology to improve traffic flow and safety on the roads. Due to its effectiveness and scalability, the Wingsuit Search-based Optimised Link State Routing Protocol (WS-OLSR) is frequently used for data distribution in VANETs. However, the selection of MultiPoint Relays (MPRs) plays a pivotal role in WS-OLSR's performance. This paper presents an improved MPR selection algorithm tailored to WS-OLSR, designed to enhance the overall routing efficiency and reduce overhead. The analysis found that the current OLSR protocol has problems such as redundancy of HELLO and TC message packets or failure to update routing information in time, so a WS-OLSR routing protocol based on improved-MPR selection algorithm was proposed. Firstly, factors such as node mobility and link changes are comprehensively considered to reflect network topology changes, and the broadcast cycle of node HELLO messages is controlled through topology changes. Secondly, a new MPR selection algorithm is proposed, considering link stability issues and nodes. Finally, evaluate its effectiveness in terms of packet delivery ratio, end-to-end delay, and control message overhead. Simulation results demonstrate the superior performance of our improved MR selection algorithm when compared to traditional approaches.
A Novel Medium Access Control Strategy for Heterogeneous Traffic in Wireless ...IJCNCJournal
So far, Wireless Body Area Networks (WBANs) have played a pivotal role in driving the development of intelligent healthcare systems with broad applicability across various domains. Each WBAN consists of one or more types of sensors that can be embedded in clothing, attached directly to the body, or even implanted beneath an individual's skin. These sensors typically serve asingle application. However, the traffic generated by each sensor may have distinct requirements. This diversity necessitates a dual approach: tailored treatment based on the specific needs of each traffic typeand the fulfillment of application requirements, such asreliability and timeliness. Never the less, the presence of energy constraints and the unreliable nature of wireless communications make QoS provisioning under such networks a non-trivial task. In this context, the current paper introduces a novel Medium AccessControl (MAC) strategy for the regular traffic applications of WBANs, designed to significantly enhance efficiency when compared to the established MAC protocols IEEE 802.15.4 and IEEE 802.15.6, with a particular focus on improving reliability, timeliness, and energy efficiency.
May_2024 Top 10 Read Articles in Computer Networks & Communications.pdfIJCNCJournal
The International Journal of Computer Networks & Communications (IJCNC) is a bi monthly open access peer-reviewed journal that publishes articles which contribute new results in all areas of Computer Networks & Communications. The journal focuses on all technical and practical aspects of Computer Networks & data Communications. The goal of this journal is to bring together researchers and practitioners from academia and industry to focus on advanced networking concepts and establishing new collaborations in these areas.
A Topology Control Algorithm Taking into Account Energy and Quality of Transm...IJCNCJournal
The efficient use of energy in wireless sensor networks is critical for extending node lifetime. The network topology is one of the factors that have a significant impact on the energy usage at the nodes and the quality of transmission (QoT) in the network. We propose a topology control algorithm for software-defined wireless sensor networks (SDWSNs) in this paper. Our method is to formulate topology control algorithm as a nonlinear programming (NP) problem with the objective to optimizing two metrics, maximum communication range, and desired degree. This NP problem is solved at the SDWSN controller by employing the genetic algorithm (GA) to determine the best topology. The simulation results show that the proposed algorithm outperforms the MaxPower algorithm in terms of average node degree and energy expansion ratio.
Multi-Server user Authentication Scheme for Privacy Preservation with Fuzzy C...IJCNCJournal
The integration of artificial intelligence technology with a scalable Internet of Things (IoT) platform facilitates diverse smart communication services, allowing remote users to access services from anywhere at any time. The multi-server environment within IoT introduces a flexible security service model, enabling users to interact with any server through a single registration. To ensure secure and privacy preservation services for resources, an authentication scheme is essential. Zhao et al. recently introduced a user authentication scheme for the multi-server environment, utilizing passwords and smart cards, claiming resilience against well-known attacks. This paper conducts cryptanalysis on Zhao et al.'s scheme, focusing on denial of service and privacy attacks, revealing a lack of user-friendliness. Subsequently, we propose a new multi-server user authentication scheme for privacy preservation with fuzzy commitment over the IoT environment, addressing the shortcomings of Zhao et al.'s scheme. Formal security verification of the proposed scheme is conducted using the ProVerif simulation tool. Through both formal and informal security analyses, we demonstrate that the proposed scheme is resilient against various known attacks and those identified in Zhao et al.'s scheme.
Advanced Privacy Scheme to Improve Road Safety in Smart Transportation SystemsIJCNCJournal
In -Vehicle Ad-Hoc Network (VANET), vehicles continuously transmit and receive spatiotemporal data with neighboring vehicles, thereby establishing a comprehensive 360-degree traffic awareness system. Vehicular Network safety applications facilitate the transmission of messages between vehicles that are near each other, at regular intervals, enhancing drivers' contextual understanding of the driving environment and significantly improving traffic safety. Privacy schemes in VANETs are vital to safeguard vehicles’ identities and their associated owners or drivers. Privacy schemes prevent unauthorized parties from linking the vehicle's communications to a specific real-world identity by employing techniques such as pseudonyms, randomization, or cryptographic protocols. Nevertheless, these communications frequently contain important vehicle information that malevolent groups could use to Monitor the vehicle over a long period. The acquisition of this shared data has the potential to facilitate the reconstruction of vehicle trajectories, thereby posing a potential risk to the privacy of the driver. Addressing the critical challenge of developing effective and scalable privacy-preserving protocols for communication in vehicle networks is of the highest priority. These protocols aim to reduce the transmission of confidential data while ensuring the required level of communication. This paper aims to propose an Advanced Privacy Vehicle Scheme (APV) that periodically changes pseudonyms to protect vehicle identities and improve privacy. The APV scheme utilizes a concept called the silent period, which involves changing the pseudonym of a vehicle periodically based on the tracking of neighboring vehicles. The pseudonym is a temporary identifier that vehicles use to communicate with each other in a VANET. By changing the pseudonym regularly, the APV scheme makes it difficult for unauthorized entities to link a vehicle's communications to its real-world identity. The proposed APV is compared to the SLOW, RSP, CAPS, and CPN techniques. The data indicates that the efficiency of APV is a better improvement in privacy metrics. It is evident that the AVP offers enhanced safety for vehicles during transportation in the smart city.
April 2024 - Top 10 Read Articles in Computer Networks & CommunicationsIJCNCJournal
The International Journal of Computer Networks & Communications (IJCNC) is a bi monthly open access peer-reviewed journal that publishes articles which contribute new results in all areas of Computer Networks & Communications. The journal focuses on all technical and practical aspects of Computer Networks & data Communications. The goal of this journal is to bring together researchers and practitioners from academia and industry to focus on advanced networking concepts and establishing new collaborations in these areas.
DEF: Deep Ensemble Neural Network Classifier for Android Malware DetectionIJCNCJournal
Malware is one of the threats to security of computer networks and information systems. Since malware instances are available sufficiently, there is increased interest among researchers on usage of Artificial Intelligence (AI). Of late AI-enabled methods such as machine learning (ML) and deep learning paved way for solving many real-world problems. As it is a learning-based approach, accumulated training samples help in improving thequality of training and thus leveraging malware detection accuracy. Existing deep learning methods are focusing on learning-based malware detection systems. However, there is need for improving the state of the art through ensemble approach. Towards this end, in this paper we proposed a framework known as Deep Ensemble Framework (DEF) for automatic malware detection. The framework obtains features from training samples. From given malware instance a grayscale image is generated. There is another process to extract the opcode sequences. Convolutional Neural Network (CNN) and Long Short Term Memory (LSTM) techniques are used to obtain grayscale image and opcode sequence respectively. Afterwards, a stacking ensemble is employed in order to achieve efficient malware detection and classification. Malware samples collected fromthe Internet sources and Microsoft are used for theempirical study. An algorithm known as Ensemble Learning for Automatic Malware Detection (EL-AML) is proposed to realize our framework. Another algorithm named Pre-Process is proposed to assist the EL-AML algorithm for obtaining intermediate features required by CNN and LSTM.Empirical study reveals that our framework outperforms many existing methods in terms of speed-up and accuracy.
High Performance NMF Based Intrusion Detection System for Big Data IOT TrafficIJCNCJournal
With the emergence of smart devices and the Internet of Things (IoT), millions of users connected to the network produce massive network traffic datasets. These vast datasets of network traffic, Big Data are challenging to store, deal with and analyse using a single computer. In this paper we developed parallel implementation using a High Performance Computer (HPC) for the Non-Negative Matrix Factorization technique as an engine for an Intrusion Detection System (HPC-NMF-IDS). The large IoT traffic datasets of order of millions samples are distributed evenly on all the computing cores for both storage and speedup purpose. The distribution of computing tasks involved in the Matrix Factorization takes into account the reduction of the communication cost between the computing cores. The experiments we conducted on the proposed HPC-IDS-NMF give better results than the traditional ML-based intrusion detection systems. We could train the HPC model with datasets of one million samples in only 31 seconds instead of the 40 minutes using one processor), that is a speed up of 87 times. Moreover, we have got an excellent detection accuracy rate of 98% for KDD dataset.
A Novel Medium Access Control Strategy for Heterogeneous Traffic in Wireless ...IJCNCJournal
So far, Wireless Body Area Networks (WBANs) have played a pivotal role in driving the development of intelligent healthcare systems with broad applicability across various domains. Each WBAN consists of one or more types of sensors that can be embedded in clothing, attached directly to the body, or even implanted beneath an individual's skin. These sensors typically serve asingle application. However, the traffic generated by each sensor may have distinct requirements. This diversity necessitates a dual approach: tailored treatment based on the specific needs of each traffic typeand the fulfillment of application requirements, such asreliability and timeliness. Never the less, the presence of energy constraints and the unreliable nature of wireless communications make QoS provisioning under such networks a non-trivial task. In this context, the current paper introduces a novel Medium AccessControl (MAC) strategy for the regular traffic applications of WBANs, designed to significantly enhance efficiency when compared to the established MAC protocols IEEE 802.15.4 and IEEE 802.15.6, with a particular focus on improving reliability, timeliness, and energy efficiency.
A Topology Control Algorithm Taking into Account Energy and Quality of Transm...IJCNCJournal
The efficient use of energy in wireless sensor networks is critical for extending node lifetime. The network topology is one of the factors that have a significant impact on the energy usage at the nodes and the quality of transmission (QoT) in the network. We propose a topology control algorithm for software-defined wireless sensor networks (SDWSNs) in this paper. Our method is to formulate topology control algorithm as a nonlinear programming (NP) problem with the objective to optimizing two metrics, maximum communication range, and desired degree. This NP problem is solved at the SDWSN controller by employing the genetic algorithm (GA) to determine the best topology. The simulation results show that the proposed algorithm outperforms the MaxPower algorithm in terms of average node degree and energy expansion ratio.
UiPath Test Automation using UiPath Test Suite series, part 5DianaGray10
Welcome to UiPath Test Automation using UiPath Test Suite series part 5. In this session, we will cover CI/CD with devops.
Topics covered:
CI/CD with in UiPath
End-to-end overview of CI/CD pipeline with Azure devops
Speaker:
Lyndsey Byblow, Test Suite Sales Engineer @ UiPath, Inc.
Why You Should Replace Windows 11 with Nitrux Linux 3.5.0 for enhanced perfor...SOFTTECHHUB
The choice of an operating system plays a pivotal role in shaping our computing experience. For decades, Microsoft's Windows has dominated the market, offering a familiar and widely adopted platform for personal and professional use. However, as technological advancements continue to push the boundaries of innovation, alternative operating systems have emerged, challenging the status quo and offering users a fresh perspective on computing.
One such alternative that has garnered significant attention and acclaim is Nitrux Linux 3.5.0, a sleek, powerful, and user-friendly Linux distribution that promises to redefine the way we interact with our devices. With its focus on performance, security, and customization, Nitrux Linux presents a compelling case for those seeking to break free from the constraints of proprietary software and embrace the freedom and flexibility of open-source computing.
UiPath Test Automation using UiPath Test Suite series, part 6DianaGray10
Welcome to UiPath Test Automation using UiPath Test Suite series part 6. In this session, we will cover Test Automation with generative AI and Open AI.
UiPath Test Automation with generative AI and Open AI webinar offers an in-depth exploration of leveraging cutting-edge technologies for test automation within the UiPath platform. Attendees will delve into the integration of generative AI, a test automation solution, with Open AI advanced natural language processing capabilities.
Throughout the session, participants will discover how this synergy empowers testers to automate repetitive tasks, enhance testing accuracy, and expedite the software testing life cycle. Topics covered include the seamless integration process, practical use cases, and the benefits of harnessing AI-driven automation for UiPath testing initiatives. By attending this webinar, testers, and automation professionals can gain valuable insights into harnessing the power of AI to optimize their test automation workflows within the UiPath ecosystem, ultimately driving efficiency and quality in software development processes.
What will you get from this session?
1. Insights into integrating generative AI.
2. Understanding how this integration enhances test automation within the UiPath platform
3. Practical demonstrations
4. Exploration of real-world use cases illustrating the benefits of AI-driven test automation for UiPath
Topics covered:
What is generative AI
Test Automation with generative AI and Open AI.
UiPath integration with generative AI
Speaker:
Deepak Rai, Automation Practice Lead, Boundaryless Group and UiPath MVP
GDG Cloud Southlake #33: Boule & Rebala: Effective AppSec in SDLC using Deplo...James Anderson
Effective Application Security in Software Delivery lifecycle using Deployment Firewall and DBOM
The modern software delivery process (or the CI/CD process) includes many tools, distributed teams, open-source code, and cloud platforms. Constant focus on speed to release software to market, along with the traditional slow and manual security checks has caused gaps in continuous security as an important piece in the software supply chain. Today organizations feel more susceptible to external and internal cyber threats due to the vast attack surface in their applications supply chain and the lack of end-to-end governance and risk management.
The software team must secure its software delivery process to avoid vulnerability and security breaches. This needs to be achieved with existing tool chains and without extensive rework of the delivery processes. This talk will present strategies and techniques for providing visibility into the true risk of the existing vulnerabilities, preventing the introduction of security issues in the software, resolving vulnerabilities in production environments quickly, and capturing the deployment bill of materials (DBOM).
Speakers:
Bob Boule
Robert Boule is a technology enthusiast with PASSION for technology and making things work along with a knack for helping others understand how things work. He comes with around 20 years of solution engineering experience in application security, software continuous delivery, and SaaS platforms. He is known for his dynamic presentations in CI/CD and application security integrated in software delivery lifecycle.
Gopinath Rebala
Gopinath Rebala is the CTO of OpsMx, where he has overall responsibility for the machine learning and data processing architectures for Secure Software Delivery. Gopi also has a strong connection with our customers, leading design and architecture for strategic implementations. Gopi is a frequent speaker and well-known leader in continuous delivery and integrating security into software delivery.
Encryption in Microsoft 365 - ExpertsLive Netherlands 2024Albert Hoitingh
In this session I delve into the encryption technology used in Microsoft 365 and Microsoft Purview. Including the concepts of Customer Key and Double Key Encryption.
DevOps and Testing slides at DASA ConnectKari Kakkonen
My and Rik Marselis slides at 30.5.2024 DASA Connect conference. We discuss about what is testing, then what is agile testing and finally what is Testing in DevOps. Finally we had lovely workshop with the participants trying to find out different ways to think about quality and testing in different parts of the DevOps infinity loop.
Dr. Sean Tan, Head of Data Science, Changi Airport Group
Discover how Changi Airport Group (CAG) leverages graph technologies and generative AI to revolutionize their search capabilities. This session delves into the unique search needs of CAG’s diverse passengers and customers, showcasing how graph data structures enhance the accuracy and relevance of AI-generated search results, mitigating the risk of “hallucinations” and improving the overall customer journey.
Securing your Kubernetes cluster_ a step-by-step guide to success !KatiaHIMEUR1
Today, after several years of existence, an extremely active community and an ultra-dynamic ecosystem, Kubernetes has established itself as the de facto standard in container orchestration. Thanks to a wide range of managed services, it has never been so easy to set up a ready-to-use Kubernetes cluster.
However, this ease of use means that the subject of security in Kubernetes is often left for later, or even neglected. This exposes companies to significant risks.
In this talk, I'll show you step-by-step how to secure your Kubernetes cluster for greater peace of mind and reliability.
Removing Uninteresting Bytes in Software FuzzingAftab Hussain
Imagine a world where software fuzzing, the process of mutating bytes in test seeds to uncover hidden and erroneous program behaviors, becomes faster and more effective. A lot depends on the initial seeds, which can significantly dictate the trajectory of a fuzzing campaign, particularly in terms of how long it takes to uncover interesting behaviour in your code. We introduce DIAR, a technique designed to speedup fuzzing campaigns by pinpointing and eliminating those uninteresting bytes in the seeds. Picture this: instead of wasting valuable resources on meaningless mutations in large, bloated seeds, DIAR removes the unnecessary bytes, streamlining the entire process.
In this work, we equipped AFL, a popular fuzzer, with DIAR and examined two critical Linux libraries -- Libxml's xmllint, a tool for parsing xml documents, and Binutil's readelf, an essential debugging and security analysis command-line tool used to display detailed information about ELF (Executable and Linkable Format). Our preliminary results show that AFL+DIAR does not only discover new paths more quickly but also achieves higher coverage overall. This work thus showcases how starting with lean and optimized seeds can lead to faster, more comprehensive fuzzing campaigns -- and DIAR helps you find such seeds.
- These are slides of the talk given at IEEE International Conference on Software Testing Verification and Validation Workshop, ICSTW 2022.
The Art of the Pitch: WordPress Relationships and SalesLaura Byrne
Clients don’t know what they don’t know. What web solutions are right for them? How does WordPress come into the picture? How do you make sure you understand scope and timeline? What do you do if sometime changes?
All these questions and more will be explored as we talk about matching clients’ needs with what your agency offers without pulling teeth or pulling your hair out. Practical tips, and strategies for successful relationship building that leads to closing the deal.
Threats to mobile devices are more prevalent and increasing in scope and complexity. Users of mobile devices desire to take full advantage of the features
available on those devices, but many of the features provide convenience and capability but sacrifice security. This best practices guide outlines steps the users can take to better protect personal devices and information.
zkStudyClub - Reef: Fast Succinct Non-Interactive Zero-Knowledge Regex ProofsAlex Pruden
This paper presents Reef, a system for generating publicly verifiable succinct non-interactive zero-knowledge proofs that a committed document matches or does not match a regular expression. We describe applications such as proving the strength of passwords, the provenance of email despite redactions, the validity of oblivious DNS queries, and the existence of mutations in DNA. Reef supports the Perl Compatible Regular Expression syntax, including wildcards, alternation, ranges, capture groups, Kleene star, negations, and lookarounds. Reef introduces a new type of automata, Skipping Alternating Finite Automata (SAFA), that skips irrelevant parts of a document when producing proofs without undermining soundness, and instantiates SAFA with a lookup argument. Our experimental evaluation confirms that Reef can generate proofs for documents with 32M characters; the proofs are small and cheap to verify (under a second).
Paper: https://eprint.iacr.org/2023/1886
Generative AI Deep Dive: Advancing from Proof of Concept to ProductionAggregage
Join Maher Hanafi, VP of Engineering at Betterworks, in this new session where he'll share a practical framework to transform Gen AI prototypes into impactful products! He'll delve into the complexities of data collection and management, model selection and optimization, and ensuring security, scalability, and responsible use.
Epistemic Interaction - tuning interfaces to provide information for AI supportAlan Dix
Paper presented at SYNERGY workshop at AVI 2024, Genoa, Italy. 3rd June 2024
https://alandix.com/academic/papers/synergy2024-epistemic/
As machine learning integrates deeper into human-computer interactions, the concept of epistemic interaction emerges, aiming to refine these interactions to enhance system adaptability. This approach encourages minor, intentional adjustments in user behaviour to enrich the data available for system learning. This paper introduces epistemic interaction within the context of human-system communication, illustrating how deliberate interaction design can improve system understanding and adaptation. Through concrete examples, we demonstrate the potential of epistemic interaction to significantly advance human-computer interaction by leveraging intuitive human communication strategies to inform system design and functionality, offering a novel pathway for enriching user-system engagements.
Observability Concepts EVERY Developer Should Know -- DeveloperWeek Europe.pdfPaige Cruz
Monitoring and observability aren’t traditionally found in software curriculums and many of us cobble this knowledge together from whatever vendor or ecosystem we were first introduced to and whatever is a part of your current company’s observability stack.
While the dev and ops silo continues to crumble….many organizations still relegate monitoring & observability as the purview of ops, infra and SRE teams. This is a mistake - achieving a highly observable system requires collaboration up and down the stack.
I, a former op, would like to extend an invitation to all application developers to join the observability party will share these foundational concepts to build on:
In the rapidly evolving landscape of technologies, XML continues to play a vital role in structuring, storing, and transporting data across diverse systems. The recent advancements in artificial intelligence (AI) present new methodologies for enhancing XML development workflows, introducing efficiency, automation, and intelligent capabilities. This presentation will outline the scope and perspective of utilizing AI in XML development. The potential benefits and the possible pitfalls will be highlighted, providing a balanced view of the subject.
We will explore the capabilities of AI in understanding XML markup languages and autonomously creating structured XML content. Additionally, we will examine the capacity of AI to enrich plain text with appropriate XML markup. Practical examples and methodological guidelines will be provided to elucidate how AI can be effectively prompted to interpret and generate accurate XML markup.
Further emphasis will be placed on the role of AI in developing XSLT, or schemas such as XSD and Schematron. We will address the techniques and strategies adopted to create prompts for generating code, explaining code, or refactoring the code, and the results achieved.
The discussion will extend to how AI can be used to transform XML content. In particular, the focus will be on the use of AI XPath extension functions in XSLT, Schematron, Schematron Quick Fixes, or for XML content refactoring.
The presentation aims to deliver a comprehensive overview of AI usage in XML development, providing attendees with the necessary knowledge to make informed decisions. Whether you’re at the early stages of adopting AI or considering integrating it in advanced XML development, this presentation will cover all levels of expertise.
By highlighting the potential advantages and challenges of integrating AI with XML development tools and languages, the presentation seeks to inspire thoughtful conversation around the future of XML development. We’ll not only delve into the technical aspects of AI-powered XML development but also discuss practical implications and possible future directions.
Maruthi Prithivirajan, Head of ASEAN & IN Solution Architecture, Neo4j
Get an inside look at the latest Neo4j innovations that enable relationship-driven intelligence at scale. Learn more about the newest cloud integrations and product enhancements that make Neo4j an essential choice for developers building apps with interconnected data and generative AI.
PERFORMANCE ANALYSIS OF CHANNEL ACCESS MODEL FOR MAC IN RANDOMLY DISTRIBUTED WIRELESS SENSOR NETWORKS
1. International Journal of Computer Networks & Communications (IJCNC) Vol.6, No.5, September 2014
PERFORMANCE ANALYSIS OF CHANNEL ACCESS
MODEL FOR MAC IN RANDOMLY DISTRIBUTED
WIRELESS SENSOR NETWORKS
Ajay Sikandar1 and Sushil Kumar2
1School of Computer and Systems Sciences, Jawaharlal Nehru University, New Delhi
2School of Computer and Systems Sciences, Jawaharlal Nehru University, New Delhi
ABSTRACT
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.
KEYWORDS
MAC, channel access model, delay, throughput, energy, wireless sensor networks
1. INTRODUCTION
Wireless sensor networks (WSNs) consist of large number of distributed sensor nodes that
organize themselves into a multi-hop wireless network. A sensor node is a tiny device, which
consists of sensing unit, data processing unit, communicating data components. It is equipped
with a battery of limited power and operates in diverse environments. WSN is an emerging field
in wide range of applications such as environment monitoring, battlefield surveillance, habitat
monitoring, medical system and robotic exploration, etc. WSN is a technology that has grown
rapidly over the year with an increase in the development of new protocol. Sensor nodes sense
physical parameters such as temperature, pressure, sound waves, etc. and use their processing
ability to locally carry out simple computations required and partially processed data is
transmitted to the sink. Sensor network lifetime relies on the batteries of corresponding sensor
node since it carries limited power source. Sensor nodes can be deployed in the sensing field in
two ways: planned and random. In random deployment approach, sensor nodes are to be deployed
randomly in their hostile sensing field. In planned deployment, all or some of the sensor nodes are
to be deployed in well calculated ways and also maintenance in such type of network is
comparatively easy. There are many important issues such as routing, connectivity, localization
and channel access control [1, 2, 3].
Medium access control (MAC) is one of the important issues. The performance of a sensor
network depends on it. It provides mechanism of how sensor nodes access the same medium for
data transmission. This makes possible for several sensor nodes associated with the same physical
medium to share it. One fundamental task of the MAC protocol is to avoid collisions from
DOI : 10.5121/ijcnc.2014.6507 99
2. International Journal of Computer Networks & Communications (IJCNC) Vol.6, No.5, September 2014
contending sensor nodes. The IEEE 802.11 is a standard MAC protocol which uses virtual carrier
sensing and randomized back-offs to avoid collisions of the data packets [4]. The main design
goal of MAC protocol is to provide high throughput, minimize collision, reduce the delay and
minimize energy consumption. There exist many MAC protocols for WSNs in the literature, e.g.
S-MAC, T-MAC, B-MAC and D-MAC etc. MAC protocols can be categorized into two groups:
contention based and scheduled based. In the contention based protocol, reservation of time slots
for medium access is not done. Whenever a sensor node has a data packet to be transmitted, it
contends with its neighboring sensor nodes to access shared medium. In the scheduled based
protocol, the wake-up schedule is periodically broadcasted by all sensor nodes and their
neighbors’ schedule information is also maintained. The sensor nodes are then permitted to send
sensed information during the wake-up periods of receivers and save energy according to their
own schedules [5, 6].
Communication is the most energy consuming function among sensor nodes and thus, all network
communication protocols designed for sensor networks must be energy efficient in order to
optimize network life time [7]. The MAC protocol has direct control over the transceiver which is
most energy consuming part of a sensor node [8]. An important constraint in the wireless sensor
network is the amount of energy available to each node. The power consumption should be
uniform over the network to increase network life time. Otherwise there will be some portion of
the network consisting of dead sensor that will degrade the overall quality of service. Energy in
WSN is very precious resource due to limited battery power. Therefore, energy efficient MAC
protocols are required to use restricted energy sources for enhancing the lifetime of WSNs. A
great deal of research work shows that delay of channel accessing in burst data environment is a
brutal wastage of energy[9, 10].
In this paper, we propose a model for S-MAC protocol to reduce the delay in channel accessing in
high density randomly distributed wireless sensor networks. The m/m/1 queuing with Morkov
chain to calculate the average delay and throughput with and without memory is used. A
Mathematical model to calculate the energy consumption in a sensor network is presented. The
proposed model is simulated using MATLAB.
The rest of the paper is organized as follows: a survey of related work is given in section 2. In
section 3 we discuss the channel access model to calculate delay, throughput and energy
consumption. Section 4 presents the simulation results and discussion. Finally we conclude paper
in section 5.
100
2. RELATED WORK
MAC is a technique that enables the successful operation of the network. There have been
developed many MAC protocols for WSN. Sensor MAC [11] is a new MAC protocol specifically
developed for wireless sensor network. Authors consider collision avoidance to minimize
energy consumption. It reduces the collisions by utilizing combined scheduled and contention
schemes. This protocol tries to reduce energy consumption from the entire source that is
identified to cause energy wastage, i.e. idle listening, collision, over hearing avoidance by
utilizing a combined scheduled and contention scheme. The scheme is like this that each node
sleeps for some times and then wakeup and listens to see whether any other node wants to talk to
it. In Collision avoidance if multiple sensor nodes want to talk to a node at same time they need to
contend for medium to send the data. Among many contention protocols, the 802.11 performs
well for collision avoidance. For hidden terminal problem, S-MAC follows the RTS/CTS
exchange and scheduling exchanges are accomplished by periodic SYNC packet broadcasts to
immediate neighbours. Collision avoidance is achieved through carrier sensing .Furthermore,
RTS/CTS packet exchange is used for unicast-type data packets.
3. International Journal of Computer Networks & Communications (IJCNC) Vol.6, No.5, September 2014
T-MAC protocol [12] was designed to sort out certain discrepancies in traditional IEEE 802.11.
The novel idea of T-MAC protocol is to reduce idle listening by transmitting all massage in
burst of variable length and sleeping between burst. Every node periodically wakes up to
communicate with its neighbors, and then go to sleep again until the next frame. In [13] authors
aim to assign rate to users from the under lying rate region in order to minimize the average delay
in the system. The results of this protocol have two practical implications: first it gives a partial
analytical characterization for delay – optimal switch curve. Secondly it implies that we can
operate the queue optimally distributed. A similar delay minimization problem is discussed in
[14]. For establishing the relationship between average delay and transmission rate more
accurately and also to consider more general arrivals, they adopt a discrete time queuing model
and consider the problem from a bit prospective rather than a packet prospective. They partition
time slot into small slots. In this model, the number of bits transmitted in each slot is equal to
product of the transmission related channel use in each slot.
In PMAC [15] sleep/wakeup schedule for the whole network is dynamically made based on
throughput based on its own traffic and the traffic pattern of its neighbor and longer sleep periods
are given when network utilization is low. D MAC employs a staggered active/ sleep schedule.
Converge cast is the mostly observed communication pattern within sensor networks. Data
prediction is used to enable active slot request when multiple children of a node of a node have
packet to send in same sending slot. Unidirectional paths from sources to the sink could be
represented as data-gathering trees. The principal aim of DMAC [5] is to achieve very low
latency for converge cast communications. Wise MAC [16] is a novel energy efficient medium
access control protocol based on synchronized preamble sampling. By sampling the medium,
authors mean listening to radio channel for a short duration activity. Wise MAC protocol uses non
persistent CSMA with preamble sampling as into decrease idle listening. In preamble sampling
technique preamble precedes each data packet for altering the receiving node. It provides low
power consumption when channel is idle. In [17], authors investigate the delay-minimization
problem: given the wake-up rates of the sensor nodes, and how to optimally choose the any cast
forwarding policy to minimize the expected end-to-end delay from all sensor nodes to the sink. In
[18], author provides an analytical model that accurately evaluates the performance of SMAC
protocol under unsaturated conditions. The formulae of the energy consumption, throughput and
service delay are derived. In [19], author analytically analyzed the throughput performance
evaluation of the IEEE 801.11 Distributed Coordination Function (DCF). Author considers finite
number of terminals and idle channel conditions in the simulation.
In [20], a Morkov model to describe the behavior of SMAC with a finite queuing capacity and to
calculate throughput with and without retransmissions is presented. The throughputs under
variable number of node, queuing capacity, contention window size, many network conditions are
estimated using Morkov model. In [7] author propose adaptive and energy efficient TDMA based
MAC protocol for sensor networks. They claim that the protocol reduces energy consumption in
the network while in the network traffic and optimizing channel utilization through a timeslot
stealing mechanism. This protocol utilizes knowledge of a node timeslot in order to schedule
collision free transmission. In [21], Authors suggested an energy efficient hybrid MAC (EE-MAC)
protocol is highly emphasized due to its qualities like high packet delivery ratio, bounded
end to end delay across multiple hops, collision free operation, and increased lifetime. This
protocol, take advantage of multiple frequencies provided in recent WSN hardware platform and
it gives high packet delivery ratio and good energy efficiency. In [22], Author investigated
adaptive control algorithm, which is used to promote energy efficiency at MAC layer. This
scheme employs traffic load to balance the trade-off between collisions and control over head.
Energy model is introduced, which acquire balance point for the collision overhead trade off
applicable for each application. In this scheme, control threshold are used as minimum value
between the balance point and quality of service requirement so that the control packets should be
101
4. International Journal of Computer Networks & Communications (IJCNC) Vol.6, No.5, September 2014
adaptively transmitted according to the control threshold for the purpose of power saving as well
as quality of service guaranteed.
102
3. CHANNEL ACCESS MODEL
In this paper, the impact of scheduling at queue level and storage at sensor node level on overall
delay in MAC is analysed. Suppose we have an area of interest R x R. Sensors are randomly
distributed in the field following Poisson point process. In the first analysis, we suppose that data
is generated following Poisson distribution and whenever a sensor has a data to send, it will
immediately access the channel to send data. Once it got the chance it will send data. This process
keeps going. It is shown in the figure 1in which N sensors are trying to access the channel.
Figure 1. Multiple channel access
3.1. Delay Analysis without Memory
Now we analyse the average delay through channel to access sink by Markov chain process and
M/M/1 queuing model [23, 24]. A queue is shown in figure 2. We say that is the arrival rate of
the request from the sensors for the channel in the queue. We assume the arrival of request
follows the Poisson process.
Figure 2. Queuing model
S
We consider that the service time to the sensors is exponentially distributed with parameter μ. We
have to analyse the average waiting time for each sensor in the system. We say that system is in
state I if there are total I request in the queue. System goes from state I to I+1 if another request
comes in the system. If in state I a request is served it will go in state I-1. Such a state diagram is
shown in figure 3. We also assume that once a sensor will get the channel it sends all the data
what it might be collecting while being in the waiting in queue. Therefore the average waiting
time for the sensors in the queue is to be calculated.
5. International Journal of Computer Networks Communications (IJCNC) Vol.6, No.5, September 2014
103
Figure 3. State diagram for Markov chain
If rate of data generation is where
then in time data packet will be generated at
each sensor. So on average each sensor will be served for
6. packets in each access, if
we have to send N packets on average it will take time as follows, [1]
8. (2)
3.2 Analysis of delay with memory
Now, we analyse access of channel differently. We claim that if channel request from the whole
region follows Poisson distribution then request from individual sensors follows binomial
distribution. We can prove it as follows. We say that Poisson distribution is limiting case of
Binomial distribution.
Figure 4. Multiple channel access with memory
This is probability mass function for Poisson distribution. Applying this analysis we take a
sufficiently large storage at each sensor so that it can accommodate N data packet. Since N is
number of sensors in the field as well. We can say that data arrival in this storage is distributed
according to Poisson process. Sensors contend for accessing channel to send data only when this
9. International Journal of Computer Networks Communications (IJCNC) Vol.6, No.5, September 2014
storage if full. We have depicted this concept in figure 4. We claim that in this case arrival of
request follows Poisson distribution with mean as in previous case.
After this proof we calculate the average waiting time for each sensor for sensing N data packet.
This can be given by as follows [1].
104
(3)
(4)
3.3. Throughput Analysis with and without memory
In this section, the throughput of the proposed channel model is analysed. The throughput is
defined as the fraction of time the channel is used to successfully transmit payload bits. For this,
the assumptions are made as follows:
• There is a finite no of sensor nodes in the network.
• The data packet for transmission is always available in a sensor.
• Idle channel condition (no data have to transmit)
• The data packet have a fixed length
• Every sensor has memory and it can store N data packets.
There are N sensors which are contending to access the shared channel. After the completion of
each successful transmission, a packet is available immediately in a sensor node. Let be the
system throughput, In this case, we calculate the throughput of channel as follows [18]
!#$!%'())*!+,())-%(+!#$))(,-.
#-+/)0$1!#$))(,-.
2 34.35.
36.
(5)
Where E[N] is the average number of competing sensor nodes, E[b] represents average amount
of payload bits transmitted in a successful transmission and E[t] represents the average delay
[15,17,24]. Now we calculate the average number of competing sensor nodes using M/M/1
queuing system. The number of sensors follow birth and death process with rates + 7 8
97
7:
and
+
7 8
7:. The probability of n sensor in queue is given by
;+ =
= ?@A
8 97
: (6)
That is ;B
?@A
C?
D
E
FG E H
I (7)
Channel is stable for any E J 9 when N is fixed. However, if K L the stability condition is
E M
since the distribution of M/M/1/N converges to the distribution of M/M/1. Therefore, the
average number of competing sensor nodes is calculated as
N. 8;+
+
OB (8)
10. International Journal of Computer Networks Communications (IJCNC) Vol.6, No.5, September 2014
105
;+ E+;B (9)
N. ;B 8E+ +
OB (10)
N. CAFG
11. (11)
N. FG
PFG
(12)
N.
FG
PFG
(13)
Now, we analysis the throughput of the channel in with and without memory in the next sections
Case1: without memory
The throughput of the channel in without memory using (2), (5) and (13) can be expressed as
'.Q
GFG
F
FG
G
G
PFG
F
12. (14)
Case2: with memory
In this case, we take a sufficiently large storage at each sensor so that it can accommodate N data
packets. The throughput of the channel in with memory using (4), (5) and (13) can be expressed
as
'.Q
GFG
F
FG
G
G
PFG
(15)
3.3. Energy Consumption
We assume that the network consist of N contending sensor node. Channel can be in busy or idle
state. If channel becomes busy it means that there is on-going transmission in the channel
otherwise the channel is in the idle state. A channel may switch from busy to idle state or vase-versa
in active time. Switching from one state to another state is called the transition function
.Our goal is to minimize the energy consumption of a sensor node in wireless sensor network by
reducing the number of transition during its schedule period of active time. The arrival of data
packets to channel follows a Poisson process with mean arrival rate () per node. Service time of
sensor node follows exponential distribution with parameter
.
Figure 5. Two state Morkov chain Diagram for channel access
13. International Journal of Computer Networks Communications (IJCNC) Vol.6, No.5, September 2014
We use a two-state Markov chain in Fig. 5 to calculate the time periods (busy, idle) of the
channel. All sensor nodes competing for the channel access, sense the channel. When channel is
in idle state, the sensor node transmits the packet and when it get in busy state, sensor node wait
for the channel to become free. The probability ;( that the sensor node is in idle state [13, 18, 25]
is given by
;(
E (16)
106
We assume that ; is the probability that sensor node sense for the channel and is given by
; E (17)
Energy consumption in transmitting the packet can be calculated as
N)R )*!+,(($+ $S-*
(18)
Average energy consumption of the network, when using the channel is given by
NT ;)R N)R ;(N( ;N U$#,NU$#,
+
,OV (19)
+
,OV (20)
NT ;)R N)R
EN( EN U$#,NU$#,
whereN)R,N(,Nand NU$#, represent the average network energy consumption in successful
transmitting packet, idle, sensing, and collision of the packet and E represent the utilization of the
sensor node. Let ;)Rdenote the probability of successful transmission of packet in the channel. In
this case exactly one sensor node accessing the channel [19] can expressed as
W6X YZZ[G
Z[
If two or more sensor nodes are start transmitting during a given slot time, the transmitting
packets will collide. Let ;U$#represents collision probability under the assumption that all sensor
nodes in the system at steady state and transmit with probability , the collision probability [19] is
given by
;U$#
+
4. RESULTS AND DISCUSSION
The simulation result is obtained to analysis the performance proposed model in randomly
deployed sensor network. In the simulation, sensing field area 500*500 m2 is assumed. Sensors
are assumed to be homogeneous in all aspect. The event generates sensor data according to
binomial distribution. Data packet arrival follows Passion process with mean arrival rate . The
number of sensors to be deployed is assumed 1500. The transmission radius and sensing radius
of a sensor node are considered 20m and 10m respectively. The packet payload length is assumed
100bytes with MAC header of 8 bytes.
In figure 6, X axis represents the number of request in queue and y axis represents delay in
channel access. We have depicted comparison between channel access with memory and without
memory. The simulation result we obtain using equation (2) and (4). Figure show heavy Load for
value =4 and μ=5. Our proposed model with memory outperform the generic access model
without energy as we increase delay is both the case increase but it increase quite rapidly in the
case of model without memory. The amount of decrement in delay for the case of heavy load and
with memory can be realized by following factual data records of the results. For N=4, delay is
14. International Journal of Computer Networks Communications (IJCNC) Vol.6, No.5, September 2014
approximately equal for both the cases i.e. with memory and without memory whereas, for N=20,
delay is 4.1 for with memory case and it is 15.8 for without memory case.
107
Without Memory
With Memory
Heavy Load
0 2 4 6 8 10 12 14 16 18 20
16
14
12
10
8
6
4
2
0
Number Of Request[N]
Delay
Figure 6. General delay analysis for model with and without memory with heavy load
Without Memory
With Memory
Light Load
0 2 4 6 8 10 12 14 16 18 20
5
4.5
4
3.5
3
2.5
2
1.5
1
0.5
0
Number Of Request[N]
Delay
Figure 7. General delay analysis for model with and without memory with Light load
In figure 7, the result obtained for delay analysis under light load for value =1and μ=5. It is
observed that with increasing number requests, the difference between delays for with and
without memory is less. The amount decrement in delay for the case of light load and with
memory can be noticed by following actual data records of the results. For N=2, delay is equal for
both the cases i.e. with memory and without memory whereas, for N=20, delay is 4ms for with
memory case and it is 5ms for without memory case.
15. International Journal of Computer Networks Communications (IJCNC) Vol.6, No.5, September 2014
0 2 4 6 8 10 12 14 16 18 20
1
0.95
0.9
0.85
0.8
0.75
0.7
0.65
Figure 8. Throughput analysis for model with and without memory for heavy Load In this figure we show
108
graph for =4
In this simulation, we assume the payload bit is constant that is E [b] =100 bits and value =1 and
=4. Simulation results have been obtained from equation (14) and equation (15). In the figure 8,
the increase in throughput for the case of heavy load and with memory can be realized by
following actual data records of the results. For N=4, throughput is approximately equal for both
the cases i.e. with memory and without memory whereas, for N=20, throughput is 0.71 for with
memory case and it is 0.79 for without memory case.
0 2 4 6 8 10 12 14 16 18 20
1
0.95
0.9
0.85
0.8
0.75
0.7
0.65
Figure 9. Throughput analysis for model with and without memory for light load in this figure we show
graph for =1
0.6
Number Of Request[N]
Throughput
Without Memory
With Memory
Light Load
0.6
Number Of Request[N]
Throughput
Without Memory
With Memory
Heavy Load
16. International Journal of Computer Networks Communications (IJCNC) Vol.6, No.5, September 2014
From the figure 9, the increase in throughput for the case of light load and with memory can be
realized. For N=4 and N=10, throughput is approximately equal for both the cases i.e. with
memory and without memory whereas, for N=20, throughput is 0.70 for with memory case and it
is 0.76 for without memory case. It is noticed that throughput decreases as the number of requests
increase. We also observed that sufficient improvement in throughput in the case with memory as
compared to the case without memory.
109
5. CONCLUSION
In this paper, we analyze the delay, throughput and energy consumption of MAC protocols under
various network conditions and data arrival rates. Our proposed model is specifically aimed at
efficient reduction of delay in various MAC protocols developed for wireless sensor networks.
We have presented a simple analytical model to compute delay, throughput with and without
memory and energy consumption. Our model assumes finite number of sensor nodes and ideal
channel conditions. We have used queuing analysis technique with Markov chain, Poisson
distribution and memory to compute the throughput and delay. This novel approach of channel
access effectively reduces waiting time in queue during high load in a network. We have studied
and performed an analysis of the performance of our proposed model in standard S-MAC
protocol in terms of delay, throughput and energy consumption.
REFERENCES
[1] A. Sikandar S. Kumar, (2013) “Optimizing Delay for MAC in Randomly Distributed Wireless
Sensor Networks”, International Conference on advance Computing Networking and informatics
(ICACNI), Springer, Vol.243, pp 609-618.
[2] I. F. Akyildiz, W. Su, Y. Sankarasubramaniam E. Cayirci,(2002) “wireless sensor network: a
survey”, computer network, Vol. 38, No. 4, pp 393-422.
[3] J. yick, B. Mukherjee D. Ghosal,(2008) “Wireless sensor network survey”, computer network, Vol.
52, No.12, pp 2292-2330.
[4] W. Ye, J. Heidemann, D. Estrin, (2004) “Medium Access Control With Coordinated Adaptive
Sleeping for Wireless Sensor Networks”, IEEE/ACM Transections On Networking, Vol. 12, No. 3,
pp 493-506.
[5] G. Lu, B. Krishnamachari, C. S. Raghavendra, (2004) “An Adaptive Energy-Efficient and Low-
Latency MAC for Data Gathering in Wireless Sensor Networks”, 18th International Parallel and
Distributed Processing Symposium (IPDPS’04), pp 26-30.
[6] M. Ramakrishanan, P. Vanaja Ranjan, (2009) “Multi Channel MAC for Wireless Sensor Networks”
International journal of computer network and communication, Vol.1, No.2, pp 47-54.
[7] W. L. Tan, W. C. Lau O. Yue, (2012) “Performance analysis of an adaptive, energy-efficient MAC
protocol for wireless sensor network”, Journal of Parallel Distributed Computing , Vol. 72, No. 4, pp
504-514.
[8] K. Kredo P. Mohapatra, (2007) “Medium access control in wireless sensor network”, Computer
networks, Vol.51, No.4, pp 961-994.
[9] N. Tadayon, S. Khosshroo, E. Askari, H. Wang, H. Michel, (2013) “Power Management in SMAC –
based energy-harvesting wireless sensor networks using queuing analysis”, Journal of Computer
Application, pp 1008-1017.
[10] K. K Sharma, R. B Patel, H. Singh, (2010) “A reliable and energy efficient transport protocol for
wireless sensor networks” international journal of computer network and communication, Vol.2,
No.5, pp 92-103.
[11] W. Ye, J. Heidemann, D. Estrin, (2002) “An Energy-Efficient MAC Protocol for Wireless Sensor
Networks”, In Proceedings of the IEEE INFOCOM, New York, NY, US App. 1567–1576.
[12] T. V. Dam K. Langendoen, (2003) “An adaptive Energy Efficient MAC Protocol for Wireless
sensor network”, SenSys03, pp 1-10.
[13] J. Yang S. Ulukus, (2010) “Delay Minimization with a General Pentagon Rate Region”, ISIT 2010,
Austin, Texas, U.S.A., pp 1808 – 1812.
[14] J. Yang S. Ulukus (2009) “Delay Minimization in Multiple Access Channels” ISIT, Seoul, Korea,
IEEE, pp. 2366-2370.
17. International Journal of Computer Networks Communications (IJCNC) Vol.6, No.5, September 2014
[15] T. Zheng, S. Radhakrishnan V. Sarangan (2005) “PMAC: An adaptive energy efficient MAC
protocol for wireless sensor networks”, In: Proceedings of the IEEE International Parallel and
Distributed Processing Symposium, pp 65–72.
[16] A. E. Hoiydi, J. D. Decotignie, (2004) “Wise-MAC: An ultra low power MAC protocol for multihop
110
wireless sensor networks”, LNCS, Vol. 3121, pp 18-31.
[17] J. Kim, X. Lin, N. Shroff P. Sinha, (2010) “Minimizing Delay and Maximizing Lifetime for
Wireless Sensor Networks With Anycast”, IEEE/ACM Transections On Networking, Vol. 18, No. 2,
pp 515-528.
[18] Y. Zhang, C. He, and L. jiang, (2008) “Performance Analysis of S-MAC Protocol under Unsaturated
Condition”, IEEE Communication Letters, Vol.12, No. 3, pp 210-212.
[19] G. Biannchi, (2003) “Performance Analysis of the IEEE802.11 Distributed Coordination Function”,
IEEE Journal on Selected Area in Communications. Vol.18, No.3, pp 535-547.
[20] O. Yang W. Heinzelman, (2009) “Modelling and Throughput Analysis for SMAC with a finite
Queue Capacity”, Intelligent Sensors, Sensor Networks and Information Processing (ISSNIP), 5th
International Conference on, pp 409-414.
[21] B. Priya S. S. Manohar, (2013) “EE-MAC: Energy Efficient Hybrid MAC for WSN”, International
Journal of Distributed Sensor Networks, Vol. 2013, pp 1-9.
[22] Fei Peng, Bin Peng, Victor C. M. Leung, (2012) “ An Application Oriented Power Saving MAC
Protocol for Wireless Sensor Networks”, Wireless Personal Communications, Vol. 67, No.2, pp 279-
293.
[23] S.M. Ross, “Probability models for computer science. University of California berkeley,C A,
Elsevier.
[24] T. G. Robertazzi, “Computer Network and Systems, queueing theory and performance evaluation”,
springer verlag network.
[25] R. Rasouli, M. Ahmadi, A. ahmadvand, (2013) “Energy consumption Estimation in Clusterd Wireless
Sensor Networking using M/M/1 Queueing Model”, International journal of wireless mobile
networks, Vol.5,.No 1, pp 15-31.
Authors
Ajay Sikandar is currently a Ph.D. research scholar at School of Computer and
Systems Sciences, Jawaharlal Nehru University, New Delhi, India. His research
interests include Wireless Sensor Networks and Mobile Ad-hoc Networks. He received
his MCA and M. Tech degrees in Computer Science and Technology from School of
Computer and Systems Sciences, Jawaharlal Nehru University, New Delhi, India in
2003 and 2010, respectively, and B.Sc. degree in mathematics from Purvanchal University Jaunpur, India
in 1998.
Sushil Kumar received his Ph.D., M. Tech and MCA degrees in Computer Science
from School of Computer and Systems Sciences, Jawaharlal Nehru University, New
Delhi, India in 2014, 1999 and 1997 respectively, and B. Sc. degree in Mathematics
from Kanpur University, India in 1993. He is currently working as Assistant Professor
at School of Computer and Systems Sciences, Jawaharlal Nehru University, New
Delhi, India. His research interest includes vehicular ad hoc networks, mobile ad hoc
networks and wireless sensor networks. Dr. Kumar has published papers in
International Journals and Conferences including ACM, IEEE, Springer, Inderscience, and Hindawi.