A joint scheduling, power control, and routing algorithm for ad hoc wireless networks

Li, Yun; Ephremides, Anthony

doi:10.1016/j.adhoc.2006.04.005

Cited by 75 publications

(39 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Finally it schedules the links in order using the bottom-up approach. Note that if we employ the increasing order and if we do not consider a backlogged system (without considering the links' queuing lengths), the LSPC algorithm becomes the same as the JSPCA algorithm introduced in (Li & Ephremides, 2007).…”

Section: Non-matching Based Algorithmsmentioning

confidence: 99%

“…We now introduce the two non-matching based scheduling algorithms proposed in (Li & Ephremides, 2007). The simplified scheduling algorithm first sorts the links in an increasing order of their link metrics, and then picks each link in order while giving it a power level which is the smaller value of its linear power assignment (a power assignment proportional to its link length to the power of the path loss exponent) and its maximum allowable power level.…”

Section: Non-matching Based Algorithmsmentioning

confidence: 99%

“…In the second phase, this algorithm tries to find an "admissible" link independent set satisfying the SINR constraints by using the LISRA algorithm in each link removal step. A variation of the two-phase link scheduling algorithm has been presented in (Li & Ephremides, 2007). This algorithm first defines a link metric which is a combination of the link's queue length and the number of blocked links (the number of links sharing either a transmitter node or a receiver node of the current link).…”

Section: Top-down Approachmentioning

confidence: 99%

“…THEOREM 3: The following top-down based link scheduling algorithms have a worst case lower bound of ( ) Ω n : the two phase scheduling algorithm (Elbatt & Ephremides, 2002), the variation of the two phase scheduling algorithm (Li & Ephremides, 2007), the ISPA algorithm (Behzad & Rubin, 2007), the Algorithm A (Kozat et al, 2006) and the heuristic link scheduling in (Das et al, 2005).…”

Section: Algorithms Inefficiency Analysesmentioning

confidence: 99%

“…The two bottom-up based link scheduling algorithms, i.e., the simplified scheduling algorithm in (Li & Ephremides, 2007) and the GreedyPhysical algorithm in (Brar, Blough & Santi, 2006), have a worst case lower bound ( ) Ω n .…”

Section: Theoremmentioning

confidence: 99%

See 4 more Smart Citations

Joint Link Scheduling and Topology Control for Wireless Sensor Networks with SINR Constraints

Hua

Lau

Handbook of Research on Developments and Trends in Wireless Sensor Networks

View full text Add to dashboard Cite

This chapter studies the joint link scheduling and topology control problems in wireless sensor networks. Given arbitrarily located sensor nodes on a plane, the task is to schedule all the wireless links (each representing a wireless transmission) between adjacent sensors using a minimum number of timeslots. There are two requirements for these problems: first, all the links must satisfy a certain property, such as that the wireless links form a data gathering tree towards the sink node; second, all the links simultaneously scheduled in the same timeslot must satisfy the SINR constraints. This chapter focuses on various scheduling algorithms for both arbitrarily constructed link topologies and the data gathering tree topology. We also discuss possible research directions.

show abstract

Section: Non-matching Based Algorithmsmentioning

confidence: 99%

Section: Non-matching Based Algorithmsmentioning

confidence: 99%

Section: Top-down Approachmentioning

confidence: 99%