A Dynamic Resource Synchronizer Mutual Exclusion Algorithm for Wired/Wireless Distributed Systems

Sharieh, Ahmad; Itriq, Mariam; Dbabat, Wafa

doi:10.3844/ajassp.2008.829.834

Cited by 3 publications

(2 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This may occur in deployments in which sensors in one area of interest are requested to gather and transmit data at a higher rate than In this case, routing dynamics can lead to congestion on specific paths. These paths are usually close to each other, which lead to an entire zone in the network facing congestion (Alfawaer et al, 2007;Hull et al, 2004;Sharieh et al, 2008). We refer to this zone, essentially an extended hotspot, as the congestion zone.…”

Section: Introductionmentioning

confidence: 99%

Performance Analysis of Congestion Reduction Routing in Wireless Sensor Networks

Sundararajan¹

2011

Journal of Computer Science

View full text Add to dashboard Cite

Problem statement: Data generated in wireless sensor networks may not all be alike: some data may be more important than others and hence may have different delivery requirements, To solve this problem addressed a differentiated data delivery in the presence of congestion in wireless sensor networks and proposed a class of algorithms that enforce differentiated routing based on the congested areas of a network and data priority. Approach: The basic protocol, called Congestion-Reduction Routing (CRR), discovers the congested zone of the network that exists between high-priority data sources and the data sink and using simple forwarding rules, dedicates this portion of the network to forwarding primarily high-priority traffic. Since CRR requires some overhead for establishing the high-priority routing zone, it is unsuitable for highly mobile data sources. To accommodate all these things defined MAC-Enhanced CRR (MCRR), which includes MAC-layer enhancements and a protocol for forming high-priority paths on the fly for each burst of data. MCRR effectively handles the mobility of high-priority data sources, at the expense of degrading the performance of low-priority traffic and presented an extensive simulation results for CRR and MCRR and an implementation of MCRR on a 48-node testbed. Results: Proposed CRR and MCRR algorithms were implemented by using NS2 simulator and the QOS parameters on throughput, packet delivery ratio, delay and energy. All parameters were analyzed and compared with basic AODV mechanism. Conclusion/Recommendations: CRR is better suited for static networks with long-duration HP floods. For bursty HP traffic and/or mobile HP sources, MCRR is a better fit. Because of the lower delay, CRR and its variants appear suitable to real-time data delivery.

show abstract

Section: Introductionmentioning

confidence: 99%

Performance Analysis of Congestion Reduction Routing in Wireless Sensor Networks

Sundararajan¹

2011

Journal of Computer Science

View full text Add to dashboard Cite

show abstract

“…A simple mathematical approach for delay analysis for WiMax networks has been presented in (Sharieh et al, 2008). Scheduling strategies for multimedia networks has been presented.…”

Section: Introductionmentioning

confidence: 99%

Dynamic Bandwidth Allocation for Multiple Traffic Classes in IEEE 802.16e WiMax Networks: A Petrinet Approach

Geetha¹

2011

Journal of Computer Science

View full text Add to dashboard Cite

Problem statement: WiMAX supports multiple types of traffic such as data, voice and video. Each flow requires a certain minimum bandwidth to achieve its QoS. Bandwidth allocation to traffic classes should be in such a way that fairness criteria is met with. Hence, we propose a dynamic bandwidth allocation mechanism to achieve fair and efficient allocation. Approach: We present a Generalized Stochastic Petri Net (GSPN) approach to model bandwidth allocation in Broadband Wireless Access (BWA) networks with multiple traffic classes. A dynamic weight assignment mechanism is proposed to enable fair bandwidth allocation among the competing traffic classes. Performance of the weight assignment mechanism is analytically evaluated using the GSPN model developed. Results: Results show performance improvement in terms of mean delay and normalized throughput of traffic classes compared to existing mechanisms. Simulation is carried out for different traffic rates. Analytical results are validated using simulations. Conclusion: Performance of the proposed system is evaluated in terms of mean delay and normalized system throughput. The model developed is generic and can be extended to any wireless network with multiple traffic classes.

show abstract

A mathematical model for hybrid-multi-cloud environment

Sharieh

Al-Thwaib

2017

2017 8th International Conference on Information Technology (ICIT)

View full text Add to dashboard Cite

A Dynamic Resource Synchronizer Mutual Exclusion Algorithm for Wired/Wireless Distributed Systems

Cited by 3 publications

References 12 publications

Performance Analysis of Congestion Reduction Routing in Wireless Sensor Networks

Performance Analysis of Congestion Reduction Routing in Wireless Sensor Networks

Dynamic Bandwidth Allocation for Multiple Traffic Classes in IEEE 802.16e WiMax Networks: A Petrinet Approach

A mathematical model for hybrid-multi-cloud environment

Contact Info

Product

Resources

About