This document discusses techniques for fast data collection in wireless sensor networks using a tree-based topology. It specifically focuses on minimizing the schedule length for aggregated convergecast (where data is aggregated at each hop) and raw-data convergecast (where packets are individually relayed to the sink).
It first considers time scheduling on a single channel, and then combines scheduling with transmission power control and multiple frequencies to further reduce interference and schedule length. It provides lower bounds on schedule length when interference is eliminated, and proposes algorithms that achieve these bounds.
Evaluation of different channel assignment methods, routing tree topologies, interference models, and their impact on schedule length is also presented. The key findings are that combining scheduling, power control,
An Adaptive Routing Algorithm for Communication Networks using Back Pressure...IJMER
The basic idea of backpressure techniques is to prioritize transmissions over links that have
the highest queue differentials. Backpressure method effectively makes packets flow through the network
as though pulled by gravity towards the destination end, which has the smallest queue size of zero. Under
high traffic conditions, this method works very well, and backpressure is able to fully utilize the available
network resources in a highly dynamic fashion. Under low traffic conditions, however, because many
other hosts may also have a small or zero queue size, there is inefficiency in terms of an increase in
delay, as packets may loop or take a long time to make their way to the destination end. In this paper we
use the concept of shadow queues. Each node has to maintain some counters, called as shadow queues,
per destination. This is very similar to the idea of maintaining a routing table (for routing purpose) per
destination. Using the concept of shadow queues, we partially decouple routing and the scheduling. A
shadow network is maintained to update a probabilistic routing table that packets use upon arrival at a
node. The same shadow network, with back-pressure technique, is used to activate transmissions between
nodes. The routing algorithm is designed to minimize the average number of hops used by the packets in
the network. This idea, along with the scheduling and routing decoupling, leads to delay reduction
compared with the traditional back-pressure algorithm
Efficient and Optimal Routing Scheme for Wireless Sensor Networkspaperpublications3
Abstract: The Wireless Sensor Networks (WSNs) have emerged as a new category of networking systems with limited computing, communication, and storage resources. In many sensing applications source nodes deliver packets to sink nodes via multiple hops, leading to the problem on how to find routes that enable all packets to be delivered in required time frames, while simultaneously taking into account factors such as energy efficiency and load balancing. To solve this problem one data collection protocol is developed called EDAL, which stands for Energy-efficient Delay-aware Lifetime-balancing data collection. Methods used are centralized heuristic and ant colony gossiping to find best energy efficient path. Then integrate EDAL with compressive sensing to reduce the amount of traffic generated and to reduce delay in the network.
I-Min: An Intelligent Fermat Point Based Energy Efficient Geographic Packet F...graphhoc
Energy consumption and delay incurred in packet delivery are the two important metrics for measuring the performance of geographic routing protocols for Wireless Adhoc and Sensor Networks (WASN). A protocol capable of ensuring both lesser energy consumption and experiencing lesser delay in packet delivery is thus suitable for networks which are delay sensitive and energy hungry at the same time. Thus a smart packet forwarding technique addressing both the issues is thus the one looked for by any geographic routing protocol. In the present paper we have proposed a Fermat point based forwarding technique which reduces the delay experienced during packet delivery as well as the energy consumed for transmission and reception of data packets.
Multiple Downlink Fair Packet Scheduling Scheme in Wi-MaxEditor IJCATR
IEEE 802.16 is standardization for a broadband wireless access in network metropolitan area network (MAN). IEEE 802.16
standard (Wi-Max) defines the concrete quality of service (QoS) requirement, a scheduling scheme and efficient packet scheduling
scheme which is necessary to achieve the QoS requirement. In this paper, a novel waiting queue based on downlink bandwidth
allocation architecture from a number of rtps schedule has been proposed to improve the performance of nrtPS services without any
impaction to other services. This paper proposes an efficient QoS scheduling scheme that satisfies both throughput and delay guarantee
to various real and non-real applications corresponding to different scheduling schemes for k=1,2,3,4. Simulation results show that
proposed scheduling scheme can provide a tight QoS guarantee in terms of delay for all types of traffic as defined in WiMax standards.
This process results in maintaining the fairness of allocation and helps to eliminate starvation of lower priority class services. The
authors propose a new efficient and generalized scheduling schemes for IEEE 802.16 broadband wireless access system reflecting the
delay requirements.
Congestion Prediction and Adaptive Rate Adjustment Technique for Wireless Sen...IJORCS
In general, nodes in Wireless Sensor Networks (WSNs) are equipped with limited battery and computation capabilities but the occurrence of congestion consumes more energy and computation power by retransmitting the data packets. Thus, congestion should be regulated to improve network performance. In this paper, we propose a congestion prediction and adaptive rate adjustment technique for Wireless Sensor Networks. This technique predicts congestion level using fuzzy logic system. Node degree, data arrival rate and queue length are taken as inputs to the fuzzy system and congestion level is obtained as an outcome. When the congestion level is amidst moderate and maximum ranges, adaptive rate adjustment technique is triggered. Our technique prevents congestion by controlling data sending rate and also avoids unsolicited packet losses. By simulation, we prove the proficiency our technique. It increases system throughput and network performance significantly.
MULTI-CLUSTER MULTI-CHANNEL SCHEDULING (MMS) ALGORITHM FOR MAXIMUM DATA COLLE...IJCNCJournal
Interference during data transmission can cause performance degradation like packet collisions in Wireless Sensor Networks (WSNs). While multi-channels available in IEEE 802.15.4 protocol standard WSN technology can be exploited to reduce interference, allocating channel and channel switching
algorithms can have a major impact on the performance of multi-channel communication. This paper presents an improved Fuzzy Logic based Cluster Formation and Cluster Head (CH) Selection algorithm with enhanced network lifetime for multi-cluster topology. The Multi-Cluster Multi-Channel Scheduling
(MMS) algorithm proposed in this paper improves the data collection by minimizing the maximum interference and collision. The presented work has developed Cluster formation and cluster head (CH) selection algorithm and Interference-free data communication by proper channel scheduled. The extensive
simulation and experimental outcomes prove that the proposed algorithm not only provides an interference-free transmission but also provides delay minimization and longevity of the network lifetime, which makes the presented algorithm suitable for energy-constrained wireless sensor networks.
An Adaptive Routing Algorithm for Communication Networks using Back Pressure...IJMER
The basic idea of backpressure techniques is to prioritize transmissions over links that have
the highest queue differentials. Backpressure method effectively makes packets flow through the network
as though pulled by gravity towards the destination end, which has the smallest queue size of zero. Under
high traffic conditions, this method works very well, and backpressure is able to fully utilize the available
network resources in a highly dynamic fashion. Under low traffic conditions, however, because many
other hosts may also have a small or zero queue size, there is inefficiency in terms of an increase in
delay, as packets may loop or take a long time to make their way to the destination end. In this paper we
use the concept of shadow queues. Each node has to maintain some counters, called as shadow queues,
per destination. This is very similar to the idea of maintaining a routing table (for routing purpose) per
destination. Using the concept of shadow queues, we partially decouple routing and the scheduling. A
shadow network is maintained to update a probabilistic routing table that packets use upon arrival at a
node. The same shadow network, with back-pressure technique, is used to activate transmissions between
nodes. The routing algorithm is designed to minimize the average number of hops used by the packets in
the network. This idea, along with the scheduling and routing decoupling, leads to delay reduction
compared with the traditional back-pressure algorithm
Efficient and Optimal Routing Scheme for Wireless Sensor Networkspaperpublications3
Abstract: The Wireless Sensor Networks (WSNs) have emerged as a new category of networking systems with limited computing, communication, and storage resources. In many sensing applications source nodes deliver packets to sink nodes via multiple hops, leading to the problem on how to find routes that enable all packets to be delivered in required time frames, while simultaneously taking into account factors such as energy efficiency and load balancing. To solve this problem one data collection protocol is developed called EDAL, which stands for Energy-efficient Delay-aware Lifetime-balancing data collection. Methods used are centralized heuristic and ant colony gossiping to find best energy efficient path. Then integrate EDAL with compressive sensing to reduce the amount of traffic generated and to reduce delay in the network.
I-Min: An Intelligent Fermat Point Based Energy Efficient Geographic Packet F...graphhoc
Energy consumption and delay incurred in packet delivery are the two important metrics for measuring the performance of geographic routing protocols for Wireless Adhoc and Sensor Networks (WASN). A protocol capable of ensuring both lesser energy consumption and experiencing lesser delay in packet delivery is thus suitable for networks which are delay sensitive and energy hungry at the same time. Thus a smart packet forwarding technique addressing both the issues is thus the one looked for by any geographic routing protocol. In the present paper we have proposed a Fermat point based forwarding technique which reduces the delay experienced during packet delivery as well as the energy consumed for transmission and reception of data packets.
Multiple Downlink Fair Packet Scheduling Scheme in Wi-MaxEditor IJCATR
IEEE 802.16 is standardization for a broadband wireless access in network metropolitan area network (MAN). IEEE 802.16
standard (Wi-Max) defines the concrete quality of service (QoS) requirement, a scheduling scheme and efficient packet scheduling
scheme which is necessary to achieve the QoS requirement. In this paper, a novel waiting queue based on downlink bandwidth
allocation architecture from a number of rtps schedule has been proposed to improve the performance of nrtPS services without any
impaction to other services. This paper proposes an efficient QoS scheduling scheme that satisfies both throughput and delay guarantee
to various real and non-real applications corresponding to different scheduling schemes for k=1,2,3,4. Simulation results show that
proposed scheduling scheme can provide a tight QoS guarantee in terms of delay for all types of traffic as defined in WiMax standards.
This process results in maintaining the fairness of allocation and helps to eliminate starvation of lower priority class services. The
authors propose a new efficient and generalized scheduling schemes for IEEE 802.16 broadband wireless access system reflecting the
delay requirements.
Congestion Prediction and Adaptive Rate Adjustment Technique for Wireless Sen...IJORCS
In general, nodes in Wireless Sensor Networks (WSNs) are equipped with limited battery and computation capabilities but the occurrence of congestion consumes more energy and computation power by retransmitting the data packets. Thus, congestion should be regulated to improve network performance. In this paper, we propose a congestion prediction and adaptive rate adjustment technique for Wireless Sensor Networks. This technique predicts congestion level using fuzzy logic system. Node degree, data arrival rate and queue length are taken as inputs to the fuzzy system and congestion level is obtained as an outcome. When the congestion level is amidst moderate and maximum ranges, adaptive rate adjustment technique is triggered. Our technique prevents congestion by controlling data sending rate and also avoids unsolicited packet losses. By simulation, we prove the proficiency our technique. It increases system throughput and network performance significantly.
MULTI-CLUSTER MULTI-CHANNEL SCHEDULING (MMS) ALGORITHM FOR MAXIMUM DATA COLLE...IJCNCJournal
Interference during data transmission can cause performance degradation like packet collisions in Wireless Sensor Networks (WSNs). While multi-channels available in IEEE 802.15.4 protocol standard WSN technology can be exploited to reduce interference, allocating channel and channel switching
algorithms can have a major impact on the performance of multi-channel communication. This paper presents an improved Fuzzy Logic based Cluster Formation and Cluster Head (CH) Selection algorithm with enhanced network lifetime for multi-cluster topology. The Multi-Cluster Multi-Channel Scheduling
(MMS) algorithm proposed in this paper improves the data collection by minimizing the maximum interference and collision. The presented work has developed Cluster formation and cluster head (CH) selection algorithm and Interference-free data communication by proper channel scheduled. The extensive
simulation and experimental outcomes prove that the proposed algorithm not only provides an interference-free transmission but also provides delay minimization and longevity of the network lifetime, which makes the presented algorithm suitable for energy-constrained wireless sensor networks.
DYNAMIC TASK SCHEDULING BASED ON BURST TIME REQUIREMENT FOR CLOUD ENVIRONMENTIJCNCJournal
Cloud computing has an indispensable role in the modern digital scenario. The fundamental challenge of cloud systems is to accommodate user requirements which keep on varying. This dynamic cloud environment demands the necessity of complex algorithms to resolve the trouble of task allotment. The overall performance of cloud systems is rooted in the efficiency of task scheduling algorithms. The dynamic property of cloud systems makes it challenging to find an optimal solution satisfying all the evaluation metrics. The new approach is formulated on the Round Robin and the Shortest Job First algorithms. The Round Robin method reduces starvation, and the Shortest Job First decreases the average waiting time. In this work, the advantages of both algorithms are incorporated to improve the makespan of user tasks.
Multilevel priority packet scheduling scheme for wireless networksijdpsjournal
Scheduling different types of packets such as real
-
time and non
-
real time data packets in wireless links is
necessary to reduce energy consumption of the wireless device. Most of the existing packet schedulin
g
mechanism uses opportunistic transmission sche
duling, in which communication is postponed upto an
acceptable time deadline until the best expected channel conditions to transmit are found. This algo
rithm
incurs a large processing overhead and more energy consumption. In this paper we propose a Dynamic
Multilevel Queue Scheduling algorithm. In the proposed scheme, the ready queue is partitioned into t
hree
levels of priority queues. Real
-
time packets are placed into the highest priority queue and non
-
real time
data packets are placed into two other queue
s. We evaluate the performance of the proposed Dynamic
Multilevel Queue Scheduling scheme through simulations for real
-
time and non
-
real time data. Simulation
results illustrate that the Multilevel Priority packet scheduling scheme overcomes the convention
al methods
interms of average data waiting time and end
-
to
-
end delay
Optimal resource allocation in networked control systems using viterbi algorithmjournalBEEI
This paper presents an optimal bandwidth allocation method for a networked control system (NCS) which includes time-driven sensor, event-driven controller and random channels. A hidden markov model (HMM) with a discretized state space is formulated for the random traffic to predict the network states using a suitable data window. Network bandwidth is allocated based on the predicted traffic state subject to bounds on the deterministic traffic that guarantee acceptable NCS performance and do not exceed hardware limitations. Bandwidth allocation uses minimization of unmet bandwidth demand. A stability condition is derived for a variable but bounded sampling period interval. Computer simulation results show the effect of varying the number of discrete states for the HMM and the window width on bandwidth allocation. The results compare favorably with a published approach based on fuzzy logic.
SECTOR TREE-BASED CLUSTERING FOR ENERGY EFFICIENT ROUTING PROTOCOL IN HETEROG...IJCNCJournal
One of the main challenges for researchers to build routing protocols is how to use energy efficiently to extend the lifespan of the whole wireless sensor networks (WSN) because sensor nodes have limited battery power resources. In this work, we propose a Sector Tree-Based clustering routing protocol (STB-EE) for Energy Efficiency to cope with this problem, where the entire network area is partitioned into dynamic sectors (clusters), which balance the number of alive nodes. The nodes in each sector only communicate with their nearest neighbour by constructing a minimum tree based on the Kruskal algorithm and using mixed distance from candidate node to base station (BS) and remaining energy of candidate nodes to determine which node will become the cluster head (CH) in each cluster? By calculating the duration of time in each round for suitability, STB-EE increases the number of data packets sent to the BS. Our simulation results show that the network lifespan using STB-EE can be improved by about 16% and 10% in comparison to power-efficient gathering in sensor information system (PEGASIS) and energy-efficient PEGASIS-based protocol (IEEPB), respectively.
Fuzzy-controlled Scheduling of Real Time Data Packets (FSRP) in Mobile Ad Hoc...A. Sufian
Abstract—In ad hoc networks, the data packets can be mainly classified into two categories – real time and
non-real time. Definitely the scheduling of real time data packets is going to be different from non-real time
ones. The deadline of delivery is a very important criterion to be met in case of real time packets. The other
requirements like velocity and energy concerns are enforced by the inherent dynamic nature of ad hoc
networks. Sometimes it becomes completely unnecessary to forward a real time data packet when the deadline
is impossible to meet or when the destination is on the verge of death. Also if the source nodes start sending
real time packets at a very high rate, then it will not only increase congestion in the network but also hamper
the forwarding of non real time packets since non real times have priority lesser than the real time packets.
The present algorithm FSRP is designed considering all these factors and the performance improvement it
produces is very significant compared to other state of the art scheduling protocols.
A New Efficient Cache Replacement Strategy for Named Data NetworkingIJCNCJournal
The Information-Centric Network (ICN) is a future internet architecture with efficient content retrieval and distribution. Named Data Networking (NDN) is one of the proposed architectures for ICN. NDN’s innetwork caching improves data availability, reduce retrieval delays, network load, alleviate producer load, and limit data traffic. Despite the existence of several caching decision algorithms, the fetching and distribution of contents with minimum resource utilization remains a great challenge. In this paper, we introduce a new cache replacement strategy called Enhanced Time and Frequency Cache Replacement strategy (ETFCR) where both cache hit frequency and cache retrieval time are used to select evicted data chunks. ETFCR adds time cycles between the last two requests to adjust data chunk’s popularity and cache hits. We conducted extensive simulations using the ccnSim simulator to evaluate the performance of ETFCR and compare it to that of some well-known cache replacement strategies. Simulations results show that ETFCR outperforms the other cache replacement strategies in terms of cache hit ratio, and lower content retrieval delay.
Implementation of optimal solution for network lifetime and energy consumptio...TELKOMNIKA JOURNAL
In current scenarios MANET mainly focus on low power battery operated devices. Moreover in a MANET transmission of large data consumes more energy that affects the performance of network, energy consumption, throughput, end to end delay, and packet overhead. The sum of these parameter metrics measure must be taken into account to increase the life-time and network energy efficiency. The main constraint in WSN is due to the restricted power in a node, which cannot be substituted. The node senses the data and it is moved towards the sink. This action of data movement needs to be efficient and the usage of battery in the sensor node requires to be efficiently employed to improve the network lifetime. The development of the energy efficient algorithms is of primary concern in the research arena of MANET. In any network, most of the routing protocols are focused directly to collect and bifurcate the large data for long distance communication. The prime goal of this research focused to identifies and survey more suitable routing protocol for MANET. That consumed less energy and increase life time of network. In this paper the author made on attempt on improved energy efficient LEACH protocol for MANET to reduce the energy dissipation that to life time of the network during the data transmission between source nodes and destination nodes.
AN EFFECTIVE CONTROL OF HELLO PROCESS FOR ROUTING PROTOCOL IN MANETSIJCNCJournal
In the mobile ad hoc network (MANET) update of link connectivity is necessary to refresh the neighbor tables in data transfer. A existing hello process periodically exchanges the link connectivity information, which is not adequate for dynamic topology. Here, slow update of neighbour table entries causes link failures which affect performance parameter as packet drop, maximum delay, energy consumption, and reduced throughput. In the dynamic hello technique, new neighbour nodes and lost neighbour nodes are used to compute link change rate (LCR) and hello-interval/refresh rate (r). Exchange of link connectivity information at a fast rate consumes unnecessary bandwidth and energy. In MANET resource wastage can be controlled by avoiding the re-route discovery, frequent error notification, and local repair in the entire network. We are enhancing the existing hello process, which shows significant improvement in performance.
Fuzzy Route Switching for Energy Preservation(FEP) in Ad Hoc NetworksA. Sufian
Nodes in ad hoc networks have limited battery power. Hence they require energy-efficient technique to improve average
network performance. Maintaining energy-efficiency in ad hoc networks is really challenging because highest energyefficiency
is achieved if all the nodes are always switched off and energy-efficiency will be minimum if all the nodes are
fully operational i.e. always turned-on. Energy preservation requires redirection of data packets through some other routes
having good performance. This improves data packet delivery ratio and number of alive nodes decreasing cost of messages.
Enchancing the Data Collection in Tree based Wireless Sensor Networksijsrd.com
Number of techniques used in Wireless Sensor Network to improve data collection from sensor nodes. It achieve by minimize the schedule length and dynamic channel assignment. Schedule length minimized by BFS algorithm without interfering links. Interfering links can be eliminated by transmission power control and multi frequency. The power can be save by using beacon signal. Collection of data can also be limited by topology of network. So the nodes are arranged in form. The capacitated minimal spanning trees and degree- constrained spanning trees give significant improvement in scheduling. Finally the data collection is enhancing in terms of security by using T-Hash Chain algorithm.
DYNAMIC CONGESTION CONTROL IN WDM OPTICAL NETWORKcscpconf
This paper is based on Wavelength Division Multiplexing (WDM) optical networking. In this optical networking, prior to data transfer, lightpath establishment between source and
destination nodes is usually carried out through a wavelength reservation protocol. This wavelength is reserved corresponding to a route between the source and destination and the
route is chosen following any standard routing protocol based on shortest path. The backward reservation protocol is implemented initially. A fixed connected and weighted network is
considered. The inputs of this implementation are the fixed network itself and its corresponding shortest path matrix. After this initial level of implementation, the average node usage over a time period is calculated and various thresholds for node usage are considered. Above threshold value, request arriving at that path selects its next shortest path. This concept is
implemented on various wavelengths. The output represents the performance issues of dynamic congestion control.
Delay Constrained Energy Efficient Data Transmission over WSNpaperpublications3
Abstract: In wireless sensor network generally concentrate on minimization of energy Consumption, Also reducing energy saving and end to end delay. Reduced the end to end delay is one of the main challenges in the Wireless Sensor Networks. In TDMA providing reliable packet transmission and two transmission scheduling schemes are used to maximize the end-end reliability within a delay bound in packet transmission called dedicated scheduling and shared scheduling. In addition, they formulate solutions for implementing two algorithms into two basic routing algorithms, single-path routing and any-path routing algorithm. The proposed system presented energy efficient sleep scheduling algorithm for reducing the energy for delay constrained in WLAN. This algorithm to maximize the energy saving for packet delay constraints and it determines sleep period and wake up time to be minimized, the aim of this project is proposed to maximize the length of sleep time under packet deadline constraints using green call algorithm. Keywords: Delay-constrained applications, energy efficiency, Sleep scheduling, wireless sensor network.
Title: Delay Constrained Energy Efficient Data Transmission over WSN
Author: H. Hasina Begaum
ISSN 2350-1022
International Journal of Recent Research in Mathematics Computer Science and Information Technology
Paper Publications
Analysing Mobile Random Early Detection for Congestion Control in Mobile Ad-h...IJECEIAES
This research paper suggests and analyse a technique for congestion control in mobile ad hoc networks. The technique is based on a new hybrid approach that uses clustering and queuing techniques. In clustering, in general cluster head transfers the data, following a queuing method based on a RED (Random Early Detection), the mobile environment makes it Mobile RED (or MRED), It majorly depends upon mobility of nodes and mobile environments leads to unpredictable queue size. To simulate this technique, the Network Simulator 2 (or NS2) is used for various scenarios. The simulated results are compared with NRED (Neighbourhood Random Early Detection) queuing technique of congestion control. It has been observed that the results are improved using MRED comparatively.
Congestion is said to occur in the network when the resource demands exceed the capacity and packets are lost due to too much queuing in the network. During congestion, the network throughput may drop to zero and the path delay may become very high. A congestion control scheme helps the network to recover from the congestion state. In fact, security plays a vital role in Wireless Ad hoc network. This paper presents a systematic literature review to provide comprehensive and unbiased information about various current model Congestion Control conceptions, proposals, problems and solutions in Ad hoc for safety transportation. For this purpose, a total of 33 articles related to the security model in Congestion Control published between 2008 and 2013 were extracted from the most relevant scientific sources (IEEE Computer Society, ACM Digital Library, Springer Link and Science Direct). However, 18 articles were eventually analyzed due to several reasons such as relevancy and comprehensiveness of discussion presented in the articles. Using the systematic method of review, this paper succeeds to reveal the main security threats and Error control, challenges for security, security requirement in Congestion Control in Wireless Ad hoc network (CCWAN) and future research within this scope.
High Performance Germanium Double Gate N-MOSFETIJMER
The current MOSFET technology supports scaling down to nanometer. To achieve
enhanced transistor switching, it is difficult to keep the equivalent driver current at the same level
since it changes by the certain restrictions like effective masses, density of states, uniaxial- and
biaxial- strain; band structure, channel orientation, channel mobility, off-state leakage, switching
delay in nano-scale and parasitic latch up. Current strained-Si is the ruling technology for
intensifying the performance of MOSFET and development of strain can provide a better solution to
the scaling. The future of nano-scale MOSFETs relies on exploration of novel higher mobility channel
materials such as stained-Ge and strained III-V groups that might perform even better than very
highly strained-Si. In addition, parameters such as injection velocity, short channel length effect and
Band-to-Band Tunneling (BTBT) result in reduction of inversion charge, increase in leakage current,
resulting in decrease in the drive current. While developing accurate model of MOSFETs all these
complex effects should be captured. It is proposed to
1. Design high performance double gate n-MOSFET with channel material Ge.
2. Benchmarked & stimulate high performance double gate n-MOSFET by using the simulation
techniques.
DYNAMIC TASK SCHEDULING BASED ON BURST TIME REQUIREMENT FOR CLOUD ENVIRONMENTIJCNCJournal
Cloud computing has an indispensable role in the modern digital scenario. The fundamental challenge of cloud systems is to accommodate user requirements which keep on varying. This dynamic cloud environment demands the necessity of complex algorithms to resolve the trouble of task allotment. The overall performance of cloud systems is rooted in the efficiency of task scheduling algorithms. The dynamic property of cloud systems makes it challenging to find an optimal solution satisfying all the evaluation metrics. The new approach is formulated on the Round Robin and the Shortest Job First algorithms. The Round Robin method reduces starvation, and the Shortest Job First decreases the average waiting time. In this work, the advantages of both algorithms are incorporated to improve the makespan of user tasks.
Multilevel priority packet scheduling scheme for wireless networksijdpsjournal
Scheduling different types of packets such as real
-
time and non
-
real time data packets in wireless links is
necessary to reduce energy consumption of the wireless device. Most of the existing packet schedulin
g
mechanism uses opportunistic transmission sche
duling, in which communication is postponed upto an
acceptable time deadline until the best expected channel conditions to transmit are found. This algo
rithm
incurs a large processing overhead and more energy consumption. In this paper we propose a Dynamic
Multilevel Queue Scheduling algorithm. In the proposed scheme, the ready queue is partitioned into t
hree
levels of priority queues. Real
-
time packets are placed into the highest priority queue and non
-
real time
data packets are placed into two other queue
s. We evaluate the performance of the proposed Dynamic
Multilevel Queue Scheduling scheme through simulations for real
-
time and non
-
real time data. Simulation
results illustrate that the Multilevel Priority packet scheduling scheme overcomes the convention
al methods
interms of average data waiting time and end
-
to
-
end delay
Optimal resource allocation in networked control systems using viterbi algorithmjournalBEEI
This paper presents an optimal bandwidth allocation method for a networked control system (NCS) which includes time-driven sensor, event-driven controller and random channels. A hidden markov model (HMM) with a discretized state space is formulated for the random traffic to predict the network states using a suitable data window. Network bandwidth is allocated based on the predicted traffic state subject to bounds on the deterministic traffic that guarantee acceptable NCS performance and do not exceed hardware limitations. Bandwidth allocation uses minimization of unmet bandwidth demand. A stability condition is derived for a variable but bounded sampling period interval. Computer simulation results show the effect of varying the number of discrete states for the HMM and the window width on bandwidth allocation. The results compare favorably with a published approach based on fuzzy logic.
SECTOR TREE-BASED CLUSTERING FOR ENERGY EFFICIENT ROUTING PROTOCOL IN HETEROG...IJCNCJournal
One of the main challenges for researchers to build routing protocols is how to use energy efficiently to extend the lifespan of the whole wireless sensor networks (WSN) because sensor nodes have limited battery power resources. In this work, we propose a Sector Tree-Based clustering routing protocol (STB-EE) for Energy Efficiency to cope with this problem, where the entire network area is partitioned into dynamic sectors (clusters), which balance the number of alive nodes. The nodes in each sector only communicate with their nearest neighbour by constructing a minimum tree based on the Kruskal algorithm and using mixed distance from candidate node to base station (BS) and remaining energy of candidate nodes to determine which node will become the cluster head (CH) in each cluster? By calculating the duration of time in each round for suitability, STB-EE increases the number of data packets sent to the BS. Our simulation results show that the network lifespan using STB-EE can be improved by about 16% and 10% in comparison to power-efficient gathering in sensor information system (PEGASIS) and energy-efficient PEGASIS-based protocol (IEEPB), respectively.
Fuzzy-controlled Scheduling of Real Time Data Packets (FSRP) in Mobile Ad Hoc...A. Sufian
Abstract—In ad hoc networks, the data packets can be mainly classified into two categories – real time and
non-real time. Definitely the scheduling of real time data packets is going to be different from non-real time
ones. The deadline of delivery is a very important criterion to be met in case of real time packets. The other
requirements like velocity and energy concerns are enforced by the inherent dynamic nature of ad hoc
networks. Sometimes it becomes completely unnecessary to forward a real time data packet when the deadline
is impossible to meet or when the destination is on the verge of death. Also if the source nodes start sending
real time packets at a very high rate, then it will not only increase congestion in the network but also hamper
the forwarding of non real time packets since non real times have priority lesser than the real time packets.
The present algorithm FSRP is designed considering all these factors and the performance improvement it
produces is very significant compared to other state of the art scheduling protocols.
A New Efficient Cache Replacement Strategy for Named Data NetworkingIJCNCJournal
The Information-Centric Network (ICN) is a future internet architecture with efficient content retrieval and distribution. Named Data Networking (NDN) is one of the proposed architectures for ICN. NDN’s innetwork caching improves data availability, reduce retrieval delays, network load, alleviate producer load, and limit data traffic. Despite the existence of several caching decision algorithms, the fetching and distribution of contents with minimum resource utilization remains a great challenge. In this paper, we introduce a new cache replacement strategy called Enhanced Time and Frequency Cache Replacement strategy (ETFCR) where both cache hit frequency and cache retrieval time are used to select evicted data chunks. ETFCR adds time cycles between the last two requests to adjust data chunk’s popularity and cache hits. We conducted extensive simulations using the ccnSim simulator to evaluate the performance of ETFCR and compare it to that of some well-known cache replacement strategies. Simulations results show that ETFCR outperforms the other cache replacement strategies in terms of cache hit ratio, and lower content retrieval delay.
Implementation of optimal solution for network lifetime and energy consumptio...TELKOMNIKA JOURNAL
In current scenarios MANET mainly focus on low power battery operated devices. Moreover in a MANET transmission of large data consumes more energy that affects the performance of network, energy consumption, throughput, end to end delay, and packet overhead. The sum of these parameter metrics measure must be taken into account to increase the life-time and network energy efficiency. The main constraint in WSN is due to the restricted power in a node, which cannot be substituted. The node senses the data and it is moved towards the sink. This action of data movement needs to be efficient and the usage of battery in the sensor node requires to be efficiently employed to improve the network lifetime. The development of the energy efficient algorithms is of primary concern in the research arena of MANET. In any network, most of the routing protocols are focused directly to collect and bifurcate the large data for long distance communication. The prime goal of this research focused to identifies and survey more suitable routing protocol for MANET. That consumed less energy and increase life time of network. In this paper the author made on attempt on improved energy efficient LEACH protocol for MANET to reduce the energy dissipation that to life time of the network during the data transmission between source nodes and destination nodes.
AN EFFECTIVE CONTROL OF HELLO PROCESS FOR ROUTING PROTOCOL IN MANETSIJCNCJournal
In the mobile ad hoc network (MANET) update of link connectivity is necessary to refresh the neighbor tables in data transfer. A existing hello process periodically exchanges the link connectivity information, which is not adequate for dynamic topology. Here, slow update of neighbour table entries causes link failures which affect performance parameter as packet drop, maximum delay, energy consumption, and reduced throughput. In the dynamic hello technique, new neighbour nodes and lost neighbour nodes are used to compute link change rate (LCR) and hello-interval/refresh rate (r). Exchange of link connectivity information at a fast rate consumes unnecessary bandwidth and energy. In MANET resource wastage can be controlled by avoiding the re-route discovery, frequent error notification, and local repair in the entire network. We are enhancing the existing hello process, which shows significant improvement in performance.
Fuzzy Route Switching for Energy Preservation(FEP) in Ad Hoc NetworksA. Sufian
Nodes in ad hoc networks have limited battery power. Hence they require energy-efficient technique to improve average
network performance. Maintaining energy-efficiency in ad hoc networks is really challenging because highest energyefficiency
is achieved if all the nodes are always switched off and energy-efficiency will be minimum if all the nodes are
fully operational i.e. always turned-on. Energy preservation requires redirection of data packets through some other routes
having good performance. This improves data packet delivery ratio and number of alive nodes decreasing cost of messages.
Enchancing the Data Collection in Tree based Wireless Sensor Networksijsrd.com
Number of techniques used in Wireless Sensor Network to improve data collection from sensor nodes. It achieve by minimize the schedule length and dynamic channel assignment. Schedule length minimized by BFS algorithm without interfering links. Interfering links can be eliminated by transmission power control and multi frequency. The power can be save by using beacon signal. Collection of data can also be limited by topology of network. So the nodes are arranged in form. The capacitated minimal spanning trees and degree- constrained spanning trees give significant improvement in scheduling. Finally the data collection is enhancing in terms of security by using T-Hash Chain algorithm.
DYNAMIC CONGESTION CONTROL IN WDM OPTICAL NETWORKcscpconf
This paper is based on Wavelength Division Multiplexing (WDM) optical networking. In this optical networking, prior to data transfer, lightpath establishment between source and
destination nodes is usually carried out through a wavelength reservation protocol. This wavelength is reserved corresponding to a route between the source and destination and the
route is chosen following any standard routing protocol based on shortest path. The backward reservation protocol is implemented initially. A fixed connected and weighted network is
considered. The inputs of this implementation are the fixed network itself and its corresponding shortest path matrix. After this initial level of implementation, the average node usage over a time period is calculated and various thresholds for node usage are considered. Above threshold value, request arriving at that path selects its next shortest path. This concept is
implemented on various wavelengths. The output represents the performance issues of dynamic congestion control.
Delay Constrained Energy Efficient Data Transmission over WSNpaperpublications3
Abstract: In wireless sensor network generally concentrate on minimization of energy Consumption, Also reducing energy saving and end to end delay. Reduced the end to end delay is one of the main challenges in the Wireless Sensor Networks. In TDMA providing reliable packet transmission and two transmission scheduling schemes are used to maximize the end-end reliability within a delay bound in packet transmission called dedicated scheduling and shared scheduling. In addition, they formulate solutions for implementing two algorithms into two basic routing algorithms, single-path routing and any-path routing algorithm. The proposed system presented energy efficient sleep scheduling algorithm for reducing the energy for delay constrained in WLAN. This algorithm to maximize the energy saving for packet delay constraints and it determines sleep period and wake up time to be minimized, the aim of this project is proposed to maximize the length of sleep time under packet deadline constraints using green call algorithm. Keywords: Delay-constrained applications, energy efficiency, Sleep scheduling, wireless sensor network.
Title: Delay Constrained Energy Efficient Data Transmission over WSN
Author: H. Hasina Begaum
ISSN 2350-1022
International Journal of Recent Research in Mathematics Computer Science and Information Technology
Paper Publications
Analysing Mobile Random Early Detection for Congestion Control in Mobile Ad-h...IJECEIAES
This research paper suggests and analyse a technique for congestion control in mobile ad hoc networks. The technique is based on a new hybrid approach that uses clustering and queuing techniques. In clustering, in general cluster head transfers the data, following a queuing method based on a RED (Random Early Detection), the mobile environment makes it Mobile RED (or MRED), It majorly depends upon mobility of nodes and mobile environments leads to unpredictable queue size. To simulate this technique, the Network Simulator 2 (or NS2) is used for various scenarios. The simulated results are compared with NRED (Neighbourhood Random Early Detection) queuing technique of congestion control. It has been observed that the results are improved using MRED comparatively.
Congestion is said to occur in the network when the resource demands exceed the capacity and packets are lost due to too much queuing in the network. During congestion, the network throughput may drop to zero and the path delay may become very high. A congestion control scheme helps the network to recover from the congestion state. In fact, security plays a vital role in Wireless Ad hoc network. This paper presents a systematic literature review to provide comprehensive and unbiased information about various current model Congestion Control conceptions, proposals, problems and solutions in Ad hoc for safety transportation. For this purpose, a total of 33 articles related to the security model in Congestion Control published between 2008 and 2013 were extracted from the most relevant scientific sources (IEEE Computer Society, ACM Digital Library, Springer Link and Science Direct). However, 18 articles were eventually analyzed due to several reasons such as relevancy and comprehensiveness of discussion presented in the articles. Using the systematic method of review, this paper succeeds to reveal the main security threats and Error control, challenges for security, security requirement in Congestion Control in Wireless Ad hoc network (CCWAN) and future research within this scope.
High Performance Germanium Double Gate N-MOSFETIJMER
The current MOSFET technology supports scaling down to nanometer. To achieve
enhanced transistor switching, it is difficult to keep the equivalent driver current at the same level
since it changes by the certain restrictions like effective masses, density of states, uniaxial- and
biaxial- strain; band structure, channel orientation, channel mobility, off-state leakage, switching
delay in nano-scale and parasitic latch up. Current strained-Si is the ruling technology for
intensifying the performance of MOSFET and development of strain can provide a better solution to
the scaling. The future of nano-scale MOSFETs relies on exploration of novel higher mobility channel
materials such as stained-Ge and strained III-V groups that might perform even better than very
highly strained-Si. In addition, parameters such as injection velocity, short channel length effect and
Band-to-Band Tunneling (BTBT) result in reduction of inversion charge, increase in leakage current,
resulting in decrease in the drive current. While developing accurate model of MOSFETs all these
complex effects should be captured. It is proposed to
1. Design high performance double gate n-MOSFET with channel material Ge.
2. Benchmarked & stimulate high performance double gate n-MOSFET by using the simulation
techniques.
An Experimental Investigation of Capacity Utilization in Manufacturing Indus...IJMER
In the modern day competitive world, every organization demands an effective utilization of
capacity. Capacity Utilization means the maximum amount of output that can be produced in the short run of time. A lot of planning is necessary for the proper management of capacity. Capacity planning is one side of a coin and capacity management is the other. The capacity plans needs to be executed flawlessly, with unpleasant surprises avoided. A managerial problem is to match the capacity with the plans. Companies whether labour or machine intensive have a CI trend that remains fairly constant in
that particular sector. For example a company will have a monthly cumulative CI trend that could be compared with any other company trend within the same market. The present paper makes an attempt to study the most important parameter of the organization i.e capacity utilization of a company
A Review of Routing Protocols for Wireless Sensor NetworkIJMER
A wireless sensor network is a collection of nodes organized into a cooperative network. Each node consists of processing capability, may contain multiple types of memory, have a RF transceiver, have a power source, and accommodate various sensors and actuators. The nodes
communicate wirelessly and often self-organize after being deployed in an ad hoc fashion. Routing protocols for wireless sensor networks are responsible for maintaining the routes in the network and have to ensure reliable multi-hop communication .The performance of the network is
greatly influenced by the routing techniques. Routing is to find out the path to route the sensed data to the base station. In this paper the features of WSNs are introduced and routing protocols are reviewed for Wireless Sensor Network
This paper mainly discusses about the Transparent Antenna’s introduction, design, their feeding methods, the future scope and finally transition from 2D to 3D.
User Navigation Pattern Prediction from Web Log Data: A SurveyIJMER
This paper proposes a survey of Web Page Prediction Techniques. Prefetching of Web page has been widely used to reduce the access latency problem of the Web users. However, if Prefetching of Web page is not accurate and Prefetched web pages are not visited by the users in their accesses, the limited bandwidth of network and services of server will not be used efficiently and may face the problem of access delay. Therefore, it is critical that we need an effective prediction method during prefetching.
The Markov models have been widely used to predict and analyze users navigational behavior. All the
activities of web users have been saved in web log files. The stored users session is used to extract
popular web navigation paths and predict current users next web page visit.
High Speed Fault Injection Tool (FITO) Implemented With VHDL on FPGA For Test...IJMER
International Journal of Modern Engineering Research (IJMER) is Peer reviewed, online Journal. It serves as an international archival forum of scholarly research related to engineering and science education.
A Novel Approach To Answer Continuous Aggregation Queries Using Data Aggregat...IJMER
International Journal of Modern Engineering Research (IJMER) is Peer reviewed, online Journal. It serves as an international archival forum of scholarly research related to engineering and science education.
PV/Diesel Hybrid System for Fuel Production from Waste Plastics RecyclingIJMER
The treatment of wastes has become one of the most important concerns of modern society. Converting waste plastic into gasoline and diesel fuel through a highly effective low-cost pyrolysis process is a promising technology. In this paper PV/Diesel/Battery hybrid system is suggested to fulfill the load demand of waste plastic recycling pyrolysis process. A Mathematical and simulation models using MATLAB/ SIMULINK software for the hybrid PV/Diesel/Battery system components have been developed. Also, this paper presents a control strategy using Artificial Neural Network Controller
(NNC) technique for coordinating the power flow among the different components of the PV/Diesel/Battery hybrid system. The results indicate that the proposed control unit using NNC can be successfully used for controlling the power system for the waste plastic recycling pyrolysis process.
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.
Mobile Data Gathering with Load Balanced Clustering and Dual Data Uploading i...1crore projects
IEEE PROJECTS 2015
1 crore projects is a leading Guide for ieee Projects and real time projects Works Provider.
It has been provided Lot of Guidance for Thousands of Students & made them more beneficial in all Technology Training.
Dot Net
DOTNET Project Domain list 2015
1. IEEE based on datamining and knowledge engineering
2. IEEE based on mobile computing
3. IEEE based on networking
4. IEEE based on Image processing
5. IEEE based on Multimedia
6. IEEE based on Network security
7. IEEE based on parallel and distributed systems
Java Project Domain list 2015
1. IEEE based on datamining and knowledge engineering
2. IEEE based on mobile computing
3. IEEE based on networking
4. IEEE based on Image processing
5. IEEE based on Multimedia
6. IEEE based on Network security
7. IEEE based on parallel and distributed systems
ECE IEEE Projects 2015
1. Matlab project
2. Ns2 project
3. Embedded project
4. Robotics project
Eligibility
Final Year students of
1. BSc (C.S)
2. BCA/B.E(C.S)
3. B.Tech IT
4. BE (C.S)
5. MSc (C.S)
6. MSc (IT)
7. MCA
8. MS (IT)
9. ME(ALL)
10. BE(ECE)(EEE)(E&I)
TECHNOLOGY USED AND FOR TRAINING IN
1. DOT NET
2. C sharp
3. ASP
4. VB
5. SQL SERVER
6. JAVA
7. J2EE
8. STRINGS
9. ORACLE
10. VB dotNET
11. EMBEDDED
12. MAT LAB
13. LAB VIEW
14. Multi Sim
CONTACT US
1 CRORE PROJECTS
Door No: 214/215,2nd Floor,
No. 172, Raahat Plaza, (Shopping Mall) ,Arcot Road, Vadapalani, Chennai,
Tamin Nadu, INDIA - 600 026
Email id: 1croreprojects@gmail.com
website:1croreprojects.com
Phone : +91 97518 00789 / +91 72999 51536
Data Retrieval Scheduling For Unsynchronized Channel in Wireless Broadcast Sy...IJERA Editor
Wireless data broadcast is a disseminating data into large number of mobile clients. In many information services, the users may query multiple data items at a time. The environment under consideration is asymmetric in that the information server has much more bandwidth available, as compared to the clients. To maximize the number of downloads given a deadline. It defines a problem called largest number data retrieval (LNDR). To prove the decision problem of LNDR is a NP hard, and to investigate approximation algorithm for it. It also define another problem called minimum cost data retrieval (MCDR), which aims at downloading a set of requested data items with the least response time and energy consumption. Data scheduling problem over unsynchronized channel at server side. In proposed system LNDR and MCDR in push based and pull based broadcast system are used. The proposed approximation algorithms efficiently schedule the data retrieval process of downloading multiple data from multiple channels. Push based and pull based broadcast model are used in unsynchronized channel. When the time needed for channel switching can be ignored, a Maximum Matching optimal algorithm is exhibited for LNDR which requires only polynomial time. The switching time cannot be neglected, finally to provide simulation results to demonstrate the practical efficiency of the proposed algorithms.
Congestion in Wireless Sensor Networks has negative impact on the Quality of Service.
Congestion effects the performance metrics, namely throughput and per-packet energy
consumption, network lifetime and packet delivery ratio. Reducing congestion allows better
utilization of the network resources and thus enhances the Quality of Service metrics of the
network. Traffic Aware Dynamic Routing to Alleviate Congestion in Wireless Sensor Networks
reduces congestion by considering one hop neighbor routing in the network. This paper
proposed an algorithm for Quality of Service Based Traffic-Aware Data forwarding for
congestion control in wireless sensor networks based on two hop neighbor information. On
detection of congestion, the algorithm forwards data packets around the congestion areas by
spreading the excessive packets through multiple paths. The path with light load or under
loaded nodes is efficiently utilized whenever congestion occurs. The main aspect of the
algorithm is to build path to the destination using two independent potential fields 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. Network Simulator used for simulating the
algorithm is NS2. The proposed algorithm performs better.
TTACCA: TWO-HOP BASED TRAFFIC AWARE CONGESTION CONTROL ALGORITHM FOR WIRELESS...cscpconf
Congestion in Wireless Sensor Networks has negative impact on the Quality of Service.
Congestion effects the performance metrics, namely throughput and per-packet energy
consumption, network lifetime and packet delivery ratio. Reducing congestion allows better
utilization of the network resources and thus enhances the Quality of Service metrics of the
network. Traffic Aware Dynamic Routing to Alleviate Congestion in Wireless Sensor Networks
reduces congestion by considering one hop neighbor routing in the network. This paper
proposed an algorithm for Quality of Service Based Traffic-Aware Data forwarding for
congestion control in wireless sensor networks based on two hop neighbor information. On
detection of congestion, the algorithm forwards data packets around the congestion areas by
spreading the excessive packets through multiple paths. The path with light load or under
loaded nodes is efficiently utilized whenever congestion occurs. The main aspect of the
algorithm is to build path to the destination using two independent potential fields 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. Network Simulator used for simulating the
algorithm is NS2. The proposed algorithm performs better.
A COST EFFECTIVE COMPRESSIVE DATA AGGREGATION TECHNIQUE FOR WIRELESS SENSOR N...ijasuc
In wireless sensor network (WSN) there are two main problems in employing conventional compression
techniques. The compression performance depends on the organization of the routes for a larger extent.
The efficiency of an in-network data compression scheme is not solely determined by the compression
ratio, but also depends on the computational and communication overheads. In Compressive Data
Aggregation technique, data is gathered at some intermediate node where its size is reduced by applying
compression technique without losing any information of complete data. In our previous work, we have
developed an adaptive traffic aware aggregation technique in which the aggregation technique can be
changed into structured and structure-free adaptively, depending on the load status of the traffic. In this
paper, as an extension to our previous work, we provide a cost effective compressive data gathering
technique to enhance the traffic load, by using structured data aggregation scheme. We also design a
technique that effectively reduces the computation and communication costs involved in the compressive
data gathering process. The use of compressive data gathering process provides a compressed sensor
reading to reduce global data traffic and distributes energy consumption evenly to prolong the network
lifetime. By simulation results, we show that our proposed technique improves the delivery ratio while
reducing the energy and delay
A comparative study in wireless sensor networksijwmn
Sensor networks consist of a large number of small, low-powered wireless nodes with limited computation,
communication, and sensing abilities, in a battery-powered sensor network, energy and communication
bandwidth are a precious resources. Thus, there is a need to adapt the networking process to match the
application in order to minimize the resources consumed and extend the life of the network. In this paper,
we introduce a comparative study in different routing algorithms that propose vital solutions to the most
important issues that should be taken into account when designing wireless network which are reliability,
lifetime, communication bandwidth, transmission rand, and finally the limited energy issue, so we will
introduce their algorithms and discuss how did they propose to solve such of these challenges and finally
we will do some evaluation to each approach.
Comparative Analysis of Green Algorithm within Active Queue Management for Mo...ijtsrd
The Queue Management Techniques play an important role in improving the Quality of Service in Mobile Ad hoc Networks. The need of congestion control and Queue management is inevitable in Mobile Ad hoc Network. Understanding and analyzing the latest AQM Techniques give an insight to improving throughput, packet loss rate, average end to end delay and other parameters that severely affect the performance. The performance of mobile ad hoc networks is evaluated by varying the Channel Error Rate, Bandwidth and Delay at different fragment sizes of different traffic flows. The proposed method performs the network analysis of new Routing protocols. The work proposes to evaluate various Active Queue Management Techniques in a multi traffic environment i.e., sources generating both TCP and UDP traffic classes. The UDP is propagated via CBR and TCP is propagated via FTP. The implementation of the proposed queue management technique has been done in NS 2. In the proposed work we have make NS 2 compatible with GREEN by integrating source code into the ns 2 installation files and using various AQMs in comparison with GREEN to calculate the throughput at various Bandwidths across network. Using various AQMs in comparison with GREEN we have calculated the throughput at various Delays across the network and we have also calculated the throughput at various channels Error Rate across the network. The proposed method has been compared with other primitive AQM techniques so that a repository of best available results can be obtained for design and research purposes. The proposed method has outperformed the existing queue management techniques in number of scenarios. Zulai Khan | Rashmi Raj ""Comparative Analysis of Green Algorithm within Active Queue Management for Mobile Ad Hoc Network"" Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-3 | Issue-4 , June 2019, URL: https://www.ijtsrd.com/papers/ijtsrd23950.pdf
Paper URL: https://www.ijtsrd.com/engineering/electronics-and-communication-engineering/23950/comparative-analysis-of-green-algorithm-within-active-queue-management-for-mobile-ad-hoc-network/zulai-khan
Clustering and data aggregation scheme in underwater wireless acoustic sensor...TELKOMNIKA JOURNAL
Underwater Wireless Acoustic Sensor Networks (UWASNs) are creating attentiveness in
researchers due to its wide area of applications. To extract the data from underwater and transmit to
watersurface, numerous clustering and data aggregation schemes are employed. The main objectives of
clustering and data aggregation schemes are to decrease the consumption of energy and prolong the
lifetime of the network. In this paper, we focus on initial clustering of sensor nodes based on their
geographical locations using fuzzy logic. The probability of degree of belongingness of a sensor node to its
cluster, along with number of clusters is analysed and discussed. Based on the energy and distance the
cluster head nodes are determined. Finally using using similarity function data aggregation is analysed and
discussed. The proposed scheme is simulated in MATLAB and compared with LEACH algorithm.
The simulation results indicate that the proposed scheme performs better in maximizing network lifetime
and minimizing energy consumption.
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.
A Professional QoS Provisioning in the Intra Cluster Packet Level Resource Al...GiselleginaGloria
Wireless mesh networking has transpired as a gifted technology for potential broadband wireless access. In a communication network, wireless mesh network plays a vital role in transmission and are structured in a mesh topology. The coordination of mesh routers and mesh clients forms the wireless mesh networks which are routed through the gateways. Wireless mesh networks uses IEEE 802.11 standards and has its wide applications broadband home networking and enterprise networking deployment such as Microsoft wireless mesh and MIT etc. A professional Qos provisioning in intra cluster packet level resource allocation for WMN approach takes power allocation, sub carrier allocation and packet scheduling. This approach combines the merits of a Karush-Kuhn-Tucker (KKT) algorithm and a genetic algorithm (GA) based approach. The KKT algorithm uses uniform power allocation over all the subcarriers, based on the optimal allocation criterion. The genetic algorithm is used to generate useful solutions to optimization and search problems and it is also used for search problems. By combining the intrinsic worth of both the approaches, it facilitates effective QOS provisioning at the packet level. It is concluded that, this approach achieves a preferred stability between system implementation and computational convolution.
Data collection algorithm for wireless sensor networks using collaborative mo...IJECEIAES
The simplest approach to reduce network latency for data gathering in wireless sensor networks (WSN) is to use multiple mobile elements rather than a single mobile sink. However, the most challneging issues faced this approach are firstly the high network cost as a result of using large number of mobile elements. Secondly, it suffers from the difficulty of network partitioning to achieve an efficient load balancing among these mobile elements. In this study, a collaborative data collection algorithm (CDCA) is developed. Simulation results presented in this paper demonstrated that with this algorithm the latency is significantly reduced at small number of mobile elements. Furthermore, the performance of CDCA algorithm is compared with the Area Splitting Algorithm (ASA). Consequently, the CDCA showed superior performance in terms of network latency, load balancing, and the required number of mobile elements.
CFMS: A CLUSTER-BASED CONVERGECAST FRAMEWORK FOR DENSE MULTI-SINK WIRELESS SE...ijwmn
Convergecast is one of the most challenging tasks in Wireless Sensor Networks (WSNs). Indeed, this data
collection process must be conducted while copying with packet collisions, nodes’ congestion or data
redundancy. These issues always result in energy waste which is detrimental to network efficiency and
lifetime. This paper is aimed to address these problems in large-scale multi-sink WSNs. Inspired by our
previous work MSCP, we designed a lightweight protocol stack that seamlessly combines clustering, pathvector routing, sinks’ duty cycling, data aggregation and transmission scheduling in order to minimise
message overhead and packet losses. Simulation results show that this solution can mitigate delay while
significantly increasing packet delivery and network lifetime.
CFMS: A Cluster-based Convergecast Framework for Dense Multi-Sink Wireless Se...ijwmn
Convergecast is one of the most challenging tasks in Wireless Sensor Networks (WSNs). Indeed, this data
collection process must be conducted while copying with packet collisions, nodes’ congestion or data
redundancy. These issues always result in energy waste which is detrimental to network efficiency and
lifetime. This paper is aimed to address these problems in large-scale multi-sink WSNs. Inspired by our
previous work MSCP, we designed a lightweight protocol stack that seamlessly combines clustering, pathvector routing, sinks’ duty cycling, data aggregation and transmission scheduling in order to minimise
message overhead and packet losses. Simulation results show that this solution can mitigate delay while
significantly increasing packet delivery and network lifetime.
CFMS: A CLUSTER-BASED CONVERGECAST FRAMEWORK FOR DENSE MULTI-SINK WIRELESS SE...ijwmn
Convergecast is one of the most challenging tasks in Wireless Sensor Networks (WSNs). Indeed, this data
collection process must be conducted while copying with packet collisions, nodes’ congestion or data
redundancy. These issues always result in energy waste which is detrimental to network efficiency and
lifetime. This paper is aimed to address these problems in large-scale multi-sink WSNs. Inspired by our
previous work MSCP, we designed a lightweight protocol stack that seamlessly combines clustering, pathvector routing, sinks’ duty cycling, data aggregation and transmission scheduling in order to minimise
message overhead and packet losses. Simulation results show that this solution can mitigate delay while
significantly increasing packet delivery and network lifetime.
Similar to Fast Data Collection with Interference and Life Time in Tree Based Wireless Sensor Networks (20)
A Study on Translucent Concrete Product and Its Properties by Using Optical F...IJMER
- Translucent concrete is a concrete based material with light-transferring properties,
obtained due to embedded light optical elements like Optical fibers used in concrete. Light is conducted
through the concrete from one end to the other. This results into a certain light pattern on the other
surface, depending on the fiber structure. Optical fibers transmit light so effectively that there is
virtually no loss of light conducted through the fibers. This paper deals with the modeling of such
translucent or transparent concrete blocks and panel and their usage and also the advantages it brings
in the field. The main purpose is to use sunlight as a light source to reduce the power consumption of
illumination and to use the optical fiber to sense the stress of structures and also use this concrete as an
architectural purpose of the building
Developing Cost Effective Automation for Cotton Seed DelintingIJMER
A low cost automation system for removal of lint from cottonseed is to be designed and
developed. The setup consists of stainless steel drum with stirrer in which cottonseeds having lint is mixed
with concentrated sulphuric acid. So lint will get burn. This lint free cottonseed treated with lime water to
neutralize acidic nature. After water washing this cottonseeds are used for agriculter purpose
Study & Testing Of Bio-Composite Material Based On Munja FibreIJMER
The incorporation of natural fibres such as munja fiber composites has gained
increasing applications both in many areas of Engineering and Technology. The aim of this study is to
evaluate mechanical properties such as flexural and tensile properties of reinforced epoxy composites.
This is mainly due to their applicable benefits as they are light weight and offer low cost compared to
synthetic fibre composites. Munja fibres recently have been a substitute material in many weight-critical
applications in areas such as aerospace, automotive and other high demanding industrial sectors. In
this study, natural munja fibre composites and munja/fibreglass hybrid composites were fabricated by a
combination of hand lay-up and cold-press methods. A new variety in munja fibre is the present work
the main aim of the work is to extract the neat fibre and is characterized for its flexural characteristics.
The composites are fabricated by reinforcing untreated and treated fibre and are tested for their
mechanical, properties strictly as per ASTM procedures.
Hybrid Engine (Stirling Engine + IC Engine + Electric Motor)IJMER
Hybrid engine is a combination of Stirling engine, IC engine and Electric motor. All these 3 are
connected together to a single shaft. The power source of the Stirling engine will be a Solar Panel. The aim of
this is to run the automobile using a Hybrid engine
Fabrication & Characterization of Bio Composite Materials Based On Sunnhemp F...IJMER
The present day technology demands eco-friendly developments. In this era the
composite material are playing a vital roal in different field of Engineering .The composite materials
are using as a principle materials. Nowaday the composite materials are utilizing as a important
component of engineering field .Where as the importance of the applications of composites is well
known, but thrust on the use of natural fibres in it for reinforcement has been given priority for some
times. But changing from synthetic fibres to natural fibres provides only half green-composites. A
partial green composite will be achieved if the matrix component is also eco-friendly. Keeping this in
view, a detailed literature surveyed has been carried out through various issues of the Journals
related to this field. The material systems used are sunnhemp fibres. Some epoxy and hardener has
been also added for stability and drying of the bio-composites. Various graphs and bar-charts are
super-imposed on each other for comparison among themselves and Graphs is plotted on MAT LAB
and ORIGIN 6.0 software. To determining tensile strengths, Various properties for different biocomposites
have been compared among themselves. Comparison of the behaviour of bio-composites of
this work has been also compare with other works. The bio-composites developed in this work are
likely to get applications in fall ceilings, partitions, bio-degradable packagings, automotive interiors,
sports things (e.g. rackets, nets, etc.), toys etc.
Geochemistry and Genesis of Kammatturu Iron Ores of Devagiri Formation, Sandu...IJMER
The Greenstone belts of Karnataka are enriched in BIFs in Dharwar craton, where Iron
formations are confined to the basin shelf, clearly separated from the deeper-water iron formation that
accumulated at the basin margin and flanking the marine basin. Geochemical data procured in terms of
major, trace and REE are plotted in various diagrams to interpret the genesis of BIFs. Al2O3, Fe2O3 (T),
TiO2, CaO, and SiO2 abundances and ratios show a wide variation. Ni, Co, Zr, Sc, V, Rb, Sr, U, Th,
ΣREE, La, Ce and Eu anomalies and their binary relationships indicate that wherever the terrigenous
component has increased, the concentration of elements of felsic such as Zr and Hf has gone up. Elevated
concentrations of Ni, Co and Sc are contributed by chlorite and other components characteristic of basic
volcanic debris. The data suggest that these formations were generated by chemical and clastic
sedimentary processes on a shallow shelf. During transgression, chemical precipitation took place at the
sediment-water interface, whereas at the time of regression. Iron ore formed with sedimentary structures
and textures in Kammatturu area, in a setting where the water column was oxygenated.
Experimental Investigation on Characteristic Study of the Carbon Steel C45 in...IJMER
In this paper, the mechanical characteristics of C45 medium carbon steel are investigated
under various working conditions. The main characteristic to be studied on this paper is impact toughness
of the material with different configurations and the experiment were carried out on charpy impact testing
equipment. This study reveals the ability of the material to absorb energy up to failure for various
specimen configurations under different heat treated conditions and the corresponding results were
compared with the analysis outcome
Non linear analysis of Robot Gun Support Structure using Equivalent Dynamic A...IJMER
Robot guns are being increasingly employed in automotive manufacturing to replace
risky jobs and also to increase productivity. Using a single robot for a single operation proves to be
expensive. Hence for cost optimization, multiple guns are mounted on a single robot and multiple
operations are performed. Robot Gun structure is an efficient way in which multiple welds can be done
simultaneously. However mounting several weld guns on a single structure induces a variety of
dynamic loads, especially during movement of the robot arm as it maneuvers to reach the weld
locations. The primary idea employed in this paper, is to model those dynamic loads as equivalent G
force loads in FEA. This approach will be on the conservative side, and will be saving time and
subsequently cost efficient. The approach of the paper is towards creating a standard operating
procedure when it comes to analysis of such structures, with emphasis on deploying various technical
aspects of FEA such as Non Linear Geometry, Multipoint Constraint Contact Algorithm, Multizone
meshing .
Static Analysis of Go-Kart Chassis by Analytical and Solid Works SimulationIJMER
This paper aims to do modelling, simulation and performing the static analysis of a go
kart chassis consisting of Circular beams. Modelling, simulations and analysis are performed using 3-D
modelling software i.e. Solid Works and ANSYS according to the rulebook provided by Indian Society of
New Era Engineers (ISNEE) for National Go Kart Championship (NGKC-14).The maximum deflection is
determined by performing static analysis. Computed results are then compared to analytical calculation,
where it is found that the location of maximum deflection agrees well with theoretical approximation but
varies on magnitude aspect.
In récent year various vehicle introduced in market but due to limitation in
carbon émission and BS Séries limitd speed availability vehicle in the market and causing of
environnent pollution over few year There is need to decrease dependancy on fuel vehicle.
bicycle is to be modified for optional in the future To implement new technique using change in
pedal assembly and variable speed gearbox such as planetary gear optimise speed of vehicle
with variable speed ratio.To increase the efficiency of bicycle for confortable drive and to
reduce torque appli éd on bicycle. we introduced epicyclic gear box in which transmission done
throgh Chain Drive (i.e. Sprocket )to rear wheel with help of Epicyclical gear Box to give
number of différent Speed during driving.To reduce torque requirent in the cycle with change in
the pedal mechanism
Integration of Struts & Spring & Hibernate for Enterprise ApplicationsIJMER
The proposal of this paper is to present Spring Framework which is widely used in
developing enterprise applications. Considering the current state where applications are developed using
the EJB model, Spring Framework assert that ordinary java beans(POJO) can be utilize with minimal
modifications. This modular framework can be used to develop the application faster and can reduce
complexity. This paper will highlight the design overview of Spring Framework along with its features that
have made the framework useful. The integration of multiple frameworks for an E-commerce system has
also been addressed in this paper. This paper also proposes structure for a website based on integration of
Spring, Hibernate and Struts Framework.
Microcontroller Based Automatic Sprinkler Irrigation SystemIJMER
Microcontroller based Automatic Sprinkler System is a new concept of using
intelligence power of embedded technology in the sprinkler irrigation work. Designed system replaces
the conventional manual work involved in sprinkler irrigation to automatic process. Using this system a
farmer is protected against adverse inhuman weather conditions, tedious work of changing over of
sprinkler water pipe lines & risk of accident due to high pressure in the water pipe line. Overall
sprinkler irrigation work is transformed in to a comfortableautomatic work. This system provides
flexibility & accuracy in respect of time set for the operation of a sprinkler water pipe lines. In present
work the author has designed and developed an automatic sprinkler irrigation system which is
controlled and monitored by a microcontroller interfaced with solenoid valves.
On some locally closed sets and spaces in Ideal Topological SpacesIJMER
In this paper we introduce and characterize some new generalized locally closed sets
known as
δ
ˆ
s-locally closed sets and spaces are known as
δ
ˆ
s-normal space and
δ
ˆ
s-connected space and
discussed some of their properties
Intrusion Detection and Forensics based on decision tree and Association rule...IJMER
This paper present an approach based on the combination of, two techniques using
decision tree and Association rule mining for Probe attack detection. This approach proves to be
better than the traditional approach of generating rules for fuzzy expert system by clustering methods.
Association rule mining for selecting the best attributes together and decision tree for identifying the
best parameters together to create the rules for fuzzy expert system. After that rules for fuzzy expert
system are generated using association rule mining and decision trees. Decision trees is generated for
dataset and to find the basic parameters for creating the membership functions of fuzzy inference
system. Membership functions are generated for the probe attack. Based on these rules we have
created the fuzzy inference system that is used as an input to neuro-fuzzy system. Fuzzy inference
system is loaded to neuro-fuzzy toolbox as an input and the final ANFIS structure is generated for
outcome of neuro-fuzzy approach. The experiments and evaluations of the proposed method were
done with NSL-KDD intrusion detection dataset. As the experimental results, the proposed approach
based on the combination of, two techniques using decision tree and Association rule mining
efficiently detected probe attacks. Experimental results shows better results for detecting intrusions as
compared to others existing methods
Natural Language Ambiguity and its Effect on Machine LearningIJMER
"Natural language processing" here refers to the use and ability of systems to process
sentences in a natural language such as English, rather than in a specialized artificial computer
language such as C++. The systems of real interest here are digital computers of the type we think of as
personal computers and mainframes. Of course humans can process natural languages, but for us the
question is whether digital computers can or ever will process natural languages. We have tried to
explore in depth and break down the types of ambiguities persistent throughout the natural languages
and provide an answer to the question “How it affects the machine translation process and thereby
machine learning as whole?” .
Today in era of software industry there is no perfect software framework available for
analysis and software development. Currently there are enormous number of software development
process exists which can be implemented to stabilize the process of developing a software system. But no
perfect system is recognized till yet which can help software developers for opting of best software
development process. This paper present the framework of skillful system combined with Likert scale. With
the help of Likert scale we define a rule based model and delegate some mass score to every process and
develop one tool name as MuxSet which will help the software developers to select an appropriate
development process that may enhance the probability of system success.
Material Parameter and Effect of Thermal Load on Functionally Graded CylindersIJMER
The present study investigates the creep in a thick-walled composite cylinders made
up of aluminum/aluminum alloy matrix and reinforced with silicon carbide particles. The distribution
of SiCp is assumed to be either uniform or decreasing linearly from the inner to the outer radius of
the cylinder. The creep behavior of the cylinder has been described by threshold stress based creep
law with a stress exponent of 5. The composite cylinders are subjected to internal pressure which is
applied gradually and steady state condition of stress is assumed. The creep parameters required to
be used in creep law, are extracted by conducting regression analysis on the available experimental
results. The mathematical models have been developed to describe steady state creep in the composite
cylinder by using von-Mises criterion. Regression analysis is used to obtain the creep parameters
required in the study. The basic equilibrium equation of the cylinder and other constitutive equations
have been solved to obtain creep stresses in the cylinder. The effect of varying particle size, particle
content and temperature on the stresses in the composite cylinder has been analyzed. The study
revealed that the stress distributions in the cylinder do not vary significantly for various combinations
of particle size, particle content and operating temperature except for slight variation observed for
varying particle content. Functionally Graded Materials (FGMs) emerged and led to the development
of superior heat resistant materials.
Energy Audit is the systematic process for finding out the energy conservation
opportunities in industrial processes. The project carried out studies on various energy conservation
measures application in areas like lighting, motors, compressors, transformer, ventilation system etc.
In this investigation, studied the technical aspects of the various measures along with its cost benefit
analysis.
Investigation found that major areas of energy conservation are-
1. Energy efficient lighting schemes.
2. Use of electronic ballast instead of copper ballast.
3. Use of wind ventilators for ventilation.
4. Use of VFD for compressor.
5. Transparent roofing sheets to reduce energy consumption.
So Energy Audit is the only perfect & analyzed way of meeting the Industrial Energy Conservation.
An Implementation of I2C Slave Interface using Verilog HDLIJMER
The focus of this paper is on implementation of Inter Integrated Circuit (I2C) protocol
following slave module for no data loss. In this paper, the principle and the operation of I2C bus protocol
will be introduced. It follows the I2C specification to provide device addressing, read/write operation and
an acknowledgement. The programmable nature of device provide users with the flexibility of configuring
the I2C slave device to any legal slave address to avoid the slave address collision on an I2C bus with
multiple slave devices. This paper demonstrates how I2C Master controller transmits and receives data to
and from the Slave with proper synchronization.
The module is designed in Verilog and simulated in ModelSim. The design is also synthesized in Xilinx
XST 14.1. This module acts as a slave for the microprocessor which can be customized for no data loss.
Discrete Model of Two Predators competing for One PreyIJMER
This paper investigates the dynamical behavior of a discrete model of one prey two
predator systems. The equilibrium points and their stability are analyzed. Time series plots are obtained
for different sets of parameter values. Also bifurcation diagrams are plotted to show dynamical behavior
of the system in selected range of growth parameter
Elevating Tactical DDD Patterns Through Object CalisthenicsDorra BARTAGUIZ
After immersing yourself in the blue book and its red counterpart, attending DDD-focused conferences, and applying tactical patterns, you're left with a crucial question: How do I ensure my design is effective? Tactical patterns within Domain-Driven Design (DDD) serve as guiding principles for creating clear and manageable domain models. However, achieving success with these patterns requires additional guidance. Interestingly, we've observed that a set of constraints initially designed for training purposes remarkably aligns with effective pattern implementation, offering a more ‘mechanical’ approach. Let's explore together how Object Calisthenics can elevate the design of your tactical DDD patterns, offering concrete help for those venturing into DDD for the first time!
Slack (or Teams) Automation for Bonterra Impact Management (fka Social Soluti...Jeffrey Haguewood
Sidekick Solutions uses Bonterra Impact Management (fka Social Solutions Apricot) and automation solutions to integrate data for business workflows.
We believe integration and automation are essential to user experience and the promise of efficient work through technology. Automation is the critical ingredient to realizing that full vision. We develop integration products and services for Bonterra Case Management software to support the deployment of automations for a variety of use cases.
This video focuses on the notifications, alerts, and approval requests using Slack for Bonterra Impact Management. The solutions covered in this webinar can also be deployed for Microsoft Teams.
Interested in deploying notification automations for Bonterra Impact Management? Contact us at sales@sidekicksolutionsllc.com to discuss next steps.
JMeter webinar - integration with InfluxDB and GrafanaRTTS
Watch this recorded webinar about real-time monitoring of application performance. See how to integrate Apache JMeter, the open-source leader in performance testing, with InfluxDB, the open-source time-series database, and Grafana, the open-source analytics and visualization application.
In this webinar, we will review the benefits of leveraging InfluxDB and Grafana when executing load tests and demonstrate how these tools are used to visualize performance metrics.
Length: 30 minutes
Session Overview
-------------------------------------------
During this webinar, we will cover the following topics while demonstrating the integrations of JMeter, InfluxDB and Grafana:
- What out-of-the-box solutions are available for real-time monitoring JMeter tests?
- What are the benefits of integrating InfluxDB and Grafana into the load testing stack?
- Which features are provided by Grafana?
- Demonstration of InfluxDB and Grafana using a practice web application
To view the webinar recording, go to:
https://www.rttsweb.com/jmeter-integration-webinar
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.
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.
UiPath Test Automation using UiPath Test Suite series, part 3DianaGray10
Welcome to UiPath Test Automation using UiPath Test Suite series part 3. In this session, we will cover desktop automation along with UI automation.
Topics covered:
UI automation Introduction,
UI automation Sample
Desktop automation flow
Pradeep Chinnala, Senior Consultant Automation Developer @WonderBotz and UiPath MVP
Deepak Rai, Automation Practice Lead, Boundaryless Group and UiPath MVP
Essentials of Automations: Optimizing FME Workflows with ParametersSafe Software
Are you looking to streamline your workflows and boost your projects’ efficiency? Do you find yourself searching for ways to add flexibility and control over your FME workflows? If so, you’re in the right place.
Join us for an insightful dive into the world of FME parameters, a critical element in optimizing workflow efficiency. This webinar marks the beginning of our three-part “Essentials of Automation” series. This first webinar is designed to equip you with the knowledge and skills to utilize parameters effectively: enhancing the flexibility, maintainability, and user control of your FME projects.
Here’s what you’ll gain:
- Essentials of FME Parameters: Understand the pivotal role of parameters, including Reader/Writer, Transformer, User, and FME Flow categories. Discover how they are the key to unlocking automation and optimization within your workflows.
- Practical Applications in FME Form: Delve into key user parameter types including choice, connections, and file URLs. Allow users to control how a workflow runs, making your workflows more reusable. Learn to import values and deliver the best user experience for your workflows while enhancing accuracy.
- Optimization Strategies in FME Flow: Explore the creation and strategic deployment of parameters in FME Flow, including the use of deployment and geometry parameters, to maximize workflow efficiency.
- Pro Tips for Success: Gain insights on parameterizing connections and leveraging new features like Conditional Visibility for clarity and simplicity.
We’ll wrap up with a glimpse into future webinars, followed by a Q&A session to address your specific questions surrounding this topic.
Don’t miss this opportunity to elevate your FME expertise and drive your projects to new heights of efficiency.
Accelerate your Kubernetes clusters with Varnish CachingThijs Feryn
A presentation about the usage and availability of Varnish on Kubernetes. This talk explores the capabilities of Varnish caching and shows how to use the Varnish Helm chart to deploy it to Kubernetes.
This presentation was delivered at K8SUG Singapore. See https://feryn.eu/presentations/accelerate-your-kubernetes-clusters-with-varnish-caching-k8sug-singapore-28-2024 for more details.
Builder.ai Founder Sachin Dev Duggal's Strategic Approach to Create an Innova...Ramesh Iyer
In today's fast-changing business world, Companies that adapt and embrace new ideas often need help to keep up with the competition. However, fostering a culture of innovation takes much work. It takes vision, leadership and willingness to take risks in the right proportion. Sachin Dev Duggal, co-founder of Builder.ai, has perfected the art of this balance, creating a company culture where creativity and growth are nurtured at each stage.
Smart TV Buyer Insights Survey 2024 by 91mobiles.pdf91mobiles
91mobiles recently conducted a Smart TV Buyer Insights Survey in which we asked over 3,000 respondents about the TV they own, aspects they look at on a new TV, and their TV buying preferences.
GraphRAG is All You need? LLM & Knowledge GraphGuy Korland
Guy Korland, CEO and Co-founder of FalkorDB, will review two articles on the integration of language models with knowledge graphs.
1. Unifying Large Language Models and Knowledge Graphs: A Roadmap.
https://arxiv.org/abs/2306.08302
2. Microsoft Research's GraphRAG paper and a review paper on various uses of knowledge graphs:
https://www.microsoft.com/en-us/research/blog/graphrag-unlocking-llm-discovery-on-narrative-private-data/
Connector Corner: Automate dynamic content and events by pushing a buttonDianaGray10
Here is something new! In our next Connector Corner webinar, we will demonstrate how you can use a single workflow to:
Create a campaign using Mailchimp with merge tags/fields
Send an interactive Slack channel message (using buttons)
Have the message received by managers and peers along with a test email for review
But there’s more:
In a second workflow supporting the same use case, you’ll see:
Your campaign sent to target colleagues for approval
If the “Approve” button is clicked, a Jira/Zendesk ticket is created for the marketing design team
But—if the “Reject” button is pushed, colleagues will be alerted via Slack message
Join us to learn more about this new, human-in-the-loop capability, brought to you by Integration Service connectors.
And...
Speakers:
Akshay Agnihotri, Product Manager
Charlie Greenberg, Host
Kubernetes & AI - Beauty and the Beast !?! @KCD Istanbul 2024Tobias Schneck
As AI technology is pushing into IT I was wondering myself, as an “infrastructure container kubernetes guy”, how get this fancy AI technology get managed from an infrastructure operational view? Is it possible to apply our lovely cloud native principals as well? What benefit’s both technologies could bring to each other?
Let me take this questions and provide you a short journey through existing deployment models and use cases for AI software. On practical examples, we discuss what cloud/on-premise strategy we may need for applying it to our own infrastructure to get it to work from an enterprise perspective. I want to give an overview about infrastructure requirements and technologies, what could be beneficial or limiting your AI use cases in an enterprise environment. An interactive Demo will give you some insides, what approaches I got already working for real.
Fast Data Collection with Interference and Life Time in Tree Based Wireless Sensor Networks
1. www.ijmer.com
International Journal of Modern Engineering Research (IJMER)
Vol. 3, Issue. 5, Sep - Oct. 2013 pp-2667-2673
ISSN: 2249-6645
Fast Data Collection with Interference and Life Time in
Tree Based Wireless Sensor Networks
I. Shalini1, B. Vamsee Mohan2, T. Bharath Manohar3, B. Susrutha4
1, 4,
2
M.Tech 2ndyr, Dept of CSE, PBRVITS (Affiliated to JNTU Anantapur), Kavali,Nellore.Andhra Pradesh.India.
Assoc. Prof., Dept of CSE, PBRVITS (Affiliated to JNTU Anantapur), Kavali, Nellore. Andhra Pradesh. India.
3
Asst.Professor, Dept of CSE, CMR College of Engineering &Technology,
(Affiliated to JNTU Hyderabad)Hyderabad.Andhra Pradesh.India.
ABSTRACT: We investigate the following fundamental question - how fast can information be collected from a wireless
sensor network organized as tree? To address this, we explore and evaluate a number of different techniques using realistic
simulation models under the many-to-one communication paradigm known as converge cast. We first consider time
scheduling on a single frequency channel with the aim of minimizing the number of time slots required (schedule length) to
complete a converge cast. Next, we combine scheduling with transmission power control to mitigate the effects of
interference, and show that while power control helps in reducing the schedule length under a single frequency, scheduling
transmissions using multiple frequencies is more efficient. We give lower bounds on the schedule length when interference is
completely eliminated, and propose algorithms that achieve these bounds. We also evaluate the performance of various
channel assignment methods and find empirically that for moderate size networks of about 100 nodes, the use of multifrequency scheduling can suffice to eliminate most of the interference. Then, the data collection rate no longer remains
limited by interference but by the topology of the routing tree. To this end, we construct degree-constrained spanning trees
and capacitated minimal spanning trees, and show significant improvement in scheduling performance over different
deployment densities. Lastly, we evaluate the impact of different interference and channel models on the schedule length.
Keywords: Convergecast, TDMA scheduling, multiple channels, power-control, routing trees.
I.
INTRODUCTION
CONVERGECAST, namely the collection of data from a set of sensors toward a common sink over a treebased
routing topology, is a fundamental operation in wireless sensor networks (WSN) [1]. In many applications, it is crucial to
provide a guarantee on the delivery time as well as increase the rate of such data collection. For instance, in safety and
mission-critical applications where sensor nodes are deployed to detect oil/gas leak or structural damage, the actuators and
controllers need to receive data from all the sensors within a specific deadline [2], failure of which might lead to
unpredictable and catastrophic events. This falls under the category of one-shot data collection. On the other hand,
applications such as permafrost monitoring [3] require periodic and fast data delivery over long periods of time, which falls
under the category of continuous data collection.
In this paper, we consider such applications and focus on the following fundamental question: “How fast can data
be streamed from a set of sensors to a sink over a treebased topology?” We study two types of data collection: (i)
aggregated convergecast where packets are aggregated at each hop, and (ii) raw-data convergecast where packets are
individually relayed toward the sink. Aggregated con-vergecast is applicable when a strong spatial correlation exists in the
data, or the goal is to collect summarized information such as the maximum sensor reading. Rawdata convergecast, on the
other hand, is applicable when every sensor reading is equally important, or the correlation is minimal. We study aggregated
convergecast in the context of continuous data collection, and rawdata convergecast for one-shot data collection. These two
types correspond to two extreme cases of data collection. In an earlier work [4], the problem of applying different
aggregation factors, i.e., data compression factors, was studied, and the latency of data collection was shown to be within the
performance bounds of the two extreme cases of no data compression (raw-data convergecast) and full data compression
(aggregated convergecast). For periodic traffic, it is well known that contentionfree medium access control (MAC) protocols
such as TDMA (Time Division Multiple Access) are better fit for fast data collection, since they can eliminate collisions and
retransmissions and provide guarantee on the completion time as opposed to contention-based protocols However, the
problem of constructing conflictfree (interference-free) TDMA schedules even under the simple graph-based interference
model has been proved to be NP-complete. In this work, we consider a TDMA framework and design polynomial-time
heuristics to minimize the schedule length for both types of convergecast. We also find lower bounds on the achievable
schedule lengths and compare the performance of ourheuristics with these bounds.
II.
MOTIVATION
Existing System:
Existing work had the objective of minimizing the completion time of converge casts. However, none of the
previous work discussed the effect of multi-channel scheduling together with the comparisons of different channel
assignment techniques and the impact of routing trees and none considered the problems of aggregated and raw converge
cast, which represent two extreme cases of data collection.
www.ijmer.com
2667 | Page
2. International Journal of Modern Engineering Research (IJMER)
www.ijmer.com
Vol. 3, Issue. 5, Sep - Oct. 2013 pp-2667-2673
ISSN: 2249-6645
Proposed System:
Fast data collection with the goal to minimize the schedule length for aggregated converge cast has been studied by
us in, and also by others in, we experimentally investigated the impact of transmission power control and multiple frequency
channels on the schedule length Our present work is different from the above in that we evaluate transmission power control
under realistic settings and compute lower bounds on the schedule length for tree networks with algorithms to achieve these
bounds. We also compare the efficiency of different channel assignment methods and interference models, and propose
schemes for constructing specific routing tree topologies that enhance the data collection rate for both aggregated and rawdata converge cast.
We start by identifying the primary limiting factors of fast data collection, which are: (i) interference in the wireless
medium, (ii) half-duplex transceivers on the sen- sor nodes, and (iii) topology of the network. Then, we explore a number of
different techniques that provide a hierarchy of successive improvements, the simplest among which is an interferenceaware, minimum-length, TDMA scheduling that enables spatial reuse. To achieve further improvement, we combine
transmission power control with scheduling, and use multiple frequency channels to enable more concurrent transmissions.
We show that once multiple frequencies are employed along with spatial-reuse TDMA, the data collection rate often no
longer remains limited by interference but by the topology of the network. Thus, in the final step, we construct network
topologies with specific properties that help in further enhancing the rate. Our primary conclusion is that, combining these
different techniques can provide an order of magnitude improvement for aggregated convergecast, and a factor of two
improvement for raw-data convergecast, compared to single-channel TDMA scheduling on minimum-hop routing trees.
Although the techniques of transmission power control and multi-channel scheduling have been well studied for eliminating
interference in general wireless networks, their performances for bounding the completion of data collection in WSNs have
not been explored in detail in the previous studies. The fundamental novelty of our approach lies in the extensive exploration
of the efficiency of transmission power control and multichannel communication on achieving fast convergecast operations
in WSNs. Besides, we evaluate the impact of routing trees on fast data collection and to the best of our knowledge this has
not been the topic of previous studies. As we will discuss in Section 2, some of the existing work had the objective of
minimizing the completion time of convergecasts. However, none of the previous work discussed the effect of multi-channel
scheduling together with the comparisons of different channel assignment techniques and the impact of routing trees and
none considered the problems of aggregated and raw convergecast, which represent two extreme cases of data collection,
together. As the new concepts in this paper, we introduce polynomial-time heuristics for TDMA scheduling for both types of
data collection, i.e., Algorithms 1 and 2, and prove that they do achieve the lower bound of data collection time once
interference is eliminated. Besides, we elaborate on the performance of our previous work, a receiver-based channel
assignment method, and compare its efficiency with other channel assignment methods and introduce heuristics for
constructing optimal routing trees to further enhance data collection rate. The following lists our key findings and
contributions:
Bounds on Convergecast Scheduling:
We show that if all interfering links are eliminated, the schedule length for aggregated convergecast is lower
bounded by the maximum node degree in the routing tree, and for raw-data convergecast by max(2nk −1,N), where nk is the
maximum number of nodes on any branch in the tree, and N is the number of source nodes. We then introduce optimal time
slot assignment schemes under this scenario which achieve these lower bounds.
Evaluation of Power Control under Realistic Setting:
It was shown recently [5] that under the idealized setting of unlimited power and continuous range, transmission
power control can provide an unbounded improvement in the asymptotic capacity of aggregated convergecast. In this work,
we evaluate the behavior of an optimal power control algorithm [6] under realistic settings considering the limited discrete
power levels available in today’s radios. We find that for moderate size networks of 100 nodes power control can reduce the
schedule length by 15 − 20%.
Evaluation of Channel Assignment Methods:
Using extensive simulations, we show that scheduling transmissions on different frequency channels is more
effective in mitigating interference as compared to transmission power control. We evaluate the performance of three
different channel assignment methods: (i) Joint Frequency and Time Slot Scheduling (JFTSS), (ii) Receiver-Based Channel
Assignment (RBCA) [7], and (iii) Tree-Based Channel Assignment (TMCP) [8]. These methods consider the channel
assignment problem at different levels: the link level, node level, or cluster level. We show that for aggregated convergecast,
TMCP performs better than JFTSS and RBCA on minimum-hop routing trees, while performs worse on degree-constrained
trees. For raw-data convergecast, RBCA and JFTSS perform better than TMCP, since the latter suffers from interference
inside the branches due to concurrent transmissions on the same channel.
Impact of Routing Trees:
We investigate the effect of network topology on the schedule length, and show that for aggregated convergecast
the performance can be improved by up to 10 times on degreeconstrained trees using multiple frequencies as compared to
that on minimum-hop trees using a single frequency. For raw-data convergecast, multi-channel scheduling on capacitated
minimal spanning trees can reduce the schedule length by 50%.
www.ijmer.com
2668 | Page
3. www.ijmer.com
International Journal of Modern Engineering Research (IJMER)
Vol. 3, Issue. 5, Sep - Oct. 2013 pp-2667-2673
ISSN: 2249-6645
Impact of Channel Models and Interference:
Under the setting of multiple frequencies, one simplifying assumption often made is that the frequencies are
orthogonal to each other. We evaluate this assumption and show that the schedules generated may not always eliminate
interference, thus causing considerable packet losses. We also evaluate and compare the two most commonly used
interference models.
III.
LITERATURE SURVEY
Fast data collection with the goal to minimize the schedule length for aggregated convergecast has been studied by
us in and also by others.In we experimentally investigated the impact of transmission power control and multiple frequency
channels on the schedule length, while the theoretical aspects were discussed where we proposed constant factor and
logarithmic approximation algorithms on geometric networks (disk graphs). Raw-data convergecast has been studied where
a distributed time slot assignment scheme is proposed by Gandham et al. to minimize the TDMA schedule length for a single
channel. The problem of joint scheduling and transmission power control is studied by Moscibroda for constant and uniform
traffic demands. Our present work is different from the above in that we evaluate transmission power control under realistic
settings and compute lower bounds on the schedule length for tree networks with algorithms to achieve these bounds. We
also compare the efficiency of different channel assignment methods and interference models, and propose schemes for
constructing specific routing tree topologies that enhance the data collection rate for both aggregated and raw-data
convergecast. The use of orthogonal codes to eliminate interference has been studied by Annamalai et al. [10], where nodes
are assigned time slots from the bottom of the tree to the top such that a parent node does not transmit before it receives all
the packets from its children.
This problem and the one addressed by Chen et al. [11] are for one-shot raw-data convergecast. In this work, since
we construct degree-constrained routing topologies to enhance the data collection rate, it may not always lead to schedules
that have low latency, because the number of hops in a tree goes up as its degree goes down. Therefore, if minimizing
latency is also a requirement, then further optimization, such as constructing bounded-degree, bounded-diameter trees, is
needed. A study along this line with the objective to minimize the maximum latency is presented by Pan and Tseng [15],
where they assign a beacon period to each node in a Zigbee network during which it can receive data from all its children.
For raw-data convergecast, Song et al. [12] presented a time-optimal, energy-efficient, packet scheduling algorithm with
periodic traffic from all the nodes to the sink. Once interference is eliminated, their algorithm achieves the bound that we
present here, however, they briefly mention a 3-coloring channel assignment scheme, and it is not clear whether the channels
are frequencies, codes, or any other method to eliminate interference.
Moreover, they assume a simple interference model where each node has a circular transmission range and
cumulative interference from concurrent multiple senders is avoided. Different from their work, we consider multiple
frequencies and evaluate the performance of three different channel assignment methods together with evaluating the effects
of transmission power control using realistic interference and channel models, i.e., physical interference model and
overlapping channels and considering the impact of routing topologies. Song et al. [12] extended their work and proposed a
TDMA based MAC protocol for high data rate WSNs in [16]. TreeMAC considers the differences in load at different levels
of a routing tree and assigns time slots according to the depth, i.e. the hop count, of the nodes on the routing tree, such that
nodes closer to the sink are assigned more slots than their children in order to mitigate congestion. However, TreeMAC
operates on a single channel and achieves 1/3 of the maximum throughput similar to the bounds presented by Gandham et al.
[1] since the sink can receive every 3 time slots. The problem of minimizing the schedule length for raw-data convergecast
on single channel is shown to be NP-complete on general graphs by Choi et al. [13]. Maximizing the throughput of
convergecast by finding a shortest-length, conflict-free schedule is studied by Lai et al. [14], where a greedy graph coloring
strategy assigns time slots to the senders and prevent interference. They also discussed the impact of routing trees on the
schedule length and proposed a routing scheme called disjoint strips to transmit data over different shortest paths.
However, since the sink remains as the bottleneck, sending data over different paths does not reduce the schedule
length. As we will show in this paper, the improvement due to the routing structure comes from using capacitated minimal
spanning trees for raw-data convergecast, where the number of nodes in a subtree is no more than half the total number of
nodes in the remaining subtrees. The use of multiple frequencies has been studied extensively in both cellular and ad hoc
networks, however, in the domain of WSN, there exist a few studies that utilize multiple channels To this end, we evaluate
the efficiency of three particular schemes that treat the channel assignment at different levels.
IV.
SYSTEM ANALYSIS & DESIGN
Algorithms used:
1. BFSTIMESLOTASSIGNMENT.
2. LOCAL-TIMESLOTASSIGNMENT
Algorithm 1 BFS-TIMESLOTASSIGNMENT
1. Input: T = (V, ET )
2. While ET _= φ do
3. e ← next edge from ET in BFS order
4. Assign minimum time slot t to edge e respecting adjacency and interfering constraints
5. ET ← ET {e}
6. end while
www.ijmer.com
2669 | Page
4. www.ijmer.com
International Journal of Modern Engineering Research (IJMER)
Vol. 3, Issue. 5, Sep - Oct. 2013 pp-2667-2673
ISSN: 2249-6645
Algorithm 2 LOCAL-TIMESLOTASSIGNMENT
1. node.buffer = full
2. if {node is sink} then
3. Among the eligible top-subtrees, choose the one with the largest
number of total (remaining) packets, say top-subtree i
4. Schedule link (root(i), s) respecting interfering constraint
5. else
6. if {node.buffer == empty} then
7. Choose a random child c of node whose buffer is full
8. Schedule link (c, node) respecting interfering constraint
9. c.buffer = empty
10. node.buffer = full
11. end if
12. end if
Architecture
Modules:
1.
2.
3.
4.
5.
Periodic Aggregated Converge cast.
Transmission Power Control
Aggregated Data Collection
Raw Data Collection
Tree-Based Multi-Channel Protocol (TMCP)
1. Periodic Aggregated Converge cast.
Data aggregation is a commonly used technique in WSN that can eliminate redundancy and minimize the number of
transmissions, thus saving energy and improving network lifetime. Aggregation can be performed in many ways, such as by
suppressing duplicate messages; using data compression and packet merging techniques; or taking advantage of the
correlation in the sensor readings.
We consider continuous monitoring applications where perfect aggregation is possible, i.e., each node is capable of
aggregating all the packets received from its children as well as that generated by itself into a single packet before
transmitting to its parent. The size of aggregated data transmitted by each node is constant and does not depend on the size of
the raw sensor readings.
2. Transmission Power Control
We evaluate the impact of transmission power control, multiple channels, and routing trees on the scheduling
performance for both aggregated and raw-data converge cast.. Although the techniques of transmission power control and
multi-channel scheduling have been well studied for eliminating interference in general wireless networks, their
performances for bounding the completion of data collection in WSNs have not been explored in detail in the previous
studies. The fundamental novelty of our approach lies in the extensive exploration of the efficiency of transmission power
control and multichannel communication on achieving fast converge cast operations in WSNs.
3. Aggregated Data Collection
We augment their scheme with a new set of rules and grow the tree hop by hop outwards from the sink. We assume
that the nodes know their minimum-hop counts to sink.
www.ijmer.com
2670 | Page
5. www.ijmer.com
International Journal of Modern Engineering Research (IJMER)
Vol. 3, Issue. 5, Sep - Oct. 2013 pp-2667-2673
ISSN: 2249-6645
4. Raw Data Collection
The data collection rate often no longer remains limited by interference but by the topology of the network. Thus, in
the final step, we construct network topologies with specific properties that help in further enhancing the rate. Our primary
conclusion is that, combining these different techniques can provide an order of magnitude improvement for aggregated
converge cast, and a factor of two improvement for raw-data converge cast, compared to single-channel TDMA scheduling
on minimum-hop routing trees.
5. Tree-Based Multi-Channel Protocol (TMCP)
Fig: Schedule generated with TMCP
TMCP is a greedy, tree-based, multi-channel protocol for data collection applications. It partitions the network into
multiple sub trees and minimizes the intra tree interference by assigning different channels to the nodes residing on different
branches starting from the top to the bottom of the tree. Figure shows the same tree given in Fig. which is scheduled
according to TMCP for aggregated data collection. Here, the nodes on the leftmost branch is assigned frequency F1, second
branch is assigned frequency F2 and the last branch is assigned frequency F3 and after the channel assignments, time slots
are assigned to the nodes with the BFS Time Slot Assignment algorithm.
Advantage
Advantage of TMCP is that it is designed to support converge cast traffic and does not require channel switching.
However, contention inside the branches is not resolved since all the nodes on the same branch communicate on the same
channel
www.ijmer.com
2671 | Page
6. www.ijmer.com
International Journal of Modern Engineering Research (IJMER)
Vol. 3, Issue. 5, Sep - Oct. 2013 pp-2667-2673
ISSN: 2249-6645
V.
RESULTS
Fig: Showing Results Algorithm Implemented Screen
VI.
CONCLUSION
In this paper, we studied fast converge cast in WSN where nodes communicate using a TDMA protocol to
minimize the schedule length. We addressed the fundamental limitations due to interference and half-duplex transceivers on
the nodes and explored techniques to overcome the same. We found that while transmission power control helps in reducing
the schedule length, multiple channels are more effective. We also observed that node-based (RBCA) and link-based
(JFTSS) channel assignment schemes are more efficient in terms of eliminating interference as compared to assigning
different channels on different branches of the tree (TMCP). Once interference is completely eliminated, we proved that with
half-duplex radios the achievable schedule length is lower-bounded by the maximum degree in the routing tree for
aggregated converge cast, and by max (2nk − 1, N) for raw-data converge cast. Using optimal converge cast scheduling
algorithms, we showed that the lower bounds are achievable once a suitable routing scheme is used. Through extensive
simulations, we demonstrated up to an order of magnitude reduction in the schedule length for aggregated, and a 50%
reduction for raw-data converge cast. In future, we will explore scenarios with variable amounts of data and implement and
evaluate the combination of the schemes considered.
ACKNOWLEDGMENT
I would like to express my sincere thanks to my Guide and my Co-Authors for their consistence support and
valuable suggestions.
www.ijmer.com
2672 | Page
7. www.ijmer.com
International Journal of Modern Engineering Research (IJMER)
Vol. 3, Issue. 5, Sep - Oct. 2013 pp-2667-2673
ISSN: 2249-6645
REFERENCES
[1]
[2]
[3]
[4]
[5]
[6]
[7]
[8]
[9]
[10]
[11]
S. Gandham, Y. Zhang, and Q. Huang, “Distributed time optimal scheduling for converge cast in wireless sensor networks,”
Computer Networks, vol. 52, no. 3, pp. 610–629, 2008.
K. K. Chintalapudi and L. Venkatraman, “On the design of mac protocols for low-latency hard real-time discrete control
applications over 802.15.4 hardware,” in IPSN ’08, pp. 356–367.
I. Talzi, A. Hasler, S. Gruber, and C. Tschudin, “Permasense: investigating permafrost with a wsn in the swiss alps,” in EmNets
’07, Cork, Ireland, pp. 8–12.
S. Upadhyayula and S. Gupta, “Spanning tree based algorithms for low latency and energy efficient data aggregation enhanced
convergecast (dac) in wireless sensor networks,” Ad Hoc Networks, vol. 5, no. 5, pp. 626–648, 2007.
O. D. Incel and B. Krishnamachari, “Enhancing the data collection rate of tree-based aggregation in wireless sensor networks,” in
SECON ’08, San Francisco, CA, USA, pp. 569–577.
Y. Wu, J. Stankovic, T. He, and S. Lin, “Realistic and efficient multi-channel communications in wireless sensor networks,” in
INFOCOM ’08, pp. 1193–1201.
A. Ghosh, O. D. Incel, V. A. Kumar, and B. Krishnamachari, “Multi-channel scheduling algorithms for fast aggregated
convergecast in sensor networks,” in MASS ’09, Macau, China.
V. Annamalai, S. Gupta, and L. Schwiebert, “On tree-based convergecasting in wireless sensor networks,” in WCNC ’03, vol. 3,
pp. 1942–1947.
X. Chen, X. Hu, and J. Zhu, “Minimum data aggregation time problem in wireless sensor networks,” in MSN ’05, pp. 133–142.
H. Choi, J. Wang, and E. Hughes, “Scheduling for information gathering on sensor network,” Wireless Networks (Online), 2007.
M. Pan and Y. Tseng, “Quick convergecast in zigbee beaconenabled tree-based wireless sensor networks,” Computer
Communications, vol. 31, no. 5, pp. 999–1011, 2008.
www.ijmer.com
2673 | Page