2010
DOI: 10.1109/tnet.2009.2032181
|View full text |Cite
|
Sign up to set email alerts
|

Delay Analysis for Wireless Networks With Single Hop Traffic and General Interference Constraints

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

3
51
0

Year Published

2011
2011
2017
2017

Publication Types

Select...
7
1

Relationship

0
8

Authors

Journals

citations
Cited by 54 publications
(54 citation statements)
references
References 22 publications
3
51
0
Order By: Relevance
“…Kim et al (2010), the author concerned in reducing the delay and enhancing the life span of the WSN for which procedures occur occasionally. A group of wireless networks with common intrusion constraints on the links that can be provided concurrently at specified time (Gupta and Shroff, 2010).…”
Section: Literature Reviewmentioning
confidence: 99%
“…Kim et al (2010), the author concerned in reducing the delay and enhancing the life span of the WSN for which procedures occur occasionally. A group of wireless networks with common intrusion constraints on the links that can be provided concurrently at specified time (Gupta and Shroff, 2010).…”
Section: Literature Reviewmentioning
confidence: 99%
“…There are three types of MAC 802.11 frames, data, control and management (Gupta and Shroff, 2010). The wireless IDS is unique in that it detects attacks against the 802.11 frame at layer two of the wireless network.…”
Section: Related Workmentioning
confidence: 99%
“…This wireless interface must be in monitor mode, the operator also known as RFMON mode, this mode is similar to promiscuous mode for installation materials and the device can accept incoming traffic (Gupta and Shroff, 2010). Another important aspect of wireless IDS is that the monitoring interfaces between the 12 channels available to wireless networks.…”
Section: Related Workmentioning
confidence: 99%
“…In a contemporary but independent work, Gupta and Shroff [5], [6] have recently upper bounded the expected delay for a different version of the MWS algorithm, where the the queuelength Q i for any link i is weighted by w i = 1 µi−λi while computing the maximum weighted schedule (independent set). The delay bound is expressed in terms of the additional parameters (µ i , i = 1, .…”
Section: Upper Bounds On Expected Delaymentioning
confidence: 99%
“…In a contemporary but independent work, Gupta and Shroff [6] have obtained lower bounds for delays for arbitrary policies in arbitrary networks. Since our goal has been to show the tightness of the upper bounds for MWS and RS, we have focused on specific classes of networks.…”
Section: Proof Of Theoremmentioning
confidence: 99%