Analysis of Wireless CSMA/CA Network Using Single Station Superposition (SSS)

Khattab, Tamer; El-Hadidi, Mahmoud T.; Mourad, Hebat-Allah M.

doi:10.1078/1434-8411-54100076

Cited by 18 publications

(8 citation statements)

References 3 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…The processing time is negligible for route reply forwarding since replies are not hop-by-hop authenticated and negligible processing is required at an intermediate node. The MAC-layer delay for the binary exponential backoff for light to moderate loads has the mean T MAC = Gn 2 ( [44][45][46]), where G is the proportionality constant that depends on the network load, and n is the number of nodes contending for transmission which is equal to the number of first hop neighbors (pr 2 d) here. According to [44,45], G = 0.01.…”

Section: Memory Overheadmentioning

confidence: 99%

MobiWorp: Mitigation of the wormhole attack in mobile multihop wireless networks

2008

View full text Add to dashboard Cite

Section: Memory Overheadmentioning

confidence: 99%

MobiWorp: Mitigation of the wormhole attack in mobile multihop wireless networks

2008

View full text Add to dashboard Cite

“…In both papers, the transition from state to another on the Markov model occurs during time intervals that are random. Authors of [4] used a STA Markov model along with another channel Markov model to find the throughput of the channel used by a number of finite loaded STAs with Poisson arrival process. It was then possible to model the channel's state (idle or busy) separately.…”

Section: Introductionmentioning

confidence: 99%

“…In the present paper, we modify the STA model used in [3] to have a constant transition time equal to the slot time. In addition, the channel model presented in [4] is used along with M/G/I queuing analysis to define the system parameters needed to model the channel throughput under finite load conditions. The rest of the paper is organized as follows: in section 2 we give a brief overview of the DCF protocol.…”

Section: Introductionmentioning

confidence: 99%

Throughput analysis of IEEE 802.11 DCF under finite load traffic

Zaki

El-Hadidi

2004

First International Symposium on Control, Communications and Signal Processing, 2004.

View full text Add to dashboard Cite

Despite the widespread deployment of IEEE 802.1 1 Wireless Local Area Network (WLAN) protocol, not much analysis has been done on modeling its performance. In this paper, we modify a previously introduced station model along with a channel model to deduce the channel throughput under finite load traffic. Our approach allows modeling of all system parameters like the channel state and the average service time of a frame. Although our model assumes a Poisson arrival process, the proposed approach could be easily extended to more general processes.

show abstract

“…In order to compare the delay between SPMS and SPIN for a single source-destination pair in the failure free case, we take expressions (1) and (2) and plot the ratio of the delays with respect to increasing transmission radius in Figure 3. Consider sample values of T tx = 0.05, T proc = 0.02, A:D = 1:30, G= 0.01 and, as given by [9], n1 = 45 and ns = 5. These values assume a uniform density of nodes on the grid and consider that by increasing each power level, the number of links between two nodes is reduced by one.…”

Section: Case Ac) K Relay Nodes Between a And Cmentioning

confidence: 99%

“…The propagation delay is assumed to be zero. T csma is the delay to access a channel, which is taken to be proportional to n 2 , where n is the number of nodes in the transmission radius ( [8], [9]) 1 . Let G be the proportionality constant.…”

Section: Delay Analysismentioning

confidence: 99%

Fault tolerant energy aware data dissemination protocol in sensor networks

Khanna

Bagchi

2004

International Conference on Dependable Systems and Networks, 2004

View full text Add to dashboard Cite

In this paper we present a data dissemination protocol for efficiently distributing data through a sensor network in the face of node and link failures. Our work is motivated by the SPIN protocol which uses metadata negotiation to minimize data transmissions. We propose a protocol called Shortest Path Minded SPIN (SPMS) in which every node has a zone defined by its maximum transmission radius. A node which is a data source advertises the availability of data to all the nodes in its zone using a metadata descriptor. Any interested node requests the data and gets sent the data using multi-hop communication via the shortest path. The failure of any node in the path is detected and recovered using backup routes. We build simulation models to compare SPMS against SPIN. Different scenarios including mobility and node failures are simulated. The simulation results show that SPMS reduces the delay over 10 times and consumes 30% less energy in the static failure free scenario. Even with the addition of mobility, SPMS outperforms SPIN by energy gains between 5% and 21%.An analytical model is also constructed to compare the two protocols under a simplified topology.

show abstract

Analysis of Wireless CSMA/CA Network Using Single Station Superposition (SSS)

Cited by 18 publications

References 3 publications

MobiWorp: Mitigation of the wormhole attack in mobile multihop wireless networks

MobiWorp: Mitigation of the wormhole attack in mobile multihop wireless networks

Throughput analysis of IEEE 802.11 DCF under finite load traffic

Fault tolerant energy aware data dissemination protocol in sensor networks

Contact Info

Product

Resources

About